The π-Calculus in Direct Style

Higher-Order and Symbolic Computation

Volumn 11, Issue 2, 1998, Pages 177-208

  Boudol, Gérard ^a  

^a INRIA   (France)

Author keywords

Continuation passing style; Types; calculus; calculus

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; SORTING;

CONTINUATION PASSING STYLE (CPS) TRANSFORMS; MILNER'S SORTING;

DIFFERENTIATION (CALCULUS);

EID: 0032294702     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010064516533     Document Type: Article

References (44)

1. S. ABRAMSKY, C.-H. L. ONG, Full abstraction in the lazy lambda-calculus, Information and Computation 105 (1993) 159-267.
2. R. AMADIO, L. LETH, B. THOMSEN, From a concurrent λ-calculus to the π-calculus, FCT'95, Lecture Notes in Comput. Sci. 965 (1995) 106-115.
3. R. AMADIO, I. CASTELLANI, D. SANGIORGI, On bisimulations for the asynchronous π-calculus, CONCUR'96, Lecture Notes in Comput. Sci. 1119 (1996) 147-162.
4. R. AMADIO, An asynchronous model of locality, failure, and process mobility, COORDINATION'97, Lecture Notes in Comput. Sci. 1282 (1997).
5. A. APPEL, Compiling with Continuations, Cambridge University Press (1992).
6. G. BERRY, G. BOUDOL, The chemical abstract machine, Theoretical Comput. Sci. 96 (1992) 217-248.
7. M. BOREALE, On the expressiveness of internal mobility in name-passing calculi, CONCUR'96, Lecture Notes in Comput. Sci. 1119 (1996) 163-178.
8. G. BOUDOL, Towards a lambda-calculus for concurrent and communicating systems, TAPSOFT 89, Lecture Notes in Comput. Sci. 351 (1989) 149-161.
9. G. BOUDOL, Asynchrony and the π-calculus, INRIA Res. Report 1702 (1992).
10. G. BOUDOL, The λ-calculus with multiplicities, INRIA Res. Report 2025 (1993).
11. G. BOUDOL, Lambda-calculi for (strict) parallel functions, Information and Computation 108 (1994) 51-127.
12. G. BOUDOL, Typing the use of resources in a concurrent calculus, ASIAN'97, Lecture Notes in Comput. Sci. 1345 (1997) 239-253.
13. G. BOUDOL, C. LANEVE, λ-Calculus, multiplicities and the π-calculus, INRIA Res. Report 2581 (1995) to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M. Tofte Eds), MIT Press.
14. G. BOUDOL, C. LANEVE, The discriminating power of multiplicities in the λ-calculus, Information and Computation 126 (1996) 83-102.
15. W. FERREIRA, M. HENNESSY, A. JEFFREY, Combining typed λ-calculus with CCS, to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M. Tofte Eds), MIT Press (1998).
16. C. FOURNET, G. GONTHIER, The reflexive cham, and the join calculus, POPL'96 (1996) 372-385.
17. C. FOURNET, L. MARANGET, The Join-Calculus language, release 1.01, available electronically, INRIA (June 1997).
18. A. GIACALONE, P. MISHRA, S. PRASAD, Facile: a symmetric integration of concurrent and functional programming, TAPSOFT'89, Lecture Notes in Comput. Sci. 352 (1989) 184-209.
19. R. HARPER, M. LILLIBRIDGE, Polymorphic type assignment and cps conversion, LISP and Symbolic Computation 6 (1993) 361-380.
20. J. HATCLIFF, O. DANVY, Thunks and the λ-calculus, J. of Functional Programming Vol 7 No 3 (1997) 303-320.
21. K. HONDA, M. TOKORO, A small calculus for concurrent objects, OOPS Messenger Vol 2 No 2, ACM Press (1991) 50-54.
22. P. J. LANDIN, The Next 700 Programming Languages, CACM Vol. 9 No. 3 (1966) 157-164.
23. J. LAUNCHBURY, A natural semantics for lazy evaluation, POPL'93 (1993) 144-154.
24. M. MERRO, D. SANGIORGI, On asynchrony in name-passing calculi, ICALP'98, Lecture Notes in Comput. Sci. 1443 (1998).
25. A. R. MEYER, M. WAND, Continuation semantics in typed lambda-calculi, Lecture Notes in Comput. Sci. 193 (1985) 219-224.
26. R. MILNER, J. PARROW, D. WALKER, A calculus of mobile processes, Information and Computation 100 (1992) 1-77.
27. R. MILNER, Functions as processes, Math. Struct. in Comp. Science 2 (1992) 119-141. Preliminary version in INRIA Res. Report 1154.
28. R. MILNER, The polyadic π-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.
29. R. MILNER, The polyadic π-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.
30. C. MURTHY, A computational analysis of Girard's translation and LC, LICS'92 (1992) 90-101.
31. M. ODERSKY, Applying π: towards a basis for concurrent imperative programming, Proc. 2nd ACM SIGPLAN Workshop on State in Programming Languages (1995).
32. G. OSTHEIMER, A. DAVIE, π-calculus characterizations of some practical λ-calculus reduction strategies, Techn. Report CS/93/14, University of St Andrews (1993).
33. B. PIERCE, Programming in the π-calculus - An experiment in concurrent language design, Version 3.6k, available electronically, Computer Lab. Cambridge (1995).
34. B. PIERCE, Programming in the π-calculus - A Tutorial Introduction to Pict, Version 4.0, available electronically, Computer Science Department, Indiana University, (March 1997).
35. G. PLOTKIN, Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci. 1 (1975) 125-159.
36. J. H. REPPY, CML: a higher-order concurrent language, ACM SIGPLAN'91 PLDI Conference, SIGPLAN Notices 26 (1991) 293-305.
37. D. SANGIORGI, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, Department of Computer Science, The University of Edinburgh (1993).
38. D. SANGIORGI, From π-calculus to higher-order π-calculus - and back, TAPSOFT'93, Lecture Notes in Comput. Sci. 668 (1993) 151-166.
39. D. SANGIORGI, Lazy functions and mobile processes, INRIA Res. Rep. 2515 (1995) to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M Tofte Eds), MIT Press.
40. G. SMOLKA, A foundation for higher-order concurrent constraint programming, in Constraints in Computational Logics, Lecture Notes in Comput. Sci. 845 (1994) 50-72.
41. C. TALCOTT, ED., Special Issue on Continuations, LISP and Symbolic Computation 6 & 7 (1993).
42. D. TURNER, The Polymorphic Pi-calculus: Theory and Implementation, PhD. Thesis, University of Edinburgh (1995).
43. V. VASCONCELOS, K. HONDA, Principal typing schemes in a polyadic π-calculus, CONCUR'93, Lecture Notes in Comput. Sci. 715 (1993) 524-538.
44. N. YOSHIDA, Graph types for monadic mobile processes, FST-TCS'96, Lecture Notes in Comput. Sci. 1180 (1996) 371-386.