Functional Programming

LA home
 PFL (λ-CCS)




Also see

The functional programming languages, such as Haskell, Lisp, Miranda, Scheme and SML, are based on Alonzo Church's λ-calculus.  λ-calculus, Turing machines and combinatorial logic are all equivalent in that they can compute exactly the same things but since the λ-calculus is the most like a programming language it has a good claim to being the prototype programming language.

A. Church, The Calculi of Lambda conversion,
Princeton Univ. Press, Annals of Mathematical Studies, 1941.
www #ad:

↑ © L. Allison,   (or as otherwise indicated).
Created with "vi (Linux)",  charset=iso-8859-1,   fetched Monday, 22-Jul-2024 22:20:12 UTC.

Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off.