From π-calculus to higher-order π-calculus — and back

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 668 LNCS, Issue , 1993, Pages 151-166

  Sangiorgi, Davide ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); SOFTWARE DESIGN;

ABSTRACT LEVELS; FIRST ORDER; HIGHER-ORDER; HIGHER-ORDER CALCULUS; HIGHER-ORDER PROCESS; LAMBDA CALCULUS; ORDER EXTENSIONS; PI CALCULUS;

CALCULATIONS;

EID: 84957833270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56610-4_62     Document Type: Conference Paper

References (20)

1. Abramsky, S., The Lazy Lambda Calculus, Research Topics in Functional Programming, pp65-116, Addison Wesley, 1989.
2. America, P. and de Bakker, J. and Kok, J. and Rutten, J., Denotational Semantics of a Parallel Object-Oriented Language, Information and Computation, 83(2), 1989.
3. America, P., Issues in the Design of a Parallel Object-Oriented Language, Formal Aspects of Computing, 1(4), pp366-411, 1989.
4. Astesiano, E. and Giovini, A., Generalized Bisimulation in Relational Specifications, STACS 88, LNCS 294, pp207-226, 1988.
5. Amadio, R., A Uniform Presentation of CHOCS and π-calculus, Rapport de Recherche 1726, INRIA-Lorraine, Nancy, 1992.
6. Berry, G. and Boudol, G., The Chemical Abstract Machine, 17th POPL, 1990.
7. Bolognesi, T. and Brinksma, E., Introduction to the ISO Specification Language LOTOS, in The Formal Description Technique LOTOS, North Holland, 1989.
8. Boudol, G., Towards a Lambda Calculus for Concurrent and Communicating Systems, TAPSOFT 89, LNCS 351, pp149-161, 1989.
9. Degano, P. and Darondeau, P., Causal Trees, 15th ICALP, LNCS 372, pp234-248, 1989.
10. De Nicola, R. and Hennessy, R., Testing Equivalences for Processes, Theor. Comp. Sci. 34, pp83-133, 1984.
11. Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.
12. Milner, R., Communication and Concurrency, Prentice Hall, 1989.
13. Milner, R., The polyadic π-calculus: a tutorial, Technical Report ECSLFCS-91-180, LFCS, Dept. of Comp. Sci. Edinburgh Univ., 1991.
14. Milner, R., Functions as Processes, Technical Report 1154, INRIA Sofia-Antipolis, 1990. Final version in Journal of Mathem. Structures in Computer Science 2(2), pp119-141, 1992.
15. Milner, R. and Farrow, J. and Walker, D., A Calculus of Mobile Processes, (Parts I and II), Information and Computation, 100, pp1-77, 1992.
16. Milner, R. and Sangiorgi, D., Barbed Bisimulation, 19th ICALP, LNCS 623, pp685-695, 1992.
17. Phillips, I.C.C., Refusal Testings, Theor. Comp. Sci., 50, pp241-284, 1987.
18. Sangiorgi, D. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD thesis, Edinburgh Univ., 1992, to appear.
19. Thomsen, B., Calculi for Higher Order Communicating Systems, PhD thesis, Dept. of Computing, Imperial College, 1990.
20. Walker, D., π-calculus Semantics of Object-Oriented Programming Languages, Technical Report ECS-LFCS-90-122 LFCS, Dept. of Comp. Sci. Edinburgh Univ., 1990. Also in Proc. Conference on Theoretical Aspects of Computer Software, Tohoku University, Japan, Sept. 1991.