Axiomatizing permutation equivalence
From MaRDI portal
Recommendations
Cites work
- A theory of binding structures and applications to rewriting
- An algebraic semantics for structured transition systems and its application to logic programs
- Combinatory reduction systems: Introduction and survey
- Conditional rewriting logic as a unified model of concurrency
- Equational type logic
- Petri nets are monoids
Cited in
(13)- Relating conflict-free stable transition and event models via redex families
- Rewriting logic: Roadmap and bibliography
- Tile formats for located and mobile systems.
- Twenty years of rewriting logic
- Permutative renamings in the extended Fraenkel-Mostowski set theory
- Four equivalent equivalences of reductions
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- scientific article; zbMATH DE number 4021204 (Why is no real title available?)
- scientific article; zbMATH DE number 4059373 (Why is no real title available?)
- Uniform rewriting based on permutations
- scientific article; zbMATH DE number 1231654 (Why is no real title available?)
- scientific article; zbMATH DE number 1086711 (Why is no real title available?)
- Saturating sorting without sorts
This page was built for publication: Axiomatizing permutation equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715673)