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
      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 (??).
  2. 29 Jun, 2019 1 commit
  3. 24 Jun, 2019 3 commits
  4. 14 Jun, 2019 1 commit
  5. 25 Apr, 2019 1 commit
  6. 24 Jan, 2019 1 commit
  7. 29 Oct, 2018 1 commit
    • 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
      - 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.
  8. 04 Oct, 2018 1 commit
  9. 13 Jul, 2018 4 commits
  10. 02 Jul, 2018 1 commit
  11. 28 Jun, 2018 1 commit
    • Ralf Jung's avatar
      Make CAS slightly more realistic · 53216eb5
      Ralf Jung authored
      This restricts CAS to only be able to compare literals with literals, NONEV with NONEV and NONEV with SOMEV for a literal.
  12. 18 Jun, 2018 1 commit
  13. 04 Jun, 2018 2 commits
  14. 21 Feb, 2018 2 commits
  15. 20 Feb, 2018 1 commit
  16. 19 Feb, 2018 1 commit