Advertisement

On the Strength of Proof-Irrelevant Type Theories

  • Benjamin Werner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4130)

Abstract

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is particularly useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the subset types of the theory of PVS. Finally we show that in these theories, because of the additional extentionality, the axiom of choice implies the decidability of equality, that is, almost classical logic.

Keywords

Type Theory Dependent Type Reduction Rule Strong Normalization Conversion Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Altenkirch, T.: Proving strong normalization for CC by modifying realizability semantics. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, Springer, Heidelberg (1994)Google Scholar
  2. 2.
    Altenkirch, T.: Extensional Equality in Intensional Type Theory. LICS (1999)Google Scholar
  3. 3.
    Barendregt, H.: Lambda Calculi with Types.Technical Report 91-19, Catholic University Nijmegen, 1991.In Handbook of Logic in Computer Science, Vol II, Elsevier (1992)Google Scholar
  4. 4.
    Barthe, G.: The relevance of proof-irrelevance. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 755–768. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    Blanqui, F.: Definitions by rewriting in the Calculus of Constructions. MSCS, vol. 15(1) (2003)Google Scholar
  6. 6.
    Caldwell, J.: Moving Proofs-as-Programs into Practice. In: Proceedings of the 12th IEEE International Conference on Automated Software Engineering, IEEE, Los Alamitos (1997)Google Scholar
  7. 7.
    Chen, C., Xi, H.: Combining Programming with Theorem Proving. In: ICFP 2005 (2005)Google Scholar
  8. 8.
    The Coq Development Team. The Coq Proof-Assistant User’s Manual, INRIA, http://coq.inria.fr/
  9. 9.
    Courtieu, P.: Normalized Types. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Gimenez, E.: A Tutorial on Recursive Types in Coq. INRIA Technical Report (1999)Google Scholar
  11. 11.
    Gonthier, G.: A computer-checked proof of the Four Colour Theorem. Manuscript (2005)Google Scholar
  12. 12.
    Grégoire, B., Leroy, X.: A compiled implementation of strong reduction. In: proceedings of ICFP (2002)Google Scholar
  13. 13.
    Compilation des termes de preuves: un (nouveau) mariage entre Coq et Ocaml. Thése de doctorat, Université Paris 7 (2003)Google Scholar
  14. 14.
    Théry, L., Werner, B., Grégoire, B.: A computational approach to Pocklington certificates in type theory. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol. 3945, Springer, Heidelberg (2006)Google Scholar
  15. 15.
    Hofmann, M., Streicher, T.: A groupoid model refutes uniqueness of identity proofs. LICS 1994, Paris (1994)Google Scholar
  16. 16.
    Luo, Z.: ECC: An Extended Calculus of Constructions. In: Proc. of IEEE LICS 1989 (1989)Google Scholar
  17. 17.
    Martin-Löf, P.: Intuitionistic Type Theory. Studies in Proof Theory, Bibliopolis (1984)Google Scholar
  18. 18.
    McBride, C.: Elimination with a Motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. 19.
    McKinna, J., Pollack, R.: Pure Type Systems formalized. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, Springer, Heidelberg (1993)CrossRefGoogle Scholar
  20. 20.
    Melliès, P.-A., Werner, B.: A Generic Normalization Proof for Pure Type System. In: Giménez, E. (ed.) TYPES 1996. LNCS, vol. 1512, Springer, Heidelberg (1998)CrossRefGoogle Scholar
  21. 21.
    Miquel, A., Werner, B.: The not so simple proof-irrelevant model of CC. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  22. 22.
    Nogin, A., Kopilov, A.: Formalizing Type Operations Using the Image Type Constructor. In: WoLLIC. ENTCS (to appear, 2006)Google Scholar
  23. 23.
    Owre, S., Shankar, N.: The Formal Semantics of PVS. SRI Technical Report CSL-97-2R. Revised (March 1999)Google Scholar
  24. 24.
    Paulin-Mohring, C.: Extraction de Programmes dans le Calcul des Constructions. Thèse de doctorat, Université Paris 7 (1989)Google Scholar
  25. 25.
    Pfenning, F.: Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory. In: Proceedings of LICS, IEEE, Los Alamitos (2001)Google Scholar
  26. 26.
    Werner, B.: Sets in Types, Types in Sets. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, Springer, Heidelberg (1997)CrossRefGoogle Scholar
  27. 27.
    Hongwei Xi, Dependent Types in Practical Programming, Ph.D, CMU (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Benjamin Werner
    • 1
  1. 1.INRIA-Futurs and LIX, Ecole PolytechniqueFrance

Personalised recommendations