A characterization of partial metrizability: Domains are quantifiable

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 409-432

  Schellekens, M P ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

(Weightable) Quasi metrics; Directed partial orders; Partial metrics; Valuations

Indexed keywords

ALGEBRA; COMPUTATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TOPOLOGY;

PARTIAL METRICS;

COMPUTER SCIENCE;

EID: 0043031297     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00705-3     Document Type: Conference Paper

References (47)

1. G. Birkhoff, Lattice Theory, Vol. 25, AMS Colloquium Publications, Providence, RI, 1984.
2. Bonsangue M.M., van Breugel F., Rutten J.J.M.M. Generalized metric spaces. completion, topology, and powerdomains via the Yoneda embedding Theoret. Comput. Sci. 193:1998;1-51.
3. Bukatin M.A., Scott J.S. Towards computing distances between programs via Scott domains. Adian S., Nerode A. Logical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 1234:1997;33-43 Springer, Berlin.
4. Bukatin M.A., Shorina S.Y. Partial metrics and co-continuous valuations. Nivat M. Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science. Vol. 1378:1998;Springer, Berlin.
5. Crawley P., Dilworth R.P. Algebraic Theory of Lattices. 1973;Prentice-Hall, Inc. Englewood Cliffs, NJ.
6. A. Edalat, Domain Theory and Integration, Lecture Notes in Computer Science '94, IEEE Computer Society Press, Silver Spring, MD, 1994.
7. A. Edalat, M.H. Escardo, P.J. Potts, Semantics of exact real arithmetic, Proc. Twelfth Ann. IEEE Symp. on Logic in Computer Science, IEEE, 1997, pp. 248-257.
8. Flagg B., Kopperman R. The asymmetric topology of computer science. Brookes S.et al. Mathematical Foundations of Programming Language Semantics. Lecture Notes in Computer Science. Vol. 802:1993;544-553 Springer, Berlin.
9. Flagg R.C., Kopperman R. Continuity Spaces. reconciling domains and metric spaces Theoret. Comput. Sci. 177(1):1997;111-138.
10. R. Flagg, P. Sünderhauf, K. Wagner, A logical approach to quantitative domain theory, Preprint, 1996.
11. Flagg R.C., Sünderhauf P. The essence of ideal completion in quantitative form. Theoret. Comput. Sci. 278:2002;141-158.
12. Fletcher P., Lindgren W. Quasi-Uniform Spaces. 1982;Marcel Dekker, Inc. New York.
13. Gierz G., Hofmann K.H., Keimel K., Lawson J.D., Mislove M., Scott D.S. A Compendium of Continuous Lattices. 1980;Springer, Berlin, Heidelberg, New York.
14. Gunter C.A. Semantics of Programming Languages. 1992;MIT Press, Cambridge, MA.
15. Heckmann R. Lower bag domains. Fund. Inform. 24(3):1995;259-281.
16. R. Heckmann, Spaces of valuations, in: Proc. 11th Summer Conf. on General Topology and Applications, Annals of the New York Academy Science, Vol. 806, 1996, pp. 174-200.
17. Heckmann R. Approximation of metric spaces by partial metric spaces. Appl. Categor. Struct. 7:1999;71-83.
18. C. Jones, G. Plotkin, A probabilistic powerdomain of evaluations, in: Lecture Notes in Computer Sciences '89, IEEE Computer Society Press, Silver Spring, MD, 1989, pp. 186-195.
19. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, 1989.
20. Jones N. Computability and Complexity from a Programming Perspective, Foundations of Computing Series. 1997;MIT press, Cambridge, MA.
21. H.P. Künzi, Nonsymmetric topology, in: Proc. Szekszárd Conf., Bolyai Soc. Math. Studies, Vol. 4, 1993, pp. 303-338.
22. Künzi H.P., Schellekens M.P. On the Yoneda completion of a quasi-metric space. Theoret. Comput. Sci. 278:2002;159-194.
23. H.P. Künzi, V. Vajner, Weighted quasi-metrics, in: Proc. 8th Summer Conf. on General Topology and Applications; Ann. New York Acad. Sci. 728 (1994) 64-77.
24. J.D. Lawson, Valuations on continuous lattices, in: R.E. Hoffman (Ed.), Continuous Lattices and Related Topics, Mathematik Arbeitspapiere, Vol. 27, Universität Bremen.
25. S.G. Matthews, Partial metric topology, in: Proc. 8th Summer Conf. on General Topology and Applications, Ann. New York Acad. Sci., Vol. 728, 1994, pp. 183-197.
26. Matthews S.G. An extensional treatment of lazy data flow deadlock. Theoret. Comput. Sci. 151:1995;195-205.
27. Nachbin L. Topology and Order. Van Nostrand Mathematical Studies. Vol. 4:1965;D. Van Nostrand Co., Inc. Princeton, NJ.
28. O'Neill S.J. Partial metrics, valuations and domain theory. Andima S.et al. Proc. 11th Summer Conf. on General Topology and Applications. Annals of the New York Academy of Sciences. Vol. 806:1997;304-315 Academic Science, New York.
29. S.J. O'Neill, A fundamental study into the theory and application of the partial metric spaces, Ph.D. Thesis, University of Warwick, 1998.
30. G. Plotkin, course notes, 1983.
31. Romaguera S., Schellekens M. Quasi-metric properties of complexity spaces. Topol. Appl. 98:1999;311-322.
32. S. Romaguera, M. Schellekens, Duality and quasi-normability for complexity spaces, Appl. General Topology 3 (2002).
33. S. Romaguera, M. Schellekens, A characterization of norm-weightable Riesz spaces, preprint.
34. M.P. Schellekens, The Smyth completion: a common foundation for denotational semantics and complexity analysis, in: Proc. MFPS 11, Electronic Notes in Theoretical Computer Science, Vol. I, Elsevier, Amsterdam, 1995, pp. 211-232.
35. M.P. Schellekens, On upper weightable spaces, in: Proc. 11th Summer Conf. on General Topology and Applications. Annals of the New York Academy Science, Vol. 806, 1996, pp. 348-363.
36. M.P. Schellekens, Complexity Spaces Revisited, extended abstract, in: Proc. 8th Prague Topology Conf., Topology Atlas, 1996.
37. Schellekens M.P. Complexity spaces. lifting & directedness Topology Proc. 22:1999;403-425.
38. M.P. Schellekens, The correspondence between partial metrics and semivaluations, Theoret. Comput. Sci., to appear.
39. M.P. Schellekens, Extendible spaces, Appl. General Topology 3 (2002).
40. Seda A.K. Quasi-metrics and fixed points in computing. Bull. EATCS. 60:1996;154-163.
41. M.B. Smyth, Quasi-uniformities: reconciling domains with metric spaces, Lecture Notes in Computer Science, Vol. 298, Springer, Berlin, 1987, pp. 236-253.
42. Smyth M.B. Totally bounded spaces and compact ordered spaces as domains of computation. Reed G.M., Roscoe A.W., Wachter R.F. Topology and Category Theory in Computer Science. 1991;207-229 Oxford University Press, Oxford.
43. Smyth M.B. Completeness of quasi-uniform and syntopological spaces. J. London Math. Soc. 49:1994;385-400.
44. P. Sünderhauf, The Smyth-completion of a quasi-uniform space, in: M. Droste, Y. Gurevich (Eds.), Semantics of Programming Languages and Model Theory, Algebra, Logic and Applications, Vol. 5, Gordon and Breach Science Publ., London, 1993, pp. 189-212.
45. Sünderhauf P. Quasi-uniform completeness in terms of Cauchy nets. Acta Math. Hungar. 69:1995;47-54.
46. Weber H. Uniform lattices I. a generalization of topological Riesz spaces and topological Boolean rings Ann. Mat. Pura Appl. 160:1991;347-370.
47. Weber H. Uniform lattices II. order continuity and exhaustivity Ann. Mat. Pura Appl. (IV). 165:1993;133-158.