3 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.LO2022
Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version)
Pablo Barenbaum, Teodoro Freund
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical pro…
cs.PL2021★ 3 cited
Union and intersection contracts are hard, actually
Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack
Union and intersection types are a staple of gradually typed language such as TypeScript. While it's long been recognized that union and intersection types are difficult to verify…
cs.LO2021
A Constructive Logic with Classical Proofs and Refutations (Extended Version)
Pablo Barenbaum, Teodoro Freund
We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or…