Type-Driven Development of Concurrent Communicating Systems

Brady, Edwin

doi:10.7494/csci.2017.18.3.1413

Cited by 21 publications

(18 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While linear types avoid duplication and dropping of values, a value with unique type is referenced at most once at run time. Brady [2017] shows how to use this feature combination to develop concurrent systems.…”

Section: Related Workmentioning

confidence: 99%

Label-dependent session types

Thiemann

Vasconcelos

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Session types have emerged as a typing discipline for communication protocols. Existing calculi with session types come equipped with many different primitives that combine communication with the introduction or elimination of the transmitted value.We present a foundational session type calculus with a lightweight operational semantics. It fully decouples communication from the introduction and elimination of data and thus features a single communication reduction, which acts as a rendezvous between senders and receivers. We achieve this decoupling by introducing label-dependent session types, a minimalist value-dependent session type system with subtyping. The system is sufficiently powerful to simulate existing functional session type systems. Compared to such systems, label-dependent session types place fewer restrictions on the code. We further introduce primitive recursion over natural numbers at the type level, thus allowing to describe protocols whose behaviour depends on numbers exchanged in messages. An algorithmic type checking system is introduced and proved equivalent to its declarative counterpart. The new calculus showcases a novel lightweight integration of dependent types and linear typing, with has uses beyond session type systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Label-dependent session types

Thiemann

Vasconcelos

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Idris [Brady 2013] features uniqueness types, which have been used, in particular, to enforce communication protocols [Brady 2017]. Uniqueness types, in Idris, are being replaced by linear types based on qtt [Atkey 2017], a variant of McBride [2016].…”

Section: Uniqueness and Ownership Typingmentioning

confidence: 99%

Linear Haskell: practical linearity in a higher-order polymorphic language

Bernardy

Boespflug²,

Newton

et al. 2017

Proc. ACM Program. Lang.

121

View full text Add to dashboard Cite

Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards-compatibility and code reuse across linear and non-linear users of a library. Only then can the benefits of linear types permeate conventional functional programming. Rather than bifurcate types into linear and non-linear counterparts, we instead attach linearity to function arrows. Linear functions can receive inputs from linearly-bound values, but can also operate over unrestricted, regular values.To demonstrate the efficacy of our linear type system -both how easy it can be integrated in an existing language implementation and how streamlined it makes it to write programs with linear types -we implemented our type system in ghc, the leading Haskell compiler, and demonstrate two kinds of applications of linear types: mutable data with pure interfaces; and enforcing protocols in I/O-performing functions. This version includes an Appendix that gives an operational semantics for the core language, and proofs of the metatheoretical results stated in the paper.

show abstract

“…Taking inspiration from Multi-Party Session Types we have been investigating how dependent types, as presented in Idris, can be used to design, implement, and reason about communicating systems. Existing work has presented a type-driven approach for designing and developing communicating concurrent systems [11]. A limitation in this work is not being able to specify value-dependencies on messages for multi-party protocols.…”

Section: Contributionsmentioning

confidence: 99%

Value-Dependent Session Design in a Dependently Typed Language

Muijnck-Hughes

Brady

Vanderbauwhede

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Session Types offer a typing discipline that allows protocol specifications to be used during typechecking, ensuring that implementations adhere to a given specification. When looking to realise global session types in a dependently typed language care must be taken that values introduced in the description are used by roles that know about the value.We present Sessions, a Resource Dependent Embedded Domain Specific Language (EDSL) for describing global session descriptions in the dependently typed language Idris. As we construct session descriptions the values parameterising the EDSLs' type keeps track of roles and messages they have encountered. We can use this knowledge to ensure that message values are only used by those who know the value. Sessions supports protocol descriptions that are computable, composable, higher-order, and value-dependent. We demonstrate Sessions expressiveness by describing the TCP Handshake, a multi-modal server providing echo and basic arithmetic operations, and a Higher-Order protocol that supports an authentication interaction step.

show abstract

Type-Driven Development of Concurrent Communicating Systems

Cited by 21 publications

References 23 publications

Label-dependent session types

Label-dependent session types

Linear Haskell: practical linearity in a higher-order polymorphic language

Value-Dependent Session Design in a Dependently Typed Language

Contact Info

Product

Resources

About