There's also documentation about rewrite rules on the Haskell en GHC wikis:
http://haskell.org/haskellwiki/Playing_by_the_rules
http://hackage.haskell.org/trac/ghc/wiki/RewriteRules
Bas
On 5/10/07, Bas van Dijk <[EMAIL PROTECTED]> wrote:
On 5/9/07, Jason Morton <[EMAIL PROTECTED]> wrote:
> I'
On 5/9/07, Jason Morton <[EMAIL PROTECTED]> wrote:
I'd love to understand these rewrite-rules a little better; could
anyone point me to where (if?) they are documented?
They are documented in the GHC User Guide:
http://www.haskell.org/ghc/docs/latest/html/users_guide/rewrite-rules.html
regard
On Wed, 2007-05-09 at 09:08 -0700, Jason Morton wrote:
> I'd love to understand these rewrite-rules a little better; could
> anyone point me to where (if?) they are documented?
Here's a list of papers on fusion and deforestation:
http://haskell.org/haskellwiki/Research_papers/Compilation#Fusion_a
Tomasz Zielonka
Enviada: quarta-feira, 9 de Maio de 2007 16:13
Para: Haskell Cafe
Assunto: Re: [Haskell-cafe] built-in lists vs inductively defined list
On Wed, May 09, 2007 at 04:11:40PM +0200, Nils Anders Danielsson wrote:
> On Wed, 09 May 2007, Stefan O'Rear <[EMAIL PROTECTED]> wrote:
I'd love to understand these rewrite-rules a little better; could
anyone point me to where (if?) they are documented?
On 5/9/07, Tomasz Zielonka <[EMAIL PROTECTED]> wrote:
On Wed, May 09, 2007 at 04:11:40PM +0200, Nils Anders Danielsson wrote:
> On Wed, 09 May 2007, Stefan O'Rear <[EMAIL PROTECT
On Wed, May 09, 2007 at 04:11:40PM +0200, Nils Anders Danielsson wrote:
> On Wed, 09 May 2007, Stefan O'Rear <[EMAIL PROTECTED]> wrote:
>
> > To the best of my knowledge, there are no optimizations specific to []
> > in the compiler proper.
> >
> > However, the standard library has a *lot* of spee
On Wed, 09 May 2007, Stefan O'Rear <[EMAIL PROTECTED]> wrote:
> To the best of my knowledge, there are no optimizations specific to []
> in the compiler proper.
>
> However, the standard library has a *lot* of speed hacks you will need
> to duplicate!
Some of which are not expressible in "ordinar
On Wed, May 09, 2007 at 02:45:34PM +0100, Jos? Miguel Vila?a wrote:
> Can someone tell me if would be any difference (beside syntax) between the
> built-in Haskell list with [] and : and lists given by a inductive datatype
> definition like
>
> data List a = Nil | Cons a (List a)
>
> This is, is a
Hi,
Can someone tell me if would be any difference (beside syntax) between the
built-in Haskell list with [] and : and lists given by a inductive datatype
definition like
data List a = Nil | Cons a (List a)
This is, is any of the compilers doing some special optimizations for the
built-
