FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS
From MaRDI portal
Publication:2856009
DOI10.1142/S0129054113500081zbMath1286.68298MaRDI QIDQ2856009
Publication date: 23 October 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113500081
68Q45: Formal languages and automata
03B70: Logic in computer science
03B40: Combinatory logic and lambda calculus
Cites Work
- On the expressiveness of interaction
- A calculus of mobile processes. I
- On bisimulations for the asynchronous \(\pi\)-calculus
- The lazy lambda calculus in a concurrency scenario
- Testing equivalences for processes
- On the computational strength of pure ambient calculi
- What is a ``good encoding of guarded choice?
- Variations on mobile processes
- Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
- Functions as processes
- On asynchrony in name-passing calculi
- What are the Fundamental Structures of Concurrency?