src/HOLCF/Tools/pcpodef.ML
author wenzelm
Mon Feb 15 17:17:51 2010 +0100 (2010-02-15)
changeset 35129 ed24ba6f69aa
parent 35021 c839a4c670c6
child 35203 ef65a2218c31
permissions -rw-r--r--
discontinued unnamed infix syntax;
     1 (*  Title:      HOLCF/Tools/pcpodef.ML
     2     Author:     Brian Huffman
     3 
     4 Primitive domain definitions for HOLCF, similar to Gordon/HOL-style
     5 typedef (see also ~~/src/HOL/Tools/typedef.ML).
     6 *)
     7 
     8 signature PCPODEF =
     9 sig
    10   type cpo_info =
    11     { below_def: thm, adm: thm, cont_Rep: thm, cont_Abs: thm,
    12       lub: thm, thelub: thm, compact: thm }
    13   type pcpo_info =
    14     { Rep_strict: thm, Abs_strict: thm, Rep_strict_iff: thm, Abs_strict_iff: thm,
    15       Rep_defined: thm, Abs_defined: thm }
    16 
    17   val add_podef: bool -> binding option -> binding * string list * mixfix ->
    18     term -> (binding * binding) option -> tactic -> theory ->
    19     (Typedef.info * thm) * theory
    20   val add_cpodef: bool -> binding option -> binding * string list * mixfix ->
    21     term -> (binding * binding) option -> tactic * tactic -> theory ->
    22     (Typedef.info * cpo_info) * theory
    23   val add_pcpodef: bool -> binding option -> binding * string list * mixfix ->
    24     term -> (binding * binding) option -> tactic * tactic -> theory ->
    25     (Typedef.info * cpo_info * pcpo_info) * theory
    26 
    27   val cpodef_proof: (bool * binding) * (binding * string list * mixfix) * term
    28     * (binding * binding) option -> theory -> Proof.state
    29   val cpodef_proof_cmd: (bool * binding) * (binding * string list * mixfix) * string
    30     * (binding * binding) option -> theory -> Proof.state
    31   val pcpodef_proof: (bool * binding) * (binding * string list * mixfix) * term
    32     * (binding * binding) option -> theory -> Proof.state
    33   val pcpodef_proof_cmd: (bool * binding) * (binding * string list * mixfix) * string
    34     * (binding * binding) option -> theory -> Proof.state
    35 end;
    36 
    37 structure Pcpodef :> PCPODEF =
    38 struct
    39 
    40 (** type definitions **)
    41 
    42 type cpo_info =
    43   { below_def: thm, adm: thm, cont_Rep: thm, cont_Abs: thm,
    44     lub: thm, thelub: thm, compact: thm }
    45 
    46 type pcpo_info =
    47   { Rep_strict: thm, Abs_strict: thm, Rep_strict_iff: thm, Abs_strict_iff: thm,
    48     Rep_defined: thm, Abs_defined: thm }
    49 
    50 (* building terms *)
    51 
    52 fun adm_const T = Const (@{const_name adm}, (T --> HOLogic.boolT) --> HOLogic.boolT);
    53 fun mk_adm (x, T, P) = adm_const T $ absfree (x, T, P);
    54 
    55 fun below_const T = Const (@{const_name below}, T --> T --> HOLogic.boolT);
    56 
    57 (* manipulating theorems *)
    58 
    59 fun fold_adm_mem thm NONE = thm
    60   | fold_adm_mem thm (SOME set_def) =
    61     let val rule = @{lemma "A == B ==> adm (%x. x : B) ==> adm (%x. x : A)" by simp}
    62     in rule OF [set_def, thm] end;
    63 
    64 fun fold_UU_mem thm NONE = thm
    65   | fold_UU_mem thm (SOME set_def) =
    66     let val rule = @{lemma "A == B ==> UU : B ==> UU : A" by simp}
    67     in rule OF [set_def, thm] end;
    68 
    69 (* proving class instances *)
    70 
    71 fun prove_cpo
    72       (name: binding)
    73       (newT: typ)
    74       (Rep_name: binding, Abs_name: binding)
    75       (type_definition: thm)  (* type_definition Rep Abs A *)
    76       (set_def: thm option)   (* A == set *)
    77       (below_def: thm)        (* op << == %x y. Rep x << Rep y *)
    78       (admissible: thm)       (* adm (%x. x : set) *)
    79       (thy: theory)
    80     =
    81   let
    82     val admissible' = fold_adm_mem admissible set_def;
    83     val cpo_thms = map (Thm.transfer thy) [type_definition, below_def, admissible'];
    84     val (full_tname, Ts) = dest_Type newT;
    85     val lhs_sorts = map (snd o dest_TFree) Ts;
    86     val thy2 =
    87       thy
    88       |> AxClass.prove_arity (full_tname, lhs_sorts, @{sort cpo})
    89           (Tactic.rtac (@{thm typedef_cpo} OF cpo_thms) 1);
    90     (* transfer thms so that they will know about the new cpo instance *)
    91     val cpo_thms' = map (Thm.transfer thy2) cpo_thms;
    92     fun make thm = Drule.export_without_context (thm OF cpo_thms');
    93     val ([adm, cont_Rep, cont_Abs, lub, thelub, compact], thy3) =
    94       thy2
    95       |> Sign.add_path (Binding.name_of name)
    96       |> PureThy.add_thms
    97         ([((Binding.prefix_name "adm_" name, admissible'), []),
    98           ((Binding.prefix_name "cont_" Rep_name, make @{thm typedef_cont_Rep}), []),
    99           ((Binding.prefix_name "cont_" Abs_name, make @{thm typedef_cont_Abs}), []),
   100           ((Binding.prefix_name "lub_" name, make @{thm typedef_lub}), []),
   101           ((Binding.prefix_name "thelub_" name, make @{thm typedef_thelub}), []),
   102           ((Binding.prefix_name "compact_" name, make @{thm typedef_compact}), [])])
   103       ||> Sign.parent_path;
   104     val cpo_info : cpo_info =
   105       { below_def = below_def, adm = admissible', cont_Rep = cont_Rep,
   106         cont_Abs = cont_Abs, lub = lub, thelub = thelub, compact = compact };
   107   in
   108     (cpo_info, thy3)
   109   end;
   110 
   111 fun prove_pcpo
   112       (name: binding)
   113       (newT: typ)
   114       (Rep_name: binding, Abs_name: binding)
   115       (type_definition: thm)  (* type_definition Rep Abs A *)
   116       (set_def: thm option)   (* A == set *)
   117       (below_def: thm)        (* op << == %x y. Rep x << Rep y *)
   118       (UU_mem: thm)           (* UU : set *)
   119       (thy: theory)
   120     =
   121   let
   122     val UU_mem' = fold_UU_mem UU_mem set_def;
   123     val pcpo_thms = map (Thm.transfer thy) [type_definition, below_def, UU_mem'];
   124     val (full_tname, Ts) = dest_Type newT;
   125     val lhs_sorts = map (snd o dest_TFree) Ts;
   126     val thy2 = thy
   127       |> AxClass.prove_arity (full_tname, lhs_sorts, @{sort pcpo})
   128         (Tactic.rtac (@{thm typedef_pcpo} OF pcpo_thms) 1);
   129     val pcpo_thms' = map (Thm.transfer thy2) pcpo_thms;
   130     fun make thm = Drule.export_without_context (thm OF pcpo_thms');
   131     val ([Rep_strict, Abs_strict, Rep_strict_iff, Abs_strict_iff,
   132           Rep_defined, Abs_defined], thy3) =
   133       thy2
   134       |> Sign.add_path (Binding.name_of name)
   135       |> PureThy.add_thms
   136         ([((Binding.suffix_name "_strict" Rep_name, make @{thm typedef_Rep_strict}), []),
   137           ((Binding.suffix_name "_strict" Abs_name, make @{thm typedef_Abs_strict}), []),
   138           ((Binding.suffix_name "_strict_iff" Rep_name, make @{thm typedef_Rep_strict_iff}), []),
   139           ((Binding.suffix_name "_strict_iff" Abs_name, make @{thm typedef_Abs_strict_iff}), []),
   140           ((Binding.suffix_name "_defined" Rep_name, make @{thm typedef_Rep_defined}), []),
   141           ((Binding.suffix_name "_defined" Abs_name, make @{thm typedef_Abs_defined}), [])])
   142       ||> Sign.parent_path;
   143     val pcpo_info =
   144       { Rep_strict = Rep_strict, Abs_strict = Abs_strict,
   145         Rep_strict_iff = Rep_strict_iff, Abs_strict_iff = Abs_strict_iff,
   146         Rep_defined = Rep_defined, Abs_defined = Abs_defined };
   147   in
   148     (pcpo_info, thy3)
   149   end;
   150 
   151 (* prepare_cpodef *)
   152 
   153 fun declare_type_name a =
   154   Variable.declare_constraints (Logic.mk_type (TFree (a, dummyS)));
   155 
   156 fun prepare prep_term name (tname, vs, mx) raw_set opt_morphs thy =
   157   let
   158     val _ = Theory.requires thy "Pcpodef" "pcpodefs";
   159     val ctxt = ProofContext.init thy;
   160 
   161     (*rhs*)
   162     val set = prep_term (ctxt |> fold declare_type_name vs) raw_set;
   163     val setT = Term.fastype_of set;
   164     val rhs_tfrees = Term.add_tfrees set [];
   165     val oldT = HOLogic.dest_setT setT handle TYPE _ =>
   166       error ("Not a set type: " ^ quote (Syntax.string_of_typ ctxt setT));
   167 
   168     (*lhs*)
   169     val defS = Sign.defaultS thy;
   170     val lhs_tfrees = map (fn v => (v, the_default defS (AList.lookup (op =) rhs_tfrees v))) vs;
   171     val full_tname = Sign.full_name thy tname;
   172     val newT = Type (full_tname, map TFree lhs_tfrees);
   173 
   174     val morphs = opt_morphs
   175       |> the_default (Binding.prefix_name "Rep_" name, Binding.prefix_name "Abs_" name);
   176   in
   177     (newT, oldT, set, morphs)
   178   end
   179 
   180 fun add_podef def opt_name typ set opt_morphs tac thy =
   181   let
   182     val name = the_default (#1 typ) opt_name;
   183     val ((full_tname, info as {type_definition, set_def, Rep_name, ...}), thy2) = thy
   184       |> Typedef.add_typedef def opt_name typ set opt_morphs tac;
   185     val oldT = #rep_type info;
   186     val newT = #abs_type info;
   187     val lhs_tfrees = map dest_TFree (snd (dest_Type newT));
   188 
   189     val RepC = Const (Rep_name, newT --> oldT);
   190     val below_eqn = Logic.mk_equals (below_const newT,
   191       Abs ("x", newT, Abs ("y", newT, below_const oldT $ (RepC $ Bound 1) $ (RepC $ Bound 0))));
   192     val lthy3 = thy2
   193       |> Theory_Target.instantiation ([full_tname], lhs_tfrees, @{sort po});
   194     val ((_, (_, below_ldef)), lthy4) = lthy3
   195       |> Specification.definition (NONE,
   196           ((Binding.prefix_name "below_" (Binding.suffix_name "_def" name), []), below_eqn));
   197     val ctxt_thy = ProofContext.init (ProofContext.theory_of lthy4);
   198     val below_def = singleton (ProofContext.export lthy4 ctxt_thy) below_ldef;
   199     val thy5 = lthy4
   200       |> Class.prove_instantiation_instance
   201           (K (Tactic.rtac (@{thm typedef_po} OF [type_definition, below_def]) 1))
   202       |> Local_Theory.exit_global;
   203   in ((info, below_def), thy5) end;
   204 
   205 fun prepare_cpodef
   206       (prep_term: Proof.context -> 'a -> term)
   207       (def: bool)
   208       (name: binding)
   209       (typ: binding * string list * mixfix)
   210       (raw_set: 'a)
   211       (opt_morphs: (binding * binding) option)
   212       (thy: theory)
   213     : term * term * (thm -> thm -> theory -> (Typedef.info * cpo_info) * theory) =
   214   let
   215     val (newT, oldT, set, morphs as (Rep_name, Abs_name)) =
   216       prepare prep_term name typ raw_set opt_morphs thy;
   217 
   218     val goal_nonempty =
   219       HOLogic.mk_Trueprop (HOLogic.mk_exists ("x", oldT, HOLogic.mk_mem (Free ("x", oldT), set)));
   220     val goal_admissible =
   221       HOLogic.mk_Trueprop (mk_adm ("x", oldT, HOLogic.mk_mem (Free ("x", oldT), set)));
   222 
   223     fun cpodef_result nonempty admissible thy =
   224       let
   225         val ((info as {type_definition, set_def, ...}, below_def), thy2) = thy
   226           |> add_podef def (SOME name) typ set opt_morphs (Tactic.rtac nonempty 1);
   227         val (cpo_info, thy3) = thy2
   228           |> prove_cpo name newT morphs type_definition set_def below_def admissible;
   229       in
   230         ((info, cpo_info), thy3)
   231       end;
   232   in
   233     (goal_nonempty, goal_admissible, cpodef_result)
   234   end
   235   handle ERROR msg =>
   236     cat_error msg ("The error(s) above occurred in cpodef " ^ quote (Binding.str_of name));
   237 
   238 fun prepare_pcpodef
   239       (prep_term: Proof.context -> 'a -> term)
   240       (def: bool)
   241       (name: binding)
   242       (typ: binding * string list * mixfix)
   243       (raw_set: 'a)
   244       (opt_morphs: (binding * binding) option)
   245       (thy: theory)
   246     : term * term * (thm -> thm -> theory -> (Typedef.info * cpo_info * pcpo_info) * theory) =
   247   let
   248     val (newT, oldT, set, morphs as (Rep_name, Abs_name)) =
   249       prepare prep_term name typ raw_set opt_morphs thy;
   250 
   251     val goal_UU_mem =
   252       HOLogic.mk_Trueprop (HOLogic.mk_mem (Const (@{const_name UU}, oldT), set));
   253 
   254     val goal_admissible =
   255       HOLogic.mk_Trueprop (mk_adm ("x", oldT, HOLogic.mk_mem (Free ("x", oldT), set)));
   256 
   257     fun pcpodef_result UU_mem admissible thy =
   258       let
   259         val tac = Tactic.rtac exI 1 THEN Tactic.rtac UU_mem 1;
   260         val ((info as {type_definition, set_def, ...}, below_def), thy2) = thy
   261           |> add_podef def (SOME name) typ set opt_morphs tac;
   262         val (cpo_info, thy3) = thy2
   263           |> prove_cpo name newT morphs type_definition set_def below_def admissible;
   264         val (pcpo_info, thy4) = thy3
   265           |> prove_pcpo name newT morphs type_definition set_def below_def UU_mem;
   266       in
   267         ((info, cpo_info, pcpo_info), thy4)
   268       end;
   269   in
   270     (goal_UU_mem, goal_admissible, pcpodef_result)
   271   end
   272   handle ERROR msg =>
   273     cat_error msg ("The error(s) above occurred in pcpodef " ^ quote (Binding.str_of name));
   274 
   275 
   276 (* tactic interface *)
   277 
   278 fun add_cpodef def opt_name typ set opt_morphs (tac1, tac2) thy =
   279   let
   280     val name = the_default (#1 typ) opt_name;
   281     val (goal1, goal2, cpodef_result) =
   282       prepare_cpodef Syntax.check_term def name typ set opt_morphs thy;
   283     val thm1 = Goal.prove_global thy [] [] goal1 (K tac1)
   284       handle ERROR msg => cat_error msg
   285         ("Failed to prove non-emptiness of " ^ quote (Syntax.string_of_term_global thy set));
   286     val thm2 = Goal.prove_global thy [] [] goal2 (K tac2)
   287       handle ERROR msg => cat_error msg
   288         ("Failed to prove admissibility of " ^ quote (Syntax.string_of_term_global thy set));
   289   in cpodef_result thm1 thm2 thy end;
   290 
   291 fun add_pcpodef def opt_name typ set opt_morphs (tac1, tac2) thy =
   292   let
   293     val name = the_default (#1 typ) opt_name;
   294     val (goal1, goal2, pcpodef_result) =
   295       prepare_pcpodef Syntax.check_term def name typ set opt_morphs thy;
   296     val thm1 = Goal.prove_global thy [] [] goal1 (K tac1)
   297       handle ERROR msg => cat_error msg
   298         ("Failed to prove non-emptiness of " ^ quote (Syntax.string_of_term_global thy set));
   299     val thm2 = Goal.prove_global thy [] [] goal2 (K tac2)
   300       handle ERROR msg => cat_error msg
   301         ("Failed to prove admissibility of " ^ quote (Syntax.string_of_term_global thy set));
   302   in pcpodef_result thm1 thm2 thy end;
   303 
   304 
   305 (* proof interface *)
   306 
   307 local
   308 
   309 fun gen_cpodef_proof prep_term ((def, name), typ, set, opt_morphs) thy =
   310   let
   311     val (goal1, goal2, make_result) =
   312       prepare_cpodef prep_term def name typ set opt_morphs thy;
   313     fun after_qed [[th1, th2]] = ProofContext.theory (snd o make_result th1 th2);
   314   in Proof.theorem_i NONE after_qed [[(goal1, []), (goal2, [])]] (ProofContext.init thy) end;
   315 
   316 fun gen_pcpodef_proof prep_term ((def, name), typ, set, opt_morphs) thy =
   317   let
   318     val (goal1, goal2, make_result) =
   319       prepare_pcpodef prep_term def name typ set opt_morphs thy;
   320     fun after_qed [[th1, th2]] = ProofContext.theory (snd o make_result th1 th2);
   321   in Proof.theorem_i NONE after_qed [[(goal1, []), (goal2, [])]] (ProofContext.init thy) end;
   322 
   323 in
   324 
   325 fun cpodef_proof x = gen_cpodef_proof Syntax.check_term x;
   326 fun cpodef_proof_cmd x = gen_cpodef_proof Syntax.read_term x;
   327 
   328 fun pcpodef_proof x = gen_pcpodef_proof Syntax.check_term x;
   329 fun pcpodef_proof_cmd x = gen_pcpodef_proof Syntax.read_term x;
   330 
   331 end;
   332 
   333 
   334 
   335 (** outer syntax **)
   336 
   337 local structure P = OuterParse and K = OuterKeyword in
   338 
   339 val typedef_proof_decl =
   340   Scan.optional (P.$$$ "(" |--
   341       ((P.$$$ "open" >> K false) -- Scan.option P.binding || P.binding >> (fn s => (true, SOME s)))
   342         --| P.$$$ ")") (true, NONE) --
   343     (P.type_args -- P.binding) -- P.opt_infix -- (P.$$$ "=" |-- P.term) --
   344     Scan.option (P.$$$ "morphisms" |-- P.!!! (P.binding -- P.binding));
   345 
   346 fun mk_pcpodef_proof pcpo ((((((def, opt_name), (vs, t)), mx), A), morphs)) =
   347   (if pcpo then pcpodef_proof_cmd else cpodef_proof_cmd)
   348     ((def, the_default t opt_name), (t, vs, mx), A, morphs);
   349 
   350 val _ =
   351   OuterSyntax.command "pcpodef" "HOLCF type definition (requires admissibility proof)" K.thy_goal
   352     (typedef_proof_decl >>
   353       (Toplevel.print oo (Toplevel.theory_to_proof o mk_pcpodef_proof true)));
   354 
   355 val _ =
   356   OuterSyntax.command "cpodef" "HOLCF type definition (requires admissibility proof)" K.thy_goal
   357     (typedef_proof_decl >>
   358       (Toplevel.print oo (Toplevel.theory_to_proof o mk_pcpodef_proof false)));
   359 
   360 end;
   361 
   362 end;