1. 10 Jun, 2018 1 commit
  2. 23 May, 2018 2 commits
  3. 27 Apr, 2018 1 commit
  4. 05 Apr, 2018 2 commits
  5. 08 Mar, 2018 1 commit
  6. 21 Nov, 2017 1 commit
    • Robbert Krebbers's avatar
      Pattern matching notation for monadic binds. · dcd59f13
      Robbert Krebbers authored
      This gets rid of the old hack to have specific notations for pairs
      up to a fixed arity, and moreover allows to do fancy things like:
      
      ```
      Record test := Test { t1 : nat; t2 : nat }.
      
      Definition foo (x : option test) : option nat :=
        ''(Test a1 a2) ← x;
        Some a1.
      ```
      dcd59f13
  7. 31 Oct, 2017 1 commit
  8. 21 Sep, 2017 1 commit
  9. 08 Sep, 2017 1 commit
  10. 15 Mar, 2017 1 commit
  11. 11 Mar, 2017 1 commit
  12. 09 Mar, 2017 1 commit
  13. 22 Feb, 2017 1 commit
  14. 31 Jan, 2017 3 commits
  15. 16 Nov, 2016 1 commit
  16. 07 Nov, 2016 1 commit
  17. 04 Oct, 2016 2 commits
  18. 20 Sep, 2016 1 commit
  19. 09 Sep, 2016 2 commits
  20. 22 Aug, 2016 1 commit
  21. 04 Aug, 2016 2 commits
  22. 03 Jul, 2016 2 commits
  23. 26 Feb, 2016 1 commit
  24. 20 Feb, 2016 1 commit
  25. 17 Feb, 2016 2 commits
  26. 13 Feb, 2016 1 commit
  27. 11 Feb, 2016 3 commits
    • Robbert Krebbers's avatar
      Shorter names for common math notions. · 44b18f4d
      Robbert Krebbers authored
      Also do some minor clean up.
      44b18f4d
    • Robbert Krebbers's avatar
      Revert "prelude: add notation for > and >= for all kinds of numbers" · 7ebc1859
      Robbert Krebbers authored
      This reverts commit 24fa20e5f8a2042caa19f1f6505102c5434cce54.
      
      Although these symmetric variants sometimes look "better", they
      are really annoying and should IMHO never be used:
      
      1.) For lemmas there is now a choice between >= and <=. Since there is
      no longer a canonical choice, it is very easy to introduce a lot of
      inconsistencies in statements of lemmas.
      
      2.) For automation the situation becomes annoying, you have to built in
      stuff for both >= and <=. That is very error-prone.
      
      3.) For N and Z the notions x <= y and y >= x are not even convertible!
      That means that done/by does not solve x <= y if you have y >= x and if
      avoids you applying certain lemmas.
      7ebc1859
    • Ralf Jung's avatar
      f4192019
  28. 12 Jan, 2016 1 commit
  29. 11 Dec, 2015 1 commit