Blog articles/Data

< Blog articles

Categories: Tutorials

Contents 1 Data structures 1.1 Trees 1.2 Stacks 1.3 Queues 1.4 Zipper 1.5 Lists 1.6 Strings 1.7 Mutable data 1.8 Compression and serialisation 1.9 Generics 1.10 Miscelleanous 1.11 Further reading 2 Control structures 2.1 Codata 2.2 Continuations 2.3 Delimited continuations 3 Further reading

1 Data structures

1.1 Trees

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

1.2 Stacks

• Haskell Stacks : Two Different Ways

1.3 Queues

• Queues without pointers

1.4 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

1.5 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)

1.6 Strings

• Splitting a string in Haskell

1.7 Mutable data

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

1.8 Compression and serialisation

• Serialisation and compression with Data_Binary

1.9 Generics

• Boilerplate considered harmful (Uniplate edition!)

1.10 Miscelleanous

• A counter datatype with constant-time update

1.11 Further reading

• Research papers on data structures in Haskell

2 Control structures

See also the subsections for monads and comonads.

2.1 Codata

• Data and Co-Data

2.2 Continuations

• Continuing with continuations

2.3 Delimited continuations

• Scope herding with delimited continuations

3 Further reading

• Data structures on Hackage
• More data structures on Hackage
• Generics on Hackage
• Control structures on Hackage

Recent content is available under a simple permissive license.