intermed. ctxt ..: interrupted -- make x+1=2 go through first
fun step: does strange distinction ...
is_none (get_obj g_env pt (fst p))
(*^^^^^^^^: Apply_Method without init_form*)
... which is affected by SOME (_, ctxt) in env.
1 (* Title: Specify-phase: specifying and modeling a problem or a subproblem. The
2 most important types are declared in mstools.sml.
3 Author: Walther Neuper 991122, Mathias Lehnfeld
4 (c) due to copyright terms
6 12345678901234567890123456789012345678901234567890123456789012345678901234567890
7 10 20 30 40 50 60 70 80
10 (* TODO interne Funktionen aus sig entfernen *)
13 datatype additm = Add of SpecifyTools.itm | Err of string
14 val all_dsc_in : SpecifyTools.itm_ list -> Term.term list
15 val all_modspec : ptree * pos' -> ptree * pos'
16 datatype appl = Appl of tac_ | Notappl of string
20 SpecifyTools.ori list ->
21 SpecifyTools.itm list ->
22 (string * (Term.term * Term.term)) list -> cterm' -> additm
25 val chk_vars : term ppc -> string * Term.term list
27 theory -> int * term list * term list -> term
29 theory -> term list * term list -> term list
30 val complete_metitms :
31 SpecifyTools.ori list ->
32 SpecifyTools.itm list ->
33 SpecifyTools.itm list -> pat list -> SpecifyTools.itm list
34 val complete_mod_ : ori list * pat list * pat list * itm list ->
36 val complete_mod : ptree * pos' -> ptree * (pos * pos_)
37 val complete_spec : ptree * pos' -> ptree * pos'
39 pat list -> preori list -> pat -> preori
40 val e_calcstate : calcstate
41 val e_calcstate' : calcstate'
42 val eq1 : ''a -> 'b * (''a * 'c) -> bool
44 ''a -> Term.term -> 'b * 'c * 'd * ''a * SpecifyTools.itm_ -> bool
45 val eq4 : ''a -> 'b * ''a list * 'c * 'd * 'e -> bool
47 'a * 'b * 'c * 'd * SpecifyTools.itm_ ->
48 'e * 'f * 'g * Term.term * 'h -> bool
49 val eq_dsc : SpecifyTools.itm * SpecifyTools.itm -> bool
50 val eq_pos' : ''a * pos_ -> ''a * pos_ -> bool
51 val f_mout : theory -> mout -> Term.term
53 SpecifyTools.ori list ->
54 SpecifyTools.itm list -> SpecifyTools.ori list
56 SpecifyTools.ori list ->
57 ('a * (Term.term * 'b)) list -> SpecifyTools.ori list
58 val foldl1 : ('a * 'a -> 'a) -> 'a list -> 'a
59 val foldr1 : ('a * 'a -> 'a) -> 'a list -> 'a
60 val form : 'a -> ptree -> (string * ('a * pos_) * Term.term) list
61 val formres : 'a -> ptree -> (string * ('a * pos_) * Term.term) list
62 val gen_ins' : ('a * 'a -> bool) -> 'a * 'a list -> 'a list
64 (string * (pos * pos_) * Term.term) list list ->
65 pos -> ptree list -> (string * (pos * pos_) * Term.term) list
67 (string * (pos * pos_) * Term.term) list list ->
68 posel list -> ptree list -> (string * (pos * pos_) * Term.term) list
69 val get_interval : pos' -> pos' -> int -> ptree -> (pos' * term) list
70 val get_ocalhd : ptree * pos' -> ocalhd
71 val get_spec_form : tac_ -> pos' -> ptree -> mout
74 SpecifyTools.ori -> SpecifyTools.itm -> string * cterm'
75 val getr_ct : theory -> SpecifyTools.ori -> string * cterm'
76 val has_list_type : Term.term -> bool
77 val header : pos_ -> pblID -> metID -> pblmet
80 int * SpecifyTools.vats * bool * string * SpecifyTools.itm_ ->
81 SpecifyTools.itm list -> SpecifyTools.itm list
83 SpecifyTools.itm -> SpecifyTools.itm list -> SpecifyTools.itm list
84 val is_complete_mod : ptree * pos' -> bool
85 val is_complete_mod_ : SpecifyTools.itm list -> bool
86 val is_complete_modspec : ptree * pos' -> bool
87 val is_complete_spec : ptree * pos' -> bool
88 val is_copy_named : 'a * ('b * Term.term) -> bool
89 val is_copy_named_idstr : string -> bool
90 val is_error : SpecifyTools.itm_ -> bool
91 val is_field_correct : ''a -> ''b -> (''a * ''b list) list -> bool
95 SpecifyTools.ori list ->
96 Term.term -> string * SpecifyTools.ori * Term.term list
97 val is_list_type : Term.typ -> bool
100 SpecifyTools.itm list ->
103 ('a * (Term.term * Term.term)) list -> string * SpecifyTools.itm
104 val is_parsed : SpecifyTools.itm_ -> bool
105 val is_untouched : SpecifyTools.itm -> bool
110 (int list * string * Term.term * Term.term list) list ->
111 (int list * string * Term.term * Term.term list) list
113 theory -> pat list -> Term.term list -> SpecifyTools.ori list
114 val maxl : int list -> int
115 val match_ags_msg : string list -> Term.term -> Term.term list -> unit
116 val memI : ''a list -> ''a -> bool
117 val mk_additem : string -> cterm' -> tac
118 val mk_delete : theory -> string -> SpecifyTools.itm_ -> tac
120 theory -> pat -> Term.term -> SpecifyTools.preori option
123 SpecifyTools.ori list ->
124 (string * (Term.term * 'a)) list ->
125 SpecifyTools.itm list -> (string * cterm') option
126 val nxt_model_pbl : tac_ -> ptree * (int list * pos_) -> tac_
130 SpecifyTools.ori list ->
132 SpecifyTools.itm list * SpecifyTools.itm list ->
133 (string * (Term.term * 'a)) list * (string * (Term.term * 'b)) list ->
135 val nxt_specif : tac -> ptree * (int list * pos_) -> calcstate'
136 val nxt_specif_additem :
137 string -> cterm' -> ptree * (int list * pos_) -> calcstate'
138 val nxt_specify_init_calc : fmz -> calcstate
139 val ocalhd_complete :
140 SpecifyTools.itm list ->
141 (bool * Term.term) list -> domID * pblID * metID -> bool
143 pat list -> ori -> itm
146 Term.term -> Term.term list -> SpecifyTools.ori -> SpecifyTools.itm
149 int * SpecifyTools.vats * bool * string * SpecifyTools.itm_ ->
150 SpecifyTools.itm list ->
151 (int * SpecifyTools.vats * bool * string * SpecifyTools.itm_) list
152 val parse_ok : SpecifyTools.itm_ list -> bool
153 val posform2str : pos' * ptform -> string
154 val posforms2str : (pos' * ptform) list -> string
155 val posterms2str : (pos' * term) list -> string (*tests only*)
156 val ppc135list : 'a SpecifyTools.ppc -> 'a list
157 val ppc2list : 'a SpecifyTools.ppc -> 'a list
159 ptree * (int list * pos_) ->
160 ptform * tac option * Term.term list
161 val pt_form : ppobj -> ptform
162 val pt_model : ppobj -> pos_ -> ptform
163 val reset_calchead : ptree * pos' -> ptree * pos'
167 Term.term * Term.term list ->
168 (int * SpecifyTools.vats * string * Term.term * Term.term list) list
169 -> string * SpecifyTools.ori * Term.term list
174 (int * SpecifyTools.vats * string * Term.term * Term.term list) list
175 -> string * SpecifyTools.ori * Term.term list
177 int -> SpecifyTools.itm list -> SpecifyTools.itm option
178 val show_pt : ptree -> unit
179 val some_spec : spec -> spec -> spec
185 (posel list * pos_) * ((posel list * pos_) * istate) * mout * tac *
187 val specify_additem :
193 (pos * pos_) * ((pos * pos_) * istate) * mout * tac * safe * ptree
194 val tag_form : theory -> term * term -> term
195 val test_types : Proof.context -> Term.term * Term.term list -> string
196 val typeless : Term.term -> Term.term
197 val unbound_ppc : term SpecifyTools.ppc -> Term.term list
198 val vals_of_oris : SpecifyTools.ori list -> Term.term list
199 val variants_in : Term.term list -> int
200 val vars_of_pbl_ : ('a * ('b * Term.term)) list -> Term.term list
201 val vars_of_pbl_' : ('a * ('b * Term.term)) list -> Term.term list
208 structure CalcHead (**): CALC_HEAD(**) =
214 (*.the state wich is stored after each step of calculation; it contains
215 the calc-state and a list of [tac,istate](="tacis") to be applied next.
216 the last_elem tacis is the first to apply to the calc-state and
217 the (only) one shown to the front-end as the 'proposed tac'.
218 the calc-state resulting from the application of tacis is not stored,
219 because the tacis hold enough information for efficiently rebuilding
220 this state just by "fun generate ".*)
222 (ptree * pos') * (*the calc-state to which the tacis could be applied*)
223 (taci list); (*ev. several (hidden) steps;
224 in REVERSE order: first tac_ to apply is last_elem*)
225 val e_calcstate = ((EmptyPtree, e_pos'), [e_taci]):calcstate;
227 (*the state used during one calculation within the mathengine; it contains
228 a list of [tac,istate](="tacis") which generated the the calc-state;
229 while this state's tacis are extended by each (internal) step,
230 the calc-state is used for creating new nodes in the calc-tree
231 (eg. applicable_in requires several particular nodes of the calc-tree)
232 and then replaced by the the newly created;
233 on leave of the mathengine the resuing calc-state is dropped anyway,
234 because the tacis hold enought information for efficiently rebuilding
235 this state just by "fun generate ".*)
237 taci list * (*cas. several (hidden) steps;
238 in REVERSE order: first tac_ to apply is last_elem*)
239 pos' list * (*a "continuous" sequence of pos',
240 deleted by application of taci list*)
241 (ptree * pos'); (*the calc-state resulting from the application of tacis*)
242 val e_calcstate' = ([e_taci], [e_pos'], (EmptyPtree, e_pos')):calcstate';
244 (*FIXXXME.WN020430 intermediate hack for fun ass_up*)
245 fun f_mout thy (Form' (FormKF (_,_,_,_,f))) = (term_of o the o (parse thy)) f
246 | f_mout thy _ = error "f_mout: not called with formula";
249 (*.is the calchead complete ?.*)
250 fun ocalhd_complete (its: itm list) (pre: (bool * term) list) (dI,pI,mI) =
251 foldl and_ (true, map #3 its) andalso
252 foldl and_ (true, map #1 pre) andalso
253 dI<>e_domID andalso pI<>e_pblID andalso mI<>e_metID;
256 (* make a term 'typeless' for comparing with another 'typeless' term;
257 'type-less' usually is illtyped *)
258 fun typeless (Const(s,_)) = (Const(s,e_type))
259 | typeless (Free(s,_)) = (Free(s,e_type))
260 | typeless (Var(n,_)) = (Var(n,e_type))
261 | typeless (Bound i) = (Bound i)
262 | typeless (Abs(s,_,t)) = Abs(s,e_type, typeless t)
263 | typeless (t1 $ t2) = (typeless t1) $ (typeless t2);
265 > val (SOME ct) = parse thy "max_relation (A=#2*a*b - a^^^#2)";
266 > val (_,t1) = split_dsc_t hs (term_of ct);
267 > val (SOME ct) = parse thy "A=#2*a*b - a^^^#2";
268 > val (_,t2) = split_dsc_t hs (term_of ct);
269 > typeless t1 = typeless t2;
275 (*.to an input (d,ts) find the according ori and insert the ts.*)
276 (*WN.11.03: + dont take first inter<>[]*)
277 fun seek_oridts ctxt sel (d,ts) [] =
278 ("seek_oridts: input ('" ^
279 (Print_Mode.setmp [] (Syntax.string_of_term ctxt) (comp_dts (d,ts))) ^
280 "') not found in oris (typed)",
283 | seek_oridts ctxt sel (d,ts) ((id, vat, sel', d', ts')::oris) =
284 if sel = sel' andalso d = d' andalso (inter op = ts ts') <> [] then
285 ("", (id, vat, sel, d, inter op = ts ts'), ts') else
286 seek_oridts ctxt sel (d, ts) oris;
288 (*.to an input (_,ts) find the according ori and insert the ts.*)
289 fun seek_orits ctxt sel ts [] =
290 ("seek_orits: input (_, '" ^ strs2str (map (Print_Mode.setmp [](Syntax.string_of_term
292 "') not found in oris (typed)", e_ori_, [])
293 | seek_orits ctxt sel ts ((id,vat,sel',d,ts')::(oris:ori list)) =
294 if sel = sel' andalso (inter op = ts ts') <> []
297 (id,vat,sel,d, inter op = ts ts'):ori,
299 else (((strs2str' o map (Print_Mode.setmp [] (Syntax.string_of_term
304 else seek_orits ctxt sel ts oris;
306 > val ((id,vat,sel',d,ts')::(ori':ori)) = ori;
307 > seek_orits thy sel ts [(id,vat,sel',d,ts')];
308 uncaught exception TYPE
309 > seek_orits thy sel ts [];
310 uncaught exception TYPE
313 (*find_first item with #1 equal to id*)
314 fun seek_ppc id [] = NONE
315 | seek_ppc id (p::(ppc:itm list)) =
316 if id = #1 p then SOME p else seek_ppc id ppc;
320 (*---------------------------------------------(3) nach ptyps.sml 23.3.02*)
323 datatype appl = Appl of tac_ | Notappl of string;
325 fun ppc2list ({Given=gis,Where=whs,Find=fis,
326 With=wis,Relate=res}: 'a ppc) =
327 gis @ whs @ fis @ wis @ res;
328 fun ppc135list ({Given=gis,Find=fis,Relate=res,...}: 'a ppc) =
334 (* get the number of variants in a problem in 'original',
335 assumes equal descriptions in immediate sequence *)
337 let fun eq(x,y) = head_of x = head_of y;
338 fun cnt eq [] y n = ([n],[])
339 | cnt eq (x::xs) y n = if eq(x,y) then cnt eq xs y (n+1)
341 fun coll eq xs [] = xs
342 | coll eq xs (y::ys) =
343 let val (n,ys') = cnt eq (y::ys) y 0;
344 in if ys' = [] then xs @ n else coll eq (xs @ n) ys' end;
345 val vts = subtract op = [1] (distinct (coll eq [] ts));
346 in case vts of [] => 1 | [n] => n
347 | _ => error "different variants in formalization" end;
349 > cnt (op=) [2,2,2,4,5,5,5,5,5] 2 0;
350 val it = ([3],[4,5,5,5,5,5]) : int list * int list
351 > coll (op=) [] [1,2,2,2,4,5,5,5,5,5];
352 val it = [1,3,1,5] : int list
355 fun is_list_type (Type("List.list",_)) = true
356 | is_list_type _ = false;
357 (* fun destr (Type(str,sort)) = (str,sort);
358 > val (SOME ct) = parse thy "lll::real list";
359 > val ty = (#T o rep_cterm) ct;
363 val it = ("List.list",["RealDef.real"]) : string * typ list
364 > atomty ((#t o rep_cterm) ct);
366 *** Free ( lll, real list)
369 > val (SOME ct) = parse thy "[lll::real]";
370 > val ty = (#T o rep_cterm) ct;
374 val it = ("List.list",["'a"]) : string * typ list
375 > atomty ((#t o rep_cterm) ct);
377 *** Const ( List.list.Cons, [real, real list] => real list)
378 *** Free ( lll, real)
379 *** Const ( List.list.Nil, real list)
381 > val (SOME ct) = parse thy "lll";
382 > val ty = (#T o rep_cterm) ct;
384 val it = false : bool *)
387 fun has_list_type (Free(_,T)) = is_list_type T
388 | has_list_type _ = false;
390 > val (SOME ct) = parse thy "lll::real list";
391 > has_list_type (term_of ct);
393 > val (SOME ct) = parse thy "[lll::real]";
394 > has_list_type (term_of ct);
395 val it = false : bool *)
397 fun is_parsed (Syn _) = false
398 | is_parsed _ = true;
399 fun parse_ok its = foldl and_ (true, map is_parsed its);
401 fun all_dsc_in itm_s =
403 fun d_in (Cor ((d,_),_)) = [d]
406 | d_in (Inc ((d,_),_)) = [d]
407 | d_in (Sup (d,_)) = [d]
408 | d_in (Mis (d,_)) = [d];
409 in (flat o (map d_in)) itm_s end;
412 fun is_Syn (Syn _) = true
413 | is_Syn (Typ _) = true
416 fun is_error (Cor (_,ts)) = false
417 | is_error (Sup (_,ts)) = false
418 | is_error (Inc (_,ts)) = false
419 | is_error (Mis (_,ts)) = false
423 fun ct_in (Syn (c)) = c
424 | ct_in (Typ (c)) = c
425 | ct_in _ = error "ct_in called for Cor .. Sup";
428 (*#############################################################*)
429 (*#############################################################*)
430 (* vvv--- aus nnewcode.sml am 30.1.00 ---vvv *)
433 (* testdaten besorgen:
434 use"test-coil-kernel.sml";
435 val (PblObj{origin=(oris,_,_),meth={ppc=itms,...},...}) =
440 variant V: oris union ppc => int, id ID: oris union ppc => int
443 EX vt:V. ALL r:oris --> EX i:ppc. ID r = ID i & complete i
446 @vt = max sum(i : ppc) V i
452 > ((vts_cnt (vts_in itms))) itms;
457 > val vts = vts_in itms;
458 val vts = [1,2,3] : int list
459 > val nvts = vts_cnt vts itms;
460 val nvts = [(1,6),(2,5),(3,7)] : (int * int) list
461 > val mx = max2 nvts;
462 val mx = (3,7) : int * int
463 > val v = max_vt itms;
465 --------------------------
469 (*.get the first term in ts from ori.*)
470 (* val (_,_,fd,d,ts) = hd miss;
472 fun getr_ct thy ((_, _, fd, d, ts) : ori) =
473 (fd, (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) o
474 comp_dts) (d,[hd ts]) : cterm');
475 (* val t = comp_dts (d,[hd ts]);
478 (* get a term from ori, notyet input in itm.
479 the term from ori is thrown back to a string in order to reuse
480 machinery for immediate input by the user. *)
481 fun geti_ct thy ((_, _, _, d, ts) : ori) ((_, _, _, fd, itm_) : itm) =
482 (fd, Print_Mode.setmp [] ((Syntax.string_of_term (thy2ctxt thy)) o comp_dts)
483 (d, subtract op = (ts_in itm_) ts) : cterm');
484 fun geti_ct thy ((_, _, _, d, ts) : ori) ((_, _, _, fd, itm_) : itm) =
485 (fd, Print_Mode.setmp [] ((Syntax.string_of_term (thy2ctxt thy)) o comp_dts)
486 (d, subtract op = (ts_in itm_) ts) : cterm');
488 (* in FE dsc, not dat: this is in itms ...*)
489 fun is_untouched ((_,_,false,_,Inc((_,[]),_)):itm) = true
490 | is_untouched _ = false;
493 (* select an item in oris, notyet input in itms
494 (precondition: in itms are only Cor, Sup, Inc) *)
497 | x mem (y :: ys) = x = y orelse x mem ys;
499 fun nxt_add thy ([]:ori list) pbt itms = (*root (only) ori...fmz=[]*)
501 fun test_d d ((i,_,_,_,itm_):itm) = (d = (d_in itm_)) andalso i<>0;
502 fun is_elem itms (f,(d,t)) =
503 case find_first (test_d d) itms of
504 SOME _ => true | NONE => false;
505 in case filter_out (is_elem itms) pbt of
506 (* val ((f,(d,_))::itms) = filter_out (is_elem itms) pbt;
510 ((Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) o
511 comp_dts) (d, []) : cterm')
514 (* val (thy,itms) = (assoc_thy (if dI=e_domID then dI' else dI),pbl);
516 | nxt_add thy oris pbt itms =
518 fun testr_vt v ori = (curry (op mem) v) (#2 (ori:ori))
519 andalso (#3 ori) <>"#undef";
520 fun testi_vt v itm = (curry (op mem) v) (#2 (itm:itm));
521 fun test_id ids r = curry (op mem) (#1 (r:ori)) ids;
522 fun test_subset (itm:itm) ((_,_,_,d,ts):ori) =
523 (d_in (#5 itm)) = d andalso subset op = (ts_in (#5 itm), ts);
524 fun false_and_not_Sup((i,v,false,f,Sup _):itm) = false
525 | false_and_not_Sup (i,v,false,f, _) = true
526 | false_and_not_Sup _ = false;
528 val v = if itms = [] then 1 else max_vt itms;
529 val vors = if v = 0 then oris else filter (testr_vt v) oris;(*oris..vat*)
530 val vits = if v = 0 then itms (*because of dsc without dat*)
531 else filter (testi_vt v) itms; (*itms..vat*)
532 val icl = filter false_and_not_Sup vits; (* incomplete *)
534 then case filter_out (test_id (map #1 vits)) vors of
536 (* val miss = filter_out (test_id (map #1 vits)) vors;
538 | miss => SOME (getr_ct thy (hd miss))
540 case find_first (test_subset (hd icl)) vors of
541 (* val SOME ori = find_first (test_subset (hd icl)) vors;
543 NONE => error "nxt_add: EX itm. not(dat(itm)<=dat(ori))"
544 | SOME ori => SOME (geti_ct thy ori (hd icl))
550 fun mk_delete thy "#Given" itm_ = Del_Given (itm_out thy itm_)
551 | mk_delete thy "#Find" itm_ = Del_Find (itm_out thy itm_)
552 | mk_delete thy "#Relate" itm_ = Del_Relation(itm_out thy itm_)
553 | mk_delete thy str _ =
554 error ("mk_delete: called with field '"^str^"'");
555 fun mk_additem "#Given" ct = Add_Given ct
556 | mk_additem "#Find" ct = Add_Find ct
557 | mk_additem "#Relate"ct = Add_Relation ct
559 error ("mk_additem: called with field '"^str^"'");
562 (* determine the next step of specification;
563 not done here: Refine_Tacitly (otherwise *** unknown method: (..., no_met))
564 eg. in rootpbl 'no_met':
566 preok predicates are _all_ ok (and problem matches completely)
567 oris immediately from formalization
568 (dI',pI',mI') specification coming from author/parent-problem
569 (pbl, item lists specified by user
570 met) -"-, tacitly completed by copy_probl
571 (dI,pI,mI) specification explicitly done by the user
572 (pbt, mpc) problem type, guard of method
574 fun nxt_spec Pbl preok (oris : ori list) ((dI', pI', mI') : spec)
575 ((pbl : itm list), (met : itm list)) (pbt, mpc) ((dI, pI, mI) : spec) =
576 ((*tracing"### nxt_spec Pbl";*)
577 if dI' = e_domID andalso dI = e_domID then (Pbl, Specify_Theory dI')
578 else if pI' = e_pblID andalso pI = e_pblID then (Pbl, Specify_Problem pI')
579 else case find_first (is_error o #5) (pbl:itm list) of
580 SOME (_, _, _, fd, itm_) =>
582 (assoc_thy (if dI = e_domID then dI' else dI)) fd itm_)
584 ((*tracing"### nxt_spec is_error NONE";*)
585 case nxt_add (assoc_thy (if dI = e_domID then dI' else dI))
587 SOME (fd,ct') => ((*tracing"### nxt_spec nxt_add SOME";*)
588 (Pbl, mk_additem fd ct'))
589 | NONE => (*pbl-items complete*)
590 if not preok then (Pbl, Refine_Problem pI')
592 if dI = e_domID then (Pbl, Specify_Theory dI')
593 else if pI = e_pblID then (Pbl, Specify_Problem pI')
594 else if mI = e_metID then (Pbl, Specify_Method mI')
596 case find_first (is_error o #5) met of
597 SOME (_,_,_,fd,itm_) =>
598 (Met, mk_delete (assoc_thy dI) fd itm_)
600 (case nxt_add (assoc_thy dI) oris mpc met of
601 SOME (fd,ct') => (*30.8.01: pre?!?*)
602 (Met, mk_additem fd ct')
604 ((*Solv 3.4.00*)Met, Apply_Method mI))))
606 | nxt_spec Met preok oris (dI',pI',mI') (pbl, met) (pbt,mpc) (dI,pI,mI) =
607 ((*tracing"### nxt_spec Met"; *)
608 case find_first (is_error o #5) met of
609 SOME (_,_,_,fd,itm_) =>
610 (Met, mk_delete (assoc_thy (if dI=e_domID then dI' else dI)) fd itm_)
612 case nxt_add (assoc_thy (if dI=e_domID then dI' else dI))oris mpc met of
613 SOME (fd,ct') => (Met, mk_additem fd ct')
615 ((*tracing"### nxt_spec Met: nxt_add NONE";*)
616 if dI = e_domID then (Met, Specify_Theory dI')
617 else if pI = e_pblID then (Met, Specify_Problem pI')
618 else if not preok then (Met, Specify_Method mI)
619 else (Met, Apply_Method mI)));
622 val itms = [(1,[1],true,"#Find",Cor(e_term,[e_term])):itm,
623 (2,[2],true,"#Find",Syn("empty"))];
626 fun is_field_correct sel d dscpbt =
627 case assoc (dscpbt, sel) of
629 | SOME ds => member op = ds d;
631 (*. update the itm_ already input, all..from ori .*)
632 (* val (id,vt,fd,d,ts) = (i,v,f,d,ts\\ts');
634 fun ori_2itm itm_ pid all ((id,vt,fd,d,ts):ori) =
636 val ts' = union op = (ts_in itm_) ts;
637 val pval = pbl_ids' d ts'
638 (*WN.9.5.03: FIXXXME [#0, epsilon]
639 here would upd_penv be called for [#0, epsilon] etc. *)
640 val complete = if eq_set op = (ts', all) then true else false;
643 (if fd = "#undef" then (id,vt,complete,fd,Sup(d,ts'))
644 else (id,vt,complete,fd,Cor((d,ts'),(pid, pval)))):itm
645 | (Syn c) => error ("ori_2itm wants to overwrite "^c)
646 | (Typ c) => error ("ori_2itm wants to overwrite "^c)
647 | (Inc _) => if complete
648 then (id,vt,true ,fd, Cor ((d,ts'),(pid, pval)))
649 else (id,vt,false,fd, Inc ((d,ts'),(pid, pval)))
650 | (Sup ((*_,_*)d,ts')) => (*4.9.01 lost env*)
651 (*if fd = "#undef" then*) (id,vt,complete,fd,Sup(d,ts'))
652 (*else (id,vt,complete,fd,Cor((d,ts'),e))*)
653 (* 28.1.00: not completely clear ---^^^ etc.*)
654 (* 4.9.01: Mis just copied---vvv *)
655 | (Mis _) => if complete
656 then (id,vt,true ,fd, Cor ((d,ts'),(pid, pval)))
657 else (id,vt,false,fd, Inc ((d,ts'),(pid, pval)))
661 fun eq1 d (_,(d',_)) = (d = d');
662 fun eq3 f d (_,_,_,f',itm_) = f = f' andalso d = (d_in itm_);
665 (* 'all' ts from ori; ts is the input; (ori carries rest of info)
666 9.01: this + ori_2itm is _VERY UNCLEAR_ ? overhead ?
667 pval: value for problem-environment _NOT_ checked for 'inter' --
668 -- FIXXME.WN.11.03 the generation of penv has to go to insert_ppc
669 (as it has been done for input_icalhd+insert_ppc' in 11.03)*)
670 (*. is_input ori itms <=>
671 EX itm. (1) ori(field,dsc) = itm(field,dsc) & (2..4)
672 (2) ori(ts) subset itm(ts) --- Err "already input"
673 (3) ori(ts) inter itm(ts) = empty --- new: ori(ts)
674 (4) -"- <> empty --- new: ori(ts) \\ inter .*)
675 (* val(itms,(i,v,f,d,ts)) = (ppc,ori');
677 fun is_notyet_input ctxt (itms:itm list) all ((i,v,f,d,ts):ori) pbt =
678 case find_first (eq1 d) pbt of
679 SOME (_,(_,pid)) =>(* val SOME (_,(_,pid)) = find_first (eq1 d) pbt;
680 val SOME (_,_,_,_,itm_)=find_first (eq3 f d) itms;
682 (case find_first (eq3 f d) itms of
683 SOME (_,_,_,_,itm_) =>
685 val ts' = inter op = (ts_in itm_) ts;
686 in if subset op = (ts, ts')
688 map (Print_Mode.setmp [] (Syntax.string_of_term ctxt))) ts') ^
689 " already input", e_itm) (*2*)
691 ori_2itm itm_ pid all (i,v,f,d,
692 subtract op = ts' ts)) (*3,4*)
694 | NONE => ("", ori_2itm (Inc ((e_term,[]),(pid,[])))
695 pid all (i,v,f,d,ts)) (*1*)
697 | NONE => ("", ori_2itm (Sup (d,ts))
698 e_term all (i,v,f,d,ts));
700 fun test_types ctxt (d,ts) =
702 (*val s = !show_types; val _ = show_types:= true;*)
703 val opt = (try comp_dts) (d,ts);
704 val msg = case opt of
706 | NONE => ((Print_Mode.setmp [] (Syntax.string_of_term ctxt) d) ^
708 ((strs2str' o map (Print_Mode.setmp [] (Syntax.string_of_term
711 (*val _ = show_types:= s*)
716 fun maxl [] = error "maxl of []"
719 | mx x (y::ys) = if x < (y:int) then mx y ys else mx x ys
723 (*. is the input term t known in oris ?
724 give feedback on all(?) strange input;
725 return _all_ terms already input to this item (e.g. valuesFor a,b) .*)
726 (*WN.11.03: from lists*)
727 fun is_known ctxt sel ori t =
728 (* val (ori,t)=(oris,term_of ct);
731 val _ = tracing ("RM is_known: t=" ^ term2str t);
732 val ots = (distinct o flat o (map #5)) (ori:ori list);
733 val oids = ((map (fst o dest_Free)) o distinct o
734 flat o (map vars)) ots;
735 val (d,ts(*,pval*)) = split_dts t;
736 val ids = map (fst o dest_Free)
737 ((distinct o (flat o (map vars))) ts);
738 in if (subtract op = oids ids) <> []
739 then (("identifiers "^(strs2str' (subtract op = oids ids))^
740 " not in example"), e_ori_, [])
744 if not (subset op = (map typeless ts, map typeless ots))
747 (map (Print_Mode.setmp [] (Syntax.string_of_term
749 "' not in example (typeless)"), e_ori_, [])
750 else (case seek_orits ctxt sel ts ori of
751 ("", ori_ as (_,_,_,d,ts), all) =>
752 (case test_types ctxt (d,ts) of
753 "" => ("", ori_, all)
754 | msg => (msg, e_ori_, []))
755 | (msg,_,_) => (msg, e_ori_, []))
757 if member op = (map #4 ori) d
758 then seek_oridts ctxt sel (d,ts) ori
759 else ((Print_Mode.setmp [] (Syntax.string_of_term ctxt) d) ^
760 " not in example", (0, [], sel, d, ts), [])
764 (*. for return-value of appl_add .*)
767 | Err of string; (*error-message*)
770 (** add an item to the model; check wrt. oris and pbt **)
771 (* in contrary to oris<>[] below, this part handles user-input
772 extremely acceptive, i.e. accept input instead error-msg *)
773 fun appl_add ctxt sel [] ppc pbt ct =
775 val i = 1 + (if ppc = [] then 0 else map #1 ppc |> maxl);
777 case parseNEW ctxt ct of
778 NONE => Add (i, [], false, sel, Syn ct)
780 let val (d, ts) = split_dts t;
783 then Add (i, [], false, sel, Mis (dsc_unknown, hd ts))
785 (case find_first (eq1 d) pbt of
786 NONE => Add (i, [], true, sel, Sup (d,ts))
787 | SOME (f, (_, id)) =>
788 let fun eq2 d (i, _, _, _, itm_) =
789 d = (d_in itm_) andalso i <> 0;
790 in case find_first (eq2 d) ppc of
791 NONE => Add (i, [], true, f,Cor ((d, ts), (id, pbl_ids' d ts)))
792 | SOME (i', _, _, _, itm_) =>
796 val in_itm = ts_in itm_;
797 val ts' = union op = ts in_itm;
798 val i'' = if in_itm = [] then i else i';
799 in Add (i'', [], true, f, Cor ((d, ts'), (id, pbl_ids' d ts'))) end
800 else Add (i', [], true, f, Cor ((d, ts),(id, pbl_ids' d ts)))
804 | appl_add ctxt sel oris ppc pbt str =
805 case parseNEW ctxt str of
806 NONE => Err ("appl_add: syntax error in '" ^ str ^ "'")
808 case is_known ctxt sel oris t of
810 (case is_notyet_input ctxt ppc all ori' pbt of
812 | (msg, _) => Err ("[error] appl_add: is_notyet_input: " ^ msg))
813 | (msg, _, _) => Err ("[error] appl_add: is_known: " ^ msg);
816 (** make oris from args of the stac SubProblem and from pbt **)
817 (* can this formal argument (of a model-pattern) be omitted in the arg-list
818 of a SubProblem ? see ME/ptyps.sml 'type met ' *)
819 fun is_copy_named_idstr str =
820 case (rev o Symbol.explode) str of
821 "'":: _ ::"'"::_ => (tracing ((strs2str o (rev o Symbol.explode))
822 "is_copy_named_idstr: " ^ str ^ " T"); true)
823 | _ => (tracing ((strs2str o (rev o Symbol.explode))
824 "is_copy_named_idstr: " ^ str ^ " F"); false);
825 fun is_copy_named (_, (_, t)) = (is_copy_named_idstr o free2str) t;
827 (*.should this formal argument (of a model-pattern) create a new identifier?.*)
828 fun is_copy_named_generating_idstr str =
829 if is_copy_named_idstr str
830 then case (rev o Symbol.explode) str of
831 "'"::"'"::"'"::_ => false
834 fun is_copy_named_generating (_, (_, t)) =
835 (is_copy_named_generating_idstr o free2str) t;
837 (*.split type-wrapper from scr-arg and build part of an ori;
838 an type-error is reported immediately, raises an exn,
839 subsequent handling of exn provides 2nd part of error message.*)
840 fun mtc thy ((str, (dsc, _)):pat) (ty $ var) =
841 (* val (thy, (str, (dsc, _)), (ty $ var)) =
844 (cterm_of thy (dsc $ var);(*type check*)
845 SOME ((([1], str, dsc, (*[var]*)
846 split_dts' (dsc, var))): preori)(*:ori without leading #*))
847 handle e as TYPE _ =>
848 (tracing (dashs 70 ^ "\n"
849 ^"*** ERROR while creating the items for the model of the ->problem\n"
850 ^"*** from the ->stac with ->typeconstructor in arglist:\n"
851 ^"*** item (->description ->value): "^term2str dsc^" "^term2str var^"\n"
852 ^"*** description: "^(term_detail2str dsc)
853 ^"*** value: "^(term_detail2str var)
854 ^"*** typeconstructor in script: "^(term_detail2str ty)
855 ^"*** checked by theory: "^(theory2str thy)^"\n"
857 (*OldGoals.print_exn e; raises exn again*)
858 writeln (PolyML.makestring e);
860 (*raise ERROR "actual args do not match formal args";FIXXXME.WN100916*)
863 (*.match each pat of the model-pattern with an actual argument;
864 precondition: copy-named vars are filtered out.*)
865 fun matc thy ([]:pat list) _ (oris:preori list) = oris
866 | matc thy pbt [] _ =
868 error ("actual arg(s) missing for '"^pats2str pbt
869 ^"' i.e. should be 'copy-named' by '*_._'"))
870 | matc thy ((p as (s,(d,t)))::pbt) (a::ags) oris =
871 (* val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
872 (thy, pbt', ags, []);
874 val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
875 (thy, pbt, ags, (oris @ [ori]));
877 (*del?..*)if (is_copy_named_idstr o free2str) t then oris
878 else(*..del?*) let val opt = mtc thy p a;
880 (* val SOME ori = mtc thy p a;
882 SOME ori => matc thy pbt ags (oris @ [ori])
883 | NONE => [](*WN050903 skipped by exn handled in match_ags*)
885 (* run subp-rooteq.sml until Init_Proof before ...
886 > val Nd (PblObj {origin=(oris,_,_),...},_) = pt;(*from test/subp-rooteq.sml*)
887 > fun xxxfortest (_,a,b,c,d) = (a,b,c,d);val oris = map xxxfortest oris;
889 other vars as in mtc ..
890 > matc thy (drop_last pbt) ags [];
891 val it = ([[1],"#Given",Const #,[#]),(0,[#],"#Given",Const #,[#])],2)*)
894 (* generate a new variable "x_i" name from a related given one "x"
895 by use of oris relating "v_i_" (is_copy_named!) to "v_"
896 e.g. (v_, x) & (v_i_, ?) --> (v_i_, x_i) *)
898 (* generate a new variable "x_i" name from a related given one "x"
899 by use of oris relating "v_v'i'" (is_copy_named!) to "v_v"
900 e.g. (v_v, x) & (v_v'i', ?) --> (v_v'i', x_i),
901 but leave is_copy_named_generating as is, e.t. ss''' *)
902 fun cpy_nam (pbt:pat list) (oris:preori list) (p as (field,(dsc,t)):pat) =
903 (if is_copy_named_generating p
904 then (*WN051014 kept strange old code ...*)
905 let fun sel (_,_,d,ts) = comp_ts (d, ts)
906 val cy' = (implode o (drop_last_n 3) o Symbol.explode o free2str) t
907 val ext = (last_elem o drop_last o Symbol.explode o free2str) t
908 val vars' = map (free2str o snd o snd) pbt (*cpy-nam filtered_out*)
909 val vals = map sel oris
910 val cy_ext = (free2str o the) (assoc (vars'~~vals, cy'))^"_"^ext
911 in ([1], field, dsc, [mk_free (type_of t) cy_ext]):preori end
912 else ([1], field, dsc, [t])
914 handle _ => error ("cpy_nam: for "^(term2str t));
916 (*.match the actual arguments of a SubProblem with a model-pattern
917 and create an ori list (in root-pbl created from formalization).
918 expects ags:pats = 1:1, while copy-named are filtered out of pats;
919 if no 1:1 the exn raised by matc/mtc and handled at call.
920 copy-named pats are appended in order to get them into the model-items.*)
921 fun match_ags thy (pbt:pat list) ags =
922 let fun flattup (i,(var,bool,str,itm_)) = (i,var,bool,str,itm_);
923 val pbt' = filter_out is_copy_named pbt;
924 val cy = filter is_copy_named pbt;
925 val oris' = matc thy pbt' ags [];
926 val cy' = map (cpy_nam pbt' oris') cy;
927 val ors = add_id (oris' @ cy');
928 (*appended in order to get ^^^^^ into the model-items*)
929 in (map flattup ors):ori list end;
931 (*.report part of the error-msg which is not available in match_args.*)
932 fun match_ags_msg pI stac ags =
933 let (*val s = !show_types
934 val _ = show_types:= true*)
935 val pats = (#ppc o get_pbt) pI
936 val msg = (dots 70^"\n"
937 ^"*** problem "^strs2str pI^" has the ...\n"
938 ^"*** model-pattern "^pats2str pats^"\n"
939 ^"*** stac '"^term2str stac^"' has the ...\n"
940 ^"*** arg-list "^terms2str ags^"\n"
942 (*WN100921 ^^^^ expect TYPE errormsg below; lost with Isa09*)
943 (*val _ = show_types:= s*)
947 (*get the variables out of a pbl_; FIXME.WN.0311: is_copy_named ...obscure!!!*)
948 fun vars_of_pbl_ pbl_ =
949 let fun var_of_pbl_ (gfr,(dsc,t)) = t
950 in ((map var_of_pbl_) o (filter_out is_copy_named)) pbl_ end;
951 fun vars_of_pbl_' pbl_ =
952 let fun var_of_pbl_ (gfr,(dsc,t)) = t:term
953 in ((map var_of_pbl_)(* o (filter_out is_copy_named)*)) pbl_ end;
955 fun overwrite_ppc thy itm ppc =
957 fun repl ppc' (_,_,_,_,itm_) [] =
958 error ("overwrite_ppc: " ^ (itm_2str_ (thy2ctxt thy) itm_) ^
960 | repl ppc' itm (p::ppc) =
961 if (#1 itm) = (#1 (p:itm)) then ppc' @ [itm] @ ppc
962 else repl (ppc' @ [p]) itm ppc
963 in repl [] itm ppc end;
965 (*10.3.00: insert the already compiled itm into model;
966 ev. filter_out untouched (in FE: (0,...)) item related to insert-item *)
969 fun insert_ppc thy itm ppc =
971 fun eq_untouched d ((0,_,_,_,itm_):itm) = (d = d_in itm_)
972 | eq_untouched _ _ = false;
975 (*tracing("### insert_ppc: itm= "^(itm2str_ itm));*)
976 case seek_ppc (#1 itm) ppc of
977 (* val SOME xxx = seek_ppc (#1 itm) ppc;
979 SOME _ => (*itm updated in is_notyet_input WN.11.03*)
980 overwrite_ppc thy itm ppc
981 | NONE => (ppc @ [itm]));
982 in filter_out (eq_untouched ((d_in o #5) itm)) ppc' end;
984 (*from Isabelle/src/Pure/library.ML, _appends_ a new element*)
985 fun gen_ins' eq (x, xs) = if gen_mem eq (x, xs) then xs else xs @ [x];
987 fun eq_dsc ((_,_,_,_,itm_):itm, (_,_,_,_,iitm_):itm) =
988 (d_in itm_) = (d_in iitm_);
989 (*insert_ppc = insert_ppc' for appl_add', input_icalhd 11.03,
990 handles superfluous items carelessly*)
991 fun insert_ppc' itm itms = gen_ins' eq_dsc (itm, itms);
993 > gen_ins' eee (4,[1,3,5,7]);
994 val it = [1, 3, 5, 7, 4] : int list*)
997 (*. output the headline to a ppc .*)
998 fun header p_ pI mI =
999 case p_ of Pbl => Problem (if pI = e_pblID then [] else pI)
1001 | pos => error ("header called with "^ pos_2str pos);
1004 fun specify_additem sel (ct,_) (p,Met) c pt =
1006 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1007 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1008 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1009 (*val ppt = if pI = e_pblID then get_pbt pI' else get_pbt pI;*)
1010 val cpI = if pI = e_pblID then pI' else pI;
1011 val cmI = if mI = e_metID then mI' else mI;
1012 val {ppc,pre,prls,...} = get_met cmI;
1013 val ctxt = get_ctxt pt (p,Met);
1014 in case appl_add ctxt sel oris met ppc ct of
1015 Add itm (*..union old input *) =>
1016 let (* val Add itm = appl_add thy sel oris met (#ppc (get_met cmI)) ct;
1018 val met' = insert_ppc thy itm met;
1019 (*val pt' = update_met pt p met';*)
1020 val ((p,Met),_,_,pt') =
1021 generate1 thy (case sel of
1022 "#Given" => Add_Given' (ct, met')
1023 | "#Find" => Add_Find' (ct, met')
1024 | "#Relate"=> Add_Relation'(ct, met'))
1025 (Uistate, e_ctxt) (p,Met) pt
1026 val pre' = check_preconds thy prls pre met'
1027 val pb = foldl and_ (true, map fst pre')
1028 (*val _=tracing("@@@ specify_additem: Met Add before nxt_spec")*)
1030 nxt_spec Met pb oris (dI',pI',mI') (pbl,met')
1031 ((#ppc o get_pbt) cpI,ppc) (dI,pI,mI);
1032 in ((p,p_), ((p,p_),Uistate),
1033 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1034 (Method cmI, itms2itemppc thy met' pre'))),
1037 let val pre' = check_preconds thy prls pre met
1038 val pb = foldl and_ (true, map fst pre')
1039 (*val _=tracing("@@@ specify_additem: Met Err before nxt_spec")*)
1041 nxt_spec Met pb oris (dI',pI',mI') (pbl,met)
1042 ((#ppc o get_pbt) cpI,(#ppc o get_met) cmI) (dI,pI,mI);
1043 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1047 | specify_additem sel (ct,_) (pos as (p,_(*Frm, Pbl*))) c pt =
1049 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1050 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1051 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1052 val cpI = if pI = e_pblID then pI' else pI;
1053 val cmI = if mI = e_metID then mI' else mI;
1054 val {ppc,where_,prls,...} = get_pbt cpI;
1055 val ctxt = get_ctxt pt pos;
1056 in case appl_add ctxt sel oris pbl ppc ct of
1057 Add itm (*..union old input *) =>
1058 (* val Add itm = appl_add thy sel oris pbl ppc ct;
1061 (*val _= tracing("###specify_additem: itm= "^(itm2str_ itm));*)
1062 val pbl' = insert_ppc thy itm pbl
1063 val ((p,Pbl),_,_,pt') =
1064 generate1 thy (case sel of
1065 "#Given" => Add_Given' (ct, pbl')
1066 | "#Find" => Add_Find' (ct, pbl')
1067 | "#Relate"=> Add_Relation'(ct, pbl'))
1068 (Uistate, e_ctxt) (p,Pbl) pt
1069 val pre = check_preconds thy prls where_ pbl'
1070 val pb = foldl and_ (true, map fst pre)
1071 (*val _=tracing("@@@ specify_additem: Pbl Add before nxt_spec")*)
1073 nxt_spec Pbl pb oris (dI',pI',mI') (pbl',met)
1074 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1075 val ppc = if p_= Pbl then pbl' else met;
1076 in ((p,p_), ((p,p_),Uistate),
1077 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1079 itms2itemppc thy ppc pre))), nxt,Safe,pt') end
1082 let val pre = check_preconds thy prls where_ pbl
1083 val pb = foldl and_ (true, map fst pre)
1084 (*val _=tracing("@@@ specify_additem: Pbl Err before nxt_spec")*)
1086 nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1087 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1088 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1091 fun specify (Init_Proof' (fmz,(dI',pI',mI'))) (_:pos') (_:cid) (_:ptree)=
1092 let (* either """"""""""""""" all empty or complete *)
1093 val thy = assoc_thy dI';
1095 if dI' = e_domID orelse pI' = e_pblID
1097 else pI' |> #ppc o get_pbt |> prep_ori fmz thy
1098 val (pt,c) = cappend_problem e_ptree [] (e_istate, ctxt) (fmz,(dI',pI',mI'))
1099 (oris, (dI',pI',mI'),e_term)
1100 (*val pt = update_env pt [] (SOME (e_istate, ctxt)) GOON.WN110506*)
1101 val {ppc, prls, where_, ...} = get_pbt pI'
1102 val (pbl, pre, pb) = ([], [], false)
1106 (([], Pbl), (([], Pbl), Uistate),
1107 Form' (PpcKF (0, EdUndef, (length []), Nundef,
1108 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1109 Refine_Tacitly pI', Safe, pt)
1111 (([], Pbl), (([], Pbl), Uistate),
1112 Form' (PpcKF (0, EdUndef, (length []), Nundef,
1113 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1114 Model_Problem, Safe, pt)
1117 (*ONLY for STARTING modeling phase*)
1118 | specify (Model_Problem' (_,pbl,met)) (pos as (p,p_)) c pt =
1120 val (PblObj{origin=(oris,(dI',pI',mI'),_), spec=(dI,_,_),...}) = get_obj I pt p
1121 val thy' = if dI = e_domID then dI' else dI
1122 val thy = assoc_thy thy'
1123 val {ppc,prls,where_,...} = get_pbt pI'
1124 val pre = check_preconds thy prls where_ pbl
1125 val pb = foldl and_ (true, map fst pre)
1126 val ((p,_),_,_,pt) = generate1 thy (Model_Problem'([],pbl,met)) (Uistate, e_ctxt) pos pt
1127 val (_,nxt) = nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1128 (ppc,(#ppc o get_met) mI') (dI',pI',mI');
1129 in ((p, Pbl), ((p, p_), Uistate),
1130 Form' (PpcKF (0, EdUndef, length p, Nundef,
1131 (Problem pI', itms2itemppc (assoc_thy dI') pbl pre))),
1135 (*. called only if no_met is specified .*)
1136 | specify (Refine_Tacitly' (pI,pIre,_,_,_)) (pos as (p,_)) c pt =
1138 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met, ...}) = get_obj I pt p;
1139 val {prls,met,ppc,thy,where_,...} = get_pbt pIre
1140 val (domID, metID) =
1141 (string_of_thy thy, if length met = 0 then e_metID else hd met)
1142 val ((p,_),_,_,pt) =
1143 generate1 thy (Refine_Tacitly'(pI,pIre,domID,metID,(*pbl*)[]))
1144 (Uistate, e_ctxt) pos pt
1145 val (pbl, pre, pb) = ([], [], false)
1146 in ((p, Pbl), (pos, Uistate),
1147 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1148 (Problem pIre, itms2itemppc (assoc_thy dI') pbl pre))),
1149 Model_Problem, Safe, pt)
1152 | specify (Refine_Problem' (rfd as (pI,_))) pos c pt =
1154 val (pos,_,_,pt) = generate1 (assoc_thy "Isac")
1155 (Refine_Problem' rfd) (Uistate, e_ctxt) pos pt
1156 in (pos(*p,Pbl*), (pos(*p,Pbl*),Uistate), Problems (RefinedKF rfd),
1157 Model_Problem, Safe, pt)
1160 | specify (Specify_Problem' (pI, (ok, (itms, pre)))) (pos as (p,_)) c pt =
1161 let val (PblObj {origin=(oris,(dI',pI',mI'),_), spec=(dI,_,mI),
1162 meth=met, ...}) = get_obj I pt p;
1163 (*val pt = update_pbl pt p itms;
1164 val pt = update_pblID pt p pI;*)
1165 val thy = assoc_thy dI
1166 val ((p,Pbl),_,_,pt)=
1167 generate1 thy (Specify_Problem' (pI, (ok, (itms, pre)))) (Uistate, e_ctxt) pos pt
1168 val dI'' = assoc_thy (if dI=e_domID then dI' else dI);
1169 val mI'' = if mI=e_metID then mI' else mI;
1170 (*val _=tracing("@@@ specify (Specify_Problem) before nxt_spec")*)
1171 val (_,nxt) = nxt_spec Pbl ok oris (dI',pI',mI') (itms, met)
1172 ((#ppc o get_pbt) pI,(#ppc o get_met) mI'') (dI,pI,mI);
1173 in ((p,Pbl), (pos,Uistate),
1174 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1175 (Problem pI, itms2itemppc dI'' itms pre))),
1177 (* val Specify_Method' mID = nxt; val (p,_) = p;
1178 val Specify_Method' mID = m;
1179 specify (Specify_Method' mID) (p,p_) c pt;
1181 | specify (Specify_Method' (mID,_,_)) (pos as (p,_)) c pt =
1182 let val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1183 meth=met, ...}) = get_obj I pt p;
1184 val {ppc,pre,prls,...} = get_met mID
1185 val thy = assoc_thy dI
1186 val oris = add_field' thy ppc oris;
1187 (*val pt = update_oris pt p oris; 20.3.02: repl. "#undef"*)
1188 val dI'' = if dI=e_domID then dI' else dI;
1189 val pI'' = if pI = e_pblID then pI' else pI;
1190 val met = if met=[] then pbl else met;
1191 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1192 (*val pt = update_met pt p itms;
1193 val pt = update_metID pt p mID*)
1195 generate1 thy (Specify_Method' (mID, oris, itms)) (Uistate, e_ctxt) pos pt
1196 (*val _=tracing("@@@ specify (Specify_Method) before nxt_spec")*)
1197 val (_,nxt) = nxt_spec Met (*ok*)true oris (dI',pI',mI') (pbl, itms)
1198 ((#ppc o get_pbt) pI'',ppc) (dI'',pI'',mID);
1199 in (pos, (pos,Uistate),
1200 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1201 (Method mID, itms2itemppc (assoc_thy dI'') itms pre'))),
1203 (* val Add_Find' ct = nxt; val sel = "#Find";
1205 | specify (Add_Given' ct) p c pt = specify_additem "#Given" ct p c pt
1206 | specify (Add_Find' ct) p c pt = specify_additem "#Find" ct p c pt
1207 | specify (Add_Relation' ct) p c pt=specify_additem"#Relate"ct p c pt
1208 (* val Specify_Theory' domID = m;
1209 val (Specify_Theory' domID, (p,p_)) = (m, pos);
1211 | specify (Specify_Theory' domID) (pos as (p,p_)) c pt =
1212 let val p_ = case p_ of Met => Met | _ => Pbl
1213 val thy = assoc_thy domID;
1214 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met,
1215 probl=pbl, spec=(dI,pI,mI),...}) = get_obj I pt p;
1216 val mppc = case p_ of Met => met | _ => pbl;
1217 val cpI = if pI = e_pblID then pI' else pI;
1218 val {prls=per,ppc,where_=pwh,...} = get_pbt cpI
1219 val cmI = if mI = e_metID then mI' else mI;
1220 val {prls=mer,ppc=mpc,pre=mwh,...} = get_met cmI
1223 Met => (check_preconds thy mer mwh met)
1224 | _ => (check_preconds thy per pwh pbl)
1225 val pb = foldl and_ (true, map fst pre)
1228 (*val _=tracing("@@@ specify (Specify_Theory) THEN before nxt_spec")*)
1229 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI')
1230 (pbl,met) (ppc,mpc) (dI,pI,mI);
1231 in ((p,p_), (pos,Uistate),
1232 Form'(PpcKF (0,EdUndef,(length p), Nundef,
1233 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1235 else (*FIXME: check ppc wrt. (new!) domID ..? still parsable?*)
1237 (*val pt = update_domID pt p domID;11.8.03*)
1238 val ((p,p_),_,_,pt) = generate1 thy (Specify_Theory' domID)
1239 (Uistate, e_ctxt) (p,p_) pt
1240 (*val _=tracing("@@@ specify (Specify_Theory) ELSE before nxt_spec")*)
1241 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI') (pbl,met)
1242 (ppc,mpc) (domID,pI,mI);
1243 in ((p,p_), (pos,Uistate),
1244 Form' (PpcKF (0, EdUndef, (length p),Nundef,
1245 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1248 (* itms2itemppc thy [](*mpc*) pre
1250 | specify m' _ _ _ =
1251 error ("specify: not impl. for "^tac_2str m');
1253 (* val (sel, Add_Given ct, ptp as (pt,(p,Pbl))) = ("#Given", tac, ptp);
1254 val (sel, Add_Find ct, ptp as (pt,(p,Pbl))) = ("#Find", tac, ptp);
1256 fun nxt_specif_additem sel ct (ptp as (pt, (p, Pbl))) =
1258 val (PblObj{meth=met,origin=(oris,(dI',pI',_),_),
1259 probl=pbl,spec=(dI,pI,_),...}) = get_obj I pt p;
1260 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1261 val cpI = if pI = e_pblID then pI' else pI;
1262 val ctxt = get_ctxt pt (p, Pbl);
1263 in case appl_add ctxt sel oris pbl ((#ppc o get_pbt) cpI) ct of
1264 Add itm (*..union old input *) =>
1265 (* val Add itm = appl_add thy sel oris pbl ppc ct;
1268 (*val _=tracing("###nxt_specif_additem: itm= "^(itm2str_ itm));*)
1269 val pbl' = insert_ppc thy itm pbl
1272 "#Given" => (Add_Given ct, Add_Given' (ct, pbl'))
1273 | "#Find" => (Add_Find ct, Add_Find' (ct, pbl'))
1274 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, pbl'))
1275 val ((p,Pbl),c,_,pt') =
1276 generate1 thy tac_ (Uistate, e_ctxt) (p,Pbl) pt
1277 in ([(tac,tac_,((p,Pbl),(Uistate, e_ctxt)))], c, (pt',(p,Pbl))):calcstate' end
1280 (*TODO.WN03 pass error-msgs to the frontend..
1281 FIXME ..and dont abuse a tactic for that purpose*)
1283 Tac_ (Thy_Info.get_theory "Pure", msg,msg,msg),
1284 (e_pos', (e_istate, e_ctxt)))], [], ptp)
1287 (* val sel = "#Find"; val (p,_) = p; val Add_Find' ct = nxt;
1288 val (_,_,f,nxt',_,pt')= nxt_specif_additem sel ct (p,Met) c pt;
1290 | nxt_specif_additem sel ct (ptp as (pt,(p,Met))) =
1292 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1293 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1294 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1295 val cmI = if mI = e_metID then mI' else mI;
1296 val ctxt = get_ctxt pt (p,Met);
1297 in case appl_add ctxt sel oris met ((#ppc o get_met) cmI) ct of
1298 Add itm (*..union old input *) =>
1299 let (* val Add itm = appl_add thy sel oris met (#ppc (get_met cmI)) ct;
1301 val met' = insert_ppc thy itm met;
1304 "#Given" => (Add_Given ct, Add_Given' (ct, met'))
1305 | "#Find" => (Add_Find ct, Add_Find' (ct, met'))
1306 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, met'))
1307 val ((p,Met),c,_,pt') =
1308 generate1 thy tac_ (Uistate, e_ctxt) (p,Met) pt
1309 in ([(tac,tac_,((p,Met), (Uistate, e_ctxt)))], c, (pt',(p,Met))) end
1311 | Err msg => ([(*tacis*)], [], ptp)
1312 (*nxt_me collects tacis until not hide; here just no progress*)
1316 val (msg,itm) = appl_add thy sel oris ppc ct;
1317 val (Cor(d,ts)) = #5 itm;
1322 fun ori2Coritm pbt ((i,v,f,d,ts):ori) =
1323 (i,v,true,f, Cor ((d,ts),(((snd o snd o the o (find_first (eq1 d))) pbt)
1324 handle _ => error ("ori2Coritm: dsc "^
1326 "in ori, but not in pbt")
1328 fun ori2Coritm (pbt:pat list) ((i,v,f,d,ts):ori) =
1329 ((i,v,true,f, Cor ((d,ts),((snd o snd o the o
1330 (find_first (eq1 d))) pbt,ts))):itm)
1331 handle _ => (*dsc in oris, but not in pbl pat list: keep this dsc*)
1332 ((i,v,true,f, Cor ((d,ts),(d,ts))):itm);
1335 (*filter out oris which have same description in itms*)
1336 fun filter_outs oris [] = oris
1337 | filter_outs oris (i::itms) =
1338 let val ors = filter_out ((curry op= ((d_in o #5) (i:itm))) o
1339 (#4:ori -> term)) oris;
1340 in filter_outs ors itms end;
1342 fun memI a b = member op = a b;
1343 (*filter oris which are in pbt, too*)
1344 fun filter_pbt oris pbt =
1345 let val dscs = map (fst o snd) pbt
1346 in filter ((memI dscs) o (#4: ori -> term)) oris end;
1348 (*.combine itms from pbl + met and complete them wrt. pbt.*)
1349 (*FIXXXME.WN031205 complete_metitms doesnt handle incorrect itms !*)
1351 fun x mem [] = false
1352 | x mem (y :: ys) = x = y orelse x mem ys;
1354 fun complete_metitms (oris:ori list) (pits:itm list) (mits:itm list) met =
1355 (* val met = (#ppc o get_met) ["DiffApp","max_by_calculus"];
1357 let val vat = max_vt pits;
1359 (filter ((curry (op mem) vat) o (#2:itm -> int list)) mits);
1360 val ors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris;
1361 val os = filter_outs ors itms;
1362 (*WN.12.03?: does _NOT_ add itms from met ?!*)
1363 in itms @ (map (ori2Coritm met) os) end
1368 (*.complete model and guard of a calc-head .*)
1370 fun x mem [] = false
1371 | x mem (y :: ys) = x = y orelse x mem ys;
1373 fun complete_mod_ (oris, mpc, ppc, probl) =
1374 let val pits = filter_out ((curry op= false) o (#3: itm -> bool)) probl
1375 val vat = if probl = [] then 1 else max_vt probl
1376 val pors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris
1377 val pors = filter_outs pors pits (*which are in pbl already*)
1378 val pors = (filter_pbt pors ppc) (*which are in pbt, too*)
1380 val pits = pits @ (map (ori2Coritm ppc) pors)
1381 val mits = complete_metitms oris pits [] mpc
1385 fun some_spec ((odI, opI, omI):spec) ((dI, pI, mI):spec) =
1386 (if dI = e_domID then odI else dI,
1387 if pI = e_pblID then opI else pI,
1388 if mI = e_metID then omI else mI):spec;
1391 (*.find a next applicable tac (for calcstate) and update ptree
1392 (for ev. finding several more tacs due to hide).*)
1393 (*FIXXXME: unify ... fun nxt_specif = nxt_spec + applicable_in + specify !!*)
1394 (*WN.24.10.03 ~~~~~~~~~~~~~~ -> tac -> tac_ -> -"- as arg*)
1395 (*WN.24.10.03 fun nxt_solv = ...................................??*)
1396 fun nxt_specif (tac as Model_Problem) (pt, pos as (p,p_)) =
1398 val PblObj {origin = (oris, ospec, _), probl, spec, ...} = get_obj I pt p
1399 val (dI, pI, mI) = some_spec ospec spec
1400 val thy = assoc_thy dI
1401 val mpc = (#ppc o get_met) mI (* just for reuse complete_mod_ *)
1402 val {cas, ppc, ...} = get_pbt pI
1403 val pbl = init_pbl ppc (* fill in descriptions *)
1404 (*----------------if you think, this should be done by the Dialog
1405 in the java front-end, search there for WN060225-modelProblem----*)
1407 case cas of NONE => (pbl, [])
1408 | _ => complete_mod_ (oris, mpc, ppc, probl)
1409 (*----------------------------------------------------------------*)
1410 val tac_ = Model_Problem' (pI, pbl, met)
1411 val (pos,c,_,pt) = generate1 thy tac_ (Uistate, e_ctxt) pos pt
1412 in ([(tac,tac_, (pos, (Uistate, e_ctxt)))], c, (pt,pos)):calcstate' end
1414 | nxt_specif (Add_Given ct) ptp = nxt_specif_additem "#Given" ct ptp
1415 | nxt_specif (Add_Find ct) ptp = nxt_specif_additem "#Find" ct ptp
1416 | nxt_specif (Add_Relation ct) ptp = nxt_specif_additem"#Relate" ct ptp
1418 (*. called only if no_met is specified .*)
1419 | nxt_specif (Refine_Tacitly pI) (ptp as (pt, pos as (p,_))) =
1420 let val (PblObj {origin = (oris, (dI,_,_),_), ...}) = get_obj I pt p
1421 val opt = refine_ori oris pI
1424 let val {met,ppc,...} = get_pbt pI'
1425 val pbl = init_pbl ppc
1426 (*val pt = update_pbl pt p pbl ..done by Model_Problem*)
1427 val mI = if length met = 0 then e_metID else hd met
1428 val thy = assoc_thy dI
1430 generate1 thy (Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]))
1431 (Uistate, e_ctxt) pos pt
1432 in ([(Refine_Tacitly pI, Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]),
1433 (pos, (Uistate, e_ctxt)))], c, (pt,pos)) end
1434 | NONE => ([], [], ptp)
1437 | nxt_specif (Refine_Problem pI) (ptp as (pt, pos as (p,_))) =
1438 let val (PblObj {origin=(_,(dI,_,_),_),spec=(dI',_,_),
1439 probl, ...}) = get_obj I pt p
1440 val thy = if dI' = e_domID then dI else dI'
1441 in case refine_pbl (assoc_thy thy) pI probl of
1442 NONE => ([], [], ptp)
1443 | SOME (rfd as (pI',_)) =>
1444 let val (pos,c,_,pt) =
1445 generate1 (assoc_thy thy)
1446 (Refine_Problem' rfd) (Uistate, e_ctxt) pos pt
1447 in ([(Refine_Problem pI, Refine_Problem' rfd,
1448 (pos, (Uistate, e_ctxt)))], c, (pt,pos)) end
1451 | nxt_specif (Specify_Problem pI) (pt, pos as (p,_)) =
1452 let val (PblObj {origin=(oris,(dI,_,_),_),spec=(dI',pI',_),
1453 probl, ...}) = get_obj I pt p;
1454 val thy = assoc_thy (if dI' = e_domID then dI else dI');
1455 val {ppc,where_,prls,...} = get_pbt pI
1456 val pbl as (_,(itms,_)) =
1457 if pI'=e_pblID andalso pI=e_pblID
1458 then (false, (init_pbl ppc, []))
1459 else match_itms_oris thy probl (ppc,where_,prls) oris(*FIXXXXXME?*)
1460 (*FIXXXME~~~~~~~~~~~~~~~: take pbl and compare with new pI WN.8.03*)
1461 val ((p,Pbl),c,_,pt)=
1462 generate1 thy (Specify_Problem' (pI, pbl)) (Uistate, e_ctxt) pos pt
1463 in ([(Specify_Problem pI, Specify_Problem' (pI, pbl),
1464 (pos,(Uistate, e_ctxt)))], c, (pt,pos)) end
1466 (*transfers oris (not required in pbl) to met-model for script-env
1467 FIXME.WN.8.03: application of several mIDs to SAME model?*)
1468 | nxt_specif (Specify_Method mID) (ptp as (pt, pos as (p,_))) =
1469 let val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1470 meth=met, ...}) = get_obj I pt p;
1471 val {ppc,pre,prls,...} = get_met mID
1472 val thy = assoc_thy dI
1473 val oris = add_field' thy ppc oris;
1474 val dI'' = if dI=e_domID then dI' else dI;
1475 val pI'' = if pI = e_pblID then pI' else pI;
1476 val met = if met=[] then pbl else met;(*WN0602 what if more itms in met?*)
1477 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1479 generate1 thy (Specify_Method' (mID, oris, itms)) (Uistate, e_ctxt) pos pt
1480 in ([(Specify_Method mID, Specify_Method' (mID, oris, itms),
1481 (pos,(Uistate, e_ctxt)))], c, (pt,pos)) end
1483 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Pbl)) =
1484 let val (dI',_,_) = get_obj g_spec pt p
1486 generate1 (assoc_thy "Isac") (Specify_Theory' dI)
1487 (Uistate, e_ctxt) pos pt
1488 in (*FIXXXME: check if pbl can still be parsed*)
1489 ([(Specify_Theory dI, Specify_Theory' dI, (pos,(Uistate, e_ctxt)))], c,
1492 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Met)) =
1493 let val (dI',_,_) = get_obj g_spec pt p
1495 generate1 (assoc_thy "Isac") (Specify_Theory' dI)
1496 (Uistate, e_ctxt) pos pt
1497 in (*FIXXXME: check if met can still be parsed*)
1498 ([(Specify_Theory dI, Specify_Theory' dI, (pos,(Uistate, e_ctxt)))], c,
1502 error ("nxt_specif: not impl. for "^tac2str m');
1504 (*.get the values from oris; handle the term list w.r.t. penv.*)
1507 fun x mem [] = false
1508 | x mem (y :: ys) = x = y orelse x mem ys;
1510 fun vals_of_oris oris =
1511 ((map (mkval' o (#5:ori -> term list))) o
1512 (filter ((curry (op mem) 1) o (#2:ori -> int list)))) oris
1517 (* create a calc-tree with oris via an cas.refined pbl *)
1518 fun nxt_specify_init_calc (([], (dI, pI, mI)) : fmz) =
1520 then (* from pbl-browser or from CAS cmd with pI=[e_pblID] *)
1522 val {cas, met, ppc, thy, ...} = get_pbt pI
1523 val dI = if dI = "" then theory2theory' thy else dI
1524 val thy = assoc_thy dI
1525 val mI = if mI = [] then hd met else mI
1526 val hdl = case cas of NONE => pblterm dI pI | SOME t => t
1527 val (pt,_) = cappend_problem e_ptree [] (Uistate, e_ctxt) ([], (dI,pI,mI))
1528 ([], (dI,pI,mI), hdl)
1529 val pt = update_spec pt [] (dI,pI,mI)
1530 val pits = init_pbl' ppc
1531 val pt = update_pbl pt [] pits
1532 in ((pt, ([] ,Pbl)), []) : calcstate end
1535 then (* from met-browser *)
1537 val {ppc,...} = get_met mI
1538 val dI = if dI = "" then "Isac" else dI
1539 val thy = assoc_thy dI;
1540 val (pt,_) = cappend_problem e_ptree [] (e_istate, e_ctxt) ([], (dI,pI,mI))
1541 ([], (dI,pI,mI), e_term(*FIXME met*));
1542 val pt = update_spec pt [] (dI,pI,mI);
1543 val mits = init_pbl' ppc;
1544 val pt = update_met pt [] mits;
1545 in ((pt, ([], Met)), []) : calcstate end
1546 else (* new example, pepare for interactive modeling *)
1547 let val (pt,_) = cappend_problem e_ptree [] (e_istate, e_ctxt) ([], e_spec)
1548 ([], e_spec, e_term)
1549 in ((pt, ([], Pbl)), []) : calcstate end
1551 | nxt_specify_init_calc (fmz : fmz_, (dI, pI, mI) : spec) =
1552 let (* both """"""""""""""""""""""""" either empty or complete *)
1553 val thy = assoc_thy dI
1554 val (pI, (pors, pctxt), mI) =
1558 val (pors, pctxt) = get_pbt pI |> #ppc |> prep_ori fmz thy;
1559 val pI' = refine_ori' pors pI;
1560 in (pI', (pors(*refinement over models with diff.precond only*), pctxt),
1561 (hd o #met o get_pbt) pI') end
1562 else (pI, get_pbt pI |> #ppc |> prep_ori fmz thy, mI)
1563 val {cas, ppc, thy=thy',...} = get_pbt pI (*take dI from _refined_ pbl*)
1564 val dI = theory2theory' (maxthy thy thy');
1567 NONE => pblterm dI pI
1568 | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals_of_oris pors) t;
1569 val (pt, _) = cappend_problem e_ptree [] (e_istate, pctxt) (fmz, (dI, pI, mI))
1570 (pors, (dI, pI, mI), hdl)
1571 (* val pt = update_env pt [] (SOME (e_istate, pctxt)) GOON.WN110506*)
1572 in ((pt, ([], Pbl)),
1573 fst3 (nxt_specif Model_Problem (pt, ([], Pbl)))) : calcstate
1579 fun get_spec_form (m:tac_) ((p,p_):pos') (pt:ptree) =
1580 (* case appl_spec p pt m of /// 19.1.00
1581 Notappl e => Error' (Error_ e)
1583 *) let val (_,_,f,_,_,_) = specify m (p,p_) [] pt
1587 (*fun tag_form thy (formal, given) = cterm_of thy
1588 (((head_of o term_of) given) $ (term_of formal)); WN100819*)
1589 fun tag_form thy (formal, given) =
1590 (let val gf = (head_of given) $ formal;
1591 val _ = cterm_of thy gf
1594 error ("calchead.tag_form: " ^
1595 Print_Mode.setmp [] (Syntax.string_of_term
1596 (thy2ctxt thy)) given ^ " .. " ^
1597 Print_Mode.setmp [] (Syntax.string_of_term
1598 (thy2ctxt thy)) formal ^
1599 " ..types do not match");
1600 (* val formal = (the o (parse thy)) "[R::real]";
1601 > val given = (the o (parse thy)) "fixed_values (cs::real list)";
1602 > tag_form thy (formal, given);
1603 val it = "fixed_values [R]" : cterm
1606 fun chktyp thy (n, fs, gs) =
1607 ((writeln o (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) o
1609 (writeln o (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) o
1611 tag_form thy (nth n fs, nth n gs));
1612 fun chktyps thy (fs, gs) = map (tag_form thy) (fs ~~ gs);
1614 (* #####################################################
1615 find the failing item:
1617 > val tag__form = chktyp (n,formals,givens);
1618 > (type_of o term_of o (nth n)) formals;
1619 > (type_of o term_of o (nth n)) givens;
1620 > atomty ((term_of o (nth n)) formals);
1621 > atomty ((term_of o (nth n)) givens);
1622 > atomty (term_of tag__form);
1623 > use_thy"isa-98-1-HOL-plus/knowl-base/DiffAppl";
1624 ##################################################### *)
1626 (* #####################################################
1628 val origin = ["sqrt(9+4*x)=sqrt x + sqrt(5+x)","x::rat","(+0)"];
1629 val formals = map (the o (parse thy)) origin;
1631 val given = ["equation (lhs=rhs)",
1632 "bound_variable bdv", (* TODO type *)
1634 val where_ = ["e is_root_equation_in bdv",
1636 "apx is_const_expr"];
1637 val find = ["L::rat set"];
1638 val with_ = ["L = {bdv. || ((%x. lhs) bdv) - ((%x. rhs) bdv) || < apx}"];
1639 val chkpbl = map (the o (parse thy)) (given @ where_ @ find @ with_);
1640 val givens = map (the o (parse thy)) given;
1642 val tag__forms = chktyps (formals, givens);
1643 map ((atomty) o term_of) tag__forms;
1644 ##################################################### *)
1647 (* check pbltypes, announces one failure a time *)
1648 (*fun chk_vars ctppc =
1649 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1650 appc flat (mappc (vars o term_of) ctppc)
1651 in if (wh\\gi) <> [] then ("wh\\gi",wh\\gi)
1652 else if (re\\(gi union fi)) <> []
1653 then ("re\\(gi union fi)",re\\(gi union fi))
1654 else ("ok",[]) end;*)
1655 fun chk_vars ctppc =
1656 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1657 appc flat (mappc vars ctppc)
1658 val chked = subtract op = gi wh
1659 in if chked <> [] then ("wh\\gi", chked)
1660 else let val chked = subtract op = (union op = gi fi) re
1662 then ("re\\(gi union fi)", chked)
1667 (* check a new pbltype: variables (Free) unbound by given, find*)
1668 fun unbound_ppc ctppc =
1669 let val {Given=gi,Find=fi,Relate=re,...} =
1670 appc flat (mappc vars ctppc)
1671 in distinct (*re\\(gi union fi)*)
1672 (subtract op = (union op = gi fi) re) end;
1674 > val org = {Given=["[R=(R::real)]"],Where=[],
1675 Find=["[A::real]"],With=[],
1676 Relate=["[A=#2*a*b - a^^^#2, (a//#2)^^^#2 + (b//#2)^^^#2 = R^^^#2]"]
1678 > val ctppc = mappc (the o (parse thy)) org;
1679 > unbound_ppc ctppc;
1680 val it = [("a","RealDef.real"),("b","RealDef.real")] : (string * typ) list
1684 (* f, a binary operator, is nested rightassociative *)
1687 fun fld f (x::[]) = x
1688 | fld f (x::x'::[]) = f (x',x)
1689 | fld f (x::x'::xs) = f (fld f (x'::xs),x);
1690 in ((fld f) o rev) xs end;
1692 > val (SOME ct) = parse thy "[a=b,c=d,e=f]";
1693 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1694 > val conj = foldr1 HOLogic.mk_conj (isalist2list (term_of ct));
1695 > cterm_of thy conj;
1696 val it = "(a = b & c = d) & e = f" : cterm
1699 (* f, a binary operator, is nested leftassociative *)
1700 fun foldl1 f (x::[]) = x
1701 | foldl1 f (x::x'::[]) = f (x,x')
1702 | foldl1 f (x::x'::xs) = f (x,foldl1 f (x'::xs));
1704 > val (SOME ct) = parse thy "[a=b,c=d,e=f,g=h]";
1705 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1706 > val conj = foldl1 HOLogic.mk_conj (isalist2list (term_of ct));
1707 > cterm_of thy conj;
1708 val it = "a = b & c = d & e = f & g = h" : cterm
1712 (* called only once, if a Subproblem has been located in the script*)
1713 fun nxt_model_pbl (Subproblem'((_,pblID,metID),_,_,_,_)) ptp =
1716 (snd3 o hd o fst3) (nxt_specif (Refine_Tacitly pblID) ptp)
1717 | _ => (snd3 o hd o fst3) (nxt_specif Model_Problem ptp))
1718 (*all stored in tac_ itms^^^^^^^^^^*)
1719 | nxt_model_pbl tac_ _ =
1720 error ("nxt_model_pbl: called by tac= " ^ tac_2str tac_);
1722 (*fun eq1 d (_,(d',_)) = (d = d'); ---modspec.sml*)
1723 fun eq4 v (_,vts,_,_,_) = member op = vts v;
1724 fun eq5 (_,_,_,_,itm_) (_,_,_,d,_) = d_in itm_ = d;
1727 (*.complete _NON_empty calc-head for autocalc (sub-)pbl from oris
1728 + met from fmz; assumes pos on PblObj, meth = [].*)
1729 fun complete_mod (pt, pos as (p, p_):pos') =
1730 (* val (pt, (p, _)) = (pt, p);
1731 val (pt, (p, _)) = (pt, pos);
1733 let val _= if p_ <> Pbl
1734 then tracing("###complete_mod: only impl.for Pbl, called with "^
1735 pos'2str pos) else ()
1736 val (PblObj{origin=(oris, ospec, hdl), probl, spec,...}) =
1738 val (dI,pI,mI) = some_spec ospec spec
1739 val mpc = (#ppc o get_met) mI
1740 val ppc = (#ppc o get_pbt) pI
1741 val (pits, mits) = complete_mod_ (oris, mpc, ppc, probl)
1742 val pt = update_pblppc pt p pits
1743 val pt = update_metppc pt p mits
1744 in (pt, (p,Met):pos') end
1746 (*| complete_mod (pt, pos as (p, Met):pos') =
1747 error ("###complete_mod: only impl.for Pbl, called with "^
1750 (*.complete _EMPTY_ calc-head for autocalc (sub-)pbl from oris(+met from fmz);
1751 oris and spec (incl. pbl-refinement) given from init_calc or SubProblem .*)
1752 fun all_modspec (pt, (p,_):pos') =
1754 val (PblObj{fmz=(fmz_,_), origin=(pors, spec as (dI,pI,mI), hdl),
1755 ...}) = get_obj I pt p;
1756 val thy = assoc_thy dI;
1757 val {ppc,...} = get_met mI;
1758 val mors = prep_ori fmz_ thy ppc |> #1;
1759 val pt = update_pblppc pt p (map (ori2Coritm ppc) pors);
1760 val pt = update_metppc pt p (map (ori2Coritm ppc) mors);
1761 val pt = update_spec pt p (dI,pI,mI);
1762 in (pt, (p,Met): pos') end;
1764 (*WN.12.03: use in nxt_spec, too ? what about variants ???*)
1765 fun is_complete_mod_ ([]: itm list) = false
1766 | is_complete_mod_ itms =
1767 foldl and_ (true, (map #3 itms));
1769 fun is_complete_mod (pt, pos as (p, Pbl): pos') =
1770 if (is_pblobj o (get_obj I pt)) p
1771 then (is_complete_mod_ o (get_obj g_pbl pt)) p
1772 else error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1773 | is_complete_mod (pt, pos as (p, Met)) =
1774 if (is_pblobj o (get_obj I pt)) p
1775 then (is_complete_mod_ o (get_obj g_met pt)) p
1776 else error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1777 | is_complete_mod (_, pos) =
1778 error ("is_complete_mod called by " ^ pos'2str pos ^
1779 " (should be Pbl or Met)");
1781 (*.have (thy, pbl, met) _all_ been specified explicitly ?.*)
1782 fun is_complete_spec (pt, pos as (p,_): pos') =
1783 if (not o is_pblobj o (get_obj I pt)) p
1784 then error ("is_complete_spec: called by PrfObj at "^pos'2str pos)
1785 else let val (dI,pI,mI) = get_obj g_spec pt p
1786 in dI<>e_domID andalso pI<>e_pblID andalso mI<>e_metID end;
1787 (*.complete empty items in specification from origin (pbl, met ev.refined);
1788 assumes 'is_complete_mod'.*)
1789 fun complete_spec (pt, pos as (p,_): pos') =
1790 let val PblObj {origin = (_,ospec,_), spec,...} = get_obj I pt p
1791 val pt = update_spec pt p (some_spec ospec spec)
1794 fun is_complete_modspec ptp =
1795 is_complete_mod ptp andalso is_complete_spec ptp;
1800 fun pt_model (PblObj {meth,spec,origin=(_,spec',hdl),...}) Met =
1801 (* val ((PblObj {meth,spec,origin=(_,spec',hdl),...}), Met) = (ppobj, p_);
1803 let val (_,_,metID) = get_somespec' spec spec'
1805 if metID = e_metID then []
1806 else let val {prls,pre=where_,...} = get_met metID
1807 val pre = check_preconds' prls where_ meth 0
1809 val allcorrect = is_complete_mod_ meth
1810 andalso foldl and_ (true, (map #1 pre))
1811 in ModSpec (allcorrect, Met, hdl, meth, pre, spec) end
1812 | pt_model (PblObj {probl,spec,origin=(_,spec',hdl),...}) _(*Frm,Pbl*) =
1813 (* val ((PblObj {probl,spec,origin=(_,spec',hdl),...}),_) = (ppobj, p_);
1815 let val (_,pI,_) = get_somespec' spec spec'
1817 if pI = e_pblID then []
1818 else let val {prls,where_,cas,...} = get_pbt pI
1819 val pre = check_preconds' prls where_ probl 0
1821 val allcorrect = is_complete_mod_ probl
1822 andalso foldl and_ (true, (map #1 pre))
1823 in ModSpec (allcorrect, Pbl, hdl, probl, pre, spec) end;
1826 fun pt_form (PrfObj {form,...}) = Form form
1827 | pt_form (PblObj {probl,spec,origin=(_,spec',_),...}) =
1828 let val (dI, pI, _) = get_somespec' spec spec'
1829 val {cas,...} = get_pbt pI
1831 NONE => Form (pblterm dI pI)
1832 | SOME t => Form (subst_atomic (mk_env probl) t)
1834 (*vvv takes the tac _generating_ the formula=result, asm ok....
1835 fun pt_result (PrfObj {result=(t,asm), tac,...}) =
1837 if null asm then NONE else SOME asm,
1839 | pt_result (PblObj {result=(t,asm), origin = (_,ospec,_), spec,...}) =
1840 let val (_,_,metID) = some_spec ospec spec
1842 if null asm then NONE else SOME asm,
1843 if metID = e_metID then NONE else SOME (Apply_Method metID)) end;
1844 -------------------------------------------------------------------------*)
1847 (*.pt_extract returns
1848 # the formula at pos
1849 # the tactic applied to this formula
1850 # the list of assumptions generated at this formula
1851 (by application of another tac to the preceding formula !)
1852 pos is assumed to come from the frontend, ie. generated by moveDown.*)
1853 (*cannot be in ctree.sml, because ModSpec has to be calculated*)
1854 fun pt_extract (pt,([],Res)) =
1855 (* val (pt,([],Res)) = ptp;
1857 (* ML_TODO 110417 get assumptions from ctxt !? *)
1858 let val (f, asm) = get_obj g_result pt []
1859 in (Form f, NONE, asm) end
1862 | pt_extract (pt,(p,Res)) =
1863 (* val (pt,(p,Res)) = ptp;
1865 let val (f, asm) = get_obj g_result pt p
1866 val tac = if last_onlev pt p
1867 then if is_pblobj' pt (lev_up p)
1868 then let val (PblObj{spec=(_,pI,_),...}) =
1869 get_obj I pt (lev_up p)
1870 in if pI = e_pblID then NONE
1871 else SOME (Check_Postcond pI) end
1872 else SOME End_Trans (*WN0502 TODO for other branches*)
1873 else let val p' = lev_on p
1874 in if is_pblobj' pt p'
1875 then let val (PblObj{origin = (_,(dI,pI,_),_),...}) =
1877 in SOME (Subproblem (dI, pI)) end
1878 else if f = get_obj g_form pt p'
1879 then SOME (get_obj g_tac pt p')
1880 (*because this Frm ~~~is not on worksheet*)
1881 else SOME (Take (term2str (get_obj g_form pt p')))
1883 in (Form f, tac, asm) end
1885 | pt_extract (pt, pos as (p,p_(*Frm,Pbl*))) =
1886 (* val (pt, pos as (p,p_(*Frm,Pbl*))) = ptp;
1887 val (pt, pos as (p,p_(*Frm,Pbl*))) = (pt, p);
1889 let val ppobj = get_obj I pt p
1890 val f = if is_pblobj ppobj then pt_model ppobj p_
1891 else get_obj pt_form pt p
1892 val tac = g_tac ppobj
1893 in (f, SOME tac, []) end;
1896 (**. get the formula from a ctree-node:
1897 take form+res from PblObj and 1.PrfObj and (PrfObj after PblObj)
1898 take res from all other PrfObj's .**)
1899 (*designed for interSteps, outcommented 04 in favour of calcChangedEvent*)
1900 fun formres p (Nd (PblObj {origin = (_,_, h), result = (r, _),...}, _)) =
1901 [("headline", (p, Frm), h),
1902 ("stepform", (p, Res), r)]
1903 | formres p (Nd (PrfObj {form, result = (r, _),...}, _)) =
1904 [("stepform", (p, Frm), form),
1905 ("stepform", (p, Res), r)];
1907 fun form p (Nd (PrfObj {result = (r, _),...}, _)) =
1908 [("stepform", (p, Res), r)]
1910 (*assumes to take whole level, in particular hd -- for use in interSteps*)
1911 fun get_formress fs p [] = flat fs
1912 | get_formress fs p (nd::nds) =
1913 (* start with 'form+res' and continue with trying 'res' only*)
1914 get_forms (fs @ [formres p nd]) (lev_on p) nds
1915 and get_forms fs p [] = flat fs
1916 | get_forms fs p (nd::nds) =
1918 (* start again with 'form+res' ///ugly repeat with Check_elementwise
1919 then get_formress (fs @ [formres p nd]) (lev_on p) nds *)
1920 then get_forms (fs @ [formres p nd]) (lev_on p) nds
1921 (* continue with trying 'res' only*)
1922 else get_forms (fs @ [form p nd]) (lev_on p) nds;
1924 (**.get an 'interval' 'from' 'to' of formulae from a ptree.**)
1925 (*WN050219 made robust against _'to' below or after Complete nodes
1926 by handling exn caused by move_dn*)
1927 (*WN0401 this functionality belongs to ctree.sml,
1928 but fetching a calc_head requires calculations defined in modspec.sml
1929 transfer to ME/me.sml !!!
1930 WN051224 ^^^ doesnt hold any longer, since only the headline of a calc_head
1931 is returned !!!!!!!!!!!!!
1933 fun eq_pos' (p1,Frm) (p2,Frm) = p1 = p2
1934 | eq_pos' (p1,Res) (p2,Res) = p1 = p2
1935 | eq_pos' (p1,Pbl) (p2,p2_) = p1 = p2 andalso (case p2_ of
1939 | eq_pos' (p1,Met) (p2,p2_) = p1 = p2 andalso (case p2_ of
1943 | eq_pos' _ _ = false;
1945 (*.get an 'interval' from the ctree; 'interval' is w.r.t. the
1946 total ordering Position#compareTo(Position p) in the java-code
1947 val get_interval = fn
1948 : pos' -> : from is "move_up 1st-element" to return
1949 pos' -> : to the last element to be returned; from < to
1950 int -> : level: 0 gets the flattest sub-tree possible
1951 >999 gets the deepest sub-tree possible
1953 (pos' * : of the formula
1954 Term.term) : the formula
1957 fun get_interval from to level pt =
1958 (* val (from,level) = (f,lev);
1959 val (from, to, level) = (([3, 2, 1], Res), ([],Res), 9999);
1961 let fun get_inter c (from:pos') (to:pos') lev pt =
1962 (* val (c, from, to, lev) = ([], from, to, level);
1963 ------for recursion.......
1964 val (c, from:pos', to:pos') = (c @ [(from, f)], move_dn [] pt from, to);
1966 if eq_pos' from to orelse from = ([],Res)
1967 (*orelse ... avoids Exception- PTREE "end of calculation" raised,
1968 if 'to' has values NOT generated by move_dn, see systest/me.sml
1969 TODO.WN0501: introduce an order on pos' and check "from > to"..
1970 ...there is an order in Java!
1971 WN051224 the hack got worse with returning term instead ptform*)
1972 then let val (f,_,_) = pt_extract (pt, from)
1974 ModSpec (_,_,headline,_,_,_) => c @ [(from, headline)]
1975 | Form t => c @ [(from, t)]
1978 if lev < lev_of from
1979 then (get_inter c (move_dn [] pt from) to lev pt)
1980 handle (PTREE _(*from move_dn too far*)) => c
1981 else let val (f,_,_) = pt_extract (pt, from)
1982 val term = case f of
1983 ModSpec (_,_,headline,_,_,_)=> headline
1985 in (get_inter (c @ [(from, term)])
1986 (move_dn [] pt from) to lev pt)
1987 handle (PTREE _(*from move_dn too far*))
1988 => c @ [(from, term)] end
1989 in get_inter [] from to level pt end;
1992 fun posform2str (pos:pos', form) =
1993 "("^ pos'2str pos ^", "^
1995 Form f => term2str f
1996 | ModSpec c => term2str (#3 c(*the headline*)))
1998 fun posforms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
1999 (map posform2str)) pfs;
2000 fun posterm2str (pos:pos', t) =
2001 "("^ pos'2str pos ^", "^term2str t^")";
2002 fun posterms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
2003 (map posterm2str)) pfs;
2006 (*WN050225 omits the last step, if pt is incomplete*)
2008 tracing (posterms2str (get_interval ([],Frm) ([],Res) 99999 pt));
2010 (*.get a calchead from a PblObj-node in the ctree;
2011 preconditions must be calculated.*)
2012 fun get_ocalhd (pt, pos' as (p,Pbl):pos') =
2013 let val PblObj {origin = (oris, ospec, hdf'), spec, probl,...} =
2015 val {prls,where_,...} = get_pbt (#2 (some_spec ospec spec))
2016 val pre = check_preconds (assoc_thy"Isac") prls where_ probl
2017 in (ocalhd_complete probl pre spec, Pbl, hdf', probl, pre, spec):ocalhd end
2018 | get_ocalhd (pt, pos' as (p,Met):pos') =
2019 let val PblObj {fmz = fmz as (fmz_,_), origin = (oris, ospec, hdf'),
2022 val {prls,pre,...} = get_met (#3 (some_spec ospec spec))
2023 val pre = check_preconds (assoc_thy"Isac") prls pre meth
2024 in (ocalhd_complete meth pre spec, Met, hdf', meth, pre, spec):ocalhd end;
2026 (*.at the activeFormula set the Model, the Guard and the Specification
2027 to empty and return a CalcHead;
2028 the 'origin' remains (for reconstructing all that).*)
2029 fun reset_calchead (pt, pos' as (p,_):pos') =
2030 let val PblObj {origin = (_, _, hdf'),...} = get_obj I pt p
2031 val pt = update_pbl pt p []
2032 val pt = update_met pt p []
2033 val pt = update_spec pt p e_spec
2034 in (pt, (p,Pbl):pos') end;