A categorical generalization of Scott domains

Mathematical Structures in Computer Science

Volumn 7, Issue 5, 1997, Pages 419-443

  AdÁmek†, JiŘÍ ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85022786791     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129597002351     Document Type: Article

References (15)

1. Adamek, J. (1974) Free algebras and automata realizations in the language of categories. Commen-tationes Mathematicae Universitatis Carolinae 15 589–602.
2. Ageron, P. (1991) Structure des logiques et logique des structures, Ph.D. thesis, Paris VII.
3. Abramsky, S. and Jung, A. (1994) Domain theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, volume 3, Clarendon Press 1–168.
4. Adamek, J. and Rosický, J. (1994) Locally presentable and accessible categories, Cambridge Univer-sity Press.
5. Borceux, F. (1994) Handbook of categorical algebra I, Cambridge University Press.
6. Coste, M. (1979) Localization, spectra and sheaf representation. Springer-Verlag Lecture Notes in Mathematics 753 212–238.
7. Freyd, P. J. (1991) Algebraically complete categories. In: Carboni, A., Pedicchio, M. C. and Rosolini, G. (eds.) Como Category Theory Conference. Springer-Verlag Lecture Notes in Mathematics 1488 95–104.
8. Gabriel, P. and Ulmer, F. (1971) Lokal prasentierbare Kategorien. Springer-Verlag Lecture Notes in Mathematics 221.
9. Lair, C. (1981) Categories modelables et categories esquissables. Diagrammes 6 1–20.
10. Lambek, J. (1968) Fixpoint theorem for complete categories. Math. Z. 103 175–195.
11. Makkai, M. and Pare, R. (1989) Accessible categories. Contemporary Mathematics 104.
12. Scott, D. S. (1972) Continuous lattices. In: Lawvere, E. (ed.) Toposes, Algebraic Geometry and Logic. Springer-Verlag Lecture Notes in Mathematics 274 97–136.
13. Scott, D. S. (1982) Domains for denotational semantics. In: Nielson, M. and Schmidt, E. M. (eds.) International Colloquium on Automata, Languages and Programs. Springer-Verlag Lecture Notes in Computer Science 140 577–613.
14. Smyth, M. B. and Plotkin, G. D. (1982) The category-theoretic solution of recursive domain equations. SIAM J. Computing 11 761–783.
15. Taylor, P. (1994) The limit-colimit coincidence for categories. Preprint, Imperial College, London.