Difference between revisions of "Example code"
Jump to navigation
Jump to search
(Obsolete links removed, commented out, or updated (more to do)) |
(→Examples: Redirected link to the Web Archive) |
||
| (8 intermediate revisions by 3 users not shown) | |||
| Line 8: | Line 8: | ||
More code may be found [http://www.haskell.org/haskellwiki/Category:Code on the wiki]. |
More code may be found [http://www.haskell.org/haskellwiki/Category:Code on the wiki]. |
||
| ⚫ | |||
| + | Some lines are commented out for later update |
||
| ⚫ | |||
=== Library code === |
=== Library code === |
||
| Line 20: | Line 23: | ||
* [[Simple_Unix_tools | Unix.hs]], simple unix tools, for beginner Haskellers |
* [[Simple_Unix_tools | Unix.hs]], simple unix tools, for beginner Haskellers |
||
| − | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data |
+ | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data.List.html Data.List], the standard list library ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Data-List.html docs]) |
| − | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data |
+ | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data.Maybe.html Data.Maybe], the <code>Maybe</code> type ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Data-Maybe.html docs]) |
| − | * [http://hackage.haskell.org/packages/archive/containers/latest/doc/html/src/Data |
+ | * [http://hackage.haskell.org/packages/archive/containers/latest/doc/html/src/Data.Map.html Data.Map], the standard finite map ([http://www.haskell.org/ghc/docs/latest/html/libraries/containers-0.4.2.1/index.html docs]) |
| − | * [http://hackage.haskell.org/packages/archive/containers/latest/doc/html/src/Data |
+ | * [http://hackage.haskell.org/packages/archive/containers/latest/doc/html/src/Data.Graph.html Data.Graph], a graph type ([http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-Graph.html docs]) |
| − | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Control |
+ | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Control.Monad.html Control.Monad], basic monad support ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Control-Monad.html docs]) |
| − | * [ |
+ | * [https://github.com/nick8325/quickcheck QuickCheck], a testing framework ([http://hackage.haskell.org/package/QuickCheck docs]) |
* [http://hackage.haskell.org/packages/archive/pretty/latest/doc/html/src/Text-PrettyPrint-HughesPJ.html PrettyPrint.hs], a pretty printing library ([http://hackage.haskell.org/package/pretty docs]) |
* [http://hackage.haskell.org/packages/archive/pretty/latest/doc/html/src/Text-PrettyPrint-HughesPJ.html PrettyPrint.hs], a pretty printing library ([http://hackage.haskell.org/package/pretty docs]) |
||
| + | |||
| ⚫ | |||
| − | * [http:// |
+ | * [http://hackage.haskell.org/packages/archive/transformers/latest/doc/html/src/Control-Monad-Trans-State-Lazy.html Control.Monad.Trans.State.Lazy], a state monad ([http://hackage.haskell.org/packages/archive/transformers/latest/doc/html/Control-Monad-Trans-State-Lazy.html docs]) |
| ⚫ | |||
<!-- |
<!-- |
||
* [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:// |
+ | * [http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/Data.Foldable.html Data.Foldable], traversable data structures ([http://hackage.haskell.org/packages/archive/base/latest/doc/html/Data-Foldable.html docs]) |
| − | * [ |
+ | * [https://github.com/haskell/bytestring Data.ByteString], 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 SmallCheck], 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 ...] |
||
| Line 62: | Line 66: | ||
--> |
--> |
||
* [http://svn.openfoundry.org/pugs/src/Pugs/Eval.hs Pugs], a perl6 implementation ([http://pugscode.org home]) |
* [http://svn.openfoundry.org/pugs/src/Pugs/Eval.hs Pugs], a perl6 implementation ([http://pugscode.org home]) |
||
| + | |||
| − | * [http://www.cse.unsw.edu.au/~dons/code/yi/Yi/Core.hs Yi], a text editor, ([http://www.cse.unsw.edu.au/~dons/yi.html home]) |
||
| + | * [https://github.com/yi-editor/yi/blob/master/yi-core/src/Yi/Core.hs Yi], a text editor, ([http://www.haskell.org/haskellwiki/Yi home], [https://raw.githubusercontent.com/yi-editor/yi/master/yi-core/src/Yi/Core.hs raw], [http://hackage.haskell.org/package/yi doc]) |
||
| − | * [http://j.mongers.org/pub/haskell/darcs/conjure/Conjure/Torrent.hs Conjure], a bittorrent client |
||
<!-- |
<!-- |
||
* [http://darcs.haskell.org/~lemmih/downNova/src/Torrent.hs DownNova], a file downloading program |
* [http://darcs.haskell.org/~lemmih/downNova/src/Torrent.hs DownNova], a file downloading program |
||
--> |
--> |
||
| + | |||
| − | * [http://www.cs.york.ac.uk/fp/darcs/cpphs/Language/Preprocessor/Cpphs/Tokenise.hs cpphs], an implementation of the C preprocessor ([ |
+ | * [http://www.cs.york.ac.uk/fp/darcs/cpphs/Language/Preprocessor/Cpphs/Tokenise.hs cpphs], an implementation of the C preprocessor ([https://archives.haskell.org/projects.haskell.org/cpphs/ home]) |
| + | |||
* [http://darcs.haskell.org/ghc/compiler/simplCore/Simplify.lhs GHC], a Haskell compiler (literate latex style) ([http://www.haskell.org/ghc/ home]) |
* [http://darcs.haskell.org/ghc/compiler/simplCore/Simplify.lhs GHC], a Haskell compiler (literate latex style) ([http://www.haskell.org/ghc/ home]) |
||
| + | |||
* [http://darcs.augustsson.net/Darcs/Djinn/Djinn/LJT.hs Djinn], a theorem prover ([http://darcs.augustsson.net/Darcs/Djinn/ home]) |
* [http://darcs.augustsson.net/Darcs/Djinn/Djinn/LJT.hs Djinn], a theorem prover ([http://darcs.augustsson.net/Darcs/Djinn/ home]) |
||
| + | |||
| − | * [http://code.haskell.org/c2hs/src/C2HS/C/Trav.hs c2hs], a C to Haskell interface generator ([http://www.cse.unsw.edu.au/~chak/haskell/c2hs/ home]) |
||
| − | * [http:// |
+ | * [http://code.haskell.org/c2hs/src/C2HS/C/Trav.hs c2hs], a C to Haskell interface generator ([https://github.com/haskell/c2hs home]) |
| + | |||
| ⚫ | |||
| + | * [http://code.haskell.org/lambdabot/LBState.hs Lambdabot], an IRC bot ([http://www.haskell.org/haskellwiki/Lambdabot home]) |
||
| + | |||
| ⚫ | |||
| + | |||
* [http://www.haskell.org/haskellwiki/Darcs_repositories More code ...] |
* [http://www.haskell.org/haskellwiki/Darcs_repositories More code ...] |
||
| Line 79: | Line 90: | ||
; [[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). |
; [[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). |
||
| − | ; [ |
+ | ; [https://web.archive.org/web/20201109033750/members.chello.nl/hjgtuyl/tourdemonad.html A tour of the Haskell Monad functions]: Small usage examples of the basic Haskell monad functions |
[[Category:Code]] |
[[Category:Code]] |
||
Latest revision as of 11:17, 22 October 2022
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.
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 Prelude.hs, foundational Haskell library (docs)
- Unix.hs, simple unix tools, for beginner Haskellers
- Data.Maybe, the
Maybetype (docs)
- Data.Graph, a graph type (docs)
- Control.Monad, basic monad support (docs)
- QuickCheck, a testing framework (docs)
- PrettyPrint.hs, a pretty printing library (docs)
- Control.Monad.Trans.State.Lazy, a state monad (docs)
- Dfa.lhs, finite automata (literate Bird-style Haskell)
- RedBlackTree.hs, a red-black tree
- Data.Foldable, traversable data structures (docs)
- Data.ByteString, high-performance string type (raw, docs)
- SmallCheck, a testing framework (raw, docs)
Application code
Code from popular Haskell applications. Such code often makes use of a monadic IO, and sometimes other advanced features such as concurrency:
- hmp3, a curses mp3 player
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