Leonardo de Moura d4f2bb77b8 feat(frontends/lean): recursive equation preprocessor ... To make the equation compiler more convenient to use, we will add a couple of preprocessing steps. This commit adds the first one of them. In this step, we use type inference to refine pattern variables, and we relax the restrictions on inaccessible annotations. We will also add a preprocessing step that implements the "complete transition" step before we execute the elim_match step.		2017-08-18 15:06:11 -07:00
..
array	refactor(init/data/list): move out advanced list defs	2017-07-26 11:52:11 +01:00
bool	feat(init/data/bool/lemmas): theorems about to_bool and bool coercion	2017-07-05 12:37:54 -07:00
char	refactor(frontends/lean/tactic_notation): rename note/define tactics to have/let	2017-06-22 08:03:23 -07:00
fin	chore(init/category/combinators): remove monad.for	2017-07-26 11:52:11 +01:00
int	chore(init/data/int): remove unused lemmas	2017-08-02 14:41:35 +01:00
list	feat(init/meta/interactive): rw at *, rw at h1 h2 |- support	2017-07-28 16:47:02 +01:00
nat	feat(frontends/lean): recursive equation preprocessor	2017-08-18 15:06:11 -07:00
option	feat(init/data/option/instances): = none of is_none	2017-07-05 12:37:54 -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): list.taken/dropn ~> list.take/drop	2017-07-05 11:20:10 -07:00
subtype	feat(init/data/subtype): add subtype.eta	2017-05-27 04:13:59 -04:00
sum	feat(frontends/lean): no global universes in the frontend	2017-02-08 17:23:04 -08:00
unsigned	feat(library/init/data/fin): add div	2017-03-05 16:43:15 -08:00
basic.lean	refactor(library): add has_to_string back (but it produces unquoted values)	2017-06-18 18:30:10 -07:00
default.lean	refactor(library): remove vector and bitvec from init	2017-08-16 13:40:50 -07:00
option_t.lean	refactor(frontends/lean/tactic_notation): rename note/define tactics to have/let	2017-06-22 08:03:23 -07:00
ordering.lean	feat(init/data/ordering): ordering.or_else, string lex order	2017-07-05 12:37:54 -07:00
prod.lean	feat(library/init/data/prod): add prod.map	2017-03-07 19:30:51 -08: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	fix(library/init/data/repr): give correct implementation of nat.repr	2017-06-19 16:20:27 +02:00
set.lean	feat(library/tactic/dsimplify): new configuration options for dsimp	2017-07-02 18:26:03 -07:00
setoid.lean	chore(library/init/data/quot): use Sort instead of Type	2017-03-07 14:29:57 -08:00
to_string.lean	refactor(library): add has_to_string back (but it produces unquoted values)	2017-06-18 18:30:10 -07:00
unit.lean	refactor(library/data): delete init/data/instances.lean	2016-12-02 16:41:16 -08:00