Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction

Journal of Automated Reasoning

Volumn 26, Issue 2, 2001, Pages 205-221

  Berger, Ulrich ^a   Schwichtenberg, Helmut ^b   Seisenberger, Monika ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; THEOREM PROVING;

REALISTIC PROGRAM EXTRACTION; WARSHALL ALGORITHMS;

COMPUTER SOFTWARE;

EID: 0035252984     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026748613865     Document Type: Article

References (20)

1. Bates, J. L. and Constable, R. L.: Proofs as programs, ACM Trans. Programming Languages and Systems 7(1) (1985), 113-136.
2. Benl, H., Berger, U., Schwichtenberg, H., Seisenberger, M., and Zuber, W.: Proof theory at work: Program development in the Minlog system, in W. Bibel and P. Schmitt (eds), Automated Deduction - A Basis for Applications, Vol. II: Systems and Implementation Techniques, Appl. Logic Series, Kluwer Academic Publishers, Dordrecht, 1998, pp. 41-71.
3. Benl, H. and Schwichtenberg, H.: Formal correctness proofs of functional programs: Dijkstra's algorithm, a case study, in U. Berger and H. Schwichtenberg (eds), Computational Logic, Computer and Systems Sci. Series F 165, Springer-Verlag, Berlin, 1999, pp. 113-126.
4. Berger, U.: Program extraction from normalization proofs, in M. Bezem and J. Groote (eds), Typed Lambda Calculi and Applications, Lecture Notes in Comput. Sci. 165, Springer-Verlag, Berlin, 1993, pp. 91-106.
5. Berger, U. and Schwichtenberg, H.: Program extraction from classical proofs, in D. Leivant (ed.), Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, IN, USA, October 1994, Lecture Notes in Comput. Sci. 960, Springer-Verlag, Berlin, 1995, pp. 77-97.
6. Broy, M. and Pepper, P.: Program development as a formal activity, IEEE Trans. on Software Eng. 7(1) (1981), 14-22.
7. Coquand, T. and Persson, H.: Gröbner bases in type theory, in T. Altenkirch, W. Naraschewski, and B. Reus (eds), Types for Proofs and Programs, Lecture Notes in Comput. Sci. 1657, Springer-Verlag, Berlin, 1999.
8. Dickson, L.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, Amer. J. Math. 35 (1913), 413-422.
9. Dragalin, A.: New kinds of realizability, in Abstracts of the 6th International Congress of Logic, Methodology and Philosophy of Sciences, Hannover, Germany, 1979, pp. 20-24.
10. Friedman, H.: Classically and intuitionistically provably recursive functions, in D. Scott and G. Müller (eds), Higher Set Theory, Lecture Notes in Math. 669, Springer-Verlag, Berlin, 1978, pp. 21-28.
11. Kohlenbach, U.: Analysing proofs in analysis, in W. Hodges, M. Hyland, C. Steinhorn, and J. Truss (eds), Logic: From Foundations to Applications. European Logic Colloquium (Keele, 1993), Oxford University Press, 1996, pp. 225-260.
12. Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types, in A. Heyting (ed.), Constructivity in Mathematics, North-Holland, Amsterdam, 1959, pp. 101-128.
13. Leivant, D.: Syntactic translations and provably recursive functions, J. Symbolic Logic 50(3) (1985), 682-688.
14. Murthy, C.: Extracting constructive content from classical proofs, Technical Report 90-1151, Dept. of Comp. Science, Cornell Univ., Ithaca, New York. PhD thesis, 1990.
15. Nash-Williams, C. S. J. A.: On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963), 833-835.
16. Pfenning, F.: Program development through proof transformation, in W. Sieg (ed.), Logic and Computation, Contemp. Math. 106, Amer. Math. Soc., Providence, RI, 1990, pp. 251-262.
17. Tait, W. W.: Intensional interpretations of functionals of finite type I, J. Symbolic Logic 32(2) (1967), 198-212.
18. Troelstra, A. S.: Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Math. 344, Springer-Verlag, Berlin, 1973.
19. Troelstra, A. S. and van Dalen, D.: Constructivism in Mathematics: An Introduction, Stud. Logic Found. Math. 121, 123, North-Holland, Amsterdam, 1988.
20. Veldman, W. and Bezem, M.: Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics, J. London Math. Soc. 47 (1993), 193-211.