9 May
2007
9 May
'07
1:52 p.m.
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 any of the compilers doing some special optimizations for the built-in lists?
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! Stefan