theory Nominal2

imports 

  Nominal2_Base Nominal2_Eqvt Nominal2_Abs

uses ("nominal_dt_rawfuns.ML")

     ("nominal_dt_alpha.ML")

     ("nominal_dt_quot.ML")

     ("nominal_induct.ML")

begin

use "nominal_dt_rawfuns.ML"

ML {* open Nominal_Dt_RawFuns *}

use "nominal_dt_alpha.ML"

ML {* open Nominal_Dt_Alpha *}

use "nominal_dt_quot.ML"

ML {* open Nominal_Dt_Quot *}

(*****************************************)

(* setup for induction principles method *)

use "nominal_induct.ML"

method_setup nominal_induct =

  {* NominalInduct.nominal_induct_method *}

  {* nominal induction *}

ML {*

val eqvt_attr = Attrib.internal (K Nominal_ThmDecls.eqvt_add)

val rsp_attr = Attrib.internal (K Quotient_Info.rsp_rules_add)

val simp_attr = Attrib.internal (K Simplifier.simp_add)

*}

section{* Interface for nominal_datatype *}

ML {* print_depth 50 *}

ML {*

fun get_cnstrs dts =

  map (fn (_, _, _, constrs) => constrs) dts

fun get_typed_cnstrs dts =

  flat (map (fn (_, bn, _, constrs) => 

   (map (fn (bn', _, _) => (Binding.name_of bn, Binding.name_of bn')) constrs)) dts)

fun get_cnstr_strs dts =

  map (fn (bn, _, _) => Binding.name_of bn) (flat (get_cnstrs dts))

fun get_bn_fun_strs bn_funs =

  map (fn (bn_fun, _, _) => Binding.name_of bn_fun) bn_funs

*}

text {* Infrastructure for adding "_raw" to types and terms *}

ML {*

fun add_raw s = s ^ "_raw"

fun add_raws ss = map add_raw ss

fun raw_bind bn = Binding.suffix_name "_raw" bn

fun replace_str ss s = 

  case (AList.lookup (op=) ss s) of 

     SOME s' => s'

   | NONE => s

fun replace_typ ty_ss (Type (a, Ts)) = Type (replace_str ty_ss a, map (replace_typ ty_ss) Ts)

  | replace_typ ty_ss T = T  

fun raw_dts ty_ss dts =

let

  fun raw_dts_aux1 (bind, tys, mx) =

    (raw_bind bind, map (replace_typ ty_ss) tys, mx)

  fun raw_dts_aux2 (ty_args, bind, mx, constrs) =

    (ty_args, raw_bind bind, mx, map raw_dts_aux1 constrs)

in

  map raw_dts_aux2 dts

end

fun replace_aterm trm_ss (Const (a, T)) = Const (replace_str trm_ss a, T)

  | replace_aterm trm_ss (Free (a, T)) = Free (replace_str trm_ss a, T)

  | replace_aterm trm_ss trm = trm

fun replace_term trm_ss ty_ss trm =

  trm |> Term.map_aterms (replace_aterm trm_ss) |> map_types (replace_typ ty_ss) 

*}

ML {*

fun rawify_dts dt_names dts dts_env =

let

  val raw_dts = raw_dts dts_env dts

  val raw_dt_names = add_raws dt_names

in

  (raw_dt_names, raw_dts)

end 

*}

ML {*

fun rawify_bn_funs dts_env cnstrs_env bn_fun_env bn_funs bn_eqs =

let

  val bn_funs' = map (fn (bn, ty, mx) => 

    (raw_bind bn, SOME (replace_typ dts_env ty), mx)) bn_funs

  val bn_eqs' = map (fn (attr, trm) => 

    (attr, replace_term (cnstrs_env @ bn_fun_env) dts_env trm)) bn_eqs

in

  (bn_funs', bn_eqs') 

end 

*}

ML {* 

fun rawify_bclauses dts_env cnstrs_env bn_fun_env bclauses =

let

  fun rawify_bnds bnds = 

    map (apfst (Option.map (replace_term (cnstrs_env @ bn_fun_env) dts_env))) bnds

  fun rawify_bclause (BC (mode, bnds, bdys)) = BC (mode, rawify_bnds bnds, bdys)

in

  (map o map o map) rawify_bclause bclauses

end

*}

ML {*

fun define_raw_dts dts bn_funs bn_eqs bclauses lthy =

let

  val thy = Local_Theory.exit_global lthy

  val thy_name = Context.theory_name thy

  val dt_names = map (fn (_, s, _, _) => Binding.name_of s) dts

  val dt_full_names = map (Long_Name.qualify thy_name) dt_names 

  val dt_full_names' = add_raws dt_full_names

  val dts_env = dt_full_names ~~ dt_full_names'

  val bn_fun_strs = get_bn_fun_strs bn_funs

  val bn_fun_strs' = add_raws bn_fun_strs

  val bn_fun_env = bn_fun_strs ~~ bn_fun_strs'

  val bn_fun_full_env = map (pairself (Long_Name.qualify thy_name)) 

    (bn_fun_strs ~~ bn_fun_strs')

  val (raw_dt_names, raw_dts) = rawify_dts dt_names dts dts_env

  val (raw_bn_funs, raw_bn_eqs) = rawify_bn_funs dts_env cnstrs_env bn_fun_env bn_funs bn_eqs 

  val raw_bclauses = rawify_bclauses dts_env cnstrs_env bn_fun_full_env bclauses 

  val (raw_dt_full_names, thy1) = 

    Datatype.add_datatype Datatype.default_config raw_dt_names raw_dts thy

  val lthy1 = Named_Target.theory_init thy1

in

end

*}

ML {*

(* for testing porposes - to exit the procedure early *)

exception TEST of Proof.context

val (STEPS, STEPS_setup) = Attrib.config_int "STEPS" (K 100);

fun get_STEPS ctxt = Config.get ctxt STEPS

*}

setup STEPS_setup

ML {*

fun nominal_datatype2 opt_thms_name dts bn_funs bn_eqs bclauses lthy =

let

  (* definition of the raw datatypes *)

  val _ = warning "Definition of raw datatypes";

    if get_STEPS lthy > 0 

    then define_raw_dts dts bn_funs bn_eqs bclauses lthy

    else raise TEST lthy

  val dtinfo = Datatype.the_info (ProofContext.theory_of lthy0) (hd raw_dt_names)

  val {descr, sorts, ...} = dtinfo

  val raw_tys = all_dtyps descr sorts

  val raw_full_ty_names = map (fst o dest_Type) raw_tys

  val tvs = hd raw_tys

    |> snd o dest_Type

    |> map dest_TFree  

  val dtinfos = map (Datatype.the_info (ProofContext.theory_of lthy0)) raw_full_ty_names  

  val raw_cns_info = all_dtyp_constrs_types descr sorts

  val raw_constrs = (map o map) (fn (c, _, _, _) => c) raw_cns_info

  val raw_inject_thms = flat (map #inject dtinfos)

  val raw_distinct_thms = flat (map #distinct dtinfos)

  val raw_induct_thm = #induct dtinfo

  val raw_induct_thms = #inducts dtinfo

  val raw_exhaust_thms = map #exhaust dtinfos

  val raw_size_trms = map HOLogic.size_const raw_tys

  val raw_size_thms = Size.size_thms (ProofContext.theory_of lthy0) (hd raw_dt_names)

    |> `(fn thms => (length thms) div 2)

    |> uncurry drop

  (* definitions of raw permutations by primitive recursion *)

  val _ = warning "Definition of raw permutations";

  val ((raw_perm_funs, raw_perm_simps, raw_perm_laws), lthy2a) =

    if get_STEPS lthy0 > 0 

    then define_raw_perms raw_full_ty_names raw_tys tvs (flat raw_constrs) raw_induct_thm lthy0

    else raise TEST lthy0

  (* noting the raw permutations as eqvt theorems *)

  val (_, lthy3) = Local_Theory.note ((Binding.empty, [eqvt_attr]), raw_perm_simps) lthy2a

  (* definition of raw fv and bn functions *)

  val _ = warning "Definition of raw fv- and bn-functions";

  val (raw_bns, raw_bn_defs, raw_bn_info, raw_bn_induct, lthy3a) =

    if get_STEPS lthy3 > 1

    then define_raw_bns raw_full_ty_names raw_dts raw_bn_funs raw_bn_eqs 

      (raw_inject_thms @ raw_distinct_thms) raw_size_thms lthy3

    else raise TEST lthy3

  (* defining the permute_bn functions *)

  val (raw_perm_bns, raw_perm_bn_simps, lthy3b) = 

    if get_STEPS lthy3a > 2

    then define_raw_bn_perms raw_tys raw_bn_info raw_cns_info 

      (raw_inject_thms @ raw_distinct_thms) raw_size_thms lthy3a

    else raise TEST lthy3a

  val (raw_fvs, raw_fv_bns, raw_fv_defs, raw_fv_bns_induct, lthy3c) = 

    if get_STEPS lthy3b > 3 

    then define_raw_fvs raw_full_ty_names raw_tys raw_cns_info raw_bn_info raw_bclauses 

      (raw_inject_thms @ raw_distinct_thms) raw_size_thms lthy3b

    else raise TEST lthy3b

  (* definition of raw alphas *)

  val _ = warning "Definition of alphas";

  val (alpha_trms, alpha_bn_trms, alpha_intros, alpha_cases, alpha_induct, lthy4) =

    if get_STEPS lthy3c > 4 

    then define_raw_alpha raw_full_ty_names raw_tys raw_cns_info raw_bn_info raw_bclauses raw_fvs lthy3c

    else raise TEST lthy3c

  val alpha_tys = map (domain_type o fastype_of) alpha_trms  

  (* definition of alpha-distinct lemmas *)

  val _ = warning "Distinct theorems";

  val alpha_distincts = 

    mk_alpha_distincts lthy4 alpha_cases raw_distinct_thms alpha_trms raw_tys

  (* definition of alpha_eq_iff  lemmas *)

  val _ = warning "Eq-iff theorems";

  val alpha_eq_iff = 

    if get_STEPS lthy > 5

    then mk_alpha_eq_iff lthy4 alpha_intros raw_distinct_thms raw_inject_thms alpha_cases

    else raise TEST lthy4

  (* proving equivariance lemmas for bns, fvs, size and alpha *)

  val _ = warning "Proving equivariance";

  val raw_bn_eqvt = 

    if get_STEPS lthy > 6

    then raw_prove_eqvt raw_bns raw_bn_induct (raw_bn_defs @ raw_perm_simps) lthy4

    else raise TEST lthy4

  (* noting the raw_bn_eqvt lemmas in a temprorary theory *)

  val lthy_tmp = snd (Local_Theory.note ((Binding.empty, [eqvt_attr]), raw_bn_eqvt) lthy4)

  val raw_fv_eqvt = 

    if get_STEPS lthy > 7

    then raw_prove_eqvt (raw_fvs @ raw_fv_bns) raw_fv_bns_induct (raw_fv_defs @ raw_perm_simps) 

      (Local_Theory.restore lthy_tmp)

    else raise TEST lthy4

  val raw_size_eqvt = 

    if get_STEPS lthy > 8

    then raw_prove_eqvt raw_size_trms raw_induct_thms (raw_size_thms @ raw_perm_simps) 

      (Local_Theory.restore lthy_tmp)

      |> map (rewrite_rule @{thms permute_nat_def[THEN eq_reflection]})

      |> map (fn thm => thm RS @{thm sym})

    else raise TEST lthy4

  val lthy5 = snd (Local_Theory.note ((Binding.empty, [eqvt_attr]), raw_fv_eqvt) lthy_tmp)

  val (alpha_eqvt, lthy6) =

    if get_STEPS lthy > 9

    then Nominal_Eqvt.equivariance true (alpha_trms @ alpha_bn_trms) alpha_induct alpha_intros lthy5

    else raise TEST lthy4

  (* proving alpha equivalence *)

  val _ = warning "Proving equivalence"

  val alpha_refl_thms = 

    if get_STEPS lthy > 10

    then raw_prove_refl alpha_trms alpha_bn_trms alpha_intros raw_induct_thm lthy6 

    else raise TEST lthy6

  val alpha_sym_thms = 

    if get_STEPS lthy > 11

    then raw_prove_sym (alpha_trms @ alpha_bn_trms) alpha_intros alpha_induct lthy6 

    else raise TEST lthy6

  val alpha_trans_thms = 

    if get_STEPS lthy > 12

    then raw_prove_trans (alpha_trms @ alpha_bn_trms) (raw_distinct_thms @ raw_inject_thms) 

           alpha_intros alpha_induct alpha_cases lthy6

    else raise TEST lthy6

  val (alpha_equivp_thms, alpha_bn_equivp_thms) = 

    if get_STEPS lthy > 13

    then raw_prove_equivp alpha_trms alpha_bn_trms alpha_refl_thms alpha_sym_thms 

       alpha_trans_thms lthy6

    else raise TEST lthy6

  (* proving alpha implies alpha_bn *)

  val _ = warning "Proving alpha implies bn"

  val alpha_bn_imp_thms = 

    if get_STEPS lthy > 14

    then raw_prove_bn_imp alpha_trms alpha_bn_trms alpha_intros alpha_induct lthy6 

    else raise TEST lthy6

  (* respectfulness proofs *)

  val raw_funs_rsp_aux = 

    if get_STEPS lthy > 15

    then raw_fv_bn_rsp_aux alpha_trms alpha_bn_trms raw_fvs 

      raw_bns raw_fv_bns alpha_induct (raw_bn_defs @ raw_fv_defs) lthy6

    else raise TEST lthy6 

  val raw_funs_rsp = 

    if get_STEPS lthy > 16

    then map mk_funs_rsp raw_funs_rsp_aux

    else raise TEST lthy6 

  val raw_size_rsp = 

    if get_STEPS lthy > 17

    then

      raw_size_rsp_aux (alpha_trms @ alpha_bn_trms) alpha_induct 

      (raw_size_thms @ raw_size_eqvt) lthy6

      |> map mk_funs_rsp

    else raise TEST lthy6 

  val raw_constrs_rsp = 

    if get_STEPS lthy > 18

    then raw_constrs_rsp (flat raw_constrs) alpha_trms alpha_intros

      (alpha_bn_imp_thms @ raw_funs_rsp_aux) lthy6 

    else raise TEST lthy6 

  val alpha_permute_rsp = 

    if get_STEPS lthy > 19

    then map mk_alpha_permute_rsp alpha_eqvt

    else raise TEST lthy6 

  val alpha_bn_rsp = 

    if get_STEPS lthy > 20

    then raw_alpha_bn_rsp alpha_bn_trms alpha_bn_equivp_thms alpha_bn_imp_thms

    else raise TEST lthy6 

  val raw_perm_bn_rsp =

    if get_STEPS lthy > 21

    then raw_perm_bn_rsp (alpha_trms @ alpha_bn_trms) raw_perm_bns alpha_induct 

      alpha_intros raw_perm_bn_simps lthy6

    else raise TEST lthy6

  (* noting the quot_respects lemmas *)

  val (_, lthy6a) = 

    if get_STEPS lthy > 22

    then Local_Theory.note ((Binding.empty, [rsp_attr]),

      raw_constrs_rsp @ raw_funs_rsp @ raw_size_rsp @ alpha_permute_rsp @ 

      alpha_bn_rsp @ raw_perm_bn_rsp) lthy6

    else raise TEST lthy6

  (* defining the quotient type *)

  val _ = warning "Declaring the quotient types"

  val qty_descr = map (fn (vs, bind, mx, _) => (vs, bind, mx)) dts

  val (qty_infos, lthy7) = 

    if get_STEPS lthy > 23

    then define_qtypes qty_descr alpha_tys alpha_trms alpha_equivp_thms lthy6a

    else raise TEST lthy6a

  val qtys = map #qtyp qty_infos

  val qty_full_names = map (fst o dest_Type) qtys

  val qty_names = map Long_Name.base_name qty_full_names             

  (* defining of quotient term-constructors, binding functions, free vars functions *)

  val _ = warning "Defining the quotient constants"

  val qconstrs_descrs =

    (map2 o map2) (fn (b, _, mx) => fn t => (Name.of_binding b, t, mx)) (get_cnstrs dts) raw_constrs

  val qbns_descr =

    map2 (fn (b, _, mx) => fn t => (Name.of_binding b, t, mx)) bn_funs raw_bns

  val qfvs_descr = 

    map2 (fn n => fn t => ("fv_" ^ n, t, NoSyn)) qty_names raw_fvs

  val qfv_bns_descr = 

    map2 (fn (b, _, _) => fn t => ("fv_" ^ Name.of_binding b, t, NoSyn)) bn_funs raw_fv_bns

  val qalpha_bns_descr = 

    map2 (fn (b, _, _) => fn t => ("alpha_" ^ Name.of_binding b, t, NoSyn)) bn_funs  alpha_bn_trms

  val qperm_descr =

    map2 (fn n => fn t => ("permute_" ^ n, Type.legacy_freeze t, NoSyn)) qty_names raw_perm_funs

  val qsize_descr =

    map2 (fn n => fn t => ("size_" ^ n, t, NoSyn)) qty_names raw_size_trms

  val qperm_bn_descr = 

    map2 (fn (b, _, _) => fn t => ("permute_" ^ Name.of_binding b, t, NoSyn)) bn_funs raw_perm_bns

  val ((((((qconstrs_infos, qbns_info), qfvs_info), qfv_bns_info), qalpha_bns_info), qperm_bns_info), 

    lthy8) = 

    if get_STEPS lthy > 24

    then 

      lthy7

      |> fold_map (define_qconsts qtys) qconstrs_descrs 

      ||>> define_qconsts qtys qbns_descr 

      ||>> define_qconsts qtys qfvs_descr

      ||>> define_qconsts qtys qfv_bns_descr

      ||>> define_qconsts qtys qalpha_bns_descr

      ||>> define_qconsts qtys qperm_bn_descr

    else raise TEST lthy7

  (* definition of the quotient permfunctions and pt-class *)

  val lthy9 = 

    if get_STEPS lthy > 25

    then define_qperms qtys qty_full_names tvs qperm_descr raw_perm_laws lthy8 

    else raise TEST lthy8

  val lthy9a = 

    if get_STEPS lthy > 26

    then define_qsizes qtys qty_full_names tvs qsize_descr lthy9

    else raise TEST lthy9

  val qtrms = (map o map) #qconst qconstrs_infos

  val qbns = map #qconst qbns_info

  val qfvs = map #qconst qfvs_info

  val qfv_bns = map #qconst qfv_bns_info

  val qalpha_bns = map #qconst qalpha_bns_info

  val qperm_bns = map #qconst qperm_bns_info

  (* lifting of the theorems *)

  val _ = warning "Lifting of Theorems"

  val eq_iff_simps = @{thms alphas permute_prod.simps prod_fv.simps prod_alpha_def prod_rel_def

    prod.cases} 

  val ((((((qdistincts, qeq_iffs), qfv_defs), qbn_defs), qperm_simps), qfv_qbn_eqvts), lthyA) = 

    if get_STEPS lthy > 27

    then 

      lthy9a    

      |> lift_thms qtys [] alpha_distincts  

      ||>> lift_thms qtys eq_iff_simps alpha_eq_iff       

      ||>> lift_thms qtys [] raw_fv_defs

      ||>> lift_thms qtys [] raw_bn_defs

      ||>> lift_thms qtys [] raw_perm_simps

      ||>> lift_thms qtys [] (raw_fv_eqvt @ raw_bn_eqvt)

    else raise TEST lthy9a

  val ((((((qsize_eqvt, [qinduct]), qexhausts), qsize_simps), qperm_bn_simps), qalpha_refl_thms), lthyB) = 

    if get_STEPS lthy > 28

    then

      lthyA 

      |> lift_thms qtys [] raw_size_eqvt

      ||>> lift_thms qtys [] [raw_induct_thm]

      ||>> lift_thms qtys [] raw_exhaust_thms

      ||>> lift_thms qtys [] raw_size_thms

      ||>> lift_thms qtys [] raw_perm_bn_simps

      ||>> lift_thms qtys [] alpha_refl_thms

    else raise TEST lthyA

  val qinducts = Project_Rule.projections lthyA qinduct

  (* supports lemmas *) 

  val _ = warning "Proving Supports Lemmas and fs-Instances"

  val qsupports_thms =

    if get_STEPS lthy > 29

    then prove_supports lthyB qperm_simps (flat qtrms)

    else raise TEST lthyB

  (* finite supp lemmas *)

  val qfsupp_thms =

    if get_STEPS lthy > 30

    then prove_fsupp lthyB qtys qinduct qsupports_thms

    else raise TEST lthyB

  (* fs instances *)

  val lthyC =