Thesis icon

Thesis

A New View of Binary Trees

Abstract:

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

Actions


Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical and Life Sciences Division - Department of Computer Science
Publication date:
1988
URN:
uuid:0ed98904-71e5-46ab-bca0-5eeb57b8ca08
Local pid:
cs:2339

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP