Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Programming with Intersection Types and Bounded Polymorphism
 

Summary: Programming with Intersection Types
and Bounded Polymorphism
Benjamin C. Pierce
December 20, 1991
CMU-CS-91-205
Submitted in partial fulfillment of the requirements
for the degree of Doctor of Philosophy
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
This research was sponsored in part by the Avionics Laboratory, Wright Research and Development Center,
Aeronautical Systems Division (AFSC), U. S. Air Force, Wright-Patterson AFB, OH 45433-6543 under Contract F33615-
90-C-1465, Arpa Order No. 7597; in part by the Office of Naval Research under Contract N00013-84-K-0415; in part by
the National Science Foundation under Contract CCR-8922109; and in part by Siemens.
The views and conclusions contained in this document are those of the author and should not be interpreted as
representing the official policies, either expressed or implied, of the U.S. Government.
Keywords: Lambda calculus and related systems, language theory, programming, type struc-
ture, data types and structures, polymorphism, subtyping, bounded quantification, intersection
types.
Abstract

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics