Intensional Properties of Polygraphs

Authors:
Guillaume Bonfante;Yves Guiraud
Affiliations:
INRIA-LORIA, 615 rue du Jardin Botanique -- BP 101, Villers-lès-Nancy 54602 -- FRANCE;INRIA-LORIA, 615 rue du Jardin Botanique -- BP 101, Villers-lès-Nancy 54602 -- FRANCE
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 6
Cited 0

Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-dimensional word problems with applications to equational logic

Selected papers of the 4th summer conference on Category theory and computer science
Term graph rewriting

Handbook of graph grammars and computing by graph transformation
Polynomial Interpretations and the Complexity of Algorithms

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Algorithms with polynomial interpretation termination proof

Journal of Functional Programming
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.