University of Warwick. Department of Computer Science
Abstract
The T0 world of Scott's topological models used in the denotational semantics of programming languages may at first sight appear to have nothing whatever in common with the Hausdorff world of metric space theory. Can this be true though when the notion of "distance" is so important in the application of inductive proof theory to recursive definitions? This paper shows that existing work on the application of quasi metrics to denotational semantics can be taken much further than just describing Scott topologies. Using our "partial metric" we introduce a new approach by constructing each semantic domain as an Alexandrov topology "sandwiched" between two metric topologies. To be presented at the Eighth Summer Conference on General Topology and Applications, June 18-20 1992, Queens College, New York City
