Skip to main content

Elimination of extensionality in Martin-Löf type theory

  • Conference paper
  • First Online:

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

Abstract

We construct a syntactic model of intensional Martin-Löf type theory in which two pointwise propositionally equal functions are propositionally equal themselves. In the model types are interpreted as types equipped with equivalence relations; the identity type at each type is interpreted as the associated relation. The interpretation function from the syntax to the model gives rise to a procedure which replaces all instances of the identity type by suitable relations defined by induction on the type structure and thereby eliminates instances of an axiom which states that pointwise propositionally equal functions are propositionally equal themselves. We also sketch how “quotient types” can be interpreted.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Cartmell. Generalized algebraic theories and contextual categories. PhD thesis, Univ. Oxford, 1978.

    Google Scholar 

  2. Solomon Feferman. Theories of Finite Type. In Jon Barwise, editor, Handbook of Mathematical Logic, chapter D.4, pages 934–935. North-Holland, 1977.

    Google Scholar 

  3. Martin Hofmann. Extensional concepts in intensional type theory. PhD thesis, Univ. of Edinburgh, forthcoming 1994.

    Google Scholar 

  4. Bart Jacobs. Categorical Type Theory. PhD thesis, University of Utrecht, 1991.

    Google Scholar 

  5. Bart Jacobs. Comprehension categories and the semantics of type theory. Theoretical Computer Science, 107:169–207, 1993.

    Google Scholar 

  6. Horst Luckhardt. Extensional Gödel Functional Interpretation. A Consistency Proof of Classical Analysis, volume 306 of Lecture Notes in Mathematics. Springer, Berlin, 1973.

    Google Scholar 

  7. Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, July 1990.

    Google Scholar 

  8. Zhaohui Luo and Randy Pollack. LEGO Proof Development System: User's Manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, May 1992.

    Google Scholar 

  9. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis Napoli, 1984.

    Google Scholar 

  10. John Mitchell and Gordon Plotkin. Abstract Types have Existential Type. ACM Transactions on Programming Languages and Systems, 10(3):470–502, 1988.

    Google Scholar 

  11. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löfs Type Theory, An Introduction. Clarendon Press, Oxford, 1990

    Google Scholar 

  12. Thomas Streicher. Semantics of Type Theory. Birkhäuser, 1991.

    Google Scholar 

  13. Thomas Streicher. Semantical Investigations into Intensional Type Theory. Habilitationsschrift, LMU München, to appear 1993.

    Google Scholar 

  14. David Turner. A new formulation of constructive type theory. In P. Dybjer, editor, Proceedings of the Workshop on Programming Logic, pages 258–294. Programming Methodology Group, Univ. of Göteborg, May 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Henk Barendregt Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hofmann, M. (1994). Elimination of extensionality in Martin-Löf type theory. In: Barendregt, H., Nipkow, T. (eds) Types for Proofs and Programs. TYPES 1993. Lecture Notes in Computer Science, vol 806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58085-9_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-58085-9_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58085-0

  • Online ISBN: 978-3-540-48440-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics