Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
typed lambda-calculus
Jump to user comments
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.