vix.ing · top · new · best · stats · spec

Tracing monadic computations and representing effects

2012/02/14 by Maciej Piróg, Jeremy Gibbons
Computer Science · #cs.PL

paper · pdf · doi:10.4204/eptcs.76.8

published as EPTCS 76, 2012, pp. 90-111 · In Proceedings MSFP 2012, arXiv:1202.2407

arxiv created 2012/02/14 · arxiv updated 2012/02/15

Abstract

In functional programming, monads are supposed to encapsulate computations, effectfully producing the final result, but keeping to themselves the means of acquiring it. For various reasons, we sometimes want to reveal the internals of a computation. To make that possible, in this paper we introduce monad transformers that add the ability to automatically accumulate observations about the course of execution as an effect. We discover that if we treat the resulting trace as the actual result of the computation, we can find new functionality in existing monads, notably when working with non-terminating computations.

Citations