19 search results - page 2 / 4 » Typed Normal Form Bisimulation for Parametric Polymorphism |
ICFP
1999
ACM
13 years 9 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
TAPSOFT
1991
Springer
13 years 8 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
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...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...