未读消息消息

购物车

我的订单

个人中心

店铺

我的订单收藏

拍卖

拍卖交易我的竞拍收藏

我的好友资金账户

卖家中心

客服 |

帮助中心 9:00-20:30 在线留言

客服电话

010-89648155

服务时间

客服咨询 8:00-21:00

纠纷处理 9:00-21:00

图书审核 9:00-18:00

监督与建议

请选择

手机孔网

Lambda-Calculus and Combinators：An Introduction

作者: J. Roger （J·罗杰·欣德利）著 , Jonathan P. Seldin （乔纳森·P·塞尔丁）著

出版社: Cambridge University Press

出版时间: 2008-06

版次: 1

ISBN: 9780521898850

定价: 576.60

装帧: 精装

开本: 16开

纸张: 胶版纸

页数: 360页

正文语种: 英语

分类: 外文古旧书>英文书>工程技术

1人买过

Combinatorylogicandlambda-calculus,originallydevisedinthe1920s,havesincedevelopedintolinguistictools,especiallyusefulinprogramminglanguages.Theauthors'previousbookservedasthemainreferenceforintroductorycoursesonlambda-calculusforover20years:thislong-awaitednewversionisthoroughlyrevisedandoffersafullyup-to-dateaccountofthesubject,withthesameauthoritativeexposition.Thegrammarandbasicpropertiesofbothcombinatorylogicandlambda-calculusarediscussed,followedbyanintroductiontotype-theory.Typedanduntypedversionsofthesystems,andtheirdifferences,arecovered.Lambda-calculusmodels,whichliebehindmuchofthesemanticsofprogramminglanguages,arealsoexplainedindepth.Thetreatmentisasnon-technicalaspossible,withthemainideasemphasizedandillustratedbyexamples.Manyexercisesareincluded,fromroutinetoadvanced,withsolutionstomostattheendofthebook. J.RogerHindleyisanHonoraryResearchFellowatSwanseaUniversity,Wales.HismainresearchinterestsareLambda-calculusandcombinatorylogicandhehastaughtatmanyinternationaluniversitiesincludingBristolUniversity,PennsylvaniaStateUniversityandTokyoInstituteoftechnology.Thisishis7thbook. Preface

1. The λ-calculus

2. Combinatory logic

3. The power of λ and CL

4. Computable functions

5. Undecidability

6. Formal theories

7. Extensionality in λ-calculus

8. Extensionality in CL

9. Correspondence between λ and CL

10. Simple typing, Church-style

11. Simple typing, Curry-style in CL

12. Simple typing, Curry-style in λ

13. Generalizations of typing

14. Models of CL

15. Models of λ

16. Scott's D∞ and other models

Appendix A1. α-conversion

Appendix A2. Confluence proofs

Appendix A3. Normalization proofs

Appendix A4. Care of your pet combinator

Appendix A5. Answers to starred exercises

Bibliography

Index
内容简介:
Combinatorylogicandlambda-calculus,originallydevisedinthe1920s,havesincedevelopedintolinguistictools,especiallyusefulinprogramminglanguages.Theauthors'previousbookservedasthemainreferenceforintroductorycoursesonlambda-calculusforover20years:thislong-awaitednewversionisthoroughlyrevisedandoffersafullyup-to-dateaccountofthesubject,withthesameauthoritativeexposition.Thegrammarandbasicpropertiesofbothcombinatorylogicandlambda-calculusarediscussed,followedbyanintroductiontotype-theory.Typedanduntypedversionsofthesystems,andtheirdifferences,arecovered.Lambda-calculusmodels,whichliebehindmuchofthesemanticsofprogramminglanguages,arealsoexplainedindepth.Thetreatmentisasnon-technicalaspossible,withthemainideasemphasizedandillustratedbyexamples.Manyexercisesareincluded,fromroutinetoadvanced,withsolutionstomostattheendofthebook.
作者简介:
J.RogerHindleyisanHonoraryResearchFellowatSwanseaUniversity,Wales.HismainresearchinterestsareLambda-calculusandcombinatorylogicandhehastaughtatmanyinternationaluniversitiesincludingBristolUniversity,PennsylvaniaStateUniversityandTokyoInstituteoftechnology.Thisishis7thbook.
目录:
Preface

1. The λ-calculus

2. Combinatory logic

3. The power of λ and CL

4. Computable functions

5. Undecidability

6. Formal theories

7. Extensionality in λ-calculus

8. Extensionality in CL

9. Correspondence between λ and CL

10. Simple typing, Church-style

11. Simple typing, Curry-style in CL

12. Simple typing, Curry-style in λ

13. Generalizations of typing

14. Models of CL

15. Models of λ

16. Scott's D∞ and other models

Appendix A1. α-conversion

Appendix A2. Confluence proofs

Appendix A3. Normalization proofs

Appendix A4. Care of your pet combinator

Appendix A5. Answers to starred exercises

Bibliography

Index

查看详情

Lambda-Calculus and Combinators：An Introduction

内容简介:

作者简介:

目录: