Dear Haskellers,
I would like to know if there are Haskell libraries for finite words and recursive functions.
With "finite words" I refer to a datatype similar to data Word a = Nil | Cons a !(Word a) .
With "computable functions" I mean recursive functions, Turing machines, register machines or something like that.
Thank you very much!
Frank Rosemeier _______________________________________________ Haskell mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell
