Interpreter

1. Free, Bound, Lex
2. Interpreter and Representation Independent
3. Lexical vs Dynamic Scope
4. Parameter-Passing Style(Calling Conventions)
5. Continuation-Passing Style
6. Registerization
7. Trampolining
8. Stream
9. Store-Passing Style
10. Type and Inference
11. Macros
12. Partial Evaluation

Logic Programming

• microkanren[micro.rkt]
• miniKanren[mk-new.rkt]

Org Files

• Yin's Mid-Term Memory
• Data Structures Mindmap
• Operating System Mindmap
• Learn PL Mindmap
• Oberon - The Overlooked Jewel
• Translations from the Philosophical Writings of Gottlob Frege
• Function and Concept
• Backtracking, Interleaving, and Terminating Monad Transformers
• The Role of the Study of PL in the Education of a Programmer
• What is a Purely Functional Language?
• Simple Imperative Polymorphism
• The Concept of a Supercompiler
• The UNIX-Haters Handbook
• What Goes Around Comes Around
• Microsoft Separation Agreement

Wordpress Files

• Computability and Complexity
• A Note on the Entscheidungsproblem
• An Unsolvable Problem of Elementary Number Theory
• On Computable Numbers, with An Application to the Entscheidungsproblem

Current P423

• Essentials of Compilation
• Fast and Effective Procedure Inlining
• Uniprocessor Garbage Collection Techniques
• System V Application Binary Interface AMD64
• System V Application Binary Interface Intel386
• Intel 64 and IA-32 Architectures Software Developer's Manual

Nano-pass Framework(Schedule)

• Week 1: simplification
  • verify-scheme¹
  • rename-var
  • remove-implicit-begin¹
  • remove-unquoted-constant
  • remove-one-armed-if
  • verify-a1-output¹
• Week 2: assignment conv.
  • remove-not
  • mark-assigned
  • optimize-letrec²
  • remove-impure-letrec
  • convert-assigned
  • verify-a2-output¹
• Week 3: closure conversion
  • optimize-direct-call
  • remove-anon-lambda
  • sanitize-binding-forms
  • uncover-free
  • convert-closure
  • optimize-known-call³
  • uncover-well-known²
  • optimize-free²
  • optimize-self-reference²
  • analyze-closure-size¹
  • lift-letrec
  • verify-a3-output¹
• Week 4: canonicalization
  • introduce-closure-prims
  • remove-complex-constant
  • normalize-context
  • verify-a4-output¹
• Week 5: encoding/allocation
  • specify-immediate-repn
  • specify-nonimmediate-repn
• Week 6: start of UIL compiler
  • verify-uil
• Week 7: labels and temps
  • remove-complex-opera*
  • lift-letrec-body
  • introduce-return-point
  • verify-a7-output¹
• Week 8: virtual registerizing
  • remove-nonunary-let
  • uncover-local
  • the-return-of-set!
  • flatten-set!
  • verify-a8-output¹
• Week 9: brief digression
  • generate-C-code⁴
• Week 10: register alloc. setup
  • uncover-call-live²
  • optimize-save-placement²
  • eliminate-redundant-saves²
  • rewrite-saves/restores²
  • impose-calling-convention
  • reveal-allocation-pointer
  • verify-a10-output¹
• Week 11: live analysis
  • uncover-live-1
  • uncover-frame-conflict
  • strip-live-1
  • uncover-frame-move
  • verify-a11-output¹
• Week 12: call frames
  • uncover-call-live-spills
  • assign-frame-1
  • assign-new-frame
  • optimize-fp-assignments²
  • verify-a12-output¹
• Week 13: spill code
  • finalize-frame-locations
  • eliminate-frame-var
  • introduce-unspillables
  • verify-a13-output¹
• Week 14: register assignment
  • uncover-live-2
  • uncover-register-conflict
  • verify-unspillables¹
  • strip-live-2
  • uncover-register-move
  • assign-registers
  • assign-frame-2
  • finalize-register-locations
  • analyze-frame-traffic¹
  • verify-a14-output¹
• Week 15: assembly
  • flatten-program
  • generate-Sparc-code

Chez Related

• Automatic Cross-Library Optimization
• A Nanopass Framework for Commercial Compiler Development
• Optimizing Closures in O(0) Time
• A Sufficiently Smart Compiler for Procedural Records
• Ftypes: Structured Foreign Types
• Enabling Cross-library Optimization and Compile-time Error Checking in the Presence of Procedural Macros
• Fixing Letrec(reloaded)
• Efficient Nondestructive Equality Checking for Trees and Graphs
• Implicit Phasing for R6RS Libraries
• Syntactic Abstraction: The Syntax-case Expander
• The Development of Chez Scheme
• Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct
• Extending the Scope of Syntactic Abstraction
• An Infrastructure for Profile-Driven Dynamic Recompilation
• Fast and Effective Procedure Inlining
• Representing Control in the Presence of One-Shot Continuations
• Printing Floating-Point Numbers Quickly and Accurately
• Compiler Construction Using Scheme
• Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling
• An Efficient Implementation of Multiple Return Values in Scheme
• Don't Stop the BIBOP: Flexible and Efficient Storage Management for Dynamically Typed Languages
• Syntactic Abstraction in Scheme
• Guardians in a Generation-Based Garbage Collector
• Writing Hygienic Macros in Scheme with Syntax-Case
• A New Approach to Procedures with Variable Arity
• Representing Control in the Presence of First-Class Continuations
• Destination-Driven Code Generation
• Engines from Continuations
• A Variable-Arity Procedural Interface
• Expansion-Passing Style: A General Macro Mechanism
• Three Implementation Models for Scheme
• Expansion-Passing Style: Beyond Conventional Macros

Compiler Extra

• CONCUR: A Language for Continuous, Concurrent Processes
• A Basis For a Mathematical Theory of Computation
• Profile-Guided Meta-Programming
• A Nanopass Framework for Commercial Compiler Development
• A Nanopass Framework for Compiler Education
• A Nanopass Infrastructure for Compiler Education
• A Run-time Representation of Scheme Record Types
• From Macrogeneration to Syntactic Abstraction

P423 Assignments

• Assignment 1
• Assignment 2
• Assignment 3
• Assignment 4
• Assignment 5
• Assignment 6
• Assignment 7
• Assignment 8
• Assignment 9
• Assignment 10
• Assignment 11
• Assignment 13
• Assignment 14
• Assignment 15

Operating System

• OS Concepts
• OS Three Easy Pieces
• OS Internals and Design Principles

Network

• Networks and Internets
• A Top-Down Approach