A systematic derivation of the STG machine verified in Coq

@inproceedings{Pirg2010ASD,
  title={A systematic derivation of the STG machine verified in Coq},
  author={Maciej Pir{\'o}g and Dariusz Biernacki},
  booktitle={Haskell},
  year={2010}
}
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 coincide with Peyton-Jones and Salkild's Spineless Tagless G-machine (STG machine) used in GHC. Unlike other constructions of STG-like machines present in the literature, ours is based on a systematic and scalable… CONTINUE READING
10 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Implementing lazy functional languages on stock hardware: The spineless tagless G-machine

  • Simon L. Peyton Jones
  • Journal of Functional Programming,
  • 1992
Highly Influential
13 Excerpts

Similar Papers

Loading similar papers…