Type-Based Analysis for Session Inference (Extended Abstract)
From MaRDI portal
Publication:2827469
DOI10.1007/978-3-319-39570-8_17zbMath1347.68057arXiv1510.03929OpenAlexW2463705546MaRDI QIDQ2827469
Carlo Spaccasassi, Vasileios Koutavas
Publication date: 19 October 2016
Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.03929
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18)
Cites Work
- Unnamed Item
- Type checking a multithreaded functional language with session types
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- Subtyping for session types in the pi calculus
- Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types
- Session Types as Intuitionistic Linear Propositions
- Type and behaviour reconstruction for higher-order concurrent programs
- Propositions as sessions
- Linear type theory for asynchronous session types
- Higher-Order Processes, Functions, and Sessions: A Monadic Integration
This page was built for publication: Type-Based Analysis for Session Inference (Extended Abstract)