We present a new formalism of labelled binary trees, using two partial binary constructors instead of the usual total ternary constructor. This formalism is complemented by some higher-order operators, encapsulating common patterns of computation on trees. We explore their use by deriving solutions to a couple of algorithmic problems on trees.
The work proceeds in the Bird-Meertens style. This is a calculus for programs, closely related to applicative programming languages. Expressions ar...Expand abstract
- Publication date:
- Local pid:
- Copyright date:
A New View of Binary Trees
If you are the owner of this record, you can report an update to it here: Report update to this record