论文标题
一阶树对树功能
First-order tree-to-tree functions
论文作者
论文摘要
我们研究了可以用一阶逻辑或单层二阶逻辑定义的树对树转化。我们证明了一个分解定理，该定理表明，可以使用组合物（例如功能组成），从树对树的同态或预定的遍历中获得每个转换。
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as tree-to-tree homomorphisms or pre-order traversal, by using combinators such as function composition.
