## Mercurial > cpdt > repo

### view src/Reflection.v @ 362:70ffa4d3726e

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

Template tweaks

author | Adam Chlipala <adam@chlipala.net> |
---|---|

date | Wed, 02 Nov 2011 17:03:25 -0400 |

parents | df17b699a04f |

children | 549d604c3d16 |

line wrap: on

line source

(* Copyright (c) 2008-2011, 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 CpdtTactics MoreSpecif. Set Implicit Arguments. (* end hide *) (** %\chapter{Proof by Reflection}% *) (** The last chapter highlighted a very heuristic approach to proving. In this chapter, we will study an alternative technique, %\index{proof by reflection}\textit{%#<i>#proof by reflection#</i>#%}~\cite{reflection}%. We will write, in Gallina, decision procedures with proofs of correctness, and we will appeal to these procedures in writing very short proofs. Such a proof is checked by running the decision procedure. The term %\textit{%#<i>#reflection#</i>#%}% applies because we will need to translate Gallina propositions into values of inductive types representing syntax, so that Gallina programs may analyze them. *) (** * Proving Evenness *) (** Proving that particular natural number constants are even is certainly something we would rather have happen automatically. The Ltac-programming techniques that we learned in the last chapter make it easy to implement such a procedure. *) Inductive isEven : nat -> Prop := | Even_O : isEven O | Even_SS : forall n, isEven n -> isEven (S (S n)). (* begin thide *) Ltac prove_even := repeat constructor. (* end thide *) Theorem even_256 : isEven 256. prove_even. Qed. Print even_256. (** %\vspace{-.15in}% [[ even_256 = Even_SS (Even_SS (Even_SS (Even_SS ]] %\noindent%...and so on. This procedure always works (at least on machines with infinite resources), but it has a serious drawback, which we see when we print the proof it generates that 256 is even. The final proof term has length super-linear in the input value. Coq's implicit arguments mechanism is hiding the values given for parameter [n] of [Even_SS], which is why the proof term only appears linear here. Also, proof terms are represented internally as syntax trees, with opportunity for sharing of node representations, but in this chapter we will measure proof term size as simple textual length or as the number of nodes in the term's syntax tree, two measures that are approximately equivalent. Sometimes apparently large proof terms have enough internal sharing that they take up less memory than we expect, but one avoids having to reason about such sharing by ensuring that the size of a sharing-free version of a term is low enough. Superlinear evenness proof terms seem like a shame, since we could write a trivial and trustworthy program to verify evenness of constants. The proof checker could simply call our program where needed. It is also unfortunate not to have static typing guarantees that our tactic always behaves appropriately. Other invocations of similar tactics might fail with dynamic type errors, and we would not know about the bugs behind these errors until we happened to attempt to prove complex enough goals. The techniques of proof by reflection address both complaints. We will be able to write proofs like this with constant size overhead beyond the size of the input, and we will do it with verified decision procedures written in Gallina. For this example, we begin by using a type from the [MoreSpecif] module (included in the book source) to write a certified evenness checker. *) Print partial. (** %\vspace{-.15in}% [[ Inductive partial (P : Prop) : Set := Proved : P -> [P] | Uncertain : [P] ]] A [partial P] value is an optional proof of [P]. The notation [[P]] stands for [partial P]. *) Local Open Scope partial_scope. (** We bring into scope some notations for the [partial] type. These overlap with some of the notations we have seen previously for specification types, so they were placed in a separate scope that needs separate opening. *) (* begin thide *) Definition check_even : forall n : nat, [isEven n]. Hint Constructors isEven. refine (fix F (n : nat) : [isEven n] := match n with | 0 => Yes | 1 => No | S (S n') => Reduce (F n') end); auto. Defined. (** The function [check_even] may be viewed as a %\emph{%#<i>#verified decision procedure#</i>#%}%, because its type guarantees that it never returns [Yes] for inputs that are not even. Now we can use dependent pattern-matching to write a function that performs a surprising feat. When given a [partial P], this function [partialOut] returns a proof of [P] if the [partial] value contains a proof, and it returns a (useless) proof of [True] otherwise. From the standpoint of ML and Haskell programming, it seems impossible to write such a type, but it is trivial with a [return] annotation. *) Definition partialOut (P : Prop) (x : [P]) := match x return (match x with | Proved _ => P | Uncertain => True end) with | Proved pf => pf | Uncertain => I end. (** It may seem strange to define a function like this. However, it turns out to be very useful in writing a reflective version of our earlier [prove_even] tactic: *) Ltac prove_even_reflective := match goal with | [ |- isEven ?N] => exact (partialOut (check_even N)) end. (* end thide *) (** We identify which natural number we are considering, and we %``%#"#prove#"#%''% its evenness by pulling the proof out of the appropriate [check_even] call. Recall that the %\index{tactics!exact}%[exact] tactic proves a proposition [P] when given a proof term of precisely type [P]. *) Theorem even_256' : isEven 256. prove_even_reflective. Qed. Print even_256'. (** %\vspace{-.15in}% [[ even_256' = partialOut (check_even 256) : isEven 256 ]] We can see a constant wrapper around the object of the proof. For any even number, this form of proof will suffice. The size of the proof term is now linear in the number being checked, containing two repetitions of the unary form of that number, one of which is hidden above within the implicit argument to [partialOut]. What happens if we try the tactic with an odd number? *) Theorem even_255 : isEven 255. (** %\vspace{-.275in}%[[ prove_even_reflective. ]] << User error: No matching clauses for match goal >> Thankfully, the tactic fails. To see more precisely what goes wrong, we can run manually the body of the [match]. %\vspace{-.15in}%[[ exact (partialOut (check_even 255)). ]] << Error: The term "partialOut (check_even 255)" has type "match check_even 255 with | Yes => isEven 255 | No => True end" while it is expected to have type "isEven 255" >> As usual, the type checker performs no reductions to simplify error messages. If we reduced the first term ourselves, we would see that [check_even 255] reduces to a [No], so that the first term is equivalent to [True], which certainly does not unify with [isEven 255]. *) Abort. (** Our tactic [prove_even_reflective] is reflective because it performs a proof search process (a trivial one, in this case) wholly within Gallina, where the only use of Ltac is to translate a goal into an appropriate use of [check_even]. *) (** * Reifying the Syntax of a Trivial Tautology Language *) (** We might also like to have reflective proofs of trivial tautologies like this one: *) Theorem true_galore : (True /\ True) -> (True \/ (True /\ (True -> True))). tauto. Qed. Print true_galore. (** %\vspace{-.15in}% [[ true_galore = fun H : True /\ True => and_ind (fun _ _ : True => or_introl (True /\ (True -> True)) I) H : True /\ True -> True \/ True /\ (True -> True) ]] As we might expect, the proof that [tauto] builds contains explicit applications of natural deduction rules. For large formulas, this can add a linear amount of proof size overhead, beyond the size of the input. To write a reflective procedure for this class of goals, we will need to get into the actual %``%#"#reflection#"#%''% part of %``%#"#proof by reflection.#"#%''% It is impossible to case-analyze a [Prop] in any way in Gallina. We must %\index{reification}\textit{%#<i>#reify#</i>#%}% [Prop] into some type that we %\textit{%#<i>#can#</i>#%}% analyze. This inductive type is a good candidate: *) (* begin thide *) Inductive taut : Set := | TautTrue : taut | TautAnd : taut -> taut -> taut | TautOr : taut -> taut -> taut | TautImp : taut -> taut -> taut. (** We write a recursive function to %\emph{%#<i>#reflect#</i>#%}% this syntax back to [Prop]. Such functions are also called %\index{interpretation function}\emph{%#<i>#interpretation functions#</i>#%}%, and have used them in previous examples to give semantics to small programming languages. *) Fixpoint tautDenote (t : taut) : Prop := match t with | TautTrue => True | TautAnd t1 t2 => tautDenote t1 /\ tautDenote t2 | TautOr t1 t2 => tautDenote t1 \/ tautDenote t2 | TautImp t1 t2 => tautDenote t1 -> tautDenote t2 end. (** It is easy to prove that every formula in the range of [tautDenote] is true. *) Theorem tautTrue : forall t, tautDenote t. induction t; crush. Qed. (** To use [tautTrue] to prove particular formulas, we need to implement the syntax reification process. A recursive Ltac function does the job. *) Ltac tautReify P := match P with | True => TautTrue | ?P1 /\ ?P2 => let t1 := tautReify P1 in let t2 := tautReify P2 in constr:(TautAnd t1 t2) | ?P1 \/ ?P2 => let t1 := tautReify P1 in let t2 := tautReify P2 in constr:(TautOr t1 t2) | ?P1 -> ?P2 => let t1 := tautReify P1 in let t2 := tautReify P2 in constr:(TautImp t1 t2) end. (** With [tautReify] available, it is easy to finish our reflective tactic. We look at the goal formula, reflect it, and apply [tautTrue] to the reflected formula. *) Ltac obvious := match goal with | [ |- ?P ] => let t := tautReify P in exact (tautTrue t) end. (** We can verify that [obvious] solves our original example, with a proof term that does not mention details of the proof. *) (* end thide *) Theorem true_galore' : (True /\ True) -> (True \/ (True /\ (True -> True))). obvious. Qed. Print true_galore'. (** %\vspace{-.15in}% [[ true_galore' = tautTrue (TautImp (TautAnd TautTrue TautTrue) (TautOr TautTrue (TautAnd TautTrue (TautImp TautTrue TautTrue)))) : True /\ True -> True \/ True /\ (True -> True) ]] It is worth considering how the reflective tactic improves on a pure-Ltac implementation. The formula reification process is just as ad-hoc as before, so we gain little there. In general, proofs will be more complicated than formula translation, and the %``%#"#generic proof rule#"#%''% that we apply here %\textit{%#<i>#is#</i>#%}% on much better formal footing than a recursive Ltac function. The dependent type of the proof guarantees that it %``%#"#works#"#%''% on any input formula. This is all in addition to the proof-size improvement that we have already seen. It may also be worth pointing out that our previous example of evenness testing used a function [partialOut] for sound handling of input goals that the verified decision procedure fails to prove. Here, we prove that our procedure [tautTrue] (recall that an inductive proof may be viewed as a recursive procedure) is able to prove any goal representable in [taut], so no extra step is necessary. *) (** * A Monoid Expression Simplifier *) (** Proof by reflection does not require encoding of all of the syntax in a goal. We can insert %``%#"#variables#"#%''% in our syntax types to allow injection of arbitrary pieces, even if we cannot apply specialized reasoning to them. In this section, we explore that possibility by writing a tactic for normalizing monoid equations. *) Section monoid. Variable A : Set. Variable e : A. Variable f : A -> A -> A. Infix "+" := f. Hypothesis assoc : forall a b c, (a + b) + c = a + (b + c). Hypothesis identl : forall a, e + a = a. Hypothesis identr : forall a, a + e = a. (** We add variables and hypotheses characterizing an arbitrary instance of the algebraic structure of monoids. We have an associative binary operator and an identity element for it. It is easy to define an expression tree type for monoid expressions. A [Var] constructor is a %``%#"#catch-all#"#%''% case for subexpressions that we cannot model. These subexpressions could be actual Gallina variables, or they could just use functions that our tactic is unable to understand. *) (* begin thide *) Inductive mexp : Set := | Ident : mexp | Var : A -> mexp | Op : mexp -> mexp -> mexp. (** Next, we write an interpretation function. *) Fixpoint mdenote (me : mexp) : A := match me with | Ident => e | Var v => v | Op me1 me2 => mdenote me1 + mdenote me2 end. (** We will normalize expressions by flattening them into lists, via associativity, so it is helpful to have a denotation function for lists of monoid values. *) Fixpoint mldenote (ls : list A) : A := match ls with | nil => e | x :: ls' => x + mldenote ls' end. (** The flattening function itself is easy to implement. *) Fixpoint flatten (me : mexp) : list A := match me with | Ident => nil | Var x => x :: nil | Op me1 me2 => flatten me1 ++ flatten me2 end. (** [flatten] has a straightforward correctness proof in terms of our [denote] functions. *) Lemma flatten_correct' : forall ml2 ml1, mldenote ml1 + mldenote ml2 = mldenote (ml1 ++ ml2). induction ml1; crush. Qed. Theorem flatten_correct : forall me, mdenote me = mldenote (flatten me). Hint Resolve flatten_correct'. induction me; crush. Qed. (** Now it is easy to prove a theorem that will be the main tool behind our simplification tactic. *) Theorem monoid_reflect : forall me1 me2, mldenote (flatten me1) = mldenote (flatten me2) -> mdenote me1 = mdenote me2. intros; repeat rewrite flatten_correct; assumption. Qed. (** We implement reification into the [mexp] type. *) Ltac reify me := match me with | e => Ident | ?me1 + ?me2 => let r1 := reify me1 in let r2 := reify me2 in constr:(Op r1 r2) | _ => constr:(Var me) end. (** The final [monoid] tactic works on goals that equate two monoid terms. We reify each and change the goal to refer to the reified versions, finishing off by applying [monoid_reflect] and simplifying uses of [mldenote]. Recall that the %\index{tactics!change}%[change] tactic replaces a conclusion formula with another that is definitionally equal to it. *) Ltac monoid := match goal with | [ |- ?me1 = ?me2 ] => let r1 := reify me1 in let r2 := reify me2 in change (mdenote r1 = mdenote r2); apply monoid_reflect; simpl end. (** We can make short work of theorems like this one: *) (* end thide *) Theorem t1 : forall a b c d, a + b + c + d = a + (b + c) + d. intros; monoid. (** [[ ============================ a + (b + (c + (d + e))) = a + (b + (c + (d + e))) ]] Our tactic has canonicalized both sides of the equality, such that we can finish the proof by reflexivity. *) reflexivity. Qed. (** It is interesting to look at the form of the proof. *) Print t1. (** %\vspace{-.15in}% [[ t1 = fun a b c d : A => monoid_reflect (Op (Op (Op (Var a) (Var b)) (Var c)) (Var d)) (Op (Op (Var a) (Op (Var b) (Var c))) (Var d)) (refl_equal (a + (b + (c + (d + e))))) : forall a b c d : A, a + b + c + d = a + (b + c) + d ]] The proof term contains only restatements of the equality operands in reified form, followed by a use of reflexivity on the shared canonical form. *) End monoid. (** Extensions of this basic approach are used in the implementations of the %\index{tactics!ring}%[ring] and %\index{tactics!field}%[field] tactics that come packaged with Coq. *) (** * A Smarter Tautology Solver *) (** Now we are ready to revisit our earlier tautology solver example. We want to broaden the scope of the tactic to include formulas whose truth is not syntactically apparent. We will want to allow injection of arbitrary formulas, like we allowed arbitrary monoid expressions in the last example. Since we are working in a richer theory, it is important to be able to use equalities between different injected formulas. For instance, we cannot prove [P -> P] by translating the formula into a value like [Imp (][Var P) (][Var P)], because a Gallina function has no way of comparing the two [P]s for equality. To arrive at a nice implementation satisfying these criteria, we introduce the %\index{tactics!quote}%[quote] tactic and its associated library. *) Require Import Quote. (* begin thide *) Inductive formula : Set := | Atomic : index -> formula | Truth : formula | Falsehood : formula | And : formula -> formula -> formula | Or : formula -> formula -> formula | Imp : formula -> formula -> formula. (* end thide *) (** The type %\index{Gallina terms!index}%[index] comes from the [Quote] library and represents a countable variable type. The rest of [formula]'s definition should be old hat by now. The [quote] tactic will implement injection from [Prop] into [formula] for us, but it is not quite as smart as we might like. In particular, it interprets implications incorrectly, so we will need to declare a wrapper definition for implication, as we did in the last chapter. *) Definition imp (P1 P2 : Prop) := P1 -> P2. Infix "-->" := imp (no associativity, at level 95). (** Now we can define our denotation function. *) Definition asgn := varmap Prop. (* begin thide *) Fixpoint formulaDenote (atomics : asgn) (f : formula) : Prop := match f with | Atomic v => varmap_find False v atomics | Truth => True | Falsehood => False | And f1 f2 => formulaDenote atomics f1 /\ formulaDenote atomics f2 | Or f1 f2 => formulaDenote atomics f1 \/ formulaDenote atomics f2 | Imp f1 f2 => formulaDenote atomics f1 --> formulaDenote atomics f2 end. (* end thide *) (** The %\index{Gallina terms!varmap}%[varmap] type family implements maps from [index] values. In this case, we define an assignment as a map from variables to [Prop]s. Our reifier [formulaDenote] works with an assignment, and we use the [varmap_find] function to consult the assignment in the [Atomic] case. The first argument to [varmap_find] is a default value, in case the variable is not found. *) Section my_tauto. Variable atomics : asgn. Definition holds (v : index) := varmap_find False v atomics. (** We define some shorthand for a particular variable being true, and now we are ready to define some helpful functions based on the [ListSet] module of the standard library, which (unsurprisingly) presents a view of lists as sets. *) Require Import ListSet. Definition index_eq : forall x y : index, {x = y} + {x <> y}. decide equality. Defined. Definition add (s : set index) (v : index) := set_add index_eq v s. Definition In_dec : forall v (s : set index), {In v s} + {~ In v s}. Local Open Scope specif_scope. intro; refine (fix F (s : set index) : {In v s} + {~ In v s} := match s with | nil => No | v' :: s' => index_eq v' v || F s' end); crush. Defined. (** We define what it means for all members of an index set to represent true propositions, and we prove some lemmas about this notion. *) Fixpoint allTrue (s : set index) : Prop := match s with | nil => True | v :: s' => holds v /\ allTrue s' end. Theorem allTrue_add : forall v s, allTrue s -> holds v -> allTrue (add s v). induction s; crush; match goal with | [ |- context[if ?E then _ else _] ] => destruct E end; crush. Qed. Theorem allTrue_In : forall v s, allTrue s -> set_In v s -> varmap_find False v atomics. induction s; crush. Qed. Hint Resolve allTrue_add allTrue_In. Local Open Scope partial_scope. (** Now we can write a function [forward] which implements deconstruction of hypotheses. It has a dependent type, in the style of Chapter 6, guaranteeing correctness. The arguments to [forward] are a goal formula [f], a set [known] of atomic formulas that we may assume are true, a hypothesis formula [hyp], and a success continuation [cont] that we call when we have extended [known] to hold new truths implied by [hyp]. *) Definition forward : forall (f : formula) (known : set index) (hyp : formula) (cont : forall known', [allTrue known' -> formulaDenote atomics f]), [allTrue known -> formulaDenote atomics hyp -> formulaDenote atomics f]. refine (fix F (f : formula) (known : set index) (hyp : formula) (cont : forall known', [allTrue known' -> formulaDenote atomics f]) : [allTrue known -> formulaDenote atomics hyp -> formulaDenote atomics f] := match hyp with | Atomic v => Reduce (cont (add known v)) | Truth => Reduce (cont known) | Falsehood => Yes | And h1 h2 => Reduce (F (Imp h2 f) known h1 (fun known' => Reduce (F f known' h2 cont))) | Or h1 h2 => F f known h1 cont && F f known h2 cont | Imp _ _ => Reduce (cont known) end); crush. Defined. (** A [backward] function implements analysis of the final goal. It calls [forward] to handle implications. *) (* begin thide *) Definition backward : forall (known : set index) (f : formula), [allTrue known -> formulaDenote atomics f]. refine (fix F (known : set index) (f : formula) : [allTrue known -> formulaDenote atomics f] := match f with | Atomic v => Reduce (In_dec v known) | Truth => Yes | Falsehood => No | And f1 f2 => F known f1 && F known f2 | Or f1 f2 => F known f1 || F known f2 | Imp f1 f2 => forward f2 known f1 (fun known' => F known' f2) end); crush; eauto. Defined. (* end thide *) (** A simple wrapper around [backward] gives us the usual type of a partial decision procedure. *) Definition my_tauto : forall f : formula, [formulaDenote atomics f]. (* begin thide *) intro; refine (Reduce (backward nil f)); crush. Defined. (* end thide *) End my_tauto. (** Our final tactic implementation is now fairly straightforward. First, we [intro] all quantifiers that do not bind [Prop]s. Then we call the [quote] tactic, which implements the reification for us. Finally, we are able to construct an exact proof via [partialOut] and the [my_tauto] Gallina function. *) Ltac my_tauto := repeat match goal with | [ |- forall x : ?P, _ ] => match type of P with | Prop => fail 1 | _ => intro end end; quote formulaDenote; match goal with | [ |- formulaDenote ?m ?f ] => exact (partialOut (my_tauto m f)) end. (* end thide *) (** A few examples demonstrate how the tactic works. *) Theorem mt1 : True. my_tauto. Qed. Print mt1. (** %\vspace{-.15in}% [[ mt1 = partialOut (my_tauto (Empty_vm Prop) Truth) : True ]] We see [my_tauto] applied with an empty [varmap], since every subformula is handled by [formulaDenote]. *) Theorem mt2 : forall x y : nat, x = y --> x = y. my_tauto. Qed. Print mt2. (** %\vspace{-.15in}% [[ mt2 = fun x y : nat => partialOut (my_tauto (Node_vm (x = y) (Empty_vm Prop) (Empty_vm Prop)) (Imp (Atomic End_idx) (Atomic End_idx))) : forall x y : nat, x = y --> x = y ]] Crucially, both instances of [x = y] are represented with the same index, [End_idx]. The value of this index only needs to appear once in the [varmap], whose form reveals that [varmap]s are represented as binary trees, where [index] values denote paths from tree roots to leaves. *) Theorem mt3 : forall x y z, (x < y /\ y > z) \/ (y > z /\ x < S y) --> y > z /\ (x < y \/ x < S y). my_tauto. Qed. Print mt3. (** %\vspace{-.15in}% [[ fun x y z : nat => partialOut (my_tauto (Node_vm (x < S y) (Node_vm (x < y) (Empty_vm Prop) (Empty_vm Prop)) (Node_vm (y > z) (Empty_vm Prop) (Empty_vm Prop))) (Imp (Or (And (Atomic (Left_idx End_idx)) (Atomic (Right_idx End_idx))) (And (Atomic (Right_idx End_idx)) (Atomic End_idx))) (And (Atomic (Right_idx End_idx)) (Or (Atomic (Left_idx End_idx)) (Atomic End_idx))))) : forall x y z : nat, x < y /\ y > z \/ y > z /\ x < S y --> y > z /\ (x < y \/ x < S y) ]] Our goal contained three distinct atomic formulas, and we see that a three-element [varmap] is generated. It can be interesting to observe differences between the level of repetition in proof terms generated by [my_tauto] and [tauto] for especially trivial theorems. *) Theorem mt4 : True /\ True /\ True /\ True /\ True /\ True /\ False --> False. my_tauto. Qed. Print mt4. (** %\vspace{-.15in}% [[ mt4 = partialOut (my_tauto (Empty_vm Prop) (Imp (And Truth (And Truth (And Truth (And Truth (And Truth (And Truth Falsehood)))))) Falsehood)) : True /\ True /\ True /\ True /\ True /\ True /\ False --> False ]] *) Theorem mt4' : True /\ True /\ True /\ True /\ True /\ True /\ False -> False. tauto. Qed. Print mt4'. (** %\vspace{-.15in}% [[ mt4' = fun H : True /\ True /\ True /\ True /\ True /\ True /\ False => and_ind (fun (_ : True) (H1 : True /\ True /\ True /\ True /\ True /\ False) => and_ind (fun (_ : True) (H3 : True /\ True /\ True /\ True /\ False) => and_ind (fun (_ : True) (H5 : True /\ True /\ True /\ False) => and_ind (fun (_ : True) (H7 : True /\ True /\ False) => and_ind (fun (_ : True) (H9 : True /\ False) => and_ind (fun (_ : True) (H11 : False) => False_ind False H11) H9) H7) H5) H3) H1) H : True /\ True /\ True /\ True /\ True /\ True /\ False -> False ]] The traditional [tauto] tactic introduces a quadratic blow-up in the size of the proof term, whereas proofs produced by [my_tauto] always have linear size. *) (** ** Manual Reification of Terms with Variables *) (* begin thide *) (** The action of the [quote] tactic above may seem like magic. Somehow it performs equality comparison between subterms of arbitrary types, so that these subterms may be represented with the same reified variable. While [quote] is implemented in OCaml, we can code the reification process completely in Ltac, as well. To make our job simpler, we will represent variables as [nat]s, indexing into a simple list of variable values that may be referenced. Step one of the process is to crawl over a term, building a duplicate-free list of all values that appear in positions we will encode as variables. A useful helper function adds an element to a list, maintaining lack of duplicates. Note how we use Ltac pattern matching to implement an equality test on Gallina terms; this is simple syntactic equality, not even the richer definitional equality. We also represent lists as nested tuples, to allow different list elements to have different Gallina types. *) Ltac inList x xs := match xs with | tt => false | (x, _) => true | (_, ?xs') => inList x xs' end. Ltac addToList x xs := let b := inList x xs in match b with | true => xs | false => constr:(x, xs) end. (** Now we can write our recursive function to calculate the list of variable values we will want to use to represent a term. *) Ltac allVars xs e := match e with | True => xs | False => xs | ?e1 /\ ?e2 => let xs := allVars xs e1 in allVars xs e2 | ?e1 \/ ?e2 => let xs := allVars xs e1 in allVars xs e2 | ?e1 -> ?e2 => let xs := allVars xs e1 in allVars xs e2 | _ => addToList e xs end. (** We will also need a way to map a value to its position in a list. *) Ltac lookup x xs := match xs with | (x, _) => O | (_, ?xs') => let n := lookup x xs' in constr:(S n) end. (** The next building block is a procedure for reifying a term, given a list of all allowed variable values. We are free to make this procedure partial, where tactic failure may be triggered upon attempting to reflect a term containing subterms not included in the list of variables. The output type of the term is a copy of [formula] where [index] is replaced by [nat], in the type of the constructor for atomic formulas. *) Inductive formula' : Set := | Atomic' : nat -> formula' | Truth' : formula' | Falsehood' : formula' | And' : formula' -> formula' -> formula' | Or' : formula' -> formula' -> formula' | Imp' : formula' -> formula' -> formula'. (** Note that, when we write our own Ltac procedure, we can work directly with the normal [->] operator, rather than needing to introduce a wrapper for it. *) Ltac reifyTerm xs e := match e with | True => Truth' | False => Falsehood' | ?e1 /\ ?e2 => let p1 := reifyTerm xs e1 in let p2 := reifyTerm xs e2 in constr:(And' p1 p2) | ?e1 \/ ?e2 => let p1 := reifyTerm xs e1 in let p2 := reifyTerm xs e2 in constr:(Or' p1 p2) | ?e1 -> ?e2 => let p1 := reifyTerm xs e1 in let p2 := reifyTerm xs e2 in constr:(Imp' p1 p2) | _ => let n := lookup e xs in constr:(Atomic' n) end. (** Finally, we bring all the pieces together. *) Ltac reify := match goal with | [ |- ?G ] => let xs := allVars tt G in let p := reifyTerm xs G in pose p end. (** A quick test verifies that we are doing reification correctly. *) Theorem mt3' : forall x y z, (x < y /\ y > z) \/ (y > z /\ x < S y) -> y > z /\ (x < y \/ x < S y). do 3 intro; reify. (** Our simple tactic adds the translated term as a new variable: [[ f := Imp' (Or' (And' (Atomic' 2) (Atomic' 1)) (And' (Atomic' 1) (Atomic' 0))) (And' (Atomic' 1) (Or' (Atomic' 2) (Atomic' 0))) : formula' ]] *) Abort. (** More work would be needed to complete the reflective tactic, as we must connect our new syntax type with the real meanings of formulas, but the details are the same as in our prior implementation with [quote]. *) (* end thide *) (** * Exercises *) (** remove printing * *) (** %\begin{enumerate}%#<ol># %\item%#<li># Implement a reflective procedure for normalizing systems of linear equations over rational numbers. In particular, the tactic should identify all hypotheses that are linear equations over rationals where the equation righthand sides are constants. It should normalize each hypothesis to have a lefthand side that is a sum of products of constants and variables, with no variable appearing multiple times. Then, your tactic should add together all of these equations to form a single new equation, possibly clearing the original equations. Some coefficients may cancel in the addition, reducing the number of variables that appear. To work with rational numbers, import module [QArith] and use [Local Open Scope Q_scope]. All of the usual arithmetic operator notations will then work with rationals, and there are shorthands for constants 0 and 1. Other rationals must be written as [num # den] for numerator [num] and denominator [den]. Use the infix operator [==] in place of [=], to deal with different ways of expressing the same number as a fraction. For instance, a theorem and proof like this one should work with your tactic: [[ Theorem t2 : forall x y z, (2 # 1) * (x - (3 # 2) * y) == 15 # 1 -> z + (8 # 1) * x == 20 # 1 -> (-6 # 2) * y + (10 # 1) * x + z == 35 # 1. intros; reifyContext; assumption. Qed. ]] Your solution can work in any way that involves reifying syntax and doing most calculation with a Gallina function. These hints outline a particular possible solution. Throughout, the [ring] tactic will be helpful for proving many simple facts about rationals, and tactics like [rewrite] are correctly overloaded to work with rational equality [==]. %\begin{enumerate}%#<ol># %\item%#<li># Define an inductive type [exp] of expressions over rationals (which inhabit the Coq type [Q]). Include variables (represented as natural numbers), constants, addition, subtraction, and multiplication.#</li># %\item%#<li># Define a function [lookup] for reading an element out of a list of rationals, by its position in the list.#</li># %\item%#<li># Define a function [expDenote] that translates [exp]s, along with lists of rationals representing variable values, to [Q].#</li># %\item%#<li># Define a recursive function [eqsDenote] over [list (exp * Q)], characterizing when all of the equations are true.#</li># %\item%#<li># Fix a representation [lhs] of flattened expressions. Where [len] is the number of variables, represent a flattened equation as [ilist Q len]. Each position of the list gives the coefficient of the corresponding variable.#</li># %\item%#<li># Write a recursive function [linearize] that takes a constant [k] and an expression [e] and optionally returns an [lhs] equivalent to [k * e]. This function returns [None] when it discovers that the input expression is not linear. The parameter [len] of [lhs] should be a parameter of [linearize], too. The functions [singleton], [everywhere], and [map2] from [DepList] will probably be helpful. It is also helpful to know that [Qplus] is the identifier for rational addition.#</li># %\item%#<li># Write a recursive function [linearizeEqs : list (exp * Q) -> option (lhs * Q)]. This function linearizes all of the equations in the list in turn, building up the sum of the equations. It returns [None] if the linearization of any constituent equation fails.#</li># %\item%#<li># Define a denotation function for [lhs].#</li># %\item%#<li># Prove that, when [exp] linearization succeeds on constant [k] and expression [e], the linearized version has the same meaning as [k * e].#</li># %\item%#<li># Prove that, when [linearizeEqs] succeeds on an equation list [eqs], then the final summed-up equation is true whenever the original equation list is true.#</li># %\item%#<li># Write a tactic [findVarsHyps] to search through all equalities on rationals in the context, recursing through addition, subtraction, and multiplication to find the list of expressions that should be treated as variables. This list should be suitable as an argument to [expDenote] and [eqsDenote], associating a [Q] value to each natural number that stands for a variable.#</li># %\item%#<li># Write a tactic [reify] to reify a [Q] expression into [exp], with respect to a given list of variable values.#</li># %\item%#<li># Write a tactic [reifyEqs] to reify a formula that begins with a sequence of implications from linear equalities whose lefthand sides are expressed with [expDenote]. This tactic should build a [list (exp * Q)] representing the equations. Remember to give an explicit type annotation when returning a nil list, as in [constr:(][@][nil (exp * Q))].#</li># %\item%#<li># Now this final tactic should do the job: [[ Ltac reifyContext := let ls := findVarsHyps in repeat match goal with | [ H : ?e == ?num # ?den |- _ ] => let r := reify ls e in change (expDenote ls r == num # den) in H; generalize H end; match goal with | [ |- ?g ] => let re := reifyEqs g in intros; let H := fresh "H" in assert (H : eqsDenote ls re); [ simpl in *; tauto | repeat match goal with | [ H : expDenote _ _ == _ |- _ ] => clear H end; generalize (linearizeEqsCorrect ls re H); clear H; simpl; match goal with | [ |- ?X == ?Y -> _ ] => ring_simplify X Y; intro end ] end. ]] #</ol>#%\end{enumerate}% #</li># #</ol>#%\end{enumerate}% *)