Zulip Chat Archive
Stream: Lean Together 2024
Topic: Lean FRO Meeting - Leonardo de Moura
Mario Carneiro (Jan 12 2024 at 15:23):
@Joachim Breitner In the example which shows a matrix of decreasing / equal relations, there was an all-=
example. In this specific case, it is impossible to prove decreasing, so it might make sense to skip the normal guessing process and just show a more targeted error directly on this call
Joachim Breitner (Jan 12 2024 at 15:26):
Right, that was suggested before, and I agree that there are plenty of special cases where the message could be made nicer. I guess someone just has to do it. I’ll open an issue and maybe I’ll do it when I have appetite for some low hanging fruit, or someone else wants to get to know the code.
https://github.com/leanprover/lean4/issues/3172
Mario Carneiro (Jan 12 2024 at 15:45):
Is there an issue for rw [x]
and simp [x]
where x
is a let variable?
Matthew Ballard (Jan 12 2024 at 16:11):
Here is the issue re:noncomputable section lean4#2619.
What I heard from the discussion was the proposal to change the semantics of noncomputable section
to that of suppress_compilation
.
Last updated: May 02 2025 at 03:31 UTC