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
Click to download this file (277kB)
This file may not be suitable for users of assistive technology. Request an accessible format
Postscript Language: English
Click to download this file (245kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format
Official URL: http://dx.doi.org/10.1007/3-540-59200-8_60

Abstract

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:	16 Nov 2021 09:59 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