Full abstraction for expressiveness: history, myths and facts
From MaRDI portal
Publication:5741573
DOI10.1017/S0960129514000279zbMATH Open1361.68028OpenAlexW2331388232MaRDI QIDQ5741573FDOQ5741573
Authors: Daniele Gorla, Uwe Nestmann 
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
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- LCF considered as a programming language
- Title not available (Why is that?)
- Testing equivalences for processes
- On the Asynchronous Nature of the Asynchronous π-Calculus
- On the expressive power of programming languages
- On asynchrony in name-passing calculi
- Embedding as a tool for language comparison
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of process algebras
- On the expressiveness of interaction
- The next 700 programming languages
- On the expressiveness of internal mobility in name-passing calculi
- On distributability in process calculi
- On bisimulations for the asynchronous \(\pi\)-calculus
- On abstraction and the expressive power of programming languages
- Decoding choice encodings
- Comparing communication primitives via their relative expressive power
- On modelling mobility
- A taxonomy of process calculi for distribution and mobility
- 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
- Types and full abstraction for polyadic \(\pi\)-calculus
- Separation of synchronous and asynchronous communication via testing
- Matching systems for concurrent calculi
- Is it a ``good encoding of mixed choice?
Cited In (14)
- Title not available (Why is that?)
- Parameterizing higher-order processes on names and processes
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Comparing type systems for deadlock freedom
- On abstraction and the expressive power of programming languages
- On the interactive power of higher-order processes extended with parameterization
- Analysing and comparing encodability criteria
- Coupled similarity: the first 32 years
- Replacement freeness: a criterion for separating process calculi
- Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
- Fully Abstract and Robust Compilation
- Encodability and separation for a reflective higher-order calculus
- Higher-order processes with parameterization over names and processes
- The reflective higher-order calculus: encodability, typability and separation
This page was built for publication: Full abstraction for expressiveness: history, myths and facts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741573)
