Simplifying Subtyping Constraints: A Theory
- 1 November 2001
- journal article
- Published by Elsevier in Information and Computation
- Vol. 170 (2) , 153-183
- https://doi.org/10.1006/inco.2001.2963
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Partial online cycle elimination in inclusion constraint graphsACM SIGPLAN Notices, 1998
- A toolkit for constructing type- and constraint-based program analysesPublished by Springer Nature ,1998
- Constraint automata and the complexity of recursive subtype entailmentPublished by Springer Nature ,1998
- Componential set-based analysisACM SIGPLAN Notices, 1997
- Satisfying subtype inequalities in polynomial spacePublished by Springer Nature ,1997
- Sound polymorphic type inference for objectsACM SIGPLAN Notices, 1995
- Type Inference for Recursively Constrained Types and its Application to OOPElectronic Notes in Theoretical Computer Science, 1995
- Subtyping recursive typesACM Transactions on Programming Languages and Systems, 1993
- Fundamental properties of infinite treesTheoretical Computer Science, 1983