9ba41a692d
This PR implements better support for unfolding class fields marked as `reducible`. For example, we want to mark fields that are types such as ```lean MonadControlT.stM : Type u -> Type u ``` The motivation is similar to our heuristic that type definitions should be abbreviations. Now, suppose we want to unfold `stM m (ExceptT ε m) α` using the `.reducible` transparency setting, we want the result to be `stM m m (MonadControl.stM m (ExceptT ε m) α)` instead of `(instMonadControlTOfMonadControl m m (ExceptT ε m)).1 α`. The latter would defeat the intent of marking the field as reducible, since the instance `instMonadControlTOfMonadControl` is `[instance_reducible]` and the resulting term would be stuck when using `.reducible` transparency mode. **Remark**: This feature introduces a few breakages in core and Mathlib. So, it is disabled for now in this PR. To enable, we must use `set_option backward.whnf.reducibleClassField true`
125 lines
3.8 KiB
Text
125 lines
3.8 KiB
Text
opaque q : Nat → Nat
|
|
def f (x : Nat) : Nat :=
|
|
match x with
|
|
| 0 => 1
|
|
| x+1 => q (f x)
|
|
|
|
theorem f_eq : f (x + 1) = q (f x) := rfl
|
|
axiom q_eq (x : Nat) : q x = x
|
|
|
|
/--
|
|
trace: [simp] Diagnostics
|
|
[simp] used theorems (max: 50, num: 2):
|
|
[simp] f_eq ↦ 50
|
|
[simp] q_eq ↦ 50
|
|
[simp] tried theorems (max: 51, num: 2):
|
|
[simp] f_eq ↦ 51, succeeded: 50
|
|
[simp] q_eq ↦ 50, succeeded: 50
|
|
use `set_option diagnostics.threshold <num>` to control threshold for reporting counters
|
|
-/
|
|
#guard_msgs in
|
|
example : f (x + 50) = f x := by
|
|
set_option diagnostics true in
|
|
simp [f_eq, q_eq]
|
|
|
|
example : f (x + 50) = f x := by
|
|
set_option diagnostics true in
|
|
simp [f_eq, q_eq]
|
|
|
|
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)
|
|
|
|
/--
|
|
trace: [simp] Diagnostics
|
|
[simp] used theorems (max: 1193, num: 3):
|
|
[simp] ack.eq_3 ↦ 1193
|
|
[simp] Nat.reduceAdd (builtin simproc) ↦ 508
|
|
[simp] ack.eq_1 ↦ 508
|
|
[simp] tried theorems (max: 1705, num: 2):
|
|
[simp] ack.eq_3 ↦ 1705, succeeded: 1193
|
|
[simp] ack.eq_1 ↦ 508, succeeded: 508
|
|
use `set_option diagnostics.threshold <num>` to control threshold for reporting counters
|
|
---
|
|
error: Tactic `simp` failed with a nested error:
|
|
maximum recursion depth has been reached
|
|
use `set_option maxRecDepth <num>` to increase limit
|
|
use `set_option diagnostics true` to get diagnostic information
|
|
-/
|
|
#guard_msgs in
|
|
example : ack 4 4 = x := by
|
|
set_option diagnostics true in
|
|
simp [ack.eq_2, ack.eq_1, ack.eq_3]
|
|
|
|
-- TODO: In the following test we just want to check whether we
|
|
-- diagnostics for `simp` when there is a failure. However, the
|
|
-- actual counters make the test very unstable since small
|
|
-- changes to Lean affect heartbeat consumption, and consequently
|
|
-- the number of rewrites tried.
|
|
-- /--
|
|
-- info: [simp] used theorems (max: 22, num: 5):
|
|
-- ack.eq_3 ↦ 22
|
|
-- ⏎
|
|
-- Nat.reduceAdd (builtin simproc) ↦ 14
|
|
-- ⏎
|
|
-- ack.eq_1 ↦ 11
|
|
-- ⏎
|
|
-- ack.eq_2 ↦ 4
|
|
-- ⏎
|
|
-- Nat.zero_add ↦ 1[simp] tried theorems (max: 38, num: 4):
|
|
-- ack.eq_3 ↦ 38, succeeded: 22
|
|
-- ⏎
|
|
-- ack.eq_1 ↦ 11, succeeded: 11
|
|
-- ⏎
|
|
-- ack.eq_2 ↦ 4, succeeded: 4
|
|
-- ⏎
|
|
-- Nat.zero_add ↦ 1, succeeded: 1[reduction] unfolded reducible declarations (max: 7, num: 1):
|
|
-- outParam ↦ 7use `set_option diagnostics.threshold <num>` to control threshold for reporting counters
|
|
-- ---
|
|
-- error: tactic 'simp' failed, nested error:
|
|
-- (deterministic) timeout at `whnf`, maximum number of heartbeats (500) has been reached
|
|
-- use `set_option maxHeartbeats <num>` to set the limit
|
|
-- use `set_option diagnostics true` to get diagnostic information
|
|
-- -/
|
|
-- #guard_msgs in
|
|
-- set_option maxHeartbeats 500 in
|
|
-- example : ack 4 4 = x := by
|
|
-- set_option diagnostics true in
|
|
-- set_option diagnostics.threshold 0 in
|
|
-- simp [ack.eq_2, ack.eq_1, ack.eq_3]
|
|
|
|
@[reducible] def h (x : Nat) :=
|
|
match x with
|
|
| 0 => 10
|
|
| x + 1 => h x
|
|
|
|
opaque q1 : Nat → Nat → Prop
|
|
@[simp] axiom q1_ax (x : Nat) : q1 x 10
|
|
|
|
/--
|
|
trace: [simp] Diagnostics
|
|
[simp] used theorems (max: 1, num: 1):
|
|
[simp] q1_ax ↦ 1
|
|
[simp] tried theorems (max: 1, num: 1):
|
|
[simp] q1_ax ↦ 1, succeeded: 1
|
|
use `set_option diagnostics.threshold <num>` to control threshold for reporting counters
|
|
---
|
|
trace: [diag] Diagnostics
|
|
[reduction] unfolded declarations (max: 246, num: 1):
|
|
[reduction] Nat.rec ↦ 246
|
|
[reduction] unfolded reducible declarations (max: 246, num: 2):
|
|
[reduction] h ↦ 246
|
|
[reduction] Nat.casesOn ↦ 246
|
|
use `set_option diagnostics.threshold <num>` to control threshold for reporting counters
|
|
-/
|
|
#guard_msgs in
|
|
example : q1 x (h 40) := by
|
|
set_option diagnostics true in
|
|
set_option diagnostics.threshold 0 in
|
|
simp
|
|
|
|
example : q1 x (h 40) := by
|
|
set_option diagnostics true in
|
|
set_option diagnostics.threshold 0 in
|
|
simp
|