scientific article; zbMATH DE number 7559468

DOI10.4230/LIPICS.CONCUR.2020.12MaRDI QIDQ5089276zbMATH OpenFDO

Authors Ross Horne

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2020.12

zbMATH Keywords

compatibilitydeadlock freedomlinear logicsession typessubtyping

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A system of interaction and structure
• A System of Interaction and Structure II: The Need for Deep Inference
• A type system for lock-free processes
• Behavioural analysis of sessions using the calculus of structures
• Computational interpretations of linear logic
• Constructing weak simulations from linear implications for processes with private names
• Deadlock and lock freedom in the linear -calculus
• From communicating machines to graphical choreographies
• Full abstraction in a subtyped pi-calculus with linear types
• Global Principal Typing in Partially Commutative Asynchronous Sessions
• Global types with internal delegation
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 954809 (Why is no real title available?)
• scientific article; zbMATH DE number 3995043 (Why is no real title available?)
• scientific article; zbMATH DE number 2090535 (Why is no real title available?)
• scientific article; zbMATH DE number 1398002 (Why is no real title available?)
• Infinitary proof theory: the multiplicative additive case
• Linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Multiparty Asynchronous Session Types
• Multiparty asynchronous session types
• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Multiparty session types as coherence proofs
• Multiparty session types meet communicating automata
• Multiparty Session Types Within a Canonical Binary Theory, and Beyond
• Multiparty session types, beyond duality
• Observational equivalence for multiparty sessions
• On projecting processes into session types
• On the preciseness of subtyping in session types
• Parameterised multiparty session types
• Precise subtyping for synchronous multiparty sessions
• Sequent calculi for induction and infinite descent
• Session types = intersection types + union types
• Sub-behaviour relations for session-based client/server systems
• Subtyping for session types in the pi calculus
• Synthesising Choreographies from Local Session Types
• Talking bananas: structural recursion for session types
• The consistency and complexity of multiplicative additive system virtual
• The sub-additives: a proof theory for probabilistic choice extending linear logic
• Uniform proofs as a foundation for logic programming
• Using higher-order contracts to model session types

Cited in

(4)

• Session coalgebras: a coalgebraic view on session types and communication protocols
• Subtyping Supports Safe Session Substitution
• An Analytic Propositional Proof System on Graphs
• Precise Subtyping for Asynchronous Multiparty Sessions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089276)