1. 05 Jun, 2014 1 commit
  2. 24 May, 2014 1 commit
  3. 22 May, 2014 1 commit
    • Robbert Krebbers's avatar
      Various changes. · bb9d75d9
      Robbert Krebbers authored
      * Parametrize refinements with memories. This way, refinements imply typing,
        for example [w1 ⊑{Γ,f@m1↦m2} w2 : τ → (Γ,m1) ⊢ w1 : τ]. This relieves us from
        various hacks.
      * Use addresses instead of index/references pairs for lookup and alter
        operations on memories.
      * Prove various disjointness properties.
      bb9d75d9
  4. 04 May, 2014 1 commit
  5. 02 May, 2014 3 commits
  6. 09 Sep, 2013 2 commits
  7. 27 Aug, 2013 1 commit
  8. 21 Aug, 2013 4 commits
  9. 15 Aug, 2013 1 commit
  10. 14 Aug, 2013 1 commit
  11. 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
  12. 24 Jun, 2013 2 commits
  13. 17 Jun, 2013 2 commits
  14. 21 May, 2013 1 commit
  15. 15 May, 2013 1 commit
  16. 12 May, 2013 1 commit
  17. 11 May, 2013 2 commits
  18. 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
  19. 02 Apr, 2013 1 commit
  20. 25 Mar, 2013 1 commit
  21. 14 Mar, 2013 1 commit
  22. 24 Feb, 2013 1 commit
  23. 22 Feb, 2013 1 commit
  24. 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
  25. 01 Feb, 2013 1 commit
  26. 09 Jan, 2013 3 commits
  27. 05 Jan, 2013 3 commits
    • Robbert Krebbers's avatar
      Add missing notations on Z. · 6c89f5de
      Robbert Krebbers authored
      6c89f5de
    • Robbert Krebbers's avatar
      d8445c86
    • 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