Sound and complete elimination of singleton kinds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2071, Issue , 2001, Pages 1-25

  Crary, Karl ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

DECISION PROCEDURE; META-THEORY; SINGLETON KINDS; SOUND AND COMPLETE; SOUNDNESS AND COMPLETENESS; TARGET LANGUAGE; TYPE EQUALITY; TYPE EQUIVALENCE;

TRANSLATION (LANGUAGES);

EID: 84959060369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45332-6_1     Document Type: Conference Paper

References (21)

1. David Aspinall. Subtyping with singleton types. In Eighth International Workshop on Computer Science Logic, volume 933 of Lecture Notes in Computer Science, pages 1-15, Kazimierz, Poland, September 1994. Springer-Verlag.
2. Karl Crary. Sound and complete elimination of singleton kinds. Technical Report CMU-CS-00-104, Carnegie Mellon University, School of Computer Science, January 2000.
3. Karl Crary, David Walker, and Greg Morrisett. Typed memory management in a calculus of capabilities. In Twenty-Sixth ACM Symposium on Principles of Programming Languages, pages 262-275, San Antonio, Texas, January 1999.
4. Karl Crary and Stephanie Weirich. Flexible type analysis. In 1999 ACM International Conference on Functional Programming, pages 233-248, Paris, September 1999.
5. Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type-erasure semantics. In 1998 ACM International Conference on Functional Programming, pages 301-312, Baltimore, September 1998. Extended version published as Cornell University technical report TR98-1721.
6. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 123-137, Portland, Oregon, January 1994.
7. Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Seventeenth ACM Symposium on Principles of Programming Languages, pages 341-354, San Francisco, January 1990.
8. Robert Harper and Greg Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM Symposium on Principles of Programming Languages, pages 130-141, San Francisco, January 1995.
9. Robert Harper and Chris Stone. A type-theoretic interpretation of Standard ML. In Proof, Language and Interaction: Essays in Honour of Robin Milner. The MIT Press, 2000. Extended version published as CMU technical report CMU-CS-97-147.
10. Xavier Leroy. Manifest types, modules and separate compilation. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 109-122, Portland, Oregon, January 1994.
11. Xavier Leroy. Applicative functors and fully transparent higher-order modules. In Twenty-Second ACM Symposium on Principles of Programming Languages, San Francisco, January 1995.
12. Xavier Leroy. A modular module system. Journal of Functional Programming, 2000. To appear.
13. Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, May 1997.
14. Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. In Twenty-Third ACM Symposium on Principles of Programming Languages, pages 271-283, St. Petersburg, Florida, January 1996.
15. Greg Morrisett, Karl Crary, Neal Glew, and David Walker. Stack-based typed assembly language. In Second Workshop on Types in Compilation, volume 1473 of Lecture Notes in Computer Science, pages 28-52. Springer-Verlag, March 1998. Extended version published as CMU technical report CMU-CS-98-178.
16. Greg Morrisett, DavidWalker, Karl Crary, and Neal Glew. From System F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):527-568, May 1999. An earlier version appeared in the 1998 Symposium on Principles of Programming Languages.
17. Zhong Shao. Typed cross-module compilation. In 1998 ACM International Conference on Functional Programming, pages 141-152, Baltimore, Maryland, September 1998.
18. Zhong Shao. Transparent modules with fully syntactic signatures. In 1999 ACM International Conference on Functional Programming, pages 220-232, Paris, September 1999.
19. Zhong Shao, Christopher League, and Stefan Monnier. Implementing typed intermediate languages. In 1998 ACM International Conference on Functional Programming, pages 313-323, Baltimore, Maryland, September 1998.
20. Frederick Smith, David Walker, and Greg Morrisett. Alias types. In European Symposium on Programming, Berlin, Germany, March 2000.
21. Christopher A. Stone and Robert Harper. Deciding type equivalence in a language with singleton kinds. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, Boston, January 2000. Extended version published as CMU technical report CMU-CS-99-155.