proofs/containers/queue/trace.bend
bend-collections-laws-containers@1.0.0.0 · 103 lines · 0 definitions
1import Base
2import bend-collections-laws-containers@1.0.0.0/proofs/lib/logic.bend as L
3import bend-collections-laws-containers@1.0.0.0/proofs/lib/list.bend as LL
4import bend-collections-laws-containers@1.0.0.0/spec/containers/queue.bend as S
5import bend-collections-laws-containers@1.0.0.0/src/containers/queue.bend as DQ
6import bend-collections-laws-containers@1.0.0.0/src/containers/types/queue.bend as E
7import bend-collections-laws-containers@1.0.0.0/proofs/containers/queue/state.bend as ST
8import bend-collections-laws-containers@1.0.0.0/proofs/containers/queue/steps.bend as PS
9
10# Arbitrary finite operation traces: the real runner refines the spec
11# runner. Running any list of operations on the queue of a shadow lands on
12# the queue of another shadow, emits exactly the spec runner's observations,
13# and the final shadow's model is the spec runner's final state. There is no
14# size or length premise.
15
16# ---- projections of a step ----
17
18def so_sh(~T: Data, -sh: ST.Shadow<T>, -op: E.Op<T>, so: PS.StepOK(~T, sh, op)) -> ST.Shadow<T>:
19 match so:
20 case Tuple{sh2, r}:
21 sh2
22
23def so_obs(~T: Data, -sh: ST.Shadow<T>, -op: E.Op<T>, so: PS.StepOK(~T, sh, op)) -> E.Obs<T>:
24 match so:
25 case Tuple{sh2, Tuple{o, r}}:
26 o
27
28def so_step(~T: Data, -sh: ST.Shadow<T>, -op: E.Op<T>, so: PS.StepOK(~T, sh, op)) -> {DQ.step(~T, ST.real(T, sh), op) == (ST.real(T, so_sh(~T, sh, op, so)), so_obs(~T, sh, op, so)) : DQ.Queue<T> & E.Obs<T>}:
29 match so:
30 case Tuple{sh2, Tuple{o, Tuple{e, s}}}:
31 e
32
33def so_spec(~T: Data, -sh: ST.Shadow<T>, -op: E.Op<T>, so: PS.StepOK(~T, sh, op)) -> {(ST.model(T, so_sh(~T, sh, op, so)), so_obs(~T, sh, op, so)) == S.step(T, ST.model(T, sh), op) : List<&2, T> & E.Obs<T>}:
34 match so:
35 case Tuple{sh2, Tuple{o, Tuple{e, s}}}:
36 s
37
38# ---- the run ----
39
40def srun_obs(-T: Data, ops: List<&2, E.Op<T>>, m: List<&2, T>) -> List<&2, E.Obs<T>>:
41 Pair.snd(List<&2, T>, List<&2, E.Obs<T>>, S.run(T, ops, m))
42
43def srun_state(-T: Data, ops: List<&2, E.Op<T>>, m: List<&2, T>) -> List<&2, T>:
44 Pair.fst(List<&2, T>, List<&2, E.Obs<T>>, S.run(T, ops, m))
45
46def spec_run_cons(-T: Data, +op: E.Op<T>, +rest: List<&2, E.Op<T>>, +m: List<&2, T>, +m1: List<&2, T>, +o: E.Obs<T>, +e: {(m1, o) == S.step(T, m, op) : List<&2, T> & E.Obs<T>}) -> {S.run(T, Con{op, rest}, m) == (srun_state(T, rest, m1), Con{o, srun_obs(T, rest, m1)}) : List<&2, T> & List<&2, E.Obs<T>>}:
47 %e : {S.cons_obs(T, Pair.snd(List<&2, T>, E.Obs<T>, _), S.run(T, rest, Pair.fst(List<&2, T>, E.Obs<T>, _))) == (srun_state(T, rest, m1), Con{o, srun_obs(T, rest, m1)}) : List<&2, T> & List<&2, E.Obs<T>>}
48 %Equal.sym(List<&2, T> & List<&2, E.Obs<T>>, S.run(T, rest, m1), (srun_state(T, rest, m1), srun_obs(T, rest, m1)), L.pair_eta(List<&2, T>, List<&2, E.Obs<T>>, S.run(T, rest, m1))) : {S.cons_obs(T, o, _) == (srun_state(T, rest, m1), Con{o, srun_obs(T, rest, m1)}) : List<&2, T> & List<&2, E.Obs<T>>}
49 {==}
50
51def RunOK(~T: Data, ops: List<&2, E.Op<T>>, sh: ST.Shadow<T>, acc: List<&2, E.Obs<T>>) -> Type:
52 Sigma<&1, &1, ST.Shadow<T>, sh2 => {DQ.run_acc(~T, ops, (ST.real(T, sh), acc)) == (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, srun_obs(T, ops, ST.model(T, sh)), acc)) : DQ.Queue<T> & List<&2, E.Obs<T>>} & {ST.model(T, sh2) == srun_state(T, ops, ST.model(T, sh)) : List<&2, T>}>
53
54def ro_sh(~T: Data, -ops: List<&2, E.Op<T>>, -sh: ST.Shadow<T>, -acc: List<&2, E.Obs<T>>, r: RunOK(~T, ops, sh, acc)) -> ST.Shadow<T>:
55 match r:
56 case Tuple{sh2, x}:
57 sh2
58
59def ro_run(~T: Data, -ops: List<&2, E.Op<T>>, -sh: ST.Shadow<T>, -acc: List<&2, E.Obs<T>>, r: RunOK(~T, ops, sh, acc)) -> {DQ.run_acc(~T, ops, (ST.real(T, sh), acc)) == (ST.real(T, ro_sh(~T, ops, sh, acc, r)), List.reverse.go(&2, E.Obs<T>, srun_obs(T, ops, ST.model(T, sh)), acc)) : DQ.Queue<T> & List<&2, E.Obs<T>>}:
60 match r:
61 case Tuple{sh2, Tuple{e, m}}:
62 e
63
64def ro_model(~T: Data, -ops: List<&2, E.Op<T>>, -sh: ST.Shadow<T>, -acc: List<&2, E.Obs<T>>, r: RunOK(~T, ops, sh, acc)) -> {ST.model(T, ro_sh(~T, ops, sh, acc, r)) == srun_state(T, ops, ST.model(T, sh)) : List<&2, T>}:
65 match r:
66 case Tuple{sh2, Tuple{e, m}}:
67 m
68
69def run_ok(~T: Data, +ops: List<&2, E.Op<T>>, +sh: ST.Shadow<T>, +acc: List<&2, E.Obs<T>>) -> RunOK(~T, ops, sh, acc):
70 match ops:
71 case Nil{}:
72 (sh, ({==}, {==}))
73 case Con{+op, +rest}:
74 +m = ST.model(T, sh)
75 +sh1 = so_sh(~T, sh, op, PS.step_ok(~T, sh, op))
76 +o = so_obs(~T, sh, op, PS.step_ok(~T, sh, op))
77 +m1 = ST.model(T, sh1)
78 +acc1 = {Con{o, acc} : List<&2, E.Obs<T>>}
79 +sh2 = ro_sh(~T, rest, sh1, acc1, run_ok(~T, rest, sh1, acc1))
80 +es = spec_run_cons(T, op, rest, m, m1, o, so_spec(~T, sh, op, PS.step_ok(~T, sh, op)))
81 -R = S.run(T, rest, m1)
82 (sh2, (
83 %Equal.sym(DQ.Queue<T> & E.Obs<T>, DQ.step(~T, ST.real(T, sh), op), (ST.real(T, sh1), o), so_step(~T, sh, op, PS.step_ok(~T, sh, op))) : {DQ.run_acc(~T, rest, DQ.record(~T, acc, _)) == (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, srun_obs(T, Con{op, rest}, m), acc)) : DQ.Queue<T> & List<&2, E.Obs<T>>}
84 %Equal.sym(DQ.Queue<T> & List<&2, E.Obs<T>>, DQ.run_acc(~T, rest, (ST.real(T, sh1), acc1)), (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, srun_obs(T, rest, m1), acc1)), ro_run(~T, rest, sh1, acc1, run_ok(~T, rest, sh1, acc1))) : {_ == (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, srun_obs(T, Con{op, rest}, m), acc)) : DQ.Queue<T> & List<&2, E.Obs<T>>}
85 %Equal.sym(List<&2, T> & List<&2, E.Obs<T>>, S.run(T, Con{op, rest}, m), (Pair.fst(List<&2, T>, List<&2, E.Obs<T>>, R), Con{o, Pair.snd(List<&2, T>, List<&2, E.Obs<T>>, R)}), es) : {(ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, srun_obs(T, rest, m1), acc1)) == (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, Pair.snd(List<&2, T>, List<&2, E.Obs<T>>, _), acc)) : DQ.Queue<T> & List<&2, E.Obs<T>>}
86 {==},
87 %Equal.sym(List<&2, T> & List<&2, E.Obs<T>>, S.run(T, Con{op, rest}, m), (Pair.fst(List<&2, T>, List<&2, E.Obs<T>>, R), Con{o, Pair.snd(List<&2, T>, List<&2, E.Obs<T>>, R)}), es) : {ST.model(T, sh2) == Pair.fst(List<&2, T>, List<&2, E.Obs<T>>, _) : List<&2, T>}
88 ro_model(~T, rest, sh1, acc1, run_ok(~T, rest, sh1, acc1))))
89
90def run_from(~T: Data, +ops: List<&2, E.Op<T>>, +sh0: ST.Shadow<T>) -> {DQ.run(~T, ops, ST.real(T, sh0)) == (ST.real(T, ro_sh(~T, ops, sh0, Nil{}, run_ok(~T, ops, sh0, Nil{}))), srun_obs(T, ops, ST.model(T, sh0))) : DQ.Queue<T> & List<&2, E.Obs<T>>}:
91 +sh2 = ro_sh(~T, ops, sh0, Nil{}, run_ok(~T, ops, sh0, Nil{}))
92 +os = srun_obs(T, ops, ST.model(T, sh0))
93 %Equal.sym(DQ.Queue<T> & List<&2, E.Obs<T>>, DQ.run_acc(~T, ops, (ST.real(T, sh0), Nil{})), (ST.real(T, sh2), List.reverse.go(&2, E.Obs<T>, os, Nil{})), ro_run(~T, ops, sh0, Nil{}, run_ok(~T, ops, sh0, Nil{}))) : {DQ.finish(~T, _) == (ST.real(T, sh2), os) : DQ.Queue<T> & List<&2, E.Obs<T>>}
94 %Equal.sym(List<&2, E.Obs<T>>, List.reverse(&2, E.Obs<T>, List.reverse.go(&2, E.Obs<T>, os, Nil{})), os, LL.rev_rev(E.Obs<T>, os)) : {(ST.real(T, sh2), _) == (ST.real(T, sh2), os) : DQ.Queue<T> & List<&2, E.Obs<T>>}
95 {==}
96
97def TraceOK(~T: Data, ops: List<&2, E.Op<T>>, sh0: ST.Shadow<T>) -> Type:
98 Sigma<&1, &1, ST.Shadow<T>, sh2 => {DQ.run(~T, ops, ST.real(T, sh0)) == (ST.real(T, sh2), srun_obs(T, ops, ST.model(T, sh0))) : DQ.Queue<T> & List<&2, E.Obs<T>>} & {ST.model(T, sh2) == srun_state(T, ops, ST.model(T, sh0)) : List<&2, T>}>
99
100def trace_from(~T: Data, +ops: List<&2, E.Op<T>>, +sh0: ST.Shadow<T>) -> TraceOK(~T, ops, sh0):
101 (ro_sh(~T, ops, sh0, Nil{}, run_ok(~T, ops, sh0, Nil{})),
102 (run_from(~T, ops, sh0),
103 ro_model(~T, ops, sh0, Nil{}, run_ok(~T, ops, sh0, Nil{}))))