In this paper we investigate the relationship between template metaprogramming and implicit complexity, defining a recursive metalanguage by means of C++ templates; we show that the language captures the set of polynomial-time computable functions, that is, functions computable by a Turing machine in which the number of moves - the time complexity - is bounded by a polynomial. We also show that our approach can be extended to recursion schemes that are more general than those used in ICC; this implies that we are able to capture more natural algorithms.

C++ Template Metaprogramming and Polynomial-Time Functions

Emanuele Covino;Giovanni Pani
In corso di stampa

Abstract

In this paper we investigate the relationship between template metaprogramming and implicit complexity, defining a recursive metalanguage by means of C++ templates; we show that the language captures the set of polynomial-time computable functions, that is, functions computable by a Turing machine in which the number of moves - the time complexity - is bounded by a polynomial. We also show that our approach can be extended to recursion schemes that are more general than those used in ICC; this implies that we are able to capture more natural algorithms.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11586/237052
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact