Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Thu 27 Sep 2018 14:45 - 15:10 at New York Central - Effect Handlers & Abstract Machine Chair(s): Niki Vazou

Many functions over algebraic datatypes can be expressed in terms of a fold. Doing so, however, has one notable drawback: folds are not tail-recursive. As a result, a function defined in terms of a fold may raise a stack overflow when executed. This paper defines a datatype generic, tail-recursive higher-order function that is guaranteed to produce the same result as the fold. Doing so combines the compositional nature of folds and the performance benefits of a hand-written tail-recursive function in a single setting.

Thu 27 Sep
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

tyde-2018
14:20 - 15:10: TyDe 2018 - Effect Handlers & Abstract Machine at New York Central
Chair(s): Niki VazouUniversity of Maryland, USA
tyde-201814:20 - 14:45
Research paper
Daan LeijenMicrosoft Research, USA
DOI
tyde-201814:45 - 15:10
Research paper
Carlos Tomé CortiñasUtrecht University, Netherlands, Wouter SwierstraUtrecht University, Netherlands
DOI