On the Representation of McCarthy's amb in the π-calculus

Electronic Notes in Theoretical Computer Science

Volumn 96, Issue , 2004, Pages 73-89

  Carayol, Arnaud ^a   Hirschkoff, Daniel ^b   Sangiorgi, Davide ^c  

^a UNIV LYON   (France)

^b UNIVERSITÉ DE LYON   (France)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Behavioural equivalence; Fairness; Lambda Calculus; McCarhty's amb; Pi Calculus

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; FUNCTIONS; SEMANTICS;

BEHAVIORAL EQUIVALENCE; FAIRNESS; LAMBDA-CALCULUS; MCCARTHY'S AMB; PI-CALCULUS;

COMPUTER SCIENCE;

EID: 12444252374     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.04.022     Document Type: Conference Paper

References (20)

1. Boudol G. Lambda-calculi for (strict) parallel functions. Information and Computation. volume 108:1994;51-127
2. Boudol G, Laneve C. Lambda-calculus, multiplicities and the pi-calculus. Proof, Language, and Interaction, Essays in Honour of Robin Milner. 2000;MIT Press
3. Carayol A, Hirschkoff D, Sangiorgi D. A π -calculus view on McCarthy's amb. full version, in preparation - available at http://www.irisa.fr/galion/ acarayol/RR.ps:2003
4. Dezani-Ciancaglini M, de'Liguoro U, Piperno A. A filter model for concurrent λ -calculus. SIAM J. Comput. 27:(5):1998;1376-1419
5. Fernandez Maribel, Khalil Lionel. Interaction nets with mccarthy's amb. Electronic Notes in Theoretical Computer Science. volume 68:2002;Elsevier. URL http://www.elsevier.nl/locate/entcs/volume68.html
6. Henderson P. Purely functional operating systems. Functional Programming and its Applications. 1982;177-192 Cambridge Univ. Press
7. Howe D.J. Proving congruence of bisimulation in functional program-ming languages. Information and Computation. 124:(2):1996;103-112
8. Hughes J, O'Donnell J. Expressing and reasoning about non-deterministic functional programs. Proc. Glasgow 1989 Workshop on Functional Programming. Workshops in Computing. 1990;Springer Verlag
9. S. Lassen. Relational reasoning about functions and nondeterminism. PhD thesis, Aarhus University, 1998
10. Lassen S, Moran A. Unique fixed point induction for McCarthy's Amb. Proc. of MFCS'99. LNCS. volume 1672:1999;198-208 Springer Verlag
11. McCarthy J. A basis for a mathematical theory of computation. Computer Programming and Formal Systems. 1963;33-70 North-Holland
12. R. Milner. Functions as processes. Technical Report 1154, INRIA Sophia Antipolis, 1990
13. A. Moran. Call-by-name, Call-by-need, and McCarthy's Amb. PhD thesis, Chalmers Univ. of Technology and Univ. of Gothenburg, 1998
14. Natarajan V, Cleaveland R. Divergence and fair testing. Proc. ICALP 95. LNCS. volume 944:1995;648-659 Springer Verlag
15. Nestmann U, Pierce B. Decoding choice encodings. International Conference on Concurrency Theory. 1996;179-194
16. Panangaden P, Shanbhogue V. McCarthy's amb cannot implement fair merge. Proc. of FST-TCS. LNCS. volume 338:1988;348-363 Springer Verlag
17. C. Pitcher. Functional programming and erratic non-determinism. PhD thesis, Oxford University, 2001
18. Sangiorgi D. The lazy lambda calculus in a concurrency scenario. Proc. 7th LICS Conf. 1992;102-109 IEEE Computer Society Press
19. Sangiorgi D, Walker D. The π -calculus: a Theory of Mobile Processes. 2001;Cambridge University Press
20. Turner D. An approach to functional operating systems. Research Topics in Functional Programming. 1990;Addison Wesley