Advertisement

Proof Pearl: Looping Around the Orbit

  • Steven Obua
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4732)

Abstract

We reexamine the While combinator of higher-order logic (HOL) and introduce the For combinator. We argue that both combinators should be part of the toolbox of any HOL practitioner, not only because they make efficient computations within HOL possible, but also because they facilitate elegant inductive reasoning about loops. We present two examples that support this argument.

Keywords

Planar Graph Induction Rule Loop Index Oriented Edge Loop State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Krauss, A.: Partial Recursive Functions in Higher-Order Logic. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Owens, S., Slind, K.: Adapting Functional Programs to Higher-Order Logic (submitted)Google Scholar
  3. 3.
    Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  4. 4.
    Berghofer, S., Nipkow, T.: Executing Higher-Order Logic. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Gonthier, G.: A computer-checked proof of the Four Color Theorem, http://research.microsoft.com/~gonthier/4colproof.pdf
  6. 6.
    Nipkow, T., Bauer, G., Schultz, P.: Flyspeck I: Tame Graphs. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Hales, T.: The Flyspeck Project, http://www.math.pitt.edu/~thales/flyspeck/
  8. 8.
    Hales, T.: A proof of the Kepler conjecture. Annals of Mathematics 162, 1065–1185Google Scholar
  9. 9.
    Looping around the Orbit, http://www4.in.tum.de/~obua/looping/

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Steven Obua
    • 1
  1. 1.Technische Universität München, D-85748 Garching, Boltzmannstr. 3Germany

Personalised recommendations