1. 13 Sep, 2019 1 commit
    • Jacques-Henri Jourdan's avatar
      Reorder Requires so that we do not depend of Export bugs. · 43a1a90f
      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 (??).
      43a1a90f
  2. 06 Sep, 2019 1 commit
  3. 27 Aug, 2019 1 commit
  4. 26 Aug, 2019 1 commit
  5. 13 Aug, 2019 4 commits
  6. 12 Aug, 2019 1 commit
  7. 30 Jul, 2019 1 commit
  8. 13 Jul, 2019 3 commits
  9. 12 Jul, 2019 1 commit
  10. 07 Jul, 2019 1 commit
  11. 03 Jul, 2019 3 commits
  12. 27 Jun, 2019 1 commit
  13. 25 Jun, 2019 3 commits
  14. 24 Jun, 2019 4 commits
  15. 21 Jun, 2019 1 commit
  16. 18 Jun, 2019 1 commit
  17. 16 Jun, 2019 2 commits
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      Replace `C`s with `O`s since we use OFEs instead of COFEs. · 2855d1f5
      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")
      2855d1f5
  18. 11 Jun, 2019 4 commits
    • Ralf Jung's avatar
      change frac_auth notation · 94cfebc2
      Ralf Jung authored
      94cfebc2
    • Robbert Krebbers's avatar
      Fix compilation with Coq master. · 265c2a13
      Robbert Krebbers authored
      265c2a13
    • Ralf Jung's avatar
      more failing unification places · 7154d5b5
      Ralf Jung authored
      7154d5b5
    • Robbert Krebbers's avatar
      The unbounded fractional authoritative camera. · 151dda05
      Robbert Krebbers authored
      The unbounded fractional authoritative camera is a version of the fractional
      authoritative camera that can be used with fractions `> 1`.
      
      Most of the reasoning principles for this version of the fractional
      authoritative cameras are the same as for the original version. There are two
      difference:
      
      - We get the additional rule that can be used to allocate a "surplus", i.e.
        if we have the authoritative element we can always increase its fraction
        and allocate a new fragment.
      
            ✓ (a ⋅ b) → ●U{p} a ~~> ●U{p + q} (a ⋅ b) ⋅ ◯U{q} b
      
      - At the cost of that, we no longer have the `◯U{1} a` is an exclusive
        fragmental element (cf. `frac_auth_frag_validN_op_1_l`).
      151dda05
  19. 10 Jun, 2019 3 commits
  20. 05 Jun, 2019 1 commit
  21. 03 Jun, 2019 1 commit
  22. 30 May, 2019 1 commit