| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-03-07 | Adding Order.enum and related definitions and theorems | Cyril Cohen | |
| 2021-01-22 | Remove deprecation aliases introduced in 1.9.0 | Kazuhiko Sakaguchi | |
| 2021-01-16 | Drop support for Coq 8.10 and deprecate the `deprecate` notation | Kazuhiko Sakaguchi | |
| - The `deprecate` notation and `iota_add` have been deprecated. All the uses of the `deprecate` notation have been replaced with the `deprecated` attribute. - Deprecation aliases in `ssrnat` and `ssrnum` introduced in MathComp 1.11+beta1 have been removed. - Remove `VDFILE` related hacks from `Makefile.common`. | |||
| 2020-12-16 | Add `pairwise r xs` predicate | Kazuhiko Sakaguchi | |
| which asserts that the relation `r` holds for any i-th and j-th element of `xs` such that i < j. | |||
| 2020-11-25 | Rename `all1rel` to `all2rel`, restate `eq_allrel`, and add CHANGELOG entries | Kazuhiko Sakaguchi | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> | |||
| 2020-11-25 | Apply suggestions from code review | Kazuhiko Sakaguchi | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> | |||
| 2020-11-25 | Apply suggestions from code review | Kazuhiko Sakaguchi | |
| Co-authored-by: Christian Doczkal <christian.doczkal@inria.fr> | |||
| 2020-11-25 | Generalize `allrel` to take two lists as arguments | Kazuhiko Sakaguchi | |
| 2020-11-24 | Add more `_in` lemmas and CHANGELOG entries | Kazuhiko Sakaguchi | |
| 2020-11-24 | factoring out in_sig | Cyril Cohen | |
| 2020-11-24 | Add `_in` lemmas for `sort` | Kazuhiko Sakaguchi | |
| 2020-11-23 | Merge pull request #667 from CohenCyril/ssrcoq8.10 | Enrico Tassi | |
| Using Coq 8.10 ssreflect new features | |||
| 2020-11-20 | Tuning simplifications using Arguments simpl nomatch | Cyril Cohen | |
| 2020-11-20 | Using Coq 8.10 ssreflect new features | Cyril Cohen | |
| 2020-11-20 | typo in documentation of allpairs_dep | Yves Bertot | |
| 2020-11-19 | add declare scopes | Reynald Affeldt | |
| 2020-11-12 | Apply suggestions from Kazuhiko | Cyril Cohen | |
| Co-authored-by: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-11-12 | Equivalences instead of implications for `count_maskP` and `count_subseqP` | Cyril Cohen | |
| 2020-11-12 | Shorter proofs and suggestions by Kazuhiko | Cyril Cohen | |
| Co-authored-by: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-11-12 | Adding some theory for `rem` and generalizing `subset_maskP` | Cyril Cohen | |
| - Added helper lemmas about `rem`: `rem_cons` (to control unfolding), `remE`, `count_rem`, `count_mem_rem`, and `subseq_mem`. (New lemma `drop_index` briges the gap between `cat_take_drop` and `remE`). - `subset_maskP`, which was not released yet is generalized with hypothesis `(forall x, count_mem x s1 <= count_mem x s2)`, instead of `uniq s1` and `{subset s1 <= s2}`, the previous behaviour can be restored with helper lemma `leq_uniq_count` - Its trivial consequence `subset_subseqP` has been added too. | |||
| 2020-11-11 | Merge pull request #640 from CohenCyril/fix_iota_add | Cyril Cohen | |
| Deprecation of iota_add delayed, and not the one of iter_add | |||
| 2020-11-11 | make pivot the first argument in uniq_subseq_pivot | Christian Doczkal | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> | |||
| 2020-11-11 | turn uniq_subseq_pivot into equality | Christian Doczkal | |
| 2020-11-11 | Apply suggestions from code review | Christian Doczkal | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> Co-authored-by: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-11-11 | fixup after feedback from Cyril | Christian Doczkal | |
| 2020-11-11 | Apply suggestions from code review | Christian Doczkal | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> | |||
| 2020-11-11 | suggestions from Cyril | Christian Doczkal | |
| 2020-11-11 | lemmas on subseq and rot | Christian Doczkal | |
| 2020-11-11 | Deprecation of iota_add delayed, and not the one of iter_add | Cyril Cohen | |
| 2020-11-11 | Merge pull request #632 from pi8027/path-cycle-sorted | Cyril Cohen | |
| Reorganize, generalize, and add lemmas about `path`, `cycle`, and `sorted` | |||
| 2020-11-11 | New lemmas about allpairs | Cyril Cohen | |
| Co-authored-by: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-11-11 | Apply suggestions from code review | Kazuhiko Sakaguchi | |
| Co-authored-by: Cyril Cohen <CohenCyril@users.noreply.github.com> | |||
| 2020-11-10 | Reorganize, generalize, and add lemmas about `path`, `cycle`, and `sorted` | Kazuhiko Sakaguchi | |
| - Add `allss` and `all_mask` lemmas. - Since `path`, `cycle`, and `sorted` share similar properties, these lemmas have been relocated in the same place to improve the visibility. Some missing lemmas have also been discovered and added. - Generalize `sub_path_in`, `sub_sorted_in`, and `eq_path_in` for non-`eqType` T by introducing a predicate `P : {pred T}`. | |||
| 2020-11-02 | lemmas for reasoing about "rot n (rot m s)" | Christian Doczkal | |
| 2020-10-29 | Switch from long suffixes to short suffixes | Kazuhiko Sakaguchi | |
| 2020-10-10 | generalization and shorter proofs | Cyril Cohen | |
| Co-authored-by: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-10-09 | Added results about `mask` and `subseq` | Cyril Cohen | |
| 2020-09-08 | split_find_nth and split_find lemmas | Cyril Cohen | |
| 2020-09-03 | Adding allrel predicate | Cyril Cohen | |
| 2020-06-18 | drop_uniq / CHANGELOG | Christian Doczkal | |
| 2020-06-18 | cardinality lemmas for #|A| <= 1 and n <= #|A| | Christian Doczkal | |
| 2020-05-16 | A few more revisions | Kazuhiko Sakaguchi | |
| 2020-05-13 | Revise proofs in ssreflect/*.v | Kazuhiko Sakaguchi | |
| This change reduces - use of numerical occurrence selectors (#436) and - use of non ssreflect tactics such as `auto`, and improves use of comparison predicates such as `posnP`, `leqP`, `ltnP`, `ltngtP`, and `eqVneq`. | |||
| 2020-04-10 | Make `all2` better wrt the guard condition | Cyril Cohen | |
| fixes #469 | |||
| 2020-04-09 | - switching long suffixes to short suffixes | Reynald Affeldt | |
| + `odd_add` -> `oddD` + `odd_sub` -> `oddB` + `take_addn` -> `takeD` + `rot_addn` -> `rotD` + `nseq_addn` -> `nseqD` fixes #359 | |||
| 2020-04-02 | Merge pull request #468 from ybertot/remove-deprecated-from-1.9 | Enrico Tassi | |
| remove deprecated commands whose deprecation was introduced in 1.9.0 | |||
| 2020-04-01 | Merge pull request #429 from pi8027/extend-nat-comparison | Yves Bertot | |
| Extend comparison predicates for nat with minn and maxn and reorder arguments of those in order.v | |||
| 2020-03-31 | remove deprecated commands whose deprecation was introduced in release 1.9.0 | Yves Bertot | |
| fixes #418 | |||
| 2020-03-15 | Extend comparison predicates for nat with minn and maxn | Kazuhiko Sakaguchi | |
| 2020-01-28 | Added lemmas about foldl, scanl, foldr and rcons and cons | Cyril Cohen | |
