Intensional properties of polygraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Intensional properties of polygraphs


We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic interpretations, a termination proof method introduced by the second author, to characterize polygraphic programs that compute in polynomial time. We conclude with a characterization of polynomial time functions.
Fichier principal
Vignette du fichier
termgraph.pdf (279.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00129391 , version 1 (07-02-2007)
inria-00129391 , version 2 (02-03-2007)
inria-00129391 , version 3 (09-11-2007)



Guillaume Bonfante, Yves Guiraud. Intensional properties of polygraphs. 4th International Workshop on Computing with Terms and Graphs - TERMGRAPH 2007, Mar 2007, Braga, Portugal. ⟨10.1016/j.entcs.2008.03.034⟩. ⟨inria-00129391v3⟩
113 View
223 Download



Gmail Facebook Twitter LinkedIn More