[Haskell] Are there libraries for finite words and computable
Frank.Rosemeier at FernUni-Hagen.de
Mon Apr 25 04:16:34 EDT 2005
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!
More information about the Haskell