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

[José Miguel Vilaça]

Hi again,

IMHO for what concerns to the language they only differ in syntax. They are
equal up to constructor names.

What could be the case is that some compiler could do some optimizations
that end up with better performance in time and space when using lists.
But for what people gently ask me, the optimizations are in the functions
over list and not in the data structure itself.

Do you know something about an implementation that does something about the
data structure itself?

Best
Miguel Vilaça


-----Mensagem original-----
De: haskell-cafe-bounces at haskell.org
[mailto:haskell-cafe-bounces at haskell.org] Em nome de 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 <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