A fully abstract denotational semantics for the π-calculus

Theoretical Computer Science

Volumn 278, Issue 1-2, 2002, Pages 53-89

  Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SET THEORY;

DENOTATIONAL SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0037029874     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00331-5     Document Type: Conference Paper

References (25)

1. A domain equation for bisimulation
2. Full abstraction in the lazy lambda calculus
3. Testing for mobile processes
4. A lambda calculus for (strict) parallel functions
5. Testing equivalences for processes
6. Type algebras, functor categories and block structure
7. A theory of communicating processes with value-passing
8. Equality in lazy computation systems
9. A calculus of mobile processes, Part i
10. A calculus of mobile processes, Part ii
11. The polyadic π-calculus: A tutorial
12. Notions of computation and monad
13. Semantics of local variables
14. Algebraic theories for name-passing calculi
15. On the observable properties of higher order functions that dynamically create local names, or: What's new
16. A theory of bisimulation for the π-calculus
17. A fully-abstract domain model for the π-calculus