1. 03 Apr, 2020 1 commit
  2. 02 Apr, 2020 2 commits
  3. 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
  4. 24 Jun, 2019 3 commits
  5. 16 Jun, 2019 1 commit
    • 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
  6. 24 May, 2019 1 commit
    • Robbert Krebbers's avatar
      More consistent naming for `auth`. · 597ec42e
      Robbert Krebbers authored
      This MR is a follow up on the renamings performed (implicitly) as part of
      !215. This MR makes the following changes:
      
      - `auth_both_frac_valid` and `auth_both_valid` are now of the same shape
        as `auth_both_frac_validN` and `auth_both_validN`. That is, both are
        now biimplications.
      - The left-to-right  direction of `auth_both_frac_valid` and
        `auth_both_valid` only holds in case the camera is discrete. The
        right-to-left versions for non-discrete cameras are prefixed `_2`, the
        convention that we use throughout the development.
      - Change the direction of lemmas like `auth_frag_valid` and
        `auth_auth_valid` so that it's consistent with the other lemmas. I.e.
        make sure that the ◯ and ● are always on the LHS of the biimplication.
      597ec42e
  7. 23 May, 2019 1 commit
  8. 20 Feb, 2019 1 commit
  9. 29 Oct, 2018 2 commits
    • Jacques-Henri Jourdan's avatar
      wp_pures. · 2950fca6
      Jacques-Henri Jourdan authored
      2950fca6
    • Jacques-Henri Jourdan's avatar
      A specific constructor for injecting values in expressions · 9646293e
      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.
      9646293e
  10. 04 Oct, 2018 1 commit
  11. 02 May, 2018 1 commit
  12. 25 Apr, 2018 1 commit
  13. 07 Feb, 2018 1 commit
  14. 23 Dec, 2017 1 commit
  15. 04 Dec, 2017 1 commit
  16. 13 Nov, 2017 1 commit
  17. 25 Oct, 2017 2 commits
  18. 25 Sep, 2017 1 commit
  19. 17 Sep, 2017 1 commit
  20. 09 Sep, 2017 1 commit
  21. 24 Mar, 2017 1 commit
  22. 27 Jan, 2017 1 commit
  23. 09 Jan, 2017 1 commit
  24. 06 Jan, 2017 1 commit
  25. 05 Jan, 2017 1 commit
  26. 03 Jan, 2017 1 commit
  27. 09 Dec, 2016 3 commits
  28. 08 Dec, 2016 1 commit
  29. 06 Dec, 2016 2 commits
  30. 22 Nov, 2016 1 commit
  31. 17 Nov, 2016 1 commit
  32. 03 Nov, 2016 1 commit
    • Robbert Krebbers's avatar
      Use symbol ∗ for separating conjunction. · cc31476d
      Robbert Krebbers authored
      The old choice for ★ was a arbitrary: the precedence of the ASCII asterisk *
      was fixed at a wrong level in Coq, so we had to pick another symbol. The ★ was
      a random choice from a unicode chart.
      
      The new symbol ∗ (as proposed by David Swasey) corresponds better to
      conventional practise and matches the symbol we use on paper.
      cc31476d