
 Lambda calculus Summary 
  Lambda calculus can be used to cleanly define what a computable function is. The question of whether two lambda calculus expressions are equivalent cannot be solved by a general algorithm, and this was the first question, even before the halting problem, for which undecidability could be proved. 
  Barendregt, Henk, The lambda calculus, its syntax and semantics, NorthHolland (1984), is the comprehensive reference on the (untyped) lambda calculus; see also the paper Introduction to Lambda Calculus. 
  Church, Alonzo, An unsolvable problem of elementary number theory, American Journal of Mathematics, 58 (1936), pp. 
 www.bookrags.com /Lambda_calculus (2877 words) 
