We present a straightforward, sound, Hindley-Milner polymorphic type system for algebraic effects and handlers in a call-by-value calculus, which, to our surprise, allows type variable generalisation of arbitrary computations, and not just values. The soundness of unrestricted call-by-value Hindley-Milner polymorphism is known to fail in the presence of computational effects such as reference cells and continuations, and many programming examples can be recast to use effect handlers instead of these effects. This file formalises in Twelf the calculus and its soundness proof
Abstract. We define an “enriched effect calculus ” by extending a type theory for computational effe...
Text source-files for the mechanised proofs supporting the paper, formalised in Abella We compare th...
We present a new type system with support for proofs of programs in a call-by-value language with co...
We present a straightforward, sound, Hindley-Milner polymorphic type system for algebraic effects ...
Accompannying material for _No value restriction is needed for algebraic effects and handlers_ =====...
Type systems usually characterize the shape of values but not their free variables. However, many de...
We present the first algorithm for reconstructing the types and effects of expressions in the presen...
In the thesis, we explore reasoning about and handling of algebraic effects. Those are computational...
Abstract. Restricting polymorphism to values is now the standard way to obtain soundness in ML-like ...
We present a general semantic account of Gifford-style type-and-effect systems. These type systems ...
Dealing with polymorphism in the presence of imperative features is a long-standing open problem for...
We compare the expressive power of three programming abstractions for user-defined computational eff...
Side-effect are ubiquitous in programming. Examples include mutable state, exceptions, non-determini...
AbstractThis paper is a tutorial on algebraic effects and handlers. In it, we explain what algebraic...
We study an extension of the Hindley/Milner system with explicit type scheme annotations and type de...
Abstract. We define an “enriched effect calculus ” by extending a type theory for computational effe...
Text source-files for the mechanised proofs supporting the paper, formalised in Abella We compare th...
We present a new type system with support for proofs of programs in a call-by-value language with co...
We present a straightforward, sound, Hindley-Milner polymorphic type system for algebraic effects ...
Accompannying material for _No value restriction is needed for algebraic effects and handlers_ =====...
Type systems usually characterize the shape of values but not their free variables. However, many de...
We present the first algorithm for reconstructing the types and effects of expressions in the presen...
In the thesis, we explore reasoning about and handling of algebraic effects. Those are computational...
Abstract. Restricting polymorphism to values is now the standard way to obtain soundness in ML-like ...
We present a general semantic account of Gifford-style type-and-effect systems. These type systems ...
Dealing with polymorphism in the presence of imperative features is a long-standing open problem for...
We compare the expressive power of three programming abstractions for user-defined computational eff...
Side-effect are ubiquitous in programming. Examples include mutable state, exceptions, non-determini...
AbstractThis paper is a tutorial on algebraic effects and handlers. In it, we explain what algebraic...
We study an extension of the Hindley/Milner system with explicit type scheme annotations and type de...
Abstract. We define an “enriched effect calculus ” by extending a type theory for computational effe...
Text source-files for the mechanised proofs supporting the paper, formalised in Abella We compare th...
We present a new type system with support for proofs of programs in a call-by-value language with co...