Distance and measurement in domain theory

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 448-462

  Waszkiewicz, Paweł ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

DOMAIN THEORY; PARTIAL METRICS; SCOTT TOPOLOGY; SUBSETS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0038555987     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80975-7     Document Type: Conference Paper

References (8)

1. Abramsky S., Jung A. Domain theory. Abramsky S., Gabbay D.M., Maibaum T.S.E. Handbook of Logic in Computer Science. volume 3:1994;1-168 Clarendon Press
2. Edalat A., Heckmann R. A computational model for metric spaces. Theoretical Computer Science. 193:1998;53-73
3. Frink A.H. Distance functions and the metrization problem. Bulletin of the American Mathematical Society. 43:1937;133-142
4. Heckmann Reinhold. Approximation of metric spaces by partial metric spaces. Applied Categorical Structures. 7:1999;71-83
5. Keye Martin. A Foundation for Computation. PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA 70118, 2000.
6. Steve G. Matthews. Partial metric topology. In Proceedings of the 8th Summer Conference on Topology and Its Application, volume 728, pages 176-185, 1992.
7. Simon J. O'Neill. Partial metrics, valuations and domain theory. Research Report CS-RR-293, Department of Computer Science, University of Warwick, Coventry, UK, October 1995.
8. Sünderhauf Philipp. Sobriety in terms of nets. Applied Categorical Structures. 8:2000;649-653