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.
13 lines
423 B
Text
13 lines
423 B
Text
def Nat.hasDecEq: (a: Nat) → (b: Nat) → Decidable (Eq a b)
|
|
| 0, 0 => isTrue rfl
|
|
| n+1, 0
|
|
| 0, n+1 => isFalse Nat.noConfusion
|
|
| n+1, m+1 =>
|
|
match h:hasDecEq n m with -- it works without `h:`
|
|
| isTrue heq => isTrue (heq ▸ rfl)
|
|
| isFalse hne => isFalse (Nat.noConfusion · (λ heq => absurd heq hne))
|
|
termination_by a b => (a, b)
|
|
|
|
set_option pp.proofs true
|
|
#print Nat.hasDecEq
|
|
#print Nat.hasDecEq._unary
|