Jenkins, Steven and Leavens, Gary T. (1996) Polymorphic Type-Checking in Scheme. Technical Report TR95-21a, Department of Computer Science, Iowa State University.
Polymorphic Type-Checking in Scheme
Steven Jenkins and Gary Leavens
This paper presents a type-inference system for Scheme that is designed to
be used by students in an introductory programming course. The major goal
of the work is to present a simple type inference system that can be used
by beginning students, yet is powerful enough to express the ideas of
types, polymorphism, abstract data types, and higher-order procedures.
The system also performs some rudimentary syntax checking. The system
uses subtyping, but only in a primitive fashion. It has a type datum which
is a supertype of all types, and a type poof which is a subtype of all types.
It uses and-types (intersection types) to control the use of datum and to
generate accurate but simple types.
Contact site administrator at: email@example.com