New language feature: array-types

Lennart Augustsson lennart at
Mon Aug 18 03:29:25 EDT 2008

Have a look at

On Mon, Aug 18, 2008 at 8:16 AM, Ramin Honary <ramin.honary at> wrote:
> Really? Where the bounds checking can be done at compile-time? (Excluding
> cases where the array object is accessed by a constant value set at
> run-time...)
> I have seen an array type, but not a "bounded array" type where the size of
> the array is given in the type definition, (as I explained with the example
> in my last e-mail.)
> Then is there any work being done in Haskell prime to improve the efficiency
> of updating arrays. From the wiki pages I have read, it is impossible to
> make any array that updates faster than O(n).
> (Also, should I send replies to the haskell wiki?)

More information about the Haskell-prime mailing list