1. 25 Jun, 2018 1 commit
  2. 27 Apr, 2018 1 commit
  3. 12 Jan, 2018 1 commit
  4. 09 Nov, 2017 1 commit
  5. 01 Nov, 2017 1 commit
    • Johannes Kloos's avatar
      Unfolding lemma for Fix in setoids. · 04b92602
      Johannes Kloos authored
      This generalizes Fix_unfold to a setoid setting. In particular,
      we can use this to unfold multi-argument fixpoints without
      requiring functional extensionality.
      04b92602
  6. 24 Sep, 2017 1 commit
  7. 15 Mar, 2017 1 commit
  8. 14 Mar, 2017 1 commit
  9. 31 Jan, 2017 3 commits
  10. 17 Nov, 2016 1 commit
  11. 16 Nov, 2016 1 commit
  12. 20 Feb, 2016 1 commit
  13. 17 Feb, 2016 1 commit
  14. 13 Feb, 2016 1 commit
  15. 16 Nov, 2015 1 commit
  16. 03 Feb, 2017 1 commit
  17. 22 Apr, 2015 1 commit
  18. 08 Feb, 2015 1 commit
  19. 10 Oct, 2014 1 commit
  20. 03 Oct, 2014 1 commit
  21. 06 Sep, 2014 2 commits
  22. 02 May, 2014 1 commit
  23. 17 Jun, 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. 09 Jan, 2013 1 commit
  26. 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
  27. 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
  28. 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
        inversions.
      * Add theory, definitions and notations on vectors.
      * Separate theory on contexts.
      * Change [Arguments] declarations to ensure better unfolding.
      e82cda6c
  29. 29 Aug, 2012 1 commit