Sciweavers

Share
2 search results - page 1 / 1
» Redundancies in Dependently Typed Lambda Calculi and Their R...
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
10 years 10 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
CORR
2010
Springer
180views Education» more  CORR 2010»
10 years 10 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
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 ...
Zachary Snow, David Baelde, Gopalan Nadathur
books