Summary Of: Lambda calculus

Encyclodia Page On: Lambda calculus

These Are Links To Other Documents

| Typed lambda calculus | merged | Discuss | mathematical logic | computer science | formal system | function | recursion | Alonzo Church | Stephen Cole Kleene | foundations of mathematics | computability or recursion theory | functional programming | first-class entities | reification | side effects | algorithm | functional programming | Erlang | Haskell | Lisp | ML | Scheme | Clojure | F# | Nemerle | Scala | mathematical foundations | Curry-Howard correspondence | Kleene-Rosser paradox | typed lambda calculi | anonymous function | anonymous function | unary function | left associative | currying | combinator | combinatory logic | recursively | combinatory logic | extensionality | if and only if | Church encoding | Mogensen-Scott encoding | natural numbers | Church numerals | higher-order function | laws of exponents | Church encoding for pairs | Fixed point combinator | Recursion | factorial | Y combinator | natural numbers | computable function | if and only if | computability | Church-Turing thesis | computable function | Church's thesis | Gödel numbering | Gödel's first incompleteness theorem | Gödel number | Peter Landin | procedural programming languages | reifies | first-class objects | higher-order functions | Funarg problem | virtual machine | Peter Landin | SECD machine | Categorical abstract machine | functional programming languages | constants | datatypes | Lisp | Pure Lisp | Lisp | first-class objects | imperative languages | Pascal | C | C++ | object-oriented languages | C++ | Smalltalk | Eiffel | C# | tuple | Python | first-class objects | Boost | Evaluation strategy | eager evaluation | lazy evaluation | Lisp | ML | C | Java | thunk | Miranda | Haskell | theorem provers | lazy evaluation | computational complexity | O(n) | explicit substitution | director strings | Church-Rosser | nondeterministic evaluation strategies | parallelism | Futures | process calculi | cardinality | Dana Scott | continuous functions | domain | model | denotational semantics | Anonymous recursion | recursive | Applicative computing systems | objects | Binary Lambda Calculus | Calculus of constructions | types | Cartesian closed category | category theory | Categorical abstract machine | model of computation | Combinatory logic | mathematical logic | Curry-Howard isomorphism | proofs | Domain theory | posets | denotational semantics | Evaluation strategy | programming languages | Explicit substitution | Harrop formula | Kleene-Rosser paradox | Knights of the Lambda Calculus | LISP | Scheme | hackers | Lambda cube | Lambda-mu calculus | classical logic | Rewriting | SECD machine | virtual machine | SKI combinator calculus | System F | type | Typed lambda calculus | typed | Unlambda | esoteric | functional | programming language | ISBN 0-444-87508-5 | Simon Peyton Jones | Structure and Interpretation of Computer Programs | The MIT Press | ISBN 0-262-51087-1 | Barendregt, Hendrik Pieter | North-Holland | ISBN 0-7204-2285-X | American Journal of Mathematics | American Journal of Mathematics | Landin, Peter | Communications of the ACM | FOLDOC | permission | PDF | PDF | PDF | PDF | PlanetMath | Categories | Computational models | Lambda calculus | Theoretical computer science | Formal methods | Recursion theory | Articles with example code | American inventions | Articles to be merged from June 2009 | All articles to be merged |