Context-free session type inference

DOI10.1007/978-3-662-54434-1_30MaRDI QIDQ2988669zbMATH OpenOpenAlexFDO

Authors Luca Padovani

Publication date 19 May 2017

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-54434-1_30

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Context-free session types
• Type-Based Analysis for Session Inference (Extended Abstract)
• Nested session types
• CONCUR 2004 - Concurrency Theory
• Subtyping for session types in the pi calculus

Cites work

• \(L^3\): a linear language with locations
• A simple library implementation of binary sessions
• A syntactic approach to type soundness
• Concurrent Programming in ML
• Context-free session type inference
• Context-free session types
• Full abstraction in a subtyped pi-calculus with linear types
• Functional translation of a calculus of capabilities
• Fundamental properties of infinite trees
• scientific article; zbMATH DE number 1759630 (Why is no real title available?)
• Linear type theory for asynchronous session types
• Monadic encapsulation of effects: a revised approach (extended version)
• On regions and linear types (extended abstract)
• Practical affine types
• Propositions as sessions
• Session types revisited
• Stateful contracts for affine types
• Type systems for concurrent programs.

Cited in

(13)

• Polymorphic lambda calculus with context-free session types
• Type-Based Analysis for Session Inference (Extended Abstract)
• Synthesising Choreographies from Local Session Types
• Context-free session types
• Context-free session type inference
• Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
• Relating Functional and Imperative Session Types
• Deciding the bisimilarity of context-free session types
• A simple library implementation of binary sessions
• The different shades of infinite session types
• Polymorphic higher-order context-free session types
• System \(F^\mu_\omega\) with context-free session types
• Kind inference for the \textsc{FreeST} programming language

Describes a project that uses

Uses Software

• Haskell
• OCaml
• Alms

This page was built for publication: Context-free session type inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988669)