Intensional polymorphism in type-erasure semantics

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 1, 1999, Pages 301-309

  Crary, Karl ^a   Weirich, Stephanie ^a   Morrisett, Greg ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002684234     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/291251.289459     Document Type: Article

References (28)

1. S. Aditya and A. Caro. Compiler-directed type reconstruction for polymorphic languages. In Conference on Functional Programming Languages and Computer Architecture, pages 74-82, Copenhagen, June 1993.
2. L. Birkedal, M. Tofte, and M. Vejlstrup. From region inference to von Neumann machines via region representation inference. In Twenty-Third ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 171-183, St. Petersburg, Jan. 1996.
3. R. L. Constable. Intensional analysis of functions and types. Technical Report CSR-118-82, Department of Computer Science, University of Edinburgh, June 1982.
4. R. L. Constable and D. R. Zlatin. The type theory of PL/CV3. ACM Transactions on Programming Languages and Systems, 6(1):94-117, Jan. 1984.
5. J. Despeyroux, F. Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications, volume 1210 of Lecture Notes in Computer Science, pages 147-163, Nancy, France, Apr. 1997. Springer-Verlag. Extended version published as Carnegie Mellon University technical report CMU-CS-96-172.
6. C. Dubois, F. Rouaix, and P. Weis. Extensional polymorphism. In Twenty-Second ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 118-129, San Francisco, Jan. 1995.
7. D. Duggan. A type-based semantics for user-defined marshalling in polymorphic languages. In Second Workshop on Types in Compilation, Mar. 1998.
8. J.-Y. Girard. Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination de coupures dans l'analyse et la théorie des types. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63-92. North-Holland Publishing Co., 1971.
9. J.-Y. Girard. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII, 1972.
10. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 123-137, Portland, Oregon, Jan. 1994.
11. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 130-141, San Francisco, Jan. 1995.
12. M. P. Jones. A theory of qualified types. In Fourth European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, Rennes, France, 1992. Springer-Verlag.
13. X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 177-188, 1992.
14. Y. Minamide. Full lifting of type parameters. Submitted for publication. Earlier version published as "Compilation Based on a Calculus for Explicit Type-Passing" in the Second Fuji International Workshop on Functional and Logic Programming, 1996.
15. Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In Twenty-Third ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 271-283, St. Petersburg, Florida, Jan. 1996.
16. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, July 1988.
17. G. Morrisett. Compiling with Types. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, Dec. 1995.
18. G. Morrisett, M. Felleisen, and R. Harper. Abstract models of memory management. In Conference on Functional Programming Languages and Computer Architecture, 1995.
19. G. Morrisett and R. Harper. Semantics of memory management for polymorphic languages. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics. Cambridge University Press, 1997.
20. G. Morrisett, D. Tarditi, P. Cheng, C. Stone, R. Harper, and P. Lee. The TIL/ML compiler: Performance and safety through types. In Workshop on Compiler Support for Systems Software, Tucson, Feb. 1996.
21. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In Twenty-Fifth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 85-97, San Diego, Jan. 1998. Extended version published as Cornell University technical report TR97-1651.
22. J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing '83, pages 513-523. North-Holland, 1983. Proceedings of the IFIP 9th World Computer Congress.
23. E. Ruf. Partitioning dataflow analyses using types. In Twenty-Fourth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 15-26, Paris, Jan. 1997.
24. B. Saha and Z. Shao. Optimal type lifting. In Second Workshop on Types in Compilation, Mar. 1998.
25. Z. Shao. Flexible representation analysis. In 1997 ACM SIGPLAN International Conference on Functional Programming, pages 85-98, Amsterdam, June 1997.
26. Z. Shao. An overview of the FLINT/ML compiler. In 1997 Workshop on Types in Compilation, Amsterdam, June 1997. ACM SIGPLAN. Published as Boston College Computer Science Department Technical Report BCCS-97-03.
27. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: A type-directed optimizing compiler for ML. In 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 181-192, May 1996.
28. A. Tolmach. Tag-free garbage collection using explicit type parameters. In ACM Conference on Lisp and Functional Programming, pages 1-11, Orlando, June 1994.