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

Patrick Bahr

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

Patrick Bahr

Datalogisk Institut

2059 Downloads (Pure)

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.

Originalsprog	Engelsk
Titel	Proceedings of the 23rd Nordic Workshop on Programming Theory
Redaktører	Paul Pettersson, Cristina Seceleanu
Antal sider	3
Forlag	Mälardalen University
Publikationsdato	2011
Sider	38-40
Status	Udgivet - 2011
Begivenhed	23rd Nordic Workshop on Programming Theory - Västerås, Sverige Varighed: 26 okt. 2011 → 28 okt. 2011 Konferencens nummer: 23

Konference

Konference	23rd Nordic Workshop on Programming Theory
Nummer	23
Land/Område	Sverige
By	Västerås
Periode	26/10/2011 → 28/10/2011

Navn	Technical Report
Vol/bind	254
ISSN	1404-3041

Emneord

Det Natur- og Biovidenskabelige Fakultet

Adgang til dokumentet

extended abstractAccepteret manuskript, 85,7 KB

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

Citationsformater

Evaluation à la carte : non-strict evaluation via compositional data types. / Bahr, Patrick.

Proceedings of the 23rd Nordic Workshop on Programming Theory. red. / Paul Pettersson; Cristina Seceleanu. Mälardalen University, 2011. s. 38-40 (Technical Report, Bind 254).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Bahr, P 2011, Evaluation à la carte: non-strict evaluation via compositional data types. i P Pettersson & C Seceleanu (red), Proceedings of the 23rd Nordic Workshop on Programming Theory. Mälardalen University, Technical Report, bind 254, s. 38-40, 23rd Nordic Workshop on Programming Theory, Västerås, Sverige, 26/10/2011. <http://www.mrtc.mdh.se/nwpt2011/index.php?choice=program>

@inproceedings{0c16a40ec8c34398b0542a7e7eb41757,

title = "Evaluation {\`a} la carte: non-strict evaluation via compositional data types",

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

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

author = "Patrick Bahr",

year = "2011",

language = "English",

series = "Technical Report",

pages = "38--40",

editor = "Paul Pettersson and Cristina Seceleanu",

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

publisher = "M{\"a}lardalen University",

note = "23rd Nordic Workshop on Programming Theory ; Conference date: 26-10-2011 Through 28-10-2011",

}

TY - GEN

T1 - Evaluation à la carte

T2 - 23rd Nordic Workshop on Programming Theory

AU - Bahr, Patrick

N1 - Conference code: 23

PY - 2011

Y1 - 2011

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

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

KW - Faculty of Science

KW - monads

KW - tree transformations

KW - evaluation strategies

KW - Haskell

KW - generic programming

M3 - Article in proceedings

T3 - Technical Report

SP - 38

EP - 40

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

A2 - Pettersson, Paul

A2 - Seceleanu, Cristina

PB - Mälardalen University

Y2 - 26 October 2011 through 28 October 2011

ER -