Effects for Efficiency: Asymptotic Speedup with First-Class Control

by   Daniel Hillerström, et al.

We study the fundamental efficiency of delimited control. Specifically, we show that effect handlers enable an asymptotic improvement in runtime complexity for a certain class of functions. We consider the generic count problem using a pure PCF-like base language λ_b and its extension with effect handlers λ_h. We show that λ_h admits an asymptotically more efficient implementation of generic count than any λ_b implementation. We also show that this efficiency gap remains when λ_b is extended with mutable state. To our knowledge this result is the first of its kind for control operators.


page 1

page 2

page 3

page 4


Best CNTFET Ternary Adders?

The MUX implementation of ternary half adders and full adders using pred...

Retrofitting Effect Handlers onto OCaml

Effect handlers have been gathering momentum as a mechanism for modular ...

An asymptotic formula for Aldaz-Kounchev-Render operators on the hypercube

We prove a version of a conjecture concerning the asymptotic behavior of...

Computational complexity lower bounds of certain discrete Radon transform approximations

For the computational model where only additions are allowed, the Ω(n^2 ...

Sequential Effect Systems with Control Operators

Sequential effect systems are a class of effect system that exploits inf...

Mixing properties of Skellam-GARCH processes

We consider integer-valued GARCH processes, where the count variable con...

Please sign up or login with your details

Forgot password? Click here to reset