Linear logical relations for session-based concurrency
From MaRDI portal
Recommendations
Cited in
(18)- A new linear logic for deadlock-free session-typed processes
- Choreographies, logically
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Fairness and communication-based semantics for session-typed languages
- Corecursion and non-divergence in session-typed processes
- Proofs as executions
- Linearity, control effects, and behavioral types
- A higher-order logic for concurrent termination-preserving refinement
- scientific article; zbMATH DE number 1304382 (Why is no real title available?)
- Cut reduction in linear logic as asynchronous session-typed communication
- Linear logical relations and observational equivalences for session-based concurrency
- On asynchronous eventful session semantics
- Linear logic propositions as session types
- Domain-aware session types
- Safe session-based concurrency with shared linear state
- Fair termination of multiparty sessions
- Comparing session type systems derived from linear logic
- A gentle overview of asynchronous session-based concurrency: deadlock freedom by typing
This page was built for publication: Linear logical relations for session-based concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892750)