Section CR.
Open Scope recurrence_scope.
Inductive CR :=
| liftBRToCR: BR -> CR
| recurCR: R -> (R -> R -> R) -> CR -> CR
.
(** Interpret a CR as nested BRs as described in section 2 - Chains of Recurrences *)
Fixpoint CR_to_BR (cr: CR): BR :=
match cr with
| liftBRToCR br =>  br
| recurCR r0 bop cr' => mkBR r0 bop (evalAtIx (CR_to_BR cr'))
end.
Definition evalCR(cr: CR) (n: nat): R := (CR_to_BR cr) # n.
(** Define what it means to evaluate a CR *)
Global Instance loopVariantCR : LoopVariant CR R :=
{
evalAtIx (cr: CR) (n: nat) := evalCR cr n
}.
Hint Resolve creval_lift_br_to_cr_inverses: Recurrence.
Hint Rewrite @evalCR_zero: Recurrence.
Hint Rewrite @evalCR_step: Recurrence.
(** Now that we know what happens at 0 and inductive case, we're done *)
Opaque evalCR.
Hint Resolve add_const_to_CR : Recurrence.
Hint Rewrite @add_const_to_CR : Recurrence.
(** Theory of pure CRs (CRs that have only one binary operator *)
Inductive PureCR (bop: R -> R -> R): Type :=
| PureBR: R -> R -> PureCR bop
|  PureCRRec:
R ->
PureCR bop ->
PureCR bop
.
(** Convert a `PureCR` into a CR by inserting the correct `bop` everywhere *)
Fixpoint purecr_to_cr (bop: R -> R -> R) (pure: PureCR bop): CR :=
match pure with
| PureBR r1 r2 => liftBRToCR (mkBR r1 bop (const r2))
| PureCRRec r cr' => (recurCR r bop (purecr_to_cr cr'))
end.

(** Give a way to simplify the evaluation of a PureBR *)
Lemma purecr_to_cr_eval_cr_inverses:
forall `{Ring R}
(bop: R -> R -> R)
(r1 r2: R)
(n: nat),
purecr_to_cr (PureBR bop r1 r2) # n =  {{r1, bop, (const r2)}} # n.