Complexity certification of C++ templates
Emanuele Covino, Giovanni Pani · CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro) · 2008
Any partial recursive function can be computed at compile time, using C++ templates to define primitive recursion, composition, and minimalization. We define a sub-language based on C++ templates, which characterizes the set of functions computable by a Turing machine with time bounded by a polinomial. This language can be used as a form of complexity certification of programs.