Normalization by evaluation for martin-löf type theory with typed equality judgements

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 3-12

  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

DECISION PROCEDURE; DEPENDENT FUNCTIONS; LOGICAL RELATIONS; NORMAL FORM; NORMALIZATION BY EVALUATION; SEMANTIC ELEMENT; TYPE THEORY; TYPECHECKING;

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; SEMANTICS;

COMPUTATION THEORY;

EID: 48949097695     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.33     Document Type: Conference Paper

References (31)

1. A. Abel, K. Aehlig, and P. Dybjer. Normalization by evaluation for Martin-Löf type theory with one universe. In 23rd Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIII, Electronic Notes in Theoretical Computer Science. Elsevier, 2007. To appear.
2. A. Abel and T. Coquand. Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs. Fundamenta Informaticæ, 2007. TLCA'05 special issue. To appear.
3. P. Aczel. Frege Structures and the Notions of Proposition, Truth, and Set, pages 31-59. North-Holland, 1980.
4. R. Adams. Pure type systems with judgemental equality. Journal of Functional Programming, 16(2):219-246, 2006. (Pubitemid 43177435)
5. K. Aehlig and F. Joachimski. Operational aspects of untyped normalization by evaluation. Mathematical Structures in Computer Science, 14(4):587-611, Aug. 2004. (Pubitemid 39142160)
6. S. Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Department of Computer Science, Cornell University, 1987.
7. T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, Nov. 1993.
8. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam, 1984.
9. M. Beeson. Foundations of constructive mathematics. Metamathematical studies, volume 6 of Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge [A Series of Modern Surveys in Mathematics]. Springer-Verlag, 1985.
10. U. Berger and H. Schwichtenberg. An inverse to the evaluation functional for typed λ-calculus. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, pages 203-211, July 1991. (Pubitemid 21691983)
11. R. Constable and team. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.
12. T. Coquand. An algorithm for testing conversion in type theory. In Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
13. T. Coquand. 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 (July 17-21, 1995, Kloster Irsee, Germany), volume 26 of Science of Computer Programming, pages 167-177. Elsevier Science, May 1996. (Pubitemid 126374243)
14. O. Danvy. Type-directed partial evaluation. In J. Hatcliff, T. Æ. Mogensen, and P. Thiemann, editors, Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998, volume 1706 of Lecture Notes in Computer Science, pages 367-411. Springer-Verlag, 1999.
15. P. Dybjer. Internal type theory. In S. Berardi and M. Coppo, editors, Types for Proofs and Programs, International Workshop TYPES'95, Torino, Italy, June 5-8, 1995, Selected Papers, number 1158 in Lecture Notes in Computer Science, pages 120-134. Springer-Verlag, 1996. (Pubitemid 126140353)
16. P. Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, (2):525-549, June 2000.
17. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, The University of Edinburgh, Department of Computer Science, 1994.
18. R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic, 6(1):61-101, 2005. (Pubitemid 40080282)
19. M. Hofmann. Syntax and semantics of dependent types. In A. Pitts and P. Dybjer, editors, Semantics and Logics of Computation. Cambridge University Press, 1996.
20. J. W. Klop. Combinatory reduction systems. Mathematical Center Tracts, 27, 1980.
21. P. Martin-Löf. An intuitionistic theory of types: Predicative part. In H. E. Rose and J. C. Shepherdson, editors, Logic Colloquium '73, pages 73-118. North-Holland, 1975.
22. P. Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science, VI, 1979, pages 153-175. North-Holland, 1982.
23. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
24. P. Martin-Löf. Normalization by evaluation and by the method of computability. Talk at JAIST, Japan Advanced Institute of Science and Technology, Kanazawa, June 2004.
25. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 2004.
26. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin Löf's Type Theory: An Introduction. Clarendon Press, Oxford, 1990.
27. A. M. Pitts. Alpha-structural recursion and induction. In J. Hurd and T. F. Melham, editors, Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings, volume 3603 of Lecture Notes in Computer Science, pages 17-34. Springer-Verlag, 2005. (Pubitemid 41450135)
28. D. S. Scott. Combinators and classes. In C. Böhm, editor, Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, March 25-27, 1975, volume 37 of Lecture Notes in Computer Science, pages 1-26. Springer-Verlag, 1975.
29. M. R. Shinwell and A. M. Pitts. On a monadic semantics for freshness. Theoretical Computer Science, 342(1):28-55, 2005. (Pubitemid 41162454)
30. C. A. Stone and R. Harper. Extensional equivalence and singleton types. ACM Transactions on Computational Logic, 7(4):676-722, 2006. (Pubitemid 44600807)
31. T. Streicher. Semantics of Type Theory. Progress in Theoretical Computer Science. Birkhaeuser Verlag, Basel, 1991.