[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell-cafe
Subject:    Re: [Haskell-cafe] ANN: fixed-list -- A fixed length list library
From:       Khudyakov Alexey <alexey.skladnoy () gmail ! com>
Date:       2010-03-21 12:58:20
Message-ID: 201003211600.16159.alexey.skladnoy () gmail ! com
[Download RAW message or body]

В сообщении от 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. 2^20 is pretty big 
number. 

There is article on haskell wiki[1]. And implementation by Oleg Kiselyov[2].

http://www.haskell.org/haskellwiki/Type_arithmetic
http://article.gmane.org/gmane.comp.lang.haskell.general/13223
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

[prev in list] [next in list] [prev in thread] [next in thread]