Towards a domain theory for termination proofs

  • Stefan Kahrs
Regular Papers

DOI: 10.1007/3-540-59200-8_60

Part of the Lecture Notes in Computer Science book series (LNCS, volume 914)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Stefan Kahrs
    • 1
  1. 1.Laboratory for Foundations of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations