1. 07 Apr, 2019 1 commit
  2. 13 Mar, 2019 1 commit
  3. 05 Mar, 2019 1 commit
  4. 03 Mar, 2019 2 commits
  5. 20 Feb, 2019 1 commit
  6. 05 Feb, 2019 1 commit
  7. 25 Jan, 2019 1 commit
  8. 24 Jan, 2019 3 commits
  9. 22 Jan, 2019 1 commit
  10. 19 Jan, 2019 4 commits
  11. 13 Jan, 2019 1 commit
  12. 11 Jan, 2019 1 commit
    • Robbert Krebbers's avatar
      Allow `iSpecialize` to be nested. · c6af67f9
      Robbert Krebbers authored
      It now supports the specialization pattern `(H spat1 .. spatn)`, which first
      recursively specializes the hypothesis `H` using the specialization patterns
      `spat1 .. spatn`.
      c6af67f9
  13. 25 Dec, 2018 1 commit
  14. 13 Dec, 2018 2 commits
  15. 06 Dec, 2018 1 commit
  16. 27 Nov, 2018 2 commits
  17. 31 Oct, 2018 1 commit
  18. 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
  19. 22 Oct, 2018 2 commits
  20. 04 Oct, 2018 3 commits
  21. 03 Oct, 2018 1 commit
  22. 31 Jul, 2018 1 commit
  23. 13 Jul, 2018 1 commit
  24. 05 Jul, 2018 1 commit
  25. 04 Jul, 2018 4 commits