- 03 Jun, 2019 1 commit
-
-
Robbert Krebbers authored
This allows one to make use of recursive ghost state obtained from the recursive domain equation solver.
-
- 23 May, 2019 1 commit
-
-
Hai Dang authored
-
- 21 May, 2019 1 commit
-
-
Robbert Krebbers authored
-
- 05 Mar, 2019 1 commit
-
-
Ralf Jung authored
-
- 24 Jan, 2019 1 commit
-
-
Maxime Dénès authored
This is in preparation for coq/coq#9274.
-
- 10 Dec, 2018 4 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 03 Dec, 2018 1 commit
-
-
Robbert Krebbers authored
-
- 27 Nov, 2017 3 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 25 Oct, 2017 4 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
Rename `UCMRA` → `Ucmra` Rename `CMRA` → `Cmra` Rename `OFE` → `Ofe` (`Ofe` was already used partially, but many occurences were missing) Rename `STS` → `Sts` Rename `DRA` → `Dra`
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 13 Apr, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 12 Apr, 2017 1 commit
-
-
Ralf Jung authored
-
- 07 Apr, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 20 Mar, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 09 Feb, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 01 Feb, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
Cancelable elements are a new way of proving local updates, by removing some cancellable element of the global state, provided that we own it and we are willing to lose this ownership. Identity-free elements are an auxiliary that is necessary to prove that [Some x] is cancelable. For technical reasons, these two notions are not defined exactly like what one might expect, but also take into account validity. Otherwise, an exclusive element would not be cancelable or idfree, which is rather confusing.
-
- 30 Jan, 2017 1 commit
-
-
Robbert Krebbers authored
-
- 27 Jan, 2017 1 commit
-
-
Ralf Jung authored
-
- 25 Jan, 2017 1 commit
-
-
Ralf Jung authored
Also add "Local" to some Default Proof Using to keep them more contained
-
- 05 Jan, 2017 2 commits
- 04 Jan, 2017 1 commit
-
-
Jacques-Henri Jourdan authored
-
- 03 Jan, 2017 1 commit
-
-
Ralf Jung authored
This patch was created using find -name *.v | xargs -L 1 awk -i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing
-
- 13 Dec, 2016 1 commit
-
-
Ralf Jung authored
-
- 09 Dec, 2016 1 commit
-
-
Ralf Jung authored
-
- 25 Nov, 2016 1 commit
-
-
Ralf Jung authored
-
- 22 Nov, 2016 1 commit
-
-
Ralf Jung authored
Use COFEs only for the recursive domain equation solver
-
- 25 Oct, 2016 1 commit
-
-
Robbert Krebbers authored
-
- 14 Aug, 2016 1 commit
-
-
Robbert Krebbers authored
This is more consistent with the definition of the extension order, which is also defined in terms of an existential.
-
- 21 Jul, 2016 1 commit
-
-
Robbert Krebbers authored
Also, remove some unused lemmas about agree.
-
- 01 Jul, 2016 1 commit
-
-
Robbert Krebbers authored
This may save the need to seal off some stuff.
-
- 31 May, 2016 1 commit
-
-
Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →.
-
- 28 May, 2016 1 commit
-
-
Robbert Krebbers authored
Based on an idea and WIP commits of J-H. Jourdan: the core of a CMRA A is now a partial function A → option A. TODO: define sum CMRA TODO: remove one shot CMRA and define it in terms of sum
-