Polygraphic programs and polynomial-time functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2009

Polygraphic programs and polynomial-time functions

Abstract

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a Turing-complete computational model. Their algebraic structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turing-computable in polynomial time.
Fichier principal
Vignette du fichier
polypoly.pdf (626 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00122932 , version 1 (05-01-2007)
inria-00122932 , version 2 (13-11-2007)
inria-00122932 , version 3 (12-05-2009)

Identifiers

Cite

Guillaume Bonfante, Yves Guiraud. Polygraphic programs and polynomial-time functions. Logical Methods in Computer Science, 2009, 5 (2:14), pp.1-37. ⟨10.2168/LMCS-5(2:14)2009⟩. ⟨inria-00122932v3⟩
161 View
324 Download

Altmetric

Share

Gmail Facebook X LinkedIn More