Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Brent Yorgey
committed
Sep 28, 2012
1 parent
8f2e052
commit 1ac6ca0
Showing
1 changed file
with
20 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
[![Build Status](https://secure.travis-ci.org/diagrams/dual-tree.png)](http://travis-ci.org/diagrams/dual-tree) | ||
|
||
Rose (n-ary) trees with both upwards- (*i.e.* cached) and | ||
downwards-traveling (*i.e.* accumulating) monoidal annotations. This | ||
is used as the core data structure underlying the | ||
[diagrams framework](http://projects.haskell.org/diagrams), but | ||
potentially has other applications as well. | ||
|
||
Abstractly, a `DUALTree` is a rose (n-ary) tree with data of one type | ||
at leaves, data of another type at internal nodes, and two types of | ||
monoidal annotations, one travelling "up" the tree and | ||
one traveling "down". | ||
|
||
For a bit of background and motivation, see the paper | ||
|
||
[Brent Yorgey. *Monoids: Theme and Variations*.](http://www.cis.upenn.edu/~byorgey/pub/monoid-pearl.pdf) Haskell Symposium, 2012. | ||
|
||
To install, | ||
|
||
cabal install dual-tree |