Propositions as sessions
From MaRDI portal
Publication:2875234
DOI10.1017/S095679681400001XzbMath1307.68025MaRDI QIDQ2875234
Publication date: 14 August 2014
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (37)
Multiparty session types as coherence proofs ⋮ Certifying choreography compilation ⋮ Concurrent Process Histories and Resource Transducers ⋮ Mixed Sessions ⋮ Parametrized fixed points and their applications to session types ⋮ Behavioural Analysis of Sessions Using the Calculus of Structures ⋮ Multiparty session types, beyond duality ⋮ Conflation Confers Concurrency ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Certifying Data in Multiparty Session Types ⋮ Verifiable abstractions for contract-oriented systems ⋮ Fairness and communication-based semantics for session-typed languages ⋮ When programs have to watch paint dry ⋮ Event structure semantics for multiparty sessions ⋮ Separating Sessions Smoothly ⋮ A Theory of Formal Choreographic Languages ⋮ Protocol choice and iteration for the free cornering ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Extracting total Amb programs from proofs ⋮ Unnamed Item ⋮ Choreographies, logically ⋮ A simple library implementation of binary sessions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Focused linear logic and the \(\lambda\)-calculus ⋮ Observed Communication Semantics for Classical Processes ⋮ Context-Free Session Type Inference ⋮ A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ On the concurrent computational content of intermediate logics ⋮ Unnamed Item ⋮ On the Hardness of Proving CCA-Security of Signed ElGamal ⋮ Session types without sophistry. System description ⋮ Mixed sessions ⋮ Multiparty Session Types Within a Canonical Binary Theory, and Beyond ⋮ Polymorphic lambda calculus with context-free session types ⋮ Causal computational complexity of distributed processes ⋮ Prioritise the best variation
Cites Work
- Linear logic
- Computational interpretations of linear logic
- A calculus of mobile processes. I
- HLCL '98. 3rd international workshop on High-level concurrent languages. Nice, France, September 12, 1998
- Proofs as processes
- On the \(\pi\)-calculus and linear logic
- Asynchronous communication model based on linear logic
- Genericity and the \(\pi\)-calculus
- Subtyping for session types in the pi calculus
- Structural recursion with locally scoped names
- A new constructive logic: classic logic
- On asynchrony in name-passing calculi
- Linear type theory for asynchronous session types
- Behavioral equivalence in the polymorphic pi-calculus
- Unnamed Item
This page was built for publication: Propositions as sessions
