55 search results - page 3 / 11 » Relational Reasoning for Recursive Types and References |
107
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
123
click to vote
LICS
2003
IEEE
15 years 8 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
130
Voted
LICS
2002
IEEE
15 years 7 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...
131
click to vote
TLCA
2007
Springer
15 years 9 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...
129
click to vote
ITP
2010
15 years 6 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...