|
In mathematical logic and type theory, the λ-cube is a framework for exploring the axes of refinement in Coquand's Calculus of Constructions, starting from the simply typed lambda calculus as the vertex of a (3-D) cube placed at the origin, and the calculus of constructions (= higher order polymorphic lambda calculus) as its diametric opposite vertex.
The idea of the cube is due to the mathematician Henk Barendregt.
See also
References
- Barendregt H., Introduction to generalized type systems, Journal of Functional Programming, 1(2):125-154, April 1991.
- Barendregt's Lambda Cube (http://www.rbjones.com/rbjpub/logic/cl/tlc001.htm)
|