1. 15 Mar, 2017 1 commit
  2. 31 Jan, 2017 4 commits
  3. 23 Nov, 2016 1 commit
  4. 22 Nov, 2016 1 commit
  5. 21 Nov, 2016 3 commits
  6. 20 Nov, 2016 1 commit
  7. 28 Sep, 2016 1 commit
  8. 27 Sep, 2016 1 commit
  9. 22 Jul, 2016 3 commits
  10. 23 Mar, 2016 1 commit
  11. 17 Feb, 2016 4 commits
  12. 13 Feb, 2016 1 commit
  13. 11 Feb, 2016 1 commit
  14. 16 Jan, 2016 1 commit
    • Robbert Krebbers's avatar
      Remove elem_of_tactic that uses intuition. · 4b4e270e
      Robbert Krebbers authored
      This one (previously solve_elem_of) was hardly used. The tactic that uses
      naive_solver (previously esolve_elem_of, now solve_elem_of) has been
      extended with flags to say which hypotheses should be cleared/kept.
      4b4e270e
  15. 12 Jan, 2016 1 commit
  16. 11 Dec, 2015 1 commit
  17. 18 Nov, 2015 1 commit
  18. 16 Nov, 2015 1 commit
  19. 03 Feb, 2017 1 commit
  20. 08 Feb, 2015 1 commit
  21. 30 Sep, 2014 1 commit
  22. 05 Jun, 2014 1 commit
    • Robbert Krebbers's avatar
      Preparation to port the master branch · d60affc0
      Robbert Krebbers authored
      Major changes:
      * A data structure to collect locked addresses in memory.
      * Operations to lock and unlock addresses.
      * Remove [ctree_Forall] and express it using [Forall] and [ctree_flatten]. This
        saves a lot of lines of code.
      * Add a [void] value. This value cannot be typed, but will be used as a dummy
        return value for functions with return type [void].
      
      Minor changes:
      * Various deciders in preparation of the executable semantics.
      * Improve naming and notations.
      * Remove obsolete stuff.
      d60affc0
  23. 02 May, 2014 2 commits
  24. 21 Aug, 2013 1 commit
  25. 12 Aug, 2013 1 commit
    • Robbert Krebbers's avatar
      Finite maps and sets using ordered association lists. · bc659ba4
      Robbert Krebbers authored
      This commit includes the following changes:
      * More theorems about pre-, partial and total orders.
      * Define the lexicographic order on various commonly used data types.
      * Mergesort and its correctness proof.
      * Implement finite maps and sets using ordered association lists.
      bc659ba4
  26. 17 Jun, 2013 1 commit
  27. 15 May, 2013 1 commit
  28. 11 May, 2013 1 commit
  29. 07 May, 2013 1 commit
    • Robbert Krebbers's avatar
      Lots of refactoring. and new results on permutations and list containment. · 361308c7
      Robbert Krebbers authored
      The refactoring includes:
      * Use infix notations for the various list relations
      * More consistent naming
      * Put lemmas on one line whenever possible
      * Change proofs into one-liners when possible
      * Make better use of the "Implicit Types" command
      * Improve the order of the list module by placing all definitions at the start,
        then the proofs, and finally the tactics.
      
      Besides, there is some new machinery for proofs by reflection on lists. It is
      used for a decision procedure for permutations and list containment.
      361308c7