Abstract
We show that quasi-metric or quasi-uniform spaces provide, inter alia, a common generalization of cpo's and metric spaces as used in denotational semantics. To accommodate the examples suggested by computer science, a reworking of basic notions involving limits and completeness is found to be necessary. Specific results include general fixed point theorem and a sequential completion construction.
Preview
Unable to display preview. Download preview PDF.
References
G. Berthiaume, On quasi-uniformities in hyperspaces, Proc. Am. Math. Soc. 66 (1977), 335–342.
N. Bourbaki, Elements of Mathematics. General Topology; Part 1 Addison-Wesley 1966.
A.Csaszar, Foundationsof General Topology, Pergamon 1963.
P.Fletcher, W.Lindgren, Quasi-uniform Spaces, Marcel Dekker 1982.
M. Hennessy, G. Plotkin, A term model for CCS, Proc. 9th MFCS, LNCS 88 (1980), 261–274.
G.Gierz et al., A Compendium of Continuous Lattices, Springer 1980.
F. Lawvere, Metric spaces, generalized logic, and closed categories Rend. del Sem. Mat. e Fis. di Milano XLIII (1973), 135–166.
N. Levine, W. Stager, On the hyperspace of a quasi-uniform space, Math. J. Okayama Univ. 15 (1971–2), 101–106.
A.Melton, D.Schmidt, A topological framework for cpo's lacking bottom elements, Unpublished memo (1985).
R. Milner, A modal characterization of observable machine behaviour CAAP '81, LNCS 112 (1981), 25–34.
R.Milner, A Calculus of Communicating Sequences, Springer LNCS 92 1980.
G.Plotkin, Lecture Notes on Domain Theory (Edinburgh: unpublished)
D. Scott, Domains for denotational semantics, ICALP '82, LNCS 140 (1982), 577–613.
M. Smyth, Power domains and predicate transformers, ICALP '83, LNCS 154 (1983), 662–675.
M. Smyth, Finite approximation of spaces, Category Theory and Computer Programming, ed. D.Pitt et al., LNCS 240 (1986), 225–241.
M.Smyth, Quasi-uniformities as a unifying theme, Unpublished ms., 1986.
M. Hennessy, R. Milner, On observing nondeterminism and concurrency ICALP '80, LNCS 85 (1980), 299–309.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smyth, M.B. (1988). Quasi-uniformities: Reconciling domains with metric spaces. 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_12
Download citation
DOI: https://doi.org/10.1007/3-540-19020-1_12
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