Transformations and confluence for rewrite systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4037164 (Why is no real title available?)
- scientific article; zbMATH DE number 3684925 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 177827 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Abstract data types and software validation
- Implementing first-order rewriting with constructor systems
- On the correspondence between two classes of reduction systems
- On theories with a combinatorial definition of 'equivalence'
- Programming in equational logic: Beyond strong sequentiality
- Programming with Equations
- The algebraic specification of abstract data types
- 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
- Implementing first-order rewriting with constructor systems
- scientific article; zbMATH DE number 6744203 (Why is no real title available?)
- Pushing the frontiers of combining rewrite systems farther outwards
- scientific article; zbMATH DE number 65745 (Why is no real title available?)
- Remarks on Thatte's transformation of term rewriting systems
- scientific article; zbMATH DE number 177827 (Why is no real title available?)
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)