The chemical abstract machine

Theoretical Computer Science

Volumn 96, Issue 1, 1992, Pages 217-248

  Berry, Gérard ^a  

^a PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

CONCURRENT PROGRAMMING; LAMBDA-CALCULUS;

AUTOMATA THEORY;

EID: 0027113388     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90185-I     Document Type: Article

References (32)

1. Explicit substitutions
2. The lazy λ-calculus
3. Sémantique des processus communicants
4. A parallel machine for multiset transformation and its programming style
5. The Gamma model and its discipline of programming
6. Séquentialitéde l'evaluation formelle des λ-expressions
7. Notes on algebraic calculi of processes
8. Towards a lambda-calculus for concurrent and communicating systems
9. Linda in context
10. About fair asynchrony
11. Extensional equivalences for transition systems
12. CCS without τ's
13. Testing equivalences for processes
14. Higher-level synchronising devices in Meije-SCCS
15. A distributed operational semantics for CCS based on condition/events systems
16. A confluent calculus of substitutions
17. Observing processes
18. The semantics of a simple language for parallel processing
19. The mechanical evaluation of expressions
20. Rewriting as a unified model for concurrency
21. Functions as processes
22. A calculus of mobile processes
23. A calculus of higher-order communicating systems