Constrained types and their expressiveness
- 1 September 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 18 (5) , 519-527
- https://doi.org/10.1145/232706.232715
Abstract
A constrained type consists of both a standard type and a constraint set. Such types enable efficient type inference for object-oriented languages with polymorphism and subtyping, as demonstrated by Eifrig, Smith, and Trifonov. Until now, it has been unclear how expressive constrained types are. In this article we study constrained types without universal quantification. We prove that they accept the same programs as the type system of Amadio and Cardelli with subtyping and recursive types. This result gives a precise connection between constrained types and the standard notion of types.Keywords
This publication has 5 references indexed in Scilit:
- A type system equivalent to flow analysisPublished by Association for Computing Machinery (ACM) ,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
- Type inference in the presence of overloading, subtyping and recursive typesPublished by Association for Computing Machinery (ACM) ,1992
- Type inference with simple subtypesJournal of Functional Programming, 1991