Type Checking and Type Deduction Techniques for Polymorphic Programming Languages

CMU-CS-85-187

Paola Giannini

December 1985

In this paper we present some of the syntactic issues that arise in polymorphic programming languages. In particular we examine type checking and deduction in two different polymorphic type structures: the parametric lambda-calculus with let construct and the polymorphic or second-order lambda-calculus. In both approaches the behavior of types is formalized with type inference rules. Examples of programming languages following those approaches are presented and some of their specific problems studied.

44 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by reports@cs.cmu.edu