Leonardo de Moura c9e4c89d9c chore(library/init/meta): remove mk_dec_eq_instance ... The tactic mk_dec_eq_instance constructs a function using the brec_on recursor. The compiler generates horrible code for this kind of definition. It creates a closure for each recursive call. Moreover, `brec_on` accumulates all intermediate results. To generate efficient code, we need to generate a collection of recursive equations, and then invoke the equation compiler. cc @kha		2018-04-27 16:13:10 -07:00
..
array	refactor(library): keep only basic nat theorems	2018-04-11 16:47:54 -07:00
bool	feat(library/init): modify && and || precedence	2018-04-26 13:40:57 -07:00
char	feat(library/init/data/char): use bool instead of Prop for basic char predicates	2018-04-26 13:46:59 -07:00
fin	feat(library/init/data): add uint16 and make sure uint* - uses wraparound semantics like most programming languages	2018-04-20 18:27:13 -07:00
int	chore(library/init/meta): remove mk_dec_eq_instance	2018-04-27 16:13:10 -07:00
list	refactor(init): init/category ==> init.control	2018-04-27 08:33:08 -07:00
nat	refactor(library): keep only basic nat theorems	2018-04-11 16:47:54 -07:00
option	refactor(init): init/category ==> init.control	2018-04-27 08:33:08 -07:00
ordering	chore(*): remove algebra	2018-04-10 15:53:14 -07:00
rbmap	chore(library/init/data/rbmap): add missing file	2017-11-19 19:49:36 -08:00
rbtree	feat(library/init/data/rbtree): add rbtree.seteq	2018-04-25 16:13:38 -07:00
sigma	refactor(frontends/lean/tactic_notation): rename note/define tactics to have/let	2017-06-22 08:03:23 -07:00
string	refactor(library/init/data/string): define decidable_eq string instance earlier	2018-04-27 08:16:14 -07:00
subtype	chore(library/init/meta): remove mk_dec_eq_instance	2018-04-27 16:13:10 -07:00
sum	chore(library/init/meta): remove mk_dec_eq_instance	2018-04-27 16:13:10 -07:00
basic.lean	feat(library/init): modify && and || precedence	2018-04-26 13:40:57 -07:00
default.lean	refactor(library): keep only basic nat theorems	2018-04-11 16:47:54 -07:00
prod.lean	feat(init): some simp lemmas	2018-03-01 16:07:52 +01:00
punit.lean	refactor(library/init/core,library/init/unit): make unit an abbreviation of punit.{0}	2018-03-27 10:33:04 -07:00
quot.lean	feat(init/data/quot): show that quot is the quotient by the generated equivalence	2017-05-27 04:14:00 -04:00
repr.lean	feat(library/init/data): modify unit has_to_string and has_repr instances	2018-04-27 13:39:19 -07:00
set.lean	refactor(init): init/category ==> init.control	2018-04-27 08:33:08 -07:00
setoid.lean	fix(library/init/data/setoid): fix redundant parameter	2018-01-28 15:49:35 -08:00
to_string.lean	feat(library/init/data): modify unit has_to_string and has_repr instances	2018-04-27 13:39:19 -07:00
uint.lean	feat(library/init/data): add uint16 and make sure uint* - uses wraparound semantics like most programming languages	2018-04-20 18:27:13 -07:00