Evaluation à la Carte: Non-Strict Evaluation via Compositional Data Types
- University of Copenhagen
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-review
Open access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-reviewOriginal language
Undefined/UnknownPages from-to (Number of pages)
Pages 38-40 (3 pages)Publication milestones
- Published - 01/10/2011
Publication status
Published - 01/10/2011
Host publication title
Proceedings of the 23rd Nordic Workshop on Programming TheoryHost publication editors
- Paul Pettersson
- Cristina Seceleanu
Abstract
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.