The kernel of ad hoc polymorphism

Author(s)
Boyer, Stephan
Thumbnail
DownloadFull printable version (1.804Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Christopher J. Terman.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Ad hoc polymorphism allows a value to take on multiple types, with a separate definition of the value provided for each type. We offer a new formalization of this old concept as a typed lambda calculus. Motivated by the aspiration of extending System F with ad hoc constraints, we introduce a new mechanism for implicit parameter passing. Putting these ideas together, we present a practical replacement for bounded type quantification with simpler metatheory.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (page 41).
 
Date issued
2016
URI
http://hdl.handle.net/1721.1/106072
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.
Collections