Lambda calculus

From Conservapedia
This is the current revision of Lambda calculus as edited by CSGuy (talk | contribs) at 01:57, May 4, 2008. This URL is a permanent link to this version of this page.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Lambda calculus is a type-theory where formulae have an ordinal-valued type. Formulae are built up using Lambda λ abstraction and application. Lambda calculus is used by computer programmers to avoid paradoxes.

Retrieved from "https://www.conservapedia.com/index.php?title=Lambda_calculus&oldid=446177"