Example code

To get a feel for what real world Haskell looks like, here are some examples from various popular Haskell projects. To start learning the language, good places to start are here, here and here.

More code may be found on the wiki.

Library code

Library code usually differs from application code: it is often highly structured, and documented with haddock, and can be rather optimised. Some instructive examples (syntax highlighting by hscolour):

• A Haskell 98 Prelude.hs, foundational Haskell library (raw, docs)
• Unix.hs, simple unix tools, for beginner Haskellers (raw)
• List.hs, the standard list library (raw, docs)
• Maybe.hs, the Maybe type (raw, docs)
• Map.hs, the standard finite map (raw, docs)
• Graph.hs, a graph type (raw, docs)
• Monad.hs, basic monad support (raw, docs)
• QuickCheck.hs, a testing framework (raw, docs)
• PrettyPrint.hs, a pretty printing library (raw, docs)
• State.hs, a state monad (raw, docs)
• Music.hs, a music composition system (literate latex-style Haskell) (raw, home)
• Dfa.lhs, finite automata (literate Bird-style Haskell)
• RedBlackTree.hs, a red-black tree (raw)
• Prime.hs, prime numbers (raw)
• Foldable.hs, traversable data structures (raw)
• ByteString.hs, high-performance string type (raw, docs, home)
• SmallCheck.hs, a testing framework (raw)
• More code ...

Application code

Code from popular Haskell applications. Such code often makes use of a monadic IO, and sometimes other advanced features such as concurrency:

• Darcs, a revision control system (uses literate latex Haskell style) (home)
• Pugs, a perl6 implementation (home)
• Yi, a text editor, (home)
• Conjure, a bittorrent client
• DownNova, a file downloading program
• cpphs, an implementation of the C preprocessor (home)
• GHC, a Haskell compiler (literate latex style) (home)
• Djinn, a theorem prover (home)
• c2hs, a C to Haskell interface generator (home)
• Lambdabot, an IRC bot (home)
• hmp3, an curses mp3 player (home)
• More code ...

Examples

Tying the Knot

An example that illustrates different ways to define recursive data structures. The example defines a simple language (illustrating how to define some recursive structures) and an interpreter for the language (illustrating how to work with the recursive structures).