Blog articles/Data

Data structures

Trees

• A Tree Grows Up in Haskell: Building a Dictionary Type
• Flattening trees
• Map fusion: Making Haskell 225% faster

Stacks

• Haskell Stacks : Two Different Ways

Queues

• Queues without pointers

Zipper

• Roll Your Own Window Manager: Tracking Focus with a Zipper
• From walking to zipping, Part 1: Moving right
• From walking to zipping, Part 2: Down and up
• The Zipper

Lists

• Arithmetic for lists
• Drawing fractals in Haskell with a cursor graphics DSEL and a cute list representation (reproduces difference lists from old primary sources)

Strings

• Splitting a string in Haskell

Mutable data

• Haskell: an Imperative Language with Mutable State
• Haskell and inplace QuickSort

Compression and serialisation

• Serialisation and compression with Data_Binary

Generics

• Boilerplate considered harmful (Uniplate edition!)

Miscelleanous

• A counter datatype with constant-time update

Further reading

• Research papers on data structures in Haskell

Control structures

See also the subsections for monads and comonads.

Codata

• Data and Co-Data

Continuations

• Continuing with continuations

Delimited continuations

• Scope herding with delimited continuations

Further reading

• Data structures on Hackage
• More data structures on Hackage
• Generics on Hackage
• Control structures on Hackage
• Markov Networks, Monoids, and Futurama