Skip to main content

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) (KAR id:21266)

PDF
Language: English
Download (460kB) Preview
[img]
Preview
Postscript
Language: English
Download (245kB) Preview
[img]
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
DOI/Identification number: 10.1007/3-540-59200-8_60
Uncontrolled keywords: Monoidal Category; Rule Application; Forgetful Functor; Termination Proof; Lambda Calculus
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 20 Aug 2009 19:48 UTC
Last Modified: 06 May 2020 03:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21266 (The current URI for this page, for reference purposes)
Kahrs, Stefan: https://orcid.org/0000-0001-5099-9375
  • Depositors only (login required):

Downloads

Downloads per month over past year