archives

Polymorphic Type-Checking in Scheme


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Jenkins, Steven and Leavens, Gary T. (1996) Polymorphic Type-Checking in Scheme. Technical Report TR95-21a, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

Polymorphic Type-Checking in Scheme
by
Steven Jenkins and Gary Leavens
Abstract
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.

Subjects:All uncategorized technical reports
ID code:00000119
Deposited by:Staff Account on 07 June 1996



Contact site administrator at: ssg@cs.iastate.edu