Difference between revisions of "Tying the Knot"

From HaskellWiki
Jump to: navigation, search
(hawiki)
Line 5: Line 5:
   
 
(It would be useful to have some more text describing the examples.)
 
(It would be useful to have some more text describing the examples.)
 
== See also ==
 
 
* [http://haskell.org/hawiki/TyingTheKnot Hawiki]
 
   
 
== Download the files ==
 
== Download the files ==

Revision as of 23:27, 30 September 2007

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