Lambda-Calculus and Combinators读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 358页 | 2008 | Cambridge University Press |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| USD 84.99 | 2008-08-11 … | 2023-03-11 … | 84 |
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 version, first published in 2008, is thoroughly revised and offers an account of the subject wit...
作者简介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 version, first published in 2008, is thoroughly revised and offers an 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.
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。