© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Confluence of curried term-rewriting systems
Stefan Kahrs
Journal of Symbolic Computation, 19:601-623, August 1995.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 $\lambda$-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.
Download publication 88 kbytesBibtex Record
@article{567,
author = {Stefan Kahrs},
title = {Confluence of Curried Term-Rewriting Systems},
month = {August},
year = {1995},
pages = {601--623},
keywords = {Currying, Term Rewriting, Confluence},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1995/567},
journal = {Journal of Symbolic Computation},
volume = {19},
}