Home
 

Towards a Domain Theory for Termination Proofs

Stefan Kahrs

Abstract: We present a general framework for termination proofs for Higher-Order Rewrite Systems. The method is tailor-made for having simple (and modular) proofs showing the termination of enriched lambda-calculi.

LFCS report ECS-LFCS-95-314, January 1995.

Previous | Index | Next