d39b0415f0
Sets the default value to `pp.fieldNotation.generalized` to `true`. Updates tests, and fixes some minor flaws in the implementation of the generalized field notation pretty printer. Now generalized field notation won't be used for any function that has a `motive` argument. This is intended to prevent recursors from pretty printing using it as (1) recursors are more like control flow structures than actual functions and (2) generalized field notation tends to cause elaboration problems for recursors. Note: be sure functions that have an `@[app_unexpander]` use `@[pp_nodot]` if applicable. For example, `List.toArray` needs `@[pp_nodot]` to ensure the unexpander prints it using `#[...]` notation.
29 lines
912 B
Text
29 lines
912 B
Text
/--
|
||
info: equations:
|
||
theorem List.append.eq_1.{u} : ∀ {α : Type u} (x : List α), [].append x = x
|
||
theorem List.append.eq_2.{u} : ∀ {α : Type u} (x : List α) (a : α) (l : List α), (a :: l).append x = a :: l.append x
|
||
-/
|
||
#guard_msgs in
|
||
#print eqns List.append
|
||
|
||
/--
|
||
info: equations:
|
||
theorem List.append.eq_1.{u} : ∀ {α : Type u} (x : List α), [].append x = x
|
||
theorem List.append.eq_2.{u} : ∀ {α : Type u} (x : List α) (a : α) (l : List α), (a :: l).append x = a :: l.append x
|
||
-/
|
||
#guard_msgs in
|
||
#print equations List.append
|
||
|
||
@[simp] def ack : Nat → Nat → Nat
|
||
| 0, y => y+1
|
||
| x+1, 0 => ack x 1
|
||
| x+1, y+1 => ack x (ack (x+1) y)
|
||
|
||
/--
|
||
info: equations:
|
||
theorem ack.eq_1 : ∀ (x : Nat), ack 0 x = x + 1
|
||
theorem ack.eq_2 : ∀ (x_2 : Nat), ack x_2.succ 0 = ack x_2 1
|
||
theorem ack.eq_3 : ∀ (x_2 y : Nat), ack x_2.succ y.succ = ack x_2 (ack (x_2 + 1) y)
|
||
-/
|
||
#guard_msgs in
|
||
#print eqns ack
|