Debugging and understanding "tying the knot" in a monadic context...

Functional Pearl: Implementing trace in JavaScript...

How can I avoid <<loop>> in Haskell?...

Level-order repminPrint...

Birecursively defining a doubly infinite list of lists...

Patching a recursively-defined list without a <<loop>>...

Equational reasoning with tying the knot...

Is it possible to do a search on a graph constructed with the tying-the-knot strategy?...

Is there any way to convenient way to express graphs using the tying-the-knot strategy?...

Non-exhaustive patterns in aux function for tying the knot...

Why doesn't `iterate` from the Prelude tie the knot?...

Tie-the-knot in 2 dimensions (was: tying the knot with a comonad)...

Tying the knot on mutually recursive ADTs with well-typed error handling...

Lazily Tying the Knot for 1 Dimensional Dynamic Programming...

Self-reference in data structure – Checking for equality...

Any methods for recovering enough laziness to tie the knot in a monad?...

Tying the Knot with a State monad...

Debugging unwanted strictness?...

Bug in Data.Map implementation?...

Using Cont to acquire values from the future and the past...

Mutually recursive evaluator in Haskell...

Explanation of “tying the knot”...

letrec in Scala? (Immutable way to "Tie the knot?")...