Computational adequacy for recursive types in models of intuitionistic set theory

Annals of Pure and Applied Logic

Volumn 130, Issue 1-3 SPEC. ISS., 2004, Pages 207-275

  Simpson, Alex ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Algebraic compactness; Domain theory; FPC

Indexed keywords

EID: 15344349268     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2003.12.005     Document Type: Article

References (47)

1. Aczel P. The type theoretic interpretation of constructive set theory in: Logic Colloquium'77 1978 55-66 North-Holland Amsterdam
2. S. Awodey, C. Butz, A.K. Simpson, Th. Streicher, Relating set theory, toposes and categories of classes, 2003 (in preparation)
3. Fiore M.P. Axiomatic Domain Theory in Categories of Partial Maps Distinguished Dissertation Series 1996 CUP
4. Fiore M.P. Plotkin G.D. An axiomatisation of computationally adequate domain-theoretic models of FPC in: Proc. 9th IEEE Symposium on Logic in Computer Science 1994 92-102
5. Fiore M.P. Plotkin G.D. An extension of models of axiomatic domain theory to models of synthetic domain theory in: Proceedings of CSL 96 LNCS vol. 1258 1997 129-149 Springer
6. Fiore M.P. Plotkin G.D. Power A.J. Complete cuboidal sets in axiomatic domain theory in: Proc. 12th IEEE Symposium on Logic in Computer Science 1997 268-279
7. Fiore M.P. Rosolini G. Domains in H Theoret. Comput. Sci 264 2001 171-193
8. Freyd P.J. Recursive types reduced to inductive types in: Proc. 5th IEEE Symposium on Logic in Computer Science 1990 498-507
9. Freyd P.J. Algebraically complete categories in: Category Theory, Proc. Como 1990 LNM vol.1488 1991 95-104 Springer
10. Freyd P.J. Remarks on algebraically compact categories in: Applications of Categories in Computer Science LMS Lecture Notes vol. 177 1992 95-106 CUP
11. Freyd P.J. Mulry P. Rosolini G. Scott D.S. Extensional PERs Inform. Comput 98 1992 211-227
12. Girard J.-Y. Proof Theory and Logical Complexity 1987 Bibliopolis
13. Hyland J.M.E. The effective topos in: L.E.J. Brouwer Centenary Symposium 1982 165-216 North-Holland Amsterdam
14. Hyland J.M.E. First steps in synthetic domain theory in: Category Theory, Proc. Como 1990 LNM vol. 1488 1991 131-156 Springer
15. Hyland J.M.E. Johnstone P.T. Pitts A.M. Tripos theory Math. Proc. Cambridge Philos. Soc 88 1980 205-232
16. Jacobs B. Semantics of weakening and contraction Ann. Pure Appl. Logic 69 1994 73-106
17. Jacobs B. Categorical Logic and Type Theory 1999 North-Holland Amsterdam
18. Jibladze M. A presentation of the initial lift algebra J. Pure Appl. Algebra 116 1997 185-198
19. Joyal A. Moerdijk I. Algebraic Set Theory LMS Lecture Notes vol. 220 1995 CUP
20. Lambek J. Scott P.J. Introduction to Higher Order Categorical Logic 1986 Cambridge University Press
21. J.R. Longley, Realizability toposes and language semantics, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1995, Available as ECS-LFCS-95-332
22. Longley J.R. Simpson A.K. A uniform account of domain theory in realizability models Math. Structures Comput. Sci 7 1997 469-505
23. Luo Z. Computation and Reasoning: A Type Theory for Computer Science Number 11 in International Series of Monographs on Computer Science 1994 OUP
24. Mac Lane S. Moerdijk I. Sheaves in Geometry and Logic: A First Introduction to Topos Theory 1992 Universitext. Springer-Verlag
25. Martin-Löf P. Intuitionistic Type Theory Studies in Proof Theory 1984 Bibliopolis
26. McCusker G. Games and Full Abstraction for a Functional Metalanguage with Recursive Types Distinguished Dissertation Series 1998 Springer-Verlag
27. Phoa W.K.-S. Effective domains and intrinsic structure in: Proc. 5th IEEE Symposium on Logic in Computer Science 1990 366-377
28. Phoa W.K.-S. Building domains from graph models Math. Structures Comput. Sci 2 1992 277-299
29. Phoa W.K.-S. From term models to domains Inform. Comput 109 1994 211-255
30. Pitts A.M. Relational properties of domains Inform. Comput 127 1996 66-90
31. Plotkin G.D. LCF considered as a programming language Theoret. Comput. Sci 5 1977 223-255
32. Plotkin G.D. Denotational semantics with partial functions in: Lecture Notes 1985 C.S.L.I. Summer School
33. Plotkin G.D. Algebraic compactness in an enriched setting in: Invited talk, Workshop on Logic, Domains and Programming Languages Darmstadt 1995
34. Reus B. Streicher Th General synthetic domain theory - a logical approach Math. Structures Comput. Sci 9 1999 177-223
35. G. Rosolini, Continuity and effectivity in topoi, Ph.D. Thesis, University of Oxford, 1986
36. Šcedrov A. Intuitionistic set theory Harvey Friedman's Research on The Foundations of Mathematics 1985 Elsevier Science Publishers pp. 257-284
37. Scott D.S. Relating theories of the λ-calculus in: To H.B. Curry 1980 403-450 Academic Press
38. Simpson A.K. Computational adequacy in an elementary topos in: Computer Science Logic, Proceedings CSL'98 LNCS vol. 1584 1999 323-342 Springer
39. Simpson A.K. Elementary axioms for categories of classes (extended abstract) in: Proc. 14th IEEE Symposium on Logic in Computer Science 1999 77-85
40. Simpson A.K. Computational adequacy for recursive types in models of intuitionistic set theory in: Proc. 17th IEEE Symposium on Logic in Computer Science 2002
41. A.K. Simpson, Recursive types in Kleisli categories, University of Edinburgh, 1992 (unpublished manuscript)
42. A.K. Simpson, Elementary axioms for categories of classes, 2003 (in preparation)
43. A.K. Simpson, Computational adequacy for models of FPC, 2003 (in preparation)
44. Smyth M.B. Plotkin G.D. The category-theoretic solution of recursive domain equations SIAM J. Comput 11 1982 761-783
45. Taylor P. The fixed point property in synthetic domain theory in: Proc. 6th IEEE Symposium on Logic in Computer Science 1991 152-160
46. Taylor P. Practical Foundations 1999 Cambridge University Press
47. van Oosten J. Simpson A.K. Axioms and (counter)examples in synthetic domain theory Ann. Pure Appl. Logic 104 2000 233-278