Proof pearl: looping around the orbit

Authors:
Steven Obua
Affiliations:
Technische Universität München, Germany
Venue:
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Year:
2007

Citing 4
Cited 1

Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Flyspeck i: tame graphs

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Partial recursive functions in higher-order logic

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Flyspeck II: the basic linear programs

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.