| Age | Commit message (Collapse) | Author |
|
* Modified the definition of sort to work on any type
* Other Generalizations, fixes and CHANGELOG entry
* Add stability lemmas for `path.sort`
- Inverse the comparison in `merge` and swap arguments of it everywhere.
- Add `sort_rec1` and `sortE` to simplify inductive proofs on `sort`.
- Add `seq.mask_filter`, `mem2E`, `path_mask`, `path_filter`, and `sorted_mask`.
- Generalize `sorted_filter`, `homo_path_in`, `mono_path_in`, `homo_sorted_in`,
and `mono_sorted_in` to non-`eqType`s.
- Add the following lemmas to state the stability of `path.merge` and `path.sort`.
sorted_merge
: forall (T : Type) (leT : rel T),
transitive leT ->
forall s t : seq T, sorted leT (s ++ t) -> merge leT s t = s ++ t
merge_stable_path
: forall (T : Type) (leT leT' : rel T),
total leT ->
forall (x : T) (s1 s2 : seq T),
all (fun y : T => all (leT' y) s2) s1 ->
path [rel x0 y | leT x0 y && (leT y x0 ==> leT' x0 y)] x s1 ->
path [rel x0 y | leT x0 y && (leT y x0 ==> leT' x0 y)] x s2 ->
path [rel x0 y | leT x0 y && (leT y x0 ==> leT' x0 y)] x
(merge leT s1 s2)
merge_stable_sorted
: forall (T : Type) (leT leT' : rel T),
total leT ->
forall s1 s2 : seq T,
all (fun x : T => all (leT' x) s2) s1 ->
sorted [rel x y | leT x y && (leT y x ==> leT' x y)] s1 ->
sorted [rel x y | leT x y && (leT y x ==> leT' x y)] s2 ->
sorted [rel x y | leT x y && (leT y x ==> leT' x y)] (merge leT s1 s2)
sorted_sort
: forall (T : Type) (leT : rel T),
transitive leT -> forall s : seq T, sorted leT s -> sort leT s = s
sort_stable
: forall (T : Type) (leT leT' : rel T),
total leT -> transitive leT' ->
forall s : seq T,
sorted leT' s ->
sorted [rel x y | leT x y && (leT y x ==> leT' x y)] (sort leT s)
filter_sort
: forall (T : Type) (leT : rel T),
total leT -> transitive leT ->
forall (p : pred T) (s : seq T),
[seq x <- sort leT s | p x] = sort leT [seq x <- s | p x]
mask_sort
: forall (T : Type) (leT : rel T),
total leT -> transitive leT ->
forall (s : seq T) (m : bitseq),
{m_s : bitseq | mask m_s (sort leT s) = sort leT (mask m s)}
mask_sort'
: forall (T : Type) (leT : rel T),
total leT -> transitive leT ->
forall (s : seq T) (m : bitseq),
sorted leT (mask m s) ->
{m_s : bitseq | mask m_s (sort leT s) = mask m s}
subseq_sort
: forall (T : eqType) (leT : rel T),
total leT -> transitive leT -> {homo sort leT : t s / subseq t s}
subseq_sort'
: forall (T : eqType) (leT : rel T),
total leT -> transitive leT ->
forall t s : seq T, subseq t s -> sorted leT t -> subseq t (sort leT s)
mem2_sort
: forall (T : eqType) (leT : rel T),
total leT -> transitive leT ->
forall (s : seq T) (x y : T),
leT x y -> mem2 s x y -> mem2 (sort leT s) x y
* Avoid some eta-expansions
* Get the proper fix of `order_path_min` and remove `sort_map_in`
* Update documentation and CHANGELOG entries
|
|
- Added: `modn_divl` and `divn_modl`.
- Generalized `muln_modr` and `muln_modl` removing hypothesis `0 < p`.
|
|
Redirects to math-comp.github.io
|
|
* feat: Add build for mathcomp/mathcomp-dev:coq-8.10
* fix(coq-mathcomp-ssreflect.opam): Bump coq upper bound
* fix(*.opam): Remove "remove" directive
href: coq/opam-coq-archive#703
|
|
Improving fintype and bigop
|
|
|
|
|
|
### Added
- Fintype theorems: `fintype0`, `card_le1P`, `mem_card1`,
`card1P`, `fintype_le1P`, `fintype1`, `fintype1P`.
- Bigop theorems: `big_rmcond`, `bigD1_seq`,
`reindex_enum_val_cond`, `reindex_enum_rank_cond`,
`reindex_enum_val`, `reindex_enum_rank`, `big_set`.
|
|
|
|
typo in ssralg
|
|
|
|
Fix and improve the test suite and Makefile
|
|
Add `flatten_map1` and `allpairs_consr`
|
|
|
|
- improve an error message produced by the `check_join` tactic,
- fix the build of the test suite: `make test-suite`, and
- add a new rule `only` to build a subset of MathComp.
|
|
Generalize `allpairs_catr` to non-`eqType`s
|
|
|
|
|
|
Thanks!
|
|
|
|
Fix a typo: `ring_core_scope`
|
|
|
|
|
|
Merge only after solving issue https://github.com/math-comp/math-comp/issues/361
|
|
[ci] fix .gitlab-ci.yml regarding "GIT_STRATEGY: none"
|
|
This could explain why the change in b8eadb8603b83c053a313b39c2a8f268385d8942
was not taken into account.
|
|
[ci] a few improvements of the GitLab CI setup
|
|
* Normal builds (branches & GitHub PRs) are not impacted
* Triggering a scheduled pipeline will only run {coq-dev, mathcomp-dev:coq-dev}
to build and deploy the corresponding image to mathcomp/mathcomp-dev:coq-dev.
* href: https://docs.gitlab.com/ce/user/project/pipelines/schedules.html
|
|
* Add {fourcolor, odd-order} test builds with latest Coq release (8.9)
* As a result, the math-comp CI config w.r.t. {fourcolor, odd-order}
will be similar to that of the upstream repos:
- https://github.com/math-comp/fourcolor/blob/master/.travis.yml
- https://github.com/math-comp/odd-order/pull/16
|
|
* Set "GIT_STRATEGY: none" accordingly
|
|
|
|
totient for prime
|
|
|
|
|
|
docs: Add missing entry in CHANGELOG.md regarding #292
|
|
href: math-comp/math-comp#292
|
|
Reimplement the hierarchy related tools in OCaml
|
|
Fixpoint theorems in finset
|
|
|
|
Remove support for Travis CI (mathcomp switched to Gitlab CI)
|
|
|
|
Mathcomp switched to Gitlab CI via coqbot, see here:
https://github.com/math-comp/math-comp/pull/353#issuecomment-497017174
|
|
|
|
PR template
|
|
|
|
|
|
|
|
|
|
|
|
Also changed eqsVneq.
|