7 citations · 11 across the 5 of their papers we have counts for
Showing 2011 · cs.LOShow all
2 papers · 2 filters
cs.LO2011★ 3 cited
Proceedings Third International Workshop on Classical Logic and Computation
Steffen van Bakel, Stefano Berardi, Ulrich Berger
The fact that classical mathematical proofs of simply existential statements can be read as programs was established by Goedel and Kreisel half a century ago. But the possibility o…
cs.LO2011★ 7 cited
Sound and Complete Typing for lambda-mu
Steffen van Bakel
In this paper we define intersection and union type assignment for Parigot's calculus lambda-mu. We show that this notion is complete (i.e. closed under subject-expansion), and sho…