Using higher-order contracts to model session types

DOI10.2168/LMCS-12(2:10)2016zbMath1448.68329arXiv1310.6176OpenAlexW1673934254MaRDI QIDQ5739895

Giovanni Bernardi, Matthew C. B. Hennessy

Publication date: 6 July 2016

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

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

zbMATH Keywords

dualitytesting preordershigher-order typescontract compliancerecursive subtyping

Mathematics Subject Classification ID

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

Related Items (13)

Session-based concurrency, declaratively ⋮ Mixed Sessions ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Session types and subtyping for orchestrated interactions ⋮ Multiparty session types, beyond duality ⋮ Precise subtyping for synchronous multiparty sessions ⋮ The different shades of infinite session types ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Unnamed Item ⋮ Session types without sophistry. System description ⋮ Mixed sessions ⋮ Probabilistic Analysis of Binary Sessions ⋮ Polymorphic lambda calculus with context-free session types

This page was built for publication: Using higher-order contracts to model session types