Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers

by   Fuga Kawamata, et al.

Algebraic effects and handlers are a mechanism to structure programs with computational effects in a modular way. They are recently gaining popularity and being adopted in practical languages, such as OCaml. Meanwhile, there has been substantial progress in program verification via refinement type systems. However, thus far, there has not been a satisfactory refinement type system for algebraic effects and handlers. In this paper, we fill the void by proposing a novel refinement type system for algebraic effects and handlers. The expressivity and usefulness of algebraic effects and handlers come from their ability to manipulate delimited continuations, but delimited continuations also complicate programs' control flow and make their verification harder. To address the complexity, we introduce a novel concept that we call answer refinement modification (ARM for short), which allows the refinement type system to precisely track what effects occur and in what order when a program is executed, and reflect the information as modifications to the refinements in the types of delimited continuations. We formalize our type system that supports ARM (as well as answer type modification) and prove its soundness. Additionally, as a proof of concept, we have implemented a corresponding type checking and inference algorithm for a subset of OCaml 5, and evaluated it on a number of benchmark programs. The evaluation demonstrates that ARM is conceptually simple and practically useful. Finally, a natural alternative to directly reasoning about a program with delimited continuations is to apply a continuation passing style (CPS) transformation that transforms the program to a pure program. We investigate this alternative, and show that the approach is indeed possible by proposing a novel CPS transformation for algebraic effects and handlers that enjoys bidirectional (refinement-)type-preservation.


page 1

page 2

page 3

page 4


Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL

We present simple new Hoare logics and refinement calculi for hybrid sys...

Temporal Verification with Answer-Effect Modification

Type-and-effect systems are a widely-used approach to program verificati...

Intensional Datatype Refinement

The pattern-match safety problem is to verify that a given functional pr...

Dependent Type Refinements for Futures

Type refinements combine the compositionality of typechecking with the e...

Type-directed Bounding of Collections in Reactive Programs

Our aim is to statically verify that in a given reactive program, the le...

Flexible Refinement Proofs in Separation Logic

Refinement transforms an abstract system model into a concrete, executab...

Handling polymorphic algebraic effects

Algebraic effects and handlers are a powerful abstraction mechanism to r...

Please sign up or login with your details

Forgot password? Click here to reset