Travelled to:1 × Austria
1 × Brazil
1 × Canada
1 × Finland
1 × Germany
1 × Japan
1 × Norway
1 × United Kingdom
2 × The Netherlands
3 × France
3 × Italy
Collaborated with:M.Tatsuta U.de'Liguoro ∅ L.Boerio F.Aschieri S.Steila F.Barbanera G.Birolo M.Bezem T.Coquand Y.Akama S.Hayashi U.Kohlenbach M.Coppo F.Damiani P.Giannini
Talks about:arithmet (6) realiz (4) intuitionist (3) interpret (3) function (3) well (3) game (3) base (3) strategi (2) program (2)
Person: Stefano Berardi
DBLP: Berardi:Stefano
Contributed to:
2015
20142013
201320122011
2010200920082007
2004
20001999199719951993Wrote 17 papers:
- CSL-2015-Berardi #comprehension #higher-order #induction
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (SB), pp. 343–358.
- RTA-TLCA-2014-BerardiS #theorem
- Ramsey Theorem as an Intuitionistic Property of Well Founded Relations (SB, SS), pp. 93–107.
- CSL-2013-AschieriBB #normalisation
- Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1 (FA, SB, GB), pp. 45–60.
- TLCA-2013-BerardiT #backtracking #game studies #logic #semantics #subclass
- Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics (SB, MT), pp. 61–76.
- CSL-2012-Berardid #learning
- Knowledge Spaces and the Completeness of Learning Strategies (SB, Ud), pp. 77–91.
- CSL-2011-TatsutaB #commutative
- Non-Commutative Infinitary Peano Arithmetic (MT, SB), pp. 538–552.
- FLOPS-2010-BerardiT #compilation #decompiler #normalisation
- Internal Normalization, Compilation and Decompilation for System Fbh (SB, MT), pp. 207–223.
- TLCA-2009-AschieriB #interactive
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1 (FA, SB), pp. 20–34.
- CSL-2008-Berardid #calculus
- A Calculus of Realizers for EM1 Arithmetic (SB, Ud), pp. 215–229.
- TLCA-2007-Berardi #game studies #semantics
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves (SB), pp. 23–38.
- LICS-2004-AkamaBHK
- An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles (YA, SB, SH, UK), pp. 192–201.
- SAIG-2000-BerardiCDG #functional #source code #type system
- Type-Based Useless-Code Elimination for Functional Programs (SB, MC, FD, PG), pp. 172–189.
- TLCA-1999-Berardid
- Total Functionals and Well-Founded Strategies (SB, Ud), pp. 54–68.
- TLCA-1997-BerardiB #data type #functional
- Minimum Information Code in a Pure Functional Language with Data Types (SB, LB), pp. 30–45.
- TLCA-1995-BerardiB #optimisation #type system #using
- Using Subtyping in Program Optimization (SB, LB), pp. 63–77.
- TLCA-1995-BerardiBC #axiom
- A realization of the negative interpretation of the Axiom of Choice (SB, MB, TC), pp. 47–62.
- TLCA-1993-BarbaneraB #logic #reduction
- Extracting Constructive Content from Classical Logic via Control-like Reductions (FB, SB), pp. 45–59.