A new proof of the Mühlbach-Neville-Aitken algorithm for interpolation by a linear family of functions forming a Chebyshev system is given. This proof is based on Sylvester's identity for determinants. The algorithm is then applied to the general interpolation problem, and applications to orthogonal polynomials and Padé-type approximants are treated. Finally the extension to rational interpolation is also studied.