Two models of synthetic domain theory

Journal of Pure and Applied Algebra

Volumn 116, Issue 1-3, 1997, Pages 151-162

  Fiore, Marcelo P ^a   Rosolini, Giuseppe ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Dima   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031588889     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(96)00164-8     Document Type: Article

References (18)

1. [1] A. Carboni, M.C. Pedicchio and G. Rosolini, eds., Category theory, in: Proc. Como, 1990, Lecture Notes in Math., Vol. 1488 (Springer, Berlin, 1991).
2. [2] M.P. Fiore, Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertations in Computer Science (Cambridge Univ. Press, Cambridge, 1996).
3. [3] P.J. Freyd, Recursive types reduced to inductive types, in: [10] 498-507.
4. [4] P. Freyd, Algebraically complete categories, in: [1] 95-104.
5. [5] P. Freyd, Remarks on algebraically compact categories, in: M.P. Fourman, P.T. Johnstone and A.M. Pitts, eds., Proc. Symp. Appl. Categories to Computer Science (Cambridge Univ. Press, Cambridge, 1992).
6. [6] P.J. Freyd and A. Scedrov, Categories and Allegories (North-Holland, Amsterdam, 1991).
7. [7] C.A. Gunter, Semantics of Programming Languages: Structures and Techniques (MIT Press, Cambridge, MA, 1992).
8. [8] J.M.E. Hyland, First steps in Synthetic Domain Theory, in: [1] 131-156.
9. [9] S. MacLane and I. Moerdijk, Sheaves in Geometry and Logic, A First Introduction to Topos Theory (Springer, Berlin, 1992).
10. [10] J. Mitchell, ed., Proc. 5th Symp. on Logic in Computer Science, Philadelphia, 1990 (IEEE Computer Society, New York, 1990).
11. [11] P. Mulry, Generalized Banach-Mazur functionals in the topos of recursive sets, J. Pure Appl. Alg. 2 (1981) 71-83.
12. [12] W. Phoa, Effective domains and intrinsic structure, in: [10] 366-377.
13. [13] G. Rosolini, Continuity and effectiveness in topoi, Ph.D. Thesis, University of Oxford, 1986.
14. [14] G. Rosolini, Notes on Synthetic Domain Theory, 1994. Available from http://hypatia.dcs.qmw.ac.uk.
15. [15] D.S. Scott, Data types as lattices, SIAM J. Comput. 5 (1976) 522-587.
16. [16] D.S. Scott, Relating theories of the λ-calculus, in: R. Hindley and J. Seldin, eds., To H.B. Curry: Essays in Combinatory Logic Lambda Calculus and Formalisms (Academic Press, New York, 1980) 403-450.
17. [17] P. Taylor, The fixed point property in synthetic domain theory, in: G. Kahn, ed., Proc. 6th Symp. on Logic in Computer Science (IEEE, New York) 152-160.
18. [18] G. Winskel, The Formal Semantics of Programming Languages, An Introduction (MIT Press, Cambridge, MA, 1993).