Behavioral equivalence in the polymorphic pi-calculus

Journal of the ACM

Volumn 47, Issue 3, 2000, Pages 531-584

  Pierce, Benjamin C ^a,b,c   Sangiorgi, Davide ^a,b,c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b INRIA   (France)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Abstract data types; Pi calculus

Indexed keywords

CONCURRENT PROGRAMMING STRUCTURES; PARAMETRIC POLYMORPHISM; POLYMORPHIC PROCESSES;

COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; MATHEMATICAL MODELS; REYNOLDS NUMBER; SEMANTICS; TOPOLOGY;

MATHEMATICAL PROGRAMMING;

EID: 0000233772     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/337244.337261     Document Type: Article

References (46)

1. ABRAMSKY, S., GAY, S. J., AND NAGARAJAN, R. 1995. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School. NATO ASI Series F.
2. BARENDREGT, H. P. 1984. The Lambda Calculus, revised edition. North Holland, Amsterdam, The Netherlands.
3. BOREALE, M., DE NICOLA, R. 1995. Testing equivalence for mobile processes. Inf. Comput. 120, 2, 279-303.
4. BOREALE, M., DE NICOLA, R., AND PUGLIESE, R. 1999. Proof techniques for cryptographic processes. In Logic in Computer Science.
5. BOREALE, M., AND SANGIORGI, D. 1998. Bisimulation in name-passing calculi without matching. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
6. CHURCH, A. 1941. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J. DE NICOLA, R., AND HENNESSY, R. 1984. Testing equivalences for processes. Theoret. Comput. Sci. 34, 83-133.
7. GAY, S. J. 1993. A sort inference algorithm for the polyadic π-calculus. In Proceedings of the 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Charleston, S.C., Jan. 10-13). ACM, New York, pp. 429-438.
8. GIRARD, J.-Y. 1971. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. Ph.D. dissertation. Université Paris VII, Paris, France. A summary appeared in the Proceedings of the Second Scandinavian Logic Symposium (J.E. Fenstad, Ed.), North-Holland, Amsterdam, The Netherlands, pp. 63-92.
9. HENNESSY, M. 1988. Algebraic Theory of Processes. MIT Press, Cambridge, Mass.
10. HIRSCHKOFF, D. 1997. A full formalisation of π-calculus theory in the calculus of constructions. In Proceedings of the International Conference on Theorem Proving in Higher Order Logics, E. Gunter, Ed. Lecture Notes in Computer Science, vol. 1275. Springer-Verlag, New York.
11. HONDA, K. 1993. Types for dyadic interaction. In Proceedings of CONCUR'93. Lecture Notes in Computer Science, vol. 715. Springer-Verlag, New York, 509-523.
12. HONDA, K. 1996. Composing processes. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (St. Petersburg Beach, Fla., Jan. 21-24). ACM, New York, pp. 344-357.
13. HONDA, K., AND YOSHIDA, N. 1995. On reduction-based process semantics. Theoret. Comput. Sci. 152, 2, 437-486.
14. KOBAYASHI, N. 1998. A partially deadlock-free typed process calculus. Trans. Prog. Lang. Syst. 20, 2, 436-482.
15. KOBAYASHI, N., PIERCE, B. C., AND TURNER, D. N. 1996. Linearity and the pi-calculus. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (St. Petersburg Beach, Fla., Jan. 21-24). ACM, New York, pp. 358-371.
16. LARSEN, K. G. 1987. A context dependent equivalence between processes. Theoret. Comput. Sci. 49, 185-215.
17. LIU, X., AND WALKER, D. 1995. A polymorphic type system for the polyadic π-calculus. In Proceedings of CONCUR'95: Concurrency Theory. Springer-Verlag, New York, pp. 103-116.
18. MILLER, D. 1992. Unification under a mixed prefix. J. Symb. Comput. 14, 4 (Oct.), 321-358.
19. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, N.J.
20. MILNER, R. 1992. Functions as processes. J. Math. Struct. Comput. Sci. 2, 2, 119-141.
21. MILNER, R. 1993. The polyadic π-calculus: A tutorial. Logic and Algebra of Specification, F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds. Springer-Verlag, New York.
22. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes (Parts I and II). Inf. Comput. 100, 1-77.
23. MILNER, R., AND SANGIORGI, D. 1992. Barbed bisimulation. In Proceedings of the 19th Annual ICALP, W. Kuich, Ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, New York, pp. 685-695.
24. MITCHELL, J. C., AND PLOTKIN, G. D. 1988. Abstract types have existential types. ACM Trans. Prog. Lang. Syst. 10, 3, 470-502.
25. MONTANARI, U., AND SASSONE, V. 1992. Dynamic congruence vs. progressing bisimulation for CCS. Funda. Inf. XVI, 2, 171-199.
26. PARK, D. M. 1981. Concurrency on automata and infinite sequences. In Proceedings of the Conference on Theoretical Computer Science, P. Deussen, Ed. Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York.
27. PIERCE, B., AND SANGIORGI, D. 1996. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6, 5.
28. PIERCE, B. C., AND TURNER, D. N. 1999. Pict: A programming language based on the pi-calculus. Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, Eds. MIT Press, Cambridge, Mass.
29. PITTS, A. M. 1996. Reasoning about local variables with operationally-based logical relations. In Proceedings of the 11th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
30. PITTS, A. M. 1998a. Existential types: Logical relations and operational equivalence. In Proceedings of ICALP'98. Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, New York, pp. 309-326.
31. PITTS, A. M. 1998b. Parametric polymorphism and operational equivalence. In Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam, The Netherlands.
32. PITTS, A. M., AND STARK, I. D. B. 1996. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics. A. D. Gordon and A. M. Pitts, Eds.
33. RÖCKL, C., AND SANGIORGI, D. 1999. A pi-calculus semantics of Concurrent Idealised ALGOL. Proceedings of Fossacs 99. Springer-Verlag, New York.
34. REYNOLDS, J. 1974. Towards a theory of type structure. In Proceedings of the Colloque sur la Programmation, Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York, pp. 408-425.
35. REYNOLDS, J. C. 1983. Types, abstraction, and parametric polymorphism. In Information Processing 83, R. E. A. Mason, Ed. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, The Netherlands, pp. 513-523.
36. SANGIORGI, D. 1992. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D. dissertation. Department of Computer Science, University of Edinburgh, Edinburgh, Scotland.
37. SANGIORGI, D. 1996. π-calculus, internal mobility and agent-passing calculi. Theoret. Comput. Sci. 167, 2, 235-274.
38. SANGIORGI, D. 1998a. An interpretation of typed objects into typed π-calculus. Inf. Comput. 143, 1, 34-73.
39. SANGIORGI, D. 1998b. Interpreting functions as pi-calculus processes: A tutorial. Tech. Rep. RR-3470. INRIA-Sophia Antipolis.
40. SANGIORGI, D. 1999. On the proof method for bisimulation. J. Math. Struct. Comput. Sci., to appear.
41. STRACHEY, C. 1967. Fundamental concepts in programming languages. Lecture Notes, International Summer School in Computer Programming, Copenhagen, Denmark.
42. TURNER, D. N. 1995. The Polymorphic Pi-calculus: Theory and Implementation. Ph.D. dissertation. University of Edinburgh, Edinburgh, Scotland.
43. VASCONCELOS, V. T., AND HONDA, K. 1993. Principal typing schemes in a polyadic pi-calculus. In Proceedings of CONCUR'93.
44. VICTOR, B., AND MOLLER, F. 1994. The Mobility Workbench - A tool for the π-calculus. In Proceedings of the Symposium on Computer-Aided Verification, Dill, Ed. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, New York, pp. 428-440.
45. WALKER, D. J. 1988. Bisimulation and divergence in CCS. In Proceedings of the 3rd Symposium on Logic in Computer Science (LICS 88). IEEE Computer Society Press, Los Alamitos, Calif., pp. 186-192.
46. YOSHIDA, N. 1996. Graph types for monadic mobile processes. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 1180. Springer-Verlag, New York, pp. 371-386.