lean4-htt/library/init
Leonardo de Moura bb5ce6d04b fix(library/init/meta/interactive_base): incorrect pattern
@kha I'm trying to improve the equation compiler. I have added a
preprocessing step, and got the following wierd output when testing
tests/lean/interactive/info_goal.lean

```
> {"record":{"doc":"This tactic applies to any goal. It gives directly the exact proof\nterm of the goal. Let `T` be our goal, let `p` be a term of type `U` then\n`exact p` succeeds iff `T` and `U` are definitionally equal.","source":,"state":"⊢ ℕ → ℕ","tactic_params":["<error while executing interactive.param_desc: don't know how to pretty print lean.parser.pexpr 2>"],"text":"exact","type":"interactive.parse interactive.types.texpr → tactic unit"},"response":"ok","seq_num":4}
```

The problem seems to be the pattern
`(parser.pexpr)
which is sugar for
`(parser.pexpr std.prec.max)
and will not match `(pexpr 2)`

So, I fixed it by replacing the pattern with `(parser.pexpr %%v).
However, it is not clear to me why it was working before.
Any ideas?
2017-08-18 17:05:44 -07:00
..
algebra chore(library/init/algebra/order): generalize lemma 2017-08-06 09:58:24 +02:00
category chore(init/category/combinators): remove monad.for 2017-07-26 11:52:11 +01:00
data feat(frontends/lean): recursive equation preprocessor 2017-08-18 15:06:11 -07:00
meta fix(library/init/meta/interactive_base): incorrect pattern 2017-08-18 17:05:44 -07:00
native chore(init/category/combinators): remove monad.for 2017-07-26 11:52:11 +01:00
cc_lemmas.lean feat(frontends/lean): use . for field access 2017-03-28 15:29:54 -07:00
classical.lean refactor(init/classical): simplify classical proofs 2017-07-28 16:47:53 +01:00
coe.lean chore(library): convert comments to docstrings 2017-06-12 15:17:00 +02:00
core.lean perf(frontends/lean): add notation #[...] 2017-07-21 04:20:48 -07:00
default.lean feat(init/meta/attribute,library/tactic/attribute): user_attribute apply handlers 2017-08-02 14:32:39 +01:00
function.lean refactor(frontends/lean/token_table,library): take ~> assume 2017-07-05 11:20:10 -07:00
funext.lean refactor(frontends/lean/token_table,library): take ~> assume 2017-07-05 11:20:10 -07:00
init.md chore(*.md): fix/remove broken links 2016-02-23 10:11:24 -08:00
logic.lean feat(frontends/lean): recursive equation preprocessor 2017-08-18 15:06:11 -07:00
propext.lean feat(frontends/lean): add support for t.<id> and t.<idx> when t is a composite term 2017-03-28 17:47:49 -07:00
relator.lean refactor(frontends/lean/token_table,library): take ~> assume 2017-07-05 11:20:10 -07:00
util.lean refactor(library): has_to_string ==> has_repr 2017-06-18 18:29:19 -07:00
wf.lean refactor(frontends/lean/token_table,library): take ~> assume 2017-07-05 11:20:10 -07:00