invariants_and_monovariants
CommunityInvariant-based proofs for reachability.
Authorbneb
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Identify invariant or monovariant properties that must hold to prove reachability and termination.
Core Features & Use Cases
- Demonstrates how invariants constrain reachable states in graph theory and programming proofs.
- Shows how monovariants imply termination and progress, enabling formal termination arguments.
- Provides Lean 4 templates and worked examples for parity, loop termination, and unreachability proofs.
Quick Start
Load the template into your Lean environment and adapt the invariant and monovariant templates to your state space before proving termination.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: invariants_and_monovariants Download link: https://github.com/bneb/perqed/archive/main.zip#invariants-and-monovariants Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.