Finding small counterexamples for abstract rewriting properties

DOI10.1017/S0960129518000221zbMath1398.68287OpenAlexW2577059133WikidataQ124988910 ScholiaQ124988910MaRDI QIDQ4585013

Hans Zantema

Publication date: 5 September 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129518000221

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification

Cites Work

• Unnamed Item
• Unnamed Item
• Termination by completion
• Confluence by decreasing diagrams
• Confluence by Decreasing Diagrams
• On the union of well-founded relations
• A Rewriting View of Simple Typing
• Triangulation in rewriting

This page was built for publication: Finding small counterexamples for abstract rewriting properties