Unique Normalization for Shallow TRS

  title={Unique Normalization for Shallow TRS},
  author={Guillem Godoy and Florent Jacquemard},
Computation with a term rewrite system (TRS) consists in the application of its rules from a given starting term until a normal form is reached, which is considered the result of the computation. The unique normalization (UN) property for a TRS R states that any starting term can reach at most one normal form when R is used, i.e. that the computation with R is unique. We study the decidability of this property for classes of TRS defined by syntactic restrictions such as linearity (variables can… CONTINUE READING