Confluence of Curried Term-Rewriting Systems
β Scribed by Stefan Kahrs
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 721 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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 arbitrary term rewriting systems. The structure of the proof is similar to Toyama's proof that confluence is a modular property of TRS.
π SIMILAR VOLUMES
It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, there is no finite, convergent \(A C\) term rewrite system for the equational theory of all lattices.