Termination of Rewrite Systems by Elementary Interpretations - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Pierre Lescanne. Termination of Rewrite Systems by Elementary Interpretations. Formal Asp. Comput., 7(1):77-90, 1995.

The following publications are possibly variants of this publication:

Termination of Rewrite Systems by Elementary InterpretationsPierre Lescanne. icalp 1992: 21-36

Termination of Rewriting Systems by Polynomial Interpretations and Its ImplementationAhlem Ben Cherifa, Pierre Lescanne. SCP, 9(2):137-159, 1987.

Rewrite Orderings and Termination of Rewrite SystemsPierre Lescanne. mfcs 1991: 17-27

An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial InterpretationsAhlem Ben Cherifa, Pierre Lescanne. cade 1986: 42-51

Proving Termination of Associative Commutative Rewriting Systems by RewritingIsabelle Gnaedig, Pierre Lescanne. cade 1986: 52-61

runs on WebDSL