[Haskell-cafe] faster compiling for ghc

[Rafal Kolanski]

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.