Summary: 1
Types, Abstraction,
and Parametric Polymorphism
| for Domains
John C. Reynolds 1
Department of Computer Science
Carnegie Mellon University
MFPS XX | May 2004
(corrected May 27, 2004)
c
2004 John C. Reynolds
john.reynolds@cs.cmu.edu
1 Research partially supported by NSF Grant CCR-0204242.

2
The Syntax of Types and Contexts
Let T be a nite set of type variables. Then  T , the set of types
over T , is the least family of sets such that
 If  2 T , then  2  T .
 If ;  0 2  T , then  !  0 2  T .

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Reynolds, John C. - School of Computer Science, Carnegie Mellon University

Collections: Computer Technologies and Information Sciences; Mathematics