169 search results - page 2 / 34 » A type system for well-founded recursion |
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
FOSSACS
2010
Springer
13 years 10 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
LICS
2006
IEEE
14 years 27 days 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 ...
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...