Tying the Knot

Introduction

This example illustrates different ways to define recursive data structures. To demonstrate the different techniques we show how to solve the same problem---writing an interpreter for a simple programming language---in three different ways. This is a nice example because, (i) it is interesting, (ii) the abstract syntax of the language contains mutually recursive structures, and (iii) the interpreter illustrates how to work with the recursive structures.

(It would be useful to have some more text describing the examples.)

Download the files

• Direct Recursion
• Tying the Knot
• Tying the Knot with GADTs

See Also

http://haskell.org/wikisnapshot/TyingTheKnot.html