Leonardo de Moura
|
fd5bfc7dfe
|
refactor(kernel): simplify binder_info
Now, it is an enumeration type like its Lean counterpart.
|
2018-06-20 15:31:40 -07:00 |
|
Leonardo de Moura
|
3e81f88887
|
feat(library): implement new cache API for fun_info
|
2018-03-05 15:46:42 -08:00 |
|
Leonardo de Moura
|
bdea7d420d
|
chore(*): type_context ==> type_context_old
|
2018-03-05 12:38:24 -08:00 |
|
Sebastian Ullrich
|
f3ca420b64
|
feat(frontends/lean/elaborator): hide opt/auto param types when elaborating structure field values
|
2018-02-28 12:49:22 +01:00 |
|
Leonardo de Moura
|
78d8ff8031
|
feat(*): add reset_thread_local
|
2018-02-21 15:04:19 -08:00 |
|
Leonardo de Moura
|
ec1a490a15
|
chore(*): annotate candidates for thread local cache reset
|
2018-02-01 14:59:37 -08:00 |
|
Leonardo de Moura
|
d315e424ff
|
feat(library/congr_lemma, library/fun_info): make sure opt_param gadget do not confuse the simplifier, fun_info, congr_lemma, etc
A definition such as
def f (a : nat) (b : nat := a) (c : nat := a) :=
a + b + c
should *not* be treated as a dependent function.
|
2017-01-30 20:23:45 -08:00 |
|
Leonardo de Moura
|
ecb563baa3
|
chore(library/fun_info): patch assertion
The fixed assertion makes sure we don't get an array-index-out-of-bounds
in the for-loop in the end of the procedure.
|
2016-11-04 10:14:00 -07:00 |
|
Daniel Selsam
|
f3dc41b631
|
fix(library/tactic/simplify): only use auto_eq_congr if number of args match
|
2016-11-04 10:13:02 -07:00 |
|
Leonardo de Moura
|
dce8776cfd
|
refactor(library/fun_info): separate subsingleton information from general param_info
|
2016-07-07 07:39:26 -07:00 |
|
Leonardo de Moura
|
6063d2fc80
|
feat(library): add cache_helper
|
2016-06-22 17:10:03 -07:00 |
|
Leonardo de Moura
|
61de427699
|
feat(library/init/meta/fun_info): expose fun_info
|
2016-06-22 14:00:00 -07:00 |
|
Leonardo de Moura
|
16c050b66c
|
reactor(library): port fun_info_manager to new type_context (and rename module to fun_info)
|
2016-06-21 10:42:38 -07:00 |
|