[1] : The Free On-line Dictionary of Computing (27 SEP 03)

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
     
     
see also:
lambda-calculus type function application instance polymorphic hindley-milner types 
functional programming haskell ml 

Typed >> T Words
Typed, definition of term: Typed
typed_pag1.html