Re[2]: [Haskell-cafe] faster compiling for ghc

Hello Peter, Thursday, November 12, 2009, 3:26:21 PM, you wrote: incremental is just a word. what exactly we mean? ghc, like any other .obj-generating compiler, doesn't recompile unchanged source files (if their dependencies aren't changed too). otoh, (my old ghc 6.6) recompiles Main.hs if imported Sub.hs added new declaration (anyway unused in Main), so it may be improved some way

Regarding speeding up linking or compilation, IMO the real speedup you would get from incremental compilation & linking. It's okay if the initial compilation & linking take a long time, but the duration of next c&l iterations should only depend on the number of changes one does, not on the total project size.

On Thu, Nov 12, 2009 at 1:10 PM, Rafal Kolanski wrote:

...

Bulat Ziganshin wrote:

...

it's impossible to interpret haskell - how can you do type inference? hugs, like ghci, is bytecode interpreter. the difference is their implementation languages - haskell vs C

We use Standard ML for the Isabelle/HOL theorem prover, and it's interpreted, even has an interactive toplevel. It uses type inference, does it not? In fact, in a not-very-serious discussion at some point of what one could replace javascript with for a browser-embedded language, SML came up.

What makes Haskell so different that it can't be interpreted in the SML style?

Sincerely,

Rafal Kolanski.

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

-- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com