 05 Jan, 2017 1 commit


Ralf Jung authored

 03 Jan, 2017 1 commit


Ralf Jung authored
This patch was created using find name *.v  xargs L 1 awk i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing

 09 Dec, 2016 1 commit


Ralf Jung authored

 16 Nov, 2016 1 commit


Robbert Krebbers authored

 07 Nov, 2016 1 commit


JacquesHenri Jourdan authored

 04 Oct, 2016 2 commits


Zhen Zhang authored

Zhen Zhang authored

 20 Sep, 2016 1 commit


Robbert Krebbers authored

 09 Sep, 2016 2 commits


Robbert Krebbers authored

JacquesHenri Jourdan authored

 22 Aug, 2016 1 commit


Robbert Krebbers authored
The previous commit is not really necesarry anymore, but my proof for UIP of types with decidable equality is a bit more general, so I won't revert it.

 04 Aug, 2016 2 commits


Robbert Krebbers authored
Also cleanup the file a bit.

Robbert Krebbers authored

 03 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 10 Mar, 2016 1 commit


Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 26 Feb, 2016 1 commit


Robbert Krebbers authored

 20 Feb, 2016 1 commit


Ralf Jung authored

 17 Feb, 2016 2 commits


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.

Robbert Krebbers authored

 13 Feb, 2016 1 commit


Robbert Krebbers authored
Also, make our redefinition of done more robust under different orders of Importing modules.

 11 Feb, 2016 3 commits


Robbert Krebbers authored
Also do some minor clean up.

Robbert Krebbers authored
This reverts commit 24fa20e5. Although these symmetric variants sometimes look "better", they are really annoying and should IMHO never be used: 1.) For lemmas there is now a choice between >= and <=. Since there is no longer a canonical choice, it is very easy to introduce a lot of inconsistencies in statements of lemmas. 2.) For automation the situation becomes annoying, you have to built in stuff for both >= and <=. That is very errorprone. 3.) For N and Z the notions x <= y and y >= x are not even convertible! That means that done/by does not solve x <= y if you have y >= x and if avoids you applying certain lemmas.

Ralf Jung authored

 12 Jan, 2016 1 commit


Robbert Krebbers authored

 11 Dec, 2015 1 commit


Robbert Krebbers authored

 08 Dec, 2015 1 commit


Robbert Krebbers authored

 16 Nov, 2015 1 commit


Robbert Krebbers authored

 11 Nov, 2015 1 commit


Robbert Krebbers authored
