Continuity spaces: Reconciling domains and metric spaces

Theoretical Computer Science

Volumn 177, Issue 1, 1997, Pages 111-138

  Flagg, Bob ^a   Kopperman, Ralph ^b  

^a UNIVERSITY OF SOUTHERN MAINE   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; PROGRAMMING THEORY;

CONTINUITY SPACES; METRIC SPACES; SEMANTIC DOMAINS;

COMPUTATIONAL LINGUISTICS;

EID: 0031125836     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00236-3     Document Type: Article

References (35)

1. S. Abramsky and S. Vickers, Quantales, observational logic and process semantics, Math. Struct. Comput. Sci. 3 (1993) 161-227.
2. P. America and J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, J. Comput. System. Sci. 39(3) (1989) 343-375.
3. J. deBakker and J. Zucker, Processes and the denotational semantics of concurrency, Inform. and Control 54 (1982) 70-120.
4. R. Engelking, Outline of General Topology (North-Holland, Amsterdam, 1968).
5. R.C. Flagg, Completeness in continuity spaces, in: R.A.G. Seely, ed., Category Theory 1991 (AMS, Providence, RI, 1992) 183-199.
6. R.C. Flagg, Quantales and continuity spaces, Algebra Universalis, to appear.
7. R.C. Flagg and R. Kopperman, Fixed points and reflexive domain equations in categories of continuity spaces, MFPS 11, Electronic Notes in Theoretical Computer Science, Vol. I, 1995.
8. R.C. Flagg and R. Kopperman, Tychonoff poset structures and auxiliary relations, Proceedings of the 10th Summer Conference on General Topology and Applications (New York Academy of Sciences, 1994).
9. P. Fletcher and W.F. Lindgren, Quasi-Uniform Spaces (Marcel-Dekker, New York, 1982).
10. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove and D. Scott, A Compendium of continuous lattices (Springer, Heidelberg, 1980).
11. M. Hennessy, Algebraic theory of processes (MIT Press, Cambridge, MA, 1988).
12. M. Henriksen and R. Kopperman, A general theory of structure spaces with applications to spaces of prime ideals, Algebra Universalis 28 (1991) 349-376.
13. P.T. Johnstone, Stone Spaces (Cambridge Univ. Press, Cambridge, 1982).
14. M. Katz, Real-valued models with metric equality and uniformly continuous predicates, J. Symbolic Logic 47 (1983) 772-792.
15. R. Kopperman, All topologies come from generalized metrics, Amer. Math. Monthly 95 (1988) 89-97.
16. R. Kopperman, Asymmetry and duality in topology, Topology Appl. 66 (1995) 1-39.
17. D. Kozen, Semantics of probabilistic programs, J. Comput. System Sci. 22 (1981) 328-350.
18. H.P.A. Künzi and G.C.L. Brümmer, Sobrification and bicompletion of totally bounded quasi-uniform spaces, Math. Proc. Cambridge Philos. Soc. 101 (1987) 237-247.
19. J.D. Lawson, The versatile continuous order, in: M. Mislove, ed., Mathematical Foundations of Programming Language Semantics (Springer, Berlin, 1989) 134-160.
20. F.W. Lawvere, Metric spaces, generalized logic, and closed categories, Rend. Sem. Mat. Fis. Milano 43 (1973) 135-166.
21. E. Moggi, Notions of computation and monads, Inform. Comput. 93 (1991) 55-92.
22. A.M. Pitts, Evaluation logic, in: G. Birtwistle, ed., Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science (Springer, Berlin, 1992).
23. G.D. Plotkin, Post-graduate lecture notes in advanced domain theory, Dept. of Computer Science, Univ. of Edinburgh, 1981.
24. G.N. Raney, Completely distributive lattices, Proc. Amer. Math. Soc. 3 (1952) 677-680.
25. N. Saheb-Djahromi, CPO's of measures for nondeterminism, Theoret. Comput. Sci. 12 (1980) 19-37.
26. D.A. Schmidt, Denotational Semantics: A Methodology for Language Development (Allyn and Bacon, Boston, 1986).
27. B. Schweizer and A. Sklar, Probabilistic Metric Spaces (North-Holland, Amsterdam, 1983).
28. D.S. Scott and C. Strachey, Towards a mathematical semantics for computer languages, in: Proc. Symp. on Computers and Automata (Polytechnic Institute of Brooklyn Press, New York, 1971) 19-46.
29. D.A. Sibley, A metric for weak convergence of distribution functions, Rocky Mountain J. Math. 1 (1971) 427-430.
30. M.B. Smyth, Quasi-uniformities: reconciling domains with metric spaces, in: 3rd Workshop on Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Vol. 298 (Springer, Berlin, 1987).
31. M.B. Smyth, Totally bounded spaces and compact ordered spaces as domains of computation, in: J.G.M. Reed, A.W. Roscoe and R.F. Wachter, Topology and Category Theory in Computer Science eds., (Oxford Univ. Press, Oxford, 1991) 207-229.
32. M.B. Smyth, Stable local compactification I, J. London Math. Soc. 45 (1992) 321-340.
33. P. Sünderhauf, Constructing a quasi-uniform function space, Topology Appl. 67 (1995) 1-27.
34. K.R. Wagner, Solving recursive domain equations with enriched categories, Tech. Report cmu-cs-94-159, Carnegie Mellon University, July 1994.
35. A. Schalk, Domains arising as algebras for powerspace constructions, J. Pure Appl. Algebra (1993).