Extensionality and intensionality of the ambient logics

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 3, 2001, Pages 4-13

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644372766     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.375707     Document Type: Article

References (15)

1. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195:291-324, 1998.
2. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
3. L. Cardelli. Semistructured computations. Proc. 7th Intl. workshop on Data Base Programming Languages (DBPL'99), invited talk (accompanying paper available from the author's web page), 1999.
4. L. Cardelli and G. Ghelli. A query language for semistructured data based on the ambient logic. submitted, April 2000.
5. L. Cardelli and A.D. Gordon. Mobile ambients. In Nivat. M., editor, Proc. FoSSaCS '98, volume 1378 of Lecture Notes in Computer Science, pages 140-155. Springer Verlag, 1998.
6. L. Cardelli and A.D. Gordon. Technical annex to [5]. Unpublished notes, 1998.
7. L. Cardelli and A.D. Gordon. Types for mobile ambients. In Proc. 26th POPL, pages 79-92. ACM Press, 1999.
8. L. Cardelli and A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proc. 27th POPL. ACM Press, 2000.
9. R. De Nicola and R. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
10. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137-161, 1985.
11. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
12. F. Levi and D. Sangiorgi. Controlling interference in ambients. To appear as a Technical Report. Short version appeared in Proc. 27th POPL, ACM Press, 2000.
13. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991. Also in Logic and Algebra of Specification, ed. F.L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.
14. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991. Also in Logic and Algebra of Specification, ed. F.L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.
15. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. 19th ICALP, volume 623 of Lecture Notes in Computer Science, pages 685-695. Springer Verlag, 1992.