99 search results - page 3 / 20 » Practical Programming with Higher-Order Encodings and Depend... |
POPL
1999
ACM
13 years 9 months ago
1999
ACM
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 ...
AFP
2004
Springer
13 years 10 months ago
2004
Springer
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
IFL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
PPDP
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...