Effects for efficiency: asymptotic speedup with first-class control

@article{Hillerstrm2020EffectsFE,
  title={Effects for efficiency: asymptotic speedup with first-class control},
  author={Daniel Hillerstr{\"o}m and Sam Lindley and John R. Longley},
  journal={Proceedings of the ACM on Programming Languages},
  year={2020},
  volume={4},
  pages={1 - 29}
}
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… 

Figures and Tables from this paper

Effects for Efficiency
TLDR
It is shown that effect handlers enable an asymptotic improvement in runtime complexity for a certain class of programs and is the first of its kind for control operators.
Scalable Handling of Effects
TLDR
Five key problem areas to be addressed at this Dagstuhl Seminar are identified in order to enable effect handlers to scale: Safety, Modularity, Interoperability, Legibility, and Efficiency.

References

SHOWING 1-10 OF 73 REFERENCES
LCF Considered as a Programming Language
  • G. Plotkin
  • Computer Science
    Theor. Comput. Sci.
  • 1977
The essence of compiling with continuations
TLDR
The combined effect of the three phases is equivalent to a source-to-source transformation that simulates the compaction phase and fully developed CPS compilers do not need to employ the CPS transformation but can achieve the same results with a simple source-level transformation.
Totale Objekte und Mengen in der Bereichstheorie
  • Ph.D. Dissertation. Ludwig Maximillians-Universtität,
  • 1990
Higher-order Programming Languages
  • Ph.D. Dissertation. Indianapolis, IN,
  • 1988
Effects for Efficiency: Asymptotic Speedup with First-Class
  • Handlers. In FSCD (LIPIcs,
  • 2020
Effects for Efficiency: Asymptotic Speedup with First-Class Control
  • 2020
Introduction to Algorithms, third edition
TLDR
Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book a great resource on the basic tools used to analyze the performance of algorithms.
Revised6 Report on the Algorithmic Language Scheme
TLDR
Scheme demonstrates that a very small number of rules for forming expressions, with no restrictions on how they are composed, suffice to form a practical and efficient programming language that is flexible enough to support most of the major programming paradigms in use today.
Monad Transformers: (Functional Pearl)
  • Addison-Wesley. Daan Leijen
  • 1997
The art of computer programming: V.1.: Fundamental algorithms
...
1
2
3
4
5
...