Behavioral equivalence in the polymorphic pi-calculus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Behavioral equivalence in the polymorphic pi-calculus

Full text

Pdf (1.08 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 242 - 255

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Benjamin C. Pierce	Computer Science Department, Indiana University, Lindley Hall 215, Bloomington, IN
Davide Sangiorgi	INRIA-Sophia Antipolis, 2004 Rue des Lucioles, B.P.93, 06902 Sophia Antipolis, France

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 18, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263699.263729 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Gay93	Simon J. Gay, A sort inference algorithm for the polyadic &pgr;-calculus, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.429-438, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158701]
	Gir72	Jean-Yves Girard. Interprdtation }onctionelle et dlimination des coupures de l'arithmgtique d'ordre supgrieur. PhD thesis, Universit# Paris VII, 1972.
	Hon93	Kohei Honda, Types for Dynamic Interaction, Proceedings of the 4th International Conference on Concurrency Theory, p.509-523, August 23-26, 1993
	Hon96	Kohei Honda, Composing processes, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.344-357, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237802]
	Kob96	Naoki Kobayashi. A partially deadlock-free typed process calculus. Technical report, Department of Information Science, University of Tokyo, 1996. to appear.
	KPT96	Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237804]
	Lar87	K. G. Larsen, A context dependent equivalence between processes, Theoretical Computer Science, v.49 n.2-3, p.185-215, January 1987 [doi>10.1016/0304-3975(87)90007-7]
	LW95	Xinxin Liu , David Walker, A Polymorphic Type System for the Polyadic pi-calculus, Proceedings of the 6th International Conference on Concurrency Theory, p.103-116, August 21-24, 1995
	Mil91	Robin Milner. The polyadic r-calculus: a tutorial. Technical Report ECS-LFCS-91- 180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Proceedings of the International Summer School on Logic and Algebra o.f Specification, Marktoberdorf, August 1991. Reprinted in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer, and H. Sehwiehtenberg, Springer-Verlag, 1993.
	MP88	John C. Mitchell , Gordon D. Plotkin, Abstract types have existential type, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.470-502, July 1988 [doi>10.1145/44501.45065]
	MPW92	Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992 [doi>10.1016/0890-5401(92)90008-4]
	MS92	Robin Milner , Davide Sangiorgi, Barbed Bisimulation, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, p.685-695, July 13-17, 1992
	Pit96	A. M. Pitts, Reasoning about local variables with operationally-based logical relations, Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, p.152, July 27-30, 1996
	PS93	Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes, in Logic in Computer Science, 1993. Full version to appear in Mathematical Structures in Computer Science, 1996.
	PS96	A. M. Pitts , I. D. B. Stark, Operational reasoning for functions with local state, Higher order operational techniques in semantics, Cambridge University Press, New York, NY, 1999
	PT96	Benjamin C. Pierce and David N. Turner. Pitt: A programming language based on the pi-calculus. To appear, 1996.
	Rey74	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	Rey83	John C. Reynolds. Types, abstraction, and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523, Amsterdam, 1983. Elsevier Science Publishers B. V. (North-Holland).
	San92	Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher- Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, 1992.
	San96	Davide Sangiorgi. An interpretation of typed objects into typed r-calculus. To appear as Technical Report INRiA-Sophia Antipolis, 1996.
	Str67	C. Strachey. Fundamental concepts in programming languages. Lecture Notes, International Summer School in Computer Programming, Copenhagen, August 1967.
	Tur96	David N. Turner. The Polymo#hic Picalulus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996.
	VH93	Vasco Thudichum Vasconcelos , Kohei Honda, Principal Typing Schemes in a Polyadic pi-Calculus, Proceedings of the 4th International Conference on Concurrency Theory, p.524-538, August 23-26, 1993
	Yos96	Nobuko Yoshida. Graph types for monadic mobile processes. Manuscript, May 1996.

CITED BY 7

	Dan Grossman , Greg Morrisett , Steve Zdancewic, Syntactic type abstraction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.6, p.1037-1080, Nov. 2000
	Nobuko Yoshida , Matthew Hennessy, Assigning types to processes, Information and Computation, v.174 n.2, p.143-179, May 1 2002
	Silvano Dal Zilio, Mobile processes: a commented bibliography, Modeling and verification of parallel processes, Springer-Verlag New York, Inc., New York, NY, 2001
	Naoki Kobayashi, A partially deadlock-free typed process calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.2, p.436-482, March 1998
	Paola Quaglia , David Walker, Types and full abstraction for polyadic π-calculus, Information and Computation, v.200 n.2, p.215-246, 1 August 2005
	Simon Helsen, Bisimilarity for the Region Calculus, Higher-Order and Symbolic Computation, v.17 n.4, p.347-394, December 2004
	Silvano Dal Zilio , Andrew D. Gordon, Region analysis and a π-calculus with groups, Journal of Functional Programming, v.12 n.3, p.229-292, May 2002