1. 29 Jan, 2019 1 commit
  2. 27 Oct, 2017 1 commit
  3. 29 Sep, 2017 1 commit
  4. 20 Sep, 2017 1 commit
  5. 17 Sep, 2017 1 commit
    • Robbert Krebbers's avatar
      Set Hint Mode for all classes in `base.v`. · 7d7c9871
      Robbert Krebbers authored
      This provides significant robustness against looping type class search.
      
      As a consequence, at many places throughout the library we had to add
      additional typing information to lemmas. This was to be expected, since
      most of the old lemmas were ambiguous. For example:
      
        Section fin_collection.
          Context `{FinCollection A C}.
      
          size_singleton (x : A) : size {[ x ]} = 1.
      
      In this case, the lemma does not tell us which `FinCollection` with
      elements `A` we are talking about. So, `{[ x ]}` could not only refer to
      the singleton operation of the `FinCollection A C` in the section, but
      also to any other `FinCollection` in the development. To make this lemma
      unambigious, it should be written as:
      
        Lemma size_singleton (x : A) : size ({[ x ]} : C) = 1.
      
      In similar spirit, lemmas like the one below were also ambiguous:
      
        Lemma lookup_alter_None {A} (f : A → A) m i j :
          alter f i m !! j = None  m !! j = None.
      
      It is not clear which finite map implementation we are talking about.
      To make this lemma unambigious, it should be written as:
      
        Lemma lookup_alter_None {A} (f : A → A) (m : M A) i j :
          alter f i m !! j = None  m !! j = None.
      
      That is, we have to specify the type of `m`.
      7d7c9871
  6. 15 Mar, 2017 1 commit
  7. 31 Jan, 2017 2 commits
  8. 20 Sep, 2016 1 commit
  9. 27 Jul, 2016 2 commits
  10. 22 Jul, 2016 1 commit
  11. 23 Mar, 2016 1 commit
  12. 20 Feb, 2016 1 commit
  13. 17 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      Rename solve_elem_of into set_solver. · 37e95231
      Robbert Krebbers authored
      It is doing much more than just dealing with ∈, it solves all kinds
      of goals involving set operations (including ≡ and ⊆).
      37e95231
    • Robbert Krebbers's avatar
      Rename simplify_equality like tactics. · 20690605
      Robbert Krebbers authored
      simplify_equality        => simplify_eq
      simplify_equality'       => simplify_eq/=
      simplify_map_equality    => simplify_map_eq
      simplify_map_equality'   => simplify_map_eq/=
      simplify_option_equality => simplify_option_eq
      simplify_list_equality   => simplify_list_eq
      f_equal'                 => f_equal/=
      
      The /= suffixes (meaning: do simpl) are inspired by ssreflect.
      20690605
  14. 16 Feb, 2016 1 commit
  15. 13 Feb, 2016 1 commit
  16. 16 Jan, 2016 2 commits
  17. 21 Dec, 2015 1 commit
  18. 16 Nov, 2015 1 commit
  19. 03 Feb, 2017 1 commit
  20. 04 Jun, 2015 1 commit
  21. 22 Apr, 2015 1 commit
  22. 02 Mar, 2015 1 commit
  23. 08 Feb, 2015 1 commit
  24. 02 May, 2014 2 commits
  25. 15 May, 2013 1 commit
  26. 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
  27. 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