Domains and lambda-calculi

Preface Notation 1. Continuity and computability 2. Syntactic theory of lambda-calculus 3. D models and intersection types 4. Interpretation of lambda-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. Sequentiality 15. Domains and realizability 16. Functions and processes Appendix 1: summary of recursion theory Appendix 2: summary of category theory References and bibliography Index.