lean2/library/data
Leonardo de Moura 3657d4c3ab feat(frontends/lean): coercion num -> int even when nat is not open, closes #219
I also had to mark the coercions as reducible.
Otherwise, given the constraint

          ?M (int.of_num 0) =?= (int.of_nat (nat.to_nat 0))

the unifier will not generate the solution

          ?M := fun x, x
2014-10-01 11:09:10 -07:00
..
int feat(frontends/lean): coercion num -> int even when nat is not open, closes #219 2014-10-01 11:09:10 -07:00
list refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
nat feat(frontends/lean): coercion num -> int even when nat is not open, closes #219 2014-10-01 11:09:10 -07:00
quotient feat(frontends/lean): add 'reducible' modifier for controlling which 2014-09-19 15:54:32 -07:00
bool.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
data.md refactor(library): remove unnecessary 'standard' subdirectory 2014-08-23 18:08:09 -07:00
default.lean refactor(library): remove unnecessary 'standard' subdirectory 2014-08-23 18:08:09 -07:00
empty.lean refactor(frontends/lean): replace '[protected]' modifier with 'protected definition' and 'protected theorem', '[protected]' is not a hint. 2014-09-19 15:54:32 -07:00
num.lean refactor(frontends/lean): replace '[protected]' modifier with 'protected definition' and 'protected theorem', '[protected]' is not a hint. 2014-09-19 15:54:32 -07:00
option.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
prod.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
set.lean refactor(library): add namespaces 'or', 'and' and 'iff' 2014-09-04 21:25:21 -07:00
sigma.lean feat(library): changes in eq.lean sigma.lean and category.lean 2014-09-26 19:45:23 -04:00
string.lean refactor(frontends/lean): replace '[protected]' modifier with 'protected definition' and 'protected theorem', '[protected]' is not a hint. 2014-09-19 15:54:32 -07:00
subtype.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
sum.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
unit.lean refactor(library): mark 'decidable' theorems as definitions 2014-09-30 09:02:37 -07:00
vector.lean refactor(library/data/vector): rename 'vec' to 'vector' 2014-09-19 16:20:50 -07:00