It is the same as arguing whether lambda calculus is better than pi-calculus or a Turing machine. These are all isomorphic structures. Neither of them can do m

It is the same as arguing whether lambda calculus is better than pi-calculus or a Turing machine. These are all isomorphic structures. Neither of them can do more than the other. For example - you’re speaking of dependencies, etc - but any language based on statements can be reduced to a dependency graph defined by it’s single-assignment form. Event sourcing is not a panacea.