src/HOL/thy_syntax.ML
author nipkow
Wed Sep 10 14:18:12 1997 +0200 (1997-09-10)
changeset 3665 3b44fac767f6
parent 3622 85898be702b2
child 3945 ae9c61d69888
permissions -rw-r--r--
Added Larry's test for preventing a datatype shadowing a theory.
     1 (*  Title:      HOL/thy_syntax.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel and Lawrence C Paulson and Carsten Clasohm
     4 
     5 Additional theory file sections for HOL.
     6 
     7 TODO:
     8   move datatype / primrec stuff to pre_datatype.ML (?)
     9 *)
    10 
    11 (*the kind of distinctiveness axioms depends on number of constructors*)
    12 val dtK = 7;  (* FIXME rename?, move? *)
    13 
    14 
    15 local
    16 
    17 open ThyParse;
    18 
    19 
    20 (** typedef **)
    21 
    22 fun mk_typedef_decl (((((opt_name, vs), t), mx), rhs), wt) =
    23   let
    24     val name' = if_none opt_name t;
    25     val name = strip_quotes name';
    26   in
    27     (cat_lines [name', mk_triple (t, mk_list vs, mx), rhs, wt],
    28       [name ^ "_def", "Rep_" ^ name, "Rep_" ^ name ^ "_inverse",
    29         "Abs_" ^ name ^ "_inverse"])
    30   end;
    31 
    32 val typedef_decl =
    33   optional ("(" $$-- name --$$ ")" >> Some) None --
    34   type_args -- name -- opt_infix --$$ "=" -- string -- opt_witness
    35   >> mk_typedef_decl;
    36 
    37 
    38 
    39 (** (co)inductive **)
    40 
    41 (*co is either "" or "Co"*)
    42 fun inductive_decl co =
    43   let
    44     fun mk_intr_name (s, _) =   (*the "op" cancels any infix status*)
    45       if Syntax.is_identifier s then "op " ^ s else "_";
    46     fun mk_params (((recs, ipairs), monos), con_defs) =
    47       let val big_rec_name = space_implode "_" (map (scan_to_id o trim) recs)
    48           and srec_tms = mk_list recs
    49           and sintrs   = mk_big_list (map snd ipairs)
    50           val intrnl_name = big_rec_name ^ "_Intrnl"
    51       in
    52          (";\n\n\
    53           \structure " ^ intrnl_name ^ " =\n\
    54           \  struct\n\
    55           \  val _ = writeln \"" ^ co ^
    56                      "Inductive definition " ^ big_rec_name ^ "\"\n\
    57           \  val rec_tms\t= map (readtm (sign_of thy) Ind_Syntax.termTVar) "
    58                            ^ srec_tms ^ "\n\
    59           \  and intr_tms\t= map (readtm (sign_of thy) propT)\n"
    60                            ^ sintrs ^ "\n\
    61           \  end;\n\n\
    62           \val thy = thy |> " ^ co ^ "Ind.add_fp_def_i \n    (" ^
    63              intrnl_name ^ ".rec_tms, " ^
    64              intrnl_name ^ ".intr_tms)"
    65          ,
    66           "structure " ^ big_rec_name ^ " =\n\
    67           \ let\n\
    68           \  val _ = writeln \"Proofs for " ^ co ^ 
    69                      "Inductive definition " ^ big_rec_name ^ "\"\n\
    70           \  structure Result = " ^ co ^ "Ind_section_Fun\n\
    71           \\t  (open " ^ intrnl_name ^ "\n\
    72           \\t   val thy\t\t= thy\n\
    73           \\t   val monos\t\t= " ^ monos ^ "\n\
    74           \\t   val con_defs\t\t= " ^ con_defs ^ ");\n\n\
    75           \ in\n\
    76           \  struct\n\
    77           \  val " ^ mk_list (map mk_intr_name ipairs) ^ " = Result.intrs;\n\
    78           \  open Result\n\
    79           \  end\n\
    80           \ end;\n\n\
    81           \structure " ^ intrnl_name ^ " = struct end;\n\n"
    82          )
    83       end
    84     val ipairs = "intrs" $$-- repeat1 (ident -- !! string)
    85     fun optstring s = optional (s $$-- string >> trim) "[]"
    86   in
    87     repeat1 name -- ipairs -- optstring "monos" -- optstring "con_defs"
    88       >> mk_params
    89   end;
    90 
    91 
    92 
    93 (** datatype **)
    94 
    95 local
    96   (* FIXME err -> add_datatype *)
    97   fun mk_cons cs =
    98     (case duplicates (map (fst o fst) cs) of
    99       [] => map (fn ((s, ts), syn) => mk_triple (s, mk_list ts, syn)) cs
   100     | dups => error ("Duplicate constructors: " ^ commas_quote dups));
   101 
   102   (*generate names of distinctiveness axioms*)
   103   fun mk_distinct_rules cs tname =
   104     let
   105       val uqcs = map (fn ((s, _), _) => strip_quotes s) cs;
   106       (*combine all constructor names with all others w/o duplicates*)
   107       fun neg_one c = map (fn c2 => quote (c ^ "_not_" ^ c2));
   108       fun neg1 [] = []
   109         | neg1 (c1 :: cs) = neg_one c1 cs @ neg1 cs;
   110     in
   111       if length uqcs < dtK then neg1 uqcs
   112       else quote (tname ^ "_ord_distinct") ::
   113         map (fn c => quote (tname ^ "_ord_" ^ c)) uqcs
   114     end;
   115 
   116   fun mk_rules tname cons pre = " map (get_axiom thy) " ^
   117     mk_list (map (fn ((s,_), _) => quote (tname ^ pre ^ strip_quotes s)) cons);
   118 
   119   (*generate string for calling add_datatype and build_record*)
   120   fun mk_params ((ts, tname), cons) =
   121    ("val (thy," ^ tname ^ "_add_primrec," ^ tname ^ "_size_eqns) = Datatype.add_datatype\n"
   122     ^ mk_triple (mk_list ts, quote tname, mk_list (mk_cons cons)) ^ " thy\n\
   123     \val thy = ("^tname^"_add_primrec "^tname^"_size_eqns thy)"
   124     ,
   125     "val _ = deny (" ^ quote tname ^ " mem  map ! (stamps_of_thy thy))\n\
   126     \   (\"Datatype \\\""^tname^"\\\" would clash with the theory of the same name!\");\n\
   127     \structure " ^ tname ^ " =\n\
   128     \struct\n\
   129     \ val inject = map (get_axiom thy) " ^
   130         mk_list (map (fn ((s, _), _) => quote ("inject_" ^ strip_quotes s))
   131           (filter_out (null o snd o fst) cons)) ^ ";\n\
   132     \ val distinct = " ^
   133         (if length cons < dtK then "let val distinct' = " else "") ^
   134         "map (get_axiom thy) " ^ mk_list (mk_distinct_rules cons tname) ^
   135         (if length cons < dtK then
   136           "  in distinct' @ (map (fn t => sym COMP (t RS contrapos))\
   137           \ distinct') end"
   138          else "") ^ ";\n\
   139     \ val induct = get_axiom thy \"" ^ tname ^ "_induct\";\n\
   140     \ val cases =" ^ mk_rules tname cons "_case_" ^ ";\n\
   141     \ val recs =" ^ mk_rules tname cons "_rec_" ^ ";\n\
   142     \ val simps = inject @ distinct @ cases @ recs;\n\
   143     \ fun induct_tac a = res_inst_tac [(" ^ quote tname ^ ", a)] induct;\n\
   144     \end;\n\
   145     \val dummy = datatypes := Dtype.build_record (thy, " ^
   146       mk_pair (quote tname, mk_list (map (fst o fst) cons)) ^
   147       ", " ^ tname ^ ".induct_tac) :: (!datatypes);\n\
   148     \val dummy = Addsimps(" ^ tname ^ ".cases @ " ^ tname ^ ".recs);\n\
   149     \val dummy = AddIffs " ^ tname ^ ".inject;\n\
   150     \val dummy = " ^
   151       (if length cons < dtK then "AddIffs " else "Addsimps ") ^
   152       tname ^ ".distinct;\n\
   153     \val dummy = Addsimps(map (fn (_,eqn) =>\n\
   154     \ prove_goalw thy [get_def thy " ^ quote("size_"^tname) ^
   155                      "] eqn (fn _ => [Simp_tac 1]))\n" ^
   156     tname^"_size_eqns)\n"
   157    );
   158 
   159   (*parsers*)
   160   val tvars = type_args >> map (cat "dtVar");
   161 
   162   val simple_typ = ident >> (cat "dtTyp" o curry mk_pair "[]" o quote) ||
   163     type_var >> cat "dtVar";
   164 
   165   fun complex_typ toks =
   166     let val typ = simple_typ || "(" $$-- complex_typ --$$ ")";
   167         val typ2 = complex_typ || "(" $$-- complex_typ --$$ ")";
   168     in
   169      (typ -- repeat (ident>>quote) >>
   170         (foldl (fn (x,y) => "dtTyp " ^ mk_pair (brackets x, y))) ||
   171       "(" $$-- !! (list1 typ2) --$$ ")" -- !! (repeat1 (ident>>quote)) >>
   172        (fn (fst, ids) => foldl (fn (x,y) => "dtTyp " ^
   173                          mk_pair (brackets x, y)) (commas fst, ids))) toks
   174     end;
   175 
   176   val opt_typs = repeat (simple_typ || ("(" $$-- complex_typ --$$ ")"));
   177   val constructor = name -- opt_typs -- opt_mixfix;
   178 in
   179   val datatype_decl =
   180     tvars -- ident --$$ "=" -- enum1 "|" constructor >> mk_params;
   181 end;
   182 
   183 
   184 
   185 (** primrec **)
   186 
   187 (*recursion equations have user-supplied names*)
   188 fun mk_primrec_decl_1 ((fname, tname), axms) =
   189   let
   190     (*Isolate type name from the structure's identifier it may be stored in*)
   191     val tname' = implode (snd (take_suffix (not_equal ".") (explode tname)));
   192 
   193     fun mk_prove (name, eqn) =
   194       "val " ^ name ^ " = store_thm (" ^ quote name
   195       ^ ", prove_goalw thy [get_def thy "
   196       ^ (quote (strip_quotes fname ^ "_" ^ tname')) ^ "] " ^ eqn ^ "\n\
   197       \  (fn _ => [Simp_tac 1]));";
   198 
   199     val axs = mk_list (map (fn (n, a) => mk_pair (quote n, a)) axms);
   200   in ("|> " ^ tname ^ "_add_primrec " ^ axs
   201       , 
   202       cat_lines (map mk_prove axms)
   203       ^ "\nval dummy = Addsimps " ^ mk_list (map fst axms) ^ ";")
   204   end;
   205 
   206 (*recursion equations have no names*)
   207 fun mk_primrec_decl_2 ((fname, tname), axms) =
   208   let
   209     (*Isolate type name from the structure's identifier it may be stored in*)
   210     val tname' = implode (snd (take_suffix (not_equal ".") (explode tname)));
   211 
   212     fun mk_prove eqn =
   213       "prove_goalw thy [get_def thy "
   214       ^ (quote (strip_quotes fname ^ "_" ^ tname')) ^ "] " ^ eqn ^ " \
   215       \(fn _ => [Simp_tac 1])";
   216 
   217     val axs = mk_list (map (fn a => mk_pair ("\"\"", a)) axms);
   218   in ("|> " ^ tname ^ "_add_primrec " ^ axs
   219       ,
   220       "val dummy = Addsimps " ^
   221       brackets(space_implode ",\n" (map mk_prove axms)) ^ ";")
   222   end;
   223 
   224 (*function name, argument type and either (name,axiom) pairs or just axioms*)
   225 val primrec_decl =
   226   (name -- long_id -- repeat1 (ident -- string) >> mk_primrec_decl_1) ||
   227   (name -- long_id -- repeat1 string >> mk_primrec_decl_2) ;
   228 
   229 
   230 
   231 
   232 (** rec: interface to Slind's TFL **)
   233 
   234 
   235 (*fname: name of function being defined; rel: well-founded relation*)
   236 fun mk_rec_decl ((((fname, rel), congs), ss), axms) =
   237   let val fid = trim fname
   238       val intrnl_name = fid ^ "_Intrnl"
   239   in
   240 	 (";\n\n\
   241           \val _ = writeln \"Recursive function " ^ fid ^ "\"\n\
   242           \val (thy, pats_" ^ intrnl_name ^ ") = Tfl.define thy " ^ 
   243 	                 quote fid ^ " " ^ 
   244 	                 rel ^ "\n" ^ mk_big_list axms ^ ";\n\
   245           \val thy = thy"
   246          ,
   247           "structure " ^ fid ^ " =\n\
   248           \  struct\n\
   249           \  val _ = writeln \"Proofs for recursive function " ^ fid ^ "\"\n\
   250           \  val {rules, induct, tcs} = \n\
   251           \    \t Tfl.simplify_defn (" ^ ss ^ ", " ^ congs ^ ")\n\
   252           \    \t\t  (thy, (" ^ quote fid ^ ", pats_" ^ intrnl_name ^ "))\n\
   253           \  end;\n\
   254           \val pats_" ^ intrnl_name ^ " = ();\n")
   255   end;
   256 
   257 val rec_decl = (name -- string -- 
   258 		optional ("congs" $$-- string >> trim) "[]" -- 
   259 		optional ("simpset" $$-- string >> trim) "!simpset" -- 
   260 		repeat1 string >> mk_rec_decl) ;
   261 
   262 
   263 
   264 (** augment thy syntax **)
   265 
   266 in
   267 
   268 val _ = ThySyn.add_syntax
   269  ["intrs", "monos", "con_defs", "congs", "simpset", "|"]
   270  [axm_section "typedef" "|> Typedef.add_typedef" typedef_decl,
   271   ("inductive", inductive_decl ""),
   272   ("coinductive", inductive_decl "Co"),
   273   ("datatype", datatype_decl),
   274   ("primrec", primrec_decl),
   275   ("recdef", rec_decl)];
   276 
   277 end;