Quantitative semantics, topology, and possibility measures

Topology and its Applications

Volumn 89, Issue 1-2, 1998, Pages 151-178

  Heckmann, Reinhold ^a   Huth, Michael ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b Sunflower Networking Group   (United States)

Author keywords

Continuous lattices; Possibility measures; Quantitative predicates

Indexed keywords

EID: 0042895975     PISSN: 0016660X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-8641(97)00223-x     Document Type: Article

References (6)

1. S. Abramsky, A domain equation for bisimulation, Inform, and Comput. 92 (1991) 161-218.
2. S. Abramsky and A. Jung, Domain theory, in: S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, Vol. 3 (Clarendon Press, 1994) 1-168.
3. M.M. Bonsangue, F. van Breugel and J.J.M.M. Rutten, Generalized metric spaces: completion, topology, and powerdomains via the Yoneda embedding, Theoret. Comput. Sci. B 193 (1998) 1-51.
4. G. de Cooman, D. Ruan and E.E. Kerre, eds., FAPT'95: Foundations and Applications of Possibility Theory, Advances in Fuzzy Systems-Applications and Theory, Vol. 8 (World Scientific, Singapore, 1995).
5. E.W. Dijkstra, A Discipline of Programming (Prentice-Hall, Englewood Cliffs, NJ, 1976).
6. A. Edalat and M.H. Escardó, Integration in real PCF, in: IEEE Symposium on Logic in Computer Science (IEEE Computer Society Press, 1996).