Focused inductive theorem proving. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system for a first-order logic with inductive and co-inductive definitions in which the introduction rules are partitioned into an asynchronous phase and a synchronous phase. These focused proofs allow us to naturally see proof search as being organized around interleaving intervals of computation and more general deduction. For example, entire Prolog-like computations can be captured using a single synchronous phase and many model-checking queries can be captured using an asynchronous phase followed by a synchronous phase. Leveraging these ideas, we have developed an interactive proof assistant, called Tac, for this logic. We describe its high-level design and illustrate how it is capable of automatically proving many theorems using induction and coinduction. Since the automatic proof procedure is structured using focused proofs, its behavior is often rather easy to anticipate and modify. We illustrate the strength of Tac with several examples of proved theorems, some achieved entirely automatically and others achieved with user guidance.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Tiu, Alwen; Momigliano, Alberto: Cut elimination for a logic with induction and co-induction (2012)
- Miller, Dale: A proposal for broad spectrum proof certificates (2011)
- Baelde, David; Miller, Dale; Snow, Zachary: Focused inductive theorem proving (2010)
- Felty, Amy; Pientka, Brigitte: Reasoning with higher-order abstract syntax and contexts: a comparison (2010)
- Snow, Zachary: Realizing the dependently typed (\lambda)-calculus (2010)
- Baelde, David: On the expressivity of minimal generic quantification (2009)
- Baelde, David; Miller, Dale: Least and greatest fixed points in linear logic (2007)