A simple library implementation of binary sessions

DOI10.1017/S0956796816000289zbMath1418.68036OpenAlexW4301028326MaRDI QIDQ5371999

Luca Padovani

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796816000289

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (12)

Relating Functional and Imperative Session Types ⋮ Unnamed Item ⋮ ElixirST: a session-based type system for elixir modules ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ A simple library implementation of binary sessions ⋮ Context-Free Session Type Inference ⋮ Unnamed Item ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Unnamed Item ⋮ A type checking algorithm for concurrent object protocols ⋮ A message-passing interpretation of adjoint logic ⋮ Session types without sophistry. System description

Uses Software

• OCaml

Cites Work

• Unnamed Item
• Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python
• Fundamental properties of infinite trees
• A syntactic approach to type soundness
• Subtyping for session types in the pi calculus
• Compliance and Subtyping in Timed Session Types
• Multiparty Session Types Within a Canonical Binary Theory, and Beyond
• Propositions as sessions
• Context-free session types
• Context-Free Session Type Inference
• Full Abstraction in a Subtyped pi-Calculus with Linear Types
• Multiparty asynchronous session types
• Stateful Contracts for Affine Types
• Concurrent Programming in ML
• Linear type theory for asynchronous session types
• A simple library implementation of binary sessions
• Practical affine types
• Typing Copyless Message Passing
• Formal Methods at the Crossroads. From Panacea to Foundational Support

This page was built for publication: A simple library implementation of binary sessions