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

6320 commits

This branch
This branch
All branches
Author SHA1 Message Date
Leonardo de Moura
b790ca9806 fix(library/tactic/rewrite_tactic): type check rewriting steps 
closes #550
 2015-04-29 12:16:37 -07:00
Leonardo de Moura
91abba3c3d refactor(kernel): rename method 2015-04-29 11:46:27 -07:00
Leonardo de Moura
d1cb0018c0 fix(tests): adjust tests to reflect changes in the HoTT library 2015-04-29 10:15:13 -07:00
Floris van Doorn
297d50378d feat(hott): add definitions using truncations and theorems about them 
define embedding, (split) surjection, retraction, existential quantifier, 'or' connective
also add a whole bunch of theorems about these definitions

still has two sorry's which can be solved after #564 is closed
 2015-04-29 10:04:07 -07:00
Floris van Doorn
15c2ee289f feat(hott): make some fibrations in path.hlean implicit, and a bit of renaming in init 2015-04-29 10:04:07 -07:00
Floris van Doorn
5349839fa9 feat(hott): define pathovers and squares 2015-04-29 10:04:07 -07:00
Floris van Doorn
dbdb8e6050 feat(circle): prove the path computation rule for the circle 2015-04-29 10:04:07 -07:00
Floris van Doorn
c23e707874 feat(circle): define circle as sphere 1, remove all but 1 sorry 2015-04-29 10:04:07 -07:00
Floris van Doorn
6c061991cc feat(hit): prove path computation rules for all hits except the circle 2015-04-29 10:04:07 -07:00
Floris van Doorn
70a2f6534c feat(hit): derive path computation rule for elim and elim_type for every hit 
also make argument of eq_of_rel implicit
also remove most sorry's for hits

path computation rule for rec still needs to be done for all hits
 2015-04-29 10:04:07 -07:00
Floris van Doorn
4173c958f7 feat(init.ua): add some useful consequences of ua 2015-04-29 10:04:07 -07:00
Floris van Doorn
40086d0084 feat(hott): standardize the naming of definitions proving equality of elements of a structure 
examples:
foo_eq : Pi {A B : foo}, _ -> A = B
foo_mk_eq : Pi _, foo.mk _ = foo.mk _ (if constructor is called "bar", then this becomes "bar_eq")
foo_eq_equiv : Pi {A B : foo}, (A = B) ≃ _

also changed priority of some instances of is_trunc
 2015-04-29 10:04:06 -07:00
Floris van Doorn
b70841171a fix(hott): rename retr and sect to right_inv and left_inv 2015-04-29 10:04:06 -07:00
Floris van Doorn
797a2d2047 refactor(category): merge precategory/ and category/, organize construction files differently. 2015-04-29 10:04:06 -07:00
Floris van Doorn
23e6a3131d feat(precategory): add two redundant fields to precategory. Also some cleanup. 
In particular, all instances of "set_option apply.class_instance false" are removed
 2015-04-29 10:04:06 -07:00
Floris van Doorn
48f1aff848 feat(hott): add hit-markdown file 2015-04-29 10:04:06 -07:00
Floris van Doorn
052fbe0228 refactor(hott.init): remove subdirectories, merge some files 2015-04-29 10:04:06 -07:00
Floris van Doorn
86012d841b fix(hott): make f explicit in is_equiv.mk and a bit of renaming in init 2015-04-29 10:04:06 -07:00
Floris van Doorn
e769fdd9dc feat(hott): make some arguments in init.path implicit and rename apD to apd 2015-04-29 10:04:06 -07:00
Leonardo de Moura
b98c109f73 fix(kernel/hits/hits): bug in reduction rule 
closes #564
 2015-04-29 10:01:46 -07:00
Leonardo de Moura
051615712c fix(kernel/quotient/quotient): bug in reduction rule 2015-04-29 10:01:17 -07:00
Leonardo de Moura
d2c7b5c319 feat(library/tactic): add 'let' tactic 
closes #555
 2015-04-28 17:24:43 -07:00
Leonardo de Moura
16f237f042 feat(kernel/inductive): remove problematic check 
see discussion at issue #563

closes #563
 2015-04-28 17:21:41 -07:00
Leonardo de Moura
1be72f1faa feat(frontends/lean): parse argument of unary tactis with rbp=0, tokens may have a different precedence in expression and tactic modes 2015-04-28 13:43:05 -07:00
Leonardo de Moura
4283111198 fix(frontends/lean): missing files 2015-04-28 10:55:04 -07:00
Leonardo de Moura
a23118d357 feat(frontends/lean): add tactic_notation command 
This addresses the first part of issue #461

We still need support for tactic definitions
 2015-04-27 17:46:13 -07:00
Leonardo de Moura
ca8943f45b feat(library,hott): remove rapply tactic 2015-04-27 15:06:16 -07:00
Leonardo de Moura
88023e9597 fix(shell/lean): missing 'break' 2015-04-27 14:23:01 -07:00
Leonardo de Moura
bdef7aaf40 feat(frontends/lean/pp): add check_system at pretty printer 2015-04-27 14:21:53 -07:00
Leonardo de Moura
a3c3a94a51 feat(util/sexpr/format): add check_system at formatter 2015-04-27 14:21:25 -07:00
Leonardo de Moura
17c07cdb02 feat(library/data/rat/order): define abs and sign for rat before migrate 2015-04-27 12:59:02 -07:00
Leonardo de Moura
d41e055d1c feat(frontends/lean/migrate_cmd): catch memory error in the migrate command 2015-04-27 12:58:11 -07:00
Jeremy Avigad
7a1064b7e8 refactor(library/algebra/order.lean): rename a field in an order structure 2015-04-27 12:03:41 -07:00
Jeremy Avigad
d8e40d90d6 feat(library/data/rat/order.lean): make rat a linear ordered field 2015-04-27 12:03:41 -07:00
Leonardo de Moura
fee2b002fc fix(util/exception): typo in error message 2015-04-27 12:02:04 -07:00
Leonardo de Moura
dcc94dde82 refactor(kernel): rename may_reduce_later to is_stuck, and make is_stuck more precise 
It now reflects the definition used in the elaboration paper.
 2015-04-27 11:20:15 -07:00
Leonardo de Moura
68383d49de refactor(shell/lean): remove useless output 
It was added for implementing the web version, and avoid the need to
simulate a file system in the web browser.
It turns out we decided to use a virtual file system.
 2015-04-27 10:15:01 -07:00
Leonardo de Moura
76c773ad3d feat(library/data/examples/depchoice): add dependent choice example 2015-04-26 12:56:23 -07:00
Leonardo de Moura
072bf0b3b4 refactor(library): make sure "choose" compute inside the kernel 2015-04-25 23:10:48 -07:00
Leonardo de Moura
d455bb4c5b feat(library/data/fintype): add decidable_exists_finite 2015-04-25 21:38:03 -07:00
Leonardo de Moura
6bb6644c25 feat(library/data/squash): define squash type using quotients 2015-04-24 18:11:25 -07:00
Leonardo de Moura
9d01868361 feat(frontends/lean): use rewrite tactic to implement unfold (it has a unfold step) 
closes #502
 2015-04-24 17:23:12 -07:00
Leonardo de Moura
28404fe16d fix(library/tactic/rewrite_tactic): second problem reported at issue #548 
closes #548
 2015-04-24 16:49:32 -07:00
Leonardo de Moura
4148d6b8cc fix(library/tactic/rewrite_tactic): first two problems at issue #548 2015-04-24 16:07:00 -07:00
Leonardo de Moura
6134c8822a fix(frontends/lean/util): assertion violation 
fixes #559
 2015-04-24 15:09:23 -07:00
Leonardo de Moura
f723550d33 feat(frontends/lean/elaborator): decorates error message with free variables introduced by the left-hand-side of the equation 
closes #528
 2015-04-24 14:58:15 -07:00
Leonardo de Moura
4a157ee676 refactor(kernel/justification): create "wrapper" justification 
It allows us to provide a different pretty printer.

This is a cleanup, and also helps to address issue #528
 2015-04-24 14:49:32 -07:00
Leonardo de Moura
1149ead14c chore(library/logic/examples/colog88): remove unnecessary annotation 2015-04-24 12:45:06 -07:00
Leonardo de Moura
a5306e70eb feat(library/logic/examples/negative): add example showing that allowing negative inductive datatypes would lead to inconsistency 2015-04-24 09:33:09 -07:00
Leonardo de Moura
15c331591e feat(library/logic/examples/colog88): add example from COLOG-88 paper 2015-04-24 09:33:09 -07:00