1. 20 Feb, 2019 2 commits
    • Robbert Krebbers's avatar
      Consistently use `set` and `map` names. · b7e31ce2
      Robbert Krebbers authored
      Get rid of using `Collection` and favor `set` everywhere. Also, prefer conversion
      functions that are called `X_to_Y`.
      The following sed script performs most of the renaming, with the exception of:
      - `set`, which has been renamed into `propset`. I couldn't do this rename
        using `sed` since it's too context sensitive.
      - There was a spurious rename of `Vec.of_list`, which I correctly manually.
      - Updating some section names and comments.
      sed '
      ' -i $(find -name "*.v")
    • Robbert Krebbers's avatar
      ∈ on `listset` is decidable. · 22d4a0cd
      Robbert Krebbers authored
  2. 29 Jan, 2019 1 commit
  3. 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`.
  4. 08 Sep, 2017 1 commit
  5. 15 Mar, 2017 1 commit
  6. 31 Jan, 2017 3 commits
  7. 20 Sep, 2016 1 commit
  8. 22 Jul, 2016 1 commit
  9. 11 Jul, 2016 1 commit
    • Robbert Krebbers's avatar
      Remove CollectionOps class. · 8a431343
      Robbert Krebbers authored
      This class whose name is horrible and purpose is arbitrary seems to be a
      leftover of some experiment with ch2o, a long time a ago.
  10. 03 Mar, 2016 1 commit
  11. 17 Feb, 2016 2 commits
  12. 13 Feb, 2016 1 commit
  13. 16 Nov, 2015 1 commit
  14. 24 Feb, 2015 1 commit
  15. 08 Feb, 2015 1 commit
  16. 03 Sep, 2014 1 commit
  17. 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.
  18. 02 May, 2014 2 commits
  19. 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.
  20. 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.
  21. 09 Jan, 2013 1 commit
  22. 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, ...
  23. 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).
  24. 19 Oct, 2012 1 commit
    • Robbert Krebbers's avatar
      Add non-deterministic expressions with side-effects. · e82cda6c
      Robbert Krebbers authored
      The following things have been changed in this revision:
      * We now give a small step semantics for expressions. The denotational semantics
        only works for side-effect free expressions.
      * Dynamically allocated memory through alloc and free is now supported.
      * The following expressions are added: assignment, function call, unary
        operators, conditional, alloc, and free.
      * Some customary induction schemes for expressions are proven.
      * The axiomatic semantics (and its interpretation) have been changed in order
        to deal with non-deterministic expressions.
      * We have added inversion schemes based on small inversions for the operational
        semantics. Inversions using these schemes are much faster.
      * We improved the statement preservation proof of the operational semantics.
      * We now use a variant of SsReflect's [by] and [done], instead of Coq's [now]
        and [easy]. The [done] tactic is much faster as it does not perform
      * Add theory, definitions and notations on vectors.
      * Separate theory on contexts.
      * Change [Arguments] declarations to ensure better unfolding.
  25. 29 Aug, 2012 1 commit
  26. 21 Aug, 2012 1 commit
    • Robbert Krebbers's avatar
      Major revision of the whole development. · 18669b92
      Robbert Krebbers authored
      The main changes are:
      * Function calls in the operational semantics
      * Mutually recursive function calls in the axiomatic semantics
      * A general definition of the interpretation of the axiomatic semantics  so as
        to improve reusability (useful for function calls, and also for expressions
        in future versions)
      * Type classes for stack independent, memory independent, and memory extensible
        assertions, and a lot of instances to automatically derive these properties.
      * Many additional lemmas on the memory and more robust tactics to simplify
        goals involving is_free and mem_disjoint
      * Proof of preservation of statements in the smallstep semantics
      * Some new tactics: feed, feed destruct, feed inversion, etc...
      * More robust tactic scripts using bullets and structured scripts
      * Truncate most lines at 80 characters
  27. 11 Jun, 2012 1 commit