scientific article; zbMATH DE number 4047067

MaRDI QIDQ3783523zbMATH OpenFDO

Authors Ahlem Ben Cherifa, Pierre Lescanne

Publication date 1986

zbMATH Keywords

abstract data typesequational theoremspolynomial interpretationsterm rewriting systemstermination

Mathematics Subject Classification ID

Theory of software (68N99) Abstract data types; algebraic specification (68Q65) Symbolic computation and algebraic computation (68W30)

Cited in

(6)

• Termination of rewriting
• Termination and completion modulo associativity, commutativity and identity
• Proving termination of (conditional) rewrite systems. A semantic approach
• Proof of termination of the rewriting system SUBSET on CCL
• An overview of LP, the Larch Prover
• Polynomials over the reals in proofs of termination : from theory to practice

Describes a project that uses

Uses Software

• REVE

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783523)