# Difference between revisions of "Example code"

DonStewart (talk | contribs) (a nicer Maybe.hs) |
DonStewart (talk | contribs) (Tree.hs isn't so useful) |
||

Line 12: | Line 12: | ||

* [http://www.cse.unsw.edu.au/~dons/data/Maybe.hs Maybe.hs], the <code>Maybe</code> type |
* [http://www.cse.unsw.edu.au/~dons/data/Maybe.hs Maybe.hs], the <code>Maybe</code> type |
||

* [http://darcs.haskell.org/packages/base/Data/Map.hs Map.hs], the standard finite map |
* [http://darcs.haskell.org/packages/base/Data/Map.hs Map.hs], the standard finite map |
||

− | * [http://darcs.haskell.org/packages/base/Data/Tree.hs Tree.hs], a tree type |
||

* [http://darcs.haskell.org/packages/base/Data/Graph.hs Graph.hs], a graph type |
* [http://darcs.haskell.org/packages/base/Data/Graph.hs Graph.hs], a graph type |
||

* [http://darcs.haskell.org/packages/base/Control/Monad.hs Monad.hs], basic monadic support |
* [http://darcs.haskell.org/packages/base/Control/Monad.hs Monad.hs], basic monadic support |

## Revision as of 05:06, 17 September 2006

To get a feel for what real world Haskell looks like, here are some examples from various popular Haskell projects.

### 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:

- A Haskell98 Prelude.hs, foundational Haskell library
- List.hs, the standard list library
- Maybe.hs, the
`Maybe`

type - Map.hs, the standard finite map
- Graph.hs, a graph type
- Monad.hs, basic monadic support
- QuickCheck.hs, a testing framework
- PrettyPrint.hs, a pretty printing library
- StateT.hs, a monad transformer library
- Music.lhs, a music composition system (literate latex-style Haskell)
- Dfa.lhs, finite automata (literate Bird-style Haskell)
- RedBlackTree.hs, a red-black tree
- Prime.hs, prime numbers
- Foldable.hs, traversable data structures
- ByteString.hs, high-performance string type
- Combinators.hs, array combinators
- SmallCheck.hs, a testing framework
- 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)
- Pugs, a perl6 implementation
- Yi, a text editor
- Conjure, a bittorrent client
- DownNova, a file downloading program
- cpphs, an implementation of the C preprocessor
- GHC, a Haskell compiler (literate latex style)
- Djinn, a theorem prover
- c2hs, a C to Haskell interface generator
- Lambdabot, an IRC bot
- hmp3, an curses mp3 player
- More code ...

### Wiki examples

Here is a list of other random code collected on this wiki, replacing CodeOnTheWiki. Contributors of code to the old area are encouraged to bring their code over here. This should only be done by the original author because anything on these pages is automatically licensed under the Simple Permissive License (HaskellWiki:Copyrights).

Most examples are roughly intermediate to advanced in difficulty.

- Prelude extensions: Simple things you've always wished were in the Prelude.
- Gallery: Complete small programs.
- Blow your mind: Short, useful, cool, magical examples, which should incite the reader's curiosity and (hopefully) lead him to a deeper understanding of advanced Haskell concepts.
- Sudoku: Solvers for popular puzzle Sudoku
- NewMonads: Useful monads that are not in the main library.
- PrincipalVariationSearch: Principal variation search
- Shootout Entries: Examples still on the old wiki for the The Computer Language Shootout Benchmarks.
- Ralf Hinze maintains a Haskell software page