The π-calculus in direct style

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The π-calculus in direct style

Full text

Pdf (1.11 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: 228 - 242

Year of Publication: 1997

ISBN:0-89791-853-3

Author

Gérard Boudol

INRIA Sophia-Antipolis, BP 93, 06902 Sopia Antipolis Cedex, 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): 17, Citation Count: 9

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.263726 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.

	1	Samson Abramsky , C.-H. Luke Ong, Full abstraction in the lazy lambda calculus, Information and Computation, v.105 n.2, p.159-267, Aug. 1993 [doi>10.1006/inco.1993.1044]
	2	Roberto M. Amadio , Lone Leth , Bent Thomsen, From a Concurrent Lambda-Calculus to the Pi-Calculus, Proceedings of the 10th International Symposium on Fundamentals of Computation Theory, p.106-115, August 22-25, 1995
	3	Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
	4	Gérard Berry , Gérard Boudol, The chemical abstract machine, Theoretical Computer Science, v.96 n.1, p.217-248, 6 April 1992
	5	G. BOUDOL, Asynd#rony and the 7r-calculus, INRIA Res. Report 1702 ( 1992).
	6	G. BOUDOL, The A-calculus with multiplicities, INRIA Res. Report 2025 (1993).
	7	Gérard Boudol, Lambda-calculi for (strict) parallel functions, Information and Computation, v.108 n.1, p.51-127, Jan. 1994 [doi>10.1006/inco.1994.1003]
	8	G. BOUDOL, C. LANEVE, A-Calculus, multiplicities and the 7r-calculus, INRIA Res. Report 2581 (1995).
	9	Gérard Boudol , Cosimo Laneve, The discriminating power of multiplicities in the &lgr;-calculus, Information and Computation, v.126 n.1, p.83-102, April 10, 1996 [doi>10.1006/inco.1996.0037]
	10	Michele Boreale, On the Expressiveness of Internal Mobility in Name-Passing Calculi, Proceedings of the 7th International Conference on Concurrency Theory, p.163-178, August 26-29, 1996
	11	Cédric Fournet , Georges Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.372-385, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237805]
	12	Alessandro Giacalone , Prateek Mishra , Sanjiva Prasad, FACILE: A Symmetric Integration of Concurrent and Functional Programming, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.184-209, March 13-17, 1989
	13	Robert Harper , Mark Lillibridge, Polymorphic type assignment and CPS conversion, Lisp and Symbolic Computation, v.6 n.3-4, p.361-380, Nov. 1993 [doi>10.1007/BF01019463]
	14	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	15	Albert R. Meyer , Mitchell Wand, Continuation Semantics in Typed Lambda-Calculi (Summary), Proceedings of the Conference on Logic of Programs, p.219-224, June 17-19, 1985
	16	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]
	17	R. MILNER, Functions as processes, Math. Struct. in Comp. Science 2 (1992) 119-141. Preliminary version in INRIA Res. Report 1154.
	18	tL MILNER, The polyadic 7r-calculus: a tutorial, Technical Report ECS-LFCS-91-180, Edinburgh University (1991) Reprinted in Logic and Algebra of Specification, F. Bauer, W. Brauer and H. Schwichtenberg, Eds, Springer Verlag, 1993, 203-246.
	19	C. MURTHY, A computational analysis of Girard's translation aJld LC, LICS'92 (1992) 90-101.
	20	B. PmRCE, Programming in the #r-calculus - An experiment in concurrent language design, available electronically, Computer Lab. Cambridge (1995).
	21	G. PLOTKIN, Call-by-same, call-by-value and the A-calculus, Theoret. Comput. Sci. 1 (1975) 125-159.
	22	John H. Reppy, CML: A higher concurrent language, ACM SIGPLAN Notices, v.26 n.6, p.293-305, June 1991
	23	D. SANGIORG{, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, Department of Computer Science, The University of Edinburgh (1993).
	24	Davide Sangiorgi, From pi-Calculus to Higher-Order pi-Calculus - and Back, Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.151-166, April 13-17, 1993
	25	Davide Sangiorgi, The lazy Lambda calculus in a concurrency scenario, Information and Computation, v.111 n.1, p.120-153, May 15 1994 [doi>10.1006/inco.1994.1042]
	26	Gert Smolka, A Foundation for Higher-order Concurrent Constraint Programming, Proceedings of the First International Conference on Constraints in Computational Logics, p.50-72, September 07-09, 1994
	27	C. TALCOTT, Ed., Special Issue on Continuations, LISP and Symbolic Computation 6 & 7 (1993).
	28	D. TURNER, The Polymorphic Pi-calculus: Theory and h nplementation, Ph.D. Thesis, University of Edinburgh (1995).
	29	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

CITED BY 9

	Hayo Thielecke, Continuations, functions and jumps, ACM SIGACT News, v.30 n.2, June 1999
	Peter Sewell, From rewrite rules to bisimulation congruences, Theoretical Computer Science, v.274 n.1-2, p.183-230, March 6, 2002
	Carsten Führmann , Hayo Thielecke, On the call-by-value CPS transform and its semantics, Information and Computation, v.188 n.2, p.241-283, 29 January 2004
	Luís Lopes , Vasco T. Vasconcelos , Fernando Silva, Fine-Grained Multithreading with Process Calculi, IEEE Transactions on Computers, v.50 n.8, p.852-862, August 2001
	Nobuko Yoshida , Martin Berger , Kohei Honda, Strong normalisation in the π-calculus, Information and Computation, v.191 n.2, p.145-202, 15 June 2004
	Davide Sangiorgi, From λ to π; or, Rediscovering continuations, Mathematical Structures in Computer Science, v.9 n.4, p.367-401, August 1999
	Franz Achermann , Oscar Nierstrasz, A calculus for reasoning about software composition, Theoretical Computer Science, v.331 n.2-3, p.367-396, 25 February 2005
	J. Niehren , J. Schwinghammer , G. Smolka, A concurrent lambda calculus with futures, Theoretical Computer Science, v.364 n.3, p.338-356, 8 November 2006
	Nick Benton, Embedded interpreters, Journal of Functional Programming, v.15 n.4, p.503-542, July 2005