Hello,

Thanks for your answer Vanessa.

So you wouldn't say that, for instance, some of these extensions might provide room for more extensive
optimizations, seeing as they provide stronger guarantees (Non empty vectors and such) ?

Michel :)

On Fri, Apr 5, 2019 at 6:07 PM Vanessa McHale <vanessa.mchale@iohk.io> wrote:

I would not expect type system extensions to have any effect on the performance of generated code.

Cheers,
Vanessa McHale

On 4/5/19 10:19 AM, Michel Haber wrote:
Hello Cafe,

So I've been learning a bit about the GHC extensions from https://github.com/i-am-tom/haskell-exercises. But the lessons say nothing about how the extensions work behind the scenes.

For example, I've assumed that RankNTypes would require something similar to dynamic dispatch in imperative languages in order to work. But this is just an assumption.

So I was wondering where I can get a quick succinct read (or a summary at least) about how these extensions are implemented, as well as their performance cost (or gain!).

Also if someone knows other tutorials and lessons for these, and other extensions, please feel free to share them :p

Thank you,
Michel :)

_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.
_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.