Lower Bounds on Type Checking Overloading

Loading...
Thumbnail Image
Authors
Volpano, Dennis
Subjects
Advisors
Date of Issue
1996-01
Date
Jan 1996.
Publisher
Language
Abstract
Smith has proposed an elegant extension of the ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. This short note explores the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.
Type
Description
The article of record as published may be found at http://dx.doi.org/
Series/Report No
Department
Computer Science (CS)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Information Processing Letters, 57(1), pp. 9-14, Jan 1996.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections