- 24 May, 2014 1 commit
-
-
Robbert Krebbers authored
-
- 22 May, 2014 1 commit
-
-
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.
-
- 04 May, 2014 1 commit
-
-
Robbert Krebbers authored
-
- 02 May, 2014 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 09 Sep, 2013 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 27 Aug, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 21 Aug, 2013 4 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 15 Aug, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 14 Aug, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 12 Aug, 2013 1 commit
-
-
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.
-
- 24 Jun, 2013 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 17 Jun, 2013 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 21 May, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 15 May, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 12 May, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 11 May, 2013 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 07 May, 2013 1 commit
-
-
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.
-
- 02 Apr, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 25 Mar, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 14 Mar, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 24 Feb, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 22 Feb, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 19 Feb, 2013 1 commit
-
-
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.
-
- 01 Feb, 2013 1 commit
-
-
Robbert Krebbers authored
-
- 09 Jan, 2013 3 commits
-
-
Robbert Krebbers authored
Conflicts: ars.v assertions.v axiomatic.v base.v doc/index.html expressions.v fin_maps.v memory.v smallstep.v state.v statements.v tactics.v
-
Robbert Krebbers authored
-
Robbert Krebbers authored
The development now corresponds exactly to the FoSSaCS 2013 paper. Also, the prelude is updated to the one of the master branch.
-
- 05 Jan, 2013 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
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, ...
-
- 12 Nov, 2012 1 commit
-
-
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).
-