Searching for authors named Stefano Berardi – sorted by Relevance.
-
A generalization of conservativity theorem for classical versus intuitionistic arithmetic
- Stefano Berardi http://www.di.unito.it/ ∼ stefano Abstract A basic result in Intuitionism is Π0 2
- Cited by 1 (0 self) – Add To MetaCart
-
βη-complete models for System F
- -complete models for System F . Stefano Berardi & Chantal Berline. revised Dec 4th, 2000 Abstract
- Add To MetaCart
-
The Simply-Typed Theory of β-conversion has no maximum extension
- The Simply-Typed Theory of fi-conversion has no maximum extension Franco Barbanera Stefano Berardi
- Add To MetaCart
-
(Technical Report)
- A sequent calculus for Limit Computable Mathematics (Technical Report) Stefano Berardi 1 ,山形賴之 2 1
- Add To MetaCart
-
Extracting constructive content from classical logic via control-like reductions
- Barbanera ? Stefano Berardi Universita' di Torino Dipartimento di Informatica Corso Svizzera, 185 10149
- Cited by 25 (1 self) – Add To MetaCart
-
Total Functionals and Well-founded Strategies
- Total Functionals and Well-founded Strategies Stefano Berardi Ugo de'Liguoro Dipartimento di
- Add To MetaCart
-
Total Functionals and Well-founded Strategies
- Total Functionals and Well-founded Strategies (Extended abstract) Stefano Berardi Ugo de
- Cited by 1 (1 self) – Add To MetaCart
-
"Classical" programming-with-proofs in $\lambda^{Sym}_{PA}$: an analysis of non-confluence
- 1 , Stefano Berardi 1 and Massimo Schivalocchi 2 1 Universita' di Torino, Dipartimento di
- Add To MetaCart
-
Type-based useless-code elimination for functional programs
- Type-Based Useless-Code Elimination for Functional Programs Position Paper Stefano Berardi1
- Cited by 7 (0 self) – Add To MetaCart
-
On the computational content of the Axiom of Choice
- On the computational content of the Axiom of Choice Stefano Berardi Chalmers Torino University
- Cited by 20 (1 self) – Add To MetaCart

