Thesis icon

Thesis

Algebras for tree algorithms

Abstract:

This thesis presents an investigation into the properties of various algebras of trees. In particular, we study the influence that the structure of a tree algebra has on the solution of algorithmic problems about trees in that algebra. The investigation is conducted within the framework provided by the Bird-Meertens formalism, a calculus for the construction of programs by equational reasoning from their specifications.

We present three different tree algebras: two kinds of binary tr...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Research group:
Programming Research Group
Oxford college:
Linacre College
Role:
Author

Contributors

Division:
MPLS
Department:
Computer Science
Role:
Supervisor
Publication date:
1991
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
UUID:
uuid:50ed112d-411d-486f-8631-6064138f4bf7
Local pid:
ora:11969
Language:
English
Keywords:
Subjects:

Terms of use


Metrics


Views and Downloads






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

TO TOP