interpreters_and_compilers.md

1. (slides/video) Feeley, 90 minute Scheme to C compiler; (slides) Leroy, Compiling functional languages; the MinCaml compiler
2. (code) Bauer, The PL Zoo
3. Steele, RABBIT: a compiler for Scheme
4. Kennedy, Compiling with Continuations, Continued
5. Marlow, How to make a fast curry: push/enter vs eval/apply
6. Landin, Call-by-name, call-by-value, and the Lambda-calculus

From Slack

• "Relating System F and λ2: A Case Study in Coq, Abella and Beluga"
• "Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)"
• "My first fifteen compilers"
  • IU compilers course
  • Nanopass
    • "A Nanopass Framework for Compiler Education"
    • Nanopass framework on github
• "Compiling to Categories"
• "A first-order one-pass CPS transformation" (also at http://www.brics.dk/RS/01/49/BRICS-RS-01-49.ps.gz)
• "How to prove a compiler fully abstract"
  • "Fully Abstract Compilation via Universal Embedding"
  • "Fully-Abstract Compilation by Approximate Back-Translation"
• Verified Transformations on Functional Programs Using the Higher-Order Abstract Syntax Approach
• (Thesis) Verified Compilation of Functional Programs
• From System F to Typed Assembly Language