Separating Sessions Smoothly

DOI10.46298/lmcs-19(3:3)2023zbMath1527.68033arXiv2105.08996MaRDI QIDQ6135771

Ornela Dardha, Sam Lindley, Wen Kokke, Unnamed Author, J. Garrett Morris

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.08996

zbMATH Keywords

session typeshypersequentslinear lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40) Computer science (68-XX)

Related Items (4)

Comparing type systems for deadlock freedom ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Separating Sessions Smoothly ⋮ Prioritise the best variation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type systems for distributed programs: components and sessions
• Linear logic
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Fundamentals of session types
• Type checking a multithreaded functional language with session types
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• On the expressiveness of internal mobility in name-passing calculi
• Proofs as processes
• On the \(\pi\)-calculus and linear logic
• Hypersequents, logical consequence and intermediate logics for concurrency
• Modelling environments in call-by-value programming languages.
• A new linear logic for deadlock-free session-typed processes
• Choreographies, logically
• Prioritise the best variation
• Session types revisited
• Comparing type systems for deadlock freedom
• Exceptional syntax
• A Semantics for Propositions as Sessions
• Effects as sessions, sessions as effects
• Propositions as sessions
• Talking bananas: structural recursion for session types
• Conflation Confers Concurrency
• Session Types as Intuitionistic Linear Propositions
• Deadlock and lock freedom in the linear π-calculus
• Procedural Choreographic Programming
• Linear type theory for asynchronous session types
• CONCUR 2004 - Concurrency Theory
• Higher-Order Processes, Functions, and Sessions: A Monadic Integration
• On one-pass CPS transformations
• A New Type System for Deadlock-Free Processes
• Formal Methods at the Crossroads. From Panacea to Foundational Support
• Separating Sessions Smoothly

This page was built for publication: Separating Sessions Smoothly