Extensional equivalence and singleton types

ACM Transactions on Computational Logic

Volumn 7, Issue 4, 2006, Pages 676-722

  Stone, Christopher A ^a   Harper, Robert ^b,c  

^a HARVEY MUDD COLLEGE   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; PROGRAM COMPILERS; SET THEORY; THEOREM PROVING;

INTERMEDIATE LANGUAGE; LOGICAL EQUIVALENCE RELATION; MODULE SYSTEMS;

EQUIVALENCE CLASSES;

EID: 33750151602     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1183278.1183281     Document Type: Article

References (44)

1. ASPINALL, D. 1995. Subtyping with singleton types. In Proceedings of the Computer Science Logic (CSL'94). Lecture Notes in Computer Science, vol. 938, Springer-Verlag, New York.
2. ASPINALL, D. 1997. Type systems for modular programs and specifications. Ph.D. dissertation, Department of Computer Science, University of Edinburgh.
3. ASPINALL, D. 2000. Subtyping with power types. In Proceedings of the Computer Science Logic (CSL 2000). Lecture Notes in Computer Science, vol. 1862, Springer-Verlag, New York. 156-171.
4. BLUME, M. 1997. Hierarchical modularity and intermodule optimization. Ph.D. dissertation. Princeton University, Princeton, NJ.
5. BLUME, M. AND APPEL, A. W. 1997. Lambda-splitting: A higher-order approach to cross-module optimizations. In Proceedings 1997 ACM International Conference on Functional Programming (ICFP '97). 112-124.
6. CARDELLI, L. AND WEGNER, P. 1985. On understanding types, data abstraction and polymorphism. ACM Comput. Surv. 17, 4, 471-522.
7. COMPAGNONI, A. AND GOGUEN, H. 2003. Typed operational semantics for higher-ordersubtyping. Info, Comput. 184, 2 (Aug.), 242-297.
8. COQUAND, T. 1991. An algorithm for testing conversion in type theory. In Logical frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, MA, 255-277.
9. COQUAND, T., POLLACK, R., AND TAKEYAMA, M. 2003. A logical framework with dependently typed records. In Proceedings of the Typed Lambda Calculi and Applications (TLCA 2003). 105-119.
10. (Available as LNCS 2701). Lecture Notes in Computer Science, vol. 2701, Springer-Verlag, New York.
11. COURANT, J. 2002. Strong normalization with singleton types. In Proceeedings of the Second Workshop on Intersection Types and Related Systems (ITRS '02). ENTCS, vol. 70.
12. CRARY, K. 1999. A simple proof technique for certain parametricity results. In Proceedings of the 1999 ACM International Conference on Functional Programming (ICFP '99). ACM, New York, 82-89.
13. CRARY, K. 2000. Sound and complete elimination of singleton kinds. Tech. Rep. CMU-CS-00-104, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
14. CRARY, K. 2005. Logical relations and a case study in equivalence checking. In Advanced Topics in Types and Programming Languages, B. C. Pierce, Ed. MIT Press, Cambridge, MA.
15. CRARY, K. F. 1998. Type-theoretic methodology for practical programming languages. Ph.D. dissertation, Department of Computer Science, Cornell University.
16. ≤. Info. Comput. 1/2, 57-114.
17. GIRARD, J. 1972. Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur. Ph.D. dissertation, Université Paris 7.
18. GOGUEN, H. 1994. A typed operational semantics for type theory. Ph.D. dissertation, Department of Computer Science, University of Edinburgh.
19. (Available as Technical Report ECS-LFCS-94-304).
20. GOGUEN, H. 2005. A syntactic approach to eta equality in type theory. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL '05). ACM, New York.
21. HARPER, R. AND LILLIBRIDGE, M. 1994. A type-theoretic approach to higher-order modules with sharing. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL '94). ACM, New York, 123-137.
22. HARPER, R., MITCHELL, J. C., AND MOGGI, E. 1990. Higher-order modules and the phase distinction. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL '90). ACM, New York, 341-354.
23. HARPER, R. AND MORHISETT, G. 1995. Compiling polymorphism using intensional type analysis. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95). ACM, New York, 130-141.
24. HARPER, R. AND PFENNING, F. 1999. On equivalence and canonical forms in the LF type theory. In Proceedings of the Workshop on Logical Frameworks and Meta-Languages.
25. Extended version available as Tech. Rep. CMU-CS-99-159.
26. HOFMANN, M. 1995. Extensional concepts in intensional type theory. Ph.D. dissertation, Edinburgh LFCS.
27. (Available as Edinburgh LFCS Technical Report ECS-LFCS-95-327).
28. LEROY, X. 1994. Manifest types, modules, and separate compilation. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94). ACM, New York, 109-122.
29. LEROY, X. 1995. Applicative Functors and Fully Transparent Higher-Order Modules. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL '95). ACM, New York, 142-153.
30. LILLIBRIDGE, M. 1997. Translucent Sums: A Foundation for Higher-Order Module Systems. Ph.D. dissertation, School of Computer Science, Carnegie Mellon University.
31. (Available as Technical Report) CMU-CS-97-122.
32. MARTIN-LÖF, P. 1984. Intuitionistic Type Theory. Bibliopolis-Napoli.
33. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (POPL '96). ACM, New York, 271-283.
34. MORRISETT, G., WALKER, D., CHARY, K., AND GLEW, N. 1997. From system F to typed assembly language. Tech. Rep. TR97-1651, Department of Computer Science, Cornell University.
35. PETERSEN, L., CHENG, P., HARPER, R., AND STONE, C. 2000. Implementing the TILT internal language. Tech. Rep. CMU-CS-00-180, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
36. SEVERI, P. AND POLL, E. 1994. Pure Type Systems with definitions. In Proceedings of the Logical Foundations of Computer Science '94. Lecture Notes in Computer Science, vol. 813, Springer-Verlag, New York.
37. SHALIT, A. 1996. The Dylan Reference Manual: The Definitive Guide to the New Object-Oriented Dynamic Language. Addison-Wesley, Reading, MA.
38. SHAO, Z. 1998. Typed Cross-Module Compilation. In Proceedings of the 1998 ACM International Conference on Functional Programming (ICFP '98). ACM, New York, 141-152.
39. STONE, C. A. 2000. Singleton kinds and singleton types. Ph.D. dissertation. School of Computer Science, Carnegie Mellon University. Pittsburgh, PA.
40. (Available as Technical Report CMU-CS-00-153.)
41. STONE, C. A. 2005. Type definitions. In Proceedings of the Advanced Topics in Types and Programming Languages, B. C. Pierce, Ed. MIT Press, Cambridge, MA.
42. STONE, C. A. AND HARPER, R. 2000. Decidable type equivalence with singleton kinds. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages (POPL '00). ACM, New York, 214-227.
43. STONE, C. A. AND HARPER, R. 2004. Extensional equivalence and singleton types. Tech. Rep. HMC-CS-04-100, Computer Science Department, Harvey Mudd College.
44. 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 ACM 1996 Conference on Programming Language Design and Implementation (PLDI '96). ACM, New York, 181-192.