Name
Abstract | ||
|---|---|---|
The combination of higher-order subtyping with intersection types yieldsa typed model of object-oriented programming with multiple inheritance[11]. The target calculus, F! , a natural generalization of Girard's systemF!with intersection types and bounded polymorphism, is of independentinterest, and is our subject of study.Our main contribution is the proof that subtyping in F! is decidable.This yields as a corollary the decidability of subtyping in F! , its intersection... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BFb0022246 | CSL |
Keywords | Field | DocType |
intersection types,higher-order subtyping,object oriented programming,higher order,multiple inheritance,polymorphism | Discrete mathematics,Combinatorics,Bounded quantification,Decidability,Subtyping,Mathematics,Multiple inheritance | Conference |
Volume | ISSN | ISBN |
933 | 0302-9743 | 3-540-60017-5 |
Citations | PageRank | References |
13 | 1.24 | 12 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adriana B. Compagnoni | 1 | 62 | 7.16 |