一直想找一篇给小白们看的lambda演算教学文章,和图灵机一样,lambda演算也是计算机理论基础的重要组成部分。也是理解函数式编程的一扇窗户。这篇文章的作者是一位来自MIT media lab的工作人员,从介绍上看他是一位认知科学家。原文的标题叫做: The Lambda Calculus for Absolute Dummies。 原文链接:http://palmstroem.b...
原文的标题叫做: The Lambda Calculus for Absolute Dummies。 原文链接:http://palmstroem.blogspot.hk/2012/05/lambda-calculus-for-absolute-dummies.html 作者:Joscha Bach, Cognitive Scientist 发明Lambda 演算的作者叫做阿隆佐邱奇(Alonzo Church), 发明图灵机的作者叫做阿兰图灵(Alan Turing)。他们几乎活跃在同...
Lambda calculus notation with nameless dummies: A tool for automatic formula manipulation, with application to the Church- Rosser theorem. Indagaciones Mathematische, 34:381-392, 1972.N.G. De Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manip- ulation, ...
In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system ...
Abstract It has been argued elsewhere that a logic programming language with function variables and λ-abstractions within terms makes a very good meta-programming language, especially when an object language contains notions of bound variables and scope. The λProlog logic programming language and the...
N. G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indag. Math 34 (1972), 381-392.N. G. de Bruijn (1972): Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula ...
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occ... ...
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occ... ...