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.
|Title of host publication||Proceedings of the 23rd Nordic Workshop on Programming Theory|
|Editors||Paul Pettersson, Cristina Seceleanu|
|Number of pages||3|
|Publication date||1 Oct 2011|
|Publication status||Published - 1 Oct 2011|