Axiomatizing permutation equivalence
- 1 June 1996
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 6 (3) , 219-249
- https://doi.org/10.1017/s0960129500000980
Abstract
We axiomatizepermutation equivalencein term rewriting systems and Klop’s orthogonal Combinatory Reduction Systems (Klop 1980). The axioms for the former are provided by the general approach proposed by Meseguer (Meseguer 1992). The latter need extra axioms modelling the interplay between reductions and the operation of substitution.As a consequence of this work, the definition of permutation equivalence is rid of residual calculi, which are heavy in general.Keywords
This publication has 10 references indexed in Scilit:
- Axiomatizing permutation equivalence in the λ-calculusPublished by Springer Nature ,2005
- DISTRIBUTIVE EVALUATIONS OF λ-CALCULUSFundamenta Informaticae, 1994
- Combinatory reduction systems: introduction and surveyTheoretical Computer Science, 1993
- A theory of binding structures and applications to rewritingTheoretical Computer Science, 1993
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- Equational type logicTheoretical Computer Science, 1990
- Petri nets are monoidsInformation and Computation, 1990
- Explicit substitutionsPublished by Association for Computing Machinery (ACM) ,1990
- A Non-Interleaving Semantics for CCS Based on Proved TransitionsFundamenta Informaticae, 1988