Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (2003)

by Alex Simpson
Venue:In Proc. 17th IEEE Symposium on Logic in Computer Science
Citations:8 - 2 self

Documents Related by Co-Citation

25 Elementary axioms for categories of classes – A K Simpson - 1999
27 Realizability and Recursive Mathematics – D C McCarty - 1984
53 First steps in synthetic domain theory – Martin Hyland - 1991
919 Categories for the working mathematician – Mac Lane, S - 1971
21 The consistency of classical set theory relative to a set theory with intuitionistic logic – H Friedman - 1973
17 Bernays-Gödel type-theory – Carsten Butz - 2003
8 Oosten, Algebraic Set Theory and the Effective Topos – C Kouwenhoven-Gentil, J van - 2005
119 The type theoretic interpretation of constructive set theory – P Aczel - 2001
12 Algebraic models of intuitionistic theories of sets and classes. Theory and applications of categories – Steve Awodey, Henrik Forssell, S. Awodey, H. Forssell
8 Constructive set theories and their category-theoretic models – Alex Simpson - 2005
5 On set theories and toposes – S Hayashi - 1980
2 Intuitionistic set theory – A ˇS˘cedrov - 1985
20 Effective domains and intrinsic structure – Wesley Phoa - 1990
9 Computational Adequacy in an Elementary Topos – Alex K. Simpson - 1999
15 Relating theories of the λ-calculus – D S Scott - 1980
24 The Discrete Objects in the Effective Topos – J. M. E. Hyland, E. P. Robinson, G. Rosolini - 1990
35 Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion – G.M. Bierman, A. M. Pitts, C. V. Russo
18 Reflexive Graphs and Parametric Polymorphism – G. Rosolini - 1993
29 Complete Axioms for Categorical Fixed-point Operators – Alex Simpson, Gordon Plotkin - 2000