Implementing A Functional Language
This is the first in a series of posts on implementing a simple functional language. A typical functional language compiler goes through the following steps to turn the code you write into a binary you run:
We will look at the transformation from
abstract IR. In Haskell, this
corresponds to the transformation from GHC Core to STG. This process is interesting
because it is here that we define how the program is evaluated. We will look at several
different designs for compilers, of increasing complexity, and consider problems such as
laziness, sharing, garbage collection, strictness analysis and parallel evaluation.
This series is heavily based on a fantastic book of the same name written by Simon Peyton Jones and David Lester in 2000. All credit goes to them for the content: I’ve simply altered the presentation and updated it slightly. There are a number of differences:
- The book uses Miranda as its implementation language, whereas we will use Haskell.
- Some time is spent in the book on introducing parser combinators and pretty printing, whereas we will not focus on these them. Parsing and pretty printing are topics in their own right, and there are better introductions to them elsewhere.
- No external libraries are used in the book, whereas we will use a few common ones in the interest of brevity.
- We will spend time on building a framework for visualising the evaluation process, as I think that makes it easier to understand how the compiler works.
The structure of this series is as follows. However this is a work in progress, so I may change things as I complete each section.
- The Core Language
- Graph Reduction
- Template Instantiation
- The G-machine
- The Three Instruction Machine
- The Parallel G-machine
- Lambda Lifting
- The Spineless Tagless G-machine
- Appendix: Printing Core
- Appendix: Parsing Core
Each post will be a literate Haskell file, and will compile using Stackage
We’ll use several libraries from Hackage, so you’ll want to make sure you’re using the
same versions. Compiling with Stack and
lts-12.2 is the easiest way to do this.