1. 18 Oct, 2018 7 commits
    • Robbert Krebbers's avatar
      Allow `IntoVal` to take pure steps. · ae5de30b
      Robbert Krebbers authored
      ae5de30b
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      Move `Atomic`, `IntoVal` and `AsVal` instances to lifting. · c6abcd9b
      Robbert Krebbers authored
      Other heap_lang related instances in that file too. Now, the tactics
      file only contains stuff related to actual tactics.
      c6abcd9b
    • Robbert Krebbers's avatar
      Automate proofs of `Atomic` instances. · bfb19a5b
      Robbert Krebbers authored
      bfb19a5b
    • Robbert Krebbers's avatar
      Misc white space nits. · dca0426f
      Robbert Krebbers authored
      dca0426f
    • Jacques-Henri Jourdan's avatar
      Curry par · b8e6ea7b
      Jacques-Henri Jourdan authored
      b8e6ea7b
    • Jacques-Henri Jourdan's avatar
      A specific constructor for injecting values in expressions · 8d38ee26
      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.
      8d38ee26
  2. 13 Oct, 2018 1 commit
  3. 11 Oct, 2018 1 commit
  4. 07 Oct, 2018 1 commit
  5. 05 Oct, 2018 8 commits
  6. 04 Oct, 2018 12 commits
  7. 03 Oct, 2018 2 commits
  8. 30 Sep, 2018 1 commit
  9. 26 Sep, 2018 1 commit
  10. 18 Sep, 2018 3 commits
  11. 12 Sep, 2018 3 commits