Logical Properites of Name Restriction
We extend the modal logic of ambients decribed in  to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions about restricted names, and we study their properties.
Unable to display preview. Download preview PDF.
- Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon, Ambient Groups and Mobility Types. Proceedings of IFIP TCS2000. J. van Leeuwen, O. Watanabek, M. Hagiya, P.D. Mosses, T. Ito (Eds.). THeoretical COmputer Science; Exploring New Frontiers in Theoretical Informatics. LNCS 1872, Springer, 2000. pp. 333–347.Google Scholar
- Luca Cardelli and Andrew D. Gordon, Anytime, Anywhere, Modal Logics for Mobile Ambients. Proceedings of the 27th ACM Symposium on Principles of Programming Languages, 2000, pp. 365–377.Google Scholar
- Silvano Dal Zilio, Spatial Congruence for Ambients is Decidable. Technical Report MSR-TR-2000-41, Microsoft Research, May 2000.Google Scholar
- Furio Honsell, Marino Miculan and Ivan Scangnetto, π-Calculus in (Co) Inductive Type Theory. TCS 2000Google Scholar
- Murdoch J. Gabbay and Andrew M. Pitts, A New Approach to Abstract Syntax Involving Binders. In Proceedings 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Computer Society Pres, 1999. pp 214–224.Google Scholar
- Robin Milner, Communicating and Mobile Sysetms: the π-Calculus. Cambridge University Press, 1999.Google Scholar
- Davide Sangiorgi, Extensionality and Intensionality in the Ambient Logistics, Proceedings of the 28th ACM Symposium on Principles of Programming Languages, 2001. pp. 4–13.Google Scholar