22 search results - page 2 / 5 » Erasure and Polymorphism in Pure Type Systems |
LFCS
1994
Springer
13 years 9 months ago
1994
Springer
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt's typed -cube [4]. The first is obtained from the latter through applying...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
POPL
2003
ACM
13 years 10 months ago
2003
ACM
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
TPHOL
1997
IEEE
13 years 9 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...