Well, there's always An Introduction to Lambda Calculus. I've tried reading it a few times, but always got stuck. I have a nagging feeling that I already know most of this stuff and would probably have an easier time understanding it if it was presented in terms of Lisp/Scheme rather than math. You might have better luck, though :)
Try writing a lambda calculus interpetter, ideally in a functional language using the build in syntax of the language rather than via a parser. This is surprisingly easy and a good way to improve your feel for it.
I recently bought a book from Amazon titled as "An Introduction to Functional Programming Through Lambda Calculus" by Greg Michaelson. It is more of an introduction to functional programming and also introduces lambda calculus. The first impression is quite good. A self contained and easy to read book. Here , you can download free version without index in PostScript.
The book that really made me start to use and understand lambda calculus was "Representation and Inference for Natural Language" by Blackburn and Bos. This is a book about natural language processing using Prolog. Another book you might consider is "Natural Language Understanding" by Allen. Finally, if you like lambda calculus, you will probably also enjoy combinatory logic, as the combinators can be defined as lambda expressions. For this, I strongly recommend Smullyan's book of puzzles, "To Mock A Mockingbird." Toward the end he uses the combinators to build a rudimentary programming language.
I think the reference on the subject of lambda-calculus itself still is Barendregt's book.
Beyond that it pretty much depends on what "part" of lambda-calculus you are interested in : typing ? proof theory ? term rewriting ? functional programming ?
Each of these is a field in itself, and I don't know of any book that covers it all.
发布评论
评论（8）
如果您已阅读完维基百科条目，请点击其链接访问在线计算机程序的结构和解释，做作业，或阅读这本书。
If you are done with the Wikipedia entry, follow its link to the online Structure and Interpretation of Computer Programs, do the assignments, or read the book.
好吧，总有简介到 Lambda 演算。 我试着读了几次，但总是卡住。 我有一种挥之不去的感觉，我已经知道了这些东西的大部分，并且如果它以 Lisp/Scheme 而不是数学的形式呈现，可能会更容易理解它。 不过，你可能会有更好的运气:)
Well, there's always An Introduction to Lambda Calculus. I've tried reading it a few times, but always got stuck. I have a nagging feeling that I already know most of this stuff and would probably have an easier time understanding it if it was presented in terms of Lisp/Scheme rather than math. You might have better luck, though :)
我找到了 Chris Hankin 的“计算机科学家的 Lambda 演算简介”相当不错，但我只在一个类中使用过它 - 没有在现实世界中使用它:)
< img src="https://i.sstatic.net/9ZJY6.jpg" alt="替代文字">
I found "An introduction to Lambda Calculi for Computer Scientists" by Chris Hankin to be pretty good, but I only really used it for one class - not used it in the real world :)
尝试编写 lambda 演算解释器，最好使用函数式语言，使用该语言的内置语法，而不是通过解析器。 这是非常简单的，也是提高你的感觉的好方法。
Try writing a lambda calculus interpetter, ideally in a functional language using the build in syntax of the language rather than via a parser. This is surprisingly easy and a good way to improve your feel for it.
我最近从 Amazon 买了一本名为 “通过 Lambda 演算进行函数式编程简介” 格雷格·迈克尔森。 它更多地介绍了函数式编程，还介绍了 lambda 演算。 第一印象相当不错。 一本独立且易于阅读的书。 在这里，您可以下载没有 PostScript 索引的免费版本。
I recently bought a book from Amazon titled as "An Introduction to Functional Programming Through Lambda Calculus" by Greg Michaelson. It is more of an introduction to functional programming and also introduces lambda calculus. The first impression is quite good. A self contained and easy to read book. Here , you can download free version without index in PostScript.
真正让我开始使用和理解 lambda 演算的书是 Blackburn 和 Bos 写的《Representation and Inference for Natural Language》。 这是一本关于使用 Prolog 进行自然语言处理的书。 您可能会考虑的另一本书是艾伦的《自然语言理解》。 最后，如果您喜欢 lambda 演算，您可能也会喜欢组合逻辑，因为组合器可以定义为 lambda 表达式。 为此，我强烈推荐斯穆里安的拼图书《模仿一只知更鸟》。 最后，他使用组合器构建了一种基本的编程语言。
The book that really made me start to use and understand lambda calculus was "Representation and Inference for Natural Language" by Blackburn and Bos. This is a book about natural language processing using Prolog. Another book you might consider is "Natural Language Understanding" by Allen. Finally, if you like lambda calculus, you will probably also enjoy combinatory logic, as the combinators can be defined as lambda expressions. For this, I strongly recommend Smullyan's book of puzzles, "To Mock A Mockingbird." Toward the end he uses the combinators to build a rudimentary programming language.
我认为关于 lambda 演算本身主题的参考文献仍然是 Barendregt 的书 。
除此之外，这很大程度上取决于您对 lambda 演算的哪个“部分”感兴趣：打字？ 证明理论 ? 术语重写？ 函数式编程 ?
其中每一个本身就是一个领域，我不知道有哪本书涵盖了所有这些。
I think the reference on the subject of lambda-calculus itself still is Barendregt's book.
Beyond that it pretty much depends on what "part" of lambda-calculus you are interested in : typing ? proof theory ? term rewriting ? functional programming ?
Each of these is a field in itself, and I don't know of any book that covers it all.
这是一个很好的解释（使用Scheme）： http://www.cs.brown.edu/courses/cs173/2002/Lectures/2002-10-28-lc.pdf
这里有一点（来自我的博客），将递归阶乘减少为纯拉姆达：
http://blogs.msdn.com /b/ashleyf/archive/2008/12/03/the-lambda-calculus.aspx
玩得开心！
Here is a nice explanation (using Scheme): http://www.cs.brown.edu/courses/cs173/2002/Lectures/2002-10-28-lc.pdf
And here's a nifty bit (from my blog), reducing recursive factorial to pure lambdas:
http://blogs.msdn.com/b/ashleyf/archive/2008/12/03/the-lambda-calculus.aspx
Have fun!