33 citations · 67 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
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★ 24 cited
From coinductive proofs to exact real arithmetic: theory and applications
Ulrich Berger
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs…