A π-calculus with explicit substitutions
- 10 November 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 168 (1) , 53-103
- https://doi.org/10.1016/s0304-3975(96)00063-1
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Symbolic bisimulationsTheoretical Computer Science, 1995
- Bisimulation can't be tracedJournal of the ACM, 1995
- Turning SOS Rules into EquationsInformation and Computation, 1994
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Structured operational semantics and bisimulation as a congruenceInformation and Computation, 1992
- Higher-level synchronising devices in Meije-SCCSTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Process algebra for synchronous communicationInformation and Control, 1984
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960