A duality theory for quantitative semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 255-274

  Heckmann, Reinhold ^a   Huth, Michael ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b Sunflower Networking Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CRYSTAL LATTICES; RECONFIGURABLE HARDWARE; SEMANTICS; TOPOLOGY;

CARTESIAN CLOSED CATEGORY; CONTINUOUS FUNCTIONS; CONTINUOUS VALUATIONS; DUALITY THEORY; POSSIBILITY THEORY; SCOTT CONTINUOUS MAPS; TOPOLOGICAL SPACES; UNIVERSAL PROPERTIES;

COMPUTER CIRCUITS;

EID: 84957704208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028019     Document Type: Conference Paper

References (15)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
2. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. A Compendium of Continuous Lattices. Springer Verlag, 1980.
3. P. R. Halmos. Measure Theory. D. van Norstrand Company, 1950.
4. R. Heckmann. Power domains and second order predicates. Theoretical Computer Science, 111:59-88, 1993.
5. M. Huth and M. Kwiatkowska. Quantitative Analysis and Model Checking. Annual IEEE Symposium on Logic in Computer Science, pages 111-122. IEEE Computer Society Press, June 1997.
6. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Logic in Computer Science, pages 186-195. IEEE Computer Society Press, 1989.
7. C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edinburgh, 1990. Also published as Technical Report No. CST-63-90.
8. C. Morgan, A. Mclver, K. Seidel, and J.W. Sanders. Probabilistic Predicate Transformers. Technical Report PRG-TR-4-95, Oxford University Computing Laboratory, 1995.
9. C. Morgan, A. Mclver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
10. C. Morgan and A. Mclver. An expectation-transformer model for probabilistic temporal logic. Technical report, Computing Laboratory, Oxford University, April 1997. Draft. Personal Communication.
11. G. N. Raney. Completely distributive complete lattices. Proc. AMS, 3:667-680, 1952.
12. G. N. Raney. Tight Galois connections and complete distributivity. Trans. AMS, 97:418-426, 1960.
13. M. B. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 662-675. Springer Verlag, 1983.
14. Wim Vervaat. Random upper semicontinuous functions and extremal processes. In W. Vervaat and H. Holwerda, editors, Probability and Lattices, pages 1-56. CWI Tracts, 1991.
15. S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.