Programming with algebraic effects and handlers

Bauer, Andrej; Pretnar, Matija

doi:10.1016/j.jlamp.2014.02.001

Cited by 148 publications

(275 citation statements)

References 22 publications

Supporting

Mentioning

273

Contrasting

Order By: Relevance

“…Previous work in Idris has used handlers of algebraic effects [3,5,14,20] to describe side-effecting computations and, furthermore, to describe resource access protocols [6]. However, when there are increasing numbers of communication channels, tracking each in a separate effect becomes unwieldy.…”

Section: Related Workmentioning

confidence: 99%

Type-Driven Development of Concurrent Communicating Systems

Brady

2017

csci

View full text Add to dashboard Cite

Modern software systems rely on communication; for example, mobile applications communicating with a central server, distributed systems coordinating a telecommunications network, or concurrent systems handling events and processes in a desktop application. However, reasoning about concurrent programs is hard since we must reason about each process and the order in which communication might happen between processes. In this paper, I describe a type-driven approach to implementing communicating concurrent programs using the dependently typed programming language Idris. I show how the type system can be used to describe resource access protocols (such as controlling access to a file handle) and verify that the programs correctly follow those protocols. Finally, I show how to use the type system to reason about the order of communication between concurrent processes, ensuring that each end of a communication channel follows a defined protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Type-Driven Development of Concurrent Communicating Systems

Brady

2017

csci

View full text Add to dashboard Cite

show abstract

“…The core idea behind the embedding of effects into sessions is the simulation of effectful computations using processes as effect handlers (inspired by work on effect semantics via handlers, e.g., [3,46]). Interactions with these processes, via session-typed channels, induces a description of the effects of a process as a session type.…”

Section: Processes As Effect Handlers Session Types As Effectsmentioning

confidence: 99%

“…Our encoding is inspired by the approach of algebraic effects handlers for giving effect semantics and implementations [3,29,46]. In this approach, and in our encoding, multiple effects can be easily composed with distinct, independent handlers.…”

Section: Remark 2 (Composition)mentioning

confidence: 99%

Effects as sessions, sessions as effects

OrchardDominic¹,

Yoshida²

2016

SIGPLAN Not.

View full text Add to dashboard Cite

Effect and session type systems are two expressive behavioural type systems. The former is usually developed in the context of the lambda-calculus and its variants, the latter for the pi-calculus. In this paper we explore their relative expressive power. Firstly, we give an embedding from PCF, augmented with a parameterised effect system, into a session-typed pi-calculus (session calculus), showing that session types are powerful enough to express effects. Secondly, we give a reverse embedding, from the session calculus back into PCF, by instantiating PCF with concurrency primitives and its effect system with a session-like effect algebra; effect systems are powerful enough to express sessions. The embedding of session types into an effect system is leveraged to give a new implementation of session types in Haskell, via an effect system encoding. The correctness of this implementation follows from the second embedding result. We also discuss various extensions to our embeddings.

show abstract

“…Following Longley's method [75], we use computational ef-fects [12], namely named exceptions, to derive SCP . The basic method to find the n such that F (f ) depends only on the first n elements of f is a program P (F, f ) that works as follows: P tests whether F applies its argument f to a number n by running the sub-routine (written in an ML-like language): l e t e x c e p t i o n e i n ( F ( f u n x => i f x < n t h e n f x e l s e r a i s e e ) ; t r u e ) h a n d l e e => f a l s e Then by testing F on increasingly larger n's, if the continuity principle is true, P eventually finds an n such that the test returns true § .…”

Section: Introductionmentioning

confidence: 99%

Validating Brouwer's continuity principle for numbers using named exceptions

Rahli

Bickford

2017

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

This paper extends the Nuprl proof assistant (a system representative of the class of extensional type theories with dependent types) with named exceptions and handlers, as well as a nominal fresh operator. Using these new features, we prove a version of Brouwer's Continuity Principle for numbers. We also provide a simpler proof of a weaker version of this principle that only uses diverging terms. We prove these two principles in Nuprl's metatheory using our formalization of Nuprl in Coq and reflect these metatheoretical results in the Nuprl theory as derivation rules. We also show that these additions preserve Nuprl's key metatheoretical properties, in particular consistency and the congruence of Howe's computational equivalence relation. Using continuity and the fan theorem we prove important results of Intuitionistic Mathematics: Brouwer's continuity theorem; bar induction on monotone bars; and the negation of the law of excluded middle.

show abstract

Programming with algebraic effects and handlers

Cited by 148 publications

References 22 publications

Type-Driven Development of Concurrent Communicating Systems

Type-Driven Development of Concurrent Communicating Systems

Effects as sessions, sessions as effects

Validating Brouwer's continuity principle for numbers using named exceptions

Contact Info

Product

Resources

About