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.
14 lines
658 B
Text
14 lines
658 B
Text
-- Print a nat using well-founded recursion
|
|
def natPrintAux (n : Nat) (sink : List Char) : List Char :=
|
|
if h0 : n < 10
|
|
then (n.digitChar :: sink)
|
|
else natPrintAux (n / 10) (Nat.digitChar (n % 10) :: sink)
|
|
termination_by n
|
|
decreasing_by sorry
|
|
|
|
set_option maxRecDepth 100 -- default takes ages in debug mode and triggers stack space threshold
|
|
|
|
-- I meant to write `simp only [natPrintAux]`, but accidentally referenced the current theorem
|
|
theorem natPrintAux_eq (n : Nat) (sink : List Char) :
|
|
natPrintAux n sink = if n < 10 then (n.digitChar :: sink) else natPrintAux (n / 10) (Nat.digitChar (n % 10) :: sink) := by
|
|
simp only [natPrintAux_eq]
|