• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Intensional Polymorphism in Type-Erasure Semantics (2002)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cornell.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cornell.edu]
  • [www.seas.upenn.edu]
  • [www.seas.upenn.edu]
  • [www.seas.upenn.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Karl Crary , Stephanie Weirich , Greg Morrisett
Citations:132 - 36 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Crary02intensionalpolymorphism,
    author = {Karl Crary and Stephanie Weirich and Greg Morrisett},
    title = {Intensional Polymorphism in Type-Erasure Semantics},
    year = {2002}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Intensional polymorphism, the ability to dispatch to di#erent routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, polymorphic marshalling, and flattened data structures. To date, languages that support intensional polymorphism have required a type-passing (as opposed to type-erasure) interpretation where types are constructed and passed to polymorphic functions at run time. Unfortunately, type-passing su#ers from a number of drawbacks: it requires duplication of run-time constructs at the term and type levels, it prevents abstraction, and it severely complicates polymorphic closure conversion.

Citations

473 Lambda calculi with types - BARENDREGT - 1991
251 Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur - Girard - 1972
251 A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
251 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
195 Une extension de l'interpr'etation de Godel `a l'analyse, et son application `a l"elimination des coupures dans l'analyse et la th'eorie des types - Girard - 1971
130 Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
97 Compiling with Types - Morrisett - 1995
86 From region inference to von Neumann machines via region representation inference - Birkedal, Tofte, et al. - 1996
74 Flexible type analysis - Crary, Weirich - 1999
65 Tag-free garbage collection using explicit type parameters - Tolmach - 1994
53 Types, abstraction, and parametric polymorphism, part 2 - Ma, Reynolds - 1992
43 Fully Reflexive Intensional Type Analysis - Trifonov, Saha, et al. - 2000
40 Semantics of memory management for polymorphic languages - Morrisett, Harper - 1997
39 The TIL/ML compiler: Performance and safety through types - Morrisett, Tarditi, et al. - 1996
18 Compiler-directed type reconstruction for polymorphic languages - Aditya, Caro - 1993
15 A type-based semantics for userdefined marshalling in polymorphic languages - Duggan - 1998
13 Optimal type lifting - Saha, Shao - 1998
10 Full lifting of type parameters - Minamide - 1997
9 From System F to typed assembly language. ACM transactions on programming languages and systems - Morrisett, Walker, et al. - 1999
8 Intensional analysis of functions and types - Constable - 1982
8 TIL: A type-directed optimizing compiler for - Tarditi, Morrisett, et al. - 1996
6 Unboxed objects and polymorphic typing. Pages 177–188 of: 19th symposium Principles of Programming Languages - Leroy - 1992
4 Abstract types have existential type, ACM transactions on programmming languages and systems - Mitchell, Plotkin - 1988
2 A core calculus of dependency. Pages 147–160 of: Twenty-sixth ACM symposium on principles of programming languages - Abadi, Banerjee, et al. - 1999
2 The type theory of PL/CV3. ACM Transactions on ProgrammingLanguages and Systems - Constable, Zlatin - 1984
1 Extensional polymorphism. Pages 118--129 of: Twenty-second ACM SIGACT-SIGPLAN symposium on principles of programming languages - Dubois, Rouaix - 1995
1 Explicit polymorphism and CPS conversion. Pages 206--219 of: Twentieth ACM SIGACT-SIGPLAN symposium on principles of programming languages - Harper - 1993
1 A theory of qualified types. Fourth european symposium on programming - Jones - 1992
1 Typed closure conversion. Pages 271--283 of: Twenty-third ACM SIGACT-SIGPLAN symposium on principles of programming languages - Minamide, Morrisett - 1996
1 Abstract models of memory management. Conference on functional programming languages and computer architecture - Morrisett, Felleisen - 1995
1 Partitioning dataflow analyses using types. Pages 15--26 of: Twenty-fourth ACM SIGACT-SIGPLAN symposium on principles of programming languages - Ruf - 1997
1 Flexible representation analysis. Pages 85--98 - Shao - 1997
1 An overview of the FLINT/ML compiler. 1997 workshop on types in compilation - Shao - 1997
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University