From pi-Calculus to Higher-Order pi-Calculus - and Back
暂无分享,去创建一个
[1] Gérard Boudol. Towards a Lambda-Calculus for Concurrent and Communicating Systems , 1989, TAPSOFT, Vol.1.
[2] David Walker,et al. Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.
[3] Gérard Berry,et al. The chemical abstract machine , 1989, POPL '90.
[4] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[5] Robin Milner,et al. Functions as processes , 1990, Mathematical Structures in Computer Science.
[6] Robin Milner,et al. Barbed Bisimulation , 1992, ICALP.
[7] S. Abramsky. The lazy lambda calculus , 1990 .
[8] Philippe Darondeau,et al. Causal Trees , 1989, ICALP.
[9] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[10] Bent Thomsen,et al. Calculi for higher order communicating systems , 1990 .
[11] Davide Sangiorgi,et al. Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .
[12] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[13] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.
[14] Gianna Reggio,et al. Generalized Bisimulation in Relational Specifications , 1988, STACS.
[15] Tommaso Bolognesi,et al. Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.
[16] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[17] Iain Phillips,et al. Refusal Testing , 1986, Theoretical Computer Science.
[18] Pierre America,et al. Denotational Semantics of a Parallel Object-Oriented Language , 1989, Inf. Comput..