The kernel of ad hoc polymorphism

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Boyer, Stephan

Advisor dc:contributor.advisor

• Christopher J. Terman.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/106072

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/106072