An Implicitly-Typed Deadlock-Free Process Calculus
- 21 December 2000
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 489-504
- https://doi.org/10.1007/3-540-44618-4_35
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Secure Information Flow as Typed Process BehaviourLecture Notes in Computer Science, 2000
- Linearity and the pi-calculusACM Transactions on Programming Languages and Systems, 1999
- The name discipline of uniform receptivenessTheoretical Computer Science, 1999
- A partially deadlock-free typed process calculusACM Transactions on Programming Languages and Systems, 1998
- Typing the use of resources in a concurrent calculusLecture Notes in Computer Science, 1997
- Coordination requirements expressed in types for active objectsPublished by Springer Science and Business Media LLC ,1997
- Graph types for monadic mobile processesLecture Notes in Computer Science, 1996
- An interaction-based language and its typing systemLecture Notes in Computer Science, 1994
- The Polyadic π-Calculus: a TutorialPublished by Springer Science and Business Media LLC ,1993
- A calculus of mobile processes, IInformation and Computation, 1992