360 search results - page 4 / 72 » Dependently Typed Programming in Agda |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
IFIP
2004
Springer
14 years 27 days ago
2004
Springer
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
JFP
2007
13 years 7 months ago
2007
We present an approach to enriching the type system of ML with a restricted form of de
POPL
1999
ACM
13 years 12 months ago
1999
ACM
CORR
2010
Springer
13 years 7 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 ...