Thumbnail
Access Restriction
Subscribed

Author Weirich, Stephanie
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Ad-hoc polymorphism ♦ Type classes ♦ Dynamic typing ♦ Intensional type analysis
Abstract In a language with non-parametric or ad-hoc polymorphism, it is possible to determine the identity of a type variable at run-time. With this facility, we can write a function to convert a term from one abstract type to another, if the two hidden types are identical. However, the naive implementation of this function requires that the term be destructed and rebuilt. In this paper, we show how to eliminate this overhead using higher-order type abstraction. We demonstrate this solution in two frameworks for ad-hoc polymorphism: intensional type analysis and type classes.
Description Affiliation: Department of Computer Science, Cornell University, Ithaca, NY (Weirich, Stephanie)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 35
Issue Number 9
Page Count 10
Starting Page 58
Ending Page 67


Open content in new tab

   Open content in new tab
Source: ACM Digital Library