Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Information and Computation - Semantics of Data Types
Strictness analysis via abstract interpretation for recursively defined types
Information and Computation
Handbook of logic in computer science (vol. 2): background: computational structures
Handbook of logic in computer science (vol. 2): background: computational structures
Typed $\lambda$-calculi with one binder
Journal of Functional Programming
| Hi-index | 0.00 |
The introduction of a general definition of function was key to Frege's formalisation of logic. Self-application of functions was at the heart of Russell's paradox in 1902. This led Russell to introduce type theory in order to control the application of functions and hence to avoid the paradox. Since, different type systems have been introduced, each allowing different functional power. Eight of these influential systems have been unified in the so-called Barendregt cube. These eight systems use different binders for functions and types and do not allow types to have the same instantiation right as functions. De Bruijn in his Automath did not make these distinctions. In this tutorial, we discuss the modern, as well as de Bruijn's framework of functions and types and study the cube in different frameowrks.