7 search results - page 1 / 2 » On the Decidability of Subtyping with Bounded Existential Ty... |
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
LICS
1997
IEEE
13 years 8 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
POPL
2005
ACM
14 years 5 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...