[Haskell] Are there libraries for finite words and computable functions?

Johannes Waldmann waldmann at imn.htwk-leipzig.de
Mon Apr 25 04:24:07 EDT 2005

> With "computable functions" I mean recursive functions,
> Turing machines, register machines or something like that.

my project "autotool" contains various models of computation.
the program in fact can automatically grade student exercises
that use these models.

-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
---- http://www.imn.htwk-leipzig.de/~waldmann/ -------

More information about the Haskell mailing list