Difference between revisions of "Example code"

From HaskellWiki
Jump to: navigation, search
(More stuff)
(names)
Line 11: Line 11:
 
and can be rather optimised. Some instructive examples:
 
and can be rather optimised. Some instructive examples:
   
[http://darcs.haskell.org/packages/base/Data/List.hs List.hs]
+
[http://darcs.haskell.org/packages/base/Data/List.hs List.hs], the standard [a] type
   
[http://darcs.haskell.org/packages/base/Data/Map.hs Map.hs]
+
[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]
+
[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]
+
[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]
+
[http://darcs.haskell.org/packages/base/Control/Monad.hs Monad.hs], basic monadic support
   
[http://darcs.haskell.org/packages/QuickCheck/Test/QuickCheck.hs QuickCheck.hs]
+
[http://darcs.haskell.org/packages/QuickCheck/Test/QuickCheck.hs QuickCheck.hs], a testing framework
   
[http://darcs.haskell.org/packages/base/Text/PrettyPrint/HughesPJ.hs PrettyPrint.hs]
+
[http://darcs.haskell.org/packages/base/Text/PrettyPrint/HughesPJ.hs PrettyPrint.hs], a pretty printing library
   
[http://darcs.haskell.org/packages/monads/Monad/StateT.hs StateT.hs]
+
[http://darcs.haskell.org/packages/monads/Monad/StateT.hs StateT.hs], a monad transformer library
   
[http://www.ninebynine.org/Software/Swish-0.2.1/HaskellRDF/Dfa/Dfa.lhs Dfa.lhs]
 
  +
[http://darcs.haskell.org/haskore/src/Haskore/Music.lhs Music.hs], a music composition system
   
[http://www.polyomino.f2s.com/david/haskell/hs/redblacktree.hs.txt RedBlackTree.hs]
 
 
[http://www.ninebynine.org/Software/Swish-0.2.1/HaskellRDF/Dfa/Dfa.lhs Dfa.lhs], finite state machines
   
[http://andrew.bromage.org/darcs/numbertheory/Math/Prime.hs Prime.hs]
 
 
[http://www.polyomino.f2s.com/david/haskell/hs/redblacktree.hs.txt RedBlackTree.hs], a red-black tree
   
[http://darcs.haskell.org/packages/base/Data/Foldable.hs Foldable.hs]
+
[http://andrew.bromage.org/darcs/numbertheory/Math/Prime.hs Prime.hs], prime numbers
   
[http://darcs.haskell.org/packages/base/Data/ByteString.hs ByteString.hs]
+
[http://darcs.haskell.org/packages/base/Data/Foldable.hs Foldable.hs], traversable data structures
   
[http://darcs.haskell.org/packages/ndp/Data/Array/Parallel/Stream/Flat/Combinators.hs Combinators.hs]
+
[http://darcs.haskell.org/packages/base/Data/ByteString.hs ByteString.hs], high-performance string type
   
[http://www.cse.unsw.edu.au/~dons/code/lambdabot/scripts/SmallCheck.hs SmallCheck.hs]
 
  +
[http://darcs.haskell.org/packages/ndp/Data/Array/Parallel/Stream/Flat/Combinators.hs Combinators.hs], array combinators
  +
 
[http://www.cse.unsw.edu.au/~dons/code/lambdabot/scripts/SmallCheck.hs SmallCheck.hs], a testing framework
   
 
[http://haskell.org/haskellwiki/Darcs_repositories A large collection of online Haskell source]
 
[http://haskell.org/haskellwiki/Darcs_repositories A large collection of online Haskell source]

Revision as of 07:23, 14 September 2006

To get a feel for what real world Haskell looks like, here are some examples from various popular Haskell projects. Haskell code comes in three flavours: plane, literate Bird-style, and literate latex style. Additionally, cpp is sometimes used for preprocessing.

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:

List.hs, the standard [a] type

Map.hs, the standard finite map

Tree.hs, a tree type

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.hs, a music composition system

Dfa.lhs, finite state machines

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

A large collection of online Haskell source

Application code

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

Darcs, a revision control system (uses literate 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

Djinn, a theorem prover

c2hs, a C to Haskell interface generator

Lambdabot, an IRC bot

hmp3, an curses mp3 player

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

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.