Skip to main content
SpringerLink
Log in

Normalization for typed lambda calculi with explicit substitution

  • Conference paper
  • First Online:
Book cover Computer Science Logic (CSL 1993)

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

Included in the following conference series:

I would like to thank A. Pitts and P.L. Curien for suggestions and helpful discussions. I should also like to acknowledge financial support from the CLICS-II project. This work was done while I was at the University of Cambridge, England.

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. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.

    MathSciNet  Google Scholar 

  2. P.-L. Curien, T. Hardin, and A. Ríos. Strong normalisation of substitutions. In I.M. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science 1992, pages 209–217. Lecture Notes in Computer Science No. 629, Berlin, Heidelberg, New York, 1992.

    Google Scholar 

  3. N.G. De Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Math, 34:381–392, 1972.

    Google Scholar 

  4. Jean-Yves Girard, Paul Taylor, and Yves Lafont. Proofs and Types. Cambridge University Press, Cambridge, 1989.

    Google Scholar 

  5. Thérèse Hardin and Alain Laville. Proof of termination of the rewriting system Subst on CCL. Theoretical Computer Science, 46:305–312, 1986.

    Article  MathSciNet  Google Scholar 

  6. György E. Révész. Lambda-calculus, combinators and functional programming. Number 4 in Cambridge tracts in theoretical computer science. Cambridge University Press, 1988.

    Google Scholar 

  7. Eike Ritter. Categorical Abstract Machines for Higher-Order Lambda Calculi.PhD thesis, University of Cambridge, 1992. Also available as Technical Report No. 297.

    Google Scholar 

  8. W. W. Tait. A realizability interpretation of the theory of species. In R. Parikh, editor, Logic Colloquium, pages 240–251. LNM 453, Springer Verlag, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, England

    Eike Ritter

Authors
  1. Eike Ritter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ritter, E. (1994). Normalization for typed lambda calculi with explicit substitution. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049338

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58277-9

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation