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 <x...@xaph.net> 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 > _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe