| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-09-18 | Merge PR #13055: Fix Removed in Sphinx 4 deprecations. | coqbot-app[bot] | |
| Reviewed-by: jfehrle | |||
| 2020-09-18 | Merge PR #12963: Formally deprecate the double induction tactic. | Hugo Herbelin | |
| Reviewed-by: VincentSe Ack-by: herbelin Ack-by: olaure01 | |||
| 2020-09-18 | Adding debugging printers for Intmap. | Hugo Herbelin | |
| 2020-09-18 | Merge PR #13051: Improve `simple apply` example | coqbot-app[bot] | |
| Reviewed-by: Zimmi48 | |||
| 2020-09-18 | Merge PR #13043: [ci] call dmesg after quick/async jobs to detect OOM | coqbot-app[bot] | |
| Reviewed-by: Zimmi48 | |||
| 2020-09-18 | Fix Removed in Sphinx 4 deprecations. | Théo Zimmermann | |
| 2020-09-18 | Make `simple apply in ...` point to `simple apply` | Maxime Dénès | |
| Instead, the example was duplicated. | |||
| 2020-09-18 | [lib] make canonical_path_name always absolute (fix #13031) | Enrico Tassi | |
| 2020-09-18 | [ci] [dmesg] save as artifact | Enrico Tassi | |
| 2020-09-18 | Improve `simple apply` example | Maxime Dénès | |
| The example showing the difference between `apply` and `simple apply` used to depend on the order and the heuristics used on unification problems. We make it independent for better clarity and stability. Fixes https://github.com/coq/coq/issues/13023 | |||
| 2020-09-18 | Merge PR #12610: [leminv] [declare] Use higher-level Declare API. | Pierre-Marie Pédrot | |
| Ack-by: SkySkimmer Reviewed-by: ppedrot | |||
| 2020-09-18 | Remove unused API from Dn. | Pierre-Marie Pédrot | |
| 2020-09-18 | Clean up a bit the implemenation of dnets. | Pierre-Marie Pédrot | |
| We use higher-level combinators instead of composition of low-level ones. | |||
| 2020-09-18 | Remove dead code in dnets. | Pierre-Marie Pédrot | |
| The boolean assumedly used to cut recursion was always set to true, since its introduction in 64ac193. | |||
| 2020-09-18 | Merge PR #13027: [vernac] Don't allow attributes on print / check | coqbot-app[bot] | |
| Reviewed-by: Zimmi48 | |||
| 2020-09-17 | [ci/gitlab/cachix] Avoid running in trouble when calling git fetch --unshallow. | Théo Zimmermann | |
| 2020-09-17 | Merge PR #13007: [build] Don't link `num` anymore in Coq | coqbot-app[bot] | |
| Reviewed-by: Zimmi48 Reviewed-by: vbgl Ack-by: Zimmi48 Ack-by: vbgl | |||
| 2020-09-17 | [configure] Fix version checks for lablgtk and zarith | Emilio Jesus Gallego Arias | |
| Fixes #13041 #13047 Configure is quite messy, but we will improve it once we can link it with findlib and move to dune [that will actually allow to remove all ad-hoc calls to `ocamlfind` in favor of `findlib` code. | |||
| 2020-09-17 | Be more efficient when generating the merge of ltle maps in AcyclicGraph. | Pierre-Marie Pédrot | |
| We try to avoid reallocating the map in two different ways. - We only add a value when actually needed. - We compute the union of maps with the first element as a starting point. | |||
| 2020-09-17 | Do not allocate intermediate sets in universe refreshing. | Pierre-Marie Pédrot | |
| A set was created only to be folded over. Since the list is ensured to be duplicate-free, there is no point in creating the former, we just fold over the list directly. | |||
| 2020-09-17 | [leminv] Use higher-level Declare API. | Emilio Jesus Gallego Arias | |
| 2020-09-17 | [leminv] Remove unused catch. | Emilio Jesus Gallego Arias | |
| 2020-09-17 | [install] Rewording of primitive floats. | Emilio Jesus Gallego Arias | |
| As suggested in the PR review. Co-authored-by: Jim Fehrle <jim.fehrle@gmail.com> | |||
| 2020-09-17 | [build] Don't link `num` anymore in Coq | Emilio Jesus Gallego Arias | |
| After #8743 we don't depend on `num` anymore in the codebase; thus we drop the dependency. This could create problems for plugins relying on this implicit linking. | |||
| 2020-09-17 | Merge PR #13024: [CI] Always upload artifacts | coqbot-app[bot] | |
| Reviewed-by: Zimmi48 | |||
| 2020-09-17 | [ci] call dmesg after quick/async jobs to detect OOM | Enrico Tassi | |
| 2020-09-17 | Formally deprecate the double induction tactic. | Pierre-Marie Pédrot | |
| The doc states it is deprecated since 1386cd9 but this was ages before the deprecation mechanism existed. | |||
| 2020-09-16 | Modify setoid_ring/BinList.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Lists/List.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify setoid_ring/Ring_theory.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify NArith/Nnat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify PArith/Pnat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify NArith/BinNat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify PArith/BinPos.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Wf_nat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/EqNat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Factorial.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Compare_dec.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Peano_dec.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Logic/Eqdep_dec.v to compile with -v | Jasper Hugunin | |
| 2020-09-16 | Modify Logic/EqdepFacts.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Between.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Mult.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Plus.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/Le.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Arith/PeanoNat.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Numbers/Natural/Abstract/NBits.v to compile with -mangle-names | Jasper Hugunin | |
| The bitwise tactic was performing `intros ?m`, and the name m got used later in many proofs. I defined a tactic notation `bitwise as m` to be able to provide the name for `m` explicitly. I did not make the notation local, because it seems like it would be useful for any clients using `bitwise` who want to avoid generated names. I have relatively little experience with writing Ltac and tactic notations, so if my solution can be improved, please show me how. | |||
| 2020-09-16 | Modify Numbers/Natural/Abstract/NLcm.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Numbers/Natural/Abstract/NGcd.v to compile with -mangle-names | Jasper Hugunin | |
| 2020-09-16 | Modify Numbers/Natural/Abstract/NDiv.v to compile with -mangle-names | Jasper Hugunin | |
