Full abstraction for expressiveness: history, myths and facts
From MaRDI portal
(Redirected from Publication:5741573)
Recommendations
Cites work
- A taxonomy of process calculi for distribution and mobility
- Comparing communication primitives via their relative expressive power
- Decoding choice encodings
- Embedding as a tool for language comparison
- Expressiveness of process algebras
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Is it a ``good encoding of mixed choice?
- LCF considered as a programming language
- Matching systems for concurrent calculi
- On abstraction and the expressive power of programming languages
- On asynchrony in name-passing calculi
- On bisimulations for the asynchronous -calculus
- On distributability in process calculi
- On modelling mobility
- On the Asynchronous Nature of the Asynchronous π-Calculus
- On the expressive power of programming languages
- On the expressiveness of interaction
- On the expressiveness of internal mobility in name-passing calculi
- Separation of synchronous and asynchronous communication via testing
- Testing equivalences for processes
- The next 700 programming languages
- Towards a unified approach to encodability and separation results for process calculi
- Types and full abstraction for polyadic -calculus
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
Cited in
(17)- On abstraction and the expressive power of programming languages
- Full abstraction and expressive completeness for FP
- On the interactive power of higher-order processes extended with parameterization
- Coupled similarity: the first 32 years
- Replacement freeness: a criterion for separating process calculi
- Comparing type systems for deadlock freedom
- Comparing process calculi using encodings
- Analysing and comparing encodability criteria
- Higher-order processes with parameterization over names and processes
- 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
- Encodability and separation for a reflective higher-order calculus
- Fully Abstract and Robust Compilation
- CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
- Probabilistic operational correspondence
- On the semantic expressiveness of iso- and equi-recursive types
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)
