Loading...
Please wait, while we are loading the content...
Similar Documents
Type inclusion constraints and type inference (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Aiken, Alexander Wimmers, Edward L. |
| Description | In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture |
| Abstract | We present a general algorithm for solving systems of inclusion constraints over type expressions. The constraint language includes function types, constructor types, and liberal intersection and union types. We illustrate the application of our constraint solving algorithm with a type inference system for the lambda calculus with constants. In this system, every pure lambda term has a (computable) type and every term typable in the Hindley/Milner system has all of its Hindley/Milner types. Thus, the inference system is an extension of the Hindley/Milner system that can type a very large set of lambda terms. 1 |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | Function Type Constructor Type Type Inclusion Constraint Hindley Milner Type Lambda Term Pure Lambda Term Term Typable Constraint Language General Algorithm Liberal Intersection Type Inference System Union Type Lambda Calculus Inclusion Constraint Large Set Hindley Milner System Type Inference Inference System Type Expression |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings |
