A systematic derivation of the STG machine verified in Coq
<p>Shared Term Graph (STG) is a lazy functional language used as an intermediate language in the Glasgow Haskell Compiler (GHC). In this article, we present a natural operational semantics for STG and we mechanically derive a lazy abstract machine from this semantics, which turns out to coinci...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
ACM
2010
|