Axiomatizing permutation equivalence
From MaRDI portal
Publication:4715673
DOI10.1017/S0960129500000980zbMath0884.68070MaRDI QIDQ4715673
Publication date: 18 November 1996
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
semantics; rewriting systems; permutation equivalence; Church-Rosser theorem; \(\lambda\)-calculus with explicit substitutions; algebraic structure of terms; equivalences between derivations; orthogonal combinatory reduction systems
68Q55: Semantics in the theory of computing
68Q42: Grammars and rewriting systems
03B40: Combinatory logic and lambda calculus
Related Items
Relating conflict-free stable transition and event models via redex families, Rewriting logic: Roadmap and bibliography, Tile formats for located and mobile systems., Unnamed Item
Cites Work
- A theory of binding structures and applications to rewriting
- Equational type logic
- Petri nets are monoids
- Conditional rewriting logic as a unified model of concurrency
- An algebraic semantics for structured transition systems and its application to logic programs
- Combinatory reduction systems: Introduction and survey