2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.PL2020
Coinduction Plain and Simple
François Bry
Coinduction refers to both a technique for the definition of infinite streams, so-called codata, and a technique for proving the equality of coinductively specified codata. This ar…
cs.LO2018★ 2 cited
In Praise of Impredicativity: A Contribution to the Formalisation of Meta-Programming
François Bry
Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming…
cs.LO2002
An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning
François Bry
The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is v…