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. | ||
| - | * [[Image:Interp1.lhs]] | + | * [[Image:Interp1.lhs|Direct Recursion]] |
| - | * [[Image:Interp2.lhs]] | + | * [[Image:Interp2.lhs|Tying the Knot]] |
| - | * [[Image:Interp3.lhs]] | + | * [[Image:Interp3.lhs|Tying the Knot with GADTS]] |
Revision as of 21:37, 10 January 2007
This example illustrates different ways to define recursive data structures.
