Colored local type inference
- 1 January 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 36 (3) , 41-53
- https://doi.org/10.1145/373243.360207
Abstract
We present a type system for a language based on F≤, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination of type propagation and local constraint solving, rather than by global constraint solving. We re ne the previously existing local type inference system of Pierce and Turner[PT98] by allowing partial type information to be propagated. This is expressed by coloring types to indicate propagation directions. Propagating partial type information allows us to omit type annotations for the visitor pattern, the analogue of pattern matching in languages without sum types.Keywords
This publication has 22 references indexed in Scilit:
- Semi-Explicit First-Class Polymorphism for MLInformation and Computation, 1999
- Pragmatic subtyping in polymorphic languagesPublished by Association for Computing Machinery (ACM) ,1998
- First-class polymorphism with type inferencePublished by Association for Computing Machinery (ACM) ,1997
- Pizza into JavaPublished by Association for Computing Machinery (ACM) ,1997
- Type Inference for Recursively Constrained Types and its Application to OOPElectronic Notes in Theoretical Computer Science, 1995
- Type inclusion constraints and type inferencePublished by Association for Computing Machinery (ACM) ,1993
- Modula-3 language definitionACM SIGPLAN Notices, 1992
- Theorems for free!Published by Association for Computing Machinery (ACM) ,1989
- Partial polymorphic type inference and higher-order unificationPublished by Association for Computing Machinery (ACM) ,1988
- Semantics of context-free languagesTheory of Computing Systems, 1968