GROUND
Problem
What becomes confusing, fragile, or impossible without understanding keyof? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.
TypeScript added gradual static analysis to JavaScript without replacing its runtime, preserving ecosystem compatibility through erasure.
LEARN
Concept explanation
Keyof belongs to “Generics express relationships”. keyof is learned by comparing readable, constrained, and deliberately clever implementations against same evidence.
For keyof, trace concrete input, state transition, output, and failure through a compile-time relationship that constrains JavaScript while leaving runtime values and external data untrusted.
Types constrain possible programs during analysis, then disappear. Runtime values remain JavaScript values and external data remains untrusted. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.
Evidence produced by the keyof experiment: output, state, trace, bytes, timing, or diagnostics.
Condition that must remain true while inputs or implementation of keyof change.
Point where keyof crosses ownership, representation, time, process, network, or trust.
Example bank
Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.
SETUPSolve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
OBSERVEAll versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
WHY IT MATTERSThis isolates the normal contract of keyof; preserve its raw evidence as the control for every later comparison.
SETUPRun all three implementations against: Compare inference with explicit and needless type parameters.
OBSERVERecord what remains invariant and the first representation, owner, size, or timing value that changes in tsc · hx LSP · emitted JS · source maps.
WHY IT MATTERSA boundary example is useful only when one named dimension changes and everything else stays comparable.
SETUPForce every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
OBSERVECapture the first divergence from the baseline, including exact input, diagnostic, state, and recovery result. Expected recovery: All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
WHY IT MATTERSThe diagnostic is part of the interface. Repair the proven cause, not the most visible symptom.
SETUPTrace keyof one layer below its usual abstraction through a compile-time relationship that constrains JavaScript while leaving runtime values and external data untrusted.
OBSERVERead inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.
WHY IT MATTERSThe lower layer is earned when it explains evidence the current layer cannot. Otherwise keep keyof at the simpler boundary.
SEE
Worked example
Start from supplied lab.ts. Focus: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
- Run: npx tsc --strict --noEmit lab.ts
- Save baseline evidence. Read inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.
- Boundary case: Run all three implementations against: Compare inference with explicit and needless type parameters.
- Failure case: Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
RESULT
All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost. Starter-level baseline: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
START HERE
Starter material
PREREQUISITESNode.js 22+ and npm. TypeScript is installed locally so compiler version is explicit.
ONE-TIME SETUPmkdir reforging-ts && cd reforging-ts && npm init -y && npm install --save-dev typescript
Create lab.ts, paste this exact content, then run the command below.
type Observation<T> = { topic: string; value: T; valid: boolean };
function observe<T>(topic: string, value: T): Observation<T> {
return { topic, value, valid: value !== undefined };
}
const result = observe("keyof", 1);
console.log(result.value);npx tsc --strict --noEmit lab.tsSTOP / CLEANUPCompiler exits by itself; no cleanup command required.
DO WITH GUIDANCE
Guided exercise
Solve under constraint: keyof
- Normal case: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
- Write predicted evidence from this named case before running starter.
- Keep readable baseline, then remove one convenience without hiding behavior.
- Run exact normal case. Save commands, inputs, outputs, and diagnostics in notebook.
- Explain changed evidence using lesson mental model in no more than five sentences.
Concrete guided solution
- Copy the supplied lab.ts unchanged and run: npx tsc --strict --noEmit lab.ts
- Write this prediction before inspecting output: All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
- Perform only the named normal case: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
- Save the raw output, then annotate input → transition → evidence. Use tsc · hx LSP · emitted JS · source maps to confirm the transition rather than inferring it.
- Compare prediction with evidence; if they differ, keep both and write the rule that explains the difference. Reference baseline: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
DO ALONE
Independent exercise
Compare three versions: keyof
- Create second case from blank file: Run all three implementations against: Compare inference with explicit and needless type parameters.
- Then create controlled failure: Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
- Use tsc · hx LSP · emitted JS · source maps to prove behavior, then repair controlled failure.
- Compare result against supplied acceptance checks and reference approach before marking complete.
Concrete independent solution
- Duplicate the starter into a clean comparison case; change only this boundary: Run all three implementations against: Compare inference with explicit and needless type parameters.
- Save its evidence beside the baseline and identify the first changed value. Read inferred types, diagnostics, emitted JavaScript, declarations, module traces, and source maps.
- Create the exact controlled failure: Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
- Version A: use clearest native primitives and name every intermediate state for keyof.
- Version B: remove one convenience while preserving same input/output contract.
- Version C: compress only after A and B pass baseline: Implement typed groupBy/get/collection transform with keyof constraint.
- Run shared boundary and failure fixtures against all versions: Compare inference with explicit and needless type parameters. / Permit unrelated output type and show unsound assertion, then remove it.
- Keep A unless another version has measured benefit; expected invariant: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
- Rerun baseline, boundary, and repaired failure together. Accept only if all reproduce: All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
COMPARE
Expected result
- All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
- Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
- Controlled keyof failure produces captured evidence; repair restores stated invariant without hiding error.
PROVE
Acceptance checks
Lesson is complete only when every check is true. Each check is stored locally and travels with your JSON backup.
0/5 complete · saved on this device
UNSTICK
Hints
Reveal hints
- Start with supplied normal case exactly as written: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
- For boundary case, change only named dimension: Run all three implementations against: Compare inference with explicit and needless type parameters.
- If result is confusing, diff raw inputs and evidence before editing implementation.
- If tool shows nothing useful, move observation one boundary lower: representation, runtime, OS, or network.
VERIFY
Solution
Attempt both exercises before opening reference approach.
Reveal reference solution
- Run unmodified starter and preserve baseline evidence: Strict type checking exits successfully. Changing result.value to a string-only operation produces a compiler diagnostic.
- Version A: use clearest native primitives and name every intermediate state for keyof.
- Version B: remove one convenience while preserving same input/output contract.
- Version C: compress only after A and B pass baseline: Implement typed groupBy/get/collection transform with keyof constraint.
- Run shared boundary and failure fixtures against all versions: Compare inference with explicit and needless type parameters. / Permit unrelated output type and show unsound assertion, then remove it.
- Keep A unless another version has measured benefit; expected invariant: Call sites infer precise types; invalid key fails compile; no assertion hides relationship.
PREDICT · INSPECT · BREAK · DEBUG · MEASURE
Interrogate reality
Prediction: write expected output, state transition, ordering, and failure evidence before running either exercise.
Inspection: Read inferred types, compiler diagnostics, emitted JavaScript, declaration output, module traces, and source maps.
Measurement: Track compile time, declaration complexity, editor latency, escape hatches, and defects prevented.
Capture raw evidence before explaining.
Change one assumption and force controlled failure.
Find cause with tsc · hx LSP · emitted JS · source maps before editing fix.
MASTERY + FRONTIER + BOUNDARY
Own the knowledge
Explain keyof at beginner, intermediate, and senior depth.
Recreate smallest useful example from blank file without notes or AI.
Schedule recall for day 1, 7, 30, and 90.
Creative frontier lab
Try first without opening the solutions. The constraints invite invention; the reference gives one concrete direction, never the only valid answer.
Re-solve keyof by removing the most convenient abstraction. make invalid states unrepresentable without assertions or broad escape hatches.
CONSTRAINTKeep the same inputs, observable result, and failure evidence; change the means, not the contract.
ORIGINAL IDEATurn subtraction into a design tool: the missing abstraction should reveal which responsibility it used to hide.
Reveal frontier solution
- Freeze the contract as three fixtures: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint. / Run all three implementations against: Compare inference with explicit and needless type parameters. / Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
- List every convenience used by the starter; remove the highest-level one while preserving npx tsc --strict --noEmit lab.ts.
- Implement the smallest replacement using make invalid states unrepresentable without assertions or broad escape hatches.
- Run all fixtures and compare raw evidence. Keep the simpler version unless the removed abstraction has a demonstrated benefit.
Build an explanation artifact for keyof: place inferred type, emitted JavaScript, runtime value, and boundary validation side by side.
CONSTRAINTA peer must be able to locate the first divergence without reading implementation code.
ORIGINAL IDEATreat the explanation itself as a product: make invisible transitions visible, replayable, and diffable.
Reveal frontier solution
- Create one row or timestamped event for each transition in: Solve keyof three ways using identical fixture: Implement typed groupBy/get/collection transform with keyof constraint.
- For every row record input, representation, owner, operation, output, and tool evidence from tsc · hx LSP · emitted JS · source maps.
- Replay Run all three implementations against: Compare inference with explicit and needless type parameters.; highlight only changed rows.
- Replay Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.; stop at the first divergent row and attach its recovery action.
Combine the boundary and failure into a new user-visible scenario for keyof. generate an exhaustive table whose new row intentionally breaks compilation until handled.
CONSTRAINTDo not merely add more input. Invent a recovery interaction, alternate representation, or self-checking behavior.
ORIGINAL IDEAMake the system teach its own limits: the artifact should expose the invariant and offer a safe next action when it breaks.
Reveal frontier solution
- Combine these two pressures without changing them: Run all three implementations against: Compare inference with explicit and needless type parameters. AND Force every implementation through: Permit unrelated output type and show unsound assertion, then remove it.
- Name the invariant that must survive and the user-visible evidence when it cannot: All versions preserve Call sites infer precise types; invalid key fails compile; no assertion hides relationship.; comparison records code size, predictability, and debugging cost.
- Implement this original direction: generate an exhaustive table whose new row intentionally breaks compilation until handled.
- Demonstrate baseline, combined failure, recovery, then baseline again; save the sequence as a regression fixture.
Capability frontier
Push keyof until another layer becomes justified. Record one robust technique, one contextual trade-off, and one labeled hack or historical curiosity.
CORE · PRACTICAL · CONTEXTUAL · HACK · FRAGILE · HISTORICAL · GOLF
Boundary
A type proof cannot validate network data, permissions, temporal behavior, performance, or implementation honesty.
If this vanished tomorrow…
Use runtime validation, tests, contracts, documentation, and disciplined JavaScript data modeling.
Why next layer is earned
Node is earned when trusted server-side work, shared state, filesystem access, or remote coordination becomes necessary.