Session-ocaml: A session-based library with polarities and lenses

Imai, Keigo; Yoshida, Nobuko; Yuen, Shoji

doi:10.1016/j.scico.2018.08.005

Cited by 19 publications

(26 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In OCaml, Padovani [48] implements context free session types providing two kinds of encodings from context free session types into functional data structures. A different approach is taken in the work of Imai et al [34] where session types are encoded leveraging parametric polymorphism in OCaml to statically ensure linear usage of channels. Extending this approach, Imai et al [32] propose a library for global combinators, which are a set of functions for writing and verifying multiparty protocols in OCaml.…”

Section: Related Workmentioning

confidence: 99%

“…Following this original motivation, session types have been integrated into mainstream programming languages [1,21]. A popular technique is to use "encodings" of session types into linear or functional types to correctly implement structured communications in programming languages such as Haskell [46], OCaml [32,34,48] and Scala [67,68] (see Section 6).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Polymorphic Sessions and Functions

Toninho

Yoshida

2021

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

This work exploits the logical foundation of session types to determine what kind of type discipline for the Λ-calculus can exactly capture, and is captured by, Λ-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functions-as-processes encodings between a polymorphic session π-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the Λ-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On Polymorphic Sessions and Functions

Toninho

Yoshida

2021

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…which compute the sum of the i-th elements of two linearly typed arrays. The idea is to use a data structure called slot sequence [6], [9], [10], which holds multiple linear resources, in the input and output of commands in the parameterised monad. Lenses enable one to indirectly refer to linear resources while restricting non-linear access to them as before, thereby guaranteeing linearity.…”

Section: Lenses Focusing On Multiple Linear Resourcesmentioning

confidence: 99%

“…Prior work by the authors. This paper builds on Garrigue's Safeio API [6], and on the encoding of session types proposed by Imai et al [9], [10]. Both used some form of parameterised monads and lenses.…”

Section: Introductionmentioning

confidence: 99%

Lightweight Linearly-typed Programming with Lenses and Monads

Imai

Garrigue

2019

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

This paper shows an encoding of linear types in OCaml and its applications. The encoding enables to write correct OCaml programs based on safe resource access guided by linear types. Linear types ensure that every variable is used exactly once, and, thus, they can be used to check the behavioural aspects of programs such as resource access and communication protocols in a static way. However, linear types require significant effort to be integrated into existing programming languages. Our encoding allows the vanilla OCaml typechecker to enforce linearity by using lenses and a parameterised monad. Parameterised monads are monads with a pre-and a post-condition, and we use them to track the creation and consumption of resources at the type level. Lenses, which point at parts of a data type, are used to refer to a resource in pre-and post-conditions. To handle comfortably structured data such as linearly typed lists, we further propose an extension to pattern matching based on the syntax-extension mechanism of OCaml. We show an application to static checking of communication protocols in OCaml.

show abstract

“…Session typing relies on a linear treatment of communication channels, in order to track the I/O actions performed on the channel against the intended session type. Most existing implementations adopt one of two approaches: monadic interfaces in functional languages [Imai et al 2020[Imai et al , 2019Orchard and Yoshida 2017], or łhybridž approaches that complement static typing with dynamic linearity checks Scalas et al 2017].…”

Section: Introductionmentioning

confidence: 99%

Statically verified refinements for multiparty protocols

Zhou

Ferreira

et al. 2020

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

With distributed computing becoming ubiquitous in the modern era, safe distributed programming is an open challenge. To address this, multiparty session types (MPST) provide a typing discipline for message-passing concurrency, guaranteeing communication safety properties such as deadlock freedom.While originally MPST focus on the communication aspects, and employ a simple typing system for communication payloads, communication protocols in the real world usually contain constraints on the payload. We introduce refined multiparty session types (RMPST), an extension of MPST, that express data dependent protocols via refinement types on the data types.We provide an implementation of RMPST, in a toolchain called Session ⋆ , using Scribble, a toolchain for multiparty protocols, and targeting F ⋆ , a verification-oriented functional programming language. Users can describe a protocol in Scribble and implement the endpoints in F ⋆ using refinement-typed APIs generated from the protocol. The F ⋆ compiler can then statically verify the refinements. Moreover, we use a novel approach of callback-styled API generation, providing static linearity guarantees with the inversion of control. We evaluate our approach with real world examples and show that it has little overhead compared to a naïve implementation, while guaranteeing safety properties from the underlying theory. CCS Concepts: • Theory of computation → Automated reasoning; Distributed computing models; • Software and its engineering → Source code generation.

show abstract

Session-ocaml: A session-based library with polarities and lenses

Cited by 19 publications

References 9 publications

On Polymorphic Sessions and Functions

On Polymorphic Sessions and Functions

Lightweight Linearly-typed Programming with Lenses and Monads

Statically verified refinements for multiparty protocols

Contact Info

Product

Resources

About