Leonardo de Moura 7ac6b14d2a chore(library/init/data/int/basic): use abstract when transfering in an instance declaration ... @johoelzl I'm using `abstract` tactic because instances are automatically marked as [reducible], and they will be unfolded when solving unification constraints. This cannot be avoided since we need to solve unification constraints such as int.has_add =?= comm_ring.to_has_add int.comm_ring The `abstract tac` tactic creates an auxiliary lemma to store the proof generated by `tac`. If we use `print int.comm_ring` we can see that the definition is much smaller. The proofs are irrelevant. So, this has no drawbacks, and gives us a good performance boost.		2017-03-07 19:57:43 -08:00
..
data	feat(library/data/dlist): setup transfer for dlist	2017-03-07 19:30:51 -08:00
init	chore(library/init/data/int/basic): use abstract when transfering in an instance declaration	2017-03-07 19:57:43 -08:00
smt	feat(frontends/lean): expr literals ```(...)	2017-03-05 08:37:16 -08:00
system	feat(library/system/io): replace io.monad with io.bind, io.return and io.map	2017-03-07 16:10:47 -08:00
tools	feat(library/init/category/combinators): put list combinators in the namespace list	2017-03-05 21:30:30 -08:00
.project	feat(*): C++ code generator	2016-12-05 16:11:41 -08:00
library.md	feat(frontends/lean): (Type u) can't be a proposition	2017-01-30 11:54:00 -08:00
standard.lean	chore(library/system): enforce Lean naming conventions IO ==> io	2016-11-17 11:27:37 -08:00