{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:23:25Z","timestamp":1787531005980,"version":"build-2736575974"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2002,11,6]],"date-time":"2002-11-06T00:00:00Z","timestamp":1036540800000},"content-version":"unspecified","delay-in-days":5,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2002,11]]},"abstract":"<jats:p>Intensional polymorphism, the ability to dispatch to different routines based on types at run \ntime, enables a variety of advanced implementation techniques for polymorphic languages, \nincluding tag-free garbage collection, unboxed function arguments, polymorphic marshalling \nand attened data structures. To date, languages that support intensional polymorphism \nhave required a type-passing (as opposed to type-erasure) interpretation where types are \nconstructed and passed to polymorphic functions at run time. Unfortunately, type-passing \nsuffers from a number of drawbacks: it requires duplication of run-time constructs at the \nterm and type levels, it prevents abstraction, and it severely complicates polymorphic closure \nconversion. We present a type-theoretic framework that supports intensional polymorphism, \nbut avoids many of the disadvantages of type passing. In our approach, run-time type \ninformation is represented by ordinary terms. This avoids the duplication problem, allows us \nto recover abstraction, and avoids complications with closure conversion. In addition, our \ntype system provides another improvement in expressiveness; it allows unknown types to be \nrefined in place, thereby avoiding certain beta-expansions required by other frameworks.<\/jats:p>","DOI":"10.1017\/s0956796801004282","type":"journal-article","created":{"date-parts":[[2002,11,18]],"date-time":"2002-11-18T06:32:00Z","timestamp":1037601120000},"page":"567-600","source":"Crossref","is-referenced-by-count":33,"title":["Intensional polymorphism in type-erasure \nsemantics"],"prefix":"10.1017","volume":"12","author":[{"given":"KARL","family":"CRARY","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"STEPHANIE","family":"WEIRICH","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"GREG","family":"MORRISETT","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2002,11,6]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796801004282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:39Z","timestamp":1779834939000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796801004282\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0956796801004282"],"URL":"https:\/\/doi.org\/10.1017\/s0956796801004282","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}