theory NewParser

imports "../Nominal-General/Nominal2_Base" 

        "../Nominal-General/Nominal2_Eqvt" 

        "../Nominal-General/Nominal2_Supp" 

        "Perm" "NewFv" "NewAlpha" "Tacs" "Equivp" "Lift"

begin

section{* Interface for nominal_datatype *}

ML {* 

(* nominal datatype parser *)

local

  structure P = OuterParse;

  structure S = Scan

  fun triple1 ((x, y), z) = (x, y, z)

  fun triple2 (x, (y, z)) = (x, y, z)

  fun tuple ((x, y, z), u) = (x, y, z, u)

  fun tswap (((x, y), z), u) = (x, y, u, z)

in

val _ = OuterKeyword.keyword "bind"

val _ = OuterKeyword.keyword "bind_set"

val _ = OuterKeyword.keyword "bind_res"

val anno_typ = S.option (P.name --| P.$$$ "::") -- P.typ

val bind_mode = P.$$$ "bind" || P.$$$ "bind_set" || P.$$$ "bind_res"

val bind_clauses = 

  P.enum "," (bind_mode -- S.repeat1 P.term -- (P.$$$ "in" |-- S.repeat1 P.name) >> triple1)

val cnstr_parser =

  P.binding -- S.repeat anno_typ -- bind_clauses -- P.opt_mixfix >> tswap

(* datatype parser *)

val dt_parser =

  (P.type_args -- P.binding -- P.opt_mixfix >> triple1) -- 

    (P.$$$ "=" |-- P.enum1 "|" cnstr_parser) >> tuple

(* binding function parser *)

val bnfun_parser = 

  S.optional (P.$$$ "binder" |-- P.fixes -- SpecParse.where_alt_specs) ([], [])

(* main parser *)

val main_parser =

  P.and_list1 dt_parser -- bnfun_parser >> triple2

end

*}

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

*}

ML {* 

fun add_primrec_wrapper funs eqs lthy = 

  if null funs then (([], []), lthy)

  else 

   let 

     val eqs' = map (fn (_, eq) => (Attrib.empty_binding, eq)) eqs

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

     val ((funs'', eqs''), lthy') = Primrec.add_primrec funs' eqs' lthy

     val phi = ProofContext.export_morphism lthy' lthy

   in 

     ((map (Morphism.term phi) funs'', map (Morphism.thm phi) eqs''), lthy')

   end

*}

ML {*

fun add_datatype_wrapper dt_names dts =

let

  val conf = Datatype.default_config

in

  Local_Theory.theory_result (Datatype.add_datatype conf dt_names dts)

end

*}

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, 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 (BEmy n) = BEmy n

    | rawify_bclause (BLst (bnds, bdys)) = BLst (rawify_bnds bnds, bdys)

    | rawify_bclause (BSet (bnds, bdys)) = BSet (rawify_bnds bnds, bdys)

    | rawify_bclause (BRes (bnds, bdys)) = BRes (rawify_bnds bnds, bdys)

in

  map (map (map rawify_bclause)) bclauses

end

*}

(* strip_bn_fun takes a bn function defined by the user as a union or

   append of elements and returns those elements together with bn functions

   applied *)

ML {*

fun strip_bn_fun t =

  case t of

    Const (@{const_name sup}, _) $ l $ r => strip_bn_fun l @ strip_bn_fun r

  | Const (@{const_name append}, _) $ l $ r => strip_bn_fun l @ strip_bn_fun r

  | Const (@{const_name insert}, _) $ (Const (@{const_name atom}, _) $ Bound i) $ y =>

      (i, NONE) :: strip_bn_fun y

  | Const (@{const_name Cons}, _) $ (Const (@{const_name atom}, _) $ Bound i) $ y =>

      (i, NONE) :: strip_bn_fun y

  | Const (@{const_name bot}, _) => []

  | Const (@{const_name Nil}, _) => []

  | (f as Free _) $ Bound i => [(i, SOME f)]

  | _ => error ("Unsupported binding function: " ^ (PolyML.makestring t))

*}

ML {*

fun find [] _ = error ("cannot find element")

  | find ((x, z)::xs) y = if (Long_Name.base_name x) = y then z else find xs y

*}

ML {* print_depth 50 *}

ML {*

let

  fun aux eq = 

  let

    val (lhs, rhs) = eq

      |> strip_qnt_body "all" 

      |> HOLogic.dest_Trueprop

      |> HOLogic.dest_eq

    val (bn_fun, [cnstr]) = strip_comb lhs

    val (_, ty) = dest_Free bn_fun

    val (ty_name, _) = dest_Type (domain_type ty)

    val dt_index = find_index (fn x => x = ty_name) dt_names

    val (cnstr_head, cnstr_args) = strip_comb cnstr

    val rhs_elements = strip_bn_fun rhs

    val included = map (apfst (fn i => length (cnstr_args) - i - 1)) rhs_elements

  in

    (dt_index, (bn_fun, (cnstr_head, included)))

  end 

  fun order dts i ts = 

  let

    val dt = nth dts i

    val cts = map (fn (x, _, _) => Binding.name_of x) ((fn (_, _, _, x) => x) dt)

    val ts' = map (fn (x, y) => (fst (dest_Const x), y)) ts

  in

    map (find ts') cts

  end

  val unordered = AList.group (op=) (map aux eqs)

  val unordered' = map (fn (x, y) =>  (x, AList.group (op=) y)) unordered

  val ordered = map (fn (x, y) => (x, map (fn (v, z) => (v, order dts x z)) y)) unordered' 

  val ordered' = flat (map (fn (ith, l) => map (fn (bn, data) => (bn, ith, data)) l) ordered)

in

end

*}

ML {*

fun raw_nominal_decls dts bn_funs bn_eqs binds lthy =

let

  val thy = ProofContext.theory_of 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 cnstrs = get_cnstr_strs dts

  val cnstrs_ty = get_typed_cnstrs dts

  val cnstrs_full_names = map (Long_Name.qualify thy_name) cnstrs

  val cnstrs_full_names' = map (fn (x, y) => Long_Name.qualify thy_name 

    (Long_Name.qualify (add_raw x) (add_raw y))) cnstrs_ty

  val cnstrs_env = cnstrs_full_names ~~ cnstrs_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 binds 

in

  lthy 

  |> add_datatype_wrapper raw_dt_names raw_dts 

  ||>> add_primrec_wrapper raw_bn_funs raw_bn_eqs

  ||>> pair raw_bclauses

  ||>> pair raw_bns

end

*}

lemma equivp_hack: "equivp x"

sorry

ML {*

fun equivp_hack ctxt rel =

let

  val thy = ProofContext.theory_of ctxt

  val ty = domain_type (fastype_of rel)

  val cty = ctyp_of thy ty

  val ct = cterm_of thy rel

in

  Drule.instantiate' [SOME cty] [SOME ct] @{thm equivp_hack}

end

*}

ML {* val cheat_equivp = Unsynchronized.ref false *}

ML {* val cheat_fv_rsp = Unsynchronized.ref false *}

ML {* val cheat_alpha_bn_rsp = Unsynchronized.ref false *}

ML {* val cheat_supp_eq = Unsynchronized.ref false *}

ML {*

fun remove_loop t =

  let val _ = HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of t)) in t end

  handle TERM _ => @{thm eqTrueI} OF [t]

*}

text {* 

  nominal_datatype2 does the following things in order:

Parser.thy/raw_nominal_decls

  1) define the raw datatype

  2) define the raw binding functions 

Perm.thy/define_raw_perms

  3) define permutations of the raw datatype and show that the raw type is 

     in the pt typeclass

Lift.thy/define_fv_alpha_export, Fv.thy/define_fv & define_alpha

  4) define fv and fv_bn

  5) define alpha and alpha_bn

Perm.thy/distinct_rel

  6) prove alpha_distincts (C1 x \<notsimeq> C2 y ...)             (Proof by cases; simp)

Tacs.thy/build_rel_inj

  6) prove alpha_eq_iff    (C1 x = C2 y \<leftrightarrow> P x y ...)

     (left-to-right by intro rule, right-to-left by cases; simp)

Equivp.thy/prove_eqvt

  7) prove bn_eqvt (common induction on the raw datatype)

  8) prove fv_eqvt (common induction on the raw datatype with help of above)

Rsp.thy/build_alpha_eqvts

  9) prove alpha_eqvt and alpha_bn_eqvt

     (common alpha-induction, unfolding alpha_gen, permute of #* and =)

Equivp.thy/build_alpha_refl & Equivp.thy/build_equivps

 10) prove that alpha and alpha_bn are equivalence relations

     (common induction and application of 'compose' lemmas)

Lift.thy/define_quotient_types

 11) define quotient types

Rsp.thy/build_fvbv_rsps

 12) prove bn respects     (common induction and simp with alpha_gen)

Rsp.thy/prove_const_rsp

 13) prove fv respects     (common induction and simp with alpha_gen)

 14) prove permute respects    (unfolds to alpha_eqvt)

Rsp.thy/prove_alpha_bn_rsp

 15) prove alpha_bn respects

     (alpha_induct then cases then sym and trans of the relations)

Rsp.thy/prove_alpha_alphabn

 16) show that alpha implies alpha_bn (by unduction, needed in following step)

Rsp.thy/prove_const_rsp

 17) prove respects for all datatype constructors

     (unfold eq_iff and alpha_gen; introduce zero permutations; simp)

Perm.thy/quotient_lift_consts_export

 18) define lifted constructors, fv, bn, alpha_bn, permutations

Perm.thy/define_lifted_perms

 19) lift permutation zero and add properties to show that quotient type is in the pt typeclass

Lift.thy/lift_thm

 20) lift permutation simplifications

 21) lift induction

 22) lift fv

 23) lift bn

 24) lift eq_iff

 25) lift alpha_distincts

 26) lift fv and bn eqvts

Equivp.thy/prove_supports

 27) prove that union of arguments supports constructors

Equivp.thy/prove_fs

 28) show that the lifted type is in fs typeclass     (* by q_induct, supports *)

Equivp.thy/supp_eq

 29) prove supp = fv

*}

ML {*

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

exception TEST of Proof.context

val STEPS = 10

*}

ML {*

fun nominal_datatype2 dts bn_funs bn_eqs bclauses lthy =

let

  (* definition of the raw datatype and raw bn-functions *)

  val ((((raw_dt_names, (raw_bn_funs, raw_bn_eqs)), raw_bclauses), raw_bns), lthy1) =

    if STEPS > 1 then raw_nominal_decls dts bn_funs bn_eqs bclauses lthy

    else raise TEST lthy

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

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

  val raw_tys = map (fn (i, _) => nth_dtyp descr sorts i) descr;

  val all_typs = map (fn i => Datatype_Aux.typ_of_dtyp descr sorts (Datatype_Aux.DtRec i)) (map fst descr)

  val all_full_tnames = map (fn (_, (n, _, _)) => n) descr;

  val dtinfos = map (Datatype.the_info (ProofContext.theory_of lthy1)) all_full_tnames;

  val inject_thms = flat (map #inject dtinfos);

  val distinct_thms = flat (map #distinct dtinfos);

  val rel_dtinfos = List.take (dtinfos, (length dts)); 

  val rel_distinct = map #distinct rel_dtinfos;  (* thm list list *)

  val induct_thm = #induct dtinfo;

  val exhaust_thms = map #exhaust dtinfos;