This change * moves `termination_by` and `decreasing_by` next to the function they apply to * simplify the syntax of `termination_by` * apply the `decreasing_by` goal to all goals at once, for better interactive use. See the section in `RELEASES.md` for more details and migration advise. This is a hard breaking change, requiring developers to touch every `termination_by` in their code base. We decided to still do it as a hard-breaking change, because supporting both old and new syntax at the same time would be non-trivial, and not save that much. Moreover, this requires changes to some metaprograms that developers might have written, and supporting both syntaxes at the same time would make _their_ migration harder.
43 lines
823 B
Text
43 lines
823 B
Text
namespace Ex1
|
|
mutual
|
|
def f : Nat → Bool → Nat
|
|
| n, true => 2 * f n false
|
|
| 0, false => 1
|
|
| n, false => n + g n
|
|
termination_by n b => (n, if b then 2 else 1)
|
|
decreasing_by
|
|
all_goals simp_wf
|
|
· apply Prod.Lex.right; decide
|
|
· apply Prod.Lex.right; decide
|
|
|
|
def g (n : Nat) : Nat :=
|
|
if h : n ≠ 0 then
|
|
f (n-1) true
|
|
else
|
|
n
|
|
termination_by (n, 0)
|
|
decreasing_by
|
|
all_goals simp_wf
|
|
apply Prod.Lex.left
|
|
apply Nat.pred_lt
|
|
done -- should fail
|
|
end
|
|
end Ex1
|
|
|
|
|
|
namespace Ex2
|
|
mutual
|
|
def f : Nat → Bool → Nat
|
|
| n, true => 2 * f n false
|
|
| 0, false => 1
|
|
| n, false => n + g (n+1) -- Error
|
|
termination_by n b => (n, if b then 2 else 1)
|
|
|
|
def g (n : Nat) : Nat :=
|
|
if h : n ≠ 0 then
|
|
f (n-1) true
|
|
else
|
|
n
|
|
termination_by (n, 0)
|
|
end
|
|
end Ex2
|