论文信息 - Reened Program Extraction from Classical Proofs: Some Case Studies - 字舞流文

Reened Program Extraction from Classical Proofs: Some Case Studies

Helmut Schwichtenberg

[1] Ulrich KohlenbachFachbereich Mathematik. Analyzing proofs in analysis , 1993 .

[2] Daniel Leivant,et al. Syntactic translations and provably recursive functions , 1985, Journal of Symbolic Logic.

[3] Harvey M. Friedman,et al. Classically and intuitionistically provably recursive functions , 1978 .

[4] Chetan R. Murthy. Extracting Constructive Content From Classical Proofs , 1990 .

[5] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .

[6] Thierry Coquand,et al. Grr Obner Bases in Type Theory , 1998 .

[7] Ulrich Berger,et al. The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs , 1995, TYPES.

[8] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .