Course Notes
This table of contents gives the suggested order for the course notes. Work through the sections in order and read each section from top to bottom. Pages marked stub reserve space for planned material; they are not completed lessons. The sequence may evolve as we develop the course project.
Getting Oriented
Foundations and Workflow
Developing the Queue Warm-Up
-
Testing Alongside Proofs — stub
-
Finite Arithmetic — stub
-
Machine Execution in Lean — stub
-
Verifying a Machine Routine — stub
-
Preserving Unrelated State — stub
-
Composing Correctness Proofs — stub
Building Toward PL/OS
-
Synchronous Message Passing — stub
-
Choice and Cancellation — stub
-
Scheduling — stub
-
Channels as Capabilities — stub
-
Memory Allocation — stub
-
Context Switching and Traps — stub
-
Isolation — stub
Cross-Cutting Questions
Revisit these throughout the earlier sections: safety and failures when specifying the queue, nondeterminism when studying semantics and scheduling, and the trust boundary and proof maintenance as implementations develop. The order below is a final review path.
-
Nondeterminism — stub