TYPED LAMBDA-CALCULUS

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

TYPED LAMBDA-CALCULUS

Specialty Definition: TYPED LAMBDA-CALCULUS

DomainDefinition

Computing

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. (1995-03-25). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Crosswords: TYPED LAMBDA-CALCULUS

Specialty definitions using "TYPED LAMBDA-CALCULUS": Computational Adequacy Theorem ♦ functional programming ♦ head normalisation theorem ♦ polymorphic lambda-calculus ♦ Second-Order Lambda-calculus. (references)

Top     

Alternative Orthography: TYPED LAMBDA-CALCULUS


Hexadecimal (or equivalents, 770AD-1900s) (references)

54 59 50 45 44      4C 41 4D 42 44 41 2D 43 41 4C 43 55 4C 55 53

Leonardo da Vinci (1452-1519; backwards) (references)

    

Binary Code (1918-1938, probably earlier) (references)

01010100 01011001 01010000 01000101 01000100 00100000 01001100 01000001 01001101 01000010 01000100 01000001 00101101 01000011 01000001 01001100 01000011 01010101 01001100 01010101 01010011

HTML Code (1990) (references)

&#84 &#89 &#80 &#69 &#68 &#32 &#76 &#65 &#77 &#66 &#68 &#65 &#45 &#67 &#65 &#76 &#67 &#85 &#76 &#85 &#83

ISO 10646 (1991-1993) (references)

0054 0059 0050 0045 0044      004C 0041 004D 0042 0044 0041 002D 0043 0041 004C 0043 0055 004C 0055 0053

Encryption (beginner's substitution cypher): (references)

54595039382463547363835153735463755465553

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.