Bi-rewrite systems

DOI10.1006/JSCO.1996.0053zbMATH Open0865.68070OpenAlexW2001146053MaRDI QIDQ674746FDOQ674746

Authors: Jordi Levy, Jaume Agustí 

Publication date: 23 June 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1e21512b11464b5713e041d2fd82b432a5b2f749

Recommendations

• Bi-rewriting, a term rewriting technique for monotonic order relations
• Structures for abstract rewriting
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Ordered rewriting and confluence
• Computing with rewrite systems

zbMATH Keywords

rule schemesbi-rewrite system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
• On rewrite constraints and context unification
• Abstract abstract reduction
• Structures for abstract rewriting
• Knuth-Bendix completion for non-symmetric transitive relations
• Title not available (Why is that?)
• Some general results about proof normalization
• Bi-rewriting, a term rewriting technique for monotonic order relations

This page was built for publication: Bi-rewrite systems

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