Reflection without remorse: Revealing a hidden sequence to speed up monadic reflection

Atze Van Der Ploeg, Oleg Kiselyov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

A series of list appends or monadic binds for many monads performs algorithmically worse when left-associated. Continuation-passing style (CPS) is well-known to cure this severe dependence of performance on the association pattern. The advantage of CPS dwindles or disappears if we have to examine or modify the intermediate result of a series of appends or binds, before continuing the series. Such examination is frequently needed, for example, to control search in non-determinism monads. We present an alternative approach that is just as general as CPS but more robust: it makes series of binds and other such operations efficient regardless of the association pattern - and also provides efficient access to intermediate results. The key is to represent such a conceptual sequence as an efficient sequence data structure. Efficient sequence data structures from the literature are homogeneous and cannot be applied as they are in a type-safe way to series of monadic binds. We generalize them to type aligned sequences and show how to construct their (assuredly order-preserving) implementations. We demonstrate that our solution solves previously undocumented, severe performance problems in iteratees, LogicT transformers, free monads and extensible effects.

Original languageEnglish
Title of host publicationHaskell 2014 - Proceedings of the 2014 ACM SIGPLAN Haskell Symposium
PublisherAssociation for Computing Machinery
Pages133-144
Number of pages12
ISBN (Print)9781450330411
DOIs
Publication statusPublished - 2014 Jan 1
Externally publishedYes
Event2014 6th ACM SIGPLAN Haskell Symposium, Haskell 2014 - Gothenburg, Sweden
Duration: 2014 Sep 42014 Sep 5

Publication series

NameHaskell 2014 - Proceedings of the 2014 ACM SIGPLAN Haskell Symposium

Other

Other2014 6th ACM SIGPLAN Haskell Symposium, Haskell 2014
CountrySweden
CityGothenburg
Period14/9/414/9/5

Keywords

  • data structures
  • monads
  • performance
  • reflection

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Fingerprint Dive into the research topics of 'Reflection without remorse: Revealing a hidden sequence to speed up monadic reflection'. Together they form a unique fingerprint.

Cite this