- Aug 24, 2020
-
-
Ralf Jung authored
-
- Aug 12, 2020
-
-
Ralf Jung authored
-
- Jul 24, 2020
-
-
Ralf Jung authored
-
- Jul 21, 2020
-
-
When running `iDestruct "H" as (?) "H"`, use the name of the binder in "H". For example, if "H" has type `∃ y, Φ y`, we now use `y` as the name of the variable after freshening. Previously the name was always the equivalent of running `fresh H`. The implementation achieves this by forwarding the desired identifier name through the `IntoExist` typeclass. Identifiers are serialized in Gallina by using them as the name of a function of type `ident_name := unit -> unit`.
-
- Jul 14, 2020
-
-
Ralf Jung authored
-
- Jun 16, 2020
-
-
Simon Friis Vindum authored
-
- May 25, 2020
- May 24, 2020
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- May 23, 2020
-
-
Robbert Krebbers authored
-
- May 18, 2020
-
-
Ralf Jung authored
-
- Apr 07, 2020
-
-
Ralf Jung authored
-
Ralf Jung authored
-
Ralf Jung authored
-
Gregory Malecha authored
- all ascii notation is marked "only parsing" so this PR shouldn't change anything for anyone using only unicode notation. - the algorithm for creating an ascii notation is pretty simple. - \ast -> * - \triangleright -> |> - \vee -> \/ - \wedge -> /\ - \forall -> forall - \exists -> exists - \ast -> **
-
- Apr 01, 2020
-
-
Robbert Krebbers authored
-
- Feb 25, 2020
-
-
Ralf Jung authored
-
Add array_copy_to (copy in-place to destination array) and array_clone (copy to a freshly allocated array). The heap_lang spec and proof for array_copy_to are inspired by https://gitlab.mpi-sws.org/iris/lambda-rust/blob/3b4ae69fa3be1344245245bf05e5e80e790e064d/theories/lang/lib/memcpy.v. Fixes #293.
-
- Feb 14, 2020
-
-
- Jan 13, 2020
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Nov 21, 2019
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Amin Timany authored
-
- Aug 12, 2019
-
-
- Aug 07, 2019
-
-
Ralf Jung authored
-
- Jun 24, 2019
- Jun 20, 2019
-
-
Amin Timany authored
-
- Jun 13, 2019
-
-
- Jun 11, 2019
-
-
Robbert Krebbers authored
The unbounded fractional authoritative camera is a version of the fractional authoritative camera that can be used with fractions `> 1`. Most of the reasoning principles for this version of the fractional authoritative cameras are the same as for the original version. There are two difference: - We get the additional rule that can be used to allocate a "surplus", i.e. if we have the authoritative element we can always increase its fraction and allocate a new fragment. ✓ (a ⋅ b) → ●U{p} a ~~> ●U{p + q} (a ⋅ b) ⋅ ◯U{q} b - At the cost of that, we no longer have the `◯U{1} a` is an exclusive fragmental element (cf. `frac_auth_frag_validN_op_1_l`).
-
- Jun 10, 2019
-
-
Ralf Jung authored
-
Robbert Krebbers authored
-
- May 31, 2019
-
-
Amin Timany authored
-
- May 25, 2019
-
-
Ralf Jung authored
-
- May 08, 2019
-
-
Tej Chajed authored
-
- Mar 20, 2019
-
- Mar 19, 2019
-
-
Rodolphe Lepigre authored
-
- Feb 01, 2019
-
-
Robbert Krebbers authored
-