On equivalence and canonical forms in the LF type theory

ACM Transactions on Computational Logic

Volumn 6, Issue 1, 2005, Pages 61-101

  Harper, Robert ^a,b   Pfenning, Frank ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Logical frameworks; Type theory

Indexed keywords

LOGICAL FRAMEWORKS; META-LANGUAGE; TYPE THEORY;

ALGORITHMS; COMPUTER SCIENCE; ENCODING (SYMBOLS); THEOREM PROVING;

LOGIC PROGRAMMING;

EID: 11444266760     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042038.1042041     Document Type: Article

References (28)

1. BARENDREGT, H. P. 1992. Lambda calculi with types. In Handbook of Logic in Computer Science, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Vol. 2. Oxford University Press, Chapter 2, 117-309.
2. CERVESATO, I. 1996. A linear logical framework. Ph.D. dissertation. Dipartimento di Informatica, Università di Torino.
3. CERVESATO, I. AND PFENNING, F. 2002. A linear logical framework. Inf. Comput. 179, 1 (Nov.), 19-75.
4. COMPAGNONI, A. AND GOGUEN, H. 1999. Antisymmetry of higher-order subtyping. In Proceedings of the 8th Annual Conference on Computer Science Logic (CSL'99) (Madrid, Spain), J. Flum and M. Rodríguez-Artalejo, Eds. Lecture Notes in Computer Science, vol. 1683. Springer-Verlag, New York, pp. 420-438.
5. COQUAND, T. 1991. An algorithm for testing conversion in type theory. In Logical Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, UK, pp. 255-279.
6. DOWEK, G., HUET, G., AND WERNER, B. 1993. On the definition of the eta-long normal form in type systems of the cube. In Informal Proceedings of the Workshop on Types for Proofs and Programs, H. Geuvers, Ed. Nijmegen, The Netherlands.
7. ELLIOTT, C. 1989. Higher-order unification with dependent types. In Rewriting Techniques and Applications (Chapel Hill, N.C.), N. Dershowitz, Ed. Lecture Notes in Computer Science, vol. 355. Springer-Verlag, New York, pp. 121-136.
8. FELTY, A. AND MILLER, D. 1990. Encoding a dependent-type λ-calculus in a logic programming language. In Proceedings of the 10th International Conference on Automated Deduction (Kaiser-slautern, Germany), M. Stickel, Ed. Lecture Notes in Computer Science, vol. 449. Springer-Verlag, New York, pp. 221-235.
9. GEUVERS, H. 1992. The Church-Rosser property for βη-reduction in typed λ-calculi. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (Santa Cruz, Calif.), A. Scedrov, Ed. IEEE Computer Society Press, Los Alamitos, Calif., pp. 453-460.
10. GEUVERS, H. AND BARENDSEN, E. 1999. Some logical and syntactical observations concerning the first order dependent type system XP. Math. Struct. Comput. Sci. 9, 4, 335-360.
11. GHANI, N. 1997. Eta-expansions in dependent type theory - the Calculus of Constructions. In Proceedings of the 3rd International Conference on Typed Lambda Calculus and Applications (TLCA'97) (Nancy, France), P. de Groote and J. Hindley, Eds. Lecture Notes in Computer Science, vol. 1210. Springer-Verlag, New York, pp. 164-180.
12. GOGUEN, H. 1994. A typed operational semantics for type theory. Ph.D. dissertation, Edinburgh Univ. Edinburgh, Scotland.
13. GOGUEN, H. 1999. Soundness of the logical framework for its typed operational semantics. In Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99) (L'Aquila, Italy), J.-Y. Girard, Ed. Lecture Notes in Computer Science, vol. 1581. Springer-Verlag, New York, pp. 177-197.
14. HARPER, R., HONSELL, F., AND PLOTKIN, G. 1993. A framework for defining logics. J. ACM 40, 1 (Jan.), 143-184.
15. HARPER, R. AND PFENNING, F. 1999. On equivalence and canonical forms in the LF type theory. Tech. Rep. CMU-CS-99-159. Department of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
16. JAY, C. B. AND GHANI, N. 1995. The virtues of η-expansion. J. Funct. Prog. 5, 2, 135-154.
17. NORDSTRÖM, B., PETERSSON, K., AND SMITH, J. 1990. Programming in Martin-Löf's Type Theory: An Introduction. Oxford University Press.
18. PFENNING, F. 1992. Computation and deduction. Unpublished lecture notes, 277 pp. Revised May 1994, April 1996.
19. PFENNING, F. 1993. Refinement types for logical frameworks. In Informal Proceedings of the Workshop on Types for Proofs and Programs, H. Geuvers, Ed. Nijmegen, The Netherlands, 286-299.
20. PFENNING, F. 2001. Intensionality, extensionality, and proof irrelevance in modal type theory. In Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS'01) (Boston, Mass.), J. Halpern, Ed. IEEE Computer Society Press, Los Alamitos, Calif., pp. 221-230.
21. PFENNING, F. AND SCHÜRMANN, C. 1999. System description: Twelf - A meta-logical framework for deductive systems. In Proceedings of the 16th International Conference on Automated Deduction (CADE-16) (Trento, Italy), H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, New York, pp. 202-206.
22. POLAKOW, J. 2001. Ordered linear logic and applications. Ph.D. dissertation. Department of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
23. POLAKOW, J. AND PFENNING, F. 1999. Natural deduction for intuitionistic non-commutative linear logic. In Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99) (L'Aquila, Italy), J.-Y. Girard, Ed. Lecture Notes in Computer Science, vol. 1581. Springer-Verlag, New York, pp. 295-309.
24. SALVESEN, A. 1990. The Church-Rosser theorem for LF with βη-reduction. Unpublished notes to a talk given at the First Workshop on Logical Frameworks in Antibes, France.
25. STONE, C. A. AND HARPER, R. 2000. Decidable type equivalence with singleton kinds. In Conference Record of the 27th Symposium on Principles of Programming Languages (POPL'00) (Boston, Mass.), T. Reps, Ed. ACM, New York, pp. 214-227.
26. STREICHER, T. 1991. Semantics of Type Theory. Birkhäuser.
27. VANDERWAART, J. C. AND CRARY, K. 2002. A simplified account of the metatheory of linear LF. In Proceedings of the 3rd International Workshop on Logical Frameworks and Meta-Languages (LFM'02), F. Pfenning, Ed. Vol. 70(2). Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, Copenhagen, Denmark. Extended version available as Technical Report CMU-CS-01-154.
28. VIRGA, R. 1999. Higher-order rewriting with dependent types. Ph.D. dissertation. Department of Mathematical Sciences, Carnegie Mellon Univ., Pittsburgh, Pa. (Available as Technical Report CMU-CS-99-167.)