Get started
Author

Stefano Berardi

Observed names: Berardi, Stefano, S BERARDI, S Berardi, S. Berardi, STEFANO BERARDI, Stefano BERARDI
Institution: University of Turin
ORCID: 0000-0001-5427-0020
Observed ORCID: 0000-0001-5427-0020
OpenAlex ID: A5017026543
A Symmetric Lambda Calculus for Classical Program Extraction
1996 · Franco Barbanera, Stefano Berardi · Information and Computation · 126
On the computational content of the axiom of choice
1998 · Stefano Berardi, Marc Bezem, et al. · Journal of Symbolic Logic · 112
An arithmetical hierarchy of the law of excluded middle and related principles
2004 · Y. Akama, S. Berardi, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 47
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
2010 · Federico Aschieri, Stefano Berardi · Logical Methods in Computer Science · 43
PDF
Extracting constructive content from classical logic via control-like reductions
2006 · Franco Barbanera, Stefano Berardi · Springer eBooks · 37
Front Matter, Table of Contents, Preface, Conference Organization
2021 · de'Liguoro, Ugo, Berardi, Stefano, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 33
PDF
Pruning simply typed -terms
1996 · S Berardi · Journal of Logic and Computation · 32
Equivalence of inductive definitions and cyclic proofs under arithmetic
2017 · Stefano Berardi, Makoto Tatsuta · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 31
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
2017 · Stefano Berardi, Makoto Tatsuta · Lecture notes in computer science · 29
A symmetric lambda calculus for “classical” program extraction
1994 · Franco Barbanera, Stefano Berardi · Lecture notes in computer science · 27
Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs
2019 · Stefano Berardi, Makoto Tatsuta · Logical Methods in Computer Science · 19
PDF
Games with 1-backtracking
2010 · Stefano Berardi, Thierry Coquand, et al. · Annals of Pure and Applied Logic · 15
PDF
Some intuitionistic equivalents of classical principles for degree 2 formulas
2005 · Stefano Berardi · Annals of Pure and Applied Logic · 15
PDF
A strong normalization result for classical logic
1995 · Franco Barbanera, Stefano Berardi · Annals of Pure and Applied Logic · 15
Retractions on dI-domains as a model for Type:Type
1991 · Stefano Berardi · Information and Computation · 14
PDF
Toward the interpretation of non-constructive reasoning as non-monotonic learning
2008 · Stefano Berardi, Ugo de’Liguoro · Information and Computation · 13
Type-Based Useless-Code Elimination for Functional Programs
2000 · Stefano Berardi, Mario Coppo, et al. · 13
Krivine's intuitionistic proof of classical completeness (for countable languages)
2004 · Stefano Berardi, Silvio Valentini · Annals of Pure and Applied Logic · 12
PDF
Proof-irrelevance out of excluded-middle and choice in the calculus of constructions
1996 · Franco Barbanera, Stefano Berardi · Journal of Functional Programming · 12
PDF
βη-complete models for System F
2002 · STEFANO BERARDI, CHANTAL BERLINE · Mathematical Structures in Computer Science · 11
Using subtyping in program optimization
1995 · S. Berardi, L. Boerio · Lecture notes in computer science · 11
An intuitionistic version of Ramsey's Theorem and its use in Program Termination
2015 · Stefano Berardi, Silvia Steila · Annals of Pure and Applied Logic · 10
PDF
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic
2014 · Berardi, Stefano, Steila, Silvia · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 10
PDF
A New Use of Friedman’s Translation: Interactive Realizability
2012 · Federico Aschieri, Stefano Berardi · De Gruyter eBooks · 10
Interactive Realizers
2012 · Stefano Berardi, Ugo de’Liguoro · ACM Transactions on Computational Logic · 10
Works count: 118
Citation count: 919
H-index: 14
I10-index: 27
Year
Topic
Type