lean4-htt/library/init/lean
Leonardo de Moura 441b9077b2 feat(library/comp_val): add mk_name_val_ne_proof
We need this procedure otherwise it takes forever to prove equation lemmas
for definitions such as:

```
def macros : name → option macro
| `lambda := some lambda_macro
| `intro_x := some intro_x_macro
| _ := none
```

We never experienced this problem in Lean3 because we used `name`
literals only occurred in patterns of *meta* definitions. So, no
equation lemma was generated.

@kha `def macros` was taking more than 1 second to elaborate on my
machine. It is now instantaneous.
2018-06-06 09:18:59 -07:00
..
core feat(library/init/lean/core): define core language 2018-05-18 15:35:42 -07:00
ir refactor(library/init/lean/ir/parser): parser.lean => parser_t.lean 2018-06-05 08:00:13 -07:00
parser refactor(library/init/lean/parser/syntax): replace syntax.lst with syntax.node, remove span field from syntax_node 2018-06-06 15:46:39 +02:00
config.lean feat(library/init/lean): add lean.closure_max_args 2018-05-13 08:40:46 -07:00
disjoint_set.lean feat(library/init/lean/ir): add elim_phi function 2018-05-06 10:07:44 -07:00
format.lean refactor(library/init/lean/ir): platform dependent IR 2018-05-10 13:15:02 -07:00
level.lean feat(library/init/lean/level): missing functions 2018-05-22 10:49:24 -07:00
macro.lean chore(library/compiler): delete rec_fn_macro 2018-05-31 17:11:25 -07:00
name.lean feat(library/comp_val): add mk_name_val_ne_proof 2018-06-06 09:18:59 -07:00
name_mangling.lean feat(init/lean/parser/parser): make a monad transformer 2018-06-04 12:57:23 +02:00
options.lean feat(library/init/lean/options): add lean.options 2018-05-18 14:51:40 +02:00
pos.lean refactor(library/init/lean/trace): avoid init.meta import 2018-05-17 14:25:12 +02:00
trace.lean feat(library/init/lean/trace): implement conditional tracing via good old trace classes 2018-05-18 14:52:15 +02:00