New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

decreases heuristics for seq/array/list length #3696

Open

briangmilnes opened this issue Jan 24, 2025 · 0 comments

Contributor

briangmilnes commented Jan 24, 2025

let rec f_seq_count_eq' (s:seq nat) (at: nat{at <= length s}) (count: nat):
Tot (n:nat{n = length s - at + count})
(decreases length s - at)

if at = length s
then count
else f_seq_count_eq' s (at + 1) (count+1)

could take (i:nat{i< or <= length s}) and (i +1) as a sign to
try a (decreases length s - i) in the termination proof.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment