An enrichment theorem for an axiomatisation of categories of domains and continuous functions

Mathematical Structures in Computer Science

Volumn 7, Issue 5, 1997, Pages 591-618

  Fiore†, Marcelo P ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84969394497     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129597002429     Document Type: Article

References (19)

1. Abramsky, S. and Jung, A. (1996) Domain theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 3, Clarendon Press 1–168.
2. Benton, P.N., Bierman, G. M., Hyland, J. M. E. and de Paiva, V. C. V. (1993) Linear lambda calculus and categorical models revisited. In: Borger, E. et al (eds.) Selected Papers from Computer Science Logic ’92. Springer-Verlag Lecture Notes in Computer Science 702.
3. Crole, R. L. and Pitts, A. M. (1992) New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation 98 171–210.
4. Fiore, M.P. (1995) Lifting as a KZ-doctrine. In: Pitt, D., Rydeheard, D. and Johnstone, P. (eds.) Proceedings of the 6th International Conference, CTCS’95, August 1995. Springer-Verlag Lecture Notes in Compyter Science 953 146–158.
5. Fiore, M.P. (1996) Axiomatic Domain Theory in Categories of Partial Maps, Cambridge University Press Distinguished Dissertations in Computer Science.
6. Fiore, M.P., Jung, A., Moggi, E., O’Hearn, P., Riecke, J., Rosolini, G. and Stark, I. (1996) Do-mains and denotational semantics: History, accomplishments and open problems. Bulletin of the European Association for Theoretical Computer Science 59 227–256.
7. Freyd, P. J. (1991) Algebraically complete categories. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Category Theory: Proceedings of the International Conference held in Como, Italy, July 22–28, 1991. Springer-Verlag Lecture Notes in Mathematics 1488 131–156.
8. Henessy, M. and Plotkin, G. (1979) Full abstraction for a simple parallel programming language. Springer-Verlag Lecture Notes in Computer Science 74.
9. Hyland, J.M.E. (1991) First steps in synthetic domain theory. In: Carboni, A., Pedicchio, M.C. and Rosolini, G. (eds.) Category Theory: Proceedings of the International Conference held in Como, Italy, July 22–28, 1991. Springer-Verlag Lecture Notes in Mathematics 1488 95–104.
10. Johnstone, P. T. (1977) Topos Theory, Academic Press.
11. Kock, A. (1970) Monads on symmetric monoidal closed categories. Arch. Math. (Basel) 21 1–10.
12. Kock, A. (1971) Closed categories generated by commutative monads. J. Austr. Math. Soc. XII 405–424.
13. Moggi, E. (1991) Notions of computation and monads. Information and Computation 93 (1) 55–92.
14. Phoa, W. (1990) Domain Theory in Realizability Toposes, Ph.D. thesis, Trinity College, Cambridge (also CST-82-91, University of Edinburgh).
15. Rosolini, G. (1986) Continuity and Effectiveness in Topoi, Ph.D. thesis, University of Oxford.
16. Scott, D. S. (1970) Outline of a mathematical theory of computation. Technical Report PRG-2, Oxford University Computing Laboratory.
17. Smyth, M. B. and Plotkin, G. D. (1982) The category-theoretic solution of recursive domain equations. SIAM Journal of Computing 11 (4) 761–783.
18. Taylor, P. (1991) The fixed point property in synthetic domain theory. In: 6th LICS Conference, IEEE 152–160.
19. Taylor, P. (1994) Synthetic domain theory notes (manuscript).