Lambda-Calculus and Combinators pdf epub mobi txt 电子书下载 2025

简体网页||繁体网页

☆☆☆☆☆

出版者:

作者:J. Roger Hindley

出品人:

页数:0

译者:

出版时间:2008-6

价格:$ 113.00

装帧:

isbn号码:9780511809835

丛书系列:

图书标签:

Lambda
函数式
fp
数学
lambda calculus
combinatory logic
functional programming
mathematical logic
computer science
theoretical computer science
recursion theory
type theory
foundations of programming
formal systems

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

具体描述

Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.

• The authors' 1986 version of this book is widely recognised as the best introduction to these topics for the reader with some previous experience of logic; this version builds and updates that framework • Accessible and clear: a non-technical treatment of the subject with the main ideas emphasized and illustrated by examples • Exercises are designed to give practice to beginners and range from elementary to advanced, with solutions to most found at the end of the book

作者简介

目录信息

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.
· · · · · · (收起)