A generic type system for the Pi-calculus

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 3, 2001, Pages 128-139

  Igarashi, Atsushi ^a   Kobayashi, Naoki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644391431     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360215     Document Type: Article

References (38)

1. L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 365-377, 2000.
2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 238-252, 1977.
3. M. Fähndrich and A. Aiken. Program analysis using mixed term and set constraints. In Proceedings of SAS'97, LNCS 1302, pages 114-126. Springer-Verlag, 1997.
4. C. Flanagan and M. Abadi. Object types against races. In CONCUR'99, LNCS 1664, pages 288-303. Springer-Verlag, 1999.
5. C. Flanagan and M. Abadi. Types for safe locking. In Proceedings of ESOP 1999, LNCS 1576, pages 91-108, 1999.
6. C. Flanagan and S. N. Freund. Type-based race detection for Java. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 219-232, 2000.
7. S. J. Gay. A sort inference algorithm for the polyadic π-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 429-438, 1993.
8. M. Hennessy and J. Riely. Information flow vs. resource access in the information asynchronous pi-calculus. In Proceedings of ICALP 2000, LNCS 1853. Springer-Verlag, 2000.
9. K. Honda. Composing processes. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 344-357, 1996.
10. 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. Springer-Verlag, 2000.
11. A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Tech. rep., Department of Information Science, University of Tokyo, 2000. to appear.
12. A. Igarashi and N. Kobayashi. Type reconstruction for linear pi-calculus with I/O subtyping. Information and Computation, 161:1-44, 2000.
13. C. B. Jones. A pi-calculus semantics for an object-based design notation. In Proceedings of CONCUR '93, LNCS, pages 158-172. Springer-Verlag, 1993.
14. N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436-482, 1998.
15. N. Kobayashi. Quasi-linear types. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 29-42, 1999.
16. N. Kobayashi. Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness. In Proceedings of IFIP International Conference on Theoretical Computer Science (TCS2000), LNCS 1872, pages 365-389, 2000.
17. 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.
18. N. Kobayashi, E. Sumii, and S. Saito. An implicitly-typed deadlock-free process calculus. In Proceedings of CONCUR2000, LNCS 1877, pages 489-503. Springer-Verlag, 2000.
19. N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-oriented programming - types and language design. Theory and Practice of Object Systems, 1(4):243-268, 1995.
20. B. König. Generating type systems for process graphs. In Proceedings of CONCUR'99, LNCS 1664, pages 352-367. Springer-Verlag, 1999.
21. B. König. Analysing input/output-capabilities of mobile processes with a generic type system. In Proceedings of ICALP2000, LNCS 1853. Springer-Verlag, 2000.
22. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
23. R. Milner. The polyadic π-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.
24. R. Milner. Calculi for interaction. Acta Informatica, 33(8):707-737, 1996.
25. H. R. Nielson and F. Nielson. Higher-order concurrent programs with finite communication topology. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 84-97, 1994.
26. F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 276-290, 1999.
27. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996.
28. B. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. Journal of the Association for Computing Machinery (JACM), 47(5):531-584, 2000.
29. B. C. Pierce and D. N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming (TPPP), Sendai, Japan (Nov. 1994), LNCS 907, pages 187-215. Springer-Verlag, 1995.
30. F. Puntigam and C. Peter. Changeable interfaces and promised messages for concurrent components. In Proceedings of the 1999 ACM Symposium on Applied Computing, pages 141-145, 1999.
31. A. Ravara and V. Vasconcelos. Typing non-uniform concurrent objects. In Proceedings of CONCUR2000, LNCS 1877, pages 474-488, 2000.
32. C. Stirling. Modal and temporal logics for processes. In Logics for Concurrency, LNCS 1043, pages 149-237, 1996.
33. 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.
34. J.-P. Talpin and P. Jouvelot. Polymorphic type, region and effect inference. Journal of Functional Programming, 2(3):245-271, 1992.
35. J.-P. Talpin and P. Jouvelot. The type and effect discipline. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 162-173, 1992.
36. M. Tofte and J.-P. Talpin. Implementation of the call-by-value lambda-calculus using a stack of regions. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 188-201, 1994.
37. V. T. Vasconcelos and K. Honda. Principal typing schemes in a polyadic π-calculus. In CONCUR'93, LNCS 715, pages 524-538. Springer-Verlag, 1993.
38. N. Yoshida. Graph types for monadic mobile processes. In FST/TCS'16, LNCS 1180, pages 371-387. Springer-Verlag, 1996.