Blog articles/Data
From HaskellWiki
(Difference between revisions)
(→Data structures) |
(→Mutable data) |
||
| Line 28: | Line 28: | ||
* [http://neilbartlett.name/blog/2007/04/11/haskell-an-imperative-language-with-mutable-state/ Haskell: an Imperative Language with Mutable State] | * [http://neilbartlett.name/blog/2007/04/11/haskell-an-imperative-language-with-mutable-state/ Haskell: an Imperative Language with Mutable State] | ||
| + | |||
| + | ===Compression and serialisation === | ||
| + | |||
| + | * [[Serialisation and compression with Data_Binary]] | ||
=== Generics === | === Generics === | ||
Revision as of 04:44, 9 July 2007
Contents |
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
1.3 Queues
1.4 Zipper
1.5 Strings
1.6 Mutable data
1.7 Compression and serialisation
1.8 Generics
1.9 Miscelleanous
1.10 Further reading
2 Control structures
See also the subsections for monads and comonads.
