Axiomatizing permutation equivalence

DOI10.1017/S0960129500000980zbMath0884.68070MaRDI QIDQ4715673

Ugo Montanari, Cosimo Laneve

Publication date: 18 November 1996

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

semanticsrewriting systemspermutation equivalenceChurch-Rosser theorem\(\lambda\)-calculus with explicit substitutionsalgebraic structure of termsequivalences between derivationsorthogonal combinatory reduction systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Rewriting logic: Roadmap and bibliography, Twenty years of rewriting logic, Models of Computation: A Tribute to Ugo Montanari’s Vision, Unnamed Item, Tile formats for located and mobile systems., Relating conflict-free stable transition and event models via redex families

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