Extensionality and intensionality of the ambient logics

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 4-13

  Sangiorgi, D ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; EQUIVALENCE CLASSES; QUERY LANGUAGES;

AMBIENT LOGIC; LOGIC EXTENSIONALITY; LOGIC INTENSIONALITY; MOBILE AMBIENTS;

FORMAL LOGIC;

EID: 0035035151     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/360204.375707     Document Type: Conference Paper

References (14)

1. On bisimulations for the asynchronous π-calculus
2. The chemical abstract machine
3. Semistructured computations
4. A query language for semistructured data based on the ambient logic
5. Mobile ambients
6. Types for mobile ambients
7. Anytime, anywhere: Modal logics for mobile ambients
8. Testing equivalences for processes
9. Algebraic laws for nondeterminism and concurrency
10. Proving congruence of bisimulation in functional programming languages
11. Controlling interference in ambients
12. The polyadic π-calculus: A tutorial
13. Barbed bisimulation