@mhueschen will be presenting g-machine-hs: “A Haskell repo I wrote implementing the G-machine described in Efficient Compilation of Lazy Evaluation by Thomas Johnsson (SIGPLAN 1984). The G-machine is an approach to implementing relatively-fast interpreters for functional programs, through “graph reduction”. I’ll walk through the fundamental concepts in the G-machine, using DOT-generated graphics showing the code+stack at each step of execution. Hopefully, attendees will come away with an understanding of the basics of how lazy functional languages are interpreted. This could be useful in understanding how, for example, Haskell lazy evaluation works, and what “forcing” means, in a more experiential sense.”
There will be non-alcoholic beverages and pizza, as well as time to socialize and discuss the Haskell & FP world in general.
More details at Interpreting Lazy Functional Languages, Wed, May 1, 2024, 5:30 PM | Meetup