This PR fixes a bug where the monad lift coercion elaborator would partially unify expressions even if they were not monads. This could be taken advantage of to propagate information that could help elaboration make progress, for example the first `change` worked because the monad lift coercion elaborator was unifying `@Eq _ _` with `@Eq (Nat × Nat) p`: ```lean example (p : Nat × Nat) : p = p := by change _ = ⟨_, _⟩ -- used to work (yielding `p = (p.fst, p.snd)`), now it doesn't change ⟨_, _⟩ = _ -- never worked ``` As such, this is a breaking change; you may need to adjust expressions to include additional implicit arguments.
12 lines
267 B
Text
12 lines
267 B
Text
1081.lean:7:2-7:5: error: type mismatch
|
|
rfl
|
|
has type
|
|
?m = ?m : Prop
|
|
but is expected to have type
|
|
f 0 y = y : Prop
|
|
1081.lean:23:4-23:7: error: type mismatch
|
|
rfl
|
|
has type
|
|
?m = ?m : Prop
|
|
but is expected to have type
|
|
insert a ⟨0, ⋯⟩ v = cons a v : Prop
|