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

Summary Of: Lambda calculus

ideas from lambda calculus have found application in the fields of... with untyped lambda calculus being the original inspiration for... and typed lambda calculus serving as the foundation for modern... Lambda calculus and programming languages... the lambda calculus has no means of naming a function... the lambda calculus has no means for creating a function that accepts more than one argument... The lambda calculus may be seen as an idealised functional programming language... Another problem with the untyped lambda calculus is the inability to distinguish between different kinds of data... The basic lambda calculus may be used to model booleans... lambda calculus does not allow this... Lambda calculus and programming languages... Lambda calculus and programming languages... Lambda calculus is usually implemented using a... The first practical implementation of lambda calculus was provided in 1963 by... The most prominent counterparts to lambda calculus in programming are... property of the lambda calculus means that evaluation... the lambda calculus does not offer any explicit constructs for... The fact that lambda calculus terms act as functions on other lambda calculus terms... A version of lambda calculus with binary I... The Impact of the Lambda Calculus in Logic and Computer Science... Contains the lambda calculus definitions of several familiar functions... A classic paper highlighting the importance of lambda calculus as a basis for programming languages... recent monograph that covers the main topics of lambda calculus from the type... 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 | foundations of mathematics | Kleene–Rosser paradox | simply typed lambda calculus | logic | recursion theory (computability) | linguistics | theory of programming languages | functional programming | Lisp | type systems | Functions | computer science | identity function | anonymous form | currying | Haskell | Standard ML | truth values | recursively | combinatory logic | extensionality | if and only if | Church encoding | Mogensen-Scott encoding | arithmetic | natural numbers | Church numerals | higher-order function | laws of exponents | Church encoding for pairs | Fixed point combinator | Recursion | factorial | fixed point combinators | typed lambda calculus | Wikipedia:Summary style | 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 | 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 | First-class function | Anonymous function | Anonymous functions | Lisp | Haskell | 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 | 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 | ISBN 0444520775 | typed lambda calculi | pure type systems | lambda cube | subtyping | ISBN 0-262-16209-1 | type system | FOLDOC | permission | PDF | PDF | PDF | PlanetMath | Categories | Computational models | Lambda calculus | Theoretical computer science | Formal methods | Recursion theory | Articles with example code | American inventions |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Lambda calculus".