Domains and lambda-calculi
Domains and lambda-calculi
复制标题
DOI：
10.1017/cbo9780511983504.002
复制
发表时间：
1998-08
期刊：
影响因子：
--
通讯作者：
R. Amadio;P. Curien
中科院分区：
文献类型：
--
作者：
R. Amadio;P. Curien
前言表示法1。连续性和可计算性2。lambda-calculus的句法理论3。D模型和相交类型4。ccc 5中的lambda-calculi的解释。代数DCPO的CCC的ccc's ofergraic dcpo的6。计算9。Powerdomains10。石头双重性11。依赖和二阶类型12.稳定性13。朝向线性逻辑14。顺序15。域和可实现性16。函数和过程附录1：递归理论摘要附录2：类别理论参考和参考书目索引的摘要。
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.