Intensional Properties of Polygraphs

DOI10.1016/J.ENTCS.2008.03.034zbMath1279.68076arXivcs/0703007OpenAlexW2004534023MaRDI QIDQ2870314

Guillaume Bonfante, Yves Guiraud

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0703007

zbMATH Keywords

complexityterminationpolygraphpolygraphic interpretationpolygraphic program

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Intensional Properties of Polygraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional word problems with applications to equational logic
• Towards an algebraic theory of Boolean circuits.
• The three dimensions of proofs
• Termination orders for three-dimensional rewriting
• Algorithms with polynomial interpretation termination proof
• Intensional Properties of Polygraphs
• Tailoring recursion for complexity
• Essentials of Term Graph Rewriting

This page was built for publication: Intensional Properties of Polygraphs