Does Haskell's WHNF reduction decrease at compile time?

Question

The AFAIU object file generated Haskell compilermust be machine code. Thus, this object file has a representation of the source ASTand reduces it at runtime, or this reduction occurs at compile time, and only the final values ​​are WHNFconverted to the corresponding machine code.

I understand that the compilation time of the latter would be a function of the time complexity of the program itself, which, in my opinion, is less likely.

Can someone give a clear explanation of what happens at runtime and what happens at compile time in the case Haskell (GHC)?

Answer 1

, . () , AST, () / WHNF, AST.

, . . Python , AST . , ( , ).

.

, . , . (, ), . , Haskell, :

• (Caml , )
• Krivine Machine
• SECD
• G- (GHC )

. , , WHNF.

Haskell GHC , STG. , , // ..

, . , , , ( ) ( ). - C ++, , .

( Haskell, C, ++ - ) . , , , .

, WHNF . , , -, , , . , ! .

let x = complex computation in x + x
-- vs
complex computation + complex computation

, ! , , x .