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 : 2007

Polygraphic programs and polynomial-time functions

Abstract

This study presents polygraphic programs as an algebraic and graphical description of first-order functional programs. We prove that they form a Turing-complete computational model. Using analysis tools called polygraphic interpretations, we delineate a subclass of these objects and study their computational properties: these polygraphic programs compute exactly polynomial-time functions.
Fichier principal
Vignette du fichier
poly06.pdf (294.9 Ko) Télécharger le fichier
Origin Files produced by the author(s)

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

  • HAL Id : inria-00122932 , version 1

Cite

Guillaume Bonfante, Yves Guiraud. Polygraphic programs and polynomial-time functions. Logical Methods in Computer Science, 2007, (under revision). ⟨inria-00122932v1⟩
191 View
346 Download

Share

Gmail Mastodon Facebook X LinkedIn More