Leonardo de Moura
|
828ce3f8dc
|
feat(frontends/lean/decl_cmds): minor modifications for supporting mutually recursive functions
|
2015-01-05 19:23:50 -08:00 |
|
Leonardo de Moura
|
322cdb8a98
|
feat(library/definitional/equations): add 'equations_result' macro used to wrap multiple functions being defined by recursive equations
This is only useful when compiling "mutually recursive" functions.
|
2015-01-05 19:09:20 -08:00 |
|
Leonardo de Moura
|
3325d791de
|
fix(library/definitional/equations): bug in recursive application elimination
|
2015-01-05 17:17:14 -08:00 |
|
Leonardo de Moura
|
cbae6a2ca0
|
test(tests/lean/run): define list filter function using recursive equations
|
2015-01-05 17:05:01 -08:00 |
|
Leonardo de Moura
|
a24a7f7fa1
|
test(tests/lean/run) define vector last and unzip functions using recursive equations
|
2015-01-05 17:04:55 -08:00 |
|
Leonardo de Moura
|
eedc31f7e9
|
fix(library/definitional/equations): bug in "complete" transition
|
2015-01-05 16:27:29 -08:00 |
|
Leonardo de Moura
|
3889b60152
|
feat(library/definitional/equations): allow inductive datatype parameters in recursive equations
|
2015-01-05 15:56:28 -08:00 |
|
Leonardo de Moura
|
6eba4b4ac1
|
chore(library/definitional/equations): cleanup
|
2015-01-05 13:57:13 -08:00 |
|
Leonardo de Moura
|
d8f3bcec67
|
feat(library/init/logic): add 'arbitrary'
It is identical to default, but it is opaque.
That is, when we use 'arbitrary A', we cannot rely on the particular
value selected.
|
2015-01-05 13:27:09 -08:00 |
|
Leonardo de Moura
|
0d84943d52
|
test(tests/lean/run): show that nat has decidable equality using recursive equations
|
2015-01-05 12:41:18 -08:00 |
|
Leonardo de Moura
|
fd332e411d
|
test(tests/lean/run): add more overlapping patterns examples
|
2015-01-05 12:25:14 -08:00 |
|
Leonardo de Moura
|
b46c377aa2
|
feat(library/definitional/equations): add "complete" transition for overlapping patterns
|
2015-01-05 11:49:27 -08:00 |
|
Leonardo de Moura
|
fdef3e5407
|
feat(library/definitional/equations): add support for reflexive datatypes in the definitional package
|
2015-01-05 11:13:35 -08:00 |
|
Leonardo de Moura
|
23fa16a23d
|
refactor(library/init): move num.succ to init.datatypes
|
2015-01-05 10:29:06 -08:00 |
|
Leonardo de Moura
|
5e228d92d2
|
fix(library/definitional/equations): missing case
|
2015-01-04 20:49:53 -08:00 |
|
Leonardo de Moura
|
f07475667b
|
test(tests/lean/run): define vector map using recursive equations
|
2015-01-04 19:56:50 -08:00 |
|
Leonardo de Moura
|
576c053c25
|
fix(library/tactic/inversion_tactic): bug at implementation_list update
|
2015-01-04 19:56:10 -08:00 |
|
Leonardo de Moura
|
7ff03e2846
|
test(tests/lean/run): define vector diagonal using recursive equations
|
2015-01-04 17:58:35 -08:00 |
|
Leonardo de Moura
|
7488378445
|
test(tests/lean/run): define list append using recursive equations
|
2015-01-04 17:58:24 -08:00 |
|
Leonardo de Moura
|
7fca862fc3
|
test(tests/lean/run): define fibonacci using recursive equations
|
2015-01-04 17:47:18 -08:00 |
|
Leonardo de Moura
|
faf78ce3e6
|
feat(library/definitional/equations): brec_on compilation
|
2015-01-04 17:45:13 -08:00 |
|
Leonardo de Moura
|
98a856373d
|
feat(library/util): add dec_level auxiliary procedure
|
2015-01-04 13:25:58 -08:00 |
|
Leonardo de Moura
|
926c140e17
|
fix(library/definitional/equations): fix clang compilation problems
|
2015-01-04 10:18:19 -08:00 |
|
Jakob von Raumer
|
e11c401d79
|
fix(hott/algebra) comment unfinished proofs out for later completion
|
2015-01-03 22:31:40 -08:00 |
|
Jakob von Raumer
|
4de1a07324
|
chore(hott/algebra) maybe use only lower case file names
|
2015-01-03 22:31:40 -08:00 |
|
Jakob von Raumer
|
334db4ec1e
|
feat(hott/algebra) start to formalize the category of sets (seems to be pretty tough)
|
2015-01-03 22:31:40 -08:00 |
|
Jakob von Raumer
|
f59c2559b6
|
feat(hott/algebra) add proof that functors into strict cats form an hset
|
2015-01-03 22:31:39 -08:00 |
|
Jakob von Raumer
|
0faf585773
|
feat(hott) start characterizing truncatedness by sigma and pi types
|
2015-01-03 22:31:39 -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
|
0915da6625
|
chore(hott/algebra) modify the proof that taking the dual category is involutive
|
2015-01-03 22:31:39 -08:00 |
|
Jakob von Raumer
|
428a2b6f58
|
chore(hott/algebra) complete the sigma characterization
|
2015-01-03 22:31:39 -08:00 |
|
Jakob von Raumer
|
4af0a911b3
|
feat(hott/algebra) finish functor category up to that missing sigma characterization
|
2015-01-03 22:31:39 -08:00 |
|
Jakob von Raumer
|
31d1076bd7
|
fix(hott/algebra) fix some proofs for functor category
|
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
|
98803406cc
|
chore(hott/algebra) add sigma characterization of functors, turn functors into structures
|
2015-01-03 22:31:39 -08:00 |
|
Jakob von Raumer
|
004a01629a
|
feat(hott) add preliminary axiomatized truncation operator
|
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 |
|
Jeremy Avigad
|
b11064a90e
|
fix(library/data/nat,int): fix instance declarations for nat and int
|
2015-01-03 22:27:21 -08:00 |
|
Leonardo de Moura
|
bdfa919098
|
feat(library/definitional/equations): add brec_on based compilation
|
2015-01-03 22:23:37 -08:00 |
|
Leonardo de Moura
|
42354cd4fa
|
feat(library/locals): add auxiliary templates
|
2015-01-03 22:23:08 -08:00 |
|
Leonardo de Moura
|
376126241e
|
fix(library/definitional/equations): typo and bug
|
2015-01-03 15:29:34 -08:00 |
|
Leonardo de Moura
|
5bf8141af2
|
test(tests/lean/hott): add test to demonstrate limitations of the current compilation procedure
|
2015-01-02 23:18:35 -08:00 |
|
Leonardo de Moura
|
21a9cd58a3
|
fix(library/definitional/equations): bug when compiling in proof relevant kernels
|
2015-01-02 23:17:33 -08:00 |
|
Leonardo de Moura
|
92b6c06a21
|
test(tests/lean/run): add basic pattern matching compilation test
|
2015-01-02 22:22:20 -08:00 |
|
Leonardo de Moura
|
4781fc8365
|
fix(library/init/logic): eq.symm should not use eq.subst
Reason: eq.symm is used by definitional package, and eq.subst is opaque.
Thus, computation will get stuck if it depends on eq.subst.
|
2015-01-02 22:20:08 -08:00 |
|
Leonardo de Moura
|
c66826787a
|
test(tests/lean/run): add basic pattern matching compilation test
|
2015-01-02 22:07:31 -08:00 |
|
Leonardo de Moura
|
7f7d318b22
|
feat(library/definitional/equations): add dependent pattern matching compilation
|
2015-01-02 22:06:40 -08:00 |
|
Leonardo de Moura
|
762a515a5b
|
feat(library/tactic/inversion_tactic): mark new arguments that have been "unified" into terms
|
2015-01-02 22:02:15 -08:00 |
|
Leonardo de Moura
|
3fb2d8bbc0
|
feat(library/tactic/inversion_tactic): use the "simpler" compilation approach in more cases
The approach implemented in the commit 8974d70c11ef7b9b2c5d can be
extended to indexed inductive families. See comments in the code.
|
2015-01-01 19:33:15 -08:00 |
|
Leonardo de Moura
|
be9e2500ce
|
feat(library/tactic/inversion_tactic): add more efficient "compilation" for non-indexed inductive datatypes
|
2015-01-01 19:33:14 -08:00 |
|