We present naïve (Haskell) implementations of reduction to (weak-head) normal form in the λβ-calculus. As known, a λ-term M can be lifted to a supercombinator term L(M) and TRS TM such that left–outer (weak-)β-reduction from M to (wh)nf is isomorphic to supercombinator reduction in TM from L(M), and this yields an efficient implementation by term graph rewriting. We show this is naïvely achieved by supplying fresh variables to stuck terms, (λ-abstractions resp. supercombinators with too few arguments) and recast it as naïve term graph rewriting modulo the ж-calculus.