aboutsummaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2020-05-04Remove the tuple extensions in order.v that is available in tuple.vKazuhiko Sakaguchi
2020-04-21Add dual_finLatticeType and fix dual_finDistrLatticeTypeKazuhiko Sakaguchi
This fixes two issues: - dual_finLatticeType was missing, and - dual_finDistrLatticeType was just an identity function.
2020-04-15fix packagerCyril Cohen
2020-04-15Merge pull request #487 from affeldt-aist/changelogs_release_1.11.0+beta1Yves Bertot
preparing changelogs to release 1.11.0+beta1
2020-04-15preparing changelogs to release 1.11.0+beta1Reynald Affeldt
2020-04-15Merge pull request #221 from hivert/permcomplaffeldt-aist
Some more lemmas on permutations
2020-04-15reworked new lemmas in perm and action and added missing onesCyril Cohen
In particular: rephrased permS0 and permS1 with all_equal_to
2020-04-15addressing comments about PR#221 of mathcompReynald Affeldt
2020-04-15Some more lemmas on permutationsFlorent Hivert
2020-04-15Merge pull request #475 from CohenCyril/ssrnat_deprecated_symbolsaffeldt-aist
adding deprecations in ssrnat
2020-04-10adding depreciations in ssrnatCyril Cohen
2020-04-10Merge pull request #471 from math-comp/all2_guard_condaffeldt-aist
Make `all2` better wrt the guard condition
2020-04-10Merge pull request #477 from affeldt-aist/move_good_practice_from_wikiCyril Cohen
Move the contents of Good Practices to CONTIBUTING.md
2020-04-10adding guard conditions check to the test_suiteCyril Cohen
2020-04-10Make `all2` better wrt the guard conditionCyril Cohen
fixes #469
2020-04-09Merge pull request #473 from affeldt-aist/long_short_suffixesaffeldt-aist
switching long suffixes to short suffixes
2020-04-09move the contents ofReynald Affeldt
https://github.com/math-comp/math-comp/wiki/good-practices to CONTRIBUTING.md
2020-04-09Merge pull request #431 from ppedrot/rm-constr-hint-declsaffeldt-aist
Remove hint declarations using non-global definitions.
2020-04-09- switching long suffixes to short suffixesReynald Affeldt
+ `odd_add` -> `oddD` + `odd_sub` -> `oddB` + `take_addn` -> `takeD` + `rot_addn` -> `rotD` + `nseq_addn` -> `nseqD` fixes #359
2020-04-09Merge pull request #474 from llelf/doc-typosaffeldt-aist
Documentation typos
2020-04-09docs: more ".-tuple" fixesAntonio Nikishaev
2020-04-09more typosAntonio Nikishaev
2020-04-09Update mathcomp/ssreflect/ssrnat.v Antonio Nikishaev
the->this Co-Authored-By: Yves Bertot <yves.bertot@inria.fr>
2020-04-08fix typos in documentation: formulaeAntonio Nikishaev
2020-04-08fix typos in documentation: textAntonio Nikishaev
2020-04-07Merge pull request #211 from CohenCyril/ssrACEnrico Tassi
Rewriting with AC (not modulo AC), using a small scale command.
2020-04-08Remove hint declarations using non-global definitions.Pierre-Marie Pédrot
2020-04-06Merge pull request #472 from affeldt-aist/doc_fixYves Bertot
minor documentation fix
2020-04-06Some proof scripts made better using ssrAC.Cyril Cohen
%AC annotation are for backward compatilibity with coq <= 8.9
2020-04-06Rewriting with AC (not modulo AC), using a small scale command.Cyril Cohen
This replaces opA, opC, opAC, opCA, ... and any combinations of them - Right now the rewrite relies on an rather efficient computation of perm_eq using a "spaghetti sort" in O(n log n) - Wrongly formed AC statements send error messages showing the discrepancy between LHS and RHS patterns. Usage : rewrite [pattern](AC operator pattern-shape re-ordering) rewrite [pattern](ACl operator re-ordering) - pattern is optional, as usual, - operator must have a canonical Monoid.com_law structure (additions, multiplications, conjunction and disjunction do) - pattern-shape is expressed using the syntax p := n | p * p' where "*" is purely formal and n > 0 is number of left associated symbols examples of pattern shapes: + 4 represents (n * m * p * q) + (1*2) represents (n * (m * p)) - re-ordering is expressed using the syntax s := n | s * s' where "*" is purely formal and n is the position in the LHS If the ACl variant is used, the pattern-shape defaults to the pattern fully associated to the left i.e. n i.e (x * y * ...) Examples of re-orderings: - ACl op ((0*1)*2) is the identity (and should fail to rewrite) - opAC == ACl op ((0*2)*1) == AC op 3 ((0*2)*1) - opCA == AC op (2*1) (0*1*2) - rewrite opCA -opA == rewrite (ACl op (0*(2*1)) - opACA == AC (2*2) ((0*2)*(1*3))
2020-04-06minor documentation fixReynald Affeldt
2020-04-02Merge pull request #468 from ybertot/remove-deprecated-from-1.9Enrico Tassi
remove deprecated commands whose deprecation was introduced in 1.9.0
2020-04-01Merge pull request #429 from pi8027/extend-nat-comparisonYves Bertot
Extend comparison predicates for nat with minn and maxn and reorder arguments of those in order.v
2020-03-31remove deprecated commands whose deprecation was introduced in release 1.9.0Yves Bertot
fixes #418
2020-03-31Merge pull request #457 from CohenCyril/findYves Bertot
Find
2020-03-19Merge pull request #463 from pi8027/hierarchy-transitive-closureEnrico Tassi
Fix hierarchy.ml to compute the transitive closure of a hierarchy
2020-03-18Merge pull request #459 from CohenCyril/sub_sortedCyril Cohen
Link between subrelations and path/sorted
2020-03-16Update mathcomp/ssreflect/path.vCyril Cohen
Co-Authored-By: Kazuhiko Sakaguchi <pi8027@gmail.com>
2020-03-16Link between subrelations and path/sortedCyril Cohen
2020-03-16Document change on comparison predicates in order.vKazuhiko Sakaguchi
2020-03-16Merge pull request #460 from affeldt-aist/spurious_lerrCyril Cohen
just noticed a tentative use of a not yet existing lemma
2020-03-15just noticed a tentative use of a not yet existing lemmaReynald Affeldt
2020-03-15Reorder arguments of comparison predicates in order.v as they shouldKazuhiko Sakaguchi
2020-03-15Extend comparison predicates for nat with minn and maxnKazuhiko Sakaguchi
2020-03-15Fix hierarchy.ml to compute the transitive closure of a hierarchyKazuhiko Sakaguchi
2020-03-12Merge pull request #465 from erikmd/coq-8.11Cyril Cohen
[ci] test-build and deploy mathcomp/mathcomp-dev:coq-8.11
2020-03-12Merge pull request #455 from erikmd/bump-opamCyril Cohen
[ci] Simplify {Dockerfile,Dockerfile.make} & Restore the "opam clean -c" option
2020-03-08[ci] Build mathcomp/mathcomp-dev:8.11Erik Martin-Dorel
and test coq-lemma-overloading accordingly.
2020-03-08Fix CI (coq-lemma-overloading dropped compatibility with Coq < 8.10)Erik Martin-Dorel
2020-03-08refactor: Simplify the DockerfilesErik Martin-Dorel
* 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.
generated by cgit v1.2.3 (git 2.25.1) at 2026-02-01 12:19:36 +0000