Book contents
- Frontmatter
- Contents
- Preface
- Notation
- 1 Continuity and computability
- 2 Syntactic theory of the λ-calculus
- 3 D∞ models and intersection types
- 4 Interpretation of λ-calculi in CCC's
- 5 CCC's of algebraic dcpo's
- 6 The Language PCF
- 7 Domain equations
- 8 Values and computations
- 9 Powerdomains
- 10 Stone duality
- 11 Dependent and second order types
- 12 Stability
- 13 Towards linear logic
- 14 Sequentially
- 15 Domains and realizability
- 16 Functions and processes
- Appendix 1 Summary of recursion theory
- Appendix 2 Summary of category theory
- References and bibliography
- Index
15 - Domains and realizability
Published online by Cambridge University Press: 05 November 2011
- Frontmatter
- Contents
- Preface
- Notation
- 1 Continuity and computability
- 2 Syntactic theory of the λ-calculus
- 3 D∞ models and intersection types
- 4 Interpretation of λ-calculi in CCC's
- 5 CCC's of algebraic dcpo's
- 6 The Language PCF
- 7 Domain equations
- 8 Values and computations
- 9 Powerdomains
- 10 Stone duality
- 11 Dependent and second order types
- 12 Stability
- 13 Towards linear logic
- 14 Sequentially
- 15 Domains and realizability
- 16 Functions and processes
- Appendix 1 Summary of recursion theory
- Appendix 2 Summary of category theory
- References and bibliography
- Index
Summary
- Type
- Chapter
- Information
- Domains and Lambda-Calculi , pp. 388 - 420Publisher: Cambridge University PressPrint publication year: 1998