Objects as Mobile Processes
暂无分享,去创建一个
[1] Ian Stark. Names, Equations, Relations: Practical Ways to Reason about new , 1997, TLCA.
[2] Martín Abadi,et al. An Imperative Object Calculus , 1995, TAPSOFT.
[3] Olivier Danvy,et al. A Computational Formalization for Partial Evaluation (Extended Version) , 1996 .
[4] Josva Kleist,et al. Bisimulations for Asynchronous Mobile Processes , 1995 .
[5] Glynn Winskel,et al. Presheaf Models for Concurrency , 1996, CSL.
[6] Martín Abadi,et al. A Theory of Primitive Objects - Untyped and First-Order Systems , 1994, TACS.
[7] D. Walker,et al. A Calculus of Mobile Processes, Part I , 1989 .
[8] Luca Aceto,et al. On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based , 1998, Theor. Comput. Sci..
[9] S. Abramsky. The lazy lambda calculus , 1990 .
[10] Robin Milner,et al. Functions as processes , 1990, Mathematical Structures in Computer Science.
[11] Davide Sangiorgi. An Interpretation of Typed Objects into Typed pi-Calculus , 1998, Inf. Comput..
[12] Martín Abadi,et al. A Theory of Primitive Objects: Second-Order Systems , 1995, Sci. Comput. Program..
[13] Mario Tokoro,et al. An Object Calculus for Asynchronous Communication , 1991, ECOOP.
[14] Martín Abadi,et al. An imperative object calculus: Basic typing and soundness , 1995 .
[15] Martín Abadi,et al. A semantics of object types , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[16] Andrew D. Gordon,et al. Bisimilarity for a first-order calculus of objects with subtyping , 1996, POPL '96.
[17] Gerth Stølting Brodal,et al. Optimal purely functional priority queues , 1996, Journal of Functional Programming.
[18] P. S. Thiagarajan,et al. Regular Trace Event Structures , 1996 .
[19] Lars Arge,et al. The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation , 1995, ISAAC.