| Age | Commit message (Collapse) | Author |
|
|
|
Fix hierarchy.ml to compute the transitive closure of a hierarchy
|
|
Link between subrelations and path/sorted
|
|
Co-Authored-By: Kazuhiko Sakaguchi <pi8027@gmail.com>
|
|
|
|
just noticed a tentative use of a not yet existing lemma
|
|
|
|
|
|
[ci] test-build and deploy mathcomp/mathcomp-dev:coq-8.11
|
|
[ci] Simplify {Dockerfile,Dockerfile.make} & Restore the "opam clean -c" option
|
|
and test coq-lemma-overloading accordingly.
|
|
|
|
* the CLI option --build-arg=compiler="${OPAM_SWITCH}" is now useless
(it had been introduced to be able to compile Coq versions < 8.7,
while mathcomp-dev now requires Coq 8.7+)
* the "coqorg/base:bare" image now contains the two environment vars
COMPILER and COMPILER_EDGE => clear COMPILER="" in mathcomp-dev's
Dockerfile multi-stage build.
|
|
Non-distributive lattice structures
|
|
|
|
Adapt to coq/coq#11368 (Turn trailing implicit warning into an error)
|
|
This reverts commit a03e0cb0ff40afabcaccba7f764076355ca82962.
|
|
|
|
Renaming converse to dual in order.v
|
|
|
|
|
|
Indeed, the name converse and notation ^c were already taken in
https://github.com/math-comp/math-comp/blob/master/mathcomp/algebra/ssralg.v#L989-L990
We are renaming to dual.
|
|
Add FCSL-PCM library to CI
|
|
|
|
FCSL-PCM is in Coq's CI, so this will prevent breaking Coq's CI, see
https://github.com/imdea-software/fcsl-pcm/issues/17
|
|
Refactoring and linting proofs especially in polydiv.v
|
|
- Replace `altP eqP` and `altP (_ =P _)` with `eqVneq`:
The improved `eqVneq` lemma (#351) is redesigned as a comparison predicate and
introduces a hypothesis in the form of `x != y` in the second case. Thus,
`case: (altP eqP)`, `case: (altP (x =P _))` and `case: (altP (x =P y))` idioms
can be replaced with `case: eqVneq`, `case: (eqVneq x)` and
`case: (eqVneq x y)` respectively. This replacement slightly simplifies and
reduces proof scripts.
- use `have [] :=` rather than `case` if it is better.
- `by apply:` -> `exact:`.
- `apply/lem1; apply/lem2` or `apply: lem1; apply: lem2` -> `apply/lem1/lem2`.
- `move/lem1; move/lem2` -> `move/lem1/lem2`.
- Remove `GRing.` prefix if applicable.
- `negbTE` -> `negPf`, `eq_refl` -> `eqxx` and `sym_equal` -> `esym`.
|
|
Remove CI overlay for PR #270
|
|
|
|
[ci] add missing "except:" rules to fix the nightly build on GitLab CI
|
|
It seems adding an "except:" rule in a job that "extends:" another one
*overwrites* the except rule, so we were getting too many jobs in the
mathcomp-dev scheduled pipeline.
Once merged, this patch should fix this.
|
|
take advantage of opam variables and their default values
|
|
Dispatching order and norm, and anticipating normed modules.
|
|
|
|
|
|
* remove ProdNormedZmodule from ssrnum.v, it made its way to mathcomp-analysis in a generalized form (branch analysis_270) at the time of this writing
* update gitlab-ci
|
|
* renaming
NormedZmoduleType -> NormedZmodType
NormedZmoduleMixin -> NormedZmodMixin
that looks more homogeneous with regard to naming conventions used so far
* update .gitlab-ci.yml
* typo
|
|
|
|
- adding a doc paragraph on displays
- Changelog
- better proofs for new logn, gcdn, lcmn, partn facts
- Putting comments in the example of nat
|
|
amounts to the difference being real, and consequences
|
|
|
|
|
|
|
|
scopes
|
|
* Redefine `normedDomainType` (now `normedZmodType`)
- Redefine `normedDomainType` to drop ring and integral domain axioms.
- Add canonical instance of `normedZmodType` for `prod`.
|
|
- Rename `totalLatticeMixin` to `totalPOrderMixin`.
- Refactor num mixins.
- Use `Num.min` and `Num.max` rather than lattice notations if applicable.
|
|
New lemmas:
- meet_l, meet_r, join_l, join_r.
Renamings:
- Order.BLatticeTheory.lexUl -> disjoint_lexUl,
- Order.BLatticeTheory.lexUr -> disjoint_lexUr,
- Order.TBLatticeTheory.lexIl -> cover_leIxl,
- Order.TBLatticeTheory.lexIr -> cover_leIxr.
Use `Order.TTheory` instead of `Order.Theory` if applicable
|
|
The comparison predicates (for nat, ordered types, ordered integral domains)
must have the following order of arguments:
- leP x y : le_xor_gt x y ... (x <= y) (y < x) ... .
- ltP x y : lt_xor_ge x y ... (y <= x) (x < y) ... .
- ltgtP x y : compare x y ... (y == x) (x == y) (x >= y) (x <= y) (x > y) (x < y) ... .
|
|
- comparer -> compare (in order.v)
- eq constructor of compare goes last
- "x < y" is matched before "x > y"
- "x <= y" is matched before "x >= y"
- adding prod and lexi ordering on tuple
- adding missing CS
- edit CHANGELOG
|
|
|