Session Types with Arithmetic Refinements

DOI10.4230/LIPIcs.CONCUR.2020.13OpenAlexW3081625510MaRDI QIDQ5089277

Ankush Das, Frank Pfenning

Publication date: 18 July 2022

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

zbMATH Keywords

session typesrefinement typestype equality

Mathematics Subject Classification ID

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

Related Items (3)

Relating Functional and Imperative Session Types ⋮ Nested session types ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of session types
• Indexed types
• Depending on session-typed processes
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Undecidability of asynchronous session subtyping
• Subtyping for session types in the pi calculus
• Polarized Substructural Session Types
• Talking bananas: structural recursion for session types
• Context-free session types
• On the Undecidability of Asynchronous Session Subtyping
• Proof-Carrying Code in a Session-Typed Process Calculus
• Multiparty asynchronous session types
• A Theory of Design-by-Contract for Distributed Multiparty Interactions
• Session Types as Intuitionistic Linear Propositions
• Work Analysis with Resource-Aware Session Types
• Deciding the Bisimilarity of Context-Free Session Types
• Propositions as sessions
• Linear type theory for asynchronous session types
• Behavioral Polymorphism and Parametricity in Session-Based Communication
• Types for Proofs and Programs
• Linear logic propositions as session types
• A Sound Algorithm for Asynchronous Session Subtyping
• Session-typed concurrent contracts

This page was built for publication: Session Types with Arithmetic Refinements