Regular Papers

Rewriting Techniques and Applications

Volume 914 of the series Lecture Notes in Computer Science pp 241-255


Towards a domain theory for termination proofs

  • Stefan KahrsAffiliated withLaboratory for Foundations of Computer Science, University of Edinburgh

* Final gross prices may vary according to local VAT.

Get Access


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.