Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: UNSPECIFIED.
|
Download (270Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (240Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
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: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Uncontrolled keywords: | HRS, ordinals, SN, semantics |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 20 Aug 2009 19:48 |
| Last Modified: | 06 Sep 2011 03:48 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21266 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
