Typing the use of resources in a concurrent calculus
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 239-253
- https://doi.org/10.1007/3-540-63875-x_56
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A partially deadlock-free typed process calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The π-calculus in direct stylePublished by Association for Computing Machinery (ACM) ,1997
- The reflexive CHAM and the join-calculusPublished by Association for Computing Machinery (ACM) ,1996
- Linearity and the pi-calculusPublished by Association for Computing Machinery (ACM) ,1996
- Modal μ-types for processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- On the unity of logicAnnals of Pure and Applied Logic, 1993
- The chemical abstract machineTheoretical Computer Science, 1992
- Proof systems for satisfiability in Hennessy-Milner Logic with recursionTheoretical Computer Science, 1990
- Linear logicTheoretical Computer Science, 1987
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985