Pages that link to "Item:Q1276243"
From MaRDI portal
The following pages link to On the expressiveness of internal mobility in name-passing calculi (Q1276243):
Displaying 36 items.
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Responsiveness in process calculi (Q959822) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- On transformations of concurrent-object programs (Q1276245) (← links)
- Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
- On modelling mobility (Q1575151) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Denotational semantics of channel mobility in UTP-CSP (Q1982650) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
- Linear forwarders (Q2384926) (← links)
- Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
- On the expressive power of \textsc{Klaim}-based calculi (Q2491638) (← links)
- Communication and mobility control in boxed ambients (Q2573334) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- Matching systems for concurrent calculi (Q2864374) (← links)
- A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus (Q2988382) (← links)
- Linearity, Control Effects, and Behavioral Types (Q2988641) (← links)
- (Q5018488) (← links)
- (Q5141618) (← links)
- Linear logic propositions as session types (Q5741566) (← links)
- Full abstraction for expressiveness: history, myths and facts (Q5741573) (← links)
- Event structures for the reversible early internal \(\pi\)-calculus (Q5925541) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)
- Bisimulations in the join-calculus (Q5958770) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q6104372) (← links)
- Separating Sessions Smoothly (Q6135771) (← links)
- Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks (Q6635516) (← links)
- Comparing session type systems derived from linear logic (Q6643467) (← links)
- Deadlock freedom for asynchronous and cyclic process networks (Q6649541) (← links)
- A subexponential view of domains in session types (Q6661154) (← links)