# Towards a domain theory for termination proofs

Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: Hsiang, Jieh, ed. Rewriting Techniques and Applications 6th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 241-255. ISBN 978-3-540-59200-6. E-ISBN 978-3-540-49223-8. (doi:10.1007/3-540-59200-8_60)

PDF
 Preview
Postscript
 Preview
Official URL
http://dx.doi.org/10.1007/3-540-59200-8_60

## 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.

Item Type: Book section 10.1007/3-540-59200-8_60 Monoidal Category; Rule Application; Forgetful Functor; Termination Proof; Lambda Calculus Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, Faculties > Sciences > School of Computing > Theoretical Computing Group Mark Wheadon 20 Aug 2009 19:48 UTC 06 Sep 2019 11:41 UTC https://kar.kent.ac.uk/id/eprint/21266 (The current URI for this page, for reference purposes)