Notes:Lambda calculus

From Maths
Revision as of 19:46, 11 August 2015 by Alec (Talk | contribs) (Saving progress so far)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

This is a NOTES page, so it isn't an actual page in the wiki yet!

Lambda terms

We define λ-terms as follows:[1]
Let the following be given:

  • Variables: an infinite sequence of expressions, v1,,vn [Note 1]
  • Atomic constants: a sequence of expressions again, that may also be finite or empty

The set of expressions called λ-terms is defined inductively as follows:

  1. All variables and atomic constants are λ-terms
    • These are known as atoms
  2. If M and N are λ-terms then (MN) is a λ-term
    • Known as applications
    • this is a short hand for M(N) in our modern terminology[1]
  3. If M is any λ-term and x any variable then (λx.M) is a λ-term
    • Any such expression is called an abstraction

Examples

  • (λv0.(v0v00)) - a function that xx(v00) I think

Notes

  1. Jump up The book uses v0,v00,v000, for some yet unknown reason

References

  1. Jump up to: 1.0 1.1 Lambda Calculus and Combinators, an introduction, J. Roger Hindley and Jonathan P. Seldin