- 04 Jun, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 22 Apr, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 02 Mar, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 08 Feb, 2015 1 commit
-
-
Robbert Krebbers authored
-
- 02 May, 2014 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 15 May, 2013 1 commit
-
-
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.
-
- 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.
-