- Nov 28, 2016
-
-
Robbert Krebbers authored
-
Ralf Jung authored
Proof was done by Hai & me
-
- Nov 27, 2016
-
-
Robbert Krebbers authored
This fixes issue #44.
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Nov 26, 2016
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Nov 25, 2016
-
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Jacques-Henri Jourdan authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
No longer `put box_own_prop γ P` in the invariant, it is persistent.
-
Jacques-Henri Jourdan authored
-
- Nov 24, 2016
-
-
Jacques-Henri Jourdan authored
-
-
Jacques-Henri Jourdan authored
-
-
Ralf Jung authored
-
Jacques-Henri Jourdan authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Jacques-Henri Jourdan authored
The idea on magic wand is to use it for curried lemmas and use ⊢ for uncurried lemmas.
-
Robbert Krebbers authored
ProofMode intro patterns: accept _ as part of variable names @robbertkrebbers beat this. ;) See merge request !29
-
Ralf Jung authored
-
- Nov 23, 2016
-
-
Ralf Jung authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Robbert Krebbers authored
-
Ralf Jung authored
Use notation N @⊆ E to avoid ambiguity. Since `nclose : namespace → coPset` is declared as a coercion, the notation `nclose N ⊆ E` was pretty printed as `N ⊆ E`. However, `N ⊆ E` could not be typechecked because type checking goes from left to right, and as such would look for an instance `SubsetEq namespace`, which causes the right hand side to be ill-typed. See merge request !24
-