5 search results - page 1 / 1 » Admissibility of Fixpoint Induction over Partial Types |
117
Voted
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
95
Voted
TPHOL
2008
IEEE
15 years 3 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
88
Voted
TLCA
2007
Springer
15 years 3 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
172
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...