Finger trees explained anew, and slightly simplified (functional pearl)
Paper i proceeding, 2020

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.

haskell

finger trees

Monads

datastructures

functional pearl

Generic Programming

amortized complexity

Författare

Koen Claessen

Chalmers, Data- och informationsteknik, Funktionell programmering

Haskell 2020 - Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell, co-located with ICFP 2020

31-38

13th ACM SIGPLAN International Symposium on Haskell, Haskell 2020, co-located with ICFP 2020
Virtual; online, ,

Ämneskategorier

Data- och informationsvetenskap

Programvaruteknik

Systemvetenskap, informationssystem och informatik med samhällsvetenskaplig inriktning

DOI

10.1145/3406088.3409026

Mer information

Senast uppdaterat

2021-01-04