A simple library implementation of binary sessions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 954809 (Why is no real title available?)
- A simple library implementation of binary sessions
- A syntactic approach to type soundness
- Compliance and subtyping in timed session types
- Concurrent Programming in ML
- Context-free session type inference
- Context-free session types
- Full abstraction in a subtyped pi-calculus with linear types
- Fundamental properties of infinite trees
- Linear type theory for asynchronous session types
- Multiparty Session Types Within a Canonical Binary Theory, and Beyond
- Multiparty asynchronous session types
- Practical affine types
- Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python
- Propositions as sessions
- Stateful contracts for affine types
- Subtyping for session types in the pi calculus
- Type systems for concurrent programs.
- Typing copyless message passing
Cited in
(13)- Context-free session type inference
- scientific article; zbMATH DE number 7566072 (Why is no real title available?)
- Relating Functional and Imperative Session Types
- Session-based concurrency in Maude: executable semantics and type checking
- A simple library implementation of binary sessions
- A Sound Algorithm for Asynchronous Session Subtyping
- A message-passing interpretation of adjoint logic
- A type checking algorithm for concurrent object protocols
- Session types without sophistry. System description
- scientific article; zbMATH DE number 7471698 (Why is no real title available?)
- Kind inference for the \textsc{FreeST} programming language
- Relating Session Types and Behavioural Contracts: The Asynchronous Case
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
This page was built for publication: A simple library implementation of binary sessions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371999)