Communication errors in the π-calculus are undecidable

Information Processing Letters

Volumn 71, Issue 5, 1999, Pages 229-233

  Vasconcelos, Vasco T ^a   Ravara, António ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b School of Health Technologies of Lisbon   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; ENCODING (SYMBOLS); ERROR CORRECTION;

LAMBDA CALCULUS; PI CALCULUS; PROGRAM CORRECTNESS; PROGRAMMING CALCULI;

PROGRAMMING THEORY;

EID: 0033321996     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00109-X     Document Type: Article

References (11)

1. S. Abramsky, The lazy lambda calculus, in: Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1989, pp. 65-116.
2. S. Arun-Kumar, M. Hennessy, An efficiency preorder of processes, Acta Inform. 29 (8) (1992) 737-760.
3. G. Boudol, Asynchrony and the π-calculus (Note), Rapport de Recherche RR-1702, INRIA, Sophia-Antipolis, 1992.
4. N. Cutland, Computability: An Introduction to Recursive Function Theory, Cambridge University Press, 1980.
5. J.R̃. Hindley, J.P. Seldin, Introduction to Combinators and λ-Calculus, Cambridge University Press, 1986.
6. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: 5th European Conference on Object-Oriented Programming, Lecture Notes in Computer Sci., Vol. 512, Springer, Berlin, 1991, pp. 141-162.
7. R. Milner, Functions as processes, Math. Structures Comput. Sci. 2 (2) (1992) 119-141.
8. R. Milner, The polyadic π-calculus: A tutorial, in: Logic and Algebra of Specification, Proceedings of International NATO Summer School (Marktoberdorf, Germany, 1991), 1993.
9. D. Sangiorgi, Lazy functions and mobile processes, Rapport de Recherche RR-2515, INRIA, Sophia-Antipolis, 1995; also in: "Festschrift Volume in Honor of Robin Milner's 60th Birthday", MIT Press, Cambridge, MA, to appear.
10. D. Sangiorgi, R. Milner, The problem of "weak bisimulation up to", in: 3rd International Conference on Concurrency Theory, Lecture Notes in Computer Sci., Vol. 630, Springer, Berlin, 1992, pp. 32-46.
11. V.T. Vasconcelos, K. Honda, Principal typing schemes in a polyadic π-calculus, in: 4th International Conference on Concurrency Theory, Lecture Notes in Computer Sci., Vol. 715, Springer, Berlin, 1993, pp. 524-538.