Imagine a version of the
State monad where the state is an integer, the state always starts at
0, and there’s a single operation
next which gets you the next number. Let’s call it the
Count monad. We can write this kind of thing pretty easily by copying from
CountT looks like
StateT except the state type is specialized to
innerRunCountT because we’ll want to hide it. Instead, we can use this version that always initializes the count to 0:
Count monad is just
The Functor, Applicative, and Monad instances for
CountT m look just like the ones for
StateT m, so we can skip over them here.
Consider this definition of a binary tree.
Let’s introduce a version of this type with an “annotation”. In our case, we’ll want to label each node with a unique integer, starting from 0.
We can easily do this (and any other similar labeling task) with the
label :: Tree a -> Count (AnnTree Integer a) label Empty = pure AnnEmpty label (Tree val left right) = do n <- next labeledLeft <- label left labeledRight <- label right pure $ AnnTree n val labeledLeft labeledRight labeledTree :: AnnTree Integer a labeledTree = fst . runCount . label $ _your_tree_here
Next, consider this naive function that calculates the nth Fibonacci number.
We want to find out how many times this function runs if we invoke it with
fib 20. Sounds like a job for
First, we wrap our function in
runCount $ countFib 20 and get
(6765,21891). The first number is the 20th Fibonacci number, and the second number is the number of times
countFib was invoked to find it.