[Haskell-cafe] the last mile in haskell performance

[William Yager]

Also see
https://hackage.haskell.org/package/vector-0.11.0.0/docs/Data-Vector-Storable.html

On Thu, Nov 12, 2015 at 11:49 AM, Alberto G. Corona <agocorona at gmail.com>
wrote:

> Looking at this:
>
>
> https://downloads.haskell.org/~ghc/6.12.3/docs/html/users_guide/primitives.html
>
> It seems that it is impossible to manage data in Haskell within a core
> without L1 cache faults. Except for unboxed arrays of primitive types.
>
> Since it is impossible to have unboxed arrays of user-defined types.
>
> Am I right?
>
> This is definitively very bad for tasks that are inherently single
> threaded and in general for the image of Haskell as a practical language.
>
> I have more to say about that, but I would like to know first if I´m right
> and second If there is some idea to going on to permit user defined boxed
> datatypes.  Or if there is some low level trick for having it using foreign
> call and unsafeCoerce in some way,
>
> I know that the language ATS has unboxing a la carte....
>
> --
> Alberto.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20151112/6422a197/attachment.html>