[Haskell-cafe] built-in lists vs inductively defined list

[Jason Morton]

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 <tomasz.zielonka at gmail.com> wrote:
> On Wed, May 09, 2007 at 04:11:40PM +0200, Nils Anders Danielsson wrote:
> > On Wed, 09 May 2007, Stefan O'Rear <stefanor at cox.net> 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 "ordinary" Haskell (rewrite rules
> > used for short-cut deforestation).
>
> I just want to note that no particular compiler was named so far
> in this thread and this is a very compiler specific area.
>
> To OP: are you asking about the language or some particular
> implementation?
>
> Best regards
> Tomasz
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>