Towards a domain theory for termination proofs

Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: UNSPECIFIED. (Full text available)

PDF
Download (460kB) Preview
[img]
Preview
Postscript
Download (245kB)
[img]
Preview

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 > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 20 Aug 2009 19:48 UTC
Last Modified: 15 Jan 2017 16:15 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21266 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year