Personal tools

Example code

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Removed an obsolete link)
(Library code: Added names to links)
Line 41: Line 41:
 
* [http://www.cse.unsw.edu.au/~dons/data/Music.html Music.hs], a music composition system (literate latex-style Haskell) ([http://darcs.haskell.org/haskore/src/Haskore/Music.lhs raw], [http://www.haskell.org/haskore/ home])
 
* [http://www.cse.unsw.edu.au/~dons/data/Music.html Music.hs], a music composition system (literate latex-style Haskell) ([http://darcs.haskell.org/haskore/src/Haskore/Music.lhs raw], [http://www.haskell.org/haskore/ home])
 
-->
 
-->
  +
 
* [http://www.ninebynine.org/Software/Swish-0.2.1/HaskellRDF/Dfa/Dfa.lhs Dfa.lhs], finite automata (literate Bird-style Haskell)
 
* [http://www.ninebynine.org/Software/Swish-0.2.1/HaskellRDF/Dfa/Dfa.lhs Dfa.lhs], finite automata (literate Bird-style Haskell)
   
* [http://www.polyomino.f2s.com/david/haskell/hs/RedBlackTree.hs.txt], a red-black tree
+
* [http://www.polyomino.f2s.com/david/haskell/hs/RedBlackTree.hs.txt RedBlackTree.hs], a red-black tree
 
<!--
 
<!--
 
* [http://www.cse.unsw.edu.au/~dons/data/Prime.html Prime.hs], prime numbers ([http://andrew.bromage.org/darcs/numbertheory/Math/Prime.hs raw])
 
* [http://www.cse.unsw.edu.au/~dons/data/Prime.html Prime.hs], prime numbers ([http://andrew.bromage.org/darcs/numbertheory/Math/Prime.hs raw])
 
-->
 
-->
  +
 
* [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data-Foldable.html Foldable.hs], traversable data structures ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Data-Foldable.html docs])
 
* [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data-Foldable.html Foldable.hs], traversable data structures ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Data-Foldable.html docs])
   
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/bytestring/src/Data-ByteString.html ByteString.hs], high-performance string type ([http://code.haskell.org/bytestring/Data/ByteString.hs raw], [http://hackage.haskell.org/package/bytestring docs])
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/bytestring/src/Data-ByteString.html ByteString.hs], high-performance string type ([http://code.haskell.org/bytestring/Data/ByteString.hs raw], [http://hackage.haskell.org/package/bytestring docs])
   
* [https://github.com/feuerbach/smallcheck/blob/master/Test/SmallCheck.hs], a testing framework ([https://raw.github.com/feuerbach/smallcheck/master/Test/SmallCheck.hs raw], [http://hackage.haskell.org/package/smallcheck docs])
+
* [https://github.com/feuerbach/smallcheck/blob/master/Test/SmallCheck.hs SmallCheck.hs], a testing framework ([https://raw.github.com/feuerbach/smallcheck/master/Test/SmallCheck.hs raw], [http://hackage.haskell.org/package/smallcheck docs])
   
 
* [http://www.haskell.org/haskellwiki/Darcs_repositories More code ...]
 
* [http://www.haskell.org/haskellwiki/Darcs_repositories More code ...]
 
   
 
=== Application code ===
 
=== Application code ===

Revision as of 20:52, 25 February 2012

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 Learning Haskell, Haskell in 5 steps, and Books and tutorials.

More code may be found on the wiki.


1 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):

  • Unix.hs, simple unix tools, for beginner Haskellers
  • Dfa.lhs, finite automata (literate Bird-style Haskell)

2 Application code

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

  • GHC, a Haskell compiler (literate latex style) (home)
  • c2hs, a C to Haskell interface generator (home)
  • hmp3, a curses mp3 player


3 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).
A tour of the Haskell Monad functions
Small usage examples of the basic Haskell monad functions