Summary: Soft Typing with Conditional Types
Alexander Aiken \Lambda and Edward L. Wimmers
IBM Almaden Research Center
650 Harry Rd., San Jose, CA 95120
faiken,wimmersg@almaden.ibm.com
T. K. Lakshman y
Department of Computer Science
University of Illinois at Urbana­Champaign
1304 W. Springfield Ave,
Urbana, IL 61801
lakshman@cs.uiuc.edu
Abstract
We present a simple and powerful type inference method
for dynamically typed languages where no type information
is supplied by the user. Type inference is reduced to the
problem of solvability of a system of type inclusion con­
straints over a type language that includes function types,
constructor types, union, intersection, and recursive types,
and conditional types. Conditional types enable us to ana­
lyze control flow using type inference, thus facilitating com­

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

Collections: Computer Technologies and Information Sciences