typeswitch on Nostr: lambda calculus is easy if you ignore substitution and evaluation strategies and . . ...
lambda calculus is easy if you ignore substitution and evaluation strategies and . . .
that said, it's referentially transparent which is nice. maybe that's what they mean by "easier to reason about", relative to some other models of computation.