[Haskell-cafe] Iteratee stack-consumption
Tony Morris
tonymorris at gmail.com
Mon May 30 08:08:50 CEST 2011
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
I have written iteratees on the JVM, which does not include tail-call
in its instruction set. They incur a stack frame per iteratee input,
which can be expensive and unable to scale beyond a few thousand. Is
there some trick to permitting this? Some sort of chunking the
enumeratee or something? I was unable to find any good general hints
in any of the hackage libraries.
Thanks for any pointers.
- --
Tony Morris
http://tmorris.net/
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.10 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/
iEYEARECAAYFAk3jNHEACgkQmnpgrYe6r63QcACfSeZvvy+iYVisZ3e/dhWQd3D6
790AnRZCjJT6eCY21XlsVqcpTuamfuXY
=ADo5
-----END PGP SIGNATURE-----
More information about the Haskell-Cafe
mailing list