cdbe29b46d
An important part of the interface of a function is the parameter names, for making used of named arguments. This PR makes the parameter names print in a reliable way. The parameters of the type now appear as hygienic names if they cannot be used as named arguments. Modifies the heuristic for how parameters are chosen to appear before or after the colon. The rule is now that parameters start appearing after the colon at the first non-dependent non-instance-implicit parameter that has a name unusable as a named argument. This is a refinement of #2846. Fixes the issue where consecutive hygienic names pretty print without a space separating them, so we now have `(x✝ y✝ : Nat)` rather than `(x✝y✝ : Nat)`. Breaking change: `Lean.PrettyPrinter.Formatter.pushToken` now takes an additional boolean `ident` argument, which should be `true` for identifiers. Used to insert discretionary space between consecutive identifiers. Closes #5810
51 lines
1.3 KiB
Text
51 lines
1.3 KiB
Text
---- h1
|
||
10
|
||
---- h2
|
||
3
|
||
10
|
||
0
|
||
---- h3
|
||
10
|
||
30
|
||
4
|
||
---- inv
|
||
10
|
||
match1.lean:82:0-82:73: error: dependent elimination failed, type mismatch when solving alternative with type
|
||
motive 0 (Vec.cons head✝ Vec.nil) ⋯
|
||
but expected
|
||
motive x✝ (Vec.cons head✝ tail✝) ⋯
|
||
[false, true, true]
|
||
match1.lean:119:0-119:41: error: dependent match elimination failed, inaccessible pattern found
|
||
.(j + j)
|
||
constructor expected
|
||
[false, true, true]
|
||
match1.lean:136:7-136:22: error: invalid match-expression, type of pattern variable 'a' contains metavariables
|
||
?m
|
||
fun x => ?m : ?m × ?m → ?m
|
||
fun x =>
|
||
match x with
|
||
| (a, b) => a + b : Nat × Nat → Nat
|
||
fun x =>
|
||
match x with
|
||
| (a, b) => a && b : Bool × Bool → Bool
|
||
fun x =>
|
||
match x with
|
||
| (a, b) => a + b : Nat × Nat → Nat
|
||
fun x x_1 =>
|
||
match x, x_1 with
|
||
| some a, some b => some (a + b)
|
||
| x, x_2 => none : Option Nat → Option Nat → Option Nat
|
||
fun x =>
|
||
(match (motive := Nat → Nat → Nat) x with
|
||
| 0 => id
|
||
| x.succ => id)
|
||
x : Nat → Nat
|
||
fun x =>
|
||
match x with
|
||
| #[1, 2] => 2
|
||
| #[] => 0
|
||
| #[3, 4, 5] => 3
|
||
| x => 4 : Array Nat → Nat
|
||
g.match_1.{u_1, u_2} {α : Type u_1} (motive : List α → Sort u_2) (x✝ : List α) (h_1 : (a : α) → motive [a])
|
||
(h_2 : (x : List α) → motive x) : motive x✝
|
||
fun e => nomatch e : Empty → False
|