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

Patrick Bahr

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

Computer Science

Research output: Conference Article in Proceeding or Book/Report chapter › Book chapter › Research › peer-review

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.

Original language	Undefined/Unknown
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
Pages	38-40
Publication status	Published - 1 Oct 2011

Access to Document

http://www.mrtc.mdh.se/nwpt2011/index.php?choice=program

Cite this

@inbook{f9c7e521c823422e8eb9868d2f09448d,

title = "Evaluation {\`a} la Carte: Non-Strict Evaluation via Compositional Data Types",

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.",

keywords = "monads,tree transformations,evaluation strategies,Haskell,generic programming",

author = "Patrick Bahr",

year = "2011",

month = oct,

day = "1",

language = "Udefineret/Ukendt",

pages = "38--40",

editor = "Paul Pettersson and Cristina Seceleanu",

booktitle = "Proceedings of the 23rd Nordic Workshop on Programming Theory",

}

TY - CHAP

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

AU - Bahr, Patrick

PY - 2011/10/1

Y1 - 2011/10/1

N2 - 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.

AB - 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.

KW - monads,tree transformations,evaluation strategies,Haskell,generic programming

M3 - Bidrag til bog/antologi

SP - 38

EP - 40

BT - Proceedings of the 23rd Nordic Workshop on Programming Theory

A2 - Pettersson, Paul

A2 - Seceleanu, Cristina

ER -