typed lambda-calculus

Computing Dictionary

typed lambda-calculus definition

theory
(TLC) A variety of lambda-calculus in which every term is labelled with a type.
A function application (A B) is only synctactically valid if A has type s --> t, where the type of B is s (or an instance or s in a polymorphic language) and t is any type.
If the types allowed for terms are restricted, e.g. to Hindley-Milner types then no term may be applied to itself, thus avoiding one kind of non-terminating evaluation.
Most functional programming languages, e.g. Haskell, ML, are closely based on variants of the typed lambda-calculus.
(1995-03-25)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: typecast
Next Definition: typedprolog
More from Thesaurus.com
Synonyms and Antonyms for typed lambda-calculus
More from Reference.com
Search for articles containing typed lambda-calculus
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature