Abstract
In this paper we survey some of the basic properties of continuously ordered sets, especially those properties that have led to their employment as the underlying structures for constructions in denotational semantics. The earlier sections concentrate on the order-theoretic aspects of continuously ordered sets and then specifically of domains. The last two sections are concerned with two natural topologies for sets with continuous orders, the Scott and Lawson topologies.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. J. Day and G. M. Kelly, “On topological quotient maps preserved by pull-backs or products,” Proc. of the Cambridge Phil. Soc. 67 (1970), 553–558.
J. Dugundji, Topology, Allyn and Bacon, Boston, 1964.
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. Scott, A Compendium of Continuous Lattices, Springer-Verlag, Heidelberg, 1980.
R.-E. Hoffmann, “Continuous posets, prime spectra of completely distributive complete lattices, and Hausdorff compactifications,” Continuous Lattices, Lecture Notes in Mathematics 871, edited by B. Banaschewski and R.-E. Hoffmann, Springer-Verlag, 1981, 125–158.
R.-E. Hoffmann, “Projective sober spaces,” Continuous Lattices, Lecture Notes in Mathematics 871, edited by B. Banaschewski and R.-E. Hoffmann, Springer-Verlag, 1981, 125–158.
K. H. Hofmann and J. D. Lawson, “The spectral theory of distributive continuous lattices,” Trans. Amer. Math. Soc. 246 (1978), 285–310.
K. H. Hofmann, M. Mislove, and A. Stralka, The Pontryagin Duality of Compact 0-Dimensional Semilattices and its Applications, Lecture Notes in Mathematics 396, Springer-Verlag, 1974.
J. R. Isbell, “Function spaces and adjoints,” Symposia Math. 36 (1975), 317–339.
R. E. Jamison, A general theory of convexity, Doctoral Dissertation, University of Washington, 1974.
T. Kamimura and A. Tang, “Retracts of SFP objects,” Lecture Notes in Computer Science 239, Springer-Verlag, 1986, 135–148.
T. Kamimura and A. Tang, “Domains as finitely continuous CPO's,” preprint.
K. Keimel and G. Gierz, “Halbstetige Funktionen und stetige Verbände,” Continuous Lattices and Related Topics, Proceedings of the Conference on Topological and Categorical Aspects of Continuous Lattices (Workshop V), edited by R.-E. Hoffmann, Mathematik-Arbeitspapiere, Universität Bremen 27, 1982, 59–67.
R. Kopperman, “All topologies come from generalized metrics,” Amer. Math. Monthly, (to appear).
P. Th. Lambrinos and B. Papadopoulos, “The (strong) Isbell topology and (weakly) continuous lattices,” Continuous Lattices and Their Applications, edited by R.-E. Hoffman and K. H. Hofmann, Marcel Dekker, 1985, 191–211.
J. D. Lawson, “The duality of continuous posets,” Houston J. Math. 5 (1979), 357–386.
G. Markowsky, “Chain-complete posets and directed sets with applications,” Algebra Univ. 6 (1976), 53–68.
G. Markowsky and B. K. Rosen, “Bases for chain-complete posets,” IBM Journal of Research and Development 20 (1976), 138–147.
G. D. Plotkin, “A powerdomain construction,” SIAM J. Comp. 5 (1976), 452–487.
D. Scott, “Outline of a mathematical theory of computation,” Proc. 4th Ann. Princeton Conf. on Inform. Sci. and Systems, 1970, 169–176.
D. Scott, “Continuous lattices,” Toposes, Algebraic Geometry, and Logic, Springer LNM 274, Springer-Verlag, Berlin, 1972.
D. Scott, “Data types as lattices,” SIAM Journal on Computing 5 (1976), 522–587.
F. Schwarz and S. Weck, “Scott topology, Isbell topology and continuous convergence,” Continuous Lattices and Their Applications, edited by R.-E. Hoffmann and K. H. Hofmann, Marcel Dekker, 1985, 251–273.
M. Smyth, “The largest cartesian closed category of domains,” Theoretical Computer Sci. 27 (1983), 109–119.
M. Smyth, “Powerdomains and predicate transformers: a topologica view,” ICALP 83, Lecture Notes in Computer Science 154, edited by J. Diaz, Springer-Verlag, 1983, 662–676.
M. Van de Vel, “Lattices and semilattices: a convex point of view,” Continuous Lattices and Their Applications, edited by R.-E. Hoffmann and K. H. Hofmann, Marcel Dekker, 1985, 279–302.
G. Winskel and K. Larsen, “Using information systems to solve recursive domain equations effectively,” Semantics of Data Types, Lecture Notes in Computer Science 173 edited by G. Kahn and G. D. Plotkin, Springer-Verlag, 1984, 109–130.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lawson, J.D. (1988). The versatile continuous order. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-19020-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19020-2
Online ISBN: 978-3-540-38920-0
eBook Packages: Springer Book Archive