 14 Feb, 2020 1 commit


Jonas Kastberg authored

 13 Jan, 2020 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 21 Nov, 2019 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Amin Timany authored

 12 Aug, 2019 1 commit


Rodolphe Lepigre authored

 07 Aug, 2019 1 commit


Ralf Jung authored

 24 Jun, 2019 2 commits
 20 Jun, 2019 1 commit


Amin Timany authored

 13 Jun, 2019 1 commit


Amin Timany authored

 11 Jun, 2019 1 commit


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`).

 10 Jun, 2019 2 commits


Ralf Jung authored

Robbert Krebbers authored

 31 May, 2019 1 commit


Amin Timany authored

 25 May, 2019 1 commit


Ralf Jung authored

 08 May, 2019 1 commit


Tej Chajed authored

 20 Mar, 2019 1 commit


Janno authored

 19 Mar, 2019 1 commit


Rodolphe Lepigre authored

 01 Feb, 2019 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 21 Dec, 2018 1 commit


Robbert Krebbers authored

 29 Oct, 2018 1 commit


JacquesHenri 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 reflectionbased 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.

 05 Oct, 2018 6 commits


Ralf Jung authored
Snapshot will reappear in irisexamples eventually

Marianna Rapoport authored

Marianna Rapoport authored
 Removing admitted prophecy spec and making prophecyrelated examples (coinflip and atomicpairsnapshot) work with the new prophecy support in heap_lang  Adjusting heap_lang tactics for automation of substitution, closedness, etc. to support prophecy syntax  Adding notation for prophecy syntax

Marianna Rapoport authored

Marianna Rapoport authored
 Removing head of list of observations after each reduction step in definition of wp  Adding support for observations to state_interp and world  Applying Ralf's suggestions to previous commit (e.g. replacing /\ and > with unicode characters)

Marianna Rapoport authored

 02 Jul, 2018 1 commit


Ralf Jung authored

 15 Jun, 2018 2 commits


Ralf Jung authored
* move PROPenvs definitions to environments.v so that we can control them without pulling in coq_tactics * use reductioncontrolled `pm_default` for proofmode accessors

Robbert Krebbers authored

 05 Jun, 2018 4 commits
 04 Jun, 2018 1 commit


Ralf Jung authored
New atomic updates: defined as a fixed point with existential quantifier; intro lemma using class of Laterable assertions

 17 May, 2018 1 commit


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

 23 Apr, 2018 1 commit


Ralf Jung authored
