Fix link to TreeLog README

Author: armanbilge

collections/_posts/2013-10-18-treelog.md

@@ -23,7 +23,7 @@ There are a number of problems with this approach:
 
 Treelog resolves these issues by making the log itself a tree, reflecting the computational tree it logs, and uses techniques described in the [Typeclassopedia](http://www.haskell.org/wikiupload/e/e9/Typeclassopedia.pdf) to bring logging closer to the computation: the `Writer` Monad, a Monad Transformer, and a cunning Monoid.
 
-Note that this post is a more technical description of how Treelog was written. For a quick introduction of use please refer to the README.
+Note that this post is a more technical description of how Treelog was written. For a quick introduction of use please refer to the [README].
 I will also refer you to Eugene Yokota's [excellent Scalaz tutorial](http://eed3si9n.com/learning-scalaz/) to study the details of Scalaz where appropriate.
 
 Logging with Treelog
@@ -87,7 +87,7 @@ Syntactic Sugar
 
 Treelog makes use of some syntactic sugar inspired by [Tony Morris's post](http://blog.tmorris.net/posts/the-writer-monad-using-scala-example/) on `Writer`. In the example above, `~>` is a method on an implicitly constructed class which takes any value `x: T` and returns a `DescribedComputation[T]`, representing the value `x` and a leaf node containing the description.
 
-There is special support for `Boolean`s, `Option`s, `Either`s and `Traversable`s which you can learn about from the Treelog README.
+There is special support for `Boolean`s, `Option`s, `Either`s and `Traversable`s which you can learn about from the Treelog [README].
 
 `Writer` and Monoid
 -------------------
@@ -192,3 +192,6 @@ Further Reading
 
 - [Monad Transformers in Scala](http://debasishg.blogspot.co.uk/2011/07/monad-transformers-in-scala.html)
 - [Monad Transformers in the Wild](http://www.slideshare.net/StackMob/monad-transformers-in-the-wild)
+
+[README]: https://github.com/lancewalton/treelog/blob/main/README.md
+