Intensional Analysis of Quantified Types

ACM Transactions on Programming Languages and Systems

Volumn 25, Issue 2, 2003, Pages 159-209

  Saha, Bratin ^a   Trifonov, Valery ^a   Shao, Zhong ^a  

^a Yale University   (United States)

Author keywords

Certified code; Intensional type analysis; Runtime type dispatch; Typed intermediate languages

Indexed keywords

INTENTIONAL TYPE ANALYSIS; POLYMORPHIC LANGUAGES;

CODES (SYMBOLS); DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; PROGRAM COMPILERS; PROGRAM INTERPRETERS; SEMANTICS; THEOREM PROVING;

JAVA PROGRAMMING LANGUAGE;

EID: 0346902047     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/641888.641889     Document Type: Review

References (32)

1. CRARY, K. AND WEIRICH, S. 1999. Flexible type analysis. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 233-248.
2. CRARY, K., WEIRICH, S., AND MORRISETT, G. 1998. Intensional polymorphism in type-erasure semantics. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 301-312.
3. DESPEYROUX, J., PFENNING, F., AND SCHÜRMANN, C. 1997. Primitive recursion for higher-order abstract syntax. In Proceedings of the Third International Conference on Typed Lambda Calculus and Applications (TLCA'97) (Nancy, France), Lecture Notes in Computer Science, vol. 1210, Springer-Verlag, New York, 147-163.
4. DUBOIS, C., ROUAIX, F., AND WEIS, P. 1995. Extensional polymorphism. In Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 118-129.
5. DUGGAN, D. 1998. A type-based semantics for user-defined marshalling in polymorphic languages. In Proceedings of the 1998 International Workshop on Types in Compilation (Kyoto), Lecture Notes in Computer Science, vol. 1473, Springer-Verlag, New York, 273-298.
6. GIRARD, J. Y. 1972. Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. PhD Thesis, University of Paris VII.
7. GIRARD, J.-Y., LAFONT, Y., AND TAYLOR, P. 1989. Proofs and Types. Cambridge University Press, New York.
8. HARPER, R. AND LILLIBRIDGE, M. 1993. Explicit polymorphism and CPS conversion. In Proceedings of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 206-219.
9. HARPER, R. AND MITCHELL, J. C. 1999. Parametricity and variants of Girard's J operator. Inf. Proc. Lett. 70, 1 (Apr.), 1-5.
10. HARPER, R. AND MORRISETT, G. 1995. Compiling polymorphism using intensional type analysis. In Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 130-141.
11. LEAGUE, C., SHAO, Z., AND TRIFONOV, V. 1999. Representing Java classes in a typed intermediate language. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, ACM, New York, 183-196.
12. MINAMIDE, Y. 1997. Full lifting of type parameters. Tech. Rep. RIMS, Kyoto University.
13. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 271-283.
14. MONNIER, S., SAHA, B., AND SHAO, Z. 2001. Principled scavenging. In Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, New York, 81-91.
15. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998. From System F to typed assembly language. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 85-97.
16. NECULA, G. C. 1998. Compiling with proofs. PhD Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. CMU-CS-98-154.
17. OHORI, A. AND KATO, K. 1993. Semantics for communication primitives in a polymorphic language. In Proceedings of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 99-112.
18. PETERSON, J. AND JONES, M. 1993. Implementing type classes. In Proceedings of the 1993 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, New York, 227-236.
19. PFENNING, F. AND PAULIN-MOHRING, C. 1989. Inductively defined types in the calculus of constructions. In Proceedings of the Fifth Conference on the Mathematical Foundations of Programming Semantics (New Orleans), Springer-Verlag, New York, 209-228.
20. PIERCE, B., DIETZEN, S., AND MICHAYLOV, S. 1989. Programming in higher-order typed lambda-calculi. Tech. Rep. CMU-CS-89-111, School of Computer Science, Carnegie Mellon University.
21. REYNOLDS, J. C. 1974. Towards a theory of type structure. In Proceedings of the Colloque sur la Programmation. Lecture Notes in Computer Science, vol. 19, Springer-Verlag, Berlin, 408-425.
22. SHAO, Z. 1997a. Flexible representation analysis. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, ACM, New York, 85-98.
23. SHAO, Z. 1997b. An overview of the FLINT/ML compiler. In Proceedings of the 1997 ACM SIGPLAN Workshop on Types in Compilation, ACM, New York.
24. SHAO, Z. 1998. Typed cross-module compilation. In. Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming, ACM, New York.
25. SHAO, Z. 1999. Transparent modules with fully syntactic signatures. In. Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, ACM, New York, 220-232.
26. SHAO, Z. AND APPEL, A. W. 1995. A type-based compiler for Standard ML. In Proceedings of the 1995 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, New York, 116-129.
27. SHAO, Z., SAHA, B., TRIFONOV, V., AND PAPASPYROU, N. 2002. A type system for certified binaries. In Proceedings of the 29th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 217-232.
28. TARDITI, D. 1996. Design and implementation of code optimizations for a type-directed compiler for Standard ML. PhD Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Tech. Rep. CMU-CS-97-108.
29. TARDITI, D., MORRISETT, G., CHENG, P., STONE, C., HARPER, R., AND LEE, P. 1996. TIL: A type-directed optimizing compiler for ML. In Proceedings of the 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, New York, 181-192.
30. WEIRICH, S. 2000. Type-safe cast. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming, ACM, New York, 58-67.
31. WRIGHT, A. K. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inf. Comput. 115, 1 (Nov.), 38-94.
32. YANG, Z. 1998. Encoding types in ML-like languages. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming, ACM, New York, 289-300.