Found by Aaron:
open import Agda.Builtin.Nat open import Agda.Builtin.Equality postulate Foo : (n m : Nat) → n + m ≡ 3 → Set _ = Foo ? ? refl
If using give to solve the first hole with zero, constraints are updated and we are left with a constraint ?1 := 3, but if we solve the first hole using auto (which also finds the solution zero), the constraint is not updated and we still have a constraint ?0 + ?1 ≡ 3 even though ?0 no longer exists.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4