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 this file (PDF/277kB) |
![[thumbnail of sn-rta.pdf]](https://kar.kent.ac.uk/style/images/fileicons/application_pdf.png) |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
|
Postscript
Language: English |
|
|
Download this file (Postscript/245kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
| 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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 20 Aug 2009 19:48 UTC |
| Last Modified: | 05 Nov 2024 09:59 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21266 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Kahrs, Stefan.
| Creator's ORCID: |
 https://orcid.org/0000-0001-5099-9375
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
