We describe how to perform monadic computations
over recursive data structures with fine grained control
over the evaluation strategy. This solves the issue
that the definition of a recursive monadic function
already determines the evaluation strategy due
to the necessary sequencing of the monadic operations.
We show that compositional data types already
provide the structure needed in order to delay
monadic computations at any point of the computation.