Understanding Idiomatic Traversals Backwards and Forwards
We present new ways of reasoning about a particular class of effectful Haskell programs, namely those expressed as idiomatic traversals. Starting out with a specific problem about labelling and unlabelling binary trees, we extract a general inversion law, applicable to any monad, relating a traversa...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference item |
| Published: |
2013
|