Software Engineering, Programming Languages, Programming, Saga.
empty saga ε, without any condition, we proceed to complete the saga as a success. ③ For a non-empty saga ⟨s; S⟩, if the transaction s fails, we proceed to complete the saga as a failure. In the absence of a failure, our saga executes trivially exactly once and to completion: trace(P) = a • b • c •