An algorithmic reconstruction of normalisation by evaluation

This article demonstrates how a naive applicative-order normaliser of untyped $\lambda$-calculus can be step-by-step transformed to efficient normalisation-by-evaluation normalisers based on some elementary observations and the algorithmic trick of lazy tagging, shedding some light on the connection between normalisation by evaluation and substitution-based normalisation.