Skip to main content
Springer Nature Link
Log in

Strict functionals for termination proofs

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1995)

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

Included in the following conference series:

  • 179 Accesses

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. Robin O. Gandy. Proofs of strong normalization. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457–477. Academic Press, 1980.

    Google Scholar 

  2. Jean-Yves Girard. Proof Theory and Logical Complexity. Bibliopolis, Napoli, 1987.

    Google Scholar 

  3. Gerard Huet and Derek Oppen. Equations and rewrite rules — a survey. In Formal Language Theory — Perspectives and Open Problems, pages 349–405. Academic Press, 1980.

    Google Scholar 

  4. Tobias Nipkow. Orthogonal higher-order rewrite systems are confluent. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science, pages 306–317, Berlin, 1993. Springer.

    Google Scholar 

  5. Dag Prawitz. Ideas and results in proof theory. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 235–307. North-Holland, Amsterdam, 1971.

    Google Scholar 

  6. Anne S. Troelstra and Dirk van Dalen. Constructivism in Mathematics. An Introduction, volume 121, 123 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1988.

    Google Scholar 

  7. Jaco van de Pol. Termination proofs for higher-order rewrite systems. In J. Heering, K. Meinke, B. Möller, and T. Nipkow, editors, Higher-Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of Lecture Notes in Computer Science, pages 305–325, Berlin, 1994. Springer.

    Google Scholar 

  8. Vincent van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität München, Deutschland

    Jaco van de Pol & Helmut Schwichtenberg

Authors
  1. Jaco van de Pol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Schwichtenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van de Pol, J., Schwichtenberg, H. (1995). Strict functionals for termination proofs. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014064

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59048-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation