12 citations · 17 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015
Formalizing Termination Proofs under Polynomial Quasi-interpretations
Naohi Eguchi
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tre…
cs.CC2015★ 1 cited
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
Naohi Eguchi
The general form of safe recursion (or ramified recurrence) can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Mar…