This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that are encountered in Feynman diagram calculations. Together with results for the values of the higher harmonic series at infinity the presented algorithms can be used for the symbolic evaluation of whole classes of integrals that were thus far intractable. Also many of the sums that had to be evaluated seem to involve new results. Most of the algorithms have been programmed in the language of FORM. The resulting set of procedures is called SUMMER.