Skip to main content
SpringerLink
Log in

The relevance of proof-irrelevance

A meta-theoretical study of generalised calculi of constructions

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

We propose a general technique, inspired from proof-irrelevance, to prove strong normalisation and consistency for extensions of the Calculus of Constructions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Audebaud. Partial objects in the calculus of constructions. In Proceedings of LICS'91, pages 86–95. IEEE Computer Society Press, 1991.

    Google Scholar 

  2. L. Augustsson. Cayenne: Spice up your programming with dependent types. Prelimnary draft, 1998.

    Google Scholar 

  3. F. Barbanera, M. Fernández, and II. Geuvers. Modularity of strong normalisation and confluence in the algebraic λ-cube. Journal of Functional Programming, November 1997.

    Google Scholar 

  4. H. Darendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, pages 117–309. Oxford Science Publications, 1992. Volume 2.

    Google Scholar 

  5. G. Darthe and H. Geuvers. Congruence types. In H. Kleine Buening, editor, Proceedings of CSL'95, volume 1092 of Lecture Notes in Computer Science, pages 36–51. Springer-Verlag, 1996.

    Google Scholar 

  6. G. Darthe, J. Hatcliff, and M.H. SØrensen. A notion of classical pure type system. In Proceedings of MFPS'97, volume 6 of Electronic Notes in Theoretical Computer Science. Elsevier, 1997.

    Google Scholar 

  7. G. Barthe and F. van Raamsdonk. Termination of algebraic type systems: the syntactic approach. In M. Hanns and J. Heering, editors, Proceedings of ALP '97 — HOA '97, volume 1298 of Lecture Notes in Computer Science, pages 174–193. Springer-Verlag, 1997.

    Google Scholar 

  8. V. Dreazu-Tannen. Combining algebra and higher-order types. In Proceedings of LICS'88, pages 82–90. IEEE Computer Society Press, 1988.

    Google Scholar 

  9. R.L. Constable and S.F. Smith. Partial objects in constructive type theory. In Proceedings of LICS'87, pages 183–193. IEEE Computer Society Press, 1987.

    Google Scholar 

  10. T. Coquand. Pattern matching in type theory. In D. Nordström, editor, Informal proceedings of LF'93, pages 66–79, 1992.

    Google Scholar 

  11. T. Coquand and H. Herbelin. A-translation and looping combinators in pure type systems. Journal of Functional Programming, 4(1):77–88, January 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95–120, February/March 1988.

    Article  MATH  MathSciNet  Google Scholar 

  13. N.G. de Bruijn. Some extensions of Automatic the AUT-4 family. In R. Nederpelt, H. Geuvers, and R. de Vrijer, editors, Selected papers on Antomath, volume 133 of Studies in Logic and the Foundations of Mathematics, pages 283–288. North-Holland, Amsterdam, 1994.

    Google Scholar 

  14. D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251–267, December 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. H. Geuvers. The Church-Rosser property for Βη-reduction in typed λ-calculi. In Proceedings of LICS'92, pages 453–460. IEEE Computer Society Press, 1992.

    Google Scholar 

  16. H. Geuvers. A short and flexible proof of strong normalisation for the Calculus of Constructions. In P. Dybjer, D. Nordström, and J. Smith, editors, Proceedings of TYPES'94, volume 996 of Lecture Notes in Computer Science, pages 14–38. Springer-Verlag, 1995.

    Google Scholar 

  17. H. Geuvers and M.J. Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1(2):155–189, April 1991.

    MATH  MathSciNet  Google Scholar 

  18. T. Griffin. A formulae-as-types notion of control. In Proceedings of POPL '90, pages 47–58. ACM Press, 1990.

    Google Scholar 

  19. M. Hofmann and T. Streicher. The groupoid model refutes uniqueness of identity proofs. In Proceedings of LICS'94, pages 208–212. IEEE Computer Society Press, 1994.

    Google Scholar 

  20. J.-P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349–391, February 1997.

    Article  MATH  MathSciNet  Google Scholar 

  21. F. Pfenning and C. Paulin. Inductively defined types in the calculus of constructions. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Proceedings of MFPS'89, volume 442 of Lecture Notes in Computer Science, pages 209–228. Springer-Verlag, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutionen för Datavetenskap, Chalmers Tekniska Högskola, Göteborg, Sweden

    Gilles Barthe

  2. Departamento dc Infortnatica, Universidade do Minho, Braga, Portugal

    Gilles Barthe

Authors
  1. Gilles Barthe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barthe, G. (1998). The relevance of proof-irrelevance. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055099

Download citation

  • DOI: https://doi.org/10.1007/BFb0055099

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation