| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-04-10 | Merge pull request #471 from math-comp/all2_guard_cond | affeldt-aist | |
| Make `all2` better wrt the guard condition | |||
| 2020-04-10 | Merge pull request #477 from affeldt-aist/move_good_practice_from_wiki | Cyril Cohen | |
| Move the contents of Good Practices to CONTIBUTING.md | |||
| 2020-04-10 | adding guard conditions check to the test_suite | Cyril Cohen | |
| 2020-04-10 | Make `all2` better wrt the guard condition | Cyril Cohen | |
| fixes #469 | |||
| 2020-04-09 | Merge pull request #473 from affeldt-aist/long_short_suffixes | affeldt-aist | |
| switching long suffixes to short suffixes | |||
| 2020-04-09 | move the contents of | Reynald Affeldt | |
| https://github.com/math-comp/math-comp/wiki/good-practices to CONTRIBUTING.md | |||
| 2020-04-09 | Merge pull request #431 from ppedrot/rm-constr-hint-decls | affeldt-aist | |
| Remove hint declarations using non-global definitions. | |||
| 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-09 | Merge pull request #474 from llelf/doc-typos | affeldt-aist | |
| Documentation typos | |||
| 2020-04-09 | docs: more ".-tuple" fixes | Antonio Nikishaev | |
| 2020-04-09 | more typos | Antonio Nikishaev | |
| 2020-04-09 | Update mathcomp/ssreflect/ssrnat.v | Antonio Nikishaev | |
| the->this Co-Authored-By: Yves Bertot <yves.bertot@inria.fr> | |||
| 2020-04-08 | fix typos in documentation: formulae | Antonio Nikishaev | |
| 2020-04-08 | fix typos in documentation: text | Antonio Nikishaev | |
| 2020-04-07 | Merge pull request #211 from CohenCyril/ssrAC | Enrico Tassi | |
| Rewriting with AC (not modulo AC), using a small scale command. | |||
| 2020-04-08 | Remove hint declarations using non-global definitions. | Pierre-Marie Pédrot | |
| 2020-04-06 | Merge pull request #472 from affeldt-aist/doc_fix | Yves Bertot | |
| minor documentation fix | |||
| 2020-04-06 | Some proof scripts made better using ssrAC. | Cyril Cohen | |
| %AC annotation are for backward compatilibity with coq <= 8.9 | |||
| 2020-04-06 | Rewriting 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-06 | minor documentation fix | Reynald Affeldt | |
| 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-31 | Merge pull request #457 from CohenCyril/find | Yves Bertot | |
| Find | |||
| 2020-03-19 | Merge pull request #463 from pi8027/hierarchy-transitive-closure | Enrico Tassi | |
| Fix hierarchy.ml to compute the transitive closure of a hierarchy | |||
| 2020-03-18 | Merge pull request #459 from CohenCyril/sub_sorted | Cyril Cohen | |
| Link between subrelations and path/sorted | |||
| 2020-03-16 | Update mathcomp/ssreflect/path.v | Cyril Cohen | |
| Co-Authored-By: Kazuhiko Sakaguchi <pi8027@gmail.com> | |||
| 2020-03-16 | Link between subrelations and path/sorted | Cyril Cohen | |
| 2020-03-16 | Document change on comparison predicates in order.v | Kazuhiko Sakaguchi | |
| 2020-03-16 | Merge pull request #460 from affeldt-aist/spurious_lerr | Cyril Cohen | |
| just noticed a tentative use of a not yet existing lemma | |||
| 2020-03-15 | just noticed a tentative use of a not yet existing lemma | Reynald Affeldt | |
| 2020-03-15 | Reorder arguments of comparison predicates in order.v as they should | Kazuhiko Sakaguchi | |
| 2020-03-15 | Extend comparison predicates for nat with minn and maxn | Kazuhiko Sakaguchi | |
| 2020-03-15 | Fix hierarchy.ml to compute the transitive closure of a hierarchy | Kazuhiko Sakaguchi | |
| 2020-03-12 | Merge pull request #465 from erikmd/coq-8.11 | Cyril Cohen | |
| [ci] test-build and deploy mathcomp/mathcomp-dev:coq-8.11 | |||
| 2020-03-12 | Merge pull request #455 from erikmd/bump-opam | Cyril Cohen | |
| [ci] Simplify {Dockerfile,Dockerfile.make} & Restore the "opam clean -c" option | |||
| 2020-03-08 | [ci] Build mathcomp/mathcomp-dev:8.11 | Erik Martin-Dorel | |
| and test coq-lemma-overloading accordingly. | |||
| 2020-03-08 | Fix CI (coq-lemma-overloading dropped compatibility with Coq < 8.10) | Erik Martin-Dorel | |
| 2020-03-08 | refactor: Simplify the Dockerfiles | Erik 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. | |||
| 2020-01-30 | Merge pull request #453 from pi8027/experiment/order-nondistr-lattice | Pierre-Yves Strub | |
| Non-distributive lattice structures | |||
| 2020-01-29 | Documentation work for (non-distributive) latticeType | Kazuhiko Sakaguchi | |
| 2020-01-28 | Added lemmas about foldl, scanl, foldr and rcons and cons | Cyril Cohen | |
| 2020-01-28 | Theorems about find and index | Cyril Cohen | |
| 2020-01-21 | Merge pull request #452 from SimonBoulier/non_maximal_implicit | Enrico Tassi | |
| Adapt to coq/coq#11368 (Turn trailing implicit warning into an error) | |||
| 2020-01-17 | Revert "Don't run "opam clean -c" to workaround ocaml/opam#3828" | Erik Martin-Dorel | |
| This reverts commit a03e0cb0ff40afabcaccba7f764076355ca82962. | |||
| 2020-01-15 | Non-distributive lattice | Kazuhiko Sakaguchi | |
| 2020-01-14 | Merge pull request #454 from CohenCyril/dual | Cyril Cohen | |
| Renaming converse to dual in order.v | |||
| 2020-01-10 | Missing canonical structures for dual | Cyril Cohen | |
| 2020-01-10 | Exporting T^d notation | Cyril Cohen | |
| 2020-01-09 | Renaming converse to dual in order.v | Cyril Cohen | |
| 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. | |||
