Getting results from programs extracted from classical proofs

Theoretical Computer Science

Volumn 323, Issue 1-3, 2004, Pages 49-70

  Raffalli, C ^a  

^a Institut Universitaire de France   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DATA ACQUISITION; FUNCTIONS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; THEOREM PROVING;

CLASSICAL PROOFS; DATA TYPE; INTUITIONISTIC LOGIC; NONCOMPUTABLE FUNCTIONS;

COMPUTER SCIENCE;

EID: 4243103715     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.006     Document Type: Article

References (17)

1. Berardi S. Pruning simply typed. λ -terms J. Logic Comput. 6:1996;663-681.
2. Berger U., Buchholz W., Schwichtenberg H. Refined program extraction from classical proofs. Ann. Pure Appl. Logic. 114:2002;3-25.
3. Berger U., Schwichtenberg H., Monika S. The Warshall Algorithm and Dickson's Lemma. two examples of realistic program extraction J. Automat. Reason. 26:2001.
4. L. Boerio, Optimizing Programs Extracted From Proofs, Ph.D. Thesis, Computer Science Department of Torino University, 1995.
5. Coquand T. A semantics of evidence for classical arithmetic. J. Symbolic Logic. 60:1995;325-337.
6. P. Curmin, Marquage des preuves et extraction de programmes, Ph.D. Thesis, Équipe de logique Université Paris VII, 1999.
7. S. Farkh, Types de données en logique du second ordre, Ph.D. Thesis, Université de Savoie, Décembre 1998.
8. M. Felleisen, D. Friedman, Control operators, the SECD machine and the λ -calculus, Formal description of Programming Concepts, III, 1986, pp. 131-141.
9. T.G. Griffin, A formulae as-as-types notion of control, in: 17th Ann. ACM Symp. on Principle of Programming Language, Oxford University Press, Oxford, 1990, pp. 47-58.
10. J.-L. Krivine, Lambda-Calculus: Types and Models, Computers and their applications, Ellis Horwood, 1993 (or Masson in French).
11. Krivine J.-L. A general storage theorem for integers in call-by-name lambda-calculus. Theor. Comput. Sci. 129:1994;79-94.
12. Krivine J.-L. Classical logic, storage operators and second-order lambda-calculus. Ann. Pure Appl. Logic. 68:1994;225-260.
13. Krivine J.-L. Dependent choice, 'quote' and the clock. Theor. Comput. Sci. 308:2003;259-276.
14. Nour K. Mixed logic and storage operators. Arch. Math. Logic. 39:2000;261-280.
15. M. Parigot, λ μ -calculus an algorithmic interpretation of classical natural deduction, in: Proc. of Logic and Automatic Reasoning, Lecture Notes in Computer Science, vol. 624, 1991.
16. M. Parigot, Strong normalization for second order classical natural deduction, Logic Comput. Sci. (1993) pp. 39-46.
17. C. Raffalli, the phox proof assistant version 0.8. software available on the Internet: http://www.lama.univ-savoie.fr/~RAFFALLI/phox.html, 2002.