Efficiency of list indices in definitions

[Andrew J Bromage]

G'day all.

> Now, we get to the heart of my question.  This definition is quite
> lovely, recursive and lazy, but it doesn't actually capture the
> recurrent structure of the resulting automata.

Unfortunately the wiki is down at the moment, otherwise I would point
you to:

	http://haskell.org/wiki/wiki?TyingTheKnot

Basically, to execute the finite automaton directly, you can turn
the indirect recursion into direct recursion via an intermediate
dictionary structure.

Something else you may find interesting is this:

	http://haskell.org/wiki/wiki?RunTimeCompilation

Please fix the wiki!

Cheers,
Andrew Bromage