A pi-calculus Process Semantics of Concurrent Idealised ALGOL
暂无分享,去创建一个
[1] B. Pierce,et al. Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[2] Peter W. O'Hearn,et al. Algol-like Languages , 1997, Progress in Theoretical Computer Science.
[3] R. V. Book. Algol-like Languages , 1997, Progress in Theoretical Computer Science.
[4] Albert R. Meyer,et al. Towards fully abstract semantics for local variables , 1988, POPL '88.
[5] Peter W. O'Hearn,et al. Algol-Like Languages: v. 2 , 1996 .
[6] Davide Sangiorgi,et al. Bisimulation in name-passing calculi without matching , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[7] Davide Sangiorgi,et al. A Fully-Abstract Model for the (cid:25) -calculus , 2022 .
[8] Carolyn L. Talcott,et al. 1 Equivalence in Functional Languages with E ectsIan , 2007 .
[9] Robin Milner,et al. Functions as processes , 1990, Mathematical Structures in Computer Science.
[10] Davide Sangiorgi,et al. Lazy functions and mobile processes , 2000, Proof, Language, and Interaction.
[11] Kohei Honda,et al. Composing processes , 1996, POPL '96.
[12] Davide Sangiorgi,et al. On the Proof Method for Bisimulation (Extended Abstract) , 1995, MFCS.
[13] Robin Milner,et al. The Problem of "Weak Bisimulation up to" , 1992, CONCUR.
[14] Benjamin C. Pierce,et al. Linearity and the pi-calculus , 1999, TOPL.
[15] Carolyn L. Talcott,et al. References, local variables and operational reasoning , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[16] Douglas J. Howe. Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..
[17] Peter W. O'Hearn,et al. Parametricity and local variables , 1995, JACM.
[18] Naoki Kobayashi. A partially deadlock-free typed process calculus , 1998, TOPL.
[19] Albert R. Meyer,et al. Towards a fully abstract semantics for local variables: Preliminary report , 1988 .
[20] Matthew Hennessy,et al. A theory of weak bisimulation for core CML , 1996, ICFP '96.
[21] Samson Abramsky,et al. Full Abstraction for Idealized Algol with Passive Expressions , 1999, Theor. Comput. Sci..
[22] Davide Sangiorgi,et al. Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[23] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..
[24] Samson Abramsky,et al. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..
[25] Davide Sangiorgi,et al. Imperative objects and mobile processes , 1998, PROCOMET.
[26] David Walker,et al. Objects in the pi-Calculus , 1992, Inf. Comput..
[27] Naoki Kobayashi,et al. A partially deadlock-free typed process calculus , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[28] John C. Reynolds,et al. The essence of ALGOL , 1997 .
[29] Robin Milner,et al. The Polyadic π-Calculus: a Tutorial , 1993 .
[30] Andrew M. Pitts. Reasoning about local variables with operationally-based logical relations , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[31] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[32] Cliff B. Jones. A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.
[33] Stephen D. Brookes. The essence of parallel Algol , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[34] I. Stark,et al. A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.