Pages that link to "Item:Q1342247"
From MaRDI portal
The following pages link to On the \(\pi\)-calculus and linear logic (Q1342247):
Displaying 23 items.
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- The logic of message-passing (Q923880) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
- Reaction graph (Q1273068) (← links)
- Head linear reduction and pure proof net extraction (Q1342250) (← links)
- Choreographies, logically (Q1699421) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Prioritise the best variation (Q2117016) (← links)
- Multiparty session types as coherence proofs (Q2357654) (← links)
- Propositions as sessions (Q2875234) (← links)
- Observed Communication Semantics for Classical Processes (Q2988633) (← links)
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types (Q3184667) (← links)
- Conflation Confers Concurrency (Q3188279) (← links)
- Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) (Q3188293) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- (Q5875401) (← links)
- Focused linear logic and the \(\lambda\)-calculus (Q5971394) (← links)
- Separating Sessions Smoothly (Q6135771) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Protocol choice and iteration for the free cornering (Q6151626) (← links)
