Leaf trees

Leaf trees provide simple and efficient implementations of abstract datatypes that are related to so-called dynamic structures. For functions on such structures the notion of decomposability is defined. If operations defined on a dynamic structure can be expressed as decomposable functions, the leaf tree representing the structure is easily extended to accommodate efficient computations of function values. In a systematic, calculational way, decomposable functions are derived from the specifications of the required operations.