MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Quantitative Semantics, Topology, and Possibility Measures (1997) [2 citations — 2 self]

by Reinhold Heckmann ,  Michael Huth
Add To MetaCart

Abstract:

Given a topological space X and a complete lattice L, we study the space of L- predicates F L (X) = [X ! L op ] op , continuous maps from X to L op in its Scotttopology. It yields a functor F L (\Delta) from TOP-L, a full subcategory of TOP subsuming continuous domains, to SUP, the category of complete sup-lattices and maps preserving suprema. Elements of F 2 (X) are continuous predicates (= closed sets), and elements of F [0;1] (X) may be viewed as probabilistic predicates. Alternatively, one may consider the complete sup-lattice P L (X) = O(X)\Gamma ffi L of maps ¯: O(X) ! L preserving suprema (= possibility measures), which results in another functor P L (\Delta) from TOP to SUP. We show that these functors are equivalent for two restrictions. First, we leave SUP unchanged and restrict TOP-L to CONT, the category of continuous domains in their Scott-topology; second, we fix TOP but restrict L to co-continuous lattices. Conversely, if F L (X) and P L (X) are isomorphic f...

Citations

2701 Communication and Concurrency – Milner - 1989
998 An axiomatic basis for computer programming – Hoare - 1969
892 Temporal and modal logic – Emerson - 1990
388 Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory – Stoy - 1977
356 Domain theory – Abramsky, Jung - 1994
280 A Compendium of Continuous Lattices – Gierz, Hoffmann, et al. - 1980
159 Outline of a mathematical theory of computation – Scott - 1970
151 Measure Theory – Halmos - 1950
104 A Domain Equation for Bisimulation – Abramsky - 1991
97 Probabilistic Predicate Transformers – Morgan, McIver, et al. - 1995
94 A probabilistic powerdomain of evaluations – Jones, Plotkin - 1989
48 A Discipline of Programming, Prentice-Hall – Dijkstra - 1976
47 Local compactness and continuous lattices – Hofmann, Mislove - 1981
28 The troublesome probabilistic powerdomain – Jung, Tix - 1998
21 Time and Probability – Hansson - 1994
14 Generalized metric spaces: completion, topology, and powerdomains via the Yoneda embedding, Theoretical Computer Science 193 – Bonsangue, Breugel, et al. - 1998
5 A Compositional Approach to Performance Modelling (Cambridge – Hillston - 1996
5 Linear types, approximation, and topology – Huth, Jung, et al. - 1994
3 Abstract valuations: A novel representation of Plotkin power domain and Vietoris hyperspace – Heckmann - 1997
3 Spaces of valuations, Papers on General Topology and Applications: eleventh summer conference at the university of Southern Maine (New – Heckmann - 1996
3 A Characterization of linear FS-lattices – Huth, Mislove - 1994
3 Tensor products and powerspaces in quantitative domain theory – Sünderhauf - 1997
2 PCF Extended with – Escardo - 1996
2 Note on Free Algebras Over Continuous Domains. Theoretical Computer Science – Koslowski
1 A Powerdomain of Possibility Measures – Huth - 1996
1 Valuations and Measures – Keimel, Tix - 1996
1 Bereiche und Bewertungen, Diploma Thesis, Technische Hochschule – Kirch - 1993