... | ... | @@ -41,7 +41,7 @@ Core language. It differs in the following main respects: |
|
|
|
|
|
1. In its current incarnation, it isn't typed in the Haskell sense,
|
|
|
though it does know about *representation* types
|
|
|
1. It is in administrative normal form (ANF), which is where every
|
|
|
1. It is in A-normal form (ANF), which is where every
|
|
|
subexpression is given a name
|
|
|
1. Every $`\lambda`$, constructor application, and primitive operator
|
|
|
is $`\eta`$-expanded
|
... | ... | @@ -1325,4 +1325,4 @@ This document has left much of the detail of how STG is implemented |
|
|
out: notable omissions include CAFs, and the precise behaviour of
|
|
|
the garbage collector. Nonetheless, my hope is that it has helped
|
|
|
you to gain some more insight into the weird and wonderful way the
|
|
|
Haskell evaluation model is implemented. |
|
|
Haskell evaluation model is implemented. |
|
|
\ No newline at end of file |