Abstract
Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhaps the most widely-used method for devising semantic models for such languages. This paper is a survey of some generalizations of domain theory that have arisen in efforts to solve related problems. In each case, a description is given of the problem and of the solution generalizing domain theory it inspired. The problems range from the relation of domain theory to other approaches for providing semantic models, particularly in process algebra, to issues surrounding the notion of a computational model, an approach inspired by the recent work of Abbas Edalat.
This work partially supported by the US Office of Naval Research
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramsky, S. A domain equation for bisimulation. Information and Computation 92 (1991), 161–218.
Abramsky, S., Jung, A. Domain Theory, in: Handbook of Computer Science and Logic, Volume 3 (1994), Clarendon Press
Brookes, S. D., Hoare, C. A. R., Roscoe, A. W. A theory of communicating sequential processes. Journal ACM 31 (1984), 560–599.
Brookes, S. D., Roscoe, A. W. An improved failures model for communicating processes. Lecture Notes in Computer Science 197 (1985) 281–305.
Edalat, A. Dynamical systems, measures and fractals via domain theory. Information and Computation 120 (1995), 32–48.
Edalat, A. Domain theory in learning processes. Electronic Notes in Theoretical Computer Science 1 (1995), URL: http://www.elsevier.com/locate/entcs/volume1.html.
Edalat, A. Domain theory and integration. Theoretical Computer Science 151 (1995), 163–193.
Edalat, A. When Scott is weak at the top. Mathematical Structures in Computer Science, to appear.
Edalat, A., Heckmann, R. A computational model for metric spaces. Theoretical Computer Science, to appear.
Edalat, A., Potts, P. A new representation for exact real numbers. Electronic Notes in Theoretical Computer Science 6(1997), URL: http://www.elsevier.com/locate/entcs/volume 6.html.
Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J., Mislove, M., Scott, D. “A Compendium of Continuous Lattices.” Springer-Verlag, Berlin, Heidelberg, New York (1980) 326pp.
Hennessy, M., Plotkin. G. Full abstraction for a simple parallel programming language. Lecture Notes in Computer Science 74 (1979) Springer-Verlag.
Lawson, J. Spaces of maximal points, Mathematical Structures in Computer Science, to appear.
Martin, K. Ph.D. thesis, Tulane University, in preparation.
Mislove, M. Algebraic posets, algebraic cpo's and models of concurrency, in: Topology and Category Theory in Computer Science. G. M. Reed, A. W. Roscoe and R. Wachter, editors, Clarendon Press (1991), 75–111.
Mislove. M. Denotational models for unbounded nondeterminism. Electronic Notes in Theoretical Computer Science 1 (1995), URL: http://www.elsevier.com/locate/entcs/volume1.html
Mislove, M. Using duality to solve domain equations. Electronic Notes in Theoretical Computer Science 6(1997), URL: http://www.elsevier.nl/locate/entcs/volume6.html.
Mislove, M. Topology, domain theory and theoretical computer science. Topology and Its Applications, to appear.
Mislove, M., Roscoe, A. W., Schneider, S. A. Fixed points without completeness. Theoretical Computer Science 138 (1995), 273–314.
Plotkin, G. D. A powerdomain for countable nondeterminism. Lecture Notes in Computer Science 140 (1982).
Smyth, M. Effectively given domains. Theoretical Computer Science 5 (1977) 257–274.
Smyth, M. Power domains and predicate transformers: a topological view. Lecture Notes in Computer Science 154 (1983) Springer-Verlag, 662–675.
Reed, G. M., Roscoe, A. W. Metric spaces as models for real-time concurrency. Lecture Notes in Mathematics 298 (1988), 331–343.
Roscoe, A. W., Barrett, G. Unbounded nondeterminism in CSP. Lecture Notes in Computer Science 442 (1990).
Schneider, S. A. An operational semantics for timed CSP. Information and Computation 116 (1995).
Stoltenberg-Hansen, A., Lindström, I., Griffor, E. B. “Mathematical Theory of Domains.” Cambridge Tracts in Theoretical Computer Science 22 (1994), Cambridge University Press, 349pp.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mislove, M. (1998). Generalizing domain theory. In: Nivat, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1998. Lecture Notes in Computer Science, vol 1378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053538
Download citation
DOI: https://doi.org/10.1007/BFb0053538
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64300-5
Online ISBN: 978-3-540-69720-6
eBook Packages: Springer Book Archive