Full abstraction for expressiveness: history, myths and facts
From MaRDI portal
Publication:5741573
DOI10.1017/S0960129514000279zbMath1361.68028OpenAlexW2331388232MaRDI QIDQ5741573
Publication date: 28 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129514000279
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (12)
Comparing type systems for deadlock freedom ⋮ Coupled similarity: the first 32 years ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Parameterizing higher-order processes on names and processes ⋮ The reflective higher-order calculus: encodability, typability and separation ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the interactive power of higher-order processes extended with parameterization
Cites Work
- Unnamed Item
- Unnamed Item
- A taxonomy of process calculi for distribution and mobility
- On the expressiveness of interaction
- Comparing communication primitives via their relative expressive power
- On the expressive power of programming languages
- LCF considered as a programming language
- On the expressiveness of internal mobility in name-passing calculi
- On bisimulations for the asynchronous \(\pi\)-calculus
- Embedding as a tool for language comparison
- On abstraction and the expressive power of programming languages
- Testing equivalences for processes
- On modelling mobility
- Decoding choice encodings
- Towards a unified approach to encodability and separation results for process calculi
- Types and full abstraction for polyadic \(\pi\)-calculus
- Separation of synchronous and asynchronous communication via testing
- Matching Systems for Concurrent Calculi
- Expressiveness of Process Algebras
- Is It a “Good” Encoding of Mixed Choice?
- On the Asynchronous Nature of the Asynchronous π-Calculus
- On asynchrony in name-passing calculi
- On Distributability in Process Calculi
- The next 700 programming languages
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
This page was built for publication: Full abstraction for expressiveness: history, myths and facts
