A modular type-checking algorithm for type theory with singleton types and proof irrelevance

Logical Methods in Computer Science

Volumn 7, Issue 2, 2011, Pages

  Abel, Andreas ^a   Coquand, Thierry ^b   Pagano, Miguel ^c  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF GOTHENBURG   (Sweden)

^c Universidad Nacional de Córdoba ^*  (United States)

Author keywords

Normalisation by evaluation; Proof irrelevance; Singleton types; Type theory; Type checking

Indexed keywords

FORMAL LANGUAGES; SEMANTICS;

NORMALISATION; PROOF IRRELEVANCE; SINGLETON TYPES; TYPE THEORY; TYPECHECKING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 79960438550     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(2:4)2011     Document Type: Article

References (56)

1. M. Abadi, L. Cardelli, P. L. Curien, and J. J. Lévy. Explicit substitutions. In POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 31-46, New York, NY, USA, 1990. ACM.
2. Andreas Abel, Klaus Aehlig, and Peter Dybjer. Normalization by evaluation for Martin-Löf type theory with one universe. In Marcelo Fiore, editor, Proc. of the 23rd Conf. on the Mathematical Foundations of Programming Semantics (MFPS XXIII), volume 173 of Electr. Notes in Theor. Comp. Sci., pages 17-39. Elsevier, 2007.
3. Andreas Abel, Thierry Coquand, and Peter Dybjer. 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), pages 3-12. IEEE Computer Soc. Press, 2007.
4. Andreas Abel, Thierry Coquand, and Peter Dybjer. On the algebraic foundation of proof assistants for intuitionistic type theory. In Jacques Garrigue and Manuel V. Hermenegildo, editors, Proc. of the 9th Int. Symp. on Functional and Logic Programming, FLOPS 2008, volume 4989 of Lect. Notes in Comput. Sci., pages 3-13. Springer, 2008.
5. Andreas Abel, Thierry Coquand, and Peter Dybjer. Verifying a semantic fifi-conversion test for Martin-Löf type theory. In Philippe Audebaud and Christine Paulin-Mohring, editors, Proc. of the 9th Int. Conf. on Mathematics of Program Construction, MPC 2008, volume 5133 of Lect. Notes in Comput. Sci., pages 29-56. Springer, 2008.
6. Samson Abramsky and A Jung. Handbook of Logic in Computer Science, chapter Domain Theory, pages 1-168. Oxford University Press, 1994.
7. Robin Adams. Pure type systems with judgemental equality. Journal Functional Programming, 16(2):219-246, 2006.
8. Klaus Aehlig and Felix Joachimski. Operational aspects of untyped normalization by evaluation. Math. Struct. in Comput. Sci., 14(4):587-611, August 2004.
9. Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, and Philip J. Scott. Normalization by evaluation for typed lambda calculus with coproducts. In Proc. of the 16th IEEE Symp. on Logic in Computer Science (LICS 2001), pages 303-310. IEEE Computer Soc. Press, 2001.
10. David Aspinall. Subtyping with singleton types. In Leszek Pacholski and Jerzy Tiuryn, editors, Computer Science Logic, 8th Int. Wksh., CSL '94, volume 933 of Lect. Notes in Comput. Sci., pages 1-15. Springer, 1995.
11. Steven Awodey and Andrej Bauer. Propositions as [Types]. J. Log. Comput., 14(4):447-471, 2004.
12. Vincent Balat, Roberto Di Cosmo, and Marcelo P. Fiore. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In Neil D. Jones and Xavier Leroy, editors, Proc. of the 31st ACM Symp. on Principles of Programming Languages, POPL 2004, pages 64-76. ACM Press, 2004.
13. Bruno Barras and Bruno Bernardo. The implicit calculus of constructions as a programming language with dependent types. In FoSSaCS, pages 365-379, 2008.
14. Stefano Berardi. About the sets-as-propositions embedding of HOL in CC. February 2004.
15. Ulrich Berger. Uniform Heyting arithmetic. Ann. Pure Appl. Logic, 133(1/3):125-148, 2005.
16. Ulrich Berger and Helmut Schwichtenberg. An inverse to the evaluation functional for typed fi-calculus. In Proc. of the 6th IEEE Symp. on Logic in Computer Science (LICS'91), pages 203-211. IEEE Computer Soc. Press, 1991.
17. Kim Bruce and John C. Mitchell. Per models of subtyping, recursive types and higher-order polymorphism. In POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 316-327, New York, NY, USA, 1992. ACM.
18. N. G. de Bruijn. Some extensions of Automath: the AUT-4 family. 1994.
19. J. Cartmell. Generalised algebraic theories and contextual categories. Annals of Pure and Applied Logic, pages 32-209, 1986.
20. Thierry Coquand. An algorithm for type-checking dependent types. In Proc. of the 3rd Int. Conf. on Mathematics of Program Construction, MPC '95, volume 26 of Sci. Comput. Program., pages 167-177. Elsevier, May 1996.
21. Thierry Coquand, Randy Pollack, and Makoto Takeyama. A logical framework with dependently typed records. Fundam. Inform., 65(1-2):113-134, 2005.
22. Judicaël Courant. Strong normalization with singleton types. In Intersection Types and Related Systems (ITRS 2002), volume 70 of Electr. Notes in Theor. Comp. Sci. Elsevier, 2002.
23. Karl Crary. A syntactic account of singleton types via hereditary substitution. In James Cheney and Amy Felty, editors, 4th Int. Wksh. on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2009), pages 21-29. ACM Press, 2009.
24. Peter Dybjer. Internal type theory. In Stefano Berardi and Mario Coppo, editors, Types for Proofs and Programs, Int. Wksh., TYPES'95, volume 1158 of Lect. Notes in Comput. Sci., pages 120-134. Springer, 1996.
25. Peter Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. J. Symb. Logic, 65(2):525-549, 2000.
26. Andrzej Filinski and Henning Korsholm Rohde. A denotational account of untyped normalization by evaluation. In Igor Walukiewicz, editor, Proc. of the 7th Int. Conf. on Foundations of Software Science and Computational Structures, FoSSaCS 2004, volume 2987 of Lect. Notes in Comput. Sci., pages 167-181. Springer, 2004.
27. Franficois Garillot and Benjamin Werner. Simple types in type theory: Deep and shallow encodings. In Klaus Schneider and Jens Brandt, editors, Theorem Proving in Higher Order Logics, TPHOLs 2007, volume 4732 of Lect. Notes in Comput. Sci., pages 368-382. Springer, 2007.
28. Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoret. Comput. Sci. Cambridge University Press, 1989.
29. Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, August 1994. Available as LFCS Report ECS-LFCS-94-304.
30. Healfdene Goguen. A syntactic approach to eta equality in type theory. In Jens Palsberg and Martín Abadi, editors, Proc. of the 32nd ACM Symp. on Principles of Programming Languages, POPL 2005, pages 75-84. ACM Press, January 2005.
31. th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP '02), volume 37 of SIGPLAN Notices, pages 235-246. ACM Press, September 2002.
32. Robert Harper, Furio Honsell, and Gordon Plotkin. A Framework for Defining Logics. Journal of the Association of Computing Machinery, 40(1):143-184, January 1993.
33. INRIA. The Coq Proof Assistant, Version 8.1. INRIA, 2007. http://coq.inria.fr/.
34. Daniel K. Lee, Karl Crary, and Robert Harper. Towards a mechanized metatheory of Standard ML. In Martin Hofmann and Matthias Felleisen, editors, Proc. of the 34th ACM Symp. on Principles of Programming Languages, POPL 2007, pages 173-184. ACM Press, 2007.
35. Andreas Löh, Conor McBride, and Wouter Swierstra. A tutorial implementation of a dependently typed lambda calculus. Fundam. Inform., 102(2):177-207, 2010.
36. Odalric-Ambrym Maillard. Proof-irrelevance, strong-normalisation in Type-Theory and PER. Technical report, Chalmers Institute of Technology, 2006.
37. Per Martin-Löf. An Intuitionistic Theory of Types. Technical report, 1972.
38. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
39. Per 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.
40. Conor McBride. Epigram: Practical programming with dependent types. In Varmo Vene and Tarmo Uustalu, editors, 5th Int. School on Advanced Functional Programming, AFP 2004, Revised Lectures, volume 3622 of Lect. Notes in Comput. Sci., pages 130-170. Springer, 2005.
41. Alexandre Miquel. The implicit calculus of constructions. In Samson Abramsky, editor, Proc. of the 5th Int. Conf. on Typed Lambda Calculi and Applications, TLCA 2001, volume 2044 of Lect. Notes in Comput. Sci., pages 344-359. Springer, 2001.
42. John C. Mitchell. A type-inference approach to reduction properties and semantics of polymorphic expressions (summary). In LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming, pages 308-319, New York, NY, USA, 1986. ACM.
43. John C. Mitchell. Type systems for programming languages. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 365-458. 1990.
44. E. Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in computer science, pages 14-23, Piscataway, NJ, USA, 1989. IEEE Press.
45. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin Löf 's Type Theory: An Introduction. Clarendon Press, Oxford, 1990.
46. Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Dept of Comput. Sci. and Engrg., Chalmers, Göteborg, Sweden, September 2007.
47. Frank Pfenning. Intensionality, extensionality, and proof irrelevance in modal type theory. In LICS 2001: IEEE Symposium on Logic in Computer Science, June 2001.
48. Gordon Plotkin. LCF considered as a programming language. Theor. Comput. Sci., 5:223-255, 1977.
49. Robert Pollack. Closure under alpha-conversion. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs (TYPES'93), Nijmegen, The Netherlands, volume 806 of Lect. Notes in Comput. Sci., pages 313-332. Springer, 1994.
50. Giovanni Sambin and Silvio Valentini. Building up a toolbox for Martin-Löf's type theory: subset theory. In Twenty-five years of constructive type theory (Venice, 1995), volume 36, chapter Oxford Logic Guides, pages 221-244. Oxford University Press, New York, 1998.
51. Natarajan Shankar and Sam Owre. Principles and Pragmatics of Subtyping in PVS. In WADT '99: Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques, pages 37-52, London, UK, 2000. Springer-Verlag.
52. Vincent Siles and Hugo Herbelin. Equality is typable in semi-full pure type systems. In LICS, pages 21-30, 2010.
53. Matthieu Sozeau. Subset coercions in Coq. In Thorsten Altenkirch and Conor McBride, editors, Types for Proofs and Programs, Int. Wksh., TYPES 2006, volume 4502 of Lect. Notes in Comput. Sci., pages 237-252. Springer, 2007.
54. Christopher A. Stone and Robert Harper. Extensional equivalence and singleton types. ACM Trans. Comput. Logic, 7(4):676-722, 2006.
55. Thomas Streicher. Semantics of Type Theory. Progress in Theoretical Computer Science. Birkhäuser Verlag, Basel, 1991.
56. Benjamin Werner. On the strength of proof-irrelevant type theories. Logical Meth. in Comput. Sci., 4, 2008.