( en | de | ru )

 

Disambiguation of "Berardi, Stefano"

Author of the publication

copydeleteadd this publication to your clipboard
Games with 1-backtracking.

, , and . GALOP@ETAPS, page 210-225. (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gabriele Berardi

Stefano Meini

Stefano Cracolici

Stefano Cardanobile

Stefano Carignano

 

Other publications of authors with the same name

Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System., and . FoSSaCS, volume 10203 of Lecture Notes in Computer Science, page 301-317. (2017)Ramsey Theorem as an Intuitionistic Property of Well Founded Relations., and . RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, page 93-107. Springer, (2014)Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics., and . TLCA, volume 7941 of Lecture Notes in Computer Science, page 61-76. Springer, (2013)Equivalence of inductive definitions and cyclic proofs under arithmetic., and . LICS, page 1-12. IEEE Computer Society, (2017)A Symmetric Lambda Calculus for "Classical" Program Extraction., and . TACS, volume 789 of Lecture Notes in Computer Science, page 495-515. Springer, (1994)"Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence., , and . TACS, volume 1281 of Lecture Notes in Computer Science, page 365-390. Springer, (1997)Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves.. TLCA, volume 4583 of Lecture Notes in Computer Science, page 23-38. Springer, (2007)Games with 1-backtracking., , and . GALOP@ETAPS, page 210-225. (2005)Retractions on dI-domains as a model for Type:Type. Inf. Comput., 94 (2): 204-231 (October 1991)The Simply-Typed Theory of Beta-Conversion has no Maximum Extension., and . Inf. Comput., 139 (1): 57-61 (1997)