Type reconstruction with first-class polymorphic values

Authors:
J. W. O'Toole, Jr.;D. K. Gifford
Affiliations:
MIT Laboratory for Computer Science, 545 Technology Sqqre, Cambridge, Massachusetts;MIT Laboratory for Computer Science, 545 Technology Sqqre, Cambridge, Massachusetts
Venue:
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Year:
1989

Citing 9
Cited 7

The typechecking of programs with implicit type structure.

Proc. of the international symposium on Semantics of data types
Partial polymorphic type inference and higher-order unification

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
A proper extension of ML with an effective type-assignment

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Expressiveness of Simple and Second-Order Type Structures

Journal of the ACM (JACM)
Polymorphic type inference

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modules for standard ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
An investigation of a programming language with a polymorphic type structure.

An investigation of a programming language with a polymorphic type structure.

Type-dependent parameter inference

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Compiling the polymorphic &lgr;-calculus

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Cluster: an informal report

ACM SIGPLAN Notices
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

ACM Transactions on Programming Languages and Systems (TOPLAS)
MLF: raising ML to the power of system F

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Recasting MLF

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first type reconstruction system which combines the implicit typing of ML with the full power of the explicitly typed second-order polymorphic lambda calculus. The system will accept ML-style programs, explicitly typed programs, and programs that use explicit types for all first-class polymorphic values. We accomplish this flexibility by providing both generic and explicitly-quantified polymorphic types, as well as operators which convert between these two forms of polymorphism. This type reconstruction system is an integral part of the FX-89 programming language. We present a type reconstruction algorithm for the system. The type reconstruction algorithm is proven sound and complete with respect to the formal typing rules.