Skip to content

Latest commit

 

History

24 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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, 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. Haskell Symposium, 2012.

To install,

    npm install
    bower install
    npm run build

Changelog

  • v0.0.2 Updated bower metadata and made component public.
  • v0.0.1 Initial release for use in higher-level libraries. Expect significant change.

About

A port of byorgy's dual-tree from Haskell

Resources

Stars

4 stars

Watchers

2 watching

Forks

Releases

Packages

Used by

Contributors

Languages