20eea7372f
This PR improves the delta deriving handler, giving it the ability to
process definitions with binders, as well as the ability to recursively
unfold definitions. Furthermore, delta deriving now tries all explicit
non-out-param arguments to a class, and it can handle "mixin" instance
arguments. The `deriving` syntax has been changed to accept general
terms, which makes it possible to derive specific instances with for
example `deriving OfNat _ 1` or `deriving Module R`. The class is
allowed to be a pi type, to add additional hypotheses; here is a Mathlib
example:
```lean
def Sym (α : Type*) (n : ℕ) :=
{ s : Multiset α // Multiset.card s = n }
deriving [DecidableEq α] → DecidableEq _
```
This underscore stands for where `Sym α n` may be inserted, which is
necessary when `→` is used. The `deriving instance` command can refer to
scoped variables when delta deriving as well. Breaking change: the
derived instance's name uses the `instance` command's name generator,
and the new instance is added to the current namespace.
This closes
[mathlib4#380](https://github.com/leanprover-community/mathlib4/issues/380).
14 lines
355 B
Text
14 lines
355 B
Text
[4, 5, 6]
|
|
defInst.lean:8:26-8:32: error: failed to synthesize
|
|
BEq Foo
|
|
|
|
Hint: Additional diagnostic information may be available using the `set_option diagnostics true` command.
|
|
fun x y => sorry : (x y : Foo) → ?m x y
|
|
[4, 5, 6]
|
|
fun x y => x == y : Foo → Foo → Bool
|
|
[("hello", "hello")]
|
|
false
|
|
true
|
|
true
|
|
def instMonadM : Monad M :=
|
|
ReaderT.instMonad
|