Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems


Uniqueness of normal forms (UN=) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow systems. We generalize this previous result and show that this property is decidable for shallow rewrite systems, in contrast to… (More)
DOI: 10.4230/LIPIcs.FSTTCS.2010.284


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics