School of Computing

Confluence of curried term-rewriting systems

Stefan Kahrs

Journal of Symbolic Computation, 19:182-196, 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 kbytes

Bibtex Record

@article{567,
author = {Stefan Kahrs},
title = {Confluence of Curried Term-Rewriting Systems},
month = {August},
year = {1995},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1995/567},
    journal = {Journal of Symbolic Computation},
    volume = {19},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014