Researchtype theorydependent typeslambda calculus
Lambda Cube Formalizes Type Dependency Dimensions
|
4.8
The lambda cube, introduced by Henk Barendregt, is a framework in type theory that classifies eight typed lambda calculi by three dependency dimensions (terms on terms, types on terms, types on types). It outlines syntax, β-reduction, typing rules and correspondences—λ→, λ2, λP, λω and λC—and explains expressiveness differences and relevance to language design and proof assistants like Coq.
Scoring Rationale
Moderate foundational relevance across programming-language theory, limited novelty, and reliance on a secondary source reduces immediate impact.
Practice interview problems based on real data
1,500+ SQL & Python problems across 15 industry datasets — the exact type of data you work with.
Try 250 free problems
