7 citations · 11 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2007★ 7 cited
Intensional properties of polygraphs
Guillaume Bonfante, Yves Guiraud
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 p…
cs.LO2007★ 4 cited
Polygraphs for termination of left-linear term rewriting systems
Yves Guiraud
We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni's polygraphs, a kind of rewriting systems on algebraic circuit…