[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |
Originator: Aart Middeldorp [Mid90]
Date: April 1991
Summary: Is unicity of normal forms a modular property of standard conditional systems?
A conditional term-rewriting system has rules of the form p ⇒ l → r, which are only applied to instances of l for which the condition p holds. A “standard” (or “join”) conditional system is one in which the condition p is a conjunction of conditions u ↓ v, meaning that u and v have a common reduct (are “joinable”). Is unicity of normal forms (UN) a modular property of standard conditional systems? See also [Mid93].
This has been answered in the negative by giving a counterexample [Sch02].
[Submit a comment] [RTALooP home] [Index] [Previous] [Next] | [Postscript] [PDF] [BibTeX Source] [LaTeX Source] |