An implicitly-typed deadlock-free process calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1877 LNCS, Issue , 2000, Pages 489-504

  Kobayashi, Naoki ^a   Saito, Shin ^a   Sumii, Eijiro ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS;

CONCURRENT LANGUAGES; CONCURRENT PROGRAM; DEADLOCK FREE; HIGH-LEVEL REASONING; PROCESS CALCULI; TYPE ANNOTATIONS; TYPE RECONSTRUCTION; TYPE SYSTEMS;

CALCULATIONS;

EID: 84885206872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_35     Document Type: Conference Paper

References (18)

1. G. Boudol. Typing the use of resources in a concurrent calculus. In Proceedings of ASIAN'97, LNCS 1345, pages 239-253, 1997.
2. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In Proc. of European Symposium on Programming (ESOP) 2000, LNCS 1782, pp. 180-199, 2000.
3. J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Journal of Information Processing and Cybernetics, 30(3): 143-160, 1994.
4. A. Igarashi and N. Kobayashi. Type reconstruction for linear pi-calculus with I/O subtyping. Information and Computation. To appear. A preliminary summary appeared in Proceedings of SAS'97, LNCS 1302, pp. 187-201.
5. N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2): 436-482, 1998.
6. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems, 21(5): 914-947, 1999. A preliminary summary appeared in Proceedings of POPL'96, pp. 358-371.
7. N. Kobayashi, S. Saito, and E. Sumii. An implicitly-typed deadlock-free process calculus. Technical Report TR00-01, Dept. Info. Sci., Univ. of Tokyo, January 2000. Available at http://www.yl.is.s.u-tokyo.ac.jp/~koba/publications. html.
8. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer-Verlag, 1993.
9. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I, II. Information and Computation, 100: 1-77, September 1992.
10. O. Nierstrasz. Regular types for active objects. In Object-Oriented Software Compositi on, chapter 4, pages 99-121. Prentice Hall, 1995. A preliminary version appeared in Proceedings of OOPSLA'93, pp. 1-15.
11. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5): 409-454, 1996.
12. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. To appear in Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, 2000
13. F. Puntigam. Coordination requirements expressed in types for active objects. In Proceedings of ECOOP'97, LNCS 1241, pages 367-388, 1997.
14. J. H. Reppy. CML: A higher-order concurrent language. In Proceedings of PLDI'91, pages 293-305, 1991.
15. D. Sangiorgi. The name discipline of uniform receptiveness. Theoretical Computer Science, 221(1-2), pages 457-493, 1999.
16. E. Sumii and N. Kobayashi. A generalized deadlock-free process calculus. In Proc. of Workshop on High-Level Concurrent Language (HLCL'98), ENTCS 16(3), pages 55-77, 1998.
17. K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of PARLE'94, LNCS 817, pages 398-413, 1994.
18. N. Yoshida. Graph types for monadic mobile processes. In FST/TCS'16, LNCS 1180, pages 371-387, 1996.