 09 Dec, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 22 Nov, 2016 1 commit


Ralf Jung authored
Use COFEs only for the recursive domain equation solver

 15 Nov, 2016 1 commit


Robbert Krebbers authored

 10 Oct, 2016 1 commit


Robbert Krebbers authored

 20 Sep, 2016 2 commits


Robbert Krebbers authored
This also solves a name clash with the extension order of CMRAs.

Robbert Krebbers authored

 25 Aug, 2016 1 commit


Janno authored

 22 Aug, 2016 1 commit


Robbert Krebbers authored
This is more consistent with CAS, which also can be used on any value. Note that being able to (atomically) test for equality of any value and being able to CAS on any value is not realistic. See the discussion at https://gitlab.mpisws.org/FP/iriscoq/issues/26, and in particular JH Jourdan's observation: I think indeed for heap_lang this is just too complicated. Anyway, the role of heap_lang is not to model any actual programming language, but rather to show that we can do proofs about certain programs. The fact that you can write unrealistic programs is not a problem, IMHO. The only thing which is important is that the program that we write are realistic (i.e., faithfully represents the algorithm we want to p This commit is based on a commit by Zhen Zhang who generalized equality to work on any literal (and not just integers).

 08 Aug, 2016 2 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored
This generalization is surprisingly easy in Iris 3.0, so I could not resist not doing it :).

 20 Jul, 2016 1 commit


JacquesHenri Jourdan authored
* Values are considered as atomic expressions (this does not hurt, and this makes the proofs of atomicity simpler).

 19 Jul, 2016 3 commits


Robbert Krebbers authored
I also reverted 7952bca4 since there is no need for atomic to be a boolean predicate anymore. Moreover, I introduced a hint database fsaV for solving sideconditions related to FSAs, in particular, sideconditions related to expressions being atomic.

Robbert Krebbers authored

Robbert Krebbers authored
We reify to a representation of expressions that includes an explicit constructor for closed terms. Substitution can then be implemented as the identify, which enables us to perform it using computation.

 18 Jul, 2016 1 commit


Robbert Krebbers authored

 15 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 27 Jun, 2016 1 commit


JacquesHenri Jourdan authored

 14 Jun, 2016 1 commit


Robbert Krebbers authored

 10 May, 2016 1 commit


Robbert Krebbers authored

 19 Apr, 2016 1 commit


Robbert Krebbers authored
This gets rid of the (ambiguous) notation %l, because we can declare LitLoc as a coercion. It also shortens the code.

 07 Apr, 2016 1 commit


Robbert Krebbers authored

 30 Mar, 2016 1 commit


Ralf Jung authored
and show that this is an instance of evaluation contexts

 29 Mar, 2016 3 commits


Robbert Krebbers authored

Ralf Jung authored
This required a new ectx axiom: Positivity of evaluation contexts. This axiom was also present in the old Iris 1.1 development, back when it still derived lifting axioms for ectx languages.

Ralf Jung authored

 15 Mar, 2016 2 commits
 12 Mar, 2016 1 commit


Ralf Jung authored

 10 Mar, 2016 1 commit


Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 07 Mar, 2016 1 commit


Ralf Jung authored

 05 Mar, 2016 4 commits


Robbert Krebbers authored

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

 04 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 03 Mar, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
