10 citations · 45 across the 26 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2015★ 1 cited
Proof Relevant Corecursive Resolution
Peng Fu, Ekaterina Komendantskaya, Tom Schrijvers +1
Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined induct…
cs.LO2015★ 3 cited
Reasoning about modular datatypes with Mendler induction
Paolo Torrini, Tom Schrijvers
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is hi…