Evaluation à la Carte: Non-Strict Evaluation via Compositional Data Types

Research output: Conference Article in Proceeding or Book/Report chapterBook chapterResearchpeer-review


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.
Original languageUndefined/Unknown
Title of host publicationProceedings of the 23rd Nordic Workshop on Programming Theory
EditorsPaul Pettersson, Cristina Seceleanu
Number of pages3
Publication date1 Oct 2011
Publication statusPublished - 1 Oct 2011

Cite this