65 citations · 211 across the 36 of their papers we have counts for
Showing 2015 · cs.LOShow all
2 papers · 2 filters
cs.LO2015★ 13 cited
Termination of rewrite relations on -terms based on Girard's notion of reducibility
Frédéric Blanqui
In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of -reduction in the polymorphic -calculus, to prove the term…
cs.LO2015★ 12 cited
The computability path ordering
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability pa…