 02 Apr, 2020 1 commit


Robbert Krebbers authored
`{o,r,ur}Functor_map_{ne,id,compose,contractive}`.

 01 Apr, 2020 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 01 Nov, 2019 1 commit


Ralf Jung authored

 19 Sep, 2019 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 13 Sep, 2019 1 commit


JacquesHenri 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 (??).

 18 Jun, 2019 1 commit


Robbert Krebbers authored

 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")

 03 Jun, 2019 1 commit


Robbert Krebbers authored
This allows one to make use of recursive ghost state obtained from the recursive domain equation solver.

 28 May, 2019 1 commit


Robbert Krebbers authored

 25 May, 2019 1 commit


Ralf Jung authored
With Coq master, we otherwise fail to infer instances with subG_savedAnythingΣ, which leads to goals like > looking for (subG > (@savedAnythingΣ (@ofe_funCF val (fun _ : val => laterCF idCF)) > ?cFunctorContractive0) Σ)

 20 May, 2019 1 commit


Robbert Krebbers authored

 16 May, 2019 1 commit


Paolo G. Giarrusso authored

 05 Mar, 2019 1 commit


Ralf Jung authored

 03 Mar, 2019 2 commits
 29 May, 2018 1 commit


Ralf Jung authored

 27 Nov, 2017 1 commit


Robbert Krebbers authored

 30 Oct, 2017 1 commit


Robbert Krebbers authored

 28 Oct, 2017 1 commit


Robbert Krebbers authored
This way, it can be used with `iApply`.

 25 Oct, 2017 1 commit


Robbert Krebbers authored

 22 Feb, 2017 2 commits


Robbert Krebbers authored
I probably tested against a wrong version. This reverts commit 02bc52b4.

Robbert Krebbers authored
This makes lambdarust 1 min (=7%) faster.

 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

 22 Nov, 2016 1 commit


Ralf Jung authored
Use COFEs only for the recursive domain equation solver

 28 Oct, 2016 1 commit


Ralf Jung authored

 25 Oct, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 29 Aug, 2016 1 commit


Robbert Krebbers authored
This avoids Coq distinguishing iProp and uPred (iResUR _) when it should not.

 10 Aug, 2016 1 commit


Zhen Zhang authored

 09 Aug, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 08 Aug, 2016 1 commit


Robbert Krebbers authored
This makes stuff more uniform and also removes the need for the [inGFs] type class. Instead, there is now a type class [subG Σ1 Σ2] which expresses that a list of functors [Σ1] is contained in [Σ2].

 05 Aug, 2016 1 commit


Robbert Krebbers authored
This commit features:  A simpler model. The recursive domain equation no longer involves a triple containing invariants, physical state and ghost state, but just ghost state. Invariants and physical state are encoded using (higherorder) ghost state.  (Primitive) view shifts are formalized in the logic and all properties about it are proven in the logic instead of the model. Instead, the core logic features only a notion of raw view shifts which internalizing performing frame preserving updates.  A better behaved notion of mask changing view shifts. In particular, we no longer have sideconditions on transitivity of view shifts, and we have a rule for introduction of mask changing view shifts ={E1,E2}=> P with E2 ⊆ E1 which allows to postpone performing a view shift.  The weakest precondition connective is formalized in the logic using Banach's fixpoint. All properties about the connective are proven in the logic instead of directly in the model.  Adequacy is proven in the logic and uses a primitive form of adequacy for uPred that only involves raw views shifts and laters. Some remarks:  I have removed binary view shifts. I did not see a way to describe all rules of the new mask changing view shifts using those.  There is no longer the need for the notion of "frame shifting assertions" and these are thus removed. The rules for Hoare triples are thus also stated in terms of primitive view shifts. TODO:  Maybe rename primitive view shift into something more sensible  Figure out a way to deal with closed proofs (see the commented out stuff in tests/heap_lang and tests/barrier_client).

 28 May, 2016 1 commit


Robbert Krebbers authored
Based on an idea and WIP commits of JH. Jourdan: the core of a CMRA A is now a partial function A → option A. TODO: define sum CMRA TODO: remove one shot CMRA and define it in terms of sum
