Word:

typed lambda-calculus

(theory)typed lambda-calculus - (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.
Browse
type I allergic reaction
type I diabetes
type II diabetes
type inference
type IV allergic reaction
type metal
type O
type of architecture
type scheme
type species
type specimen
Type wheel
type-ahead
type-ahead search
typecast
typed
-- typed lambda-calculus --
TypedProlog
typeface
typescript
typeset
Typesetter
Typesetting
typesetting machine
Typewrite
Typewriter
typewriter carriage
typewriter font
typewriter keyboard
typewriter paper
typewriter ribbon
Typewriting
typewritten
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy