Axiomatizing permutation equivalence in the λ-calculus
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 350-363
- https://doi.org/10.1007/bfb0013837
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Axiomatizing net computations and processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An algebraic semantics for structured transition systems and its application to logic programsTheoretical Computer Science, 1992
- Equational type logicTheoretical Computer Science, 1990
- Concurrent transition systemsTheoretical Computer Science, 1989
- A Non-Interleaving Semantics for CCS Based on Proved TransitionsFundamenta Informaticae, 1988
- Formal verification of parallel programsCommunications of the ACM, 1976