[Haskell-cafe] faster compiling for ghc

[Bulat Ziganshin]

Hello Rafal,

Thursday, November 12, 2009, 3:10:54 PM, you 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.

ghc also has interactive toplevel. it compiles haskell down to
bytecode, though. type inference is a part of compilation process,
afaik, ocaml also generates bytecode. don't know about isabelle


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