11 citations · 57 across the 11 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2016★ 4 cited
A Productivity Checker for Logic Programming
E. Komendantskaya, P. Johann, M. Schmidt
Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete lan…
cs.PL2012★ 10 cited
Generic Fibrational Induction
Neil Ghani, Patricia Johann, Clement Fumex
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res…