Verifying a semantic βη-conversion test for martin-löf type theory

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

Volumn 5133 LNCS, Issue , 2008, Pages 29-56

  Abel, Andreas ^a   Coquand, Thierry ^b   Dybjer, Peter ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION THEORY; MATHEMATICAL TECHNIQUES; MODEL PREDICTIVE CONTROL; PREDICTIVE CONTROL SYSTEMS; PROGRAM INTERPRETERS; TREES (MATHEMATICS);

BI-DIRECTIONAL; ELIMINATION RULES; IMPLEMENTATION TECHNIQUES; INTERNATIONAL CONFERENCES; NORMAL FORMS; NORMALIZATION BY EVALUATION; PROGRAM CONSTRUCTION; PROOF ASSISTANTS; SEMANTIC DOMAINS; TYPE THEORIES; TYPE-CHECKING;

SEMANTICS;

EID: 48949094253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70594-9_4     Document Type: Conference Paper

References (29)

1. [AAD07] Abel, A., Aehlig, K., Dybjer, P.: Normalization by evaluation for Martin-Löf type theory with one universe. In: Fiore, M. (ed.) Proc. of the 23rd Conf. on the Mathematical Foundations of Programming Semantics (MFPS XXIII). Electr. Notes in Theor. Comp. Sci, vol. 173, pp. 17-39. Elsevier, Amsterdam (2007)
2. [AC07] Abel, A., Coquand, T.: Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs. Fundam. Inform. 77(4), 345-395 (2005); TLCA 2005 special issue
3. [AC08] Altenkirch, T., Chapman, J.: Big step normalisation. Draft, available on the authors' homepages (2008)
4. [ACD07] Abel, A., Coquand, T., Dybjer, P.: Normalization by evaluation for Martin-Löf Type Theory with typed equality judgements. In: Proc. of the 22nd IEEE Symp. on Logic in Computer Science (LICS 2007), pp. 3-12. IEEE Computer Soc. Press, Los Alamitos (2007)
5. [ACD08] Abel, A., Coquand, T., Dybjer, P.: A semantic βη-equality algorithm for Martin-Löf Type Theory (extended version). Technical report, Ludwig-Maximilians-University Munich (2008), http://www.tcs.ifi.lmu.de/~abel/semEqTR.pdf
6. [Bar84] Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam (1984)
7. [BL84] Bruce, K.B., Longo, G.: On combinatory algebras and their expansions. Theor. Comput. Sci. 31, 31-40 (1984)
8. [BS91] Berger, U., Schwichtenberg, H.: An inverse to the evaluation functional for typed λ-calculus. In: Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, pp. 203-211 (July 1991)
9. [CAM07] Chapman, J., Altenkirch, T., McBride, C.: Epigram reloaded: a standalone typechecker for ETT. In: van Eekelen, M.C.J.D. (ed.) Revised Selected Papers from the 6th Symp. on Trends in Functional Programming, TFP 2005, Trends in Functional Programming, Intellect, vol. 6, pp. 79-94 (2007)
10. [Coq94] Coquand, C.: From semantics to rules: A machine assisted analysis. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) Proc. of the 7th Wksh. on Computer Science Logic, CSL 1993. LNCS, vol. 832, pp. 91-105. Springer, Heidelberg (1994)
11. [Coq96] Coquand, T.: An algorithm for type-checking dependent types. In: Mathematics of Program Construction. Selected Papers from the Third International Conference on the Mathematics of Program Construction, Kloster Irsee, Germany, July 17-21, 1995. Science of Computer Programming, vol. 26, pp. 167-177. Elsevier Science, Amsterdam (1996)
12. [CPT05] Coquand, T., Pollack, R., Takeyama, M.: A logical framework with dependently typed records. Fundam. Inform. 65(1-2), 113-134 (2005)
13. [Dan99] Danvy, O.: Type-directed partial evaluation. In: Hatcliff, J., Mogensen, T.Æ., Thiemann, P. (eds.) Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998. LNCS, vol. 1706, pp. 367-411. Springer, Heidelberg (1999)
14. [Dyb96] Dybjer, P.: Internal type theory. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 120-134. Springer, Heidelberg (1996)
15. [Dyb00] Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. The Journal of Symbolic Logic 65(2), 525-549 (2000)
16. [GL02] Grégoire, B., Leroy, X.: A compiled implementation of strong reduction. In: Proc. of the 7th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 2002). SIGPLAN Notices, vol. 37, pp. 235-246. ACM Press, New York (2002)
17. [Gog94] H. Goguen.: A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh. Available as LFCS Report ECS-LFCS-94-304 (August 1994)
18. [HP05] Harper, R., Pfenning, F.: On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic 6(1), 61-101 (2005)
19. [INR07] INRIA. The Coq Proof Assistant, Version 8.1. INRIA (2007), http://coq.inria.fr/
20. [Ler06] Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Morrisett, J.G., Jones, S.L.P. (eds.) Proc. of the 33rd ACM Symp. on Principles of Programming Languages, POPL 2006, pp. 42-54. ACM Press, New York (2006)
21. [ML75] Martin-Löf, P.: About models for intuitionistic type theories and the notion of definitional equality. In: Kanger, S. (ed.) Proceedings of the 3rd Scandinavian Logic Symposium, pp. 81-109 (1975)
22. [ML92] P. Martin-Löf.: Substitution calculus. Lecture in Göteborg (November 1992) (unpublished)
23. [Nor07] Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-41296 Göteborg, Sweden (September 2007)
24. [Pit06] Pitts, A.M.: Alpha-structural recursion and induction. Journal of the ACM 53, 459-506 (2006)
25. [Pol94] Pollack, R.: Closure under alpha-conversion. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 313-332. Springer, Heidelberg (1994)
26. [PS99] Pfenning, F., Schürmann, C.: System Description: Twelf - A Meta-Logical Framework for Deductive Systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 202-206. Springer, Heidelberg (1999)
27. [PT98] Pierce, B.C., Turner, D.N.: Local type inference. In: POPL 98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California (1998)
28. [Shi05] Shinwell, M.: The Fresh Approach: Functional Programming with Names and Binders. PhD thesis, University of Cambridge (2005)
29. [SS08] Schürmann, C., Sarnat, J.: Structural logical relations. In: Pfenning, F. (ed.) Proc. of the 23nd IEEE Symp. on Logic in Computer Science (LICS 2008) (2008)