5 citations · 22 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Formalizing the Dependency Pair Criterion for Innermost Termination
Ariane Alves Almeida, Mauricio Ayala-Rincon
Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Funct…
cs.LO2019
On Nominal Syntax and Permutation Fixed Points
Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho
We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness rela…