Date: 01 Jun 2005

Towards a domain theory for termination proofs

* Final gross prices may vary according to local VAT.

Get Access

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.