Corecursion and Non-divergence in Session-Typed Processes

DOI10.1007/978-3-662-45917-1_11zbMath1444.68124OpenAlexW183006709MaRDI QIDQ2811932

Luís Caires, Bernardo Toninho, Frank Pfenning

Publication date: 9 June 2016

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45917-1_11

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Comparing type systems for deadlock freedom ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multiparty Session Types Within a Canonical Binary Theory, and Beyond

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong normalisation in the \(\pi\)-calculus
• Subtyping for session types in the pi calculus
• Inductive types and type constraints in the second-order lambda calculus
• Linear Logical Relations for Session-Based Concurrency
• Proof-Carrying Code in a Session-Typed Process Calculus
• Multiparty asynchronous session types
• On Recursion, Replication and Scope Mechanisms in Process Calculi
• Session Types as Intuitionistic Linear Propositions
• Strong Normalization and Equi-(Co)Inductive Types
• On Strong Normalization of the Calculus of Constructions with Type-Based Termination
• Propositions as sessions
• Linear type theory for asynchronous session types
• Wellfounded recursion with copatterns
• Behavioral Polymorphism and Parametricity in Session-Based Communication
• Higher-Order Processes, Functions, and Sessions: A Monadic Integration
• Termination of processes
• Least and Greatest Fixed Points in Linear Logic

This page was built for publication: Corecursion and Non-divergence in Session-Typed Processes