invariant-guard - Correctness-first algorithm design with invariants
Requires contracts, invariants, termination arguments, base cases, and edge cases before producing or reviewing non-trivial algorithmic code.
Tags
Updated: 2026-10-02Capabilities
Typical Inputs
Typical Outputs
What this skill does
- State function contracts
- Write loop invariants
- Prove termination arguments
- Define recursion base cases
- Enumerate edge cases
- Verify postconditions against invariants
- Encode illegal states
Inputs
- Algorithm requirements
- Function specifications
- Source code
- Edge-case constraints
- Type-system constraints
Outputs
- Written function contracts
- Loop invariants
- Termination arguments
- Recursion base cases
- Edge-case tables
- Corrected algorithmic code
- Self-check statements