- Apr 14, 2020
-
-
Ralf Jung authored
-
- Mar 16, 2020
-
-
- remove "odd" comment - move atomic triples to bi_scope
-
- Feb 28, 2020
-
-
Ralf Jung authored
-
- Feb 23, 2020
-
-
-
Tej Chajed authored
-
- Feb 18, 2020
-
-
Robbert Krebbers authored
-
Ralf Jung authored
-
- Dec 06, 2019
-
-
Ralf Jung authored
-
- Aug 13, 2019
-
-
Ralf Jung authored
-
- Aug 07, 2019
-
-
Ralf Jung authored
-
- Jun 29, 2019
-
-
Ralf Jung authored
This also gets rid of [val_for_compare]-normalization; instead we introduce a [LitErased] literal that is suited for use by erasure theorems.
-
- Jun 24, 2019
- May 31, 2019
-
-
Amin Timany authored
-
- Apr 07, 2019
-
-
Robbert Krebbers authored
-
- Mar 05, 2019
-
-
Ralf Jung authored
-
- Feb 05, 2019
-
-
Pierre-Marie Pédrot authored
This is a change enabling backward compatibility.
-
- Nov 27, 2018
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
This closes issue #220.
-
- Oct 31, 2018
-
-
Jacques-Henri Jourdan authored
-
- Oct 29, 2018
-
-
Jacques-Henri Jourdan authored
-
Jacques-Henri Jourdan authored
We add a specific constructor to the type of expressions for injecting values in expressions. The advantage are : - Values can be assumed to be always closed when performing substitutions (even though they could contain free variables, but it turns out it does not cause any problem in the proofs in practice). This means that we no longer need the `Closed` typeclass and everything that comes with it (all the reflection-based machinery contained in tactics.v is no longer necessary). I have not measured anything, but I guess this would have a significant performance impact. - There is only one constructor for values. As a result, the AsVal and IntoVal typeclasses are no longer necessary: an expression which is a value will always unify with `Val _`, and therefore lemmas can be stated using this constructor. Of course, this means that there are two ways of writing such a thing as "The pair of integers 1 and 2": Either by using the value constructor applied to the pair represented as a value, or by using the expression pair constructor. So we add reduction rules that transform reduced pair, injection and closure expressions into values. At first, this seems weird, because of the redundancy. But in fact, this has some meaning, since the machine migth actually be doing something to e.g., allocate the pair or the closure. These additional steps of computation show up in the proofs, and some additional wp_* tactics need to be called.
-
- Oct 04, 2018
-
-
Jacques-Henri Jourdan authored
-
- Oct 03, 2018
-
-
Robbert Krebbers authored
-
- Jul 04, 2018
- Jul 02, 2018
-
-
Ralf Jung authored
-
- Jun 30, 2018
-
-
Ralf Jung authored
-
- Jun 29, 2018
- Jun 14, 2018
- Jun 13, 2018
-
-
Ralf Jung authored
-
- Jun 06, 2018
- May 17, 2018
-
-
Ralf Jung authored
move test suite out of theories/ so it does not get installed; also check output of test suite so that we can test printing
-
- Apr 27, 2018
-
-
Robbert Krebbers authored
-
- Apr 23, 2018