Software Engineering, Programming Languages, Programming, Saga.
success However, in the presence of failure, our saga simply terminates without any attempt at correction. For example, if P fails after transaction b attempting to execute transaction c, the trace of P reveals the partial application: trace(P) = a • b • failure So far, our saga does not have