Hi Everyone, We are pleased to announce that we have a paper accepted for presentation at the 2020 Trends in Functional Programming Symposium (http://www.cse.chalmers.se/~rjmh/tfp/). The corresponding paper is available reading at https://www.lrde.epita.fr/dload/papers/newton.20.tfp.pdf The article is entitled: Performance Comparison of Several Folding Strategies Abstract: In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold. I hope you enjoy reading the paper, and I’m happy to have anyone’s feedback. Kind regards Jim NEWTON