Computations on trees form a classical topic in computing. These computations can be described in terms of machines (typically called tree transducers), or in terms of functions. This paper focuses on three flavors of bottom-up computations, of increasing generality. It brings categorical clarity by identifying a category of tree transducers together with two different behavior functors. The first sends a tree transducer to a coKleisli or biKleisli map (describing the contribution of each local node in an input tree to the global transformation) and the second to a tree function (the global tree transformation). The first behavior functor has an adjoint realization functor, like in Goguen's early work on automata. Further categorical structure, in the form of Hughes's Arrows, appears in properly parameterized versions of these structures. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Hasuo, I., Jacobs, B., & Uustalu, T. (2007). Categorical views on computations on trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 619–630). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_54
Mendeley helps you to discover research relevant for your work.