| Reasoning About Effects: Seeing the Wood Through the Trees (Extended Version) (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Pure functional languages such as Haskell support programming with impure effects by exploiting mathematical notions such as monads, applicative functors, and arrows. However, in contrast to the wealth of research on the use of these notions to write effectful programs, there has been comparatively little progress on reasoning about the resulting programs. In this article we focus on this problem, using a simple but instructive example concerned with relabelling binary trees. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||