The only operation in lambda calculus, which evaluates by substituting arguments into the function body
β reduction occurs through a single rule where λ[x, body][y] → body with x replaced by y. Through repeated application, complex patterns, growth, repetition, and infinite calculations emerge. Multiple β reduction paths can be analyzed as a multiway graph, and dependencies between events can be visualized as a causal graph to represent 'parallel computation' and causal structures.

Seonglae Cho