- 10 Mar, 2021 1 commit
-
-
Ralf Jung authored
-
- 10 Feb, 2021 1 commit
-
-
Ralf Jung authored
-
- 03 Feb, 2021 1 commit
-
-
Ralf Jung authored
create iris-deprecated and iris-staging packages, and deprecate some hard-to-use logic-level wrappers as well as view shift and Hoare triple notation
-
- 17 Jan, 2021 1 commit
-
-
Robbert Krebbers authored
that performs `wp_pure` in small steps until the lemma matches the goal.
-
- 07 Jan, 2021 1 commit
-
- 26 Nov, 2020 2 commits
- 10 Nov, 2020 1 commit
-
-
Ralf Jung authored
-
- 14 Sep, 2020 2 commits
- 14 May, 2020 1 commit
-
-
Ralf Jung authored
-
- 16 Mar, 2020 1 commit
-
-
- remove "odd" comment - move atomic triples to bi_scope
-
- 18 Feb, 2020 1 commit
-
-
Robbert Krebbers authored
-
- 05 Nov, 2019 1 commit
-
-
Robbert Krebbers 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 (??).
-
- 14 Aug, 2019 1 commit
-
-
Ralf Jung authored
-
- 13 Aug, 2019 1 commit
-
-
Paolo G. Giarrusso authored
Turn all `f_op` lemmas to have shape `f (x ⋅ y) = f x ⋅ f y`, following the plan in iris/iris!295 (comment 39151), plus `cmra_morphism_op`.
-
- 12 Aug, 2019 1 commit
-
-
Ralf Jung authored
-
- 09 Aug, 2019 1 commit
-
-
Ralf Jung authored
-
- 24 Jun, 2019 3 commits
- 16 Jun, 2019 1 commit
-
-
Robbert Krebbers authored
Used the following script: sed ' s/\bCofeMor/OfeMor/g; s/\-c>/\-d>/g; s/\bcFunctor/oFunctor/g; s/\bCFunctor/OFunctor/g; s/\b\%CF/\%OF/g; s/\bconstCF/constOF/g; s/\bidCF/idOF/g s/\bdiscreteC/discreteO/g; s/\bleibnizC/leibnizO/g; s/\bunitC/unitO/g; s/\bprodC/prodO/g; s/\bsumC/sumO/g; s/\bboolC/boolO/g; s/\bnatC/natO/g; s/\bpositiveC/positiveO/g; s/\bNC/NO/g; s/\bZC/ZO/g; s/\boptionC/optionO/g; s/\blaterC/laterO/g; s/\bofe\_fun/discrete\_fun/g; s/\bdiscrete\_funC/discrete\_funO/g; s/\bofe\_morC/ofe\_morO/g; s/\bsigC/sigO/g; s/\buPredC/uPredO/g; s/\bcsumC/csumO/g; s/\bagreeC/agreeO/g; s/\bauthC/authO/g; s/\bnamespace_mapC/namespace\_mapO/g; s/\bcmra\_ofeC/cmra\_ofeO/g; s/\bucmra\_ofeC/ucmra\_ofeO/g; s/\bexclC/exclO/g; s/\bgmapC/gmapO/g; s/\blistC/listO/g; s/\bvecC/vecO/g; s/\bgsetC/gsetO/g; s/\bgset\_disjC/gset\_disjO/g; s/\bcoPsetC/coPsetO/g; s/\bgmultisetC/gmultisetO/g; s/\bufracC/ufracO/g s/\bfracC/fracO/g; s/\bvalidityC/validityO/g; s/\bbi\_ofeC/bi\_ofeO/g; s/\bsbi\_ofeC/sbi\_ofeO/g; s/\bmonPredC/monPredO/g; s/\bstateC/stateO/g; s/\bvalC/valO/g; s/\bexprC/exprO/g; s/\blocC/locO/g; ' -i $(find theories -name "*.v")
-
- 13 Mar, 2019 1 commit
-
-
Ralf Jung authored
-
- 03 Mar, 2019 1 commit
-
-
Ralf Jung authored
-
- 29 Oct, 2018 2 commits
-
-
Jacques-Henri Jourdan authored
-
Jacques-Henri Jourdan authored
We add a specific constructor to the type of expressions for injecting values in expressions. The advantage are : - Values can be assumed to be always closed when performing substitutions (even though they could contain free variables, but it turns out it does not cause any problem in the proofs in practice). This means that we no longer need the `Closed` typeclass and everything that comes with it (all the reflection-based machinery contained in tactics.v is no longer necessary). I have not measured anything, but I guess this would have a significant performance impact. - There is only one constructor for values. As a result, the AsVal and IntoVal typeclasses are no longer necessary: an expression which is a value will always unify with `Val _`, and therefore lemmas can be stated using this constructor. Of course, this means that there are two ways of writing such a thing as "The pair of integers 1 and 2": Either by using the value constructor applied to the pair represented as a value, or by using the expression pair constructor. So we add reduction rules that transform reduced pair, injection and closure expressions into values. At first, this seems weird, because of the redundancy. But in fact, this has some meaning, since the machine migth actually be doing something to e.g., allocate the pair or the closure. These additional steps of computation show up in the proofs, and some additional wp_* tactics need to be called.
-
- 03 Jul, 2018 1 commit
-
-
Ralf Jung authored
Just to cover more cases, hopefully.
-
- 17 May, 2018 1 commit
-
-
Ralf Jung authored
move test suite out of theories/ so it does not get installed; also check output of test suite so that we can test printing
-
- 02 May, 2018 1 commit
-
-
Ralf Jung authored
-
- 25 Apr, 2018 1 commit
-
-
Ralf Jung authored
-
- 30 Oct, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 25 Sep, 2017 1 commit
-
-
Dan Frumin authored
Instead of writing a separate tactic lemma for each pure reduction, there is a single tactic lemma for performing all of them. The instances of PureExec can be shared between WP tactics and, e.g. symbolic execution in the ghost threadpool
-
- 09 Sep, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 20 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 25 Jan, 2017 1 commit
-
-
Ralf Jung authored
Also add "Local" to some Default Proof Using to keep them more contained
-
- 09 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 06 Jan, 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
-