Haskell Implementation Issues

Question

Haskell is a really great language. I love it. But as a C ++ programmer and with some basic knowledge of computer architecture, I really want to know the implementation details about Haskell.

I mean, for example, a function map. I know the grammar, the result. However, I want to know how this function really works in RAM or so. Since the C family language very clearly describes the mapping of grammar and computer behavior.

Does anyone have any ideas about the behavior of a computer behind a grammar of functional programs? Or any books about it like "inside the C ++ object model"?

Answer 1

First, a warning: One of the main features of Haskell is that the compiler is very likely to perform very radical transformations of your code at compile time. Thus, the code that actually runs may not look like what you wrote very closely.

. , . ( , bools, , ..), Haskell, - . , , . , .

(Graph/= tree. "". Haskell , Haskell .)

. . , 6 :

, , . GHC, :

• - , .

• , .

• (.. , ), ( ).

• , - seq , , .

• , , .

• , , . , .

• , , , , .

Answer 2

.

" " , : http://research.microsoft.com/en-us/um/people/simonpj/papers/slpj-book-1987/

: http://research.microsoft.com/en-us/um/people/simonpj/papers/pj-lester-book/

, GHC , "Spineless Tagless G-Machine" (STGM), : http://www.dcc.fc.up.pt/~pbv/aulas/linguagens/peytonjones92implementing.pdf

Answer 3

, :

: . , 1992 .

. , , - "", , .

, , . , , , . .

, , , 1987 ( ).