Session types without sophistry. System description

DOI10.1007/978-3-030-59025-3_5OpenAlexW3085646709MaRDI QIDQ2039935

Oleg Kiselyov, Keigo Imai

Publication date: 6 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59025-3_5

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Cites Work

• Session types revisited
• Subtyping for session types in the pi calculus
• A Semantics for Propositions as Sessions
• On Duality Relations for Session Types
• Effects as sessions, sessions as effects
• Propositions as sessions
• Fun with Type Functions
• Multiparty Asynchronous Session Types
• Typed Tagless Final Interpreters
• Combinators for bi-directional tree transformations
• Canonical Structures for the Working Coq User
• A simple library implementation of binary sessions
• Using higher-order contracts to model session types
• Typing Copyless Message Passing
• Programming Languages and Systems
• Verifying asynchronous interactions via communicating session automata

This page was built for publication: Session types without sophistry. System description