1. 31 Jan, 2017 1 commit
  2. 23 Nov, 2016 1 commit
  3. 22 Nov, 2016 1 commit
  4. 21 Nov, 2016 3 commits
  5. 20 Nov, 2016 1 commit
  6. 28 Sep, 2016 1 commit
  7. 27 Sep, 2016 1 commit
  8. 22 Jul, 2016 3 commits
  9. 23 Mar, 2016 1 commit
  10. 17 Feb, 2016 4 commits
  11. 13 Feb, 2016 1 commit
  12. 11 Feb, 2016 1 commit
  13. 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
  14. 12 Jan, 2016 1 commit
  15. 11 Dec, 2015 1 commit
  16. 18 Nov, 2015 1 commit
  17. 16 Nov, 2015 1 commit
  18. 03 Feb, 2017 1 commit
  19. 08 Feb, 2015 1 commit
  20. 30 Sep, 2014 1 commit
  21. 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
  22. 02 May, 2014 2 commits
  23. 21 Aug, 2013 1 commit
  24. 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
  25. 17 Jun, 2013 1 commit
  26. 15 May, 2013 1 commit
  27. 11 May, 2013 1 commit
  28. 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
  29. 19 Feb, 2013 1 commit
    • Robbert Krebbers's avatar
      Support sequence point, add permissions, and update prelude. · 415a4f1c
      Robbert Krebbers authored
      Both the operational and axiomatic semantics are extended with sequence points
      and a permission system based on fractional permissions. In order to achieve
      this, the memory model has been completely revised, and is now built on top
      of an abstract interface for permissions.
      
      Apart from these changed, the library on lists and sets has been heavily
      extended, and minor changed have been made to other parts of the prelude.
      415a4f1c
  30. 09 Jan, 2013 1 commit
  31. 05 Jan, 2013 1 commit
    • Robbert Krebbers's avatar
      Various small changes. · 507a150a
      Robbert Krebbers authored
      * Define the standard strict order on pre orders.
      * Prove that this strict order is well founded for finite sets and finite maps.
        We also provide some utilities to compute with well founded recursion.
      * Improve the "simplify_option_equality" tactic to handle more cases.
      * Axiomatize finiteness of finite maps by translation to lists, instead of by
        them having a finite domain.
      * Prove many additional properties of finite maps.
      * Add many functions and theorems on lists, including: permutations, resize,
        filter, ...
      507a150a
  32. 12 Nov, 2012 1 commit
    • Robbert Krebbers's avatar
      Many relatively small changes. · 50dfc148
      Robbert Krebbers authored
      Most interestingly:
      * Use [lia] instead of [omega] everywhere
      * More many generic lemmas on the memory to the theory on finite maps.
      * Many additional list lemmas.
      * A new interface for a monad for collections, which is now also used by the
        collection tactics.
      * Provide an additional finite collection implementation using unordered lists
        without duplicates removed. This implementation forms a monad (just the list
        monad in disguise).
      50dfc148