Abstract
This survey article provides an overview of recent developments that represent typical interplays between topology and continuous domain theory. The topics highlighted include locally compact spaces, spectral theory, round-ideal completions, ordered spaces, maximal-point spaces, and the probabilistic power domain The article attempts to develop the thesis that topological tools are useful for the investigation of order-theoretic structures arising in theoretical computer science and the latter in turn suggest new research directions in topology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S. and Jung, A., Domain theory, In: S. Abramsky et al. (editors), Handbook of Logic in Computer Science 3 , Clarendon Press, 1995.
Bourbaki, N., General Topology, (English Translation), Springer Verlag, 1989.
Davey, B. and Priestley, H., Introduction to Lattices and Order, Cambridge University Press 1990.
Day, B. J. and Kelly, G. M., On topological quotient maps preserved by pullbacks or products, Proc. Cambridge Phil. Soc. 67 (1970), 553-558.
Dellacherie, C., Un cours sur les ensembles analytiques, In: Analytic Sets, Academic Press, 1980, 184-316.
Edalat, A., Domain theory and integration, Theoretical Computer Sci. 151 (1995), 163-193.
Edalat, A., Dynamical systems, measures and fractals via domain theory, Information and Computation 120 (1) (1995), 32-48.
Edalat, A., Power domains and iterated function system, Information and Computation 124 (1996), 182-197.
Edalat, A., When Scott is weak on the top, Math. Structures Comput. Sci. 7 (1997), 401-417.
Edalat, A., Domains for computation in mathematics, physics and exact real arithmetic, Bull. Symbolic Logic 3 (1997), 401-452.
Edalat, A. and Heckmann, R., A computational model for metric spaces, Theoret. Comput. Sci. 193 (1998), 53-73..
Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M., and Scott, D., A Compendium of Continuous Lattices, Springer-Verlag, 1980.
Graham, S., Closure properties of a probabilistic domain construction, In: M. Main, A. Melton, and M. Mislove (editors), Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 298, Springer Verlag, 1988, 213-233.
Hoffmann, R.-E., The Fell compactification revisited, In: R.-E. Hoffmann and K. Hofmann (editors), Continuous Lattices and Their Applications, Marcel Dekker, 1985, 57-116.
Hofmann, K. H. and Lawson, J., The spectral theory of distributive continuous lattices. Trans. Amer. Math. Soc. 246 (1978), 285-310.
Hofmann, K. H. and Mislove, M., Local compactness and continuous lattices, in: Continuous Lattices, edited by B. Banaschewski and R.-E. Hoffmann, Springer LNM 871, Springer-Verlag, 125-158.
Johnstone, P. T., Stone Spaces, Vol. 3 of Cambridge Studies in Advanced Mathematics, Cambridge Press, Cambridge, 1982.
Jones, C., Probabilistic Non-determinism, PhD thesis, University of Edinburgh, 1989.
Jones, C. and Plotkin, G., A probabilistic powerdomain of evaluations, In: Logic in Computer Sci., IEEE Computer Soc. Press, 1989, 186-195.
Kamimura, T., and Tang, A., Total objects of domains Theoretical Computer Sci. 34 (1984), 275-288.
Kopperman, R., Asymmetry and duality in topology, Topology and its Appl. 66 (1995), 1-39.
Lacombe, D., Quelques procédés de définitions en topologie re-cursif, In: North-Holland, 1959, 129-158.
Lawson, J., The duality of continuous posets. Houston J. Math. 5 (1979), 357-394.
Lawson, J., Valuations on continuous lattices, In: Proceedings of the 2nd Bremen Conference, University of Bremen, 1982, 204-225.
Lawson, J., The versatile continuous order, In: M. Main, A. Melton, and M. Mislove (editors), Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 298, Springer Verlag, 1988, 134-160.
Lawson, J., Order and strongly sober compactifications, In: G. Reed, A. Roscoe, and R. Wachter (editors), Topology and Category Theory in Computer Science, Oxford Press, 1991, 179-205.
Lawson, J.Spaces of maximal points, Math. Struct. in Comp. Sci. 7 (1997), 543-555.
Lawson, J. Computation on metric spaces via domain theory, Topology and Its Applications 85 (1998), 247-263.
Lawson, J. The round ideal completion via sobrification, Topology Proceedings, Vol. 22, 1997, 261-274.
Lawson, J. The upper interval topology, property M, and compactness, Electronic Notes in Theoretical Comp. Sci. 13 (1998).
Martin, K., The measurement process in domain theory, preprint.
Martin-Löf, P., Notes on Constructive Mathematics, Almquist & Wiksell, 1970.
Mislove, M., Topology, domain theory and theoretical computer science, Topology and its Appl. 89 (1998), 3-59.
Nachbin, L., Topology and Order, Van Nostrand, 1965.
Norberg, T., Existence theorems for measures on continuous posets, with applications to random set theory, Math. Scand. 64 (1989), 15-51.
Saheb-Djahromi, N., CPO’s of measures for nondeterminism, Theoretical Computer Sci. 12 (1980), 19-37.
Scott, D., Outline of the mathematical theory of computation, In: Proc. 4th Princeton Conference on Information Science, 1970, 169-176.
Smyth, M., Effectively given domains, Theoretical Computer Sci. 5 (1977), 257-274.
Weihrauch, K. and Schreiber, U., Embedding metric spaces into cpo’s, Theoretical Computer Sci. 16 (1981), 5-24.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this paper
Cite this paper
Lawson, J.D. (2001). Encounters Between Topology and Domain Theory. In: Keimel, K., Zhang, GQ., Liu, YM., Chen, YX. (eds) Domains and Processes. Semantic Structures in Computation, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0654-5_1
Download citation
DOI: https://doi.org/10.1007/978-94-010-0654-5_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3859-1
Online ISBN: 978-94-010-0654-5
eBook Packages: Springer Book Archive