• 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

Sound and Complete Elimination of Singleton Kinds (2000)

Cached

  • Download as a PDF

Download Links

  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Karl Crary
Venue:In Third Workshop on Types in Compilation
Citations:11 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Crary00soundand,
    author = {Karl Crary},
    title = {Sound and Complete Elimination of Singleton Kinds},
    institution = {In Third Workshop on Types in Compilation},
    year = {2000}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can complicate the metatheory of languages in which they appear. I present a translation from a language with singleton kinds to one without, and prove that translation to be sound and complete. This translation is useful for type-preserving compilers generating typed target languages.

Citations

573 The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997
251 A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
251 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
208 Manifest types, modules, and separate compilation - Leroy - 1994
186 Typed memory management in a calculus of capabilities - Crary, Walker, et al. - 1999
156 Alias types - Smith, Walker, et al. - 2000
146 Typed closure conversion - Minamide, Morrisett, et al. - 1996
136 Stack-based typed assembly language - Morrisett, Crary, et al. - 2002
132 Intensional polymorphism in type-erasure semantics - Crary, Weirich, et al. - 1998
130 Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
96 Applicative functors and fully transparent higher-order modules - Leroy - 1995
80 A type-theoretic interpretation of Standard ML. Proof, language, and interaction: Essays in honor of robin milner - Harper, Stone - 2000
74 Flexible type analysis - Crary, Weirich - 1999
73 A modular module system - Leroy - 2000
58 Implementing typed intermediate languages - Shao, League, et al. - 1998
53 Translucent sums: A foundation for higher-order module systems - Lillibridge - 1997
42 Subtyping with singleton types - Aspinall - 1994
33 Typed cross-module compilation - Shao - 1998
25 Transparent modules with fully syntactic signatures - Shao - 1999
2 Extended version published as CMU technical report CMU-CS-98-178. [16] Greg Morrisett - Springer-Verlag - 1998
2 Implementing typed intermediate languages - Smith, Walker, et al. - 1998
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