Module CSClocking

From Coq Require Import List.
Import List.ListNotations.
Open Scope list_scope.

From Velus Require Import Common.
From Velus Require Import CommonTyping.
From Velus Require Import Environment.
From Velus Require Import Operators.
From Velus Require Import Clocks.
From Velus Require Import Fresh.
From Velus Require Import Lustre.StaticEnv.
From Velus Require Import Lustre.LSyntax.
From Velus Require Import Lustre.LClocking.
From Velus Require Import Lustre.ClockSwitch.ClockSwitch.
From Velus Require Import Lustre.SubClock.SCClocking.

Module Type CSCLOCKING
       (Import Ids : IDS)
       (Import Op : OPERATORS)
       (OpAux : OPERATORS_AUX Ids Op)
       (Import Cks : CLOCKS Ids Op OpAux)
       (Import Senv : STATICENV Ids Op OpAux Cks)
       (Import Syn : LSYNTAX Ids Op OpAux Cks Senv)
       (Import Clo : LCLOCKING Ids Op OpAux Cks Senv Syn)
       (Import CS : CLOCKSWITCH Ids Op OpAux Cks Senv Syn).

  Module Import SCC := SCClockingFun Ids Op OpAux Cks Senv Syn Clo SC. Import SC.

  Import Fresh Facts Tactics.

  Section switch_block.

    Context {PSyn : list decl -> block -> Prop} {prefs : PS.t}.
    Variable G : @global PSyn prefs.

    Hypothesis HwG : wc_global G.

    Import Permutation.

    Lemma cond_eq_wc Γ : forall e ty ck x xcs eqs' st st',
        wc_exp G Γ e ->
        clockof e = [ck] ->
        cond_eq e ty ck st = (x, xcs, eqs', st') ->
        Forall (wc_equation G (Γ++senv_of_tyck xcs)) eqs'.
    Proof.
      intros * Hwc Hck Hcond; destruct e; repeat inv_bind.
      3:destruct a; repeat inv_bind; auto.
      all:constructor; auto; rewrite Permutation_app_comm; simpl.
      all:(constructor; [constructor; auto; eapply wc_exp_incl in Hwc; eauto;
                         intros * Hl; inv Hl; econstructor; eauto with datatypes|]).
      all:simpl; try take (_ = [_]) and rewrite it; try rewrite app_nil_r; eauto.
      all:constructor; eauto with senv datatypes.
    Qed.

    Lemma cond_eq_wc_clock Γ : forall e ty ck x xcs eqs' st st',
        wc_clock Γ ck ->
        cond_eq e ty ck st = (x, xcs, eqs', st') ->
        Forall (wc_clock Γ) (map snd (Common.idck xcs)).
    Proof.
      intros * Hck Hcond; destruct e; repeat inv_bind; simpl; auto.
      destruct a; repeat inv_bind; simpl; auto.
    Qed.

    Lemma cond_eq_In Γ : forall e ty ck x xcs eqs' st st',
        wc_exp G Γ e ->
        clockof e = [ck] ->
        cond_eq e ty ck st = (x, xcs, eqs', st') ->
        HasClock (Γ ++ senv_of_tyck xcs) x ck.
    Proof.
      intros * Hwc Hck Hcond; destruct e; repeat inv_bind; simpl in *; eauto with senv datatypes.
      inv Hwc. repeat inv_bind.
      inv Hck; eauto with senv datatypes.
    Qed.

    Lemma new_idents_wc Γ' : forall ck x ty k ids ids' st st',
        wc_clock Γ' ck ->
        In (x, ck) Γ' ->
        new_idents ck x ty k ids st = (ids', st') ->
        Forall (fun '(_, _, (_, ck)) => wc_clock Γ' ck) ids'.
    Proof.
      intros * Hck Hin Hni.
      unfold new_idents in *. eapply mmap_values, Forall2_ignore1 in Hni.
      simpl_Forall. simpl_In. simpl_Forall. repeat inv_bind.
      econstructor; eauto.
    Qed.

    Lemma when_free_wc Γ : forall x y ty ck cx tx k,
        HasClock Γ x ck ->
        HasClock Γ y (Con ck cx (tx, k)) ->
        HasClock Γ cx ck ->
        wc_block G Γ (when_free x y ty ck cx tx k).
    Proof.
      intros.
      repeat constructor; simpl; auto.
    Qed.

    Lemma merge_defs_wc Γ : forall sub y ty ck x tx xcs,
        HasClock Γ x ck ->
        HasClock Γ (rename_var sub y) ck ->
        xcs <> [] ->
        Forall (fun '(k, sub) => HasClock Γ (rename_var sub y) (Con ck x (tx, k))) xcs ->
        wc_block G Γ (merge_defs sub y ty ck x tx xcs).
    Proof.
      intros * Hin1 Hin2 Hcon Hnnil.
      repeat constructor; auto.
      - destruct xcs; simpl in *; try congruence.
      - rewrite Forall_map. eapply Forall_impl; [|eauto]; intros (?&?) ?.
        repeat constructor; auto.
      - rewrite Forall_map. eapply Forall_forall; intros (?&?) Hin; simpl.
        repeat constructor.
      - rewrite Forall_map. eapply Forall_forall; intros (?&?) Hin; simpl; auto.
    Qed.

    Lemma new_idents_In : forall x ck cx ty k ids1 ids2 nids1 nids2 st1 st2 st3 st4,
        NoDupMembers (ids1++ids2) ->
        InMembers x (ids1++ids2) ->
        new_idents ck cx ty k ids1 st1 = (nids1, st2) ->
        new_idents ck cx ty k ids2 st3 = (nids2, st4) ->
        In (rename_var (Env.from_list (map (fun '(x, y, _) => (x, y)) (nids1 ++ nids2))) x, Con ck cx (ty, k))
           (map (fun '(_, x, (_, ck)) => (x, ck)) (nids1++nids2)).
    Proof.
      intros * Hnd Hinm Hni1 Hni2.
      assert (NoDupMembers (map (fun '(x, y, _) => (x, y)) (nids1 ++ nids2))) as Hnd'.
      { erewrite fst_NoDupMembers, map_map, map_ext, map_app, 2 new_idents_old; eauto.
        rewrite <-map_app, <-fst_NoDupMembers; auto.
        intros ((?&?)&?&?); auto. }
      eapply mmap_values, Forall2_ignore2 in Hni1.
      eapply mmap_values, Forall2_ignore2 in Hni2.
      apply InMembers_In in Hinm as (?&Hin).
      apply in_app_iff in Hin as [Hin|Hin]; eapply Forall_forall in Hin; eauto; simpl in *.
      1,2:destruct Hin as (((?&?)&?&?)&Hin&?&?&?); repeat inv_bind.
      - eapply in_map_iff. do 2 esplit; eauto with datatypes; simpl.
        f_equal; auto.
        unfold rename_var. erewrite Env.find_In_from_list; eauto.
        2:solve_In; eauto with datatypes; auto. auto.
      - eapply in_map_iff. do 2 esplit; eauto with datatypes; simpl.
        f_equal; auto.
        unfold rename_var. erewrite Env.find_In_from_list; eauto.
        2:eapply in_map_iff; do 2 esplit; eauto with datatypes; auto. auto.
    Qed.

    Lemma new_idents_In_inv_ck : forall ck cx tx k ids nids st st' x y ck1 ty,
        new_idents ck cx tx k ids st = (nids, st') ->
        In (x, y, (ty, ck1)) nids ->
        ck1 = Con ck cx (tx, k).
    Proof.
      intros * Hni Hin.
      eapply mmap_values, Forall2_ignore1, Forall_forall in Hni; eauto.
      destruct Hni as ((?&?)&?&?&?&?); repeat inv_bind; eauto.
    Qed.

    Lemma switch_scope_wc {A} P_na P_nd P_wc f_switch :
      forall locs (blk: A) bck sub Γck Γck' s' st st',
        (forall x, ~ IsLast Γck x) ->
        (forall x, Env.In x sub -> InMembers x Γck) ->
        (forall x y ck, Env.find x sub = Some y -> HasClock Γck x ck -> HasClock Γck' y (subclock_clock bck sub ck)) ->
        (forall x ck, Env.find x sub = None -> HasClock Γck x ck -> HasClock Γck' x (subclock_clock bck sub ck)) ->
        NoDupMembers Γck ->
        wc_env (idck Γck) ->
        wc_clock (idck Γck') bck ->
        noauto_scope P_na (Scope locs blk) ->
        NoDupScope P_nd (map fst Γck) (Scope locs blk) ->
        wc_scope P_wc G Γck (Scope locs blk) ->
        switch_scope f_switch Γck bck sub (Scope locs blk) st = (s', st') ->
        (forall Γck Γck' blk' st st',
            (forall x, ~ IsLast Γck x) ->
            (forall x, Env.In x sub -> InMembers x Γck) ->
            (forall x y ck, Env.find x sub = Some y -> HasClock Γck x ck -> HasClock Γck' y (subclock_clock bck sub ck)) ->
            (forall x ck, Env.find x sub = None -> HasClock Γck x ck -> HasClock Γck' x (subclock_clock bck sub ck)) ->
            NoDupMembers Γck ->
            wc_env (idck Γck) ->
            wc_clock (idck Γck') bck ->
            P_na blk ->
            P_nd (map fst Γck) blk ->
            P_wc Γck blk ->
            f_switch Γck blk st = (blk', st') ->
            P_wc Γck' blk') ->
        wc_scope P_wc G Γck' s'.
    Proof.
      intros * Hnl1 Hsubin Hsub Hnsub Hnd1 Hwenv Hbck Hnl2 Hnd3 Hwt Hswitch Hind;
        inv Hnl2; inv Hnd3; inv Hwt; subst Γ'; repeat inv_bind; simpl in *.
      take (forall x, InMembers x locs -> ~_) and rename it into Hdisj.
      econstructor; eauto.
      - simpl_Forall; subst.
        eapply subclock_clock_wc; eauto.
        * intros * Hfind Hin. rewrite HasClock_app in *. destruct Hin as [Hin|Hin]; eauto.
          exfalso. simpl_In.
          eapply Env.find_In, Hsubin, fst_InMembers, Hdisj in Hfind; eauto.
          inv Hin; solve_In.
        * intros * Hfind Hin. rewrite HasClock_app in *. destruct Hin as [Hin|Hin]; eauto.
          right. inv Hin; simpl_In; econstructor. solve_In. auto.
        * eapply wc_clock_incl; eauto; repeat solve_incl_app.
      - simpl_Forall. subst; auto.
      - eapply Hind with (Γck:=Γck++senv_of_decls _); eauto.
        + rewrite NoLast_app. split; auto; intros * Hil.
          inv Hil. simpl_In. simpl_Forall; subst; simpl in *; congruence.
        + intros ? Hin. apply InMembers_app; auto.
        + intros ??? Hfind Hin.
          repeat rewrite HasClock_app in *. destruct Hin as [Hin|Hin]; eauto.
          exfalso. eapply Env.find_In, Hsubin, fst_InMembers in Hfind; eauto.
          inv Hin. simpl_In.
          assert (HasClock Γck x0 a.(clo)) as Hty by eauto with senv. inv Hty.
          eapply Hdisj; eauto using In_InMembers. solve_In.
        + intros ??? Hin.
          repeat rewrite HasClock_app in *. destruct Hin as [Hin|Hin]; eauto.
          right. inv Hin. simpl_In. econstructor; solve_In; auto.
        + apply NoDupMembers_app; auto. rewrite NoDupMembers_senv_of_decls; auto.
          intros ? Hinm1 Hinm2. simpl_In.
          eapply Hdisj; solve_In.
        + simpl_app. apply wc_env_app; auto.
          simpl_Forall; auto.
        + eapply wc_clock_incl; [|eauto]. solve_incl_app.
        + rewrite map_app, map_fst_senv_of_decls. auto.
    Qed.

    Lemma switch_block_wc : forall blk bck sub Γ Γ' blk' st st',
        (forall x, ~IsLast Γ x) ->
        (forall x, Env.In x sub -> InMembers x Γ) ->
        (forall x y ck, Env.find x sub = Some y -> HasClock Γ x ck -> HasClock Γ' y (subclock_clock bck sub ck)) ->
        (forall x ck, Env.find x sub = None -> HasClock Γ x ck -> HasClock Γ' x (subclock_clock bck sub ck)) ->
        NoDupMembers Γ ->
        wc_env (idck Γ) ->
        wc_clock (idck Γ') bck ->
        noauto_block blk ->
        NoDupLocals (map fst Γ) blk ->
        wc_block G Γ blk ->
        switch_block Γ bck sub blk st = (blk', st') ->
        wc_block G Γ' blk'.
    Proof.
      Opaque switch_scope.
      induction blk using block_ind2; intros * Hnl1 Hsubin Hsub Hnsub Hnd1 Hwenv Hbck Hnl2 Hnd2 Hwc Hsw;
        inv Hnl2; inv Hnd2; inv Hwc; repeat inv_bind; simpl in *.
      - (* equation *)
        constructor. eapply subclock_equation_wc; eauto.

      - (* reset *)
        econstructor; eauto using subclock_exp_wc.
        2:rewrite subclock_exp_clockof, H7; simpl; eauto.
        apply mmap_values, Forall2_ignore1 in H0.
        simpl_Forall. eapply H; eauto.

      - (* switch *)
        destruct (partition _ _) eqn:Hpart; repeat inv_bind.
        apply partition_Partition in Hpart.
        destruct x; repeat inv_bind.
        assert (wc_clock (idck Γ') (subclock_clock bck sub ck)) as Hck'.
        { eapply subclock_clock_wc; eauto.
          eapply wc_exp_clockof in H4; eauto.
          rewrite H5 in H4. apply Forall_singl in H4; auto. }
        rewrite subclock_exp_clockof, H5 in *; simpl in *.

        assert (HasClock (Γ' ++ senv_of_tyck l1) i (subclock_clock bck sub ck)) as Hini.
        { eapply cond_eq_In in H0; eauto using subclock_exp_wc.
          rewrite subclock_exp_clockof, H5; simpl; auto. }

        assert (NoDupMembers (filter (fun '(_, ann) => ann.(clo) ==b ck) l0 ++ l)) as Hnd'.
        { rewrite Permutation_app_comm.
          eapply switch_block_NoDupMembers_env; eauto. }

        do 2 econstructor; eauto; repeat rewrite idty_app; repeat rewrite idck_app; repeat rewrite map_app; repeat rewrite Forall_app; repeat split.
        + eapply cond_eq_wc_clock in H0; eauto.
          unfold idty, idck. simpl_Forall.
          eapply Forall_forall in H0; [|solve_In].
          eapply wc_clock_incl; eauto. solve_incl_app.
        + eapply cond_eq_In in H0; eauto using subclock_exp_wc.
          2:{ rewrite subclock_exp_clockof, H5; simpl; auto. }
          clear - H0 H2 H5 Hck'.
          eapply Forall_impl. intros ??.
          1:{ eapply wc_clock_incl with (vars:=idck (Γ'++senv_of_tyck l1)); eauto.
              simpl_app. apply incl_appr', incl_appl.
              intros ? Hin; solve_In. }
          eapply mmap_values, Forall2_ignore1 in H2. inv H0.
          simpl_Forall. simpl_In. simpl_Forall. repeat inv_bind.
          apply in_app_iff in Hin0 as [Hin0|Hin0].
          * eapply new_idents_wc in H2. simpl_Forall; eauto.
            2:solve_In; eauto; congruence.
            eapply wc_clock_incl; eauto. solve_incl_app.
          * eapply new_idents_wc in H3. simpl_Forall; eauto.
            2:solve_In; eauto; congruence.
            eapply wc_clock_incl; eauto. solve_incl_app.
        + simpl_Forall; auto.
        + simpl_Forall; simpl_In; auto.
        + simpl_Forall.
          eapply merge_defs_wc; eauto.
          * simpl_app. repeat rewrite HasClock_app in *. destruct Hini as [Hini|Hini]; eauto.
            right; left; inv Hini; simpl_In. econstructor; solve_In; auto.
          * rewrite HasClock_app; left.
            eapply rename_var_wc; eauto.
            assert (Is_defined_in i0 (Bswitch ec branches)) as Hdef.
            { eapply vars_defined_Is_defined_in.
              eapply Partition_Forall1, Forall_forall in Hpart; eauto; simpl in *.
              apply PSF.mem_2; auto. }
            inv Hdef. simpl_Exists. simpl_Forall.
            repeat (Syn.inv_branch || Clo.inv_branch). simpl_Exists. simpl_Forall.
            take (Is_defined_in _ _) and eapply wc_block_Is_defined_in in it; eauto.
            simpl_In.
            eapply H7; eauto with senv.
          * apply mmap_length in H2. destruct x, branches; simpl in *; try congruence.
          * eapply mmap_values, Forall2_ignore1 in H2. simpl_Forall.
            simpl_app. rewrite 2 HasClock_app. do 2 right. repeat inv_bind.
            eapply new_idents_In with (ids1:=filter _ _) in H14; eauto.
            2:eapply InMembers_app, or_intror, In_InMembers; eauto.
            simpl_In. econstructor; solve_In; eauto.
        + eapply CS.mmap2_values in H8. eapply mmap_values, Forall3_ignore3' with (zs:=x3) in H2.
          2:{ eapply Forall3_length in H8 as (?&?); congruence. }
          2:{ eapply mmap_length in H2; eauto. }
          eapply Forall3_Forall3 in H2; eauto. clear H8.
          apply Forall_concat. eapply Forall3_ignore12 in H2. simpl_Forall.
          repeat inv_branch. repeat inv_bind.

          assert (forall x, InMembers x (map (fun '(x, y, _) => (x, y)) (l3 ++ l2)) ->
                       InMembers x (filter (fun '(_, ann) => ann.(clo) ==b ck) l0 ++ l)) as Hinminv.
          { intros ? Hinm. rewrite fst_InMembers in Hinm. rewrite fst_InMembers.
            erewrite map_app, <-2 new_idents_old, <-map_app; eauto.
            erewrite map_map, map_ext in Hinm; eauto. intros ((?&?)&(?&?)); auto.
          }

          take (In _ (_ ++ _)) and apply in_app_iff in it as [Hinblks|Hinblks]; simpl_In; simpl_Forall.
          *{ eapply mmap_values, Forall2_ignore1 in H12.
             repeat (Syn.inv_branch || Clo.inv_branch). simpl_Forall.
             eapply H in H3; eauto.
             - intros * Hnl. eapply Hnl1. inv Hnl; simpl_In.
               econstructor.
               apply Partition_Permutation in Hpart. rewrite Hpart.
               rewrite in_app_iff in *. destruct Hin; simpl_In; eauto. auto.
             - intros ? Hin. erewrite Env.In_from_list in Hin.
               erewrite Permutation_app_comm, fst_InMembers, map_map, map_ext, <-fst_InMembers; auto.
               intros (?&?); auto.
             - intros * Hfind Hin. inv Hin. simpl_In.
               eapply new_idents_In with (ids1:=filter _ _) in H13; eauto.
               2:{ eapply Env.find_In, Env.In_from_list in Hfind; eauto. }
               unfold rename_var in H13. rewrite Hfind in H13. simpl_In. simpl_app. simpl_In.
               do 2 right. econstructor. solve_In; eauto. auto.
             - intros ?? Hfind Hin. exfalso.
               assert (Hnin:=Hfind). rewrite <-Env.Props.P.F.not_find_in_iff, Env.In_from_list in Hnin.
               eapply Hnin. inv Hin.
               erewrite fst_InMembers, map_map, map_ext, map_app, 2 new_idents_old; eauto.
               2:intros; destruct_conjs; auto.
               rewrite Permutation_app_comm, <-map_app. solve_In.
             - erewrite fst_NoDupMembers, map_map, <-map_ext, <-fst_NoDupMembers; eauto. 2:intros (?&?); auto.
               now rewrite Permutation_app_comm.
             - apply Forall_map, Forall_map, Forall_forall; intros (?&?) ?; simpl; auto with clocks.
             - constructor.
               + eapply wc_clock_incl; eauto. solve_incl_app.
               + simpl_app. repeat rewrite in_app_iff; auto.
                 destruct Hini as [Hini|Hini]; inv Hini; [left|right;left]; solve_In.
                 congruence.
             - eapply NoDupLocals_incl; eauto.
               apply Partition_Permutation in Hpart. rewrite Hpart.
               rewrite map_map, 2 map_app.
               apply incl_app; [apply incl_appl|apply incl_appr].
               + erewrite map_ext; try reflexivity. intros (?&?); auto.
               + erewrite map_ext; try eapply incl_map, incl_filter', incl_refl.
                 intros (?&?); auto.
             - eapply wc_block_incl; [| |eauto]; intros * Hin.
               + eapply H7 in Hin as (Hin&?); subst.
                 apply Partition_Permutation in Hpart. rewrite Hpart, HasClock_app in Hin.
                 rewrite map_app, HasClock_app.
                 destruct Hin as [Hin|Hin]; inv Hin; [left|right]; econstructor; solve_In.
                 1,3:reflexivity. apply equiv_decb_refl.
               + exfalso. eapply Hnl1; eauto.
           }
          *{ simpl_Forall.
             eapply when_free_wc.
             - eapply HasClock_app, or_introl, rename_var_wc; eauto.
               eapply new_idents_In_inv in H10 as (?&?&?); eauto; subst.
               simpl_In. rewrite equiv_decb_equiv in Hf. inv Hf.
               apply Partition_Permutation in Hpart. rewrite Hpart.
               apply HasClock_app; eauto with senv.
             - simpl_app. rewrite 2 HasClock_app. do 2 right.
               eapply new_idents_In_inv_ck in H10; eauto. rewrite <-H10; clear H10.
               econstructor; solve_In; eauto with datatypes. simpl; auto. auto.
             - simpl_app. repeat rewrite HasClock_app in *. destruct Hini as [Hini|Hini]; eauto.
               right; left; inv Hini; simpl_In. econstructor; solve_In; auto.
           }
        + simpl_Forall.
          eapply cond_eq_wc in H0; eauto using subclock_exp_wc. simpl_Forall.
          2:repeat rewrite subclock_exp_clockof, H5; simpl; auto.
          constructor. eapply wc_equation_incl; [| |eauto]; intros * Hin.
          * simpl_app. repeat rewrite HasClock_app in *. destruct Hin as [|Hin]; [|right;left]; auto.
            inv Hin; simpl_In; econstructor; solve_In. auto.
          * rewrite IsLast_app in *. destruct Hin as [|Hin]; auto.
            exfalso. inv Hin. simpl_In. congruence.

      - (* local *)
        constructor.
        eapply switch_scope_wc; eauto.
        intros; simpl in *.
        apply mmap_values, Forall2_ignore1 in H14. simpl_Forall; eauto.
        Transparent switch_scope.
    Qed.

  End switch_block.

  Fact subclock_clock_idem : forall ck,
    subclock_clock Cbase (Env.empty ident) ck = ck.
  Proof.
    induction ck; simpl; auto.
    unfold rename_var. rewrite Env.gempty; simpl.
    f_equal; auto.
  Qed.

  Lemma switch_node_wc G1 G2 : forall n,
      wc_global G1 ->
      global_iface_incl G1 G2 ->
      wc_node G1 n ->
      wc_node G2 (switch_node n).
  Proof.
    intros * HwG Heq Wc. inv Wc; subst Γ.
    pose proof (n_syn n) as Hsyn. inv Hsyn.
    constructor; auto.
    - simpl_Forall. subst. auto.
    - eapply iface_incl_wc_block; eauto.
      eapply switch_block_wc in H2; eauto using node_NoDupMembers, node_NoDupLocals with clocks.
      + apply NoLast_app; split; auto using senv_of_ins_NoLast.
        intros * L. inv L. simpl_In. simpl_Forall. subst; simpl in *; congruence.
      + intros ? Hin. apply Env.Props.P.F.empty_in_iff in Hin. inv Hin.
      + intros ??? Hfind. rewrite Env.gempty in Hfind. congruence.
      + intros ?? _ Hin. rewrite subclock_clock_idem; auto.
      + unfold idck, senv_of_ins, senv_of_decls. erewrite map_app, 2 map_map, map_ext, map_ext with (l:=n_out n); eauto.
        1,2:unfold decl; intros; destruct_conjs; auto.
      + eapply surjective_pairing.
  Qed.

  Lemma switch_global_wc : forall G,
      wc_global G ->
      wc_global (switch_global G).
  Proof.
    intros []. unfold wc_global, CommonTyping.wt_program; simpl.
    induction nodes0; intros * Hwc; simpl; inv Hwc; auto with datatypes.
    destruct H1.
    constructor; [constructor|].
    - eapply switch_node_wc; eauto.
      2:eapply iface_eq_iface_incl, switch_global_iface_eq.
      eapply H2; eauto.
    - rewrite Forall_map. eapply Forall_impl; [|eapply H0]; intros.
      simpl; eauto.
    - eapply IHnodes0; eauto.
  Qed.

End CSCLOCKING.

Module CSClockingFun
       (Ids : IDS)
       (Op : OPERATORS)
       (OpAux : OPERATORS_AUX Ids Op)
       (Cks : CLOCKS Ids Op OpAux)
       (Senv : STATICENV Ids Op OpAux Cks)
       (Syn : LSYNTAX Ids Op OpAux Cks Senv)
       (Clo : LCLOCKING Ids Op OpAux Cks Senv Syn)
       (CS : CLOCKSWITCH Ids Op OpAux Cks Senv Syn)
       <: CSCLOCKING Ids Op OpAux Cks Senv Syn Clo CS.
  Include CSCLOCKING Ids Op OpAux Cks Senv Syn Clo CS.
End CSClockingFun.
Generated by coq2html