Session-ocaml: A Session-Based Library with Polarities and Lenses

Imai, Keigo; Yoshida, Nobuko; Yuen, Shoji

doi:10.1007/978-3-319-59746-1_6

Cited by 13 publications

(11 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later work by Dardha et al [2012] helped merge the linear type systems of Kobayashi with Honda's session types, which facilitated the incorporation of session types in mainstream programming languages like Go [Lange et al 2018], OCaml [Imai et al 2019;Padovani 2017], and Java [Hu et al 2010]. These works focus on adding session-typed support for the Actor model in existing languages, but do not target proving functional correctness of programs.…”

Section: Session Typesmentioning

confidence: 99%

Actris: session-type based reasoning in separation logic

Hinrichsen

Bengtson

Krebbers

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Message passing is a useful abstraction to implement concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency, and locks. We present Actris: a logic for proving functional correctness of programs that use a combination of the aforementioned features. Actris combines the power of modern concurrent separation logics with a first-class protocol mechanismÐbased on session typesÐfor reasoning about message passing in the presence of other concurrency paradigms. We show that Actris provides a suitable level of abstraction by proving functional correctness of a variety of examples, including a distributed merge sort, a distributed load-balancing mapper, and a variant of the map-reduce model, using relatively simple specifications. Soundness of Actris is proved using a model of its protocol mechanism in the Iris framework. We mechanised the theory of Actris, together with tactics for symbolic execution of programs, as well as all examples in the paper, in the Coq proof assistant.

show abstract

Section: Session Typesmentioning

confidence: 99%

Actris: session-type based reasoning in separation logic

Hinrichsen

Bengtson

Krebbers

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…For instance, if it is a hit, Svr will send a Hit message to Atk to notify it of the outcome, and also a Hit message with the coordinate being attacked to Def; similarly if it is a miss, Miss message will be sent instead. This is written in Scribble as a choice statement (line [7][8][9][10][11][12][13][14][15][16][17][18][19][20]. The syntax choice at Svr means the choice is being made at the role Svr, and also that Svr will the first sender of message in each of the possible branches: the hit branch on lines 8-9 or the miss branch on lines 11-12.…”

Section: The Scribble Protocol Languagementioning

confidence: 99%

“…Padovani's FuSe [28,22] infers and type checks usage of binary session-based communication in OCaml, and uses a hybrid static/dynamic linearity check similar to the hybrid verification approach in [11]. Session-ocaml [13] implements session types in OCaml with lenses overcoming a linearity issue but only treats binary session types.…”

Section: Related Workmentioning

confidence: 99%

Multiparty Session Type-safe Web Development with Static Linearity

King

Yoshida

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Modern web applications can now offer desktop-like experiences from within the browser, thanks to technologies such as WebSockets, which enable low-latency duplex communication between the browser and the server. While these advances are great for the user experience, they represent a new responsibility for web developers who now need to manage and verify the correctness of more complex and potentially stateful interactions in their application.In this paper, we present a technique for developing interactive web applications that are statically guaranteed to communicate following a given protocol. First, the global interaction protocol is described in the Scribble protocol language -based on multiparty session types. Scribble protocols are checked for well-formedness, and then each role is projected to a Finite State Machine representing the structure of communication from the perspective of the role. We use source code generation and a novel type-level encoding of FSMs using multi-parameter type classes to leverage the type system of the target language and guarantee only programs that communicate following the protocol will type check.Our work targets PureScript -a functional language that compiles to JavaScript -which crucially has an expressive enough type system to provide static linearity guarantees. We demonstrate the effectiveness of our approach through a web-based Battleship game where communication is performed through WebSocket connections.

show abstract

“…Future work includes extensions to the classical linear logic-based framework, including multiparty session types [10,11]. Encodings of session π-calculi to the λ-calculus have been used to implement session primitives in functional languages such as Haskell (see a recent survey [32]), OCaml [24,34,35] and Scala [48]. Following this line of work, we plan to develop encoding-based implementations of this work as embedded DSLs.…”

Section: Related Work and Concluding Remarksmentioning

confidence: 99%

On Polymorphic Sessions and Functions

Toninho

Yoshida

2018

Programming Languages and Systems

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 functionsas-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

Session-ocaml: A Session-Based Library with Polarities and Lenses

Cited by 13 publications

References 36 publications

Actris: session-type based reasoning in separation logic

Actris: session-type based reasoning in separation logic

Multiparty Session Type-safe Web Development with Static Linearity

On Polymorphic Sessions and Functions

Contact Info

Product

Resources

About