Light functional interpretation: An optimization of Gödel's technique towards the extraction of (more) efficient programs from (classical) proofs

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 477-492

  Hernest, Mircea Dan ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Berger's uniform quantifiers; Complexity of extracted programs; G del's Functional interpretation; Program extraction from (classical) proofs; Proof Mining; Proof Carrying code

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING;

BERGER'S UNIFIED QUANTIFIERS; COMPLEXITY OF EXTRACTED PROGRAMS; GÖDEL'S FUNCTIONAL INTERPRETATION; PROGRAM EXTRACTION FROM (CLASSICAL) PROOFS; PROOF MINING; PROOF-CARRYING CODE;

COMPUTER SYSTEMS PROGRAMMING;

EID: 26944475514     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_33     Document Type: Conference Paper

References (38)

1. J. Avigad. Interpreting classical theories in constructive ones. The Journal of Symbolic Logic, 65(4):1785-1812, 2000.
2. J. Avigad and S. Feferman. Gödel's functional ('Dialectica') interpretation. In S.R. Buss, editor, Handbook of Proof Theory, volume 137 of Studies in Logic and the Foundations of Mathematics, pages 337-405. Elsevier, 1998.
3. F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, pages 45-59. LNCS Vol. 664, 1993.
4. J.L. Bates and R.L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113-136, January 1985.
5. U. Berger. Uniform Heyting Arithmetic. Annals of Pure and Applied Logic, 133(1-3): 125-148, May 2005. Festschrift for H. Schwichtenberg's 60th birthday.
6. U. Berger, W. Buchholz, and H. Schwichtenberg. Refined program extraction from classical proofs. Annals of Pure and Applied Logic, 114:3-25, 2002.
7. U. Berger, H. Schwichtenberg, and M. Seisenberger. The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction. Journal of Automated Reasoning, 26:205-221, 2001.
8. R.L. Constable and C. Murthy. Finding computational content in classical proofs. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 341-362. Cambridge University Press, 1991.
9. T. Coquand and M. Hofmann. A new method for establishing conservativity of classical systems over their intuitionistic version. Mathematical Structures in Computer Science, 9(4):323-333, 1999.
10. J. Diller and W. Nahm. Eine Variante zur Dialectica Interpretation der Heyting Arithmetik endlicher Typen. Archiv für Mathematische Logik und Grundlagenforschung, 16:49-66, 1974.
11. F. Ferreira and P. Oliva. Bounded Functional Interpretation. Annals of Pure and Applied Logic, 48 pp., To appear, see Elseviers's Science Direct on the Internet.
12. H. Friedman. Classical and intuitionistically provably recursive functions. In G.H. Müller and D.S. Scott, editors, Higher Set Theory, volume 669 of Lecture Notes in Mathematics, pages 21-27. Springer Verlag, 1978.
13. K. Gödel. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica, 12:280-287, 1958.
14. M.-D. Hernest. Technical Appendix to this paper. See the author's web-page.
15. M.-D. Hernest. A comparison between two techniques of program extraction from classical proofs. In M. Baaz, J. Makovsky, and A. Voronkov, editors, CSL 2003: Extended Posters, vol. VIII of Kurt Gödel Society's Collegium Logicum, pp. 99-102. Springer Verlag, 2004.
16. M.-D. Hernest and U. Kohlenbach. A complexity analysis of functional interpretations. Theoretical Computer Science, 338(1-3):200-246, 10 June 2005.
17. W.A. Howard. Hereditarily majorizable functionals of finite type. [38], pp. 454-461.
18. I. Johansson. Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus. Compositio Matematica, 4:119-136, 1936.
19. K.F. Jørgensen. Finite type arithmetic. Master's thesis, Departments of Mathematics and Philosophy, University of Roskilde, Roskilde, Denmark, 2001.
20. U. Kohlenbach. Proof Interpretations and the Computational Content of Proofs. Lecture Course, latest version in the author's web page.
21. U. Kohlenbach. Analysing proofs in Analysis. In W. Hodges, M. Hyland, C. Steinhorn, and J. Truss, editors, Logic: from Foundations to Applications, Keele, 1993, European Logic Colloquium, pages 225-260. Oxford University Press, 1996.
22. U. Kohlenbach and P. Oliva. Proof mining: a systematic way of analysing proofs in Mathematics. Proc. of the Steklov Institute of Mathematics, 242:136-164, 2003.
23. G. Kreisel. Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting, editor, Constructivity in Mathematics, pages 101-128. North-Holland Publishing Company, 1959.
24. J.-L. Krivine. Classical logic, storage operators and second-order lambda-calculus. Annals of Pure and Applied Logic, 68:53-78, 1994.
25. D. Leivant. Syntactic translations and provably recursive functions. The Journal of Symbolic Logic, 50(3):682-688, September 1985.
26. H. Luckhardt. Extensional Gödel Functional Interpretation, volume 306 of Lecture Notes in Mathematics. Springer Verlag, 1973.
27. H. Luckhardt. Bounds extracted by Kreisel from ineffective proofs. In P. Odifreddi, editor, Kreiseliana: About and around Georg Kreisel, pp. 289-300. A.K. Peters, Wellesley, MA, 1996.
28. C. Murthy. Extracting constructive content from classical proofs. Tech. Report 90-1151, Dep.of Comp.Science, Cornell Univ., Ithaca, NY, U.S.A.,1990. PhD thesis.
29. G.E. Ostrin and S.S. Wainer. Elementary arithmetic. Annals of Pure, and Applied Logic, 133(1-3):275-292, May 2005. Festschrift for H. Schwichtenberg's 60s.
30. M. Parigot. λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proc. of Log. Prog. and Automatic Reasoning, St. Petersburg, volume 624 of LNCS, pages 190-201. Springer Verlag, Berlin, Heidelberg, New York, 1992.
31. C. Paulin-Mohring and B. Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15(5/6):607-640, 1993.
32. C. Raffalli. Getting results from programs extracted from classical proofs. Theoretical Computer Science, 323(1-3):49-70, 2004.
33. P. Rath. Eine verallgemeinerte Funktionalinterpretation der Heyting Arithmetik endlicher Typen. PhD thesis, Universität Münster, Germany, 1978.
34. H. Schwichtenberg. Minimal logic for computable functions. Lecture course on program-extraction from (classical) proofs. Author's page or MINLOG distrib. [36].
35. H. Schwichtenberg. Monotone majorizable functionals. Studia Logica, 62:283-289, 1999.
36. H. Schwichtenberg and Others. Proof- and program-extraction system MINLOG. Free code and documentation at http://www.minlog-system.de.
37. M. Stein. Interpretation der Heyting-Arithmetik endlicher Typen. PhD thesis, Universität Münster, Germany, 1976.
38. A.S. Troelstra, editor. Metamathematical investigation of intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer-Verlag, 1973.