Computational adequacy for recursive types in models of intuitionistic set theory

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 287-298

  Simpson, Alex ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; THEOREM PROVING;

COMPUTATIONAL ADEQUACY;

SEMANTICS;

EID: 0036054155     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. On the adequacy of PER models
2. An extension of models of axiomatic domain theory to models of synthetic domain theory
3. Complete cuboidal sets in axiomatic domain theory
4. Domains in H
5. Recursive types reduced to inductive types
6. Algebraically complete categories
7. Remarks on algebraically compact categories
8. Extensional PERs
9. The effective topos
10. First steps in synthetic domain theory
11. Tripos theory
12. A presentation of the initial lift algebra
13. Algebraic set theory
14. A uniform account of domain theory in realizability models
15. Axioms and (counter)-examples in synthetic domain theory
16. Effective domains and intrinsic structure
17. Building domains from graph models
18. From term models to domains
19. LCF considered as a programming language
20. General synthetic domain theory - A logical approach
21. Intuitionistic set theory
22. Relating theories of the λ-calculus
23. Computational adequacy in an elementary topos
24. Elementary axioms for categories of classes
25. The category-theoretic solution of recursive domain equations
26. The fixed point property in synthetic domain theory