Changeable interfaces and promised messages for concurrent components
- 28 February 1999
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 141-145
- https://doi.org/10.1145/298151.298223
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A partially deadlock-free typed process calculusACM Transactions on Programming Languages and Systems, 1998
- Linearity and the pi-calculusPublished by Association for Computing Machinery (ACM) ,1996
- A behavioral notion of subtypingACM Transactions on Programming Languages and Systems, 1994
- Regular types for active objectsACM SIGPLAN Notices, 1993
- A sort inference algorithm for the polyadic π-calculusPublished by Association for Computing Machinery (ACM) ,1993
- A calculus of mobile processes, IInformation and Computation, 1992
- Subtyping recursive typesPublished by Association for Computing Machinery (ACM) ,1991