Towards a domain theory for termination proofs
- First Online:
- 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
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.
Unable to display preview. Download preview PDF.