Cancelable and IdFree typeclasses.
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.
Showing
- theories/algebra/agree.v 26 additions, 5 deletionstheories/algebra/agree.v
- theories/algebra/cmra.v 109 additions, 6 deletionstheories/algebra/cmra.v
- theories/algebra/csum.v 31 additions, 3 deletionstheories/algebra/csum.v
- theories/algebra/frac.v 9 additions, 1 deletiontheories/algebra/frac.v
- theories/algebra/gmap.v 36 additions, 2 deletionstheories/algebra/gmap.v
- theories/algebra/local_updates.v 13 additions, 0 deletionstheories/algebra/local_updates.v
Loading
Please register or sign in to comment