| .. |
|
binary.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
bool.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
cast.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
classical.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
congruence.lean
|
feat(library/standard/congruence.lean): add class to infer that a function is a congruence with respect to two relations
|
2014-08-01 09:11:51 -07:00 |
|
decidable.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
diaconescu.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
equivalence.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
function.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
funext.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
hilbert.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
if.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
list.lean
|
feat(library/standard/list.lean): begin to port lists from lean 0.1
|
2014-08-01 09:11:51 -07:00 |
|
logic.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
Makefile
|
feat(build): add Makefile for libraries
|
2014-06-28 18:41:53 -07:00 |
|
nat.lean
|
feat(library/standard): add or_inl and or_inr as short-hands for the commonly used 'or_intro_left _' and 'or_intro_right _'
|
2014-07-27 17:25:57 -07:00 |
|
num.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
option.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
pair.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
piext.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
prop_decidable.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
set.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
standard.lean
|
feat(library/standard): add decidable class
|
2014-07-20 00:19:32 +01:00 |
|
string.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
sum.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
tactic.lean
|
feat(frontends/lean): add tactic_hint command
|
2014-07-08 15:08:13 -07:00 |
|
unit.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
|
wf.lean
|
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt
|
2014-07-28 19:59:38 -07:00 |
