Evaluation à la carte: non-strict evaluation via compositional data types

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Documents

Patrick Bahr

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.
Original languageEnglish
Title of host publicationProceedings of the 23rd Nordic Workshop on Programming Theory
EditorsPaul Pettersson, Cristina Seceleanu
Number of pages3
PublisherMälardalen University
Publication date2011
Pages38-40
Publication statusPublished - 2011
Event23rd Nordic Workshop on Programming Theory - Västerås, Sweden
Duration: 26 Oct 201128 Oct 2011
Conference number: 23

Conference

Conference23rd Nordic Workshop on Programming Theory
Nummer23
LandSweden
ByVästerås
Periode26/10/201128/10/2011
SeriesTechnical Report
Volume254
ISSN1404-3041

    Research areas

  • The Faculty of Science - monads, tree transformations, evaluation strategies, Haskell, generic programming

Number of downloads are based on statistics from Google Scholar and www.ku.dk


No data available

ID: 35249189