1. 13 Jun, 2018 2 commits
  2. 10 Jun, 2018 2 commits
  3. 09 Jun, 2018 1 commit
  4. 06 Jun, 2018 7 commits
  5. 05 Jun, 2018 1 commit
  6. 01 Jun, 2018 4 commits
  7. 31 May, 2018 1 commit
  8. 29 May, 2018 3 commits
  9. 17 May, 2018 1 commit
  10. 09 Dec, 2016 4 commits
  11. 08 Dec, 2016 1 commit
  12. 06 Dec, 2016 1 commit
  13. 24 Nov, 2016 1 commit
  14. 22 Nov, 2016 3 commits
    • Robbert Krebbers's avatar
      Make nclose an explicit coercion. · 274209c2
      Robbert Krebbers authored
      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
    • Ralf Jung's avatar
      new notation for pure assertions · 99cbb525
      Ralf Jung authored
      99cbb525
    • Ralf Jung's avatar
      use OFEs instead of COFEs everywhere · 75518c9a
      Ralf Jung authored
      Use COFEs only for the recursive domain equation solver
      75518c9a
  15. 09 Nov, 2016 2 commits
  16. 03 Nov, 2016 2 commits
  17. 01 Nov, 2016 3 commits
  18. 31 Oct, 2016 1 commit