2 citations · 6 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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.SC2022
Reductions in Higher-Order Rewriting and Their Equivalence
Pablo Barenbaum, Eduardo Bonelli
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalenc…