Categorical Views on Computations on Trees (Extended Abstract)

by Ichiro Hasuo , Bart Jacobs , Tarmo Uustalu
Citations:1 - 0 self

Active Bibliography

11 The essence of dataflow programming – Tarmo Uustalu, Varmo Vene - 2005
3 Freyd is Kleisli, for arrows – Bart Jacobs, Ichiro Hasuo - 2006
2 The essence of dataflow programming (short version – Tarmo Uustalu, Varmo Vene - 2005
10 Arrows, like monads, are monoids – Chris Heunen, Bart Jacobs - 2006
7 A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars – Frank Drewes - 1997
2 Compositions of bottom-up tree series transformations – Andreas Maletti - 2005
15 Decidability of the Finiteness of Ranges of Tree Transductions – Frank Drewes, Joost Engelfriet - 1996
3 A Strict Border for the Decidability of E-Unification for Recursive Functions – Sebastian Maneth, Heinz Faßbender - 1998
9 TREEBAG - A Tree-Based Generator for Objects of Various Types – Frank Drewes - 1998
81 Training Tree Transducers – Jonathan Graehl, Kevin Knight - 2004
6 Monads Need Not Be Endofunctors – Thorsten Altenkirch, James Chapman, Tarmo Uustalu
1 Monad Transformers as Monoid Transformers – Mauro Jaskelioff
5 Coalgebraic Components in a Many-Sorted Microcosm – Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokolova
9 Representations of stream processors using nested fixed points – Peter Hancock, Dirk Pattinson, Neil Ghani
REPRESENTATIONS OF STREAM PROCESSORS USING NESTED FIXED POINTS – Peter Hancock A, Dirk Pattinson B, Neil Ghani C - 2008
1 Higher-Order Functional Reactive Programming in Bounded Space – Neelakantan R. Krishnaswami, Nick Benton, Jan Hoffmann
Tree-Series-to-Tree-Series Transformations – Andreas Maletti
7 Compositions of Tree Series Transformations – A. Maletti - 2005
1 Compositions of Top-down Tree Transducers with "-rules – Andreas Maletti, Heiko Vogler