关于lambda演算的资料总结

1.王垠的博客
1.1 图灵的光环 http://www.yinwang.org/blog-cn/2015/10/18/turing
1.2 丘奇和图灵 http://www.yinwang.org/blog-cn/2013/07/13/church-turing


2. Neil Jones, 《Computability and Complexity: From a Programming Perspective》

3. 《计算机程序的构造与解释》 

4. 《root of list》丘奇和图灵

5. Matthias Felleisen,Matthew Flatt. 《Programming Languages and Lambda Calculi》

6. 神奇的λ演算 https://www.jianshu.com/p/e7db2f50b012

7. H. P. Barendregt, The Lambda Calculus. North-Holland, revised edition, 1984.

8. R. Hindley & J. P. Seldin, Introduction to Combinators and Lambda-Calculus, Cambridge University Press, 1986.

9. Lecture notes on lambda calculus ,Peter Silinger

10.Henk Barendregt, Lambda calculus its syntax and semantics(只讲无类型的)

11. Henk Barendregt, Lambda Calculi with Types

12.  Lambda Calculus and Combinator, an introduction

13. introduction to lambda calculus

14. lambda calculu

  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
The λ-calculus and combinatory logic are two systems of logic which can also serve as abstract programming languages. They both aim to describe some very general properties of programs that can modify other programs, in an abstract setting not cluttered by details. In some ways they are rivals, in others they support each other. The λ-calculus was invented around 1930 by an American logician Alonzo Church, as part of a comprehensive logical system which included higher-order operators (operators which act on other operators). In fact the language of λ-calculus, or some other essentially equivalent notation, is a key part of most higher-order languages, whether for logic or for computer programming. Indeed, the first uncomputable problems to be discovered were originally described, not in terms of idealized computers such as Turing machines, but in λ-calculus. Combinatory logic has the same aims as λ-calculus, and can express the same computational concepts, but its grammar is much simpler. Its basic idea is due to two people: Moses Sch¨onfinkel, who first thought of it in 1920, and Haskell Curry, who independently re-discovered it seven years later and turned it into a workable technique. The purpose of this book is to introduce the reader to the basic methods and results in both fields. The reader is assumed to have no previous knowledge of these fields, but to know a little about propositional and predicate logic and recursive functions, and to have some experience with mathematical induction. Exercises are included, and answers to most of them (those marked ∗) are given in an appendix at the end of the book. In the early chapters there are also some extra exercises without answers, to give more routine practice if needed.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值