Bruno Salinier

Learn More
In 8], Thatte demonstrated the possibility of simulating an orthogonal TRS with a left-linear constructor system obtained from the original system via a simple transformation. The class of strongly sequential systems (SS) was deened in 3]. In 2], we have deened the class of constructor equivalent systems (CE) for which Thatte's transformation preserves(More)
Strongly sequential constructor systems admit a very eecient algorithm to compute normal forms. Thatte found a transformation that allows us to simulate any orthogonal system with a constructor system. Unfortunately, this transformation does not generally preserve strong sequentiality. On the other hand, the class of forward-branching systems contains the(More)
Strongly sequential constructor systems admit a very ee-cient algorithm to compute normal forms. The class of forward-branching systems contains the class of strongly sequential constructor systems, and admits a similar reduction algorithm, but less eecient on the entire class of forward-branching systems. In this article, we present a new transformation(More)
Sekar and al. found an eecient parallel reduction strategy for the class of path sequential term rewriting systems, which follow the constructor discipline. In this article, we present an overview of a parallel reduction strategy for the extended class of nonconstructor path sequential systems. We then deene formally this class and show some of its(More)
  • 1