Skip to main content
SpringerLink
Log in

Categorical reconstruction of a reduction free normalization proof

  • Conference paper
  • First Online:
Category Theory and Computer Science (CTCS 1995)

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

Included in the following conference series:

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. Ulrich Berger. Personal email to Thomas Streicher, April 1994.

    Google Scholar 

  2. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science, pages 202–211, 1991.

    Google Scholar 

  3. Thierry Coquand and Peter Dybjer. Intuitionistic model constructions and normalization proofs. Preliminary Proceedings of the 1993 TYPES Workshop, Nijmegen (accepted for publication in Mathematical Structures in Computer Science), 1993.

    Google Scholar 

  4. Thierry Coquand. An algorithm for testing conversion in type theory. In Logical Frameworks. Cambridge University Press, 1991.

    Google Scholar 

  5. Catarina Coquand. From Semantics to Rules: a Machine Assisted Analysis. In Börger, Gurevich, and Meinke, editors, CSL'93, pages 91–105. Springer-Verlag, LNCS 832, 1994.

    Google Scholar 

  6. Neil Ghani. Βη-equality for coproducts. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Typed Lambda Calculi and Applications, number 902 in LNCS, pages 171–185, 1995.

    Google Scholar 

  7. GĂ©rard Huet and Amokrane SaĂŹbi. Constructive category theory. In Peter Dybjer and Randy Pollack, editors, Informal proceedings of the joint CLICS-TYPES workshop on categories and type theory, 1995.

    Google Scholar 

  8. Saul A. Kripke. Semantical analysis of intutionistic logic I. In J.N. Crossley and M.A.E. Dummett, editors, Formal systems and recursive functions. North Holland, 1965.

    Google Scholar 

  9. Joachim Lambek and Phil Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.

    Google Scholar 

  10. Per Martin-Löf. An Intuitionistic Theory of Types: Predicative Part. In H. E. Rose and J. C. Shepherdson, editors, Logic Colloquium 1973, pages 73–118, Amsterdam, 1975. North-Holland Publishing Company.

    Google Scholar 

  11. John C. Mitchell and Eugenio Moggi. Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic, 51:99–124, 1991.

    Google Scholar 

  12. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press, 1990.

    Google Scholar 

  13. A. S. Troelstra and D. van Dalen. Constructivism in Mathematics. An Introduction, volume II. North-Holland, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Göteborg, Sweden

    Thorsten Altenkirch

  2. University of Edinburgh, Scotland

    Martin Hofmann

  3. Technische Hochschule Darmstadt, Germany

    Thomas Streicher

Authors
  1. Thorsten Altenkirch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Hofmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Streicher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt David E. Rydeheard Peter Johnstone

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altenkirch, T., Hofmann, M., Streicher, T. (1995). Categorical reconstruction of a reduction free normalization proof. In: Pitt, D., Rydeheard, D.E., Johnstone, P. (eds) Category Theory and Computer Science. CTCS 1995. Lecture Notes in Computer Science, vol 953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60164-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-60164-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60164-7

  • Online ISBN: 978-3-540-44661-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation