Categorical Views on Computations on Trees (Extended Abstract)

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

Active Bibliography

18 The essence of dataflow programming – Tarmo Uustalu, Varmo Vene - 2005
4 Freyd is Kleisli, for arrows – Bart Jacobs, Ichiro Hasuo - 2006
2 The essence of dataflow programming (short version – Tarmo Uustalu, Varmo Vene - 2005
17 Decidability of the Finiteness of Ranges of Tree Transductions – Frank Drewes, Joost Engelfriet - 1996
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
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
102 Training Tree Transducers – Jonathan Graehl, Kevin Knight - 2004
9 Monads Need Not Be Endofunctors – Thorsten Altenkirch, James Chapman, Tarmo Uustalu
iv TABLE OF CONTENTS – Ross Tate, Bobby Mcferrin - 2012
2 Monad Transformers as Monoid Transformers – Mauro Jaskelioff
12 Arrows, like monads, are monoids – Chris Heunen, Bart Jacobs - 2006
CMCS 2010 Categorifying Computations into Components via Arrows as Profunctors – Kazuyuki Asada, Ichiro Hasuo
6 Coalgebraic Components in a Many-Sorted Microcosm – Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokolova
1 A Notation for Comonads – Dominic Orchard, Alan Mycroft
Universal Properties of Impure Programming Languages – Sam Staton, Paul Blain Levy, Premonoidal Categories
REPRESENTATIONS OF STREAM PROCESSORS USING NESTED FIXED POINTS – Peter Hancock A, Dirk Pattinson B, Neil Ghani C - 2008
15 Representations of stream processors using nested fixed points – Peter Hancock, Dirk Pattinson, Neil Ghani