56 search results - page 4 / 12 » Polymorphic subtyping in O'Haskell |
FPCA
1989
13 years 11 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
POPL
1989
ACM
13 years 11 months ago
1989
ACM
Dynamic typing can be useful in statically typed languages. We extend the simply typed λ-calculus with dynamic typing and elaborate additional features like polymorphism and subty...