Loading...
Please wait, while we are loading the content...
Similar Documents
Pragmatic Subtyping in Polymorphic Languages (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Nordlander, Johan |
| Description | We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalence. This approach allows the subtype relation to be defined by incremental construction of polymorphic records and datatypes, in a way that subsumes the basic type systems of both languages like ML and Java. As the main contribution of the paper, we describe a partial type inference algorithm for the extended system which favours succinctness over generality, in the sense that it never infers types with subtype constraints. The algorithm is based on an efficient approximating constraint solver, and is able to type a wide range of programs that utilize subtyping and polymorphism in a non-trivial way. Since constrained types are not inferred, the algorithm cannot be complete; however, we provide a completeness result w. r. t. the Hindley/Milner type system as a form of characterizing lower bound. 1 Introduction The combination of subtyping with polymorphic type inference has been under i... |
| File Format | |
| Language | English |
| Publisher Date | 1997-01-01 |
| Publisher Institution | In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98 |
| Access Restriction | Open |
| Subject Keyword | Main Contribution Polymorphic Type Inference Name Inequivalence Polymorphic Record Basic Type System Non-trivial Way Completeness Result Wide Range Incremental Construction Constraint Solver Subtype Relation Hindley Milner Type System Extended System Polymorphic Language Pragmatic Subtyping Partial Type Inference Algorithm Subtype Constraint Algorithm Cannot |
| Content Type | Text |
| Resource Type | Article |
