{"repository":{"description":"Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.","watchers":3,"stargazers":3,"forks":0,"fork":false,"size":178,"owner":"diagrams","private":false,"open_issues":2,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Haskell","created_at":"2012-07-24T16:41:22-07:00","pushed_at":"2013-07-15T19:11:59-07:00","master_branch":"master","organization":"diagrams"},"actor_attributes":{"type":"User","name":"Brent Yorgey","company":"University of Pennsylvania","blog":"http://www.cis.upenn.edu/~byorgey/","location":"Philadelphia, PA, USA","email":"4bec4a72971766cbb1400079ae28c198e4423a64@gmail.com"},"url":"https://github.com/diagrams/dual-tree/tree/v0.1.0.3"}