237 search results - page 11 / 48 » Coercions in a polymorphic type system |
186
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
152
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
131
click to vote
LISP
2006
15 years 6 months ago
2006
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
150
click to vote
JFP
2006
15 years 6 months ago
2006
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
162
click to vote
LICS
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...