Software Engineering, Programming Languages, Programming, Saga.
Figure 2. shows the interference rules for the basic version of SagaLang, three rules are sufficient to specify its execution. Figure 2. Interference rules for Basic SagaLang ① For a non-empty saga ⟨s; S⟩, if the transaction s executes successfully, we proceed with the continuation ⟨S⟩. ② For an