On irrelevance and algorithmic equality in predicative type theory

Logical Methods in Computer Science

Volumn 8, Issue 1, 2012, Pages

  Abel, Andreas ^a   Scherer, Gabriel ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b INRIA Paris Rocquencourt ^*  (Germany)

Author keywords

Dependent types; Logical relation; Proof irrelevance; Typed algorithm equality; Universal Kripke model

Indexed keywords

EID: 84859990784     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(1:29)2012     Document Type: Article

References (36)

1. Steven Awodey and Andrej Bauer. Propositions as [Types]. Journal of Logic and Computation, 14(4):447-471, 2004.
2. Andreas Abel. Extensional normalization in the logical framework with proof irrelevant equality. In Olivier Danvy, editor, Workshop on Normalization by Evaluation, affiliated to LiCS 2009, Los Angeles, 15 August 2009, 2009.
3. Andreas Abel. Irrelevance in type theory with a heterogeneous equality judgement. In Martin Hofmann, editor, Foundations of Software Science and Computational Structures, 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings, volume 6604 of Lecture Notes in Computer Science, pages 57-71. Springer-Verlag, 2011.
4. Andreas Abel and Thierry Coquand. Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs. Fundamenta Informaticae, 77(4):345-395, 2007. TLCA'05 special issue.
5. Andreas Abel, Thierry Coquand, and Peter Dybjer. Normalization by evaluation for Martin-Lof Type Theory with typed equality judgements. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pages 3-12. IEEE Computer Society Press, 2007.
6. Andreas Abel, Thierry Coquand, and Peter Dybjer. Verifying a semantic βη-conversion test for Martin-Lof type theory. In Philippe Audebaud and Christine Paulin-Mohring, editors, Mathematics of Program Construction, 9th International Conference, MPC 2008, Marseille, France, July 15-18, 2008. Proceedings, volume 5133 of Lecture Notes in Computer Science, pages 29-56. Springer-Verlag, 2008.
7. Andreas Abel, Thierry Coquand, and Miguel Pagano. A modular type-checking algorithm for type theory with singleton types and proof irrelevance. Logical Methods in Computer Science, 7(2-4):1-57, May 2011.
8. Robin Adams. Pure type systems with judgemental equality. Journal of Functional Programming, 16(2):219-246, 2006.
9. Stuart Allen. A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University, 1987.
10. Roberto M. Amadio, editor. Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, volume 4962 of Lecture Notes in Computer Science. Springer-Verlag, 2008.
11. Lennart Augustsson. Cayenne-a language with dependent types. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), Baltimore, Maryland, USA, September 27-29, 1998, volume 34 of SIGPLAN Notices, pages 239-250. ACM Press, 1999.
12. Henk Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam, 1984.
13. Bruno Barras and Bruno Bernardo. The implicit calculus of constructions as a programming language with dependent types. In Amadio [Ama08], pages 365-379.
14. Ana Bove, Peter Dybjer, and Ulf Norell. A brief overview of Agda-a functional language with dependent types. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings, volume 5674 of Lecture Notes in Computer Science, pages 73-78. Springer-Verlag, 2009.
15. Robert L. Constable, Stuart F. Allen, Mark Bromley, Rance Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax P. Mendler, Prakash Panangaden, James T. Sasaki, and Scott F. Smith. Implementing mathematics with, the Nuprl proof development system. Prentice Hall, 1986.
16. Thierry Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 255-279. Cambridge University Press, 1991.
17. Thierry 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, May 1996.
18. Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, August 1994. Available as LFCS Report ECS-LFCS-94-304.
19. Healfdene Goguen. A Kripke-style model for the admissibility of structural rules. In Paul Callaghan, Zhaohui Luo, James McKinna, and Robert Pollack, editors, Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers, volume 2277 of Lecture Notes in Computer Science, pages 112-124. Springer-Verlag, 2000.
20. Healfdene Goguen. Justifying algorithms for βη conversion. In Vladimiro Sassone, editor, Foundations of Software Science and Computational Structures, 8th International Conference, FoS-SaCS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, volume 3441 of Lecture Notes in Computer Science, pages 410-424. Springer-Verlag, 2005.
21. Robert Harper and Frank Pfenning. On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic, 6(1):61-101, 2005.
22. INRIA. The Coq Proof Assistant Reference Manual. INRIA, version 8.3 edition, 2010.
23. Pierre Letouzey. A new extraction for Coq. In Herman Geuvers and Freek Wiedijk, editors, Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers, volume 2646 of Lecture Notes in Computer Science, pages 200-219. Springer-Verlag, 2002.
24. Alexandre Miquel. A model for impredicative type systems, universes, intersection types and subtyping. In 15th IEEE Symposium on Logic in Computer Science (LICS 2000), 26-29 June 2000, Santa Barbara, California, USA, Proceedings, pages 18-29, 2000.
25. Alexandre Miquel. The implicit calculus of constructions. In Samson Abramsky, editor, Typed, Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings, volume 2044 of Lecture Notes in Computer Science, pages 344-359. Springer-Verlag, 2001.
26. Alexandre Miquel. Le Calcul des Constructions implicite: syntaxe et sémantique. PhD thesis, Universite Paris 7, December 2001.
27. Richard Nathan Mishra-Linger. Irrelevance, Polymorphism, and Erasure in Type Theory. PhD thesis, Portland State University, 2008.
28. Nathan Mishra-Linger and Tim Sheard. Erasure and polymorphism in pure type systems. In Amadio [Ama08], pages 350-364.
29. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming. 14(1):69-111, 2004.
30. Frank Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In 16th IEEE Symposium on Logic in Computer Science (LICS 2001), 16-19 June 2001, Boston University, USA, Proceedings. IEEE Computer Society Press, 2001.
31. Christine Paulin-Mohring and Benjamin Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15(5/6):607-640, 1993.
32. Jason Reed. Proof irrelevance and strict definitions in a logical framework, 2002. Senior Thesis, published as Carnegie-Mellon University technical report CMU-CS-02-153.
33. Jason Reed. Extending higher-order unification to support proof irrelevance. In David A. Basin and Burkhart Wolff, editors, Theorem, Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings, volume 2758 of Lecture Notes in Computer Science, pages 238-252. Springer-Verlag, 2003.
34. Carsten Schürmann and Jeffrey Sarnat. Structural logical relations. In Frank Pfenning, editor, Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pages 69-80. IEEE Computer Society Press, 2008.
35. Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of Linear LF. In Third International Workshop on Logical Frameworks and Metalanguages (LFM 2002), FLoC'02 affiliated workshop, Copenhagen, Denmark, 2002. An extended version appeared as CMU Technical Report CMU-CS-01-154.
36. Benjamin Werner. On the strength of proof-irrelevant type theories. Logical Methods in Computer Science, 4(3), 2008.