Functional Programming

LA home
Computing
FP
 λ-calculus
   Intro.
   Examples
   Syntax
   Interp.(L)
 PFL (λ-CCS)

 Ind.Prog. (IP)

 Haskell
 SML
 Compared

 CompJ88
 CompJ89
 SPE89
 CompJ90
 IPL92
 ACJ93
 ACSC03
 JFP05
 ACSC06

Also see
Logic
Semantics

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 University Press, Annals of Mathematical Studies, 1941.
www:


© L. Allison   http://www.allisons.org/ll/   (or as otherwise indicated),
Created with "vi (Linux or Solaris)",  charset=iso-8859-1,  fetched Tuesday, 22-Jul-2014 21:20:47 EST.

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