Skip to main content
Conference Proceedings

Logical properties of name restriction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2044 LNCS 46-60
DOI: 10.1007/3-540-45413-6_8
48Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We extend the modal logic of ambients described in [7] 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. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Cardelli, L., & Gordon, A. D. (2001). Logical properties of name restriction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2044 LNCS, pp. 46–60). Springer Verlag. https://doi.org/10.1007/3-540-45413-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free