A uniform approach to domain theory in realizability models

Mathematical Structures in Computer Science

Volumn 7, Issue 5, 1997, Pages 469-505

  Longley, John R ^a   Simpson, Alex K ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85015819364     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129597002387     Document Type: Article

References (41)

1. Abadi, M. and Plotkin, G. (1990) A PER model of polymorphism and recursive types. In: Proc. of 5th Annual Symposium on Logic in Computer Science.
2. Abramsky, S. and Ong, C.-H. L. (1993) Full abstraction in the lazy lambda calculus. Information and Computation 105.
3. Amadio, R. (1991) Recursion over realizability structures. Information and Computation 91.
4. Amadio, R. (1992) On the adequacy of PER models. Technical Report 1579, INRIA.
5. Barendregt, H. P. (1984) The Lambda Calculus, its Syntax and Semantics, Second edition, North-Holland, Amsterdam.
6. Barr, M. and Wells, C. (1995) Category Theory for Computing Science, Second Edition, Prentice Hall.
7. Beeson, M. (1985) Foundations of Constructive Mathematics, Springer-Verlag.
8. 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.
9. Cutland, N. J. (1980) Computability, Cambridge University Press.
10. Fiore, M. P. (1995) Lifting as a KZ-doctrine. In: Category Theory and Computer Science, Proceedings of CTCS ’95. Springer-Verlag Lecture Notes in Computer Science 953 146–158.
11. Fiore, M. P., Plotkin, G. D. and Power, A. J. (1997) Complete cuboidal sets in axiomatic domain theory. In: Proc. of 12th Annual Symposium on Logic in Computer Science.
12. Freyd, P. J. (1990) Algebraically complete categories. In: Category Theory, Proceedings Como 1990. Springer-Verlag Lecture Notes in Mathematics 1488. Freyd, P. J. (1992) Remarks on algebraically compact categories. In: Applications of Categories in Computer Science. London Mathematical Society Lecture Notes 177, Cambridge University Press 95- 106.
13. Freyd, P. J., Mulry, P., Rosolini, G. and Scott, D. S. (1990) Extensional PERs. In: Proc. of 5th Annual Symposium on Logic in Computer Science.
14. Hindley, J. R. and Seldin, J. P. (1986) Introduction to Combinators and the λ-Calculus, London Mathematical Society, Student Texts 1, Cambridge University Press, 1986.
15. Hyland, J.M.E. (1982) The effective topos. In: The L.E.J. Brouwer Centenary Symposium, North-Holland 165–216.
16. Hyland, J. M. E. (1988) A small complete category. Annals of Pure and Applied Logic 40 135–165.
17. Hyland, J.M.E. (1990) First steps in synthetic domain theory. In: Category Theory, Proceedings, Como 1990. Springer-Verlag Lecture Notes in Mathematics 1488.
18. Hyland, J. M. E., Johnstone, P. T. and Pitts, A. M. (1980) Tripos theory. Math. Proc. Camb. Phil. Soc. 88 205–232.
19. Hyland, J. M. E. and Moggi, E. (1995) The S-replete construction. In: Category Theory and Com-puter Science, Proceedings of CTCS ’95. Springer-Verlag Lecture Notes in Computer Science 953 96- 116.
20. Hyland, J. M. E., Robinson, E. P. and Rosolini, G.(1990) The discrete objects in the effective topos. Proc. Lond. Math. Soc. 3 (60).
21. Joyal, A. and Moerdijk, I. (1995) Algebraic Set Theory. London Mathematical Society Lecture Notes 220, Cambridge University Press.
22. Kock, A. (1970) Monads on symmetric monoidal closed categories. Archiv der Mathematik 21 1–10.
23. Kock, A. (1972) Strong functors and monoidal monads. Archiv der Mathematik 23 113–120.
24. Longley, J. R. (1995) Realizability Toposes and Language Semantics, Ph.D. thesis, Department of Computer Science, University of Edinburgh. (Available as ECS-LFCS-95-332, 1995.)
25. Longo, G. and Moggi, E. (1991) Constructive natural deduction and its'ω-set’ interpretation. Mathematical Structures in Computer Science 1.
26. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer-Verlag.
27. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic: a First Introduction to Topos Theory, Universitext, Springer-Verlag.
28. Milner, R. (1977) Fully abstract models of typed λ-calculi. Theoretical Computer Science 4.
29. Mitchell, J. C. and Viswanathan, R. (1995) Effective models of polymorphism, subtyping and recursion. Technical Report CS-TN-95-18, Stanford Computer Science Department.
30. Mulry, P. S. (1992) Strong monads, algebras and fixed points. In: Fourman, M.P., Johnstone, P. T. and Pitts, A. M. (eds.) Applications of Categories in Computer Science. London Mathematical Society Lecture Note Series 177 202–216.
31. Phoa, W.K.-S. (1990) Effective domains and intrinsic structure. In: Proceedings of 5th Annual Symposium on Logic in Computer Science.
32. Phoa, W.K.-S. (1992a) Building domains from graph models. Mathematical Structures in Computer Science 2 277–299.
33. Phoa, W.K.-S. (1992b) An introduction to fibrations, topos theory, the effective topos and mod-est sets. Technical Report ECS-LFCS-92-208, Department of Computer Science, University of Edinburgh.
34. Phoa, W.K.-S. (1994) From term models to domains. Information and Computation 109 211–255.
35. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 125–159. Plotkin, G. D. (1977) LCF considered as a programming language. Theoretical Computer Science 5 223–255.
36. Plotkin, G. D. (1995) On a Question of H. Friedman. Information and Computation 126 74–77.
37. Reus, B. (1995) Program Verification in Synthetic Domain Theory, Ph.D. thesis, University of Munich.
38. Rosolini, G. (1986) Continuity and Effectivity in Topoi, Ph.D. thesis, University of Oxford.
39. Simpson, A. K. (1992) Recursive types in Kleisli categories. Unpublished manuscript. (Available by FTP from ftp.dcs.ed.ac.uk/pub/als/kleisli.ps.Z)
40. Taylor, P. (1991) The fixed point property in synthetic domain theory. In: Proc. of 6th Annual Symposium on Logic in Computer Science.
41. Trakhtenbrot, M.B. (1975) On representation of sequential and parallel functions. In: Proc. 4th Symposium on Mathematical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science 32.