Ulrich Berger and Helmut Schwichtenberg. Program extraction from classical proofs. In D. Leivant, editor, Logic and Computational Complexity, International Workshop LCC '94, Indiapolis, IN, USA, October 1994, pages 77-97, 1995. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
CPS Translating Inductive and Coinductive Types (Extended.. - Barthe, Uustalu (2002) (Correct)
Proof Interpretations and the Computational Content of Proofs - Kohlenbach (2002) (1 citation) (Correct)
CPS Translating Inductive and Coinductive Types (Extended.. - Barthe, Uustalu (2002) (Correct)
Proof Mining in Analysis: Computability and Complexity - Oliva (2001) (Correct)
Set Theoretical Proofs as Type Theoretical Programs - Setzer (1996) (Correct)
From Constructivism to Computer Science - Troelstra (1999) (Correct)
Process Realizability - Abramsky (2000) (1 citation) (Correct)
A semantic view of classical proofs. - type-theoretic, categorical, .. - Ong (1996) (Correct)
Towards Animation of Proofs --testing proofs by examples-- - Susumu Hayashi (1 citation) (Correct)
Search Algorithms in Type Theory - Caldwell, Gent, Underwood (1998) (3 citations) (Correct)
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (36 citations) (Correct)
Translating Set Theoretical Proofs into Type Theoretical Programs - Setzer (1997) (1 citation) (Correct)
Inductive Definitions with Decidable Atomic Formulas - Setzer (Correct)
Search Algorithms in Type Theory - Caldwell, Gent, Underwood (1997) (3 citations) (Correct)
The Curry-Howard isomorphism adapted for imperative program .. - Poernomo, Crossley (2002) (Correct)
What is the Difference between Proofs and Programs? - Crossley (2005) (Correct)
Samsara - Crossley (2005) (Correct)
Proof Mining in Subsystems of Analysis - Oliva (2003) (Correct)
Strong Normalisation of Cut-Elimination in Classical Logic - Urban, Bierman (2000) (3 citations) (Correct)
The Structure of Nuprl's Type Theory - Constable (1997) (1 citation) (Correct)
Domain-Theoretic Methods for Program Synthesis - Berger Self-citation (Berger) (Correct)
Modified Bar Recursion and Classical Dependent Choice - Berger, Oliva (1 citation) Self-citation (Berger) (Correct)
Proof Theory At Work: Program Development In The.. - Benl, BERGER.. (1998) Self-citation (Berger) (Correct)
Proof Theory At Work: Program Development In The.. - Benl, Berger.. (1998) Self-citation (Berger Schwichtenberg) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC