## Mercurial > cpdt > repo

### view src/Match.v @ 220:15501145d696

Find changesets by keywords (author, files, the commit message), revision
number or hash, or revset expression.

Ported Match

author | Adam Chlipala <adamc@hcoop.net> |
---|---|

date | Mon, 16 Nov 2009 10:32:04 -0500 |

parents | f05514cc6c0d |

children | 82eae7bc91ea |

line wrap: on

line source

(* Copyright (c) 2008-2009, Adam Chlipala * * This work is licensed under a * Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 * Unported License. * The license text is available at: * http://creativecommons.org/licenses/by-nc-nd/3.0/ *) (* begin hide *) Require Import List. Require Import Tactics. Set Implicit Arguments. (* end hide *) (** %\part{Proof Engineering} \chapter{Proof Search in Ltac}% *) (** We have seen many examples of proof automation so far. This chapter aims to give a principled presentation of the features of Ltac, focusing in particular on the Ltac [match] construct, which supports a novel approach to backtracking search. First, though, we will run through some useful automation tactics that are built into Coq. They are described in detail in the manual, so we only outline what is possible. *) (** * Some Built-In Automation Tactics *) (** A number of tactics are called repeatedly by [crush]. [intuition] simplifies propositional structure of goals. [congruence] applies the rules of equality and congruence closure, plus properties of constructors of inductive types. The [omega] tactic provides a complete decision procedure for a theory that is called quantifier-free linear arithmetic or Presburger arithmetic, depending on whom you ask. That is, [omega] proves any goal that follows from looking only at parts of that goal that can be interpreted as propositional formulas whose atomic formulas are basic comparison operations on natural numbers or integers. The [ring] tactic solves goals by appealing to the axioms of rings or semi-rings (as in algebra), depending on the type involved. Coq developments may declare new types to be parts of rings and semi-rings by proving the associated axioms. There is a simlar tactic [field] for simplifying values in fields by conversion to fractions over rings. Both [ring] and [field] can only solve goals that are equalities. The [fourier] tactic uses Fourier's method to prove inequalities over real numbers, which are axiomatized in the Coq standard library. The %\textit{%#<i>#setoid#</i>#%}% facility makes it possible to register new equivalence relations to be understood by tactics like [rewrite]. For instance, [Prop] is registered as a setoid with the equivalence relation "if and only if." The ability to register new setoids can be very useful in proofs of a kind common in math, where all reasoning is done after "modding out by a relation." *) (** * Hint Databases *) (** Another class of built-in tactics includes [auto], [eauto], and [autorewrite]. These are based on %\textit{%#<i>#hint databases#</i>#%}%, which we have seen extended in many examples so far. These tactics are important, because, in Ltac programming, we cannot create "global variables" whose values can be extended seamlessly by different modules in different source files. We have seen the advantages of hints so far, where [crush] can be defined once and for all, while still automatically applying the hints we add throughout developments. The basic hints for [auto] and [eauto] are [Hint Immediate lemma], asking to try solving a goal immediately by applying a lemma and discharging any hypotheses with a single proof step each; [Resolve lemma], which does the same but may add new premises that are themselves to be subjects of nested proof search; [Constructor type], which acts like [Resolve] applied to every constructor of an inductive type; and [Unfold ident], which tries unfolding [ident] when it appears at the head of a proof goal. Each of these [Hint] commands may be used with a suffix, as in [Hint Resolve lemma : my_db]. This adds the hint only to the specified database, so that it would only be used by, for instance, [auto with my_db]. An additional argument to [auto] specifies the maximum depth of proof trees to search in depth-first order, as in [auto 8] or [auto 8 with my_db]. The default depth is 5. All of these [Hint] commands can be issued alternatively with a more primitive hint kind, [Extern]. A few examples should do best to explain how [Hint Extern] works. *) Theorem bool_neq : true <> false. (* begin thide *) auto. (** [crush] would have discharged this goal, but the default hint database for [auto] contains no hint that applies. *) Abort. (** It is hard to come up with a [bool]-specific hint that is not just a restatement of the theorem we mean to prove. Luckily, a simpler form suffices. *) Hint Extern 1 (_ <> _) => congruence. Theorem bool_neq : true <> false. auto. Qed. (* end thide *) (** Our hint says: "whenever the conclusion matches the pattern [_ <> _], try applying [congruence]." The [1] is a cost for this rule. During proof search, whenever multiple rules apply, rules are tried in increasing cost order, so it pays to assign high costs to relatively expensive [Extern] hints. [Extern] hints may be implemented with the full Ltac language. This example shows a case where a hint uses a [match]. *) Section forall_and. Variable A : Set. Variables P Q : A -> Prop. Hypothesis both : forall x, P x /\ Q x. Theorem forall_and : forall z, P z. (* begin thide *) crush. (** [crush] makes no progress beyond what [intros] would have accomplished. [auto] will not apply the hypothesis [both] to prove the goal, because the conclusion of [both] does not unify with the conclusion of the goal. However, we can teach [auto] to handle this kind of goal. *) Hint Extern 1 (P ?X) => match goal with | [ H : forall x, P x /\ _ |- _ ] => apply (proj1 (H X)) end. auto. Qed. (* end thide *) (** We see that an [Extern] pattern may bind unification variables that we use in the associated tactic. [proj1] is a function from the standard library for extracting a proof of [R] from a proof of [R /\ S]. *) End forall_and. (** After our success on this example, we might get more ambitious and seek to generalize the hint to all possible predicates [P]. [[ Hint Extern 1 (?P ?X) => match goal with | [ H : forall x, P x /\ _ |- _ ] => apply (proj1 (H X)) end. User error: Bound head variable ]] Coq's [auto] hint databases work as tables mapping %\textit{%#<i>#head symbols#</i>#%}% to lists of tactics to try. Because of this, the constant head of an [Extern] pattern must be determinable statically. In our first [Extern] hint, the head symbol was [not], since [x <> y] desugars to [not (eq x y)]; and, in the second example, the head symbol was [P]. This restriction on [Extern] hints is the main limitation of the [auto] mechanism, preventing us from using it for general context simplifications that are not keyed off of the form of the conclusion. This is perhaps just as well, since we can often code more efficient tactics with specialized Ltac programs, and we will see how in later sections of the chapter. We have used [Hint Rewrite] in many examples so far. [crush] uses these hints by calling [autorewrite]. Our rewrite hints have taken the form [Hint Rewrite lemma : cpdt], adding them to the [cpdt] rewrite database. This is because, in contrast to [auto], [autorewrite] has no default database. Thus, we set the convention that [crush] uses the [cpdt] database. This example shows a direct use of [autorewrite]. *) Section autorewrite. Variable A : Set. Variable f : A -> A. Hypothesis f_f : forall x, f (f x) = f x. Hint Rewrite f_f : my_db. Lemma f_f_f : forall x, f (f (f x)) = f x. intros; autorewrite with my_db; reflexivity. Qed. (** There are a few ways in which [autorewrite] can lead to trouble when insufficient care is taken in choosing hints. First, the set of hints may define a nonterminating rewrite system, in which case invocations to [autorewrite] may not terminate. Second, we may add hints that "lead [autorewrite] down the wrong path." For instance: *) Section garden_path. Variable g : A -> A. Hypothesis f_g : forall x, f x = g x. Hint Rewrite f_g : my_db. Lemma f_f_f' : forall x, f (f (f x)) = f x. intros; autorewrite with my_db. (** [[ ============================ g (g (g x)) = g x ]] *) Abort. (** Our new hint was used to rewrite the goal into a form where the old hint could no longer be applied. This "non-monotonicity" of rewrite hints contrasts with the situation for [auto], where new hints may slow down proof search but can never "break" old proofs. *) Reset garden_path. (** [autorewrite] works with quantified equalities that include additional premises, but we must be careful to avoid similar incorrect rewritings. *) Section garden_path. Variable P : A -> Prop. Variable g : A -> A. Hypothesis f_g : forall x, P x -> f x = g x. Hint Rewrite f_g : my_db. Lemma f_f_f' : forall x, f (f (f x)) = f x. intros; autorewrite with my_db. (** [[ ============================ g (g (g x)) = g x subgoal 2 is: P x subgoal 3 is: P (f x) subgoal 4 is: P (f x) ]] *) Abort. (** The inappropriate rule fired the same three times as before, even though we know we will not be able to prove the premises. *) Reset garden_path. (** Our final, successful, attempt uses an extra argument to [Hint Rewrite] that specifies a tactic to apply to generated premises. *) Section garden_path. Variable P : A -> Prop. Variable g : A -> A. Hypothesis f_g : forall x, P x -> f x = g x. (* begin thide *) Hint Rewrite f_g using assumption : my_db. (* end thide *) Lemma f_f_f' : forall x, f (f (f x)) = f x. (* begin thide *) intros; autorewrite with my_db; reflexivity. Qed. (* end thide *) (** [autorewrite] will still use [f_g] when the generated premise is among our assumptions. *) Lemma f_f_f_g : forall x, P x -> f (f x) = g x. (* begin thide *) intros; autorewrite with my_db; reflexivity. (* end thide *) Qed. End garden_path. (** remove printing * *) (** It can also be useful to use the [autorewrite with db in *] form, which does rewriting in hypotheses, as well as in the conclusion. *) (** printing * $*$ *) Lemma in_star : forall x y, f (f (f (f x))) = f (f y) -> f x = f (f (f y)). (* begin thide *) intros; autorewrite with my_db in *; assumption. (* end thide *) Qed. End autorewrite. (** * Ltac Programming Basics *) (** We have already seen many examples of Ltac programs. In the rest of this chapter, we attempt to give a more principled introduction to the important features and design patterns. One common use for [match] tactics is identification of subjects for case analysis, as we see in this tactic definition. *) (* begin thide *) Ltac find_if := match goal with | [ |- if ?X then _ else _ ] => destruct X end. (* end thide *) (** The tactic checks if the conclusion is an [if], [destruct]ing the test expression if so. Certain classes of theorem are trivial to prove automatically with such a tactic. *) Theorem hmm : forall (a b c : bool), if a then if b then True else True else if c then True else True. (* begin thide *) intros; repeat find_if; constructor. Qed. (* end thide *) (** The [repeat] that we use here is called a %\textit{%#<i>#tactical#</i>#%}%, or tactic combinator. The behavior of [repeat t] is to loop through running [t], running [t] on all generated subgoals, running [t] on %\textit{%#<i>#their#</i>#%}% generated subgoals, and so on. When [t] fails at any point in this search tree, that particular subgoal is left to be handled by later tactics. Thus, it is important never to use [repeat] with a tactic that always succeeds. Another very useful Ltac building block is %\textit{%#<i>#context patterns#</i>#%}%. *) (* begin thide *) Ltac find_if_inside := match goal with | [ |- context[if ?X then _ else _] ] => destruct X end. (* end thide *) (** The behavior of this tactic is to find any subterm of the conclusion that is an [if] and then [destruct] the test expression. This version subsumes [find_if]. *) Theorem hmm' : forall (a b c : bool), if a then if b then True else True else if c then True else True. (* begin thide *) intros; repeat find_if_inside; constructor. Qed. (* end thide *) (** We can also use [find_if_inside] to prove goals that [find_if] does not simplify sufficiently. *) Theorem hmm2 : forall (a b : bool), (if a then 42 else 42) = (if b then 42 else 42). (* begin thide *) intros; repeat find_if_inside; reflexivity. Qed. (* end thide *) (** Many decision procedures can be coded in Ltac via "[repeat match] loops." For instance, we can implement a subset of the functionality of [tauto]. *) (* begin thide *) Ltac my_tauto := repeat match goal with | [ H : ?P |- ?P ] => exact H | [ |- True ] => constructor | [ |- _ /\ _ ] => constructor | [ |- _ -> _ ] => intro | [ H : False |- _ ] => destruct H | [ H : _ /\ _ |- _ ] => destruct H | [ H : _ \/ _ |- _ ] => destruct H | [ H1 : ?P -> ?Q, H2 : ?P |- _ ] => let H := fresh "H" in generalize (H1 H2); clear H1; intro H end. (* end thide *) (** Since [match] patterns can share unification variables between hypothesis and conclusion patterns, it is easy to figure out when the conclusion matches a hypothesis. The [exact] tactic solves a goal completely when given a proof term of the proper type. It is also trivial to implement the "introduction rules" for a few of the connectives. Implementing elimination rules is only a little more work, since we must give a name for a hypothesis to [destruct]. The last rule implements modus ponens. The most interesting part is the use of the Ltac-level [let] with a [fresh] expression. [fresh] takes in a name base and returns a fresh hypothesis variable based on that name. We use the new name variable [H] as the name we assign to the result of modus ponens. The use of [generalize] changes our conclusion to be an implication from [Q]. We clear the original hypothesis and move [Q] into the context with name [H]. *) Section propositional. Variables P Q R : Prop. Theorem propositional : (P \/ Q \/ False) /\ (P -> Q) -> True /\ Q. (* begin thide *) my_tauto. Qed. (* end thide *) End propositional. (** It was relatively easy to implement modus ponens, because we do not lose information by clearing every implication that we use. If we want to implement a similarly-complete procedure for quantifier instantiation, we need a way to ensure that a particular proposition is not already included among our hypotheses. To do that effectively, we first need to learn a bit more about the semantics of [match]. It is tempting to assume that [match] works like it does in ML. In fact, there are a few critical differences in its behavior. One is that we may include arbitrary expressions in patterns, instead of being restricted to variables and constructors. Another is that the same variable may appear multiple times, inducing an implicit equality constraint. There is a related pair of two other differences that are much more important than the others. [match] has a %\textit{%#<i>#backtracking semantics for failure#</i>#%}%. In ML, pattern matching works by finding the first pattern to match and then executing its body. If the body raises an exception, then the overall match raises the same exception. In Coq, failures in case bodies instead trigger continued search through the list of cases. For instance, this (unnecessarily verbose) proof script works: *) Theorem m1 : True. match goal with | [ |- _ ] => intro | [ |- True ] => constructor end. (* begin thide *) Qed. (* end thide *) (** The first case matches trivially, but its body tactic fails, since the conclusion does not begin with a quantifier or implication. In a similar ML match, that would mean that the whole pattern-match fails. In Coq, we backtrack and try the next pattern, which also matches. Its body tactic succeeds, so the overall tactic succeeds as well. The example shows how failure can move to a different pattern within a [match]. Failure can also trigger an attempt to find %\textit{%#<i>#a different way of matching a single pattern#</i>#%}%. Consider another example: *) Theorem m2 : forall P Q R : Prop, P -> Q -> R -> Q. intros; match goal with | [ H : _ |- _ ] => idtac H end. (** Coq prints "[H1]". By applying [idtac] with an argument, a convenient debugging tool for "leaking information out of [match]es," we see that this [match] first tries binding [H] to [H1], which cannot be used to prove [Q]. Nonetheless, the following variation on the tactic succeeds at proving the goal: *) (* begin thide *) match goal with | [ H : _ |- _ ] => exact H end. Qed. (* end thide *) (** The tactic first unifies [H] with [H1], as before, but [exact H] fails in that case, so the tactic engine searches for more possible values of [H]. Eventually, it arrives at the correct value, so that [exact H] and the overall tactic succeed. *) (** Now we are equipped to implement a tactic for checking that a proposition is not among our hypotheses: *) (* begin thide *) Ltac notHyp P := match goal with | [ _ : P |- _ ] => fail 1 | _ => match P with | ?P1 /\ ?P2 => first [ notHyp P1 | notHyp P2 | fail 2 ] | _ => idtac end end. (* end thide *) (** We use the equality checking that is built into pattern-matching to see if there is a hypothesis that matches the proposition exactly. If so, we use the [fail] tactic. Without arguments, [fail] signals normal tactic failure, as you might expect. When [fail] is passed an argument [n], [n] is used to count outwards through the enclosing cases of backtracking search. In this case, [fail 1] says "fail not just in this pattern-matching branch, but for the whole [match]." The second case will never be tried when the [fail 1] is reached. This second case, used when [P] matches no hypothesis, checks if [P] is a conjunction. Other simplifications may have split conjunctions into their component formulas, so we need to check that at least one of those components is also not represented. To achieve this, we apply the [first] tactical, which takes a list of tactics and continues down the list until one of them does not fail. The [fail 2] at the end says to [fail] both the [first] and the [match] wrapped around it. The body of the [?P1 /\ ?P2] case guarantees that, if it is reached, we either succeed completely or fail completely. Thus, if we reach the wildcard case, [P] is not a conjunction. We use [idtac], a tactic that would be silly to apply on its own, since its effect is to succeed at doing nothing. Nonetheless, [idtac] is a useful placeholder for cases like what we see here. With the non-presence check implemented, it is easy to build a tactic that takes as input a proof term and adds its conclusion as a new hypothesis, only if that conclusion is not already present, failing otherwise. *) (* begin thide *) Ltac extend pf := let t := type of pf in notHyp t; generalize pf; intro. (* end thide *) (** We see the useful [type of] operator of Ltac. This operator could not be implemented in Gallina, but it is easy to support in Ltac. We end up with [t] bound to the type of [pf]. We check that [t] is not already present. If so, we use a [generalize]/[intro] combo to add a new hypothesis proved by [pf]. With these tactics defined, we can write a tactic [completer] for adding to the context all consequences of a set of simple first-order formulas. *) (* begin thide *) Ltac completer := repeat match goal with | [ |- _ /\ _ ] => constructor | [ H : _ /\ _ |- _ ] => destruct H | [ H : ?P -> ?Q, H' : ?P |- _ ] => generalize (H H'); clear H; intro H | [ |- forall x, _ ] => intro | [ H : forall x, ?P x -> _, H' : ?P ?X |- _ ] => extend (H X H') end. (* end thide *) (** We use the same kind of conjunction and implication handling as previously. Note that, since [->] is the special non-dependent case of [forall], the fourth rule handles [intro] for implications, too. In the fifth rule, when we find a [forall] fact [H] with a premise matching one of our hypotheses, we add the appropriate instantiation of [H]'s conclusion, if we have not already added it. We can check that [completer] is working properly: *) Section firstorder. Variable A : Set. Variables P Q R S : A -> Prop. Hypothesis H1 : forall x, P x -> Q x /\ R x. Hypothesis H2 : forall x, R x -> S x. Theorem fo : forall x, P x -> S x. (* begin thide *) completer. (** [[ x : A H : P x H0 : Q x H3 : R x H4 : S x ============================ S x ]] *) assumption. Qed. (* end thide *) End firstorder. (** We narrowly avoided a subtle pitfall in our definition of [completer]. Let us try another definition that even seems preferable to the original, to the untrained eye. *) (* begin thide *) Ltac completer' := repeat match goal with | [ |- _ /\ _ ] => constructor | [ H : _ /\ _ |- _ ] => destruct H | [ H : ?P -> _, H' : ?P |- _ ] => generalize (H H'); clear H; intro H | [ |- forall x, _ ] => intro | [ H : forall x, ?P x -> _, H' : ?P ?X |- _ ] => extend (H X H') end. (* end thide *) (** The only difference is in the modus ponens rule, where we have replaced an unused unification variable [?Q] with a wildcard. Let us try our example again with this version: *) Section firstorder'. Variable A : Set. Variables P Q R S : A -> Prop. Hypothesis H1 : forall x, P x -> Q x /\ R x. Hypothesis H2 : forall x, R x -> S x. Theorem fo' : forall x, P x -> S x. (* begin thide *) (** [[ completer'. ]] Coq loops forever at this point. What went wrong? *) Abort. (* end thide *) End firstorder'. (** A few examples should illustrate the issue. Here we see a [match]-based proof that works fine: *) Theorem t1 : forall x : nat, x = x. match goal with | [ |- forall x, _ ] => trivial end. (* begin thide *) Qed. (* end thide *) (** This one fails. *) (* begin thide *) Theorem t1' : forall x : nat, x = x. (** [[ match goal with | [ |- forall x, ?P ] => trivial end. User error: No matching clauses for match goal ]] *) Abort. (* end thide *) (** The problem is that unification variables may not contain locally-bound variables. In this case, [?P] would need to be bound to [x = x], which contains the local quantified variable [x]. By using a wildcard in the earlier version, we avoided this restriction. The Coq 8.2 release includes a special pattern form for a unification variable with an explicit set of free variables. That unification variable is then bound to a function from the free variables to the "real" value. In Coq 8.1 and earlier, there is no such workaround. No matter which version you use, it is important to be aware of this restriction. As we have alluded to, the restriction is the culprit behind the infinite-looping behavior of [completer']. We unintentionally match quantified facts with the modus ponens rule, circumventing the "already present" check and leading to different behavior. *) (** * Functional Programming in Ltac *) (* EX: Write a list length function in Ltac. *) (** Ltac supports quite convenient functional programming, with a Lisp-with-syntax kind of flavor. However, there are a few syntactic conventions involved in getting programs to be accepted. The Ltac syntax is optimized for tactic-writing, so one has to deal with some inconveniences in writing more standard functional programs. To illustrate, let us try to write a simple list length function. We start out writing it just like in Gallina, simply replacing [Fixpoint] (and its annotations) with [Ltac]. [[ Ltac length ls := match ls with | nil => O | _ :: ls' => S (length ls') end. Error: The reference ls' was not found in the current environment ]] At this point, we hopefully remember that pattern variable names must be prefixed by question marks in Ltac. [[ Ltac length ls := match ls with | nil => O | _ :: ?ls' => S (length ls') end. Error: The reference S was not found in the current environment ]] The problem is that Ltac treats the expression [S (length ls')] as an invocation of a tactic [S] with argument [length ls']. We need to use a special annotation to "escape into" the Gallina parsing nonterminal. *) (* begin thide *) Ltac length ls := match ls with | nil => O | _ :: ?ls' => constr:(S (length ls')) end. (** This definition is accepted. It can be a little awkward to test Ltac definitions like this. Here is one method. *) Goal False. let n := length (1 :: 2 :: 3 :: nil) in pose n. (** [[ n := S (length (2 :: 3 :: nil)) : nat ============================ False ]] We use the [pose] tactic, which extends the proof context with a new variable that is set equal to particular a term. We could also have used [idtac n] in place of [pose n], which would have printed the result without changing the context. [n] only has the length calculation unrolled one step. What has happened here is that, by escaping into the [constr] nonterminal, we referred to the [length] function of Gallina, rather than the [length] Ltac function that we are defining. *) Abort. Reset length. (** The thing to remember is that Gallina terms built by tactics must be bound explicitly via [let] or a similar technique, rather than inserting Ltac calls directly in other Gallina terms. *) Ltac length ls := match ls with | nil => O | _ :: ?ls' => let ls'' := length ls' in constr:(S ls'') end. Goal False. let n := length (1 :: 2 :: 3 :: nil) in pose n. (** [[ n := 3 : nat ============================ False ]] *) Abort. (* end thide *) (* EX: Write a list map function in Ltac. *) (** We can also use anonymous function expressions and local function definitions in Ltac, as this example of a standard list [map] function shows. *) (* begin thide *) Ltac map T f := let rec map' ls := match ls with | nil => constr:(@nil T) | ?x :: ?ls' => let x' := f x in let ls'' := map' ls' in constr:(x' :: ls'') end in map'. (** Ltac functions can have no implicit arguments. It may seem surprising that we need to pass [T], the carried type of the output list, explicitly. We cannot just use [type of f], because [f] is an Ltac term, not a Gallina term, and Ltac programs are dynamically typed. [f] could use very syntactic methods to decide to return differently typed terms for different inputs. We also could not replace [constr:(@nil T)] with [constr:nil], because we have no strongly-typed context to use to infer the parameter to [nil]. Luckily, we do have sufficient context within [constr:(x' :: ls'')]. Sometimes we need to employ the opposite direction of "nonterminal escape," when we want to pass a complicated tactic expression as an argument to another tactic, as we might want to do in invoking [map]. *) Goal False. let ls := map (nat * nat)%type ltac:(fun x => constr:(x, x)) (1 :: 2 :: 3 :: nil) in pose ls. (** [[ l := (1, 1) :: (2, 2) :: (3, 3) :: nil : list (nat * nat) ============================ False ]] *) Abort. (* end thide *) (** * Recursive Proof Search *) (** Deciding how to instantiate quantifiers is one of the hardest parts of automated first-order theorem proving. For a given problem, we can consider all possible bounded-length sequences of quantifier instantiations, applying only propositional reasoning at the end. This is probably a bad idea for almost all goals, but it makes for a nice example of recursive proof search procedures in Ltac. We can consider the maximum "dependency chain" length for a first-order proof. We define the chain length for a hypothesis to be 0, and the chain length for an instantiation of a quantified fact to be one greater than the length for that fact. The tactic [inster n] is meant to try all possible proofs with chain length at most [n]. *) (* begin thide *) Ltac inster n := intuition; match n with | S ?n' => match goal with | [ H : forall x : ?T, _, x : ?T |- _ ] => generalize (H x); inster n' end end. (* end thide *) (** [inster] begins by applying propositional simplification. Next, it checks if any chain length remains. If so, it tries all possible ways of instantiating quantified hypotheses with properly-typed local variables. It is critical to realize that, if the recursive call [inster n'] fails, then the [match goal] just seeks out another way of unifying its pattern against proof state. Thus, this small amount of code provides an elegant demonstration of how backtracking [match] enables exhaustive search. We can verify the efficacy of [inster] with two short examples. The built-in [firstorder] tactic (with no extra arguments) is able to prove the first but not the second. *) Section test_inster. Variable A : Set. Variables P Q : A -> Prop. Variable f : A -> A. Variable g : A -> A -> A. Hypothesis H1 : forall x y, P (g x y) -> Q (f x). Theorem test_inster : forall x y, P (g x y) -> Q (f x). inster 2. Qed. Hypothesis H3 : forall u v, P u /\ P v /\ u <> v -> P (g u v). Hypothesis H4 : forall u, Q (f u) -> P u /\ P (f u). Theorem test_inster2 : forall x y, x <> y -> P x -> Q (f y) -> Q (f x). inster 3. Qed. End test_inster. (** The style employed in the definition of [inster] can seem very counterintuitive to functional programmers. Usually, functional programs accumulate state changes in explicit arguments to recursive functions. In Ltac, the state of the current subgoal is always implicit. Nonetheless, in contrast to general imperative programming, it is easy to undo any changes to this state, and indeed such "undoing" happens automatically at failures within [match]es. In this way, Ltac programming is similar to programming in Haskell with a stateful failure monad that supports a composition operator along the lines of the [first] tactical. Functional programming purists may react indignantly to the suggestion of programming this way. Nonetheless, as with other kinds of "monadic programming," many problems are much simpler to solve with Ltac than they would be with explicit, pure proof manipulation in ML or Haskell. To demonstrate, we will write a basic simplification procedure for logical implications. This procedure is inspired by one for separation logic, where conjuncts in formulas are thought of as "resources," such that we lose no completeness by "crossing out" equal conjuncts on the two sides of an implication. This process is complicated by the fact that, for reasons of modularity, our formulas can have arbitrary nested tree structure (branching at conjunctions) and may include existential quantifiers. It is helpful for the matching process to "go under" quantifiers and in fact decide how to instantiate existential quantifiers in the conclusion. To distinguish the implications that our tactic handles from the implications that will show up as "plumbing" in various lemmas, we define a wrapper definition, a notation, and a tactic. *) Definition imp (P1 P2 : Prop) := P1 -> P2. Infix "-->" := imp (no associativity, at level 95). Ltac imp := unfold imp; firstorder. (** These lemmas about [imp] will be useful in the tactic that we will write. *) Theorem and_True_prem : forall P Q, (P /\ True --> Q) -> (P --> Q). imp. Qed. Theorem and_True_conc : forall P Q, (P --> Q /\ True) -> (P --> Q). imp. Qed. Theorem assoc_prem1 : forall P Q R S, (P /\ (Q /\ R) --> S) -> ((P /\ Q) /\ R --> S). imp. Qed. Theorem assoc_prem2 : forall P Q R S, (Q /\ (P /\ R) --> S) -> ((P /\ Q) /\ R --> S). imp. Qed. Theorem comm_prem : forall P Q R, (P /\ Q --> R) -> (Q /\ P --> R). imp. Qed. Theorem assoc_conc1 : forall P Q R S, (S --> P /\ (Q /\ R)) -> (S --> (P /\ Q) /\ R). imp. Qed. Theorem assoc_conc2 : forall P Q R S, (S --> Q /\ (P /\ R)) -> (S --> (P /\ Q) /\ R). imp. Qed. Theorem comm_conc : forall P Q R, (R --> P /\ Q) -> (R --> Q /\ P). imp. Qed. (** The first order of business in crafting our [matcher] tactic will be auxiliary support for searching through formula trees. The [search_prem] tactic implements running its tactic argument [tac] on every subformula of an [imp] premise. As it traverses a tree, [search_prem] applies some of the above lemmas to rewrite the goal to bring different subformulas to the head of the goal. That is, for every subformula [P] of the implication premise, we want [P] to "have a turn," where the premise is rearranged into the form [P /\ Q] for some [Q]. The tactic [tac] should expect to see a goal in this form and focus its attention on the first conjunct of the premise. *) (* begin thide *) Ltac search_prem tac := let rec search P := tac || (apply and_True_prem; tac) || match P with | ?P1 /\ ?P2 => (apply assoc_prem1; search P1) || (apply assoc_prem2; search P2) end in match goal with | [ |- ?P /\ _ --> _ ] => search P | [ |- _ /\ ?P --> _ ] => apply comm_prem; search P | [ |- _ --> _ ] => progress (tac || (apply and_True_prem; tac)) end. (** To understand how [search_prem] works, we turn first to the final [match]. If the premise begins with a conjunction, we call the [search] procedure on each of the conjuncts, or only the first conjunct, if that already yields a case where [tac] does not fail. [search P] expects and maintains the invariant that the premise is of the form [P /\ Q] for some [Q]. We pass [P] explicitly as a kind of decreasing induction measure, to avoid looping forever when [tac] always fails. The second [match] case calls a commutativity lemma to realize this invariant, before passing control to [search]. The final [match] case tries applying [tac] directly and then, if that fails, changes the form of the goal by adding an extraneous [True] conjunct and calls [tac] again. [search] itself tries the same tricks as in the last case of the final [match]. Additionally, if neither works, it checks if [P] is a conjunction. If so, it calls itself recursively on each conjunct, first applying associativity lemmas to maintain the goal-form invariant. We will also want a dual function [search_conc], which does tree search through an [imp] conclusion. *) Ltac search_conc tac := let rec search P := tac || (apply and_True_conc; tac) || match P with | ?P1 /\ ?P2 => (apply assoc_conc1; search P1) || (apply assoc_conc2; search P2) end in match goal with | [ |- _ --> ?P /\ _ ] => search P | [ |- _ --> _ /\ ?P ] => apply comm_conc; search P | [ |- _ --> _ ] => progress (tac || (apply and_True_conc; tac)) end. (** Now we can prove a number of lemmas that are suitable for application by our search tactics. A lemma that is meant to handle a premise should have the form [P /\ Q --> R] for some interesting [P], and a lemma that is meant to handle a conclusion should have the form [P --> Q /\ R] for some interesting [Q]. *) Theorem False_prem : forall P Q, False /\ P --> Q. imp. Qed. Theorem True_conc : forall P Q : Prop, (P --> Q) -> (P --> True /\ Q). imp. Qed. Theorem Match : forall P Q R : Prop, (Q --> R) -> (P /\ Q --> P /\ R). imp. Qed. Theorem ex_prem : forall (T : Type) (P : T -> Prop) (Q R : Prop), (forall x, P x /\ Q --> R) -> (ex P /\ Q --> R). imp. Qed. Theorem ex_conc : forall (T : Type) (P : T -> Prop) (Q R : Prop) x, (Q --> P x /\ R) -> (Q --> ex P /\ R). imp. Qed. (** We will also want a "base case" lemma for finishing proofs where cancelation has removed every constituent of the conclusion. *) Theorem imp_True : forall P, P --> True. imp. Qed. (** Our final [matcher] tactic is now straightforward. First, we [intros] all variables into scope. Then we attempt simple premise simplifications, finishing the proof upon finding [False] and eliminating any existential quantifiers that we find. After that, we search through the conclusion. We remove [True] conjuncts, remove existential quantifiers by introducing unification variables for their bound variables, and search for matching premises to cancel. Finally, when no more progress is made, we see if the goal has become trivial and can be solved by [imp_True]. In each case, we use the tactic [simple apply] in place of [apply] to use a simpler, less expensive unification algorithm. *) Ltac matcher := intros; repeat search_prem ltac:(simple apply False_prem || (simple apply ex_prem; intro)); repeat search_conc ltac:(simple apply True_conc || simple eapply ex_conc || search_prem ltac:(simple apply Match)); try simple apply imp_True. (* end thide *) (** Our tactic succeeds at proving a simple example. *) Theorem t2 : forall P Q : Prop, Q /\ (P /\ False) /\ P --> P /\ Q. matcher. Qed. (** In the generated proof, we find a trace of the workings of the search tactics. *) Print t2. (** %\vspace{-.15in}% [[ t2 = fun P Q : Prop => comm_prem (assoc_prem1 (assoc_prem2 (False_prem (P:=P /\ P /\ Q) (P /\ Q)))) : forall P Q : Prop, Q /\ (P /\ False) /\ P --> P /\ Q ]] We can also see that [matcher] is well-suited for cases where some human intervention is needed after the automation finishes. *) Theorem t3 : forall P Q R : Prop, P /\ Q --> Q /\ R /\ P. matcher. (** [[ ============================ True --> R ]] [matcher] canceled those conjuncts that it was able to cancel, leaving a simplified subgoal for us, much as [intuition] does. *) Abort. (** [matcher] even succeeds at guessing quantifier instantiations. It is the unification that occurs in uses of the [Match] lemma that does the real work here. *) Theorem t4 : forall (P : nat -> Prop) Q, (exists x, P x /\ Q) --> Q /\ (exists x, P x). matcher. Qed. Print t4. (** %\vspace{-.15in}% [[ t4 = fun (P : nat -> Prop) (Q : Prop) => and_True_prem (ex_prem (P:=fun x : nat => P x /\ Q) (fun x : nat => assoc_prem2 (Match (P:=Q) (and_True_conc (ex_conc (fun x0 : nat => P x0) x (Match (P:=P x) (imp_True (P:=True)))))))) : forall (P : nat -> Prop) (Q : Prop), (exists x : nat, P x /\ Q) --> Q /\ (exists x : nat, P x) ]] *)