Transformations and confluence for rewrite systems
DOI10.1016/0304-3975(94)00255-0zbMATH Open0872.68078OpenAlexW2073349631MaRDI QIDQ672232FDOQ672232
Authors: 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
Recommendations
constructor-based rewrite systemsleft-linear nonoverlapping systems with confluent root overlapsnonlinear systems with no overlapsnonoverlapping noetherian systems with confluent root overlapsweakly persistent confluent systems
Cites Work
- On theories with a combinatorial definition of 'equivalence'
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebraic specification of abstract data types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abstract data types and software validation
- Programming in equational logic: Beyond strong sequentiality
- On the correspondence between two classes of reduction systems
- Implementing first-order rewriting with constructor systems
- Programming with Equations
- Title not available (Why is that?)
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
Cited In (7)
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Title not available (Why is that?)
- Implementing first-order rewriting with constructor systems
- Pushing the frontiers of combining rewrite systems farther outwards
- Title not available (Why is that?)
- Remarks on Thatte's transformation of term rewriting systems
- Title not available (Why is that?)
This page was built for publication: Transformations and confluence for rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672232)
