I wrote up an implementation of PCF using the stack dynamics and the evaluation dynamics, including a unification-based typechecker and parsing/pretty-printing. Running the program gives a basic REPL for the evaluation dynamics; invoke it with -s to get the stack dynamics.
Dependencies are bound, deriving-compat, Earley, mtl, containers.
I've also uploaded a simple program that can calculate remainders. The REPL only takes one line at a time, so you'll have to flatten the file all into one line before putting it in. Performance is about as good as you might expect from an interpreter operating on unary nats with user-defined arithmetic—in GHC's interpreter mode, takes like 1 second to compute rem 1001 1000 in the evaluation dynamics and about 8 seconds in the stack dynamics. If the program is actually compiled, the performance is significantly better, but still terrible.
![[paper clip]](/cours/static/images/paper_clip_tilt.png)
