b5122b6a7b
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.
16 lines
508 B
Text
16 lines
508 B
Text
/-!
|
|
This module systematically tests the relative placement of `decreasing_by` and `where`.
|
|
-/
|
|
|
|
-- For concise recursive definition that need well-founded recursion
|
|
-- and `decreasing_by` tactics that would fail if run on the wrong function
|
|
opaque dec1 : Nat → Nat
|
|
axiom dec1_lt (n : Nat) : dec1 n < n
|
|
opaque dec2 : Nat → Nat
|
|
axiom dec2_lt (n : Nat) : dec2 n < n
|
|
|
|
def foo (n : Nat) := foo (dec1 n) + bar n
|
|
decreasing_by apply dec1_lt
|
|
where
|
|
bar (m : Nat) : Nat := bar (dec2 m)
|
|
decreasing_by apply dec2_lt
|