43 search results - page 4 / 9 » Recursion on Nested Datatypes in Dependent Type Theory |
128
click to vote
TYPES
2004
Springer
15 years 8 months ago
2004
Springer
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
126
click to vote
TLCA
2005
Springer
15 years 8 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
134
click to vote
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
123
click to vote
MPC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
131
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...