Termination by completion

DOI10.1007/BF01810293zbMATH Open0723.68056MaRDI QIDQ757069FDOQ757069

Authors: Françoise Bellegarde, Pierre Lescanne 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 3930339
• scientific article; zbMATH DE number 4047065
• Termination of rewriting
• Maximal completion
• scientific article; zbMATH DE number 3921958

zbMATH Keywords

terminationcompletionwell-foundedness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Orderings for term-rewriting systems
• Termination of rewriting
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (27)

• Maximal completion
• Term rewriting induction
• Automating the dependency pair method
• Summarization for termination: No return!
• Transforming termination by self-labelling
• A complete characterization of termination of 0p 1q→1r 0s
• An improved general path order
• Termination modulo equations by abstract commutation with an application to iteration
• Program transformation and rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abstract abstract reduction
• Termination of term rewriting using dependency pairs
• On proving properties of completion strategies
• Automatic termination proofs with transformation orderings
• Termination of constructor systems
• Jumping and escaping: modular termination and the abstract path ordering
• Completion-time optimization of rewrite-time goal solving
• Termination of processes
• REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
• Dummy elimination in equational rewriting
• Dummy elimination: Making termination easier
• Proof of termination of the rewriting system SUBSET on CCL
• Title not available (Why is that?)
• Finding small counterexamples for abstract rewriting properties
• Termination of rewrite systems by elementary interpretations
• Constructing Rewrite-Based Decision Procedures for Embeddings and Termination

Uses Software

• REVE

This page was built for publication: Termination by completion

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