Summary

The international Colloquium on Trees in Algebra and Programming is an annual conference on Theoretical Computer Science. Its central theme is the algebraic and combinatorial properties of trees, graphs and other combinatorial objects that appear in many different fields of computer science. These include formal languages and automata, rewriting systems, complexity and validity of algorithms and programs, program schemes, concurrent processes, databases, data structures, specification methods, models of lambda-calculus, VLSI circuits and semantics of programming languages. However, trees and graphs have such a wide range of uses in computer science that no aspect is excluded. This book contains the twenty-two communications of the ninth colloquium held in Bordeaux, France in March 1984. Of these, three invited papers survey existing work in three different fields and nineteen present new results.