Invariant Guard

Forces a written function contract, loop invariant, termination argument, and edge-case table before emitting loops or recursion (Boyer-Moore, leftmost binary search, QuickSelect traps). Use when writing or reviewing algorithms whose obvious implementation is subtly wrong. Not for choosing which algorithm to use (lemmaly) or epsilon-bounded math (mathguard). Do not use for trivial one-liners or as an automated prover.

Kayforkind Updated 0 repo stars

File contents

Kayforkind/skill-slice commit 56e7f24dcf

Frequently asked questions

npx get-skill add kayforkind/invariant-guard