429 search results - page 35 / 86 » Polymorphic typed defunctionalization |
ICFP
2005
ACM
14 years 7 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...
DLS
2007
13 years 11 months ago
2007
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...
ICFP
2009
ACM
14 years 8 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...
OOPSLA
1995
Springer
13 years 11 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
JACM
2007
13 years 7 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...