Evaluation à la carte: non-strict evaluation via compositional data types
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- extended abstract
Accepted author manuscript, 85.7 KB, PDF document
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 language | English |
---|---|
Title of host publication | Proceedings of the 23rd Nordic Workshop on Programming Theory |
Editors | Paul Pettersson, Cristina Seceleanu |
Number of pages | 3 |
Publisher | Mälardalen University |
Publication date | 2011 |
Pages | 38-40 |
Publication status | Published - 2011 |
Event | 23rd Nordic Workshop on Programming Theory - Västerås, Sweden Duration: 26 Oct 2011 → 28 Oct 2011 Conference number: 23 |
Conference
Conference | 23rd Nordic Workshop on Programming Theory |
---|---|
Nummer | 23 |
Land | Sweden |
By | Västerås |
Periode | 26/10/2011 → 28/10/2011 |
Series | Technical Report |
---|---|
Volume | 254 |
ISSN | 1404-3041 |
- Faculty of Science - monads, tree transformations, evaluation strategies, Haskell, generic programming
Research areas
Links
- http://www.mrtc.mdh.se/nwpt2011/index.php?choice=program
Final published version
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 35249189