2 search results - page 1 / 1 » Redundancies in Dependently Typed Lambda Calculi and Their R... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...