proving redundancy of "plain" writes
Closed this issue · 5 comments
opqrs commented
Low priority:
Conjecture: it is possible to remove "plain" writes, keeping only promises and fulfilment.
Corollary: in "batch" mode, it is possible to enumerate fewer things.
jeehoonkang commented
If I understand correctly, we have four models:
- axiomatic: the golden standard
- global consistency: simplist model
- local consistency w/o writes: for exhaustive enumeration of possible behaviors
- local consistency: for interactive exploration of possible behaviors
opqrs commented
In fact, I'm not sure we need "plain" writes as first-class citizens: we can define them as a macro for promising and immediately fulfilling.
@cp526 ?
jeehoonkang commented
@opqrs I agree with you.
jeehoonkang commented
opqrs commented
It means that we will have to allow promises in certification.
Example by Jeehoon: promising W y 1 based on the 'else' branch, and certifying using the 'then' branch:
if ...
x = 1
y = 1
else
y = 1