The following pages link to (Q2778815):
Displaying 22 items.
- An approach to innocent strategies as graphs (Q418201) (← links)
- Preface to the special volume (Q534064) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- A calculus of coroutines (Q817847) (← links)
- Responsiveness in process calculi (Q959822) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Linearity and bisimulation (Q997996) (← links)
- A generic type system for the pi-calculus (Q1884932) (← links)
- Eager functions as processes (Q2123050) (← links)
- A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- On the relative expressiveness of higher-order session processes (Q2272988) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- (Q2851048) (← links)
- A Graph Abstract Machine Describing Event Structure Composition (Q2867884) (← links)
- Probabilistic π-Calculus and Event Structures (Q2870289) (← links)
- A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus (Q2988382) (← links)
- Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness (Q5262979) (← links)
- Separation Logic Semantics for Communicating Processes (Q5415605) (← links)
