An extension of models of axiomatic domain theory to models of synthetic domain theory

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

Volumn 1258, Issue , 1997, Pages 129-149

  Fiore, Marcelo P ^a   Plotkin, Gordon D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

RECONFIGURABLE HARDWARE;

AXIOMATIC DOMAIN THEORY; ELEMENTARY MODEL; ORIGINAL MODEL; SYNTHETIC DOMAIN THEORY; YIELD MODELS;

COMPUTER CIRCUITS;

EID: 0005505895     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_36     Document Type: Conference Paper

References (36)

1. J. Adámek and J. Rosický: Locally Presentable and Accessible Categories. Cambridge University Press, 1994.
2. P.N. Benton, G.M. Bierman, J.M.E. Hyland, and V.C.V. de Paiva: Linear lambda calculus and categorical models revisited. In E. Börger et al., editor, Selected Papers from Computer Science Logic '92, volume 702 of Lecture Notes in Computer Science, 1993.
3. G.M. Bierman: What is a categorical model of intuitionistic linear logic? In M. Dezani-Ciancaglini and G.D. Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of Lecture Notes in Computer Science, 1995.
4. F. Borceux: Handbook of Categorical Algebra. Cambridge University Press, 1994.
5. R.L. Crole and A.M. Pitts: New foundations for fixpoint computations: FIXhyperdoctrines and the FIX-logic. Information and Computation, 98:171-210, 1992.
6. B. Day: On closed categories of functors. In G.M. Kelly, editor, Sidney Category Seminar 1972/1973, volume 420 of Lecture Notes in Mathematics, pages 20-54. Springer-Verlag, 1972.
7. S. Eilenberg and G. M. Kelly: Closed categories. In S. Eilenberg, D.K. Harrison, S. MacLane, and H. Rohrl, editors, Proceedings of the Conference on Categorical Algebra. Springer-Verlag, 1966. La Jolla, 1965.
8. M.P. Fiore: Axiomatic Domain Theory in Categories of Partial Maps. Cambridge University Press Distinguished Dissertations in Computer Science, 1996.
9. M.P. Fiore: Enrichment and representation theorems for categories of domains and continuous functions. Available from http://www.dcs.ed.ac.uk/home/mf/asrep.dvi, 1996.
10. M.P. Fiore: An enrichment theorem for an axiomatisation of categories of domains and continuous functions. To appear in Mathematical Structures in Computer Science --Proceedings of the Workshop LDPL'95, 1997.
11. M.P. Fiore, A. Jung, E. Moggi, P. O'Hearn, J. Riecke, G. Rosolini, and I. Stark: Domains and denotational semantics: History, accomplishments and open problems. In number 59 of Bulletin of the European Association for Theoretical Computer Science, pages 227-256, June 1996.
12. P. Freyd and G.M. Kelly: Categories of continuous functors, I. Journal of Pure and Applied Algebra, 2:169-191, 1972.
13. P.J. Freyd, P. Mulry, G. Rosolini, and D.S. Scott: Extensional PERs. Information and Computation, 98:211-227, 1992.
14. M.P. Fiore and G. Rosolini: Two models of Synthetic Domain Theory. To appear in the Journal of Pure and Applied Algebra, 1996.
15. P.J. Freyd: Algebraically complete categories. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Category Theory, volume 1488 of Lecture Notes in Mathematics, pages 131-156. Springer-Verlag, 1991.
16. J.M.E. Hytand and E. Moggi: The S-replete construction. In D. Pitt, D. Rydeheard, and P. Johnstone, editors, Proceedings of the 6 th International Conference, CTCS'95, volume 953 of Lecture Notes in Computer Science, pages 96-116. Springer-Verlag, 1995.
17. J.M.E. Hyland: First steps in Synthetic Domain Theory. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Category Theory, volume 1488 of Lecture Notes in Mathematics, pages 95-104. Springer-Verlag, 1991.
18. B. Jacobs: Semantics of weakening and contraction. Annals of Pure and Applied Logic, 69:73-106: 1994.
19. M. Jibladze: A presentation of the initial lift-algebra. To appear in the Journal of Pure and Applied Algebra, 1996.
20. A. Kock: Monads on symmetric monoidal closed categories. Arch. Math. (Basel), 21:1-10, 1970.
21. A. Kock: Closed categories generated by commutative monads. J. Austr. Math. Soc., 12 405-424, 1971.
22. J.R. Longley: Realizability Toposes and Language Semantics. PhD thesis, Department of Computer Science, University of Edinburgh, 1995.
23. J.R. Longley and A.K. Simpson: A uniform approach to domain theory in realizability models. To appear in Mathematical Structures in Computer Science -- Proceedings of the Workshop LDPL'95, 1997.
24. E. Moggi: Notions of computation and monads. Information and Computation, 93(1):55-92, Jul 1991.
25. P. S. Mulry: Monads and algebras in the semantics of partial data types. Theoretical Computer Science, 99:141-155, 1992.
26. W. Phoa: Effective domains and intrinsic structure. In 5 th LICS Conf., pages 366-377. IEEE, Computer Society Press, 1990.
27. G.D. Plotkin: Denotational semantics with partial functions. Lecture at C.S.L.I. Summer School, 1985.
28. G.D. Plotkin: Algebraic completeness and compactness in an enriched setting. Invited lecture given at the Workshop on Logic, Domains, and Programming Languages. Darmstadt, 1995.
29. J. Power and G. Rosolini: Fixpoint operators for domain equations. Available from http://hypatia.dcs.qmw.ac.uk/, 1996.
30. G. Rosolini: Continuity and Effectiveness in Topoi. PhD thesis, University of Oxford, 1986. Available from http://hypatstics.qmw.ac.uk/.
31. G. Rosolini: Notes on Synthetic Domain Theory. Available from http://hypatia.dcs.qmw.ac.uk/, 1995.
32. G. Rosolini: Private communication, 1996.
33. G. Rosolini. Studying repleteness in the category of cpos. To appear in Electronic Notes in Theoretical Computer Science --Proceedings of MFPS XIII Conf., 1997.
34. A.K. Simpson: Private communication, 1996.
35. M.B. Smyth and G.D. Plotkin: The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, 11(4):761-783, 1982.
36. P. Taylor: The fixed point property in synthetic domain theory. In 6 th LICS Conf., pages 152-160. IEEE, Computer Society Press, 1991.