237 search results - page 1 / 48 » Coercions in a polymorphic type system |
MSCS
2008
13 years 4 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
AISC
1992
Springer
13 years 8 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
POPL
1992
ACM
13 years 8 months ago
1992
ACM
This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations, more efficien...
ICFP
1997
ACM
13 years 8 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...