Categorical Views on Computations on Trees (Extended Abstract)

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

Documents Related by Co-Citation

302 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
36 Data types à la carte – Wouter Swierstra
18 Uniform boilerplate and list processing, in – N Mitchell, C Runciman
25 Generic programming with fixed points for mutually – Alexey Rodriguez, Stefan Holdermans, Andres Löh, Johan Jeuring - 2008
20 Generic Downwards Accumulations – Jeremy Gibbons - 2000
32 Benefits of Tree Transducers for Optimizing Functional Programs – Armin Kühnemann - 1998
28 Upwards and downwards accumulations on trees – J Gibbons - 1993
7 Formal Efficiency Analysis for Tree Transducer Composition – Janis Voigtländer - 2004
8 T.: Compositional Data Types – Patrick Bahr, Tom Hvitved - 2011
402 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
57 Playing by the rules: rewriting as a practical optimisation technique in GHC – Simon Peyton Jones, Andrew Tolmach, Tony Hoare
149 Tree automata techniques and applications – Hubert Comon, Max Dauchet, Florent Jacquemard, Denis Lugiez, Sophie Tison, Marc Tommasi - 1997
1 T.: Compdata (2012), http://hackage.haskell.org/ package/compdata, module Data.Comp.Automata – P Bahr, Hvitved
3 Towards Modular Compilers for Effects – Laurence E. Day, Graham Hutton
97 and Order in Algorithmics – Law - 1992
4 Haskell 2010 Language Report – Simon Marlow
4 Strongly typed heterogeneous collections, in: Haskell ’04 – O Kiselyov, R Lämmel, K Schupke - 2004
8 W.: Attribute grammars fly first-class: How to do aspect oriented programming in haskell – M Viera, S D Swierstra, Swierstra - 2009
30 Automata in general algebras – S Eilenberg, J Wright - 1967