A Partially Deadlock-Free Typed Process Calculus

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 2, 1998, Pages 436-482

  Kobayashi, Naokl ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Concurrency; D.3.1 Programming Languages : Formal Definitions and Theory; D.3.3 Programming Languages : Language Constructs and Features General Terms: Languages; Deadlock freedom; Type theory

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER PROGRAMMING; COMPUTER SYSTEM RECOVERY; ENCODING (SYMBOLS); ALGORITHMS; PROBLEM SOLVING; THEOREM PROVING;

CONCURRENT PROGRAMMING LANGUAGES; PROCESS CALCULUS; CALCULUS; DEADLOCK-FREEDOM; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0032010343     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/276393.278524     Document Type: Article

References (32)

1. BERGER, M., GAY, S., AND NAGARAJAN, R. 1997. A typed calculus of deadlock-free processes. Draft paper, Imperial College, London.
2. COLBY, C. 1995. Analyzing the communication topology of concurrent programs. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, New York, 202-213.
3. GAY, S. J. 1993. A sort inference algorithm for the polyadic π-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 429-438.
4. HODAS, J. S. AND MILLER, D. 1994. Logic programming in a fragment of intuitionistic linear logic. Inf. Comput. 110, 2, 327-365.
5. HONDA, K. AND YOSHIDA, N. 1995. On reduction-based process semantics. Theor. Comput. Sci. 151, 2, 437-486.
6. IGARASHI, A. AND KOBAYASHI, N. 1997. Type-based analysis of usage of communication channels for concurrent programming languages. In Proceedings of International Static Analysis Symposium (SAS'97). Lecture Notes in Computer Science, vol. 1302. Springer-Verlag, Berlin, 187-201.
7. KOBAYASHI, N. 1996a. Concurrent linear logic programming. Ph.D. thesis, Dept. of Information Science, Univ. of Tokyo, Japan.
8. KOBAYASHI, N. 1996b. A partially deadlock-free typed process calculus (I) - a simple system. Tech. Rep. 96-02, Dept. of Information Science, Univ. of Tokyo, Japan.
9. KOBAYASHI, N. AND YONEZAWA, A. 1995. Towards foundations for concurrent object-oriented programming - types and language design. Theory Pract. Object Syst. 1, 4, 243-268.
10. KOBAYASHI, N., PIERCE, B. C., AND TURNER, D. N. 1996. Linearity and the pi-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 358-371.
11. MACKIE, I. 1994. Lilac: A functional programming language based on linear logic. J. Funct. Program. 4, 4 (Oct.), 1-39.
12. MILNER, R. 1990. Function as processes. In Automata, Language and Programming. Lecture Notes in Computer Science, vol. 443. Springer-Verlag, Berlin, 167-180.
13. MILNER, R. 1993. The polyadic π-calculus: A tutorial. In Logic and Algebra of Specification, F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds. Springer-Verlag, Berlin.
14. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes, I, II. Inf. Comput. 100, 1-77.
15. NESTMANN, U. 1997. What is a 'good' encoding of guarded choice? In Proceedings of EXPRESS'97. Electronic Notes in Theoretical Computer Science, vol. 7. Elsevier Science Publishers, Amsterdam.
16. NIELSON, H. R. AND NIELSON, F. 1994. Higher-order concurrent programs with finite communication topology. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 84-97.
17. OSTHEIMER, G. AND DAVIE, A. J. T. 1993. π-calculus characterizations of some practical λ-calculus reduction strategies. Tech. rep., St. Andrews Univ., Scotland.
18. OYAMA, Y., TAURA, K., AND YONEZAWA, A. 1997. An efficient compilation framework for languages based on a concurrent process calculus. In Proceedings of Euro-Par '97 Parallel Processing, Object-Oriented Programming. Lecture Notes in Computer Science, vol. 1300. Springer-Verlag, Berlin, 546-553.
19. PEYTON JONES, S. 1996. Concurrent Haskell. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 295-308.
20. PIERCE, B. AND SANGIORGI, D. 1993. Typing and subtyping for mobile processes. In Proceedings of IEEE Symposium on Logic in Computer Science. IEEE, New York, 376-385.
21. PIERCE, B. C. AND SANGIORGI, D. 1997. Behavioral equivalence in the polymorphic pi-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 242-255.
22. PIERCE, B. C. AND TURNER, D. N. 1995. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming (TPPP). Lecture Notes in Computer Science, vol. 907. Springer-Verlag, Berlin, 187-215.
23. PIERCE, B. C. AND TURNER, D. N. 1997. Pict: A programming language based on the pi-calculus. Tech. rep., Computer Science Dept., Indiana Univ. To appear in Milner Festschrift, MIT Press, 1997.
24. REPPY, J. H. 1991. CML: A higher-order concurrent language. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation. ACM Press, New York, 293-305.
25. SANGIORGI, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. thesis, Univ. of Edinburgh, Edinburgh, Scotland.
26. SANGIORGI, D. 1997. The name discipline of uniform receptiveness (extended abstract). In Proceedings of ICALP'97. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, Berlin, 303-313.
27. SHAPIRO, E. 1989. The family of concurrent logic programming languages. ACM Comput. Surv. 21, 3 (Sept.), 413-510.
28. TURNER, D. T. 1996. The polymorphic pi-calculus: Theory and implementation. Ph.D. thesis, Univ. of Edinburgh, Edinburgh, Scotland.
29. VASCONCELOS, V. T. AND HONDA, K. 1993. Principal typing schemes in a polyadic π-calculus. In Proceedings of CONCUR'93. Lecture Notes in Computer Science, vol. 715. Springer-Verlag, Berlin, 524-538.
30. WALKER, D. 1995. Objects in the π-calculus. Inf. Comput. 116, 253-271.
31. YONEZAWA, A. AND TOKORO, M. 1987. Object-Oriented Concurrent Programming. The MIT Press, Cambridge, Mass.
32. YOSHIDA, N. 1996. Graph types for monadic mobile processes. In Proceedings of FST/TCS'16. Lecture Notes in Computer Science, vol. 1180. Springer-Verlag, Berlin, 371-387. Full version as LFCS report, ECS-LFCS-96-350, Univ. of Edinburgh.