Foundations for the implementation of higher-order subtyping
- 1 August 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 32 (8) , 125-135
- https://doi.org/10.1145/258948.258961
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Higher-order subtypingTheoretical Computer Science, 1997
- Constructing type systems over an operational semanticsJournal of Symbolic Computation, 1992
- Inheritance as implicit coercionInformation and Computation, 1991
- An extension of system F with subtypingPublished by Springer Nature ,1991
- The coherence of languages with intersection typesPublished by Springer Nature ,1991
- A modest model of records, inheritance, and bounded quantificationInformation and Computation, 1990
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- Proofs as programsACM Transactions on Programming Languages and Systems, 1985
- Using category theory to design implicit conversions and generic operatorsPublished by Springer Nature ,1980
- Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des TypesPublished by Elsevier ,1971