Tying the Knot
From HaskellWiki
(Difference between revisions)
| Line 1: | Line 1: | ||
This example illustrates different ways to define recursive data structures. | This example illustrates different ways to define recursive data structures. | ||
| + | == Download the files == | ||
* [[Image:Interp1.lhs|Direct Recursion]] | * [[Image:Interp1.lhs|Direct Recursion]] | ||
* [[Image:Interp2.lhs|Tying the Knot]] | * [[Image:Interp2.lhs|Tying the Knot]] | ||
* [[Image:Interp3.lhs|Tying the Knot with GADTS]] | * [[Image:Interp3.lhs|Tying the Knot with GADTS]] | ||
Revision as of 21:40, 10 January 2007
This example illustrates different ways to define recursive data structures.
