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 and non-deterministic polynomial time functions.

[1]  Yves Guiraud,et al.  Polygraphs for termination of left-linear term rewriting systems , 2007, ArXiv.

[2]  Yves Lafont,et al.  Polygraphic resolutions and homology of monoids , 2009 .

[3]  Yves Lafont,et al.  Towards an algebraic theory of Boolean circuits , 2003 .

[4]  Albert Burroni,et al.  Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[5]  FRANÇOIS MÉTAYER,et al.  Resolutions by Polygraphs , 2003 .

[6]  Yves Lafont,et al.  Algebra and Geometry of Rewriting , 2007, Appl. Categorical Struct..

[7]  Guillaume Bonfante,et al.  Programs as polygraphs: computability and complexity , 2007, Logical Methods in Computer Science.

[8]  Fahd Ali Al-Agl,et al.  Theory and Applications of Categories , 1993 .

[9]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[10]  Detlef Plump,et al.  Term graph rewriting , 1999 .

[11]  Guillaume Bonfante,et al.  Algorithms with polynomial interpretation termination proof , 2001, Journal of Functional Programming.

[12]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[13]  Yuri Gurevich,et al.  Tailoring Recursion for Complexity , 1995, J. Symb. Log..

[14]  Gilles Dowek,et al.  Principles of programming languages , 1981, Prentice Hall International Series in Computer Science.

[15]  Pierre Lescanne,et al.  Polynomial Interpretations and the Complexity of Algorithms , 1992, CADE.

[16]  Yves Guiraud,et al.  Termination orders for 3-dimensional rewriting , 2006, ArXiv.

[17]  Yves Guiraud.  The three dimensions of proofs , 2006, Ann. Pure Appl. Log..

[18]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[19]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .