2026-09-18T21:23:52Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1060722026-06-06T00:56:13Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Christopher J. Terman.
Boyer, Stephan
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-12-22T16:27:48Z
2016-12-22T16:27:48Z
2016
2016
http://hdl.handle.net/1721.1/106072
965197677
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).
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.
by Stephan Boyer.
M.Eng.
41 pages
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
The kernel of ad hoc polymorphism
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e8f57aa9-ae48-4819-8716-44641b8ff22a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>The kernel of ad hoc polymorphism</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Boyer, Stephan</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>