plans: tick conformance.sh + Phase 3 complete

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

plans/haskell-on-sx.md

@@ -81,13 +81,13 @@ Key mappings:
 - [x] Infinite structures: `repeat x`, `iterate f x`, `[1..]`, Fibonacci stream (sieve deferred — needs lazy `++` and is exercised under `Classic programs`)
 - [x] `seq`, `deepseq` from Prelude
 - [x] Do-notation for a stub `IO` monad (just threading, no real side effects yet)
-- [ ] Classic programs in `lib/haskell/tests/programs/`:
+- [x] Classic programs in `lib/haskell/tests/programs/`:
   - [x] `fib.hs` — infinite Fibonacci stream
   - [x] `sieve.hs` — lazy sieve of Eratosthenes
   - [x] `quicksort.hs` — naive QS
   - [x] `nqueens.hs`
   - [x] `calculator.hs` — parser combinator style expression evaluator
-- [ ] `lib/haskell/conformance.sh` + runner; `scoreboard.json` + `scoreboard.md`
+- [x] `lib/haskell/conformance.sh` + runner; `scoreboard.json` + `scoreboard.md`
 - [x] Target: 5/5 classic programs passing
 
 ### Phase 4 — Hindley-Milner inference
@@ -114,6 +114,11 @@ Key mappings:
 
 _Newest first._
 
+- **2026-04-25** — `conformance.sh` runner + `scoreboard.json` + `scoreboard.md`.
+  Script runs each classic program's test suite, prints per-program pass/fail,
+  and writes both files. `--check` mode skips writing for CI use.
+  Initial snapshot: 16/16 tests, 5/5 programs passing. Phase 3 complete.
+
 - **2026-04-25** — Classic program `calculator.hs`: recursive descent
   expression evaluator using ADTs for tokens and results.
   `data Token = TNum Int | TOp String` + `data Result = R Int [Token]`;