Transformations and confluence for rewrite systems

DOI10.1016/0304-3975(94)00255-0zbMath0872.68078OpenAlexW2073349631MaRDI QIDQ672232

Rakesh M. Verma

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00255-0

zbMATH Keywords

constructor-based rewrite systemsleft-linear nonoverlapping systems with confluent root overlapsnonlinear systems with no overlapsnonoverlapping noetherian systems with confluent root overlapsweakly persistent confluent systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Remarks on Thatte's transformation of term rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming in equational logic: Beyond strong sequentiality
• On the correspondence between two classes of reduction systems
• Implementing first-order rewriting with constructor systems
• The algebraic specification of abstract data types
• On theories with a combinatorial definition of 'equivalence'
• Programming with Equations
• Abstract data types and software validation
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution

This page was built for publication: Transformations and confluence for rewrite systems