Finger Trees Explained Anew, and Slightly Simplified (Functional Pearl)
We explicitly motivate the subtle intricacies of Hinze and Paterson’s Finger Tree datastructure, by step-wise refining a naive implementation. The result is a new explanation of how Finger Trees work and why they have the particular structure they have, and also a small simplification of the original implementation.
Fri 28 Aug Times are displayed in time zone: Eastern Time (US & Canada) change
10:00 - 11:00
|Finger Trees Explained Anew, and Slightly Simplified (Functional Pearl)|
Koen ClaessenChalmers University of Technology, SwedenDOI
|Type Your Matrices for Great Good: A Haskell Library of Typed Matrices and Applications (Functional Pearl)|
Armando João Isaías Ferreira dos SantosUniversity of Minho, Portugal / INESC TEC, Portugal, Jose Nuno OliveiraUniversity of Minho, Portugal / INESC TEC, PortugalDOI