- 12 Aug, 2020 1 commit
-
-
Ralf Jung authored
-
- 15 Jul, 2020 1 commit
-
-
Robbert Krebbers authored
-
- 15 Feb, 2020 1 commit
-
-
Fixes a new warning on Coq 8.12+alpha when implicit annotations are used in positions where they are ignored.
-
- 02 Feb, 2020 1 commit
-
-
Coq master is stricter about checking for meaningless implicit binders; see https://github.com/coq/coq/pull/10202.
-
- 18 Dec, 2019 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 13 Sep, 2019 1 commit
-
-
Jacques-Henri Jourdan authored
The general idea is to first import/export modules which are further than the current one, and then import/export modules which are close dependencies. This commit tries to use the same order of imports for every file, and describes the convention in ProofGuide.md. There is one exception, where we do not follow said convention: in program_logic/weakestpre.v, using that order would break printing of texan triples (??).
-
- 11 Sep, 2019 1 commit
-
-
Robbert Krebbers authored
This commit closes issue #265.
-
- 19 May, 2019 1 commit
-
-
Robbert Krebbers authored
-
- 24 Jan, 2019 1 commit
-
-
Maxime Dénès authored
This is in preparation for coq/coq#9274.
-
- 25 Dec, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 29 Nov, 2018 1 commit
-
-
Tej Chajed authored
Adding a hint without a database now triggers a deprecation warning in Coq master (https://github.com/coq/coq/pull/8987).
-
- 03 Oct, 2018 1 commit
-
-
Robbert Krebbers authored
This needed minor rearrangement.
-
- 12 Sep, 2018 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
All the `env` operations are prefixed `env_`, so this is more consistent.
-
Robbert Krebbers authored
-
- 16 Jun, 2018 1 commit
-
-
Ralf Jung authored
-
- 15 Jun, 2018 1 commit
-
-
Ralf Jung authored
* move PROP-envs definitions to environments.v so that we can control them without pulling in coq_tactics * use reduction-controlled `pm_default` for proofmode accessors
-
- 15 Feb, 2018 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 23 Dec, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 22 Nov, 2017 2 commits
-
-
Robbert Krebbers authored
It used to be an inline pattern match. This also restores compatibility with Coq 8.6.1.
-
Robbert Krebbers authored
-
- 13 Nov, 2017 1 commit
-
-
Robbert Krebbers authored
The proof mode now explicitly keeps track of anonymous hypotheses (i.e. hypotheses that are introduced by the introduction pattern `?`). Consider: Lemma foo {M} (P Q R : uPred M) : P -∗ (Q ∗ R) -∗ Q ∗ P. Proof. iIntros "? [H ?]". iFrame "H". iFrame. Qed. After the `iIntros`, the goal will be: _ : P "H" : Q _ : R --------------------------------------∗ Q ∗ P Anonymous hypotheses are displayed in a special way (`_ : P`). An important property of the new anonymous hypotheses is that it is no longer possible to refer to them by name, whereas before, anonymous hypotheses were given some arbitrary fresh name (typically prefixed by `~`). Note tactics can still operate on these anonymous hypotheses. For example, both `iFrame` and `iAssumption`, as well as the symbolic execution tactics, will use them. The only thing that is not possible is to refer to them yourself, for example, in an introduction, specialization or selection pattern. Advantages of the new approach: - Proofs become more robust as one cannot accidentally refer to anonymous hypotheses by their fresh name. - Fresh name generation becomes considerably easier. Since anonymous hypotheses are internally represented by natural numbers (of type `N`), we can just fold over the hypotheses and take the max plus one. This thus solve issue #101.
-
- 30 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 28 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 27 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 26 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 06 Feb, 2017 1 commit
-
-
Ralf Jung authored
-
- 05 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 03 Jan, 2017 1 commit
-
-
Ralf Jung authored
This patch was created using find -name *.v | xargs -L 1 awk -i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing
-
- 09 Dec, 2016 1 commit
-
-
Ralf Jung authored
-
- 10 Nov, 2016 1 commit
-
-
Robbert Krebbers authored
This way we avoid the env_cbv tactic unfolding string related stuff that appears in the goal and hypotheses of the proof mode.
-
- 27 Sep, 2016 2 commits
-
-
Robbert Krebbers authored
Used in iRevert, iClear, iFrame, and for generalizing the IH in iInduction and iLöb.
-
Robbert Krebbers authored
-
- 20 Sep, 2016 1 commit
-
-
Robbert Krebbers authored
Before, it failed when these tactics were invoked with persistent hypotheses. The new behavior is more convenient when using these tactics to build other tactics.
-
- 01 Jun, 2016 1 commit
-
-
Robbert Krebbers authored
Generating a fresh name consists of two stages: + Use [cbv] to compute a list representing the domain of the environment. This is a very simply computation that just erases the hypotheses. + Use [vm_compute] to compute a fresh name based on the list representing the domain. The domain itself should never contain evars, so [vm_compute] will do the job.
-
- 07 May, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 12 Apr, 2016 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
This reverts commit 3cc38ff6. The reverted pure hypotheses and variables appear in the wrong order.
-
Robbert Krebbers authored
-
- 11 Apr, 2016 1 commit
-
-
Robbert Krebbers authored
-