Site Navigation
Categories:
Computational models
Lambda calculus
Theoretical computer science
Formal methods
Recursion theory
Articles with example code

Summary Of: Lambda calculus

The lambda calculus can be thought of as an idealized... The lambda calculus continues to play an important role in... the untyped lambda calculus is unable to avoid set... Lambda calculus and programming languages... lambda calculus is quite interesting and unique within both... A function of two variables is expressed in lambda calculus as a function of one argument which returns a function of one argument... Lambda calculus expressions may contain... lambda calculus does not allow this... out that it can be implemented in the lambda calculus using what is known as the... Lambda calculus and programming languages... Lambda calculus and programming languages... Implementing the lambda calculus on a computer involves treating... The most prominent counterparts to lambda calculus in programming are... Rosser property of the lambda calculus means that evaluation... the lambda calculus does not offer any explicit constructs for... The Impact of the Lambda Calculus in Logic and Computer Science... Contains the lambda calculus definitions of several familiar functions... A Graphical Notation for the Lambda Calculus with Animated Reduction... Lambda Calculus links on Lambda...

Encyclodia Page On: Lambda calculus

These Are Links To Other Documents
mathematical logic | computer science | formal system | function | recursion | Alonzo Church | Stephen Cole Kleene | foundations of mathematics | computability or recursion theory | functional programming | algorithm | functional programming | Erlang | Haskell | Lisp | ML | Scheme | mathematical foundations | Curry-Howard correspondence | Kleene-Rosser paradox | typed lambda calculi | unary function | computation | mathematics | left associative | currying | combinator | combinatory logic | recursively | combinatory logic | extensionality | if and only if | natural numbers | Church numerals | higher-order function | laws of exponents | Church encoding for pairs | 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 | programming languages | first-class objects | Funarg problem | functional programming languages | constants | datatypes | Lisp | Pure Lisp | first-class objects | imperative languages | Pascal | C | C++ | object-oriented languages | C++ | Smalltalk | Eiffel | C# | tuple | Python | first-class objects | Boost | delegate | 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 | nondeterministic evaluation strategies | parallelism | process calculi | Anonymous recursion | Combinatory logic | Curry-Howard isomorphism | Evaluation strategy | Explicit substitution | Knights of the Lambda Calculus | Lambda cube | Rewriting | SKI combinator calculus | System F | Calculus of constructions | Typed lambda calculus | Unlambda | Lambda-mu calculus | Cartesian closed category | Categorical abstract machine | Applicative computing systems | ISBN 0-444-87508-5 | 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 |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Lambda calculus".