The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefano Berardi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Franco Barbanera, Stefano Berardi
    A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:1-23 [Conf]
  2. Stefano Berardi, Thierry Coquand, Susumu Hayashi
    Games with 1-backtracking. [Citation Graph (0, 0)][DBLP]
    GALOP, 2005, pp:210-225 [Conf]
  3. Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach
    An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:192-201 [Conf]
  4. Stefano Berardi, Mario Coppo, Ferruccio Damiani, Paola Giannini
    Type-Based Useless-Code Elimination for Functional Programs. [Citation Graph (0, 0)][DBLP]
    SAIG, 2000, pp:172-189 [Conf]
  5. Franco Barbanera, Stefano Berardi
    A Symmetric Lambda Calculus for "Classical" Program Extraction. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:495-515 [Conf]
  6. Franco Barbanera, Stefano Berardi, Massimo Schivalocchi
    "Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:365-390 [Conf]
  7. Franco Barbanera, Stefano Berardi
    Extracting Constructive Content from Classical Logic via Control-like Reductions. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:45-59 [Conf]
  8. Stefano Berardi, Luca Boerio
    Using Subtyping in Program Optimization. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:63-77 [Conf]
  9. Stefano Berardi, Luca Boerio
    Minimum Information Code in a Pure Functional Language with Data Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1997, pp:30-45 [Conf]
  10. Stefano Berardi, Marc Bezem, Thierry Coquand
    A realization of the negative interpretation of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:47-62 [Conf]
  11. Stefano Berardi, Ugo de'Liguoro
    Total Functionals and Well-Founded Strategies. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:54-68 [Conf]
  12. Franco Barbanera, Stefano Berardi
    A Strong Normalization Result for Classical Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:76, n:2, pp:99-116 [Journal]
  13. Stefano Berardi, Silvio Valentini
    Krivine's intuitionistic proof of classical completeness (for countable languages). [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:129, n:1-3, pp:93-106 [Journal]
  14. Stefano Berardi
    Some intuitionistic equivalents of classical principles for degree 2 formulas. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:185-200 [Journal]
  15. Stefano Berardi, Chantal Berline
    Building continuous webbed models for system F. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
  16. Franco Barbanera, Stefano Berardi
    A Symmetric Lambda Calculus for Classical Program Extraction. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:2, pp:103-117 [Journal]
  17. Franco Barbanera, Stefano Berardi
    The Simply-Typed Theory of Beta-Conversion has no Maximum Extension. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:57-61 [Journal]
  18. Stefano Berardi
    Retractions on dI-domains as a model for Type:Type [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:2, pp:204-231 [Journal]
  19. Franco Barbanera, Stefano Berardi
    Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:3, pp:519-525 [Journal]
  20. Stefano Berardi
    Equalization of Finite Flowers. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:1, pp:105-123 [Journal]
  21. Stefano Berardi
    Intuitionistic Completeness for First Order Classical Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:304-312 [Journal]
  22. Stefano Berardi, Marc Bezem, Thierry Coquand
    On the Computational Content of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:600-622 [Journal]
  23. Stefano Berardi
    Pruning Simply Typed Lambda-Terms. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:5, pp:663-681 [Journal]
  24. Stefano Baratella, Stefano Berardi
    Approximating Classical Theorems. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1998, v:8, n:6, pp:839-854 [Journal]
  25. Stefano Berardi
    A generalization of a conservativity theorem for classical versus intuitionistic arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:1, pp:41-46 [Journal]
  26. Stefano Berardi
    Classical logic as limit completion. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:1, pp:167-200 [Journal]
  27. Stefano Berardi
    An Application of PER Models to Program Extraction. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1993, v:3, n:3, pp:309-331 [Journal]
  28. Stefano Berardi, Chantal Berline
    BetaEta-Complete Models for System F. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:6, pp:823-874 [Journal]
  29. Franco Barbanera, Stefano Berardi
    A Constructive Valuation Semantics for Classical Logic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1996, v:37, n:3, pp:462-482 [Journal]
  30. Franco Barbanera, Stefano Berardi
    A full continuous model of polymorphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:407-428 [Journal]
  31. Stefano Berardi, Chantal Berline
    Building continuous webbed models for system F. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:1, pp:3-34 [Journal]
  32. Stefano Berardi
    Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:23-38 [Conf]

  33. Positive Arithmetic Without Exchange Is a Subclassical Logic. [Citation Graph (, )][DBLP]


  34. A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). [Citation Graph (, )][DBLP]


  35. Internal Normalization, Compilation and Decompilation for System Fbh. [Citation Graph (, )][DBLP]


  36. Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1. [Citation Graph (, )][DBLP]


  37. A parallel game semantics for Linear Logic. [Citation Graph (, )][DBLP]


  38. Preface. [Citation Graph (, )][DBLP]


  39. A sequent calculus for limit computable mathematics. [Citation Graph (, )][DBLP]


  40. Interactive Realizers and Monads [Citation Graph (, )][DBLP]


  41. Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002