Personal tools

Tying the Knot

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
Line 2: Line 2:
   
 
This example illustrates different ways to define recursive data structures.
 
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 recursive 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.)
 
(It would be useful to have some more text describing the examples.)

Revision as of 21:57, 10 January 2007

1 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.)

2 Download the Files