Termination by completion

DOI10.1007/BF01810293zbMath0723.68056MaRDI QIDQ757069

Françoise Bellegarde, Pierre Lescanne

Publication date: 1990

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

completionterminationwell-foundedness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (16)

Program transformation and rewriting ⋮ Automatic termination proofs with transformation orderings ⋮ A complete characterization of termination of 0p 1q→1r 0s ⋮ Termination of constructor systems ⋮ Dummy elimination in equational rewriting ⋮ Dummy elimination: Making termination easier ⋮ An improved general path order ⋮ Finding small counterexamples for abstract rewriting properties ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Termination of term rewriting using dependency pairs ⋮ Transforming termination by self-labelling ⋮ Automating the dependency pair method ⋮ Termination of rewrite systems by elementary interpretations ⋮ Proof of termination of the rewriting system SUBSET on CCL ⋮ Abstract abstract reduction

Uses Software

• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting systems by polynomial interpretations and its implementation
• Orderings for term-rewriting systems
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• Rewriting systems on FP expressions to reduce the number of sequences yielded
• Proof of termination of the rewriting system SUBSET on CCL
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

This page was built for publication: Termination by completion