michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
5769 commits 3 branches 0 tags 28 MiB
Commit graph

71 commits

Author SHA1 Message Date
Leonardo de Moura
4ec0e1b07c feat(frontends/lean): improve calc mode 
Now, it automatically supports transitivity of the form
    (R a b) -> (b = c) -> R a c
    (a = b) -> (R b c) -> R a c

closes #507
 2015-04-04 08:58:35 -07:00
Leonardo de Moura
75621df52b feat(frontends/lean): uniform notation for lists in tactics 
closes #504
 2015-03-27 17:54:48 -07:00
Leonardo de Moura
b9e3c474c9 feat(library/tactic): add all_goals tactic 
closes #501
 2015-03-25 17:42:34 -07:00
Leonardo de Moura
74b28f6ad9 feat(library,hott): new notation for typeof 2015-03-24 18:35:21 -07:00
Leonardo de Moura
5bf46d1226 fix(library/tactic/inversion_tactic): improve 'cases' tactic for HoTT mode 
closes #481
 2015-03-23 18:06:11 -07:00
Floris van Doorn
c914b79341 feat(hott/algebra/category): show that functor category is univalent if codomain is 2015-03-16 17:15:51 -07:00
Floris van Doorn
ebba33057c feat(hott): add arity.hlean, about multivariate functions 2015-03-16 17:15:51 -07:00
Floris van Doorn
71f9a5d1d2 feat(hott/algebra/precategory): do lots of stuff with categories 2015-03-16 17:15:51 -07:00
Leonardo de Moura
d7c6028a3e refactor(hott,library): use/test the rewrite tactic in more places 
The performance also improved.
 2015-03-12 17:25:31 -07:00
Leonardo de Moura
1490bdad49 feat(frontends/lean): add version of 'exact' tactic (sexact) that enforces goal type during term elaboration 2015-03-06 17:34:45 -08:00
Leonardo de Moura
368f9d347e refactor(frontends/lean): approach used to parse tactics 
The previous approach was too fragile

TODO: we should add separate parsing tables for tactics
 2015-03-05 18:11:21 -08:00
Leonardo de Moura
039afb4578 feat(frontends/lean): treat "proof t qed" as alias for "by exact t" 2015-03-05 11:12:39 -08:00
Leonardo de Moura
8295ef4e57 fix(library/tactic/class_instance_synth): constraint execution order at type class resolution 
We could not fix this problem before because we did not have the
[quasireducible] annotation.

Without this annotation, the fixed TC would loop in some HoTT files.
 2015-03-04 22:20:20 -08:00
Jeremy Avigad
c09f1c4eaf feat(*.md): create markdown files for HoTT library, update ones in standard library 2015-03-04 18:33:18 -08:00
Floris van Doorn
3d7656078d feat(hott/types): prove that 'is_equiv f' is an hprop 2015-03-04 00:22:51 -05:00
Floris van Doorn
5b922aad5c feat(init): add 'do' tactic 2015-03-04 00:17:41 -05:00
Leonardo de Moura
e40e2f0677 feat(hott/init): define num.sub in the HoTT library 2015-03-03 16:22:59 -08:00
Leonardo de Moura
ca57b43698 feat(library/tactic): add 'change' tactic 2015-03-01 14:15:39 -08:00
Floris van Doorn
1559e0e58c feat(hott): some more renaming in category library 2015-02-28 01:16:23 -05:00
Floris van Doorn
326eaffafb style(hott/algebra): rename theorems in the HoTT category libraries 2015-02-28 01:16:23 -05:00
Floris van Doorn
23a248ab28 style(hott): let inverse notation have higher binding power than application 2015-02-28 01:16:23 -05:00
Floris van Doorn
219f7ae11a feat(hott/algebra/precategory): general cleanup in precategories, define uncurrying functor 2015-02-28 01:16:23 -05:00
Floris van Doorn
f513538631 feat(hott): more cleanup of HoTT library 
remove funext class,
remove a couple of sorry's,
add characterization of equality in trunctypes,
use Jeremy's format for headers everywhere in the HoTT library,
continue working on Yoneda embedding
 2015-02-26 13:19:54 -05:00
Floris van Doorn
c091acc55b feat(hott): remove funext as type class, add theorems to prove equalities between functors and natural transformations 2015-02-26 12:52:33 -05:00
Floris van Doorn
9201bd7ca6 feat (hott/init): move nat.of_num to init.num and make it reducible outside namespace nat 
This is so that init.trunc can already use nat.of_num.
Also make nat.of_num reducible in the standard library
Also make gt and ge abbreviations
 2015-02-26 12:28:57 -05:00
Leonardo de Moura
68110faa4d feat(frontends/lean/inductive_cmd): allow '|' in inductive datatype declarations 2015-02-25 17:00:10 -08:00
Leonardo de Moura
3c24461e51 refactor(*): modify '|' binding power, use 'abs a' instead of '|a|', and '(a | b)' instead of 'a | b' 2015-02-25 15:18:21 -08:00
Leonardo de Moura
c04c610b7b feat(frontends/lean): add 'assert H : A, ...' as notation for 'have H [visible] : A, ...' 2015-02-25 14:30:42 -08:00
Jeremy Avigad
e513b0ead4 refactor(library,hott): rename theorems for decidable and inhabited 
The convention is this: we use e.g. nat.is_inhabited and nat.has_decidable_eq
for these two purposes only, to avoid clashing with "inhabited" and "decidable_eq"
in a namespace. Otherwise, we use "decidable_foo" and "inhabited_foo".
 2015-02-25 14:05:07 -08:00
Leonardo de Moura
3ede8e9150 refactor(library): use [] binder annotation when declaring instances 2015-02-24 16:12:39 -08:00
Leonardo de Moura
1cd44e894b feat(library/tactic/class_instance_synth): conservative class-instance resolution: expand only definitions marked as reducible 
closes #442
 2015-02-24 16:12:35 -08:00
Floris van Doorn
61901cff81 feat(hott): rename definition and cleanup in HoTT library 
also add more definitions in types.pi, types.path, algebra.precategory

the (pre)category library still needs cleanup
authors of this commit: @avigad, @javra, @fpvandoorn
 2015-02-20 21:40:42 -05:00
Leonardo de Moura
421a30d75c feat(library): export [reducible] annotations from function namespace to top-level 
see issue #433
 2015-02-16 18:52:41 -08:00
Leonardo de Moura
a35cce38b3 feat(frontends/lean): new semantics for "protected" declarations 
closes #426
 2015-02-11 14:09:25 -08:00
Leonardo de Moura
b4dd2cc729 refactor(library/tactic/rewrite_tactic): more general rewrite step 
The rule can be an arbitrary expression.
Allow user to provide a pattern that restricts the application of the rule.
 2015-02-04 11:51:39 -08:00
Leonardo de Moura
c845e44777 feat(frontends/lean): parse rewrite tactic 2015-02-04 11:51:39 -08:00
Leonardo de Moura
e2c41fca75 feat(frontends/lean): modify syntax for local notation 
The idea is to make it uniform with the syntax for defining local
attributes.
 2015-01-26 11:51:17 -08:00
Leonardo de Moura
b4d6f6e3ed feat(frontends/lean): 'attribute' command is persistent by default 2015-01-26 11:51:17 -08:00
Leonardo de Moura
4f2e0c6d7f refactor(frontends/lean): add 'attribute' command 
The new command provides a uniform way to set declaration attributes.
It replaces the commands: class, instance, coercion, multiple_instances,
reducible, irreducible
 2015-01-24 20:23:21 -08:00
Leonardo de Moura
2717adde94 feat(library/unifier): add option 'unifier.conservative', use option by default in the calc_assistant 2015-01-19 16:23:29 -08:00
Leonardo de Moura
2e4a2451e6 refactor(library/reducible): simplify reducible/irreducible semantics 2015-01-08 18:52:18 -08:00
Jakob von Raumer
0e34a1838d feat(hott) create new file with advanced truncatedness lemmas 2015-01-03 22:31:39 -08:00
Jakob von Raumer
31b3bbe5cb chore(hott/init/axioms) remove +1 in universe levels from axioms 2015-01-03 22:31:39 -08:00
Jakob von Raumer
0a1aab9ff9 chore(hott) make univalence an axiom again 2015-01-03 22:31:39 -08:00
Leonardo de Moura
0627ad2f56 feat(hott/init/nat): add basic facts about natural numbers 2014-12-20 11:32:27 -08:00
Leonardo de Moura
d75ef7a07a feat(hott/init/types): add 'sum' notation 2014-12-20 11:32:27 -08:00
Leonardo de Moura
6843fe3a8b refactor(hott/init): 'prod' and 'sum' notation should be infix right like 'and' and 'or' 2014-12-20 11:32:27 -08:00
Leonardo de Moura
187f4483e9 refactor(hott/init/util.hlean): modify definition to make it more convenient for definitional package 2014-12-19 22:00:25 -08:00
Leonardo de Moura
2e93e5d6a7 fix(hott/init): minimize number of universe parameters 2014-12-19 22:00:25 -08:00
Leonardo de Moura
f93278eab8 fix(hott/init/hedberg): remove unnecessary import 2014-12-19 19:01:07 -08:00