Skip to content
Snippets Groups Projects
Select Git revision
  • ci-release protected
  • ci/msammler/more_feed
  • ci/refactor_staging
  • coq-stdpp-1.0 protected
  • dfrumin/coq-stdpp-set_map_2
  • master default protected
  • msammler/bitvector
  • msammler/bool_decide_simpl_never
  • msammler/monad_without_universe_constraints
  • ralf/empty-opaque
  • ralf/hint-mode-check
  • ralf/hint-mode-plus
  • ralf/listZ
  • ralf/lookup_insert
  • ralf/make_simple_intropattern
  • ralf/multiset-solver
  • ralf/no-notypeclasses-apply
  • robbert/cancel_inj_surj
  • robbert/cbn
  • robbert/f_equiv_pointwise
  • coq-stdpp-1.11.0 protected
  • coq-stdpp-1.10.0 protected
  • coq-stdpp-1.9.0 protected
  • coq-stdpp-1.8.0 protected
  • coq-stdpp-1.7.0 protected
  • coq-stdpp-1.6.0 protected
  • coq-stdpp-1.5.0 protected
  • coq-stdpp-1.4.0 protected
  • coq-stdpp-1.3.0 protected
  • coq-stdpp-1.2.1 protected
  • coq-stdpp-1.2.0 protected
  • coq-stdpp-1.1.0 protected
  • coq-stdpp-1.0.0 protected
33 results
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.010Mar9528Feb2625242320191817141311130Jan181716151319Dec622Nov2111762131Oct7119Sep1211529Aug27262423151413713Jul98754330Jun2827262521201814230May26252117151210984330Apr262524231926Mar161514643128Feb2322212017131076129Jan28252419131119Dec1615141230Nov28262220121110984115Oct7430Sep181Aug23Jul171030Jun292825232120181410976530May2928242314927Apr2421181110965328Mar2722218623Feb22211916151312983231Jan25231413121019Dec181785429Nov282221201816121193131Oct2827242019181716131097629Sep28272624212019181786222Aug17825Jul26Jun30May251Apr20Mar171615Merge branch 'robbert/TCEq_hint' into 'master'Change mode of `TCEq`.Merge branch 'robbert/TCX_hint_mode' into 'master'Set `Hint Mode` for logical `TCX` type classes.Merge branch 'avoid-constr-hints' into 'master'Avoid using Hint Resolve with a termTests for `set_unfold in H`.Add tactic `set_unfold in H`.Add lemma `fmap_map_seq`.Coq 8.10 compat.Merge branch 'robbert/nat_to_fin' into 'master'Rename `fin_of_nat` → `nat_to_fin` to follow the conventions.Function `fun_to_vec : (fin n → A) → vec A n`.Prove that `<` and `≤` are finite/infinite.Fix test in Coq 8.10 and 8.11.declare Coq 8.9 and older as 'old' for reftestsMerge branch 'split_or' into 'master'Changelog entryHave destruct_and take care of [True] and destruct_or of [False]Add destruct_or{?,!}, and generalize destruct_and{?,!} to handle an explicit assumption argumentSlight update to the documentation of [split_and{!,?}]Merge branch 'robbert/vec_countable' into 'master'CHANGELOG entry.Add `Countable` instance for `vec`.Prove lemma `list_to_vec_to_list`.Rename `vec_to_list_of_list` into `vec_to_list_to_vec`.Merge branch 'robbert/set_unfold_dom' into 'master'Add tests for `set_solver` on `dom`.CHANGELOG entry.Add `SetUnfold` instances for `dom`.Put `LeibnizEquiv` lemmas for `dom` in section.Merge branch 'coGset' into 'master'Rename `cogpick` to `coGpick` (oops).Merge branch 'cogset' into 'master'Add `coGset`.Add lemma `not_elem_of_iff`.Fix compilation after !112 broke it.Merge branch 'ralf/hints' into 'master'add commentmove coPset-generic hint to coPset.v
Loading