Are there libraries for finite words and computable functions?
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
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. http://www.imn.htwk-leipzig.de/~waldmann/autotool.html http://141.57.11.163/auto/ -- -- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 -- ---- http://www.imn.htwk-leipzig.de/~waldmann/ -------
Dear Haskellers, I am a beginer of the haskell language and still not familiar with it. Could anybody tell me, is there an implementation for the Java VM? It looks that hugs/ghc and other implementation are both implemented using C. Thanks Wangzx
participants (3)
-
Frank Rosemeier -
Johannes Waldmann -
wangzaixiang