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