Weakest preconditions are invariant under weak bisimulation #
The total and partial readings of PolyFun.ITree.WP.Basic read a silent step as its continuation,
so they cannot tell trees apart by their silent steps. They are invariant under finite stripping
of silent steps (ITree.TauSteps.wpTotal_eq) and under weak bisimulation. The relational form
compares trees with different return types: t ≈[RR] s and postconditions related along RR
give wp t post ≤ wp s post' (ITree.WeakBisimRel.wpTotal_le, ITree.WeakBisimRel.wpPartial_le).
Silent divergence is respected: a tree weakly bisimilar to ITree.diverge is ITree.diverge
(ITree.TauSteps.diverge_target_eq), so it keeps its readings ⊥ and ⊤.
Main results #
Total correctness transfers along a relational weak bisimulation whose related return values have related postconditions.
Partial correctness transfers along a relational weak bisimulation whose related return values have related postconditions.