Skip to main content
SpringerLink
Log in

Towards a domain theory for termination proofs

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

Abstract

We present a general framework for termination proofs for Higher-Order Rewrite Systems. The method is tailor-made for having simple proofs showing the termination of enriched λ-calculi.

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.

Similar content being viewed by others

References

  1. H. P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol.2, pages 117–309. Oxford Science Publications, 1992.

    Google Scholar 

  2. M. C. F. Ferreira and H. Zantema. Total termination of term rewriting. In Rewriting Techniques and Applications, pages 213–227, 1993. LNCS 690.

    Google Scholar 

  3. R. Gandy. Proofs of strong normalization. In J. Seldin and J. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457–477. Academic Press, 1980.

    Google Scholar 

  4. G. Hessenberg. Grundbegriffe der Mengenlehre. Abhandlungen der Fries'schen Schule, pages 479–706, 1906.

    Google Scholar 

  5. S. MacLane. Categories for the Working Mathematician. Springer, 1971.

    Google Scholar 

  6. J. v. Neumann. Zur Einführung der transfiniten Zahlen. Acta litterarum ac scientarum, 1:199–208, 1923.

    Google Scholar 

  7. J. v. d. Pol. Termination proofs for higher-order rewrite systems. In Higher-Order Algebra, Logic, and Term Rewriting, pages 305–325, 1993. LNCS 816.

    Google Scholar 

  8. W. Sierpiński. Cardinal and Ordinal Numbers. Polish Scientific Publishers, 1965.

    Google Scholar 

  9. D. Wolfram. The Clausal Theory of Types. Cambridge University Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland

    Stefan Kahrs

Authors
  1. Stefan Kahrs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kahrs, S. (1995). Towards a domain theory for termination proofs. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59200-6

  • Online ISBN: 978-3-540-49223-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation