Confluence of Curried Term-Rewriting Systems

Kahrs, Stefan (1995) Confluence of Curried Term-Rewriting Systems. Journal of Symbolic Computation, 19 . pp. 601-623. (Full text available)

PDF
Download (328kB)
[img]
Preview
Postscript
Download (290kB)
[img]
Preview

Abstract

Term rewriting systems operate on first-order terms. Presenting such terms in curried form is usually regarded as a trivial change of notation. However, in the absence of a type-discipline, or in the presence of a more powerful type-discipline than simply typed λ-calculus, the change is not as trivial as one might first think. It is shown that currying preserves confluence of em arbitrary/ term rewriting systems. The structure of the proof is similar to Toyama's proof that confluence is a modular property of TRS.

Item Type: Article
Uncontrolled keywords: Currying, Term Rewriting, Confluence
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: 19 Aug 2009 20:13
Last Modified: 06 Sep 2011 03:47
Resource URI: http://kar.kent.ac.uk/id/eprint/21251 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year