Interpretation into interaction trees #
When the target monad is an interaction tree, interp is simulate by definition, so the strong
computation equations and the weak-bisimulation laws of simulation transfer verbatim: the
computation rules hold as equalities, interpretation respects weak bisimulation of the source,
and interpreting through the identity handler or through a composite handler behaves as expected.
The generic laws of PolyFun.ITree.Interp.Laws give the same facts up to the target's
equivalence, which for an interaction tree is weak bisimulation; these are the sharper forms.
Interpretation respects weak bisimulation of the source tree.
Interpreting through the identity handler changes nothing up to weak bisimulation.
Interpreting twice is interpreting through the composite handler.
Interpretation into a tree distributes over sequencing up to weak bisimulation.