Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Type Inclusion Constraints and Type Inference Alexander Aiken
 

Summary: Type Inclusion Constraints and Type Inference
Alexander Aiken
IBM Almaden Research Center
650 Harry Rd., San Jose, CA 95120
aiken@almaden.ibm.com
Edward L. Wimmers
IBM Almaden Research Center
650 Harry Rd., San Jose, CA 95120
wimmers@almaden.ibm.com
November 16, 1993
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 Introduction
Type inference systems for functional languages are based on solving systems of type constraints. The

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences