Job Vranish job.vran...@gmail.com wrote:
Its main advantages are:
Very easy to use.
Almost entirely Haskell98 (the non Haskell98 pieces are not critical, just
nice)
The datatype is a member of Foldable, Traverable, Applicative, Monad,
etc...
Then length of the list is encoded in the
В сообщении от 21 марта 2010 09:37:26 Casey McCann написал:
Using head and tail on longer lists fails likewise. I expect there's
some way to make it work without simply increasing the stack depth,
but I'm not sure how. Any thoughts?
It's possible to use binary encoding for natural numbers.
Is there anything wrong with increasing the context stack? That's what I do
when I run into an overflow, and so far I haven't had any problems with it.
Generally my uses of FixedList involve relatively short lists (vectors and
such) so it usually isn't a problem.
I could implement a more
I uploaded a new fixed length list library to hackage:
http://hackage.haskell.org/package/fixed-list
Its main advantages are:
Very easy to use.
Almost entirely Haskell98 (the non Haskell98 pieces are not critical, just
nice)
The datatype is a member of Foldable, Traverable, Applicative,
