حساب لامدا هو نظام شكلي في المنطق الرياضي للتوابع القابلة للحساب و يستخدم للتعبير عن الحساب على أساس التجريد، يمكن استخدامه لمحاكاة آلة تورينغ.
تعتمد لغات البرمجة التابعية مثل Lisp , ML, Miranda على حساب لامدا.
The Lambda Calculus is a formal system in mathematical logic for expressing computation based on function abstraction , that can be used to simulate any Turing machine.
Functional programming languages such as Lisp, ML, Miranda are based on Lambda Calculus.
المراجع المستخدمة
R. Bailey, “An Introduction to Hope,” in Functional Programming: Languages, Tools & Architectures, ed. S. Eisenbach, Ellis Horwood, Chichester, (1987)
H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North- Holland, Amsterdam, (1981)
W. H. Burge, Recursive Programming Techniques, Addison-Wesley, Reading, (1975)
A. Church, The Calculi of Lambda Conversion, Princeton University Press, Princeton, N.J., (1941)
J. R. Hindley and J. P. Seldin, Introduction to Combinators and l Calculus, Cambridge University Press, Cambridge, England, (1987)
P. H. Winston and B. K. P. Horn, LISP, Addison-Wesley, Reading, (1984).
AN INTRODUCTION TO FUNCTIONAL PROGRAMMING THROUGH LAMBDA CALCULUS, by Greg Michaelson