[Haskell-cafe] faster compiling for ghc
bulat.ziganshin at gmail.com
Thu Nov 12 07:25:27 EST 2009
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
> 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
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe