First-order tree-to-tree functions

Mikołaj Bojańczyk , Amina Doumane (1)

1 ENS de Lyon - École normale supérieure de Lyon

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.

Domaines: Informatique [cs]

Mikołaj Bojańczyk, Amina Doumane. First-order tree-to-tree functions. LICS, Aug 2020, Saarbrücken, Germany. ⟨10.1145/nnnnnnn.nnnnnnn⟩. ⟨hal-03404542⟩