The lambda cube
- type theory
Henk Barendregt’s lambda cube organizes eight related typed lambda calculi through three kinds of dependency. The dimensions distinguish allowing terms to depend on types, types on types, and types on terms, starting from a simply typed base. This framework makes relationships among polymorphism, type operators and dependent types explicit. It is a classification of particular calculi, not a map containing every possible type theory or language extension. Its value is explanatory: seemingly different systems can be compared through controlled changes in their formation rules. **Timeline anchor:** 1 January 1991 CE. Year of publication. **References:** [Source 1](https://en.wikipedia.org/wiki/Lambda_cube), [Source 2](https://en.wikipedia.org/wiki/Henk_Barendregt).
Sources
On other timelines
- The lambda cube organizes generalized typed calculi on Type theory · foundations, languages, proof assistants and program logics by @athan