1 (* Specify-phase: specifying and modeling a problem or a subproblem. The
2 most important types are declared in mstools.sml.
5 (c) due to copyright terms
9 12345678901234567890123456789012345678901234567890123456789012345678901234567890
10 10 20 30 40 50 60 70 80
13 (* TODO interne Funktionen aus sig entfernen *)
16 datatype additm = Add of SpecifyTools.itm | Err of string
17 val all_dsc_in : SpecifyTools.itm_ list -> Term.term list
18 val all_modspec : ptree * pos' -> ptree * pos'
19 datatype appl = Appl of tac_ | Notappl of string
23 SpecifyTools.ori list ->
24 SpecifyTools.itm list ->
25 (string * (Term.term * Term.term)) list -> cterm' -> additm
28 val chk_vars : term ppc -> string * Term.term list
30 theory -> int * term list * term list -> term
32 theory -> term list * term list -> term list
33 val complete_metitms :
34 SpecifyTools.ori list ->
35 SpecifyTools.itm list ->
36 SpecifyTools.itm list -> pat list -> SpecifyTools.itm list
37 val complete_mod_ : ori list * pat list * pat list * itm list ->
39 val complete_mod : ptree * pos' -> ptree * (pos * pos_)
40 val complete_spec : ptree * pos' -> ptree * pos'
42 pat list -> preori list -> pat -> preori
43 val e_calcstate : calcstate
44 val e_calcstate' : calcstate'
45 val eq1 : ''a -> 'b * (''a * 'c) -> bool
47 ''a -> Term.term -> 'b * 'c * 'd * ''a * SpecifyTools.itm_ -> bool
48 val eq4 : ''a -> 'b * ''a list * 'c * 'd * 'e -> bool
50 'a * 'b * 'c * 'd * SpecifyTools.itm_ ->
51 'e * 'f * 'g * Term.term * 'h -> bool
52 val eq_dsc : SpecifyTools.itm * SpecifyTools.itm -> bool
53 val eq_pos' : ''a * pos_ -> ''a * pos_ -> bool
54 val f_mout : theory -> mout -> Term.term
56 SpecifyTools.ori list ->
57 SpecifyTools.itm list -> SpecifyTools.ori list
59 SpecifyTools.ori list ->
60 ('a * (Term.term * 'b)) list -> SpecifyTools.ori list
61 val foldl1 : ('a * 'a -> 'a) -> 'a list -> 'a
62 val foldr1 : ('a * 'a -> 'a) -> 'a list -> 'a
63 val form : 'a -> ptree -> (string * ('a * pos_) * Term.term) list
64 val formres : 'a -> ptree -> (string * ('a * pos_) * Term.term) list
65 val gen_ins' : ('a * 'a -> bool) -> 'a * 'a list -> 'a list
67 (string * (pos * pos_) * Term.term) list list ->
68 pos -> ptree list -> (string * (pos * pos_) * Term.term) list
70 (string * (pos * pos_) * Term.term) list list ->
71 posel list -> ptree list -> (string * (pos * pos_) * Term.term) list
72 val get_interval : pos' -> pos' -> int -> ptree -> (pos' * term) list
73 val get_ocalhd : ptree * pos' -> ocalhd
74 val get_spec_form : tac_ -> pos' -> ptree -> mout
77 SpecifyTools.ori -> SpecifyTools.itm -> string * cterm'
78 val getr_ct : theory -> SpecifyTools.ori -> string * cterm'
79 val has_list_type : Term.term -> bool
80 val header : pos_ -> pblID -> metID -> pblmet
83 int * SpecifyTools.vats * bool * string * SpecifyTools.itm_ ->
84 SpecifyTools.itm list -> SpecifyTools.itm list
86 SpecifyTools.itm -> SpecifyTools.itm list -> SpecifyTools.itm list
87 val is_complete_mod : ptree * pos' -> bool
88 val is_complete_mod_ : SpecifyTools.itm list -> bool
89 val is_complete_modspec : ptree * pos' -> bool
90 val is_complete_spec : ptree * pos' -> bool
91 val is_copy_named : 'a * ('b * Term.term) -> bool
92 val is_copy_named_idstr : string -> bool
93 val is_error : SpecifyTools.itm_ -> bool
94 val is_field_correct : ''a -> ''b -> (''a * ''b list) list -> bool
98 SpecifyTools.ori list ->
99 Term.term -> string * SpecifyTools.ori * Term.term list
100 val is_list_type : Term.typ -> bool
101 val is_notyet_input :
103 SpecifyTools.itm list ->
106 ('a * (Term.term * Term.term)) list -> string * SpecifyTools.itm
107 val is_parsed : SpecifyTools.itm_ -> bool
108 val is_untouched : SpecifyTools.itm -> bool
113 (int list * string * Term.term * Term.term list) list ->
114 (int list * string * Term.term * Term.term list) list
116 theory -> pat list -> Term.term list -> SpecifyTools.ori list
117 val maxl : int list -> int
118 val match_ags_msg : string list -> Term.term -> Term.term list -> unit
119 val memI : ''a list -> ''a -> bool
120 val mk_additem : string -> cterm' -> tac
121 val mk_delete : theory -> string -> SpecifyTools.itm_ -> tac
123 theory -> pat -> Term.term -> SpecifyTools.preori option
126 SpecifyTools.ori list ->
127 (string * (Term.term * 'a)) list ->
128 SpecifyTools.itm list -> (string * cterm') option
129 val nxt_model_pbl : tac_ -> ptree * (int list * pos_) -> tac_
133 SpecifyTools.ori list ->
135 SpecifyTools.itm list * SpecifyTools.itm list ->
136 (string * (Term.term * 'a)) list * (string * (Term.term * 'b)) list ->
138 val nxt_specif : tac -> ptree * (int list * pos_) -> calcstate'
139 val nxt_specif_additem :
140 string -> cterm' -> ptree * (int list * pos_) -> calcstate'
141 val nxt_specify_init_calc : fmz -> calcstate
142 val ocalhd_complete :
143 SpecifyTools.itm list ->
144 (bool * Term.term) list -> domID * pblID * metID -> bool
146 pat list -> ori -> itm
150 Term.term -> Term.term list -> SpecifyTools.ori -> SpecifyTools.itm
153 int * SpecifyTools.vats * bool * string * SpecifyTools.itm_ ->
154 SpecifyTools.itm list ->
155 (int * SpecifyTools.vats * bool * string * SpecifyTools.itm_) list
156 val parse_ok : SpecifyTools.itm_ list -> bool
157 val posform2str : pos' * ptform -> string
158 val posforms2str : (pos' * ptform) list -> string
159 val posterms2str : (pos' * term) list -> string (*tests only*)
160 val ppc135list : 'a SpecifyTools.ppc -> 'a list
161 val ppc2list : 'a SpecifyTools.ppc -> 'a list
163 ptree * (int list * pos_) ->
164 ptform * tac option * Term.term list
165 val pt_form : ppobj -> ptform
166 val pt_model : ppobj -> pos_ -> ptform
167 val reset_calchead : ptree * pos' -> ptree * pos'
171 Term.term * Term.term list ->
172 (int * SpecifyTools.vats * string * Term.term * Term.term list) list
173 -> string * SpecifyTools.ori * Term.term list
178 (int * SpecifyTools.vats * string * Term.term * Term.term list) list
179 -> string * SpecifyTools.ori * Term.term list
181 int -> SpecifyTools.itm list -> SpecifyTools.itm option
182 val show_pt : ptree -> unit
183 val some_spec : spec -> spec -> spec
189 (posel list * pos_) * ((posel list * pos_) * istate) * mout * tac *
191 val specify_additem :
197 (pos * pos_) * ((pos * pos_) * istate) * mout * tac * safe * ptree
198 val tag_form : theory -> term * term -> term
199 val test_types : theory -> Term.term * Term.term list -> string
200 val typeless : Term.term -> Term.term
201 val unbound_ppc : term SpecifyTools.ppc -> Term.term list
202 val vals_of_oris : SpecifyTools.ori list -> Term.term list
203 val variants_in : Term.term list -> int
204 val vars_of_pbl_ : ('a * ('b * Term.term)) list -> Term.term list
205 val vars_of_pbl_' : ('a * ('b * Term.term)) list -> Term.term list
212 (*---------------------------------------------------------------------*)
213 structure CalcHead (**): CALC_HEAD(**) =
216 (*---------------------------------------------------------------------*)
220 (*.the state wich is stored after each step of calculation; it contains
221 the calc-state and a list of [tac,istate](="tacis") to be applied.
222 the last_elem tacis is the first to apply to the calc-state and
223 the (only) one shown to the front-end as the 'proposed tac'.
224 the calc-state resulting from the application of tacis is not stored,
225 because the tacis hold enought information for efficiently rebuilding
226 this state just by "fun generate ".*)
228 (ptree * pos') * (*the calc-state to which the tacis could be applied*)
229 (taci list); (*ev. several (hidden) steps;
230 in REVERSE order: first tac_ to apply is last_elem*)
231 val e_calcstate = ((EmptyPtree, e_pos'), [e_taci]):calcstate;
233 (*the state used during one calculation within the mathengine; it contains
234 a list of [tac,istate](="tacis") which generated the the calc-state;
235 while this state's tacis are extended by each (internal) step,
236 the calc-state is used for creating new nodes in the calc-tree
237 (eg. applicable_in requires several particular nodes of the calc-tree)
238 and then replaced by the the newly created;
239 on leave of the mathengine the resuing calc-state is dropped anyway,
240 because the tacis hold enought information for efficiently rebuilding
241 this state just by "fun generate ".*)
243 taci list * (*cas. several (hidden) steps;
244 in REVERSE order: first tac_ to apply is last_elem*)
245 pos' list * (*a "continuous" sequence of pos',
246 deleted by application of taci list*)
247 (ptree * pos'); (*the calc-state resulting from the application of tacis*)
248 val e_calcstate' = ([e_taci], [e_pos'], (EmptyPtree, e_pos')):calcstate';
250 (*FIXXXME.WN020430 intermediate hack for fun ass_up*)
251 fun f_mout thy (Form' (FormKF (_,_,_,_,f))) = (term_of o the o (parse thy)) f
252 | f_mout thy _ = raise error "f_mout: not called with formula";
255 (*.is the calchead complete ?.*)
256 fun ocalhd_complete (its: itm list) (pre: (bool * term) list) (dI,pI,mI) =
257 foldl and_ (true, map #3 its) andalso
258 foldl and_ (true, map #1 pre) andalso
259 dI<>e_domID andalso pI<>e_pblID andalso mI<>e_metID;
262 (* make a term 'typeless' for comparing with another 'typeless' term;
263 'type-less' usually is illtyped *)
264 fun typeless (Const(s,_)) = (Const(s,e_type))
265 | typeless (Free(s,_)) = (Free(s,e_type))
266 | typeless (Var(n,_)) = (Var(n,e_type))
267 | typeless (Bound i) = (Bound i)
268 | typeless (Abs(s,_,t)) = Abs(s,e_type, typeless t)
269 | typeless (t1 $ t2) = (typeless t1) $ (typeless t2);
271 > val (SOME ct) = parse thy "max_relation (A=#2*a*b - a^^^#2)";
272 > val (_,t1) = split_dsc_t hs (term_of ct);
273 > val (SOME ct) = parse thy "A=#2*a*b - a^^^#2";
274 > val (_,t2) = split_dsc_t hs (term_of ct);
275 > typeless t1 = typeless t2;
281 (*.to an input (d,ts) find the according ori and insert the ts.*)
282 (*WN.11.03: + dont take first inter<>[]*)
283 fun seek_oridts thy sel (d,ts) [] =
284 ("'"^(Syntax.string_of_term (thy2ctxt thy) (comp_dts thy (d,ts)))^
285 "' not found (typed)", (0,[],sel,d,ts):ori, [])
286 (* val (id,vat,sel',d',ts')::oris = ori;
287 val (id,vat,sel',d',ts') = ori;
289 | seek_oridts thy sel (d,ts) ((id,vat,sel',d',ts')::(oris:ori list)) =
290 if sel = sel' andalso d=d' andalso (inter op = ts ts') <> []
293 (id,vat,sel,d, inter op = ts ts'):ori,
295 else ((Syntax.string_of_term (thy2ctxt thy) (comp_dts thy (d,ts)))
299 else seek_oridts thy sel (d,ts) oris;
301 (*.to an input (_,ts) find the according ori and insert the ts.*)
302 fun seek_orits thy sel ts [] =
304 (strs2str (map (Syntax.string_of_term (thy2ctxt thy)) ts))^
305 "' not found (typed)", e_ori_, [])
306 | seek_orits thy sel ts ((id,vat,sel',d,ts')::(oris:ori list)) =
307 if sel = sel' andalso (inter op = ts ts') <> []
310 (id,vat,sel,d, inter op = ts ts'):ori,
312 else (((strs2str' o map (Syntax.string_of_term (thy2ctxt thy))) ts)
316 else seek_orits thy sel ts oris;
318 > val ((id,vat,sel',d,ts')::(ori':ori)) = ori;
319 > seek_orits thy sel ts [(id,vat,sel',d,ts')];
320 uncaught exception TYPE
321 > seek_orits thy sel ts [];
322 uncaught exception TYPE
325 (*find_first item with #1 equal to id*)
326 fun seek_ppc id [] = NONE
327 | seek_ppc id (p::(ppc:itm list)) =
328 if id = #1 p then SOME p else seek_ppc id ppc;
332 (*---------------------------------------------(3) nach ptyps.sml 23.3.02*)
335 datatype appl = Appl of tac_ | Notappl of string;
337 fun ppc2list ({Given=gis,Where=whs,Find=fis,
338 With=wis,Relate=res}: 'a ppc) =
339 gis @ whs @ fis @ wis @ res;
340 fun ppc135list ({Given=gis,Find=fis,Relate=res,...}: 'a ppc) =
346 (* get the number of variants in a problem in 'original',
347 assumes equal descriptions in immediate sequence *)
349 let fun eq(x,y) = head_of x = head_of y;
350 fun cnt eq [] y n = ([n],[])
351 | cnt eq (x::xs) y n = if eq(x,y) then cnt eq xs y (n+1)
353 fun coll eq xs [] = xs
354 | coll eq xs (y::ys) =
355 let val (n,ys') = cnt eq (y::ys) y 0;
356 in if ys' = [] then xs @ n else coll eq (xs @ n) ys' end;
357 val vts = subtract op = [1] (distinct (coll eq [] ts));
358 in case vts of [] => 1 | [n] => n
359 | _ => error "different variants in formalization" end;
361 > cnt (op=) [2,2,2,4,5,5,5,5,5] 2 0;
362 val it = ([3],[4,5,5,5,5,5]) : int list * int list
363 > coll (op=) [] [1,2,2,2,4,5,5,5,5,5];
364 val it = [1,3,1,5] : int list
367 fun is_list_type (Type("List.list",_)) = true
368 | is_list_type _ = false;
369 (* fun destr (Type(str,sort)) = (str,sort);
370 > val (SOME ct) = parse thy "lll::real list";
371 > val ty = (#T o rep_cterm) ct;
375 val it = ("List.list",["RealDef.real"]) : string * typ list
376 > atomty ((#t o rep_cterm) ct);
378 *** Free ( lll, real list)
381 > val (SOME ct) = parse thy "[lll::real]";
382 > val ty = (#T o rep_cterm) ct;
386 val it = ("List.list",["'a"]) : string * typ list
387 > atomty ((#t o rep_cterm) ct);
389 *** Const ( List.list.Cons, [real, real list] => real list)
390 *** Free ( lll, real)
391 *** Const ( List.list.Nil, real list)
393 > val (SOME ct) = parse thy "lll";
394 > val ty = (#T o rep_cterm) ct;
396 val it = false : bool *)
399 fun has_list_type (Free(_,T)) = is_list_type T
400 | has_list_type _ = false;
402 > val (SOME ct) = parse thy "lll::real list";
403 > has_list_type (term_of ct);
405 > val (SOME ct) = parse thy "[lll::real]";
406 > has_list_type (term_of ct);
407 val it = false : bool *)
409 fun is_parsed (Syn _) = false
410 | is_parsed _ = true;
411 fun parse_ok its = foldl and_ (true, map is_parsed its);
413 fun all_dsc_in itm_s =
415 fun d_in (Cor ((d,_),_)) = [d]
418 | d_in (Inc ((d,_),_)) = [d]
419 | d_in (Sup (d,_)) = [d]
420 | d_in (Mis (d,_)) = [d];
421 in (flat o (map d_in)) itm_s end;
424 fun is_Syn (Syn _) = true
425 | is_Syn (Typ _) = true
428 fun is_error (Cor (_,ts)) = false
429 | is_error (Sup (_,ts)) = false
430 | is_error (Inc (_,ts)) = false
431 | is_error (Mis (_,ts)) = false
435 fun ct_in (Syn (c)) = c
436 | ct_in (Typ (c)) = c
437 | ct_in _ = raise error "ct_in called for Cor .. Sup";
440 (*#############################################################*)
441 (*#############################################################*)
442 (* vvv--- aus nnewcode.sml am 30.1.00 ---vvv *)
445 (* testdaten besorgen:
446 use"test-coil-kernel.sml";
447 val (PblObj{origin=(oris,_,_),meth={ppc=itms,...},...}) =
452 variant V: oris union ppc => int, id ID: oris union ppc => int
455 EX vt:V. ALL r:oris --> EX i:ppc. ID r = ID i & complete i
458 @vt = max sum(i : ppc) V i
464 > ((vts_cnt (vts_in itms))) itms;
469 > val vts = vts_in itms;
470 val vts = [1,2,3] : int list
471 > val nvts = vts_cnt vts itms;
472 val nvts = [(1,6),(2,5),(3,7)] : (int * int) list
473 > val mx = max2 nvts;
474 val mx = (3,7) : int * int
475 > val v = max_vt itms;
477 --------------------------
481 (*.get the first term in ts from ori.*)
482 (* val (_,_,fd,d,ts) = hd miss;
484 fun getr_ct thy ((_,_,fd,d,ts):ori) =
485 (fd, ((Syntax.string_of_term (thy2ctxt thy)) o
486 (comp_dts thy)) (d,[hd ts]):cterm');
487 (* val t = comp_dts thy (d,[hd ts]);
490 (* get a term from ori, notyet input in itm *)
491 fun geti_ct thy ((_,_,_,d,ts):ori) ((_,_,_,fd,itm_):itm) =
492 (fd, ((Syntax.string_of_term (thy2ctxt thy)) o (comp_dts thy))
493 (d, subtract op = (ts_in itm_) ts):cterm');
494 (* test-maximum.sml fmy <> [], Init_Proof ...
495 val (_,_,_,d,ts) = ori; val (_,_,_,fd,itm_) = hd icl;
496 val d' $ ts' = (term_of o the o (parse thy)) "fixedValues [r=Arbfix]";
501 cterm_of thy (d $ (hd ts));
502 cterm_of thy (d' $ ts');
508 (* in FE dsc, not dat: this is in itms ...*)
509 fun is_untouched ((_,_,false,_,Inc((_,[]),_)):itm) = true
510 | is_untouched _ = false;
513 (* select an item in oris, notyet input in itms
514 (precondition: in itms are only Cor, Sup, Inc) *)
517 | x mem (y :: ys) = x = y orelse x mem ys;
519 fun nxt_add thy ([]:ori list) pbt itms = (*root (only) ori...fmz=[]*)
521 fun test_d d ((i,_,_,_,itm_):itm) = (d = (d_in itm_)) andalso i<>0;
522 fun is_elem itms (f,(d,t)) =
523 case find_first (test_d d) itms of
524 SOME _ => true | NONE => false;
525 in case filter_out (is_elem itms) pbt of
526 (* val ((f,(d,_))::itms) = filter_out (is_elem itms) pbt;
529 SOME (f:string, ((Syntax.string_of_term (thy2ctxt thy)) o comp_dts thy) (d,[]):cterm')
532 (* val (thy,itms) = (assoc_thy (if dI=e_domID then dI' else dI),pbl);
534 | nxt_add thy oris pbt itms =
536 fun testr_vt v ori = (curry (op mem) v) (#2 (ori:ori))
537 andalso (#3 ori) <>"#undef";
538 fun testi_vt v itm = (curry (op mem) v) (#2 (itm:itm));
539 fun test_id ids r = curry (op mem) (#1 (r:ori)) ids;
540 (* val itm = hd icl; val (_,_,_,d,ts) = v6;
542 fun test_subset (itm:itm) ((_,_,_,d,ts):ori) =
543 (d_in (#5 itm)) = d andalso subset op = (ts_in (#5 itm), ts);
544 fun false_and_not_Sup((i,v,false,f,Sup _):itm) = false
545 | false_and_not_Sup (i,v,false,f, _) = true
546 | false_and_not_Sup _ = false;
548 val v = if itms = [] then 1 else max_vt itms;
549 val vors = if v = 0 then oris else filter (testr_vt v) oris;(*oris..vat*)
550 val vits = if v = 0 then itms (*because of dsc without dat*)
551 else filter (testi_vt v) itms; (*itms..vat*)
552 val icl = filter false_and_not_Sup vits; (* incomplete *)
554 then case filter_out (test_id (map #1 vits)) vors of
556 (* val miss = filter_out (test_id (map #1 vits)) vors;
558 | miss => SOME (getr_ct thy (hd miss))
560 case find_first (test_subset (hd icl)) vors of
561 (* val SOME ori = find_first (test_subset (hd icl)) vors;
563 NONE => raise error "nxt_add: EX itm. not(dat(itm)<=dat(ori))"
564 | SOME ori => SOME (geti_ct thy ori (hd icl))
570 fun mk_delete thy "#Given" itm_ = Del_Given (itm_out thy itm_)
571 | mk_delete thy "#Find" itm_ = Del_Find (itm_out thy itm_)
572 | mk_delete thy "#Relate" itm_ = Del_Relation(itm_out thy itm_)
573 | mk_delete thy str _ =
574 raise error ("mk_delete: called with field '"^str^"'");
575 fun mk_additem "#Given" ct = Add_Given ct
576 | mk_additem "#Find" ct = Add_Find ct
577 | mk_additem "#Relate"ct = Add_Relation ct
579 raise error ("mk_additem: called with field '"^str^"'");
585 (* find the next tac in specify (except nxt_model_pbl)
586 4.00.: TODO: do not return a pos !!!
587 (sind from DG comes the _OLD_ writepos)*)
589 > val (pbl,pbt,mpc) =(pbl',get_pbt cpI,(#ppc o get_met) cmI);
590 > val (dI,pI,mI) = empty_spec;
591 > nxt_spec Pbl (oris:ori list) ((dI',pI',mI'):spec(*original*))
592 ((pbl:itm list), (met:itm list)) (pbt,mpc) ((dI,pI,mI):spec);
595 > val met = [];val (pbt,mpc) = (get_pbt pI',(#ppc o get_met) mI');
596 > val (dI,pI,mI) = empty_spec;
597 > nxt_spec Pbl (oris:ori list) ((dI',pI',mI'):spec(*original*))
598 ((pbl:itm list), (met:itm list)) (pbt,mpc) ((dI,pI,mI):spec);
601 (*. determine the next step of specification;
602 not done here: Refine_Tacitly (otherwise *** unknown method: (..., no_met))
603 eg. in rootpbl 'no_met':
605 preok predicates are _all_ ok, or problem matches completely
606 oris immediately from formalization
607 (dI',pI',mI') specification coming from author/parent-problem
608 (pbl, item lists specified by user
609 met) -"-, tacitly completed by copy_probl
610 (dI,pI,mI) specification explicitly done by the user
611 (pbt, mpc) problem type, guard of method
613 (* val (preok,pbl,pbt,mpc)=(pb,pbl',(#ppc o get_pbt) cpI,(#ppc o get_met) cmI);
614 val (preok,pbl,pbt,mpc)=(pb,pbl',ppc,(#ppc o get_met) cmI);
615 val (Pbl, preok, oris, (dI',pI',mI'), (pbl,met), (pbt,mpc), (dI,pI,mI)) =
616 (p_, pb, oris, (dI',pI',mI'), (probl,meth),
617 (ppc, (#ppc o get_met) cmI), (dI,pI,mI));
619 fun nxt_spec Pbl preok (oris:ori list) ((dI',pI',mI'):spec)
620 ((pbl:itm list), (met:itm list)) (pbt,mpc) ((dI,pI,mI):spec) =
621 ((*writeln"### nxt_spec Pbl";*)
622 if dI'=e_domID andalso dI=e_domID then (Pbl, Specify_Theory dI')
623 else if pI'=e_pblID andalso pI=e_pblID then (Pbl, Specify_Problem pI')
624 else case find_first (is_error o #5) (pbl:itm list) of
625 SOME (_,_,_,fd,itm_) =>
627 (assoc_thy (if dI=e_domID then dI' else dI)) fd itm_)
629 ((*writeln"### nxt_spec is_error NONE";*)
630 case nxt_add (assoc_thy (if dI=e_domID then dI' else dI))
632 (* val SOME (fd,ct') = nxt_add (assoc_thy (if dI=e_domID then dI' else dI))
635 SOME (fd,ct') => ((*writeln"### nxt_spec nxt_add SOME";*)
636 (Pbl, mk_additem fd ct'))
637 | NONE => (*pbl-items complete*)
638 if not preok then (Pbl, Refine_Problem pI')
640 if dI = e_domID then (Pbl, Specify_Theory dI')
641 else if pI = e_pblID then (Pbl, Specify_Problem pI')
642 else if mI = e_metID then (Pbl, Specify_Method mI')
644 case find_first (is_error o #5) met of
645 SOME (_,_,_,fd,itm_) =>
646 (Met, mk_delete (assoc_thy dI) fd itm_)
648 (case nxt_add (assoc_thy dI) oris mpc met of
649 SOME (fd,ct') => (*30.8.01: pre?!?*)
650 (Met, mk_additem fd ct')
652 ((*Solv 3.4.00*)Met, Apply_Method mI))))
653 (* val preok=pb; val (pbl, met) = (pbl,met');
654 val (pbt,mpc)=((#ppc o get_pbt) cpI,(#ppc o get_met) cmI);
655 val (Met, preok, oris, (dI',pI',mI'), (pbl,met), (pbt,mpc), (dI,pI,mI)) =
656 (p_, pb, oris, (dI',pI',mI'), (probl,meth),
657 (ppc, (#ppc o get_met) cmI), (dI,pI,mI));
659 | nxt_spec Met preok oris (dI',pI',mI') (pbl, met) (pbt,mpc) (dI,pI,mI) =
660 ((*writeln"### nxt_spec Met"; *)
661 case find_first (is_error o #5) met of
662 SOME (_,_,_,fd,itm_) =>
663 (Met, mk_delete (assoc_thy (if dI=e_domID then dI' else dI)) fd itm_)
665 case nxt_add (assoc_thy (if dI=e_domID then dI' else dI))oris mpc met of
666 SOME (fd,ct') => (Met, mk_additem fd ct')
668 ((*writeln"### nxt_spec Met: nxt_add NONE";*)
669 if dI = e_domID then (Met, Specify_Theory dI')
670 else if pI = e_pblID then (Met, Specify_Problem pI')
671 else if not preok then (Met, Specify_Method mI)
672 else (Met, Apply_Method mI)));
675 val itms = [(1,[1],true,"#Find",Cor(e_term,[e_term])):itm,
676 (2,[2],true,"#Find",Syn("empty"))];
680 (* ^^^--- aus nnewcode.sml am 30.1.00 ---^^^ *)
681 (*#############################################################*)
682 (*#############################################################*)
683 (* vvv--- aus nnewcode.sml vor 29.1.00 ---vvv *)
686 fun update_itm (cl,d,ts) ((id,vt,_,sl,Cor (_,_)):itm) =
687 (id,vt,cl,sl,Cor (d,ts)):itm
688 | update_itm (cl,d,ts) (id,vt,_,sl,Syn (_)) =
689 raise error ("update_itm "^((Syntax.string_of_term (thy2ctxt thy)) (comp_dts thy (d,ts)))^
690 " not not for Syn (s:cterm')")
691 | update_itm (cl,d,ts) (id,vt,_,sl,Typ (_)) =
692 raise error ("update_itm "^((Syntax.string_of_term (thy2ctxt thy)) (comp_dts thy (d,ts)))^
693 " not not for Typ (s:cterm')")
694 | update_itm (cl,d,ts) (id,vt,_,sl,Fal (_,_)) =
695 (id,vt,cl,sl,Fal (d,ts))
696 | update_itm (cl,d,ts) (id,vt,_,sl,Inc (_,_)) =
697 (id,vt,cl,sl,Inc (d,ts))
698 | update_itm (cl,d,ts) (id,vt,_,sl,Sup (_,_)) =
699 (id,vt,cl,sl,Sup (d,ts));
705 fun is_field_correct sel d dscpbt =
706 case assoc (dscpbt, sel) of
708 | SOME ds => member op = ds d;
710 (*. update the itm_ already input, all..from ori .*)
711 (* val (id,vt,fd,d,ts) = (i,v,f,d,ts\\ts');
713 fun ori_2itm thy itm_ pid all ((id,vt,fd,d,ts):ori) =
715 val ts' = union op = (ts_in itm_) ts;
716 val pval = pbl_ids' thy d ts'
717 (*WN.9.5.03: FIXXXME [#0, epsilon]
718 here would upd_penv be called for [#0, epsilon] etc. *)
719 val complete = if eq_set op = (ts', all) then true else false;
722 (if fd = "#undef" then (id,vt,complete,fd,Sup(d,ts'))
723 else (id,vt,complete,fd,Cor((d,ts'),(pid, pval)))):itm
724 | (Syn c) => raise error ("ori_2itm wants to overwrite "^c)
725 | (Typ c) => raise error ("ori_2itm wants to overwrite "^c)
726 | (Inc _) => if complete
727 then (id,vt,true ,fd, Cor ((d,ts'),(pid, pval)))
728 else (id,vt,false,fd, Inc ((d,ts'),(pid, pval)))
729 | (Sup ((*_,_*)d,ts')) => (*4.9.01 lost env*)
730 (*if fd = "#undef" then*) (id,vt,complete,fd,Sup(d,ts'))
731 (*else (id,vt,complete,fd,Cor((d,ts'),e))*)
732 (* 28.1.00: not completely clear ---^^^ etc.*)
733 (* 4.9.01: Mis just copied---vvv *)
734 | (Mis _) => if complete
735 then (id,vt,true ,fd, Cor ((d,ts'),(pid, pval)))
736 else (id,vt,false,fd, Inc ((d,ts'),(pid, pval)))
740 fun eq1 d (_,(d',_)) = (d = d');
741 fun eq3 f d (_,_,_,f',itm_) = f = f' andalso d = (d_in itm_);
744 (* 'all' ts from ori; ts is the input; (ori carries rest of info)
745 9.01: this + ori_2itm is _VERY UNCLEAR_ ? overhead ?
746 pval: value for problem-environment _NOT_ checked for 'inter' --
747 -- FIXXME.WN.11.03 the generation of penv has to go to insert_ppc
748 (as it has been done for input_icalhd+insert_ppc' in 11.03)*)
749 (*. is_input ori itms <=>
750 EX itm. (1) ori(field,dsc) = itm(field,dsc) & (2..4)
751 (2) ori(ts) subset itm(ts) --- Err "already input"
752 (3) ori(ts) inter itm(ts) = empty --- new: ori(ts)
753 (4) -"- <> empty --- new: ori(ts) \\ inter .*)
754 (* val(itms,(i,v,f,d,ts)) = (ppc,ori');
756 fun is_notyet_input thy (itms:itm list) all ((i,v,f,d,ts):ori) pbt =
757 case find_first (eq1 d) pbt of
758 SOME (_,(_,pid)) =>(* val SOME (_,(_,pid)) = find_first (eq1 d) pbt;
759 val SOME (_,_,_,_,itm_)=find_first (eq3 f d) itms;
761 (case find_first (eq3 f d) itms of
762 SOME (_,_,_,_,itm_) =>
764 val ts' = inter op = (ts_in itm_) ts;
765 in if subset op = (ts, ts')
767 map (Syntax.string_of_term (thy2ctxt thy))) ts')^
768 " already input", e_itm) (*2*)
770 ori_2itm thy itm_ pid all (i,v,f,d,
771 subtract op = ts' ts)) (*3,4*)
773 | NONE => ("", ori_2itm thy (Inc ((e_term,[]),(pid,[])))
774 pid all (i,v,f,d,ts)) (*1*)
776 | NONE => ("", ori_2itm thy (Sup (d,ts))
777 e_term all (i,v,f,d,ts));
779 fun test_types thy (d,ts) =
781 val s = !show_types; val _ = show_types:= true;
782 val opt = (try (comp_dts thy)) (d,ts);
783 val msg = case opt of
785 | NONE => ((Syntax.string_of_term (thy2ctxt thy) d)^" "^
786 ((strs2str' o map (Syntax.string_of_term (thy2ctxt thy))) ts)
788 val _ = show_types:= s
793 fun maxl [] = raise error "maxl of []"
796 | mx x (y::ys) = if x < (y:int) then mx y ys else mx x ys
800 (*. is the input term t known in oris ?
801 give feedback on all(?) strange input;
802 return _all_ terms already input to this item (e.g. valuesFor a,b) .*)
803 (*WN.11.03: from lists*)
804 fun is_known thy sel ori t =
805 (* val (ori,t)=(oris,term_of ct);
808 val ots = (distinct o flat o (map #5)) (ori:ori list);
809 val oids = ((map (fst o dest_Free)) o distinct o
810 flat o (map vars)) ots;
811 val (d,ts(*,pval*)) = split_dts thy t;
812 val ids = map (fst o dest_Free)
813 ((distinct o (flat o (map vars))) ts);
814 in if (subtract op = oids ids) <> []
815 then (("identifiers "^(strs2str' (subtract op = oids ids))^
816 " not in example"), e_ori_, [])
820 if not (subset op = (map typeless ts, map typeless ots))
822 ((strs2str' o (map (Syntax.string_of_term
823 (thy2ctxt thy)))) ts)^
824 "' not in example (typeless)"), e_ori_, [])
825 else (case seek_orits thy sel ts ori of
826 ("", ori_ as (_,_,_,d,ts), all) =>
827 (case test_types thy (d,ts) of
828 "" => ("", ori_, all)
829 | msg => (msg, e_ori_, []))
830 | (msg,_,_) => (msg, e_ori_, []))
832 if member op = (map #4 ori) d
833 then seek_oridts thy sel (d,ts) ori
834 else ((Syntax.string_of_term (thy2ctxt thy) d)^
835 (*" not in example", e_ori_, []) ///11.11.03*)
836 " not in example", (0,[],sel,d,ts), [])
840 (*. for return-value of appl_add .*)
843 | Err of string; (*error-message*)
846 (*. add an item; check wrt. oris and pbt .*)
848 (* in contrary to oris<>[] below, this part handles user-input
849 extremely acceptive, i.e. accept input instead error-msg *)
850 fun appl_add thy sel ([]:ori list) ppc pbt ct' =
851 (* val (ppc,pbt,ct',env) = (pbl, (#ppc o get_pbt) cpI, ct, []:envv);
852 !!!! 28.8.01: env tested _minimally_ !!!
855 val i = 1 + (if ppc=[] then 0 else maxl (map #1 ppc));
856 in case parse thy ct' of (*should be done in applicable_in 4.00.FIXME*)
857 NONE => Add (i,[],false,sel,Syn ct')
858 (* val (SOME ct) = parse thy ct';
862 val (d,ts(*,pval*)) = split_dts thy (term_of ct);
864 then Add (i,[],false,sel,Mis (dsc_unknown,hd ts(*24.3.02*)))
867 (case find_first (eq1 d) pbt of
868 NONE => Add (i,[],true,sel,Sup ((d,ts)))
870 (* val SOME (f,(_,id)) = find_first (eq1 d) pbt;
873 fun eq2 d ((i,_,_,_,itm_):itm) =
874 (d = (d_in itm_)) andalso i<>0;
875 in case find_first (eq2 d) ppc of
876 NONE => Add (i,[],true,f, Cor ((d,ts), (id, (*pval*)
878 | SOME (i',_,_,_,itm_) =>
879 (* val SOME (i',_,_,_,itm_) = find_first (eq2 d) ppc;
880 val NONE = find_first (eq2 d) ppc;
883 then let val ts = union op = ts (ts_in itm_)
884 in Add (if ts_in itm_ = [] then i else i',
885 [],true,f,Cor ((d, ts), (id, (*pval*)
888 else Add (i',[],true,f,Cor ((d,ts),(id, (*pval*)
894 (*. add ct to ppc .*)
895 (*FIXXME: accept items as Sup, Syn here, too (like appl_add..oris=[] above)*)
896 (* val (ppc,pbt) = (pbl, ppc);
897 val (ppc,pbt) = (met, (#ppc o get_met) cmI);
899 val (ppc,pbt) = (pbl, (#ppc o get_pbt) cpI);
901 | appl_add thy sel oris ppc pbt(*only for upd_envv*) ct =
903 val ctopt = parse thy ct;
905 NONE => Err ("syntax error in "^ct)
906 | SOME ct =>(* val SOME ct = ctopt;
907 val (msg,ori',all) = is_known thy sel oris (term_of ct);
908 val (msg,itm) = is_notyet_input thy ppc all ori' pbt;
910 (case is_known thy sel oris (term_of ct) of
911 ("",ori'(*ts='ct'*), all) =>
912 (case is_notyet_input thy ppc all ori' pbt of
914 | (msg,_) => Err msg)
915 | (msg,_,_) => Err msg)
918 > val (msg,itm) = is_notyet_input thy ppc all ori';
919 val itm = (12,[3],false,"#Relate",Cor (Const #,[#,#])) : itm
921 > val ts = ts_in itm_;
925 (*---------------------------------------------(4) nach ptyps.sml 23.3.02*)
928 (** make oris from args of the stac SubProblem and from pbt **)
930 (*.can this formal argument (of a model-pattern) be omitted in the arg-list
931 of a SubProblem ? see ME/ptyps.sml 'type met '.*)
932 fun is_copy_named_idstr str =
933 case (rev o explode) str of
934 (*"_"::_ ::"_"::_ => true*)
935 "'"::"'"::"'"::_ => true
937 (*> is_copy_named_idstr "v_i'''";
939 > is_copy_named_idstr "e_";
940 val it = false : bool
941 > is_copy_named_idstr "L___";
944 (*.should this formal argument (of a model-pattern) create a new identifier?.*)
945 fun is_copy_named_generating_idstr str =
946 if is_copy_named_idstr str
947 then case (rev o explode) str of
948 "_"::"_"::"_"::_ => false
951 (*> is_copy_named_generating_idstr "v_i'''";
953 > is_copy_named_generating_idstr "L___";
954 val it = false : bool
957 (*.can this formal argument (of a model-pattern) be omitted in the arg-list
958 of a SubProblem ? see ME/ptyps.sml 'type met '.*)
959 fun is_copy_named (_,(_,t)) = (is_copy_named_idstr o free2str) t;
960 (*.should this formal argument (of a model-pattern) create a new identifier?.*)
961 fun is_copy_named_generating (_,(_,t)) =
962 (is_copy_named_generating_idstr o free2str) t;
965 (*.split type-wrapper from scr-arg and build part of an ori;
966 an type-error is reported immediately, raises an exn,
967 subsequent handling of exn provides 2nd part of error message.*)
968 (*fun mtc thy ((str, (dsc, _)):pat) (ty $ var) = WN100820 made cterm to term
969 (* val (thy, (str, (dsc, _)), (ty $ var)) =
972 (cterm_of thy (dsc $ var);(*type check*)
973 SOME ((([1], str, dsc, (*[var]*)
974 split_dts' (dsc, var))): preori)(*:ori without leading #*))
975 handle e as TYPE _ =>
976 (writeln (dashs 70^"\n"
977 ^"*** ERROR while creating the items for the model of the ->problem\n"
978 ^"*** from the ->stac with ->typeconstructor in arglist:\n"
979 ^"*** item (->description ->value): "^term2str dsc^" "^term2str var^"\n"
980 ^"*** description: "^(term_detail2str dsc)
981 ^"*** value: "^(term_detail2str var)
982 ^"*** typeconstructor in script: "^(term_detail2str ty)
983 ^"*** checked by theory: "^(theory2str thy)^"\n"
985 print_exn e; (*raises exn again*)
987 fun mtc thy ((str, (dsc, _)):pat) (ty $ var) =
988 (* val (thy, (str, (dsc, _)), (ty $ var)) =
991 (cterm_of thy (dsc $ var);(*type check*)
992 SOME ((([1], str, dsc, (*[var]*)
993 split_dts' (dsc, var))): preori)(*:ori without leading #*))
994 handle e as TYPE _ =>
995 (writeln (dashs 70^"\n"
996 ^"*** ERROR while creating the items for the model of the ->problem\n"
997 ^"*** from the ->stac with ->typeconstructor in arglist:\n"
998 ^"*** item (->description ->value): "^term2str dsc^" "^term2str var^"\n"
999 ^"*** description: "^(term_detail2str dsc)
1000 ^"*** value: "^(term_detail2str var)
1001 ^"*** typeconstructor in script: "^(term_detail2str ty)
1002 ^"*** checked by theory: "^(theory2str thy)^"\n"
1004 (*WN100820 postponed: print_exn e; raises exn again*)
1006 (*> val pbt = (#ppc o get_pbt) ["univariate","equation"];
1007 > val Const ("Script.SubProblem",_) $
1008 (Const ("Pair",_) $ Free (thy', _) $
1009 (Const ("Pair",_) $ pblID' $ metID')) $ ags =
1010 str2term"(SubProblem (SqRoot_,[univariate,equation],\
1011 \[SqRoot_,solve_linear]) [BOOL (x+1- 2=0), REAL x])::bool list";
1012 > val ags = isalist2list ags;
1013 > mtc thy (hd pbt) (hd ags);
1014 val it = SOME ([1],"#Given",Const (#,#),[# $ #]) *)
1016 (*.match each pat of the model-pattern with an actual argument;
1017 precondition: copy-named vars are filtered out.*)
1018 fun matc thy ([]:pat list) _ (oris:preori list) = oris
1019 | matc thy pbt [] _ =
1020 (writeln (dashs 70);
1021 raise error ("actual arg(s) missing for '"^pats2str pbt
1022 ^"' i.e. should be 'copy-named' by '*_._'"))
1023 | matc thy ((p as (s,(d,t)))::pbt) (a::ags) oris =
1024 (* val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
1025 (thy, pbt', ags, []);
1027 val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
1028 (thy, pbt, ags, (oris @ [ori]));
1030 (*del?..*)if (is_copy_named_idstr o free2str) t then oris
1031 else(*..del?*) let val opt = mtc thy p a;
1033 (* val SOME ori = mtc thy p a;
1035 SOME ori => matc thy pbt ags (oris @ [ori])
1036 | NONE => [](*WN050903 skipped by exn handled in match_ags*)
1038 (* run subp-rooteq.sml until Init_Proof before ...
1039 > val Nd (PblObj {origin=(oris,_,_),...},_) = pt;(*from test/subp-rooteq.sml*)
1040 > fun xxxfortest (_,a,b,c,d) = (a,b,c,d);val oris = map xxxfortest oris;
1042 other vars as in mtc ..
1043 > matc thy (drop_last pbt) ags [];
1044 val it = ([[1],"#Given",Const #,[#]),(0,[#],"#Given",Const #,[#])],2)*)
1047 (*WN051014 outcommented with redesign copy-named (for omitting '#Find'
1049 kept as initial idea for generating x_1, x_2, ... for equations*)
1050 fun cpy_nam (pbt:pat list) (oris:preori list) (p as (field,(dsc,t)):pat) =
1051 (* val ((pbt:pat list), (oris:preori list), ((field,(dsc,t)):pat)) =
1052 (pbt', oris', hd (*!!!!!*) cy);
1054 (if is_copy_named_generating p
1055 then (*WN051014 kept strange old code ...*)
1056 let fun sel (_,_,d,ts) = comp_ts (d, ts)
1057 val cy' = (implode o drop_last o drop_last o explode o free2str) t
1058 val ext = (last_elem o drop_last o explode o free2str) t
1059 val vars' = map (free2str o snd o snd) pbt(*cpy-nam filtered_out*)
1060 val vals = map sel oris
1061 val cy_ext = (free2str o the) (assoc (vars'~~vals, cy'))^"_"^ext
1062 in ([1], field, dsc, [mk_free (type_of t) cy_ext]):preori end
1063 else ([1], field, dsc, [t])
1065 handle _ => raise error ("cpy_nam: for "^(term2str t));
1067 (*> val (field,(dsc,t)) = last_elem pbt;
1068 > cpy_nam pbt (drop_last oris) (field,(dsc,t));
1069 val it = ([1],"#Find",
1070 Const ("Descript.solutions","bool List.list => Tools.toreall"),
1071 [Free ("x_i","bool List.list")]) *)
1074 (*.match the actual arguments of a SubProblem with a model-pattern
1075 and create an ori list (in root-pbl created from formalization).
1076 expects ags:pats = 1:1, while copy-named are filtered out of pats;
1077 copy-named pats are appended in order to get them into the model-items.*)
1078 fun match_ags thy (pbt:pat list) ags =
1079 (* val (thy, pbt, ags) = (thy, (#ppc o get_pbt) pI, ags);
1080 val (thy, pbt, ags) = (thy, pats, ags);
1082 let fun flattup (i,(var,bool,str,itm_)) = (i,var,bool,str,itm_);
1083 val pbt' = filter_out is_copy_named pbt;
1084 val cy = filter is_copy_named pbt;
1085 val oris' = matc thy pbt' ags [];
1086 val cy' = map (cpy_nam pbt' oris') cy;
1087 val ors = add_id (oris' @ cy');
1088 (*appended in order to get ^^^^^ them into the model-items*)
1089 in (map flattup ors):ori list end;
1091 > match_ags thy pbt ags;
1093 [(1,[1],"#Given",Const ("Descript.equality","bool => Tools.una"),
1094 [Const # $ (# $ #) $ Free (#,#)]),
1095 (2,[1],"#Given",Const ("Descript.solveFor","RealDef.real => Tools.una"),
1096 [Free ("x","RealDef.real")]),
1098 Const ("Descript.solutions","bool List.list => Tools.toreall"),
1099 [Free ("x_i","bool List.list")])] : ori list*)
1101 (*.report part of the error-msg which is not available in match_args.*)
1102 fun match_ags_msg pI stac ags =
1103 let val s = !show_types
1104 val _ = show_types:= true
1105 val pats = (#ppc o get_pbt) pI
1106 val msg = (dots 70^"\n"
1107 ^"*** problem "^strs2str pI^" has the ...\n"
1108 ^"*** model-pattern "^pats2str pats^"\n"
1109 ^"*** stac '"^term2str stac^"' has the ...\n"
1110 ^"*** arg-list "^terms2str ags^"\n"
1112 val _ = show_types:= s
1116 (*get the variables out of a pbl_; FIXME.WN.0311: is_copy_named ...obscure!!!*)
1117 fun vars_of_pbl_ pbl_ =
1118 let fun var_of_pbl_ (gfr,(dsc,t)) = t
1119 in ((map var_of_pbl_) o (filter_out is_copy_named)) pbl_ end;
1120 fun vars_of_pbl_' pbl_ =
1121 let fun var_of_pbl_ (gfr,(dsc,t)) = t:term
1122 in ((map var_of_pbl_)(* o (filter_out is_copy_named)*)) pbl_ end;
1124 fun overwrite_ppc thy itm ppc =
1126 fun repl ppc' (_,_,_,_,itm_) [] =
1127 raise error ("overwrite_ppc: " ^ (itm_2str_ (thy2ctxt thy) itm_) ^
1129 | repl ppc' itm (p::ppc) =
1130 if (#1 itm) = (#1 (p:itm)) then ppc' @ [itm] @ ppc
1131 else repl (ppc' @ [p]) itm ppc
1132 in repl [] itm ppc end;
1134 (*10.3.00: insert the already compiled itm into model;
1135 ev. filter_out untouched (in FE: (0,...)) item related to insert-item *)
1138 fun insert_ppc thy itm ppc =
1140 fun eq_untouched d ((0,_,_,_,itm_):itm) = (d = d_in itm_)
1141 | eq_untouched _ _ = false;
1144 (*writeln("### insert_ppc: itm= "^(itm2str_ itm));*)
1145 case seek_ppc (#1 itm) ppc of
1146 (* val SOME xxx = seek_ppc (#1 itm) ppc;
1148 SOME _ => (*itm updated in is_notyet_input WN.11.03*)
1149 overwrite_ppc thy itm ppc
1150 | NONE => (ppc @ [itm]));
1151 in filter_out (eq_untouched ((d_in o #5) itm)) ppc' end;
1153 (*from Isabelle/src/Pure/library.ML, _appends_ a new element*)
1154 fun gen_ins' eq (x, xs) = if gen_mem eq (x, xs) then xs else xs @ [x];
1156 fun eq_dsc ((_,_,_,_,itm_):itm, (_,_,_,_,iitm_):itm) =
1157 (d_in itm_) = (d_in iitm_);
1158 (*insert_ppc = insert_ppc' for appl_add', input_icalhd 11.03,
1159 handles superfluous items carelessly*)
1160 fun insert_ppc' itm itms = gen_ins' eq_dsc (itm, itms);
1162 > gen_ins' eee (4,[1,3,5,7]);
1163 val it = [1, 3, 5, 7, 4] : int list*)
1166 (*. output the headline to a ppc .*)
1167 fun header p_ pI mI =
1168 case p_ of Pbl => Problem (if pI = e_pblID then [] else pI)
1170 | pos => raise error ("header called with "^ pos_2str pos);
1174 (* test-printouts ---
1175 val _=writeln("### insert_ppc: (d,ts)="^((Syntax.string_of_term (thy2ctxt thy))(comp_dts thy(d,ts))));
1176 val _=writeln("### insert_ppc: pts= "^
1177 (strs2str' o map (Syntax.string_of_term (thy2ctxt thy))) pts);
1180 val sel = "#Given"; val Add_Given' ct = m;
1182 val sel = "#Find"; val Add_Find' (ct,_) = m;
1184 val (_,_,f,nxt',_,pt')= specify_additem sel (ct,[]) (p,Pbl(*!!!!!!!*)) c pt;
1186 val sel = "#Given"; val Add_Given' (ct,_) = nxt; val (p,_) = p;
1188 fun specify_additem sel (ct,_) (p,Met) c pt =
1190 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1191 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1192 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1193 (*val ppt = if pI = e_pblID then get_pbt pI' else get_pbt pI;*)
1194 val cpI = if pI = e_pblID then pI' else pI;
1195 val cmI = if mI = e_metID then mI' else mI;
1196 val {ppc,pre,prls,...} = get_met cmI
1197 in case appl_add thy sel oris met ppc ct of
1198 Add itm (*..union old input *) =>
1199 let (* val Add itm = appl_add thy sel oris met (#ppc (get_met cmI)) ct;
1201 val met' = insert_ppc thy itm met;
1202 (*val pt' = update_met pt p met';*)
1203 val ((p,Met),_,_,pt') =
1204 generate1 thy (case sel of
1205 "#Given" => Add_Given' (ct, met')
1206 | "#Find" => Add_Find' (ct, met')
1207 | "#Relate"=> Add_Relation'(ct, met'))
1209 val pre' = check_preconds thy prls pre met'
1210 val pb = foldl and_ (true, map fst pre')
1211 (*val _=writeln("@@@ specify_additem: Met Add before nxt_spec")*)
1213 nxt_spec Met pb oris (dI',pI',mI') (pbl,met')
1214 ((#ppc o get_pbt) cpI,ppc) (dI,pI,mI);
1215 in ((p,p_), ((p,p_),Uistate),
1216 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1217 (Method cmI, itms2itemppc thy met' pre'))),
1220 let val pre' = check_preconds thy prls pre met
1221 val pb = foldl and_ (true, map fst pre')
1222 (*val _=writeln("@@@ specify_additem: Met Err before nxt_spec")*)
1224 nxt_spec Met pb oris (dI',pI',mI') (pbl,met)
1225 ((#ppc o get_pbt) cpI,(#ppc o get_met) cmI) (dI,pI,mI);
1226 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1230 | specify_additem sel (ct,_) (p,_(*Frm, Pbl*)) c pt =
1232 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1233 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1234 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1235 val cpI = if pI = e_pblID then pI' else pI;
1236 val cmI = if mI = e_metID then mI' else mI;
1237 val {ppc,where_,prls,...} = get_pbt cpI;
1238 in case appl_add thy sel oris pbl ppc ct of
1239 Add itm (*..union old input *) =>
1240 (* val Add itm = appl_add thy sel oris pbl ppc ct;
1243 (*val _= writeln("###specify_additem: itm= "^(itm2str_ itm));*)
1244 val pbl' = insert_ppc thy itm pbl
1245 val ((p,Pbl),_,_,pt') =
1246 generate1 thy (case sel of
1247 "#Given" => Add_Given' (ct, pbl')
1248 | "#Find" => Add_Find' (ct, pbl')
1249 | "#Relate"=> Add_Relation'(ct, pbl'))
1251 val pre = check_preconds thy prls where_ pbl'
1252 val pb = foldl and_ (true, map fst pre)
1253 (*val _=writeln("@@@ specify_additem: Pbl Add before nxt_spec")*)
1255 nxt_spec Pbl pb oris (dI',pI',mI') (pbl',met)
1256 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1257 val ppc = if p_= Pbl then pbl' else met;
1258 in ((p,p_), ((p,p_),Uistate),
1259 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1261 itms2itemppc thy ppc pre))), nxt,Safe,pt') end
1264 let val pre = check_preconds thy prls where_ pbl
1265 val pb = foldl and_ (true, map fst pre)
1266 (*val _=writeln("@@@ specify_additem: Pbl Err before nxt_spec")*)
1268 nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1269 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1270 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1272 (* val sel = "#Find"; val (p,_) = p; val Add_Find' ct = nxt;
1273 val (_,_,f,nxt',_,pt')= specify_additem sel ct (p,Met) c pt;
1277 val (msg,itm) = appl_add thy sel oris ppc ct;
1278 val (Cor(d,ts)) = #5 itm;
1285 (* val Init_Proof' (fmz,(dI',pI',mI')) = m;
1286 specify (Init_Proof' (fmz,(dI',pI',mI'))) e_pos' [] EmptyPtree;
1288 fun specify (Init_Proof' (fmz,(dI',pI',mI'))) (_:pos') (_:cid) (_:ptree)=
1289 let (* either """"""""""""""" all empty or complete *)
1290 val thy = assoc_thy dI';
1291 val oris = if dI' = e_domID orelse pI' = e_pblID then ([]:ori list)
1292 else prep_ori fmz thy ((#ppc o get_pbt) pI');
1293 val (pt,c) = cappend_problem e_ptree [] e_istate (fmz,(dI',pI',mI'))
1294 (oris,(dI',pI',mI'),e_term);
1295 val {ppc,prls,where_,...} = get_pbt pI'
1296 (*val pbl = init_pbl ppc; WN.9.03: done in Model/Refine_Problem
1297 val pt = update_pbl pt [] pbl;
1298 val pre = check_preconds thy prls where_ pbl
1299 val pb = foldl and_ (true, map fst pre)*)
1300 val (pbl, pre, pb) = ([], [], false)
1303 (([],Pbl), (([],Pbl),Uistate),
1304 Form' (PpcKF (0,EdUndef,(length []),Nundef,
1305 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1306 Refine_Tacitly pI', Safe,pt)
1308 (([],Pbl), (([],Pbl),Uistate),
1309 Form' (PpcKF (0,EdUndef,(length []),Nundef,
1310 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1314 (*ONLY for STARTING modeling phase*)
1315 | specify (Model_Problem' (_,pbl,met)) (pos as (p,p_)) c pt =
1316 let (* val (Model_Problem' (_,pbl), pos as (p,p_)) = (m, (p,p_));
1318 val (PblObj{origin=(oris,(dI',pI',mI'),_), spec=(dI,_,_),...}) =
1320 val thy' = if dI = e_domID then dI' else dI
1321 val thy = assoc_thy thy'
1322 val {ppc,prls,where_,...} = get_pbt pI'
1323 val pre = check_preconds thy prls where_ pbl
1324 val pb = foldl and_ (true, map fst pre)
1325 val ((p,_),_,_,pt) =
1326 generate1 thy (Model_Problem'([],pbl,met)) Uistate pos pt
1327 val (_,nxt) = nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1328 (ppc,(#ppc o get_met) mI') (dI',pI',mI');
1329 in ((p,Pbl), ((p,p_),Uistate),
1330 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1331 (Problem pI', itms2itemppc (assoc_thy dI') pbl pre))),
1334 (*. called only if no_met is specified .*)
1335 | specify (Refine_Tacitly' (pI,pIre,_,_,_)) (pos as (p,_)) c pt =
1336 let (* val Refine_Tacitly' (pI,pIre,_,_,_) = m;
1338 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met, ...}) =
1340 val {prls,met,ppc,thy,where_,...} = get_pbt pIre
1341 (*val pbl = init_pbl ppc --- Model_Problem recognizes probl=[]*)
1342 (*val pt = update_pbl pt p pbl;
1343 val pt = update_orispec pt p
1344 (string_of_thy thy, pIre,
1345 if length met = 0 then e_metID else hd met);*)
1346 val (domID, metID) = (string_of_thy thy,
1347 if length met = 0 then e_metID else hd met)
1348 val ((p,_),_,_,pt) =
1349 generate1 thy (Refine_Tacitly'(pI,pIre,domID,metID,(*pbl*)[]))
1351 (*val pre = check_preconds thy prls where_ pbl
1352 val pb = foldl and_ (true, map fst pre)*)
1353 val (pbl, pre, pb) = ([], [], false)
1354 in ((p,Pbl), (pos,Uistate),
1355 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1356 (Problem pIre, itms2itemppc (assoc_thy dI') pbl pre))),
1357 Model_Problem, Safe, pt) end
1359 | specify (Refine_Problem' (rfd as (pI,_))) pos c pt =
1360 let val (pos,_,_,pt) = generate1 (assoc_thy "Isac.thy")
1361 (Refine_Problem' rfd) Uistate pos pt
1362 in (pos(*p,Pbl*), (pos(*p,Pbl*),Uistate), Problems (RefinedKF rfd),
1363 Model_Problem, Safe, pt) end
1365 (* val (Specify_Problem' (pI, (ok, (itms, pre)))) = nxt; val (p,_) = p;
1366 val (Specify_Problem' (pI, (ok, (itms, pre)))) = m; val (p,_) = p;
1368 | specify (Specify_Problem' (pI, (ok, (itms, pre)))) (pos as (p,_)) c pt =
1369 let val (PblObj {origin=(oris,(dI',pI',mI'),_), spec=(dI,_,mI),
1370 meth=met, ...}) = get_obj I pt p;
1371 (*val pt = update_pbl pt p itms;
1372 val pt = update_pblID pt p pI;*)
1373 val thy = assoc_thy dI
1374 val ((p,Pbl),_,_,pt)=
1375 generate1 thy (Specify_Problem' (pI, (ok, (itms, pre)))) Uistate pos pt
1376 val dI'' = assoc_thy (if dI=e_domID then dI' else dI);
1377 val mI'' = if mI=e_metID then mI' else mI;
1378 (*val _=writeln("@@@ specify (Specify_Problem) before nxt_spec")*)
1379 val (_,nxt) = nxt_spec Pbl ok oris (dI',pI',mI') (itms, met)
1380 ((#ppc o get_pbt) pI,(#ppc o get_met) mI'') (dI,pI,mI);
1381 in ((p,Pbl), (pos,Uistate),
1382 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1383 (Problem pI, itms2itemppc dI'' itms pre))),
1385 (* val Specify_Method' mID = nxt; val (p,_) = p;
1386 val Specify_Method' mID = m;
1387 specify (Specify_Method' mID) (p,p_) c pt;
1389 | specify (Specify_Method' (mID,_,_)) (pos as (p,_)) c pt =
1390 let val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1391 meth=met, ...}) = get_obj I pt p;
1392 val {ppc,pre,prls,...} = get_met mID
1393 val thy = assoc_thy dI
1394 val oris = add_field' thy ppc oris;
1395 (*val pt = update_oris pt p oris; 20.3.02: repl. "#undef"*)
1396 val dI'' = if dI=e_domID then dI' else dI;
1397 val pI'' = if pI = e_pblID then pI' else pI;
1398 val met = if met=[] then pbl else met;
1399 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1400 (*val pt = update_met pt p itms;
1401 val pt = update_metID pt p mID*)
1403 generate1 thy (Specify_Method' (mID, oris, itms)) Uistate pos pt
1404 (*val _=writeln("@@@ specify (Specify_Method) before nxt_spec")*)
1405 val (_,nxt) = nxt_spec Met (*ok*)true oris (dI',pI',mI') (pbl, itms)
1406 ((#ppc o get_pbt) pI'',ppc) (dI'',pI'',mID);
1407 in (pos, (pos,Uistate),
1408 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1409 (Method mID, itms2itemppc (assoc_thy dI'') itms pre'))),
1411 (* val Add_Find' ct = nxt; val sel = "#Find";
1413 | specify (Add_Given' ct) p c pt = specify_additem "#Given" ct p c pt
1414 | specify (Add_Find' ct) p c pt = specify_additem "#Find" ct p c pt
1415 | specify (Add_Relation' ct) p c pt=specify_additem"#Relate"ct p c pt
1416 (* val Specify_Theory' domID = m;
1417 val (Specify_Theory' domID, (p,p_)) = (m, pos);
1419 | specify (Specify_Theory' domID) (pos as (p,p_)) c pt =
1420 let val p_ = case p_ of Met => Met | _ => Pbl
1421 val thy = assoc_thy domID;
1422 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met,
1423 probl=pbl, spec=(dI,pI,mI),...}) = get_obj I pt p;
1424 val mppc = case p_ of Met => met | _ => pbl;
1425 val cpI = if pI = e_pblID then pI' else pI;
1426 val {prls=per,ppc,where_=pwh,...} = get_pbt cpI
1427 val cmI = if mI = e_metID then mI' else mI;
1428 val {prls=mer,ppc=mpc,pre=mwh,...} = get_met cmI
1431 Met => (check_preconds thy mer mwh met)
1432 | _ => (check_preconds thy per pwh pbl)
1433 val pb = foldl and_ (true, map fst pre)
1436 (*val _=writeln("@@@ specify (Specify_Theory) THEN before nxt_spec")*)
1437 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI')
1438 (pbl,met) (ppc,mpc) (dI,pI,mI);
1439 in ((p,p_), (pos,Uistate),
1440 Form'(PpcKF (0,EdUndef,(length p), Nundef,
1441 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1443 else (*FIXME: check ppc wrt. (new!) domID ..? still parsable?*)
1445 (*val pt = update_domID pt p domID;11.8.03*)
1446 val ((p,p_),_,_,pt) = generate1 thy (Specify_Theory' domID)
1448 (*val _=writeln("@@@ specify (Specify_Theory) ELSE before nxt_spec")*)
1449 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI') (pbl,met)
1450 (ppc,mpc) (domID,pI,mI);
1451 in ((p,p_), (pos,Uistate),
1452 Form' (PpcKF (0, EdUndef, (length p),Nundef,
1453 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1456 (* itms2itemppc thy [](*mpc*) pre
1458 | specify m' _ _ _ =
1459 raise error ("specify: not impl. for "^tac_2str m');
1461 (* val (sel, Add_Given ct, ptp as (pt,(p,Pbl))) = ("#Given", tac, ptp);
1462 val (sel, Add_Find ct, ptp as (pt,(p,Pbl))) = ("#Find", tac, ptp);
1464 fun nxt_specif_additem sel ct (ptp as (pt,(p,Pbl))) =
1466 val (PblObj{meth=met,origin=(oris,(dI',pI',_),_),
1467 probl=pbl,spec=(dI,pI,_),...}) = get_obj I pt p;
1468 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1469 val cpI = if pI = e_pblID then pI' else pI;
1470 in case appl_add thy sel oris pbl ((#ppc o get_pbt) cpI) ct of
1471 Add itm (*..union old input *) =>
1472 (* val Add itm = appl_add thy sel oris pbl ppc ct;
1475 (*val _=writeln("###nxt_specif_additem: itm= "^(itm2str_ itm));*)
1476 val pbl' = insert_ppc thy itm pbl
1479 "#Given" => (Add_Given ct, Add_Given' (ct, pbl'))
1480 | "#Find" => (Add_Find ct, Add_Find' (ct, pbl'))
1481 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, pbl'))
1482 val ((p,Pbl),c,_,pt') =
1483 generate1 thy tac_ Uistate (p,Pbl) pt
1484 in ([(tac,tac_,((p,Pbl),Uistate))], c, (pt',(p,Pbl))):calcstate' end
1487 (*TODO.WN03 pass error-msgs to the frontend..
1488 FIXME ..and dont abuse a tactic for that purpose*)
1490 Tac_ (theory "Pure", msg,msg,msg),
1491 (e_pos', e_istate))], [], ptp)
1494 (* val sel = "#Find"; val (p,_) = p; val Add_Find' ct = nxt;
1495 val (_,_,f,nxt',_,pt')= nxt_specif_additem sel ct (p,Met) c pt;
1497 | nxt_specif_additem sel ct (ptp as (pt,(p,Met))) =
1499 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1500 probl=pbl,spec=(dI,pI,mI),...}) = get_obj I pt p;
1501 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1502 val cmI = if mI = e_metID then mI' else mI;
1503 in case appl_add thy sel oris met ((#ppc o get_met) cmI) ct of
1504 Add itm (*..union old input *) =>
1505 let (* val Add itm = appl_add thy sel oris met (#ppc (get_met cmI)) ct;
1507 val met' = insert_ppc thy itm met;
1510 "#Given" => (Add_Given ct, Add_Given' (ct, met'))
1511 | "#Find" => (Add_Find ct, Add_Find' (ct, met'))
1512 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, met'))
1513 val ((p,Met),c,_,pt') =
1514 generate1 thy tac_ Uistate (p,Met) pt
1515 in ([(tac,tac_,((p,Met), Uistate))], c, (pt',(p,Met))) end
1517 | Err msg => ([(*tacis*)], [], ptp)
1518 (*nxt_me collects tacis until not hide; here just no progress*)
1522 val (msg,itm) = appl_add thy sel oris ppc ct;
1523 val (Cor(d,ts)) = #5 itm;
1528 fun ori2Coritm pbt ((i,v,f,d,ts):ori) =
1529 (i,v,true,f, Cor ((d,ts),(((snd o snd o the o (find_first (eq1 d))) pbt)
1530 handle _ => raise error ("ori2Coritm: dsc "^
1532 "in ori, but not in pbt")
1534 fun ori2Coritm (pbt:pat list) ((i,v,f,d,ts):ori) =
1535 ((i,v,true,f, Cor ((d,ts),((snd o snd o the o
1536 (find_first (eq1 d))) pbt,ts))):itm)
1537 handle _ => (*dsc in oris, but not in pbl pat list: keep this dsc*)
1538 ((i,v,true,f, Cor ((d,ts),(d,ts))):itm);
1541 (*filter out oris which have same description in itms*)
1542 fun filter_outs oris [] = oris
1543 | filter_outs oris (i::itms) =
1544 let val ors = filter_out ((curry op= ((d_in o #5) (i:itm))) o
1545 (#4:ori -> term)) oris;
1546 in filter_outs ors itms end;
1548 fun memI a b = member op = a b;
1549 (*filter oris which are in pbt, too*)
1550 fun filter_pbt oris pbt =
1551 let val dscs = map (fst o snd) pbt
1552 in filter ((memI dscs) o (#4: ori -> term)) oris end;
1554 (*.combine itms from pbl + met and complete them wrt. pbt.*)
1555 (*FIXXXME.WN031205 complete_metitms doesnt handle incorrect itms !*)
1557 fun x mem [] = false
1558 | x mem (y :: ys) = x = y orelse x mem ys;
1560 fun complete_metitms (oris:ori list) (pits:itm list) (mits:itm list) met =
1561 (* val met = (#ppc o get_met) ["DiffApp","max_by_calculus"];
1563 let val vat = max_vt pits;
1565 (filter ((curry (op mem) vat) o (#2:itm -> int list)) mits);
1566 val ors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris;
1567 val os = filter_outs ors itms;
1568 (*WN.12.03?: does _NOT_ add itms from met ?!*)
1569 in itms @ (map (ori2Coritm met) os) end
1574 (*.complete model and guard of a calc-head .*)
1576 fun x mem [] = false
1577 | x mem (y :: ys) = x = y orelse x mem ys;
1579 fun complete_mod_ (oris, mpc, ppc, probl) =
1580 let val pits = filter_out ((curry op= false) o (#3: itm -> bool)) probl
1581 val vat = if probl = [] then 1 else max_vt probl
1582 val pors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris
1583 val pors = filter_outs pors pits (*which are in pbl already*)
1584 val pors = (filter_pbt pors ppc) (*which are in pbt, too*)
1586 val pits = pits @ (map (ori2Coritm ppc) pors)
1587 val mits = complete_metitms oris pits [] mpc
1591 fun some_spec ((odI, opI, omI):spec) ((dI, pI, mI):spec) =
1592 (if dI = e_domID then odI else dI,
1593 if pI = e_pblID then opI else pI,
1594 if mI = e_metID then omI else mI):spec;
1597 (*.find a next applicable tac (for calcstate) and update ptree
1598 (for ev. finding several more tacs due to hide).*)
1599 (*FIXXXME: unify ... fun nxt_specif = nxt_spec + applicable_in + specify !!*)
1600 (*WN.24.10.03 ~~~~~~~~~~~~~~ -> tac -> tac_ -> -"- as arg*)
1601 (*WN.24.10.03 fun nxt_solv = ...................................??*)
1602 fun nxt_specif (tac as Model_Problem) (pt, pos as (p,p_)) =
1604 val (PblObj{origin=(oris,ospec,_),probl,spec,...}) = get_obj I pt p
1605 val (dI,pI,mI) = some_spec ospec spec
1606 val thy = assoc_thy dI
1607 val mpc = (#ppc o get_met) mI (*just for reuse complete_mod_*)
1608 val {cas,ppc,...} = get_pbt pI
1609 val pbl = init_pbl ppc (*fill in descriptions*)
1610 (*--------------if you think, this should be done by the Dialog
1611 in the java front-end, search there for WN060225-modelProblem----*)
1612 val (pbl,met) = case cas of NONE => (pbl,[])
1613 | _ => complete_mod_ (oris, mpc, ppc, probl)
1614 (*----------------------------------------------------------------*)
1615 val tac_ = Model_Problem' (pI, pbl, met)
1616 val (pos,c,_,pt) = generate1 thy tac_ Uistate pos pt
1617 in ([(tac,tac_, (pos, Uistate))], c, (pt,pos)):calcstate' end
1619 (* val Add_Find ct = tac;
1621 | nxt_specif (Add_Given ct) ptp = nxt_specif_additem "#Given" ct ptp
1622 | nxt_specif (Add_Find ct) ptp = nxt_specif_additem "#Find" ct ptp
1623 | nxt_specif (Add_Relation ct) ptp = nxt_specif_additem"#Relate" ct ptp
1625 (*. called only if no_met is specified .*)
1626 | nxt_specif (Refine_Tacitly pI) (ptp as (pt, pos as (p,_))) =
1627 let val (PblObj {origin = (oris, (dI,_,_),_), ...}) = get_obj I pt p
1628 val opt = refine_ori oris pI
1631 let val {met,ppc,...} = get_pbt pI'
1632 val pbl = init_pbl ppc
1633 (*val pt = update_pbl pt p pbl ..done by Model_Problem*)
1634 val mI = if length met = 0 then e_metID else hd met
1635 val thy = assoc_thy dI
1637 generate1 thy (Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]))
1639 in ([(Refine_Tacitly pI, Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]),
1640 (pos, Uistate))], c, (pt,pos)) end
1641 | NONE => ([], [], ptp)
1644 | nxt_specif (Refine_Problem pI) (ptp as (pt, pos as (p,_))) =
1645 let val (PblObj {origin=(_,(dI,_,_),_),spec=(dI',_,_),
1646 probl, ...}) = get_obj I pt p
1647 val thy = if dI' = e_domID then dI else dI'
1648 in case refine_pbl (assoc_thy thy) pI probl of
1649 NONE => ([], [], ptp)
1650 | SOME (rfd as (pI',_)) =>
1651 let val (pos,c,_,pt) =
1652 generate1 (assoc_thy thy)
1653 (Refine_Problem' rfd) Uistate pos pt
1654 in ([(Refine_Problem pI, Refine_Problem' rfd,
1655 (pos, Uistate))], c, (pt,pos)) end
1658 | nxt_specif (Specify_Problem pI) (pt, pos as (p,_)) =
1659 let val (PblObj {origin=(oris,(dI,_,_),_),spec=(dI',pI',_),
1660 probl, ...}) = get_obj I pt p;
1661 val thy = assoc_thy (if dI' = e_domID then dI else dI');
1662 val {ppc,where_,prls,...} = get_pbt pI
1663 val pbl as (_,(itms,_)) =
1664 if pI'=e_pblID andalso pI=e_pblID
1665 then (false, (init_pbl ppc, []))
1666 else match_itms_oris thy probl (ppc,where_,prls) oris(*FIXXXXXME?*)
1667 (*FIXXXME~~~~~~~~~~~~~~~: take pbl and compare with new pI WN.8.03*)
1668 val ((p,Pbl),c,_,pt)=
1669 generate1 thy (Specify_Problem' (pI, pbl)) Uistate pos pt
1670 in ([(Specify_Problem pI, Specify_Problem' (pI, pbl),
1671 (pos,Uistate))], c, (pt,pos)) end
1673 (*transfers oris (not required in pbl) to met-model for script-env
1674 FIXME.WN.8.03: application of several mIDs to SAME model?*)
1675 | nxt_specif (Specify_Method mID) (ptp as (pt, pos as (p,_))) =
1676 let val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1677 meth=met, ...}) = get_obj I pt p;
1678 val {ppc,pre,prls,...} = get_met mID
1679 val thy = assoc_thy dI
1680 val oris = add_field' thy ppc oris;
1681 val dI'' = if dI=e_domID then dI' else dI;
1682 val pI'' = if pI = e_pblID then pI' else pI;
1683 val met = if met=[] then pbl else met;(*WN0602 what if more itms in met?*)
1684 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1686 generate1 thy (Specify_Method' (mID, oris, itms)) Uistate pos pt
1687 in ([(Specify_Method mID, Specify_Method' (mID, oris, itms),
1688 (pos,Uistate))], c, (pt,pos)) end
1690 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Pbl)) =
1691 let val (dI',_,_) = get_obj g_spec pt p
1693 generate1 (assoc_thy "Isac.thy") (Specify_Theory' dI)
1695 in (*FIXXXME: check if pbl can still be parsed*)
1696 ([(Specify_Theory dI, Specify_Theory' dI, (pos,Uistate))], c,
1699 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Met)) =
1700 let val (dI',_,_) = get_obj g_spec pt p
1702 generate1 (assoc_thy "Isac.thy") (Specify_Theory' dI)
1704 in (*FIXXXME: check if met can still be parsed*)
1705 ([(Specify_Theory dI, Specify_Theory' dI, (pos,Uistate))], c,
1709 raise error ("nxt_specif: not impl. for "^tac2str m');
1711 (*.get the values from oris; handle the term list w.r.t. penv.*)
1714 fun x mem [] = false
1715 | x mem (y :: ys) = x = y orelse x mem ys;
1717 fun vals_of_oris oris =
1718 ((map (mkval' o (#5:ori -> term list))) o
1719 (filter ((curry (op mem) 1) o (#2:ori -> int list)))) oris
1724 (*.create a calc-tree with oris via an cas.refined pbl.*)
1725 fun nxt_specify_init_calc (([],(dI,pI,mI)): fmz) =
1726 (* val ([],(dI,pI,mI)) = (fmz, sp);
1728 if pI <> [] then (*comes from pbl-browser*)
1729 let val {cas,met,ppc,thy,...} = get_pbt pI
1730 val dI = if dI = "" then theory2theory' thy else dI
1731 val thy = assoc_thy dI
1732 val mI = if mI = [] then hd met else mI
1733 val hdl = case cas of NONE => pblterm dI pI | SOME t => t
1734 val (pt,_) = cappend_problem e_ptree [] e_istate ([], (dI,pI,mI))
1735 ([], (dI,pI,mI), hdl)
1736 val pt = update_spec pt [] (dI,pI,mI)
1737 val pits = init_pbl' ppc
1738 val pt = update_pbl pt [] pits
1739 in ((pt,([],Pbl)), []): calcstate end
1740 else if mI <> [] then (*comes from met-browser*)
1741 let val {ppc,...} = get_met mI
1742 val dI = if dI = "" then "Isac.thy" else dI
1743 val thy = assoc_thy dI
1744 val (pt,_) = cappend_problem e_ptree [] e_istate ([], (dI,pI,mI))
1745 ([], (dI,pI,mI), e_term(*FIXME met*))
1746 val pt = update_spec pt [] (dI,pI,mI)
1747 val mits = init_pbl' ppc
1748 val pt = update_met pt [] mits
1749 in ((pt,([],Met)), []) end
1750 else (*completely new example*)
1751 let val (pt,_) = cappend_problem e_ptree [] e_istate ([], e_spec)
1752 ([], e_spec, e_term)
1753 in ((pt,([],Pbl)), []) end
1754 (* val (fmz, (dI,pI,mI)) = (fmz, sp);
1756 | nxt_specify_init_calc (fmz:fmz_,(dI,pI,mI):spec) =
1757 let (* either """"""""""""""" all empty or complete *)
1758 val thy = assoc_thy dI
1759 val (pI, pors, mI) =
1761 then let val pors = prep_ori fmz thy ((#ppc o get_pbt) pI)
1762 val pI' = refine_ori' pors pI;
1763 in (pI', pors (*refinement over models with diff.prec only*),
1764 (hd o #met o get_pbt) pI') end
1765 else (pI, prep_ori fmz thy ((#ppc o get_pbt) pI), mI)
1766 val {cas,ppc,thy=thy',...} = get_pbt pI (*take dI from _refined_ pbl*)
1767 val dI = theory2theory' (maxthy thy thy');
1768 val hdl = case cas of
1769 NONE => pblterm dI pI
1770 | SOME t => subst_atomic ((vars_of_pbl_' ppc)
1771 ~~~ vals_of_oris pors) t
1772 val (pt,_) = cappend_problem e_ptree [] e_istate (fmz,(dI,pI,mI))
1773 (pors,(dI,pI,mI),hdl)
1774 (*val pbl = init_pbl ppc WN.9.03: done by Model/Refine_Problem
1775 val pt = update_pbl pt [] pbl*)
1776 in ((pt,([],Pbl)), fst3 (nxt_specif Model_Problem (pt, ([],Pbl))))
1782 fun get_spec_form (m:tac_) ((p,p_):pos') (pt:ptree) =
1783 (* case appl_spec p pt m of /// 19.1.00
1784 Notappl e => Error' (Error_ e)
1786 *) let val (_,_,f,_,_,_) = specify m (p,p_) [] pt
1790 (*fun tag_form thy (formal, given) = cterm_of thy
1791 (((head_of o term_of) given) $ (term_of formal)); WN100819*)
1792 fun tag_form thy (formal, given) =
1793 (let val gf = (head_of given) $ formal;
1794 val _ = cterm_of thy gf
1796 handle _ => raise error ("calchead.tag_form: " ^
1797 Syntax.string_of_term (thy2ctxt thy) given ^
1799 Syntax.string_of_term (thy2ctxt thy) formal ^
1800 " ..types do not match");
1801 (* val formal = (the o (parse thy)) "[R::real]";
1802 > val given = (the o (parse thy)) "fixed_values (cs::real list)";
1803 > tag_form thy (formal, given);
1804 val it = "fixed_values [R]" : cterm
1806 fun chktyp thy (n, fs, gs) =
1807 ((writeln o (Syntax.string_of_term (thy2ctxt thy)) o (nth n)) fs;
1808 (writeln o (Syntax.string_of_term (thy2ctxt thy)) o (nth n)) gs;
1809 tag_form thy (nth n fs, nth n gs));
1811 fun chktyps thy (fs, gs) = map (tag_form thy) (fs ~~ gs);
1813 (* #####################################################
1814 find the failing item:
1816 > val tag__form = chktyp (n,formals,givens);
1817 > (type_of o term_of o (nth n)) formals;
1818 > (type_of o term_of o (nth n)) givens;
1819 > atomty ((term_of o (nth n)) formals);
1820 > atomty ((term_of o (nth n)) givens);
1821 > atomty (term_of tag__form);
1822 > use_thy"isa-98-1-HOL-plus/knowl-base/DiffAppl";
1823 ##################################################### *)
1825 (* #####################################################
1827 val origin = ["sqrt(9+4*x)=sqrt x + sqrt(5+x)","x::rat","(+0)"];
1828 val formals = map (the o (parse thy)) origin;
1830 val given = ["equation (lhs=rhs)",
1831 "bound_variable bdv", (* TODO type *)
1833 val where_ = ["e is_root_equation_in bdv",
1835 "apx is_const_expr"];
1836 val find = ["L::rat set"];
1837 val with_ = ["L = {bdv. || ((%x. lhs) bdv) - ((%x. rhs) bdv) || < apx}"];
1838 val chkpbl = map (the o (parse thy)) (given @ where_ @ find @ with_);
1839 val givens = map (the o (parse thy)) given;
1841 val tag__forms = chktyps (formals, givens);
1842 map ((atomty) o term_of) tag__forms;
1843 ##################################################### *)
1846 (* check pbltypes, announces one failure a time *)
1847 (*fun chk_vars ctppc =
1848 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1849 appc flat (mappc (vars o term_of) ctppc)
1850 in if (wh\\gi) <> [] then ("wh\\gi",wh\\gi)
1851 else if (re\\(gi union fi)) <> []
1852 then ("re\\(gi union fi)",re\\(gi union fi))
1853 else ("ok",[]) end;*)
1854 fun chk_vars ctppc =
1855 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1856 appc flat (mappc vars ctppc)
1857 val chked = subtract op = gi wh
1858 in if chked <> [] then ("wh\\gi", chked)
1859 else let val chked = subtract op = (union op = gi fi) re
1861 then ("re\\(gi union fi)", chked)
1866 (* check a new pbltype: variables (Free) unbound by given, find*)
1867 fun unbound_ppc ctppc =
1868 let val {Given=gi,Find=fi,Relate=re,...} =
1869 appc flat (mappc vars ctppc)
1870 in distinct (*re\\(gi union fi)*)
1871 (subtract op = (union op = gi fi) re) end;
1873 > val org = {Given=["[R=(R::real)]"],Where=[],
1874 Find=["[A::real]"],With=[],
1875 Relate=["[A=#2*a*b - a^^^#2, (a//#2)^^^#2 + (b//#2)^^^#2 = R^^^#2]"]
1877 > val ctppc = mappc (the o (parse thy)) org;
1878 > unbound_ppc ctppc;
1879 val it = [("a","RealDef.real"),("b","RealDef.real")] : (string * typ) list
1883 (* f, a binary operator, is nested rightassociative *)
1886 fun fld f (x::[]) = x
1887 | fld f (x::x'::[]) = f (x',x)
1888 | fld f (x::x'::xs) = f (fld f (x'::xs),x);
1889 in ((fld f) o rev) xs end;
1891 > val (SOME ct) = parse thy "[a=b,c=d,e=f]";
1892 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1893 > val conj = foldr1 HOLogic.mk_conj (isalist2list (term_of ct));
1894 > cterm_of thy conj;
1895 val it = "(a = b & c = d) & e = f" : cterm
1898 (* f, a binary operator, is nested leftassociative *)
1899 fun foldl1 f (x::[]) = x
1900 | foldl1 f (x::x'::[]) = f (x,x')
1901 | foldl1 f (x::x'::xs) = f (x,foldl1 f (x'::xs));
1903 > val (SOME ct) = parse thy "[a=b,c=d,e=f,g=h]";
1904 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1905 > val conj = foldl1 HOLogic.mk_conj (isalist2list (term_of ct));
1906 > cterm_of thy conj;
1907 val it = "a = b & c = d & e = f & g = h" : cterm
1911 (* called only once, if a Subproblem has been located in the script*)
1912 fun nxt_model_pbl (Subproblem'((_,pblID,metID),_,_,_,_)) ptp =
1913 (* val (Subproblem'((_,pblID,metID),_,_,_,_),ptp) = (m', (pt,(p,p_)));
1917 (snd3 o hd o fst3) (nxt_specif (Refine_Tacitly pblID) ptp)
1918 | _ => (snd3 o hd o fst3) (nxt_specif Model_Problem ptp))
1919 (*all stored in tac_ itms ^^^^^^^^^^*)
1920 | nxt_model_pbl tac_ _ =
1921 raise error ("nxt_model_pbl: called by tac= "^tac_2str tac_);
1922 (* run subp_rooteq.sml ''
1923 until nxt=("Subproblem",Subproblem ("SqRoot.thy",["univariate","equation"]))
1924 > val (_, (Subproblem'((_,pblID,metID),_,_,_,_),_,_,_,_,_)) =
1925 (last_elem o drop_last) ets'';
1926 > val mst = (last_elem o drop_last) ets'';
1927 > nxt_model_pbl mst;
1928 val it = Refine_Tacitly ["univariate","equation"] : tac
1931 (*fun eq1 d (_,(d',_)) = (d = d'); ---modspec.sml*)
1932 fun eq4 v (_,vts,_,_,_) = member op = vts v;
1933 fun eq5 (_,_,_,_,itm_) (_,_,_,d,_) = d_in itm_ = d;
1938 writeln (oris2str pors);
1940 writeln (itms2str_ thy pits);
1941 writeln (itms2str_ thy mits);
1945 (*.complete _NON_empty calc-head for autocalc (sub-)pbl from oris
1946 + met from fmz; assumes pos on PblObj, meth = [].*)
1947 fun complete_mod (pt, pos as (p, p_):pos') =
1948 (* val (pt, (p, _)) = (pt, p);
1949 val (pt, (p, _)) = (pt, pos);
1951 let val _= if p_ <> Pbl
1952 then writeln("###complete_mod: only impl.for Pbl, called with "^
1953 pos'2str pos) else ()
1954 val (PblObj{origin=(oris, ospec, hdl), probl, spec,...}) =
1956 val (dI,pI,mI) = some_spec ospec spec
1957 val mpc = (#ppc o get_met) mI
1958 val ppc = (#ppc o get_pbt) pI
1959 val (pits, mits) = complete_mod_ (oris, mpc, ppc, probl)
1960 val pt = update_pblppc pt p pits
1961 val pt = update_metppc pt p mits
1962 in (pt, (p,Met):pos') end
1964 (*| complete_mod (pt, pos as (p, Met):pos') =
1965 raise error ("###complete_mod: only impl.for Pbl, called with "^
1968 (*.complete _EMPTY_ calc-head for autocalc (sub-)pbl from oris(+met from fmz);
1969 oris and spec (incl. pbl-refinement) given from init_calc or SubProblem .*)
1970 fun all_modspec (pt, (p,_):pos') =
1971 (* val (pt, (p,_)) = ptp;
1973 let val (PblObj{fmz=(fmz_,_), origin=(pors, spec as (dI,pI,mI), hdl),
1974 ...}) = get_obj I pt p;
1975 val thy = assoc_thy dI;
1976 val {ppc,...} = get_met mI;
1977 val mors = prep_ori fmz_ thy ppc;
1978 val pt = update_pblppc pt p (map (ori2Coritm ppc) pors);
1979 val pt = update_metppc pt p (map (ori2Coritm ppc) mors);
1980 val pt = update_spec pt p (dI,pI,mI);
1981 in (pt, (p,Met): pos') end;
1983 (*WN.12.03: use in nxt_spec, too ? what about variants ???*)
1984 fun is_complete_mod_ ([]: itm list) = false
1985 | is_complete_mod_ itms =
1986 foldl and_ (true, (map #3 itms));
1987 fun is_complete_mod (pt, pos as (p, Pbl): pos') =
1988 if (is_pblobj o (get_obj I pt)) p
1989 then (is_complete_mod_ o (get_obj g_pbl pt)) p
1990 else raise error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1991 | is_complete_mod (pt, pos as (p, Met)) =
1992 if (is_pblobj o (get_obj I pt)) p
1993 then (is_complete_mod_ o (get_obj g_met pt)) p
1994 else raise error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1995 | is_complete_mod (_, pos) =
1996 raise error ("is_complete_mod called by "^pos'2str pos^
1997 " (should be Pbl or Met)");
1999 (*.have (thy, pbl, met) _all_ been specified explicitly ?.*)
2000 fun is_complete_spec (pt, pos as (p,_): pos') =
2001 if (not o is_pblobj o (get_obj I pt)) p
2002 then raise error ("is_complete_spec: called by PrfObj at "^pos'2str pos)
2003 else let val (dI,pI,mI) = get_obj g_spec pt p
2004 in dI<>e_domID andalso pI<>e_pblID andalso mI<>e_metID end;
2005 (*.complete empty items in specification from origin (pbl, met ev.refined);
2006 assumes 'is_complete_mod'.*)
2007 fun complete_spec (pt, pos as (p,_): pos') =
2008 let val PblObj {origin = (_,ospec,_), spec,...} = get_obj I pt p
2009 val pt = update_spec pt p (some_spec ospec spec)
2012 fun is_complete_modspec ptp =
2013 is_complete_mod ptp andalso is_complete_spec ptp;
2018 fun pt_model (PblObj {meth,spec,origin=(_,spec',hdl),...}) Met =
2019 (* val ((PblObj {meth,spec,origin=(_,spec',hdl),...}), Met) = (ppobj, p_);
2021 let val (_,_,metID) = get_somespec' spec spec'
2023 if metID = e_metID then []
2024 else let val {prls,pre=where_,...} = get_met metID
2025 val pre = check_preconds' prls where_ meth 0
2027 val allcorrect = is_complete_mod_ meth
2028 andalso foldl and_ (true, (map #1 pre))
2029 in ModSpec (allcorrect, Met, hdl, meth, pre, spec) end
2030 | pt_model (PblObj {probl,spec,origin=(_,spec',hdl),...}) _(*Frm,Pbl*) =
2031 (* val ((PblObj {probl,spec,origin=(_,spec',hdl),...}),_) = (ppobj, p_);
2033 let val (_,pI,_) = get_somespec' spec spec'
2035 if pI = e_pblID then []
2036 else let val {prls,where_,cas,...} = get_pbt pI
2037 val pre = check_preconds' prls where_ probl 0
2039 val allcorrect = is_complete_mod_ probl
2040 andalso foldl and_ (true, (map #1 pre))
2041 in ModSpec (allcorrect, Pbl, hdl, probl, pre, spec) end;
2044 fun pt_form (PrfObj {form,...}) = Form form
2045 | pt_form (PblObj {probl,spec,origin=(_,spec',_),...}) =
2046 let val (dI, pI, _) = get_somespec' spec spec'
2047 val {cas,...} = get_pbt pI
2049 NONE => Form (pblterm dI pI)
2050 | SOME t => Form (subst_atomic (mk_env probl) t)
2052 (*vvv takes the tac _generating_ the formula=result, asm ok....
2053 fun pt_result (PrfObj {result=(t,asm), tac,...}) =
2055 if null asm then NONE else SOME asm,
2057 | pt_result (PblObj {result=(t,asm), origin = (_,ospec,_), spec,...}) =
2058 let val (_,_,metID) = some_spec ospec spec
2060 if null asm then NONE else SOME asm,
2061 if metID = e_metID then NONE else SOME (Apply_Method metID)) end;
2062 -------------------------------------------------------------------------*)
2065 (*.pt_extract returns
2066 # the formula at pos
2067 # the tactic applied to this formula
2068 # the list of assumptions generated at this formula
2069 (by application of another tac to the preceding formula !)
2070 pos is assumed to come from the frontend, ie. generated by moveDown.*)
2071 (*cannot be in ctree.sml, because ModSpec has to be calculated*)
2072 fun pt_extract (pt,([],Res)) =
2073 (* val (pt,([],Res)) = ptp;
2075 let val (f, asm) = get_obj g_result pt []
2076 in (Form f, NONE, asm) end
2079 | pt_extract (pt,(p,Res)) =
2080 (* val (pt,(p,Res)) = ptp;
2082 let val (f, asm) = get_obj g_result pt p
2083 val tac = if last_onlev pt p
2084 then if is_pblobj' pt (lev_up p)
2085 then let val (PblObj{spec=(_,pI,_),...}) =
2086 get_obj I pt (lev_up p)
2087 in if pI = e_pblID then NONE
2088 else SOME (Check_Postcond pI) end
2089 else SOME End_Trans (*WN0502 TODO for other branches*)
2090 else let val p' = lev_on p
2091 in if is_pblobj' pt p'
2092 then let val (PblObj{origin = (_,(dI,pI,_),_),...}) =
2094 in SOME (Subproblem (dI, pI)) end
2095 else if f = get_obj g_form pt p'
2096 then SOME (get_obj g_tac pt p')
2097 (*because this Frm ~~~is not on worksheet*)
2098 else SOME (Take (term2str (get_obj g_form pt p')))
2100 in (Form f, tac, asm) end
2102 | pt_extract (pt, pos as (p,p_(*Frm,Pbl*))) =
2103 (* val (pt, pos as (p,p_(*Frm,Pbl*))) = ptp;
2104 val (pt, pos as (p,p_(*Frm,Pbl*))) = (pt, p);
2106 let val ppobj = get_obj I pt p
2107 val f = if is_pblobj ppobj then pt_model ppobj p_
2108 else get_obj pt_form pt p
2109 val tac = g_tac ppobj
2110 in (f, SOME tac, []) end;
2113 (**. get the formula from a ctree-node:
2114 take form+res from PblObj and 1.PrfObj and (PrfObj after PblObj)
2115 take res from all other PrfObj's .**)
2116 (*designed for interSteps, outcommented 04 in favour of calcChangedEvent*)
2117 fun formres p (Nd (PblObj {origin = (_,_, h), result = (r, _),...}, _)) =
2118 [("headline", (p, Frm), h),
2119 ("stepform", (p, Res), r)]
2120 | formres p (Nd (PrfObj {form, result = (r, _),...}, _)) =
2121 [("stepform", (p, Frm), form),
2122 ("stepform", (p, Res), r)];
2124 fun form p (Nd (PrfObj {result = (r, _),...}, _)) =
2125 [("stepform", (p, Res), r)]
2127 (*assumes to take whole level, in particular hd -- for use in interSteps*)
2128 fun get_formress fs p [] = flat fs
2129 | get_formress fs p (nd::nds) =
2130 (* start with 'form+res' and continue with trying 'res' only*)
2131 get_forms (fs @ [formres p nd]) (lev_on p) nds
2132 and get_forms fs p [] = flat fs
2133 | get_forms fs p (nd::nds) =
2135 (* start again with 'form+res' ///ugly repeat with Check_elementwise
2136 then get_formress (fs @ [formres p nd]) (lev_on p) nds *)
2137 then get_forms (fs @ [formres p nd]) (lev_on p) nds
2138 (* continue with trying 'res' only*)
2139 else get_forms (fs @ [form p nd]) (lev_on p) nds;
2141 (**.get an 'interval' 'from' 'to' of formulae from a ptree.**)
2142 (*WN050219 made robust against _'to' below or after Complete nodes
2143 by handling exn caused by move_dn*)
2144 (*WN0401 this functionality belongs to ctree.sml,
2145 but fetching a calc_head requires calculations defined in modspec.sml
2146 transfer to ME/me.sml !!!
2147 WN051224 ^^^ doesnt hold any longer, since only the headline of a calc_head
2148 is returned !!!!!!!!!!!!!
2150 fun eq_pos' (p1,Frm) (p2,Frm) = p1 = p2
2151 | eq_pos' (p1,Res) (p2,Res) = p1 = p2
2152 | eq_pos' (p1,Pbl) (p2,p2_) = p1 = p2 andalso (case p2_ of
2156 | eq_pos' (p1,Met) (p2,p2_) = p1 = p2 andalso (case p2_ of
2160 | eq_pos' _ _ = false;
2162 (*.get an 'interval' from the ctree; 'interval' is w.r.t. the
2163 total ordering Position#compareTo(Position p) in the java-code
2164 val get_interval = fn
2165 : pos' -> : from is "move_up 1st-element" to return
2166 pos' -> : to the last element to be returned; from < to
2167 int -> : level: 0 gets the flattest sub-tree possible
2168 >999 gets the deepest sub-tree possible
2170 (pos' * : of the formula
2171 Term.term) : the formula
2174 fun get_interval from to level pt =
2175 (* val (from,level) = (f,lev);
2176 val (from, to, level) = (([3, 2, 1], Res), ([],Res), 9999);
2178 let fun get_inter c (from:pos') (to:pos') lev pt =
2179 (* val (c, from, to, lev) = ([], from, to, level);
2180 ------for recursion.......
2181 val (c, from:pos', to:pos') = (c @ [(from, f)], move_dn [] pt from, to);
2183 if eq_pos' from to orelse from = ([],Res)
2184 (*orelse ... avoids Exception- PTREE "end of calculation" raised,
2185 if 'to' has values NOT generated by move_dn, see systest/me.sml
2186 TODO.WN0501: introduce an order on pos' and check "from > to"..
2187 ...there is an order in Java!
2188 WN051224 the hack got worse with returning term instead ptform*)
2189 then let val (f,_,_) = pt_extract (pt, from)
2191 ModSpec (_,_,headline,_,_,_) => c @ [(from, headline)]
2192 | Form t => c @ [(from, t)]
2195 if lev < lev_of from
2196 then (get_inter c (move_dn [] pt from) to lev pt)
2197 handle (PTREE _(*from move_dn too far*)) => c
2198 else let val (f,_,_) = pt_extract (pt, from)
2199 val term = case f of
2200 ModSpec (_,_,headline,_,_,_)=> headline
2202 in (get_inter (c @ [(from, term)])
2203 (move_dn [] pt from) to lev pt)
2204 handle (PTREE _(*from move_dn too far*))
2205 => c @ [(from, term)] end
2206 in get_inter [] from to level pt end;
2209 fun posform2str (pos:pos', form) =
2210 "("^ pos'2str pos ^", "^
2212 Form f => term2str f
2213 | ModSpec c => term2str (#3 c(*the headline*)))
2215 fun posforms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
2216 (map posform2str)) pfs;
2217 fun posterm2str (pos:pos', t) =
2218 "("^ pos'2str pos ^", "^term2str t^")";
2219 fun posterms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
2220 (map posterm2str)) pfs;
2223 (*WN050225 omits the last step, if pt is incomplete*)
2225 writeln (posterms2str (get_interval ([],Frm) ([],Res) 99999 pt));
2227 (*.get a calchead from a PblObj-node in the ctree;
2228 preconditions must be calculated.*)
2229 fun get_ocalhd (pt, pos' as (p,Pbl):pos') =
2230 let val PblObj {origin = (oris, ospec, hdf'), spec, probl,...} =
2232 val {prls,where_,...} = get_pbt (#2 (some_spec ospec spec))
2233 val pre = check_preconds (assoc_thy"Isac.thy") prls where_ probl
2234 in (ocalhd_complete probl pre spec, Pbl, hdf', probl, pre, spec):ocalhd end
2235 | get_ocalhd (pt, pos' as (p,Met):pos') =
2236 let val PblObj {fmz = fmz as (fmz_,_), origin = (oris, ospec, hdf'),
2239 val {prls,pre,...} = get_met (#3 (some_spec ospec spec))
2240 val pre = check_preconds (assoc_thy"Isac.thy") prls pre meth
2241 in (ocalhd_complete meth pre spec, Met, hdf', meth, pre, spec):ocalhd end;
2243 (*.at the activeFormula set the Model, the Guard and the Specification
2244 to empty and return a CalcHead;
2245 the 'origin' remains (for reconstructing all that).*)
2246 fun reset_calchead (pt, pos' as (p,_):pos') =
2247 let val PblObj {origin = (_, _, hdf'),...} = get_obj I pt p
2248 val pt = update_pbl pt p []
2249 val pt = update_met pt p []
2250 val pt = update_spec pt p e_spec
2251 in (pt, (p,Pbl):pos') end;
2253 (*---------------------------------------------------------------------*)
2257 (*---------------------------------------------------------------------*)