1. 30 Nov, 2017 1 commit
  2. 24 Nov, 2017 3 commits
  3. 23 Nov, 2017 1 commit
  4. 09 Nov, 2017 2 commits
  5. 08 Nov, 2017 3 commits
  6. 05 Nov, 2017 1 commit
  7. 01 Nov, 2017 2 commits
    • Robbert Krebbers's avatar
      Hide the proof mode entailment behind a definition. · 8574d1ea
      Robbert Krebbers authored
      This solves issue #100: the proof mode notation is sometimes not printed. As
      Ralf discovered, the problem is that there are two overlapping notations:
      
      ```coq
      Notation "P ⊢ Q" := (uPred_entails P Q).
      ```
      
      And the "proof mode" notation:
      
      ```
      Notation "Γ '--------------------------------------' □ Δ '--------------------------------------' ∗ Q" :=
        (of_envs (Envs Γ Δ) ⊢ Q%I).
      ```
      
      These two notations overlap, so, when having a "proof mode" goal of the shape
      `of_envs (Envs Γ Δ) ⊢ Q%I`, how do we know which notation is Coq going to pick
      for pretty printing this goal? As we have seen, this choice depends on the
      import order (since both notations appear in different files), and as such, Coq
      sometimes (unintendedly) uses the first notation instead of the latter.
      
      The idea of this commit is to wrap `of_envs (Envs Γ Δ) ⊢ Q%I` into a definition
      so that there is no ambiguity for the pretty printer anymore.
      8574d1ea
    • Robbert Krebbers's avatar
      Add an `AsVal` type class. · b2ed0162
      Robbert Krebbers authored
      This class, in combination with `TCForall`, turns out the useful in
      LambdaRust to express that lists of expressions are values.
      b2ed0162
  8. 25 Sep, 2017 10 commits
  9. 09 Sep, 2017 1 commit
  10. 28 Aug, 2017 1 commit
    • Robbert Krebbers's avatar
      Optimize wp_apply and improve its error reporting. · 211dc7ca
      Robbert Krebbers authored
      We now first iPoseProof the lemma and instantiate its premises before trying
      to search for the sub-term where to apply. As a result, instantiation of the
      premises of the applied lemmas happens only once, instead of it being done for
      each sub-term as obtained by reshape_expr.
      211dc7ca
  11. 20 Jan, 2017 1 commit
  12. 05 Jan, 2017 1 commit
  13. 03 Jan, 2017 1 commit
  14. 12 Dec, 2016 3 commits
  15. 09 Dec, 2016 4 commits
  16. 27 Nov, 2016 1 commit
  17. 23 Nov, 2016 1 commit
  18. 22 Nov, 2016 1 commit
    • Robbert Krebbers's avatar
      Make nclose an explicit coercion. · 274209c2
      Robbert Krebbers authored and Ralf Jung's avatar Ralf Jung committed
      We do this by introducing a type class UpClose with notation ↑.
      
      The reason for this change is as follows: since `nclose : namespace
      → coPset` is declared as a coercion, the notation `nclose N ⊆ E` was
      pretty printed as `N ⊆ E`. However, `N ⊆ E` could not be typechecked
      because type checking goes from left to right, and as such would look
      for an instance `SubsetEq namespace`, which causes the right hand side
      to be ill-typed.
      274209c2
  19. 01 Nov, 2016 2 commits