Set-theoretical and other elementary models of the λ-calculus

Theoretical Computer Science

Volumn 121, Issue 1-2, 1993, Pages 351-409

  Plotkin, Gordon D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANTI-FOUNDATION AXIOMS; ENGELER MODELS; LAMBDA-BETA CALCULUS; SCOTT MODELS;

MATHEMATICAL TECHNIQUES;

EID: 0027910780     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(93)90094-A     Document Type: Article

References (57)

1. The lazy lambda calculus
2. Domain theory in logical form
3. Non-Well-Founded Sets
4. Simple consequence relations
5. Ω can be anything it shouldn't be
6. The Lambda Calculus
7. How to construct extensional combinatory algebras
8. On the existence of extensional partial combinatory algebras
9. Stable models of typed lambda calculi
10. A filter lambda model and the completeness of type assignment
11. ω
12. Two extensions of Curry's type inference system
13. Extended type structures and filter lambda models
14. Applicative information systems and recursive domain equations
15. Applicative information systems
16. ∞-lambda models
17. Categorical Combinators, Sequential Algorithms, and Functional Programming
18. The Lambda Calculus
19. An abstract notion of application
20. Operational, denotational and logical descriptions: a case study
21. Algebras and combinators
22. Representation of varieties in combinatory algebras
23. Set theory with free construction principles
24. Sheaf models for set theory
25. Recursive types reduced to inductive types
26. Equality between functionals
27. The system F of variable types, fifteen years later
28. Normal functors, power series and λ-calculus
29. Reasoning about interpretations in qualitative lambda models
30. An approximation theorem for topological lambda models and the topological incompleteness of lambda models
31. Collapsing graph models by preorders
32. Semantics of lambda-I and other substructural lambda calculi
33. Quantitative domains and infinitary algebras
34. Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
35. Realizability and recursive set theory
36. The partial lambda-calculus
37. Introducing Girard's quantitative domains
38. The Y-combinator in Scott's lambda-calculus models
39. ω as a universal domain
40. The category-theoretic solution of recursive domain equations
41. Ideas and results in proof theory
42. Continuous lattices
43. Lattice-theoretic models for various type-free calculi
44. Completeness and axiomatizability in many-valued logic
45. Data types as lattices
46. Lambda calculus: some models, some philosophy
47. Relating theories of the λ-calculus
48. Domains for denotational semantics
49. Isomorphisms and nonisomorphisms of graph models