Generalised polylogarithms naturally appear in higher-order calculations of quantum field theories. We present handyG, a Fortran 90 library for the evaluation of such functions, by implementing the algorithm proposed by Vollinga and Weinzierl. This allows fast numerical evaluation of generalised polylogarithms with currently relevant weights, suitable for Monte Carlo integration.
Program summary:
Program Title: handyG
Program Files doi: http://dx.doi.org/10.17632/3257y97pj7.1
Licensing provisions: GPLv3
Programming language: Fortran 90
Nature of problem: Numerical evaluation routine for generalised (or Goncharov [1]) polylogarithms that is fast enough for Monte Carlo integration.
Solution method: Implementing the algorithm presented by Vollinga and Weinzierl [2] in Fortran 90, providing a Fortran module and a Mathematica interface.
Restrictions: There are no theoretical limitations of the weight through the algorithm. However, for arbitrary parameters there are limits through runtime for increasing weight.

References
[1] A.B. Goncharov, Multiple polylogarithms, cyclotomy and modular complexes, Math. Res. Lett 5 (1998) 497 [1105.2076].
[2] J. Vollinga and S. Weinzierl, Numerical evaluation of multiple polylogarithms, Comput. Phys. Commun. 167 (2005) 177 [hep-ph/0410259].