Type reconstruction for linear Π-calculus with I/O subtyping

Information and Computation

Volumn 161, Issue 1, 2000, Pages 1-44

  Igarashi, Atsushi ^a   Kobayashi, Naoki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; INPUT OUTPUT PROGRAMS; OPTIMIZATION; PROGRAM COMPILERS;

CONCURRENT LANGUAGES;

CONCURRENT ENGINEERING;

EID: 0034714632     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2872     Document Type: Article

References (27)

1. Appel, A. W. (1992), "Compiling with Continuations," Cambridge University Press, Cambridge, UK.
2. Colby, C. (1995), Analyzing the communication topology of concurrent programs, in "ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation" pp. 202-213.
3. Fuh, Y. C., and Mishra, P. (1990), Type inference with subtypes, Theoret. Comput. Sci. 73, 155-175.
4. Gay, S. J. (1993), A sort inference algorithm for the polyadic π-calculus, in "ACM SIGACT/ SIGPLAN Symposium on Principles of Programming Languages," pp. 429-438.
5. Igarashi, A. (1997), "Type-based Analysis of Usage of Values for Concurrent Programming Languages," Master's thesis, University of Tokyo.
6. Igarashi, A., and Kobayashi, N. (1997), Type-based analysis of communication for concurrent programming languages, in "Fourth International Static Analysis Symposium (SAS'97)," Lecture Notes in Computer Science, Vol. 1302, pp. 187-201, Springer-Verlag, Berlin.
7. Kobayashi, N., Nakade, M., and Yonezawa, A. (1995), Static analysis of communication for asynchronous concurrent programming languages, in "Second International Static Analysis Symposium (SAS'95)," Lecture Notes in Computer Science, Vol. 983, pp. 225-242, Springer-Verlag, Berlin.
8. Kobayashi, N. (1998), A partially deadlock-free type process calculus, ACM Trans. Programming Languages Systems 20, 436-482.
9. [A preliminary summary appeared in Proceedings of LICS'97, pp. 128-139]
10. Kobayashi, N., Pierce, B. C., and Turner, D. N., (1996), Linearity and the pi-calculus, in "ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages," pp. 358-371.
11. Kobayashi, N., and Yonezawa, A. (1995), Higher-order concurrent linear logic programming, in "Theory and Practice of Parallel Programming," Lecture Notes in Computer Science, Vol. 907, pp. 137-166, Springer-Verlag, Berlin.
12. Mercouroff, N. (1991), An algorithm for analyzing communicating processes, in "Mathematical Foundations of Programming Semantics" (S. Brookes, M. Main M. Melton, M. Mislove, and D. Schmidt, Eds.), Lecture Notes in Computer Science, Vol. 598, pp. 312-325, Springer-Verlag, Berlin.
13. Milner, R. (1993), The polyadic π-calculus: a tutorial, in "Logic and Algebra of Specification" (F. L. Bauer, W. Brauwer, and H. Schwichtenberg, Eds.), Springer-Verlag, Berlin.
14. Nielson, H. R., and Nielson, F. (1994), Higher-order concurrent programs with finite communication topology, in "ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages," pp. 84-97.
15. Nielson, H. R., and Nielson, F. (1995), Static and dynamic processor allocation for higher-order concurrent languages, in "TAPSOFT'95: Theory and Practice of Software Development," Lecture Notes in Computer Science, pp. 590-604, Springer-Verlag, Berlin.
16. Pierce, B. C., and Sangiorgi, D. (1996), Typing and subtyping for mobile processes, in "IEEE Symposium on Logic in Computer Science," pp. 376-385.
17. [Full version in "Mathematical Structures in Computer Science," Vol.6, No. 5, 1996].
18. Pierce, B. C. and Sangiorgi, D. (1997), Behavioral equivalence in the polymorphic pi-calculus, in "ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, Paris, France, January 1997," pp. 242-255.
19. Pierce, B. C., and Turner, D. N. (1997), "Pict: A Programming Language Based on the Pi-calculus," Technical Report, Computer Science Department, Indiana University.
20. [To appear in Milner Festschrift, MIT Press, 1997]
21. Reppy, J. H. (1991), CML: A higher-order concurrent language, in "Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation," pp. 293-305.
22. Robinson, J. A. (1965), A machine-oriented logic based on the resolution principle, J. Assoc. Comput. Mach. 12.
23. Tarditi, D., Acharya, A., and Lee, P. (1990), "No Assembly Required: Compiling Standard ML to C," Technical Report, CMU-CS-90-187, School of Computer Science, Carnegie Mellon University.
24. Turner, D. N., Wadler, P., and Mossin, C. (1995), Once upon a type, in "Functional Programming Languages and Computer Architecture," pp. 1-11, San Diego, California.
25. Vasconcelos, V. T., and Honda, K. (1993), Principel typing schemes in a polyadic π-calculus, in "CONCUR'93," Lecture Notes in Computer Science, Vol. 715, pp. 524-538, Springer-Verlag, Berlin.
26. Yonezawa, A. (1990), "ABCL: An Object-Oriented Concurrent System," MIT Press, Cambridge, MA.
27. Yonezawa, A., and Tokoro, M. (1987), "Object-Oriented Concurrent Programming," MIT Press, Cambridge, MA.