intermed. ctxt ..: x+1=2 now goes until Check_elementwise
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 fun is_known ctxt sel ori t =
728 val _ = tracing ("RM is_known: t=" ^ term2str t);
729 val ots = (distinct o flat o (map #5)) (ori:ori list);
730 val oids = ((map (fst o dest_Free)) o distinct o
731 flat o (map vars)) ots;
732 val (d, ts) = split_dts t;
733 val ids = map (fst o dest_Free)
734 ((distinct o (flat o (map vars))) ts);
735 in if (subtract op = oids ids) <> []
736 then (("identifiers "^(strs2str' (subtract op = oids ids)) ^
737 " not in example"), e_ori_, [])
741 if not (subset op = (map typeless ts, map typeless ots))
742 then (("terms '" ^ ((strs2str' o
743 (map (Print_Mode.setmp [] (Syntax.string_of_term ctxt)))) ts) ^
744 "' not in example (typeless)"), e_ori_, [])
746 (case seek_orits ctxt sel ts ori of
747 ("", ori_ as (_,_,_,d,ts), all) =>
748 (case test_types ctxt (d,ts) of
749 "" => ("", ori_, all)
750 | msg => (msg, e_ori_, []))
751 | (msg,_,_) => (msg, e_ori_, []))
753 if member op = (map #4 ori) d
754 then seek_oridts ctxt sel (d,ts) ori
755 else ((Print_Mode.setmp [] (Syntax.string_of_term ctxt) d) ^
756 " not in example", (0, [], sel, d, ts), [])
760 (*. for return-value of appl_add .*)
763 | Err of string; (*error-message*)
766 (** add an item to the model; check wrt. oris and pbt **)
767 (* in contrary to oris<>[] below, this part handles user-input
768 extremely acceptive, i.e. accept input instead error-msg *)
769 fun appl_add ctxt sel [] ppc pbt ct =
771 val i = 1 + (if ppc = [] then 0 else map #1 ppc |> maxl);
773 case parseNEW ctxt ct of
774 NONE => Add (i, [], false, sel, Syn ct)
776 let val (d, ts) = split_dts t;
779 then Add (i, [], false, sel, Mis (dsc_unknown, hd ts))
781 (case find_first (eq1 d) pbt of
782 NONE => Add (i, [], true, sel, Sup (d,ts))
783 | SOME (f, (_, id)) =>
784 let fun eq2 d (i, _, _, _, itm_) =
785 d = (d_in itm_) andalso i <> 0;
786 in case find_first (eq2 d) ppc of
787 NONE => Add (i, [], true, f,Cor ((d, ts), (id, pbl_ids' d ts)))
788 | SOME (i', _, _, _, itm_) =>
792 val in_itm = ts_in itm_;
793 val ts' = union op = ts in_itm;
794 val i'' = if in_itm = [] then i else i';
795 in Add (i'', [], true, f, Cor ((d, ts'), (id, pbl_ids' d ts'))) end
796 else Add (i', [], true, f, Cor ((d, ts),(id, pbl_ids' d ts)))
800 | appl_add ctxt sel oris ppc pbt str =
801 case parseNEW ctxt str of
802 NONE => Err ("appl_add: syntax error in '" ^ str ^ "'")
804 case is_known ctxt sel oris t of
806 (case is_notyet_input ctxt ppc all ori' pbt of
808 | (msg, _) => Err ("[error] appl_add: is_notyet_input: " ^ msg))
809 | (msg, _, _) => Err ("[error] appl_add: is_known: " ^ msg);
812 (** make oris from args of the stac SubProblem and from pbt **)
813 (* can this formal argument (of a model-pattern) be omitted in the arg-list
814 of a SubProblem ? see ME/ptyps.sml 'type met ' *)
815 fun is_copy_named_idstr str =
816 case (rev o Symbol.explode) str of
817 "'":: _ ::"'"::_ => (tracing ((strs2str o (rev o Symbol.explode))
818 "is_copy_named_idstr: " ^ str ^ " T"); true)
819 | _ => (tracing ((strs2str o (rev o Symbol.explode))
820 "is_copy_named_idstr: " ^ str ^ " F"); false);
821 fun is_copy_named (_, (_, t)) = (is_copy_named_idstr o free2str) t;
823 (*.should this formal argument (of a model-pattern) create a new identifier?.*)
824 fun is_copy_named_generating_idstr str =
825 if is_copy_named_idstr str
826 then case (rev o Symbol.explode) str of
827 "'"::"'"::"'"::_ => false
830 fun is_copy_named_generating (_, (_, t)) =
831 (is_copy_named_generating_idstr o free2str) t;
833 (*.split type-wrapper from scr-arg and build part of an ori;
834 an type-error is reported immediately, raises an exn,
835 subsequent handling of exn provides 2nd part of error message.*)
836 fun mtc thy ((str, (dsc, _)):pat) (ty $ var) =
837 (* val (thy, (str, (dsc, _)), (ty $ var)) =
840 (cterm_of thy (dsc $ var);(*type check*)
841 SOME ((([1], str, dsc, (*[var]*)
842 split_dts' (dsc, var))): preori)(*:ori without leading #*))
843 handle e as TYPE _ =>
844 (tracing (dashs 70 ^ "\n"
845 ^"*** ERROR while creating the items for the model of the ->problem\n"
846 ^"*** from the ->stac with ->typeconstructor in arglist:\n"
847 ^"*** item (->description ->value): "^term2str dsc^" "^term2str var^"\n"
848 ^"*** description: "^(term_detail2str dsc)
849 ^"*** value: "^(term_detail2str var)
850 ^"*** typeconstructor in script: "^(term_detail2str ty)
851 ^"*** checked by theory: "^(theory2str thy)^"\n"
853 (*OldGoals.print_exn e; raises exn again*)
854 writeln (PolyML.makestring e);
856 (*raise ERROR "actual args do not match formal args";FIXXXME.WN100916*)
859 (*.match each pat of the model-pattern with an actual argument;
860 precondition: copy-named vars are filtered out.*)
861 fun matc thy ([]:pat list) _ (oris:preori list) = oris
862 | matc thy pbt [] _ =
864 error ("actual arg(s) missing for '"^pats2str pbt
865 ^"' i.e. should be 'copy-named' by '*_._'"))
866 | matc thy ((p as (s,(d,t)))::pbt) (a::ags) oris =
867 (* val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
868 (thy, pbt', ags, []);
870 val (thy, ((p as (s,(d,t)))::pbt), (a::ags), oris) =
871 (thy, pbt, ags, (oris @ [ori]));
873 (*del?..*)if (is_copy_named_idstr o free2str) t then oris
874 else(*..del?*) let val opt = mtc thy p a;
876 (* val SOME ori = mtc thy p a;
878 SOME ori => matc thy pbt ags (oris @ [ori])
879 | NONE => [](*WN050903 skipped by exn handled in match_ags*)
881 (* run subp-rooteq.sml until Init_Proof before ...
882 > val Nd (PblObj {origin=(oris,_,_),...},_) = pt;(*from test/subp-rooteq.sml*)
883 > fun xxxfortest (_,a,b,c,d) = (a,b,c,d);val oris = map xxxfortest oris;
885 other vars as in mtc ..
886 > matc thy (drop_last pbt) ags [];
887 val it = ([[1],"#Given",Const #,[#]),(0,[#],"#Given",Const #,[#])],2)*)
890 (* generate a new variable "x_i" name from a related given one "x"
891 by use of oris relating "v_i_" (is_copy_named!) to "v_"
892 e.g. (v_, x) & (v_i_, ?) --> (v_i_, x_i) *)
894 (* generate a new variable "x_i" name from a related given one "x"
895 by use of oris relating "v_v'i'" (is_copy_named!) to "v_v"
896 e.g. (v_v, x) & (v_v'i', ?) --> (v_v'i', x_i),
897 but leave is_copy_named_generating as is, e.t. ss''' *)
898 fun cpy_nam (pbt:pat list) (oris:preori list) (p as (field,(dsc,t)):pat) =
899 (if is_copy_named_generating p
900 then (*WN051014 kept strange old code ...*)
901 let fun sel (_,_,d,ts) = comp_ts (d, ts)
902 val cy' = (implode o (drop_last_n 3) o Symbol.explode o free2str) t
903 val ext = (last_elem o drop_last o Symbol.explode o free2str) t
904 val vars' = map (free2str o snd o snd) pbt (*cpy-nam filtered_out*)
905 val vals = map sel oris
906 val cy_ext = (free2str o the) (assoc (vars'~~vals, cy'))^"_"^ext
907 in ([1], field, dsc, [mk_free (type_of t) cy_ext]):preori end
908 else ([1], field, dsc, [t])
910 handle _ => error ("cpy_nam: for "^(term2str t));
912 (*.match the actual arguments of a SubProblem with a model-pattern
913 and create an ori list (in root-pbl created from formalization).
914 expects ags:pats = 1:1, while copy-named are filtered out of pats;
915 if no 1:1 the exn raised by matc/mtc and handled at call.
916 copy-named pats are appended in order to get them into the model-items.*)
917 fun match_ags thy (pbt:pat list) ags =
918 let fun flattup (i,(var,bool,str,itm_)) = (i,var,bool,str,itm_);
919 val pbt' = filter_out is_copy_named pbt;
920 val cy = filter is_copy_named pbt;
921 val oris' = matc thy pbt' ags [];
922 val cy' = map (cpy_nam pbt' oris') cy;
923 val ors = add_id (oris' @ cy');
924 (*appended in order to get ^^^^^ into the model-items*)
925 in (map flattup ors):ori list end;
927 (*.report part of the error-msg which is not available in match_args.*)
928 fun match_ags_msg pI stac ags =
929 let (*val s = !show_types
930 val _ = show_types:= true*)
931 val pats = (#ppc o get_pbt) pI
932 val msg = (dots 70^"\n"
933 ^"*** problem "^strs2str pI^" has the ...\n"
934 ^"*** model-pattern "^pats2str pats^"\n"
935 ^"*** stac '"^term2str stac^"' has the ...\n"
936 ^"*** arg-list "^terms2str ags^"\n"
938 (*WN100921 ^^^^ expect TYPE errormsg below; lost with Isa09*)
939 (*val _ = show_types:= s*)
943 (*get the variables out of a pbl_; FIXME.WN.0311: is_copy_named ...obscure!!!*)
944 fun vars_of_pbl_ pbl_ =
945 let fun var_of_pbl_ (gfr,(dsc,t)) = t
946 in ((map var_of_pbl_) o (filter_out is_copy_named)) pbl_ end;
947 fun vars_of_pbl_' pbl_ =
948 let fun var_of_pbl_ (gfr,(dsc,t)) = t:term
949 in ((map var_of_pbl_)(* o (filter_out is_copy_named)*)) pbl_ end;
951 fun overwrite_ppc thy itm ppc =
953 fun repl ppc' (_,_,_,_,itm_) [] =
954 error ("overwrite_ppc: " ^ (itm_2str_ (thy2ctxt thy) itm_) ^
956 | repl ppc' itm (p::ppc) =
957 if (#1 itm) = (#1 (p:itm)) then ppc' @ [itm] @ ppc
958 else repl (ppc' @ [p]) itm ppc
959 in repl [] itm ppc end;
961 (*10.3.00: insert the already compiled itm into model;
962 ev. filter_out untouched (in FE: (0,...)) item related to insert-item *)
965 fun insert_ppc thy itm ppc =
967 fun eq_untouched d ((0,_,_,_,itm_):itm) = (d = d_in itm_)
968 | eq_untouched _ _ = false;
971 (*tracing("### insert_ppc: itm= "^(itm2str_ itm));*)
972 case seek_ppc (#1 itm) ppc of
973 (* val SOME xxx = seek_ppc (#1 itm) ppc;
975 SOME _ => (*itm updated in is_notyet_input WN.11.03*)
976 overwrite_ppc thy itm ppc
977 | NONE => (ppc @ [itm]));
978 in filter_out (eq_untouched ((d_in o #5) itm)) ppc' end;
980 (*from Isabelle/src/Pure/library.ML, _appends_ a new element*)
981 fun gen_ins' eq (x, xs) = if gen_mem eq (x, xs) then xs else xs @ [x];
983 fun eq_dsc ((_,_,_,_,itm_):itm, (_,_,_,_,iitm_):itm) =
984 (d_in itm_) = (d_in iitm_);
985 (*insert_ppc = insert_ppc' for appl_add', input_icalhd 11.03,
986 handles superfluous items carelessly*)
987 fun insert_ppc' itm itms = gen_ins' eq_dsc (itm, itms);
989 > gen_ins' eee (4,[1,3,5,7]);
990 val it = [1, 3, 5, 7, 4] : int list*)
993 (*. output the headline to a ppc .*)
994 fun header p_ pI mI =
995 case p_ of Pbl => Problem (if pI = e_pblID then [] else pI)
997 | pos => error ("header called with "^ pos_2str pos);
1000 fun specify_additem sel (ct,_) (p,Met) c pt =
1002 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1003 probl=pbl,spec=(dI,pI,mI), ctxt, ...}) = get_obj I pt p;
1004 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1005 (*val ppt = if pI = e_pblID then get_pbt pI' else get_pbt pI;*)
1006 val cpI = if pI = e_pblID then pI' else pI;
1007 val cmI = if mI = e_metID then mI' else mI;
1008 val {ppc,pre,prls,...} = get_met cmI;
1009 in case appl_add ctxt sel oris met ppc ct of
1010 Add itm (*..union old input *) =>
1011 let (* val Add itm = appl_add thy sel oris met (#ppc (get_met cmI)) ct;
1013 val met' = insert_ppc thy itm met;
1014 (*val pt' = update_met pt p met';*)
1015 val ((p,Met),_,_,pt') =
1016 generate1 thy (case sel of
1017 "#Given" => Add_Given' (ct, met')
1018 | "#Find" => Add_Find' (ct, met')
1019 | "#Relate"=> Add_Relation'(ct, met'))
1020 (Uistate, e_ctxt) (p,Met) pt
1021 val pre' = check_preconds thy prls pre met'
1022 val pb = foldl and_ (true, map fst pre')
1023 (*val _=tracing("@@@ specify_additem: Met Add before nxt_spec")*)
1025 nxt_spec Met pb oris (dI',pI',mI') (pbl,met')
1026 ((#ppc o get_pbt) cpI,ppc) (dI,pI,mI);
1027 in ((p,p_), ((p,p_),Uistate),
1028 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1029 (Method cmI, itms2itemppc thy met' pre'))),
1032 let val pre' = check_preconds thy prls pre met
1033 val pb = foldl and_ (true, map fst pre')
1034 (*val _=tracing("@@@ specify_additem: Met Err before nxt_spec")*)
1036 nxt_spec Met pb oris (dI',pI',mI') (pbl,met)
1037 ((#ppc o get_pbt) cpI,(#ppc o get_met) cmI) (dI,pI,mI);
1038 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1042 | specify_additem sel (ct,_) (pos as (p,_(*Frm, Pbl*))) c pt =
1044 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1045 probl=pbl,spec=(dI,pI,mI), ctxt, ...}) = get_obj I pt p;
1046 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1047 val cpI = if pI = e_pblID then pI' else pI;
1048 val cmI = if mI = e_metID then mI' else mI;
1049 val {ppc,where_,prls,...} = get_pbt cpI;
1050 in case appl_add ctxt sel oris pbl ppc ct of
1051 Add itm (*..union old input *) =>
1052 (* val Add itm = appl_add thy sel oris pbl ppc ct;
1055 (*val _= tracing("###specify_additem: itm= "^(itm2str_ itm));*)
1056 val pbl' = insert_ppc thy itm pbl
1057 val ((p,Pbl),_,_,pt') =
1058 generate1 thy (case sel of
1059 "#Given" => Add_Given' (ct, pbl')
1060 | "#Find" => Add_Find' (ct, pbl')
1061 | "#Relate"=> Add_Relation'(ct, pbl'))
1062 (Uistate, e_ctxt) (p,Pbl) pt
1063 val pre = check_preconds thy prls where_ pbl'
1064 val pb = foldl and_ (true, map fst pre)
1065 (*val _=tracing("@@@ specify_additem: Pbl Add before nxt_spec")*)
1067 nxt_spec Pbl pb oris (dI',pI',mI') (pbl',met)
1068 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1069 val ppc = if p_= Pbl then pbl' else met;
1070 in ((p,p_), ((p,p_),Uistate),
1071 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1073 itms2itemppc thy ppc pre))), nxt,Safe,pt') end
1076 let val pre = check_preconds thy prls where_ pbl
1077 val pb = foldl and_ (true, map fst pre)
1078 (*val _=tracing("@@@ specify_additem: Pbl Err before nxt_spec")*)
1080 nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1081 (ppc,(#ppc o get_met) cmI) (dI,pI,mI);
1082 in ((p,p_), ((p,p_),Uistate), Error' (Error_ msg), nxt, Safe,pt) end
1085 fun specify (Init_Proof' (fmz,(dI',pI',mI'))) (_:pos') (_:cid) (_:ptree)=
1086 let (* either """"""""""""""" all empty or complete *)
1087 val thy = assoc_thy dI';
1089 if dI' = e_domID orelse pI' = e_pblID
1091 else pI' |> #ppc o get_pbt |> prep_ori fmz thy
1092 val (pt,c) = cappend_problem e_ptree [] (e_istate, ctxt) (fmz,(dI',pI',mI'))
1093 (oris, (dI',pI',mI'),e_term)
1094 val pt = update_ctxt pt [] ctxt (*FIXME.WN110511*)
1095 val {ppc, prls, where_, ...} = get_pbt pI'
1096 val (pbl, pre, pb) = ([], [], false)
1100 (([], Pbl), (([], Pbl), Uistate),
1101 Form' (PpcKF (0, EdUndef, (length []), Nundef,
1102 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1103 Refine_Tacitly pI', Safe, pt)
1105 (([], Pbl), (([], Pbl), Uistate),
1106 Form' (PpcKF (0, EdUndef, (length []), Nundef,
1107 (Problem [], itms2itemppc (assoc_thy dI') pbl pre))),
1108 Model_Problem, Safe, pt)
1111 (*ONLY for STARTING modeling phase*)
1112 | specify (Model_Problem' (_,pbl,met)) (pos as (p,p_)) c pt =
1114 val (PblObj{origin=(oris,(dI',pI',mI'),_), spec=(dI,_,_), ...}) = get_obj I pt p
1115 val thy' = if dI = e_domID then dI' else dI
1116 val thy = assoc_thy thy'
1117 val {ppc,prls,where_,...} = get_pbt pI'
1118 val pre = check_preconds thy prls where_ pbl
1119 val pb = foldl and_ (true, map fst pre)
1120 val ((p,_),_,_,pt) = generate1 thy (Model_Problem'([],pbl,met)) (Uistate, e_ctxt) pos pt
1121 val (_,nxt) = nxt_spec Pbl pb oris (dI',pI',mI') (pbl,met)
1122 (ppc,(#ppc o get_met) mI') (dI',pI',mI');
1123 in ((p, Pbl), ((p, p_), Uistate),
1124 Form' (PpcKF (0, EdUndef, length p, Nundef,
1125 (Problem pI', itms2itemppc (assoc_thy dI') pbl pre))),
1129 (*. called only if no_met is specified .*)
1130 | specify (Refine_Tacitly' (pI,pIre,_,_,_)) (pos as (p,_)) c pt =
1132 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met, ...}) = get_obj I pt p;
1133 val {prls,met,ppc,thy,where_,...} = get_pbt pIre
1134 val (domID, metID) =
1135 (string_of_thy thy, if length met = 0 then e_metID else hd met)
1136 val ((p,_),_,_,pt) =
1137 generate1 thy (Refine_Tacitly'(pI,pIre,domID,metID,(*pbl*)[]))
1138 (Uistate, e_ctxt) pos pt
1139 val (pbl, pre, pb) = ([], [], false)
1140 in ((p, Pbl), (pos, Uistate),
1141 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1142 (Problem pIre, itms2itemppc (assoc_thy dI') pbl pre))),
1143 Model_Problem, Safe, pt)
1146 | specify (Refine_Problem' (rfd as (pI,_))) pos c pt =
1148 val (pos,_,_,pt) = generate1 (assoc_thy "Isac")
1149 (Refine_Problem' rfd) (Uistate, e_ctxt) pos pt
1150 in (pos(*p,Pbl*), (pos(*p,Pbl*),Uistate), Problems (RefinedKF rfd),
1151 Model_Problem, Safe, pt)
1154 | specify (Specify_Problem' (pI, (ok, (itms, pre)))) (pos as (p,_)) c pt =
1155 let val (PblObj {origin=(oris,(dI',pI',mI'),_), spec=(dI,_,mI),
1156 meth=met, ...}) = get_obj I pt p;
1157 val thy = assoc_thy dI
1158 val ((p,Pbl),_,_,pt)=
1159 generate1 thy (Specify_Problem' (pI, (ok, (itms, pre)))) (Uistate, e_ctxt) pos pt
1160 val dI'' = assoc_thy (if dI=e_domID then dI' else dI);
1161 val mI'' = if mI=e_metID then mI' else mI;
1162 (*val _=tracing("@@@ specify (Specify_Problem) before nxt_spec")*)
1163 val (_,nxt) = nxt_spec Pbl ok oris (dI',pI',mI') (itms, met)
1164 ((#ppc o get_pbt) pI,(#ppc o get_met) mI'') (dI,pI,mI);
1165 in ((p,Pbl), (pos,Uistate),
1166 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1167 (Problem pI, itms2itemppc dI'' itms pre))),
1169 (* val Specify_Method' mID = nxt; val (p,_) = p;
1170 val Specify_Method' mID = m;
1171 specify (Specify_Method' mID) (p,p_) c pt;
1173 | specify (Specify_Method' (mID,_,_)) (pos as (p,_)) c pt =
1174 let val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1175 meth=met, ...}) = get_obj I pt p;
1176 val {ppc,pre,prls,...} = get_met mID
1177 val thy = assoc_thy dI
1178 val oris = add_field' thy ppc oris;
1179 (*val pt = update_oris pt p oris; 20.3.02: repl. "#undef"*)
1180 val dI'' = if dI=e_domID then dI' else dI;
1181 val pI'' = if pI = e_pblID then pI' else pI;
1182 val met = if met=[] then pbl else met;
1183 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1184 (*val pt = update_met pt p itms;
1185 val pt = update_metID pt p mID*)
1187 generate1 thy (Specify_Method' (mID, oris, itms)) (Uistate, e_ctxt) pos pt
1188 (*val _=tracing("@@@ specify (Specify_Method) before nxt_spec")*)
1189 val (_,nxt) = nxt_spec Met (*ok*)true oris (dI',pI',mI') (pbl, itms)
1190 ((#ppc o get_pbt) pI'',ppc) (dI'',pI'',mID);
1191 in (pos, (pos,Uistate),
1192 Form' (PpcKF (0,EdUndef,(length p),Nundef,
1193 (Method mID, itms2itemppc (assoc_thy dI'') itms pre'))),
1195 (* val Add_Find' ct = nxt; val sel = "#Find";
1197 | specify (Add_Given' ct) p c pt = specify_additem "#Given" ct p c pt
1198 | specify (Add_Find' ct) p c pt = specify_additem "#Find" ct p c pt
1199 | specify (Add_Relation' ct) p c pt=specify_additem"#Relate"ct p c pt
1200 (* val Specify_Theory' domID = m;
1201 val (Specify_Theory' domID, (p,p_)) = (m, pos);
1203 | specify (Specify_Theory' domID) (pos as (p,p_)) c pt =
1204 let val p_ = case p_ of Met => Met | _ => Pbl
1205 val thy = assoc_thy domID;
1206 val (PblObj{origin=(oris,(dI',pI',mI'),_), meth=met,
1207 probl=pbl, spec=(dI,pI,mI), ...}) = get_obj I pt p;
1208 val mppc = case p_ of Met => met | _ => pbl;
1209 val cpI = if pI = e_pblID then pI' else pI;
1210 val {prls=per,ppc,where_=pwh,...} = get_pbt cpI
1211 val cmI = if mI = e_metID then mI' else mI;
1212 val {prls=mer,ppc=mpc,pre=mwh,...} = get_met cmI
1215 Met => (check_preconds thy mer mwh met)
1216 | _ => (check_preconds thy per pwh pbl)
1217 val pb = foldl and_ (true, map fst pre)
1220 (*val _=tracing("@@@ specify (Specify_Theory) THEN before nxt_spec")*)
1221 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI')
1222 (pbl,met) (ppc,mpc) (dI,pI,mI);
1223 in ((p,p_), (pos,Uistate),
1224 Form'(PpcKF (0,EdUndef,(length p), Nundef,
1225 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1227 else (*FIXME: check ppc wrt. (new!) domID ..? still parsable?*)
1229 (*val pt = update_domID pt p domID;11.8.03*)
1230 val ((p,p_),_,_,pt) = generate1 thy (Specify_Theory' domID)
1231 (Uistate, e_ctxt) (p,p_) pt
1232 (*val _=tracing("@@@ specify (Specify_Theory) ELSE before nxt_spec")*)
1233 val (p_,nxt) = nxt_spec p_ pb oris (dI',pI',mI') (pbl,met)
1234 (ppc,mpc) (domID,pI,mI);
1235 in ((p,p_), (pos,Uistate),
1236 Form' (PpcKF (0, EdUndef, (length p),Nundef,
1237 (header p_ pI cmI, itms2itemppc thy mppc pre))),
1240 (* itms2itemppc thy [](*mpc*) pre
1242 | specify m' _ _ _ =
1243 error ("specify: not impl. for "^tac_2str m');
1245 fun nxt_specif_additem sel ct (ptp as (pt, (p, Pbl))) =
1247 val (PblObj{meth=met,origin=(oris,(dI',pI',_),_),
1248 probl=pbl,spec=(dI,pI,_), ctxt, ...}) = get_obj I pt p;
1249 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1250 val cpI = if pI = e_pblID then pI' else pI;
1252 case appl_add ctxt sel oris pbl ((#ppc o get_pbt) cpI) ct of
1253 Add itm (*..union old input *) =>
1255 (*val _=tracing("###nxt_specif_additem: itm= "^(itm2str_ itm));*)
1256 val pbl' = insert_ppc thy itm pbl
1259 "#Given" => (Add_Given ct, Add_Given' (ct, pbl'))
1260 | "#Find" => (Add_Find ct, Add_Find' (ct, pbl'))
1261 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, pbl'))
1262 val ((p,Pbl),c,_,pt') =
1263 generate1 thy tac_ (Uistate, e_ctxt) (p,Pbl) pt
1264 in ([(tac,tac_,((p,Pbl),(Uistate, e_ctxt)))], c, (pt',(p,Pbl))):calcstate'
1267 (*TODO.WN03 pass error-msgs to the frontend..
1268 FIXME ..and dont abuse a tactic for that purpose*)
1269 ([(Tac msg, Tac_ (Thy_Info.get_theory "Pure", msg,msg,msg),
1270 (e_pos', (e_istate, e_ctxt)))], [], ptp)
1272 | nxt_specif_additem sel ct (ptp as (pt,(p,Met))) =
1274 val (PblObj{meth=met,origin=(oris,(dI',pI',mI'),_),
1275 probl=pbl,spec=(dI,pI,mI), ctxt, ...}) = get_obj I pt p;
1276 val thy = if dI = e_domID then assoc_thy dI' else assoc_thy dI;
1277 val cmI = if mI = e_metID then mI' else mI;
1279 case appl_add ctxt sel oris met ((#ppc o get_met) cmI) ct of
1280 Add itm (*..union old input *) =>
1282 val met' = insert_ppc thy itm met;
1285 "#Given" => (Add_Given ct, Add_Given' (ct, met'))
1286 | "#Find" => (Add_Find ct, Add_Find' (ct, met'))
1287 | "#Relate"=> (Add_Relation ct, Add_Relation'(ct, met'))
1288 val ((p,Met),c,_,pt') =
1289 generate1 thy tac_ (Uistate, e_ctxt) (p,Met) pt
1290 in ([(tac,tac_,((p,Met), (Uistate, e_ctxt)))], c, (pt',(p,Met))) end
1291 | Err msg => ([(*tacis*)], [], ptp)
1292 (*nxt_me collects tacis until not hide; here just no progress*)
1295 fun ori2Coritm pbt ((i,v,f,d,ts):ori) =
1296 (i,v,true,f, Cor ((d,ts),(((snd o snd o the o (find_first (eq1 d))) pbt)
1297 handle _ => error ("ori2Coritm: dsc "^
1299 "in ori, but not in pbt")
1301 fun ori2Coritm (pbt:pat list) ((i,v,f,d,ts):ori) =
1302 ((i,v,true,f, Cor ((d,ts),((snd o snd o the o
1303 (find_first (eq1 d))) pbt,ts))):itm)
1304 handle _ => (*dsc in oris, but not in pbl pat list: keep this dsc*)
1305 ((i,v,true,f, Cor ((d,ts),(d,ts))):itm);
1308 (*filter out oris which have same description in itms*)
1309 fun filter_outs oris [] = oris
1310 | filter_outs oris (i::itms) =
1311 let val ors = filter_out ((curry op= ((d_in o #5) (i:itm))) o
1312 (#4:ori -> term)) oris;
1313 in filter_outs ors itms end;
1315 fun memI a b = member op = a b;
1316 (*filter oris which are in pbt, too*)
1317 fun filter_pbt oris pbt =
1318 let val dscs = map (fst o snd) pbt
1319 in filter ((memI dscs) o (#4: ori -> term)) oris end;
1321 (*.combine itms from pbl + met and complete them wrt. pbt.*)
1322 (*FIXXXME.WN031205 complete_metitms doesnt handle incorrect itms !*)
1324 fun x mem [] = false
1325 | x mem (y :: ys) = x = y orelse x mem ys;
1327 fun complete_metitms (oris:ori list) (pits:itm list) (mits:itm list) met =
1328 (* val met = (#ppc o get_met) ["DiffApp","max_by_calculus"];
1330 let val vat = max_vt pits;
1332 (filter ((curry (op mem) vat) o (#2:itm -> int list)) mits);
1333 val ors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris;
1334 val os = filter_outs ors itms;
1335 (*WN.12.03?: does _NOT_ add itms from met ?!*)
1336 in itms @ (map (ori2Coritm met) os) end
1341 (*.complete model and guard of a calc-head .*)
1343 fun x mem [] = false
1344 | x mem (y :: ys) = x = y orelse x mem ys;
1346 fun complete_mod_ (oris, mpc, ppc, probl) =
1347 let val pits = filter_out ((curry op= false) o (#3: itm -> bool)) probl
1348 val vat = if probl = [] then 1 else max_vt probl
1349 val pors = filter ((curry (op mem) vat) o (#2:ori -> int list)) oris
1350 val pors = filter_outs pors pits (*which are in pbl already*)
1351 val pors = (filter_pbt pors ppc) (*which are in pbt, too*)
1353 val pits = pits @ (map (ori2Coritm ppc) pors)
1354 val mits = complete_metitms oris pits [] mpc
1358 fun some_spec ((odI, opI, omI):spec) ((dI, pI, mI):spec) =
1359 (if dI = e_domID then odI else dI,
1360 if pI = e_pblID then opI else pI,
1361 if mI = e_metID then omI else mI):spec;
1364 (*.find a next applicable tac (for calcstate) and update ptree
1365 (for ev. finding several more tacs due to hide).*)
1366 (*FIXXXME: unify ... fun nxt_specif = nxt_spec + applicable_in + specify !!*)
1367 (*WN.24.10.03 ~~~~~~~~~~~~~~ -> tac -> tac_ -> -"- as arg*)
1368 (*WN.24.10.03 fun nxt_solv = ...................................??*)
1369 fun nxt_specif (tac as Model_Problem) (pt, pos as (p,p_)) =
1371 val PblObj {origin = (oris, ospec, _), probl, spec, ...} = get_obj I pt p
1372 val (dI, pI, mI) = some_spec ospec spec
1373 val thy = assoc_thy dI
1374 val mpc = (#ppc o get_met) mI (* just for reuse complete_mod_ *)
1375 val {cas, ppc, ...} = get_pbt pI
1376 val pbl = init_pbl ppc (* fill in descriptions *)
1377 (*----------------if you think, this should be done by the Dialog
1378 in the java front-end, search there for WN060225-modelProblem----*)
1380 case cas of NONE => (pbl, [])
1381 | _ => complete_mod_ (oris, mpc, ppc, probl)
1382 (*----------------------------------------------------------------*)
1383 val tac_ = Model_Problem' (pI, pbl, met)
1384 val (pos,c,_,pt) = generate1 thy tac_ (Uistate, e_ctxt) pos pt
1385 in ([(tac,tac_, (pos, (Uistate, e_ctxt)))], c, (pt,pos)):calcstate' end
1387 | nxt_specif (Add_Given ct) ptp = nxt_specif_additem "#Given" ct ptp
1388 | nxt_specif (Add_Find ct) ptp = nxt_specif_additem "#Find" ct ptp
1389 | nxt_specif (Add_Relation ct) ptp = nxt_specif_additem"#Relate" ct ptp
1391 (*. called only if no_met is specified .*)
1392 | nxt_specif (Refine_Tacitly pI) (ptp as (pt, pos as (p,_))) =
1394 val (PblObj {origin = (oris, (dI,_,_),_), ...}) = get_obj I pt p
1395 val opt = refine_ori oris pI
1400 val {met,ppc,...} = get_pbt pI'
1401 val pbl = init_pbl ppc
1402 (*val pt = update_pbl pt p pbl ..done by Model_Problem*)
1403 val mI = if length met = 0 then e_metID else hd met
1404 val thy = assoc_thy dI
1406 generate1 thy (Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]))
1407 (Uistate, e_ctxt) pos pt
1408 in ([(Refine_Tacitly pI, Refine_Tacitly' (pI,pI',dI,mI,(*pbl*)[]),
1409 (pos, (Uistate, e_ctxt)))], c, (pt,pos))
1411 | NONE => ([], [], ptp)
1414 | nxt_specif (Refine_Problem pI) (ptp as (pt, pos as (p,_))) =
1416 val (PblObj {origin=(_,(dI,_,_),_),spec=(dI',_,_), probl, ...}) = get_obj I pt p
1417 val thy = if dI' = e_domID then dI else dI'
1419 case refine_pbl (assoc_thy thy) pI probl of
1420 NONE => ([], [], ptp)
1421 | SOME (rfd as (pI',_)) =>
1423 val (pos,c,_,pt) = generate1 (assoc_thy thy)
1424 (Refine_Problem' rfd) (Uistate, e_ctxt) pos pt
1425 in ([(Refine_Problem pI, Refine_Problem' rfd,
1426 (pos, (Uistate, e_ctxt)))], c, (pt,pos))
1430 | nxt_specif (Specify_Problem pI) (pt, pos as (p,_)) =
1432 val (PblObj {origin=(oris,(dI,_,_),_),spec=(dI',pI',_), probl, ...}) = get_obj I pt p;
1433 val thy = assoc_thy (if dI' = e_domID then dI else dI');
1434 val {ppc,where_,prls,...} = get_pbt pI
1435 val pbl as (_,(itms,_)) =
1436 if pI'=e_pblID andalso pI=e_pblID
1437 then (false, (init_pbl ppc, []))
1438 else match_itms_oris thy probl (ppc,where_,prls) oris(*FIXXXXXME?*)
1439 (*FIXXXME~~~~~~~~~~~~~~~: take pbl and compare with new pI WN.8.03*)
1440 val ((p,Pbl),c,_,pt) =
1441 generate1 thy (Specify_Problem' (pI, pbl)) (Uistate, e_ctxt) pos pt
1442 in ([(Specify_Problem pI, Specify_Problem' (pI, pbl),
1443 (pos,(Uistate, e_ctxt)))], c, (pt,pos))
1446 (*transfers oris (not required in pbl) to met-model for script-env
1447 FIXME.WN.8.03: application of several mIDs to SAME model?*)
1448 | nxt_specif (Specify_Method mID) (ptp as (pt, pos as (p,_))) =
1450 val (PblObj {origin=(oris,(dI',pI',mI'),_), probl=pbl, spec=(dI,pI,mI),
1451 meth=met, ...}) = get_obj I pt p;
1452 val {ppc,pre,prls,...} = get_met mID
1453 val thy = assoc_thy dI
1454 val oris = add_field' thy ppc oris;
1455 val dI'' = if dI=e_domID then dI' else dI;
1456 val pI'' = if pI = e_pblID then pI' else pI;
1457 val met = if met=[] then pbl else met;(*WN0602 what if more itms in met?*)
1458 val (ok, (itms, pre')) = match_itms_oris thy met (ppc,pre,prls ) oris;
1460 generate1 thy (Specify_Method' (mID, oris, itms)) (Uistate, e_ctxt) pos pt
1461 in ([(Specify_Method mID, Specify_Method' (mID, oris, itms),
1462 (pos,(Uistate, e_ctxt)))], c, (pt,pos))
1465 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Pbl)) =
1467 val (dI',_,_) = get_obj g_spec pt p
1469 generate1 (assoc_thy "Isac") (Specify_Theory' dI) (Uistate, e_ctxt) pos pt
1470 in (*FIXXXME: check if pbl can still be parsed*)
1471 ([(Specify_Theory dI, Specify_Theory' dI, (pos,(Uistate, e_ctxt)))], c,
1475 | nxt_specif (Specify_Theory dI) (pt, pos as (p,Met)) =
1477 val (dI',_,_) = get_obj g_spec pt p
1479 generate1 (assoc_thy "Isac") (Specify_Theory' dI) (Uistate, e_ctxt) pos pt
1480 in (*FIXXXME: check if met can still be parsed*)
1481 ([(Specify_Theory dI, Specify_Theory' dI, (pos,(Uistate, e_ctxt)))], c,
1486 error ("nxt_specif: not impl. for "^tac2str m');
1488 (* get the values from oris; handle the term list w.r.t. penv *)
1490 fun x mem [] = false
1491 | x mem (y :: ys) = x = y orelse x mem ys;
1493 fun vals_of_oris oris =
1494 ((map (mkval' o (#5:ori -> term list))) o
1495 (filter ((curry (op mem) 1) o (#2:ori -> int list)))) oris
1498 (* create a calc-tree with oris via an cas.refined pbl *)
1499 fun nxt_specify_init_calc (([], (dI, pI, mI)) : fmz) =
1501 then (* from pbl-browser or from CAS cmd with pI=[e_pblID] *)
1503 val {cas, met, ppc, thy, ...} = get_pbt pI
1504 val dI = if dI = "" then theory2theory' thy else dI
1505 val thy = assoc_thy dI
1506 val mI = if mI = [] then hd met else mI
1507 val hdl = case cas of NONE => pblterm dI pI | SOME t => t
1508 val (pt,_) = cappend_problem e_ptree [] (Uistate, e_ctxt) ([], (dI,pI,mI))
1509 ([], (dI,pI,mI), hdl)
1510 val pt = update_spec pt [] (dI,pI,mI)
1511 val pits = init_pbl' ppc
1512 val pt = update_pbl pt [] pits
1513 in ((pt, ([] ,Pbl)), []) : calcstate end
1516 then (* from met-browser *)
1518 val {ppc,...} = get_met mI
1519 val dI = if dI = "" then "Isac" else dI
1520 val thy = assoc_thy dI;
1521 val (pt,_) = cappend_problem e_ptree [] (e_istate, e_ctxt) ([], (dI,pI,mI))
1522 ([], (dI,pI,mI), e_term(*FIXME met*));
1523 val pt = update_spec pt [] (dI,pI,mI);
1524 val mits = init_pbl' ppc;
1525 val pt = update_met pt [] mits;
1526 in ((pt, ([], Met)), []) : calcstate end
1527 else (* new example, pepare for interactive modeling *)
1528 let val (pt,_) = cappend_problem e_ptree [] (e_istate, e_ctxt) ([], e_spec)
1529 ([], e_spec, e_term)
1530 in ((pt, ([], Pbl)), []) : calcstate end
1532 | nxt_specify_init_calc (fmz : fmz_, (dI, pI, mI) : spec) =
1533 let (* both """"""""""""""""""""""""" either empty or complete *)
1534 val thy = assoc_thy dI
1535 val (pI, (pors, pctxt), mI) =
1539 val (pors, pctxt) = get_pbt pI |> #ppc |> prep_ori fmz thy;
1540 val pI' = refine_ori' pors pI;
1541 in (pI', (pors(*refinement over models with diff.precond only*), pctxt),
1542 (hd o #met o get_pbt) pI') end
1543 else (pI, get_pbt pI |> #ppc |> prep_ori fmz thy, mI)
1544 val {cas, ppc, thy=thy',...} = get_pbt pI (*take dI from _refined_ pbl*)
1545 val dI = theory2theory' (maxthy thy thy');
1548 NONE => pblterm dI pI
1549 | SOME t => subst_atomic ((vars_of_pbl_' ppc) ~~~ vals_of_oris pors) t;
1550 val (pt, _) = cappend_problem e_ptree [] (e_istate, pctxt) (fmz, (dI, pI, mI))
1551 (pors, (dI, pI, mI), hdl)
1552 val pt = update_ctxt pt [] pctxt (* FIXME.WN110511*)
1553 in ((pt, ([], Pbl)),
1554 fst3 (nxt_specif Model_Problem (pt, ([], Pbl)))) : calcstate
1560 fun get_spec_form (m:tac_) ((p,p_):pos') (pt:ptree) =
1561 (* case appl_spec p pt m of /// 19.1.00
1562 Notappl e => Error' (Error_ e)
1564 *) let val (_,_,f,_,_,_) = specify m (p,p_) [] pt
1568 (*fun tag_form thy (formal, given) = cterm_of thy
1569 (((head_of o term_of) given) $ (term_of formal)); WN100819*)
1570 fun tag_form thy (formal, given) =
1571 (let val gf = (head_of given) $ formal;
1572 val _ = cterm_of thy gf
1575 error ("calchead.tag_form: " ^
1576 Print_Mode.setmp [] (Syntax.string_of_term
1577 (thy2ctxt thy)) given ^ " .. " ^
1578 Print_Mode.setmp [] (Syntax.string_of_term
1579 (thy2ctxt thy)) formal ^
1580 " ..types do not match");
1581 (* val formal = (the o (parse thy)) "[R::real]";
1582 > val given = (the o (parse thy)) "fixed_values (cs::real list)";
1583 > tag_form thy (formal, given);
1584 val it = "fixed_values [R]" : cterm
1587 fun chktyp thy (n, fs, gs) =
1588 ((writeln o (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) o
1590 (writeln o (Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy))) o
1592 tag_form thy (nth n fs, nth n gs));
1593 fun chktyps thy (fs, gs) = map (tag_form thy) (fs ~~ gs);
1595 (* #####################################################
1596 find the failing item:
1598 > val tag__form = chktyp (n,formals,givens);
1599 > (type_of o term_of o (nth n)) formals;
1600 > (type_of o term_of o (nth n)) givens;
1601 > atomty ((term_of o (nth n)) formals);
1602 > atomty ((term_of o (nth n)) givens);
1603 > atomty (term_of tag__form);
1604 > use_thy"isa-98-1-HOL-plus/knowl-base/DiffAppl";
1605 ##################################################### *)
1607 (* #####################################################
1609 val origin = ["sqrt(9+4*x)=sqrt x + sqrt(5+x)","x::rat","(+0)"];
1610 val formals = map (the o (parse thy)) origin;
1612 val given = ["equation (lhs=rhs)",
1613 "bound_variable bdv", (* TODO type *)
1615 val where_ = ["e is_root_equation_in bdv",
1617 "apx is_const_expr"];
1618 val find = ["L::rat set"];
1619 val with_ = ["L = {bdv. || ((%x. lhs) bdv) - ((%x. rhs) bdv) || < apx}"];
1620 val chkpbl = map (the o (parse thy)) (given @ where_ @ find @ with_);
1621 val givens = map (the o (parse thy)) given;
1623 val tag__forms = chktyps (formals, givens);
1624 map ((atomty) o term_of) tag__forms;
1625 ##################################################### *)
1628 (* check pbltypes, announces one failure a time *)
1629 (*fun chk_vars ctppc =
1630 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1631 appc flat (mappc (vars o term_of) ctppc)
1632 in if (wh\\gi) <> [] then ("wh\\gi",wh\\gi)
1633 else if (re\\(gi union fi)) <> []
1634 then ("re\\(gi union fi)",re\\(gi union fi))
1635 else ("ok",[]) end;*)
1636 fun chk_vars ctppc =
1637 let val {Given=gi,Where=wh,Find=fi,With=wi,Relate=re} =
1638 appc flat (mappc vars ctppc)
1639 val chked = subtract op = gi wh
1640 in if chked <> [] then ("wh\\gi", chked)
1641 else let val chked = subtract op = (union op = gi fi) re
1643 then ("re\\(gi union fi)", chked)
1648 (* check a new pbltype: variables (Free) unbound by given, find*)
1649 fun unbound_ppc ctppc =
1650 let val {Given=gi,Find=fi,Relate=re,...} =
1651 appc flat (mappc vars ctppc)
1652 in distinct (*re\\(gi union fi)*)
1653 (subtract op = (union op = gi fi) re) end;
1655 > val org = {Given=["[R=(R::real)]"],Where=[],
1656 Find=["[A::real]"],With=[],
1657 Relate=["[A=#2*a*b - a^^^#2, (a//#2)^^^#2 + (b//#2)^^^#2 = R^^^#2]"]
1659 > val ctppc = mappc (the o (parse thy)) org;
1660 > unbound_ppc ctppc;
1661 val it = [("a","RealDef.real"),("b","RealDef.real")] : (string * typ) list
1665 (* f, a binary operator, is nested rightassociative *)
1668 fun fld f (x::[]) = x
1669 | fld f (x::x'::[]) = f (x',x)
1670 | fld f (x::x'::xs) = f (fld f (x'::xs),x);
1671 in ((fld f) o rev) xs end;
1673 > val (SOME ct) = parse thy "[a=b,c=d,e=f]";
1674 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1675 > val conj = foldr1 HOLogic.mk_conj (isalist2list (term_of ct));
1676 > cterm_of thy conj;
1677 val it = "(a = b & c = d) & e = f" : cterm
1680 (* f, a binary operator, is nested leftassociative *)
1681 fun foldl1 f (x::[]) = x
1682 | foldl1 f (x::x'::[]) = f (x,x')
1683 | foldl1 f (x::x'::xs) = f (x,foldl1 f (x'::xs));
1685 > val (SOME ct) = parse thy "[a=b,c=d,e=f,g=h]";
1686 > val ces = map (cterm_of thy) (isalist2list (term_of ct));
1687 > val conj = foldl1 HOLogic.mk_conj (isalist2list (term_of ct));
1688 > cterm_of thy conj;
1689 val it = "a = b & c = d & e = f & g = h" : cterm
1693 (* called only once, if a Subproblem has been located in the script*)
1694 fun nxt_model_pbl (Subproblem'((_,pblID,metID),_,_,_,_,_)) ptp =
1697 (snd3 o hd o fst3) (nxt_specif (Refine_Tacitly pblID) ptp)
1698 | _ => (snd3 o hd o fst3) (nxt_specif Model_Problem ptp))
1699 (*all stored in tac_ itms^^^^^^^^^^*)
1700 | nxt_model_pbl tac_ _ =
1701 error ("nxt_model_pbl: called by tac= " ^ tac_2str tac_);
1703 (*fun eq1 d (_,(d',_)) = (d = d'); ---modspec.sml*)
1704 fun eq4 v (_,vts,_,_,_) = member op = vts v;
1705 fun eq5 (_,_,_,_,itm_) (_,_,_,d,_) = d_in itm_ = d;
1708 (*.complete _NON_empty calc-head for autocalc (sub-)pbl from oris
1709 + met from fmz; assumes pos on PblObj, meth = [].*)
1710 fun complete_mod (pt, pos as (p, p_):pos') =
1711 (* val (pt, (p, _)) = (pt, p);
1712 val (pt, (p, _)) = (pt, pos);
1714 let val _= if p_ <> Pbl
1715 then tracing("###complete_mod: only impl.for Pbl, called with "^
1716 pos'2str pos) else ()
1717 val (PblObj{origin=(oris, ospec, hdl), probl, spec, ...}) =
1719 val (dI,pI,mI) = some_spec ospec spec
1720 val mpc = (#ppc o get_met) mI
1721 val ppc = (#ppc o get_pbt) pI
1722 val (pits, mits) = complete_mod_ (oris, mpc, ppc, probl)
1723 val pt = update_pblppc pt p pits
1724 val pt = update_metppc pt p mits
1725 in (pt, (p,Met):pos') end
1727 (*| complete_mod (pt, pos as (p, Met):pos') =
1728 error ("###complete_mod: only impl.for Pbl, called with "^
1731 (*.complete _EMPTY_ calc-head for autocalc (sub-)pbl from oris(+met from fmz);
1732 oris and spec (incl. pbl-refinement) given from init_calc or SubProblem .*)
1733 fun all_modspec (pt, (p,_):pos') =
1735 val (PblObj{fmz=(fmz_,_), origin=(pors, spec as (dI,pI,mI), hdl),
1736 ...}) = get_obj I pt p;
1737 val thy = assoc_thy dI;
1738 val {ppc,...} = get_met mI;
1739 val mors = prep_ori fmz_ thy ppc |> #1;
1740 val pt = update_pblppc pt p (map (ori2Coritm ppc) pors);
1741 val pt = update_metppc pt p (map (ori2Coritm ppc) mors);
1742 val pt = update_spec pt p (dI,pI,mI);
1743 in (pt, (p,Met): pos') end;
1745 (*WN.12.03: use in nxt_spec, too ? what about variants ???*)
1746 fun is_complete_mod_ ([]: itm list) = false
1747 | is_complete_mod_ itms =
1748 foldl and_ (true, (map #3 itms));
1750 fun is_complete_mod (pt, pos as (p, Pbl): pos') =
1751 if (is_pblobj o (get_obj I pt)) p
1752 then (is_complete_mod_ o (get_obj g_pbl pt)) p
1753 else error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1754 | is_complete_mod (pt, pos as (p, Met)) =
1755 if (is_pblobj o (get_obj I pt)) p
1756 then (is_complete_mod_ o (get_obj g_met pt)) p
1757 else error ("is_complete_mod: called by PrfObj at "^pos'2str pos)
1758 | is_complete_mod (_, pos) =
1759 error ("is_complete_mod called by " ^ pos'2str pos ^
1760 " (should be Pbl or Met)");
1762 (*.have (thy, pbl, met) _all_ been specified explicitly ?.*)
1763 fun is_complete_spec (pt, pos as (p,_): pos') =
1764 if (not o is_pblobj o (get_obj I pt)) p
1765 then error ("is_complete_spec: called by PrfObj at "^pos'2str pos)
1766 else let val (dI,pI,mI) = get_obj g_spec pt p
1767 in dI<>e_domID andalso pI<>e_pblID andalso mI<>e_metID end;
1768 (*.complete empty items in specification from origin (pbl, met ev.refined);
1769 assumes 'is_complete_mod'.*)
1770 fun complete_spec (pt, pos as (p,_): pos') =
1771 let val PblObj {origin = (_,ospec,_), spec,...} = get_obj I pt p
1772 val pt = update_spec pt p (some_spec ospec spec)
1775 fun is_complete_modspec ptp =
1776 is_complete_mod ptp andalso is_complete_spec ptp;
1781 fun pt_model (PblObj {meth,spec,origin=(_,spec',hdl),...}) Met =
1782 (* val ((PblObj {meth,spec,origin=(_,spec',hdl),...}), Met) = (ppobj, p_);
1784 let val (_,_,metID) = get_somespec' spec spec'
1786 if metID = e_metID then []
1787 else let val {prls,pre=where_,...} = get_met metID
1788 val pre = check_preconds' prls where_ meth 0
1790 val allcorrect = is_complete_mod_ meth
1791 andalso foldl and_ (true, (map #1 pre))
1792 in ModSpec (allcorrect, Met, hdl, meth, pre, spec) end
1793 | pt_model (PblObj {probl,spec,origin=(_,spec',hdl),...}) _(*Frm,Pbl*) =
1794 (* val ((PblObj {probl,spec,origin=(_,spec',hdl),...}),_) = (ppobj, p_);
1796 let val (_,pI,_) = get_somespec' spec spec'
1798 if pI = e_pblID then []
1799 else let val {prls,where_,cas,...} = get_pbt pI
1800 val pre = check_preconds' prls where_ probl 0
1802 val allcorrect = is_complete_mod_ probl
1803 andalso foldl and_ (true, (map #1 pre))
1804 in ModSpec (allcorrect, Pbl, hdl, probl, pre, spec) end;
1807 fun pt_form (PrfObj {form,...}) = Form form
1808 | pt_form (PblObj {probl,spec,origin=(_,spec',_),...}) =
1809 let val (dI, pI, _) = get_somespec' spec spec'
1810 val {cas,...} = get_pbt pI
1812 NONE => Form (pblterm dI pI)
1813 | SOME t => Form (subst_atomic (mk_env probl) t)
1815 (*vvv takes the tac _generating_ the formula=result, asm ok....
1816 fun pt_result (PrfObj {result=(t,asm), tac,...}) =
1818 if null asm then NONE else SOME asm,
1820 | pt_result (PblObj {result=(t,asm), origin = (_,ospec,_), spec,...}) =
1821 let val (_,_,metID) = some_spec ospec spec
1823 if null asm then NONE else SOME asm,
1824 if metID = e_metID then NONE else SOME (Apply_Method metID)) end;
1825 -------------------------------------------------------------------------*)
1828 (*.pt_extract returns
1829 # the formula at pos
1830 # the tactic applied to this formula
1831 # the list of assumptions generated at this formula
1832 (by application of another tac to the preceding formula !)
1833 pos is assumed to come from the frontend, ie. generated by moveDown.*)
1834 (*cannot be in ctree.sml, because ModSpec has to be calculated*)
1835 fun pt_extract (pt,([],Res)) =
1836 (* val (pt,([],Res)) = ptp;
1838 (* ML_TODO 110417 get assumptions from ctxt !? *)
1839 let val (f, asm) = get_obj g_result pt []
1840 in (Form f, NONE, asm) end
1843 | pt_extract (pt,(p,Res)) =
1844 (* val (pt,(p,Res)) = ptp;
1846 let val (f, asm) = get_obj g_result pt p
1847 val tac = if last_onlev pt p
1848 then if is_pblobj' pt (lev_up p)
1849 then let val (PblObj{spec=(_,pI,_),...}) =
1850 get_obj I pt (lev_up p)
1851 in if pI = e_pblID then NONE
1852 else SOME (Check_Postcond pI) end
1853 else SOME End_Trans (*WN0502 TODO for other branches*)
1854 else let val p' = lev_on p
1855 in if is_pblobj' pt p'
1856 then let val (PblObj{origin = (_,(dI,pI,_),_),...}) =
1858 in SOME (Subproblem (dI, pI)) end
1859 else if f = get_obj g_form pt p'
1860 then SOME (get_obj g_tac pt p')
1861 (*because this Frm ~~~is not on worksheet*)
1862 else SOME (Take (term2str (get_obj g_form pt p')))
1864 in (Form f, tac, asm) end
1866 | pt_extract (pt, pos as (p,p_(*Frm,Pbl*))) =
1867 (* val (pt, pos as (p,p_(*Frm,Pbl*))) = ptp;
1868 val (pt, pos as (p,p_(*Frm,Pbl*))) = (pt, p);
1870 let val ppobj = get_obj I pt p
1871 val f = if is_pblobj ppobj then pt_model ppobj p_
1872 else get_obj pt_form pt p
1873 val tac = g_tac ppobj
1874 in (f, SOME tac, []) end;
1877 (**. get the formula from a ctree-node:
1878 take form+res from PblObj and 1.PrfObj and (PrfObj after PblObj)
1879 take res from all other PrfObj's .**)
1880 (*designed for interSteps, outcommented 04 in favour of calcChangedEvent*)
1881 fun formres p (Nd (PblObj {origin = (_,_, h), result = (r, _),...}, _)) =
1882 [("headline", (p, Frm), h),
1883 ("stepform", (p, Res), r)]
1884 | formres p (Nd (PrfObj {form, result = (r, _),...}, _)) =
1885 [("stepform", (p, Frm), form),
1886 ("stepform", (p, Res), r)];
1888 fun form p (Nd (PrfObj {result = (r, _),...}, _)) =
1889 [("stepform", (p, Res), r)]
1891 (*assumes to take whole level, in particular hd -- for use in interSteps*)
1892 fun get_formress fs p [] = flat fs
1893 | get_formress fs p (nd::nds) =
1894 (* start with 'form+res' and continue with trying 'res' only*)
1895 get_forms (fs @ [formres p nd]) (lev_on p) nds
1896 and get_forms fs p [] = flat fs
1897 | get_forms fs p (nd::nds) =
1899 (* start again with 'form+res' ///ugly repeat with Check_elementwise
1900 then get_formress (fs @ [formres p nd]) (lev_on p) nds *)
1901 then get_forms (fs @ [formres p nd]) (lev_on p) nds
1902 (* continue with trying 'res' only*)
1903 else get_forms (fs @ [form p nd]) (lev_on p) nds;
1905 (**.get an 'interval' 'from' 'to' of formulae from a ptree.**)
1906 (*WN050219 made robust against _'to' below or after Complete nodes
1907 by handling exn caused by move_dn*)
1908 (*WN0401 this functionality belongs to ctree.sml,
1909 but fetching a calc_head requires calculations defined in modspec.sml
1910 transfer to ME/me.sml !!!
1911 WN051224 ^^^ doesnt hold any longer, since only the headline of a calc_head
1912 is returned !!!!!!!!!!!!!
1914 fun eq_pos' (p1,Frm) (p2,Frm) = p1 = p2
1915 | eq_pos' (p1,Res) (p2,Res) = p1 = p2
1916 | eq_pos' (p1,Pbl) (p2,p2_) = p1 = p2 andalso (case p2_ of
1920 | eq_pos' (p1,Met) (p2,p2_) = p1 = p2 andalso (case p2_ of
1924 | eq_pos' _ _ = false;
1926 (*.get an 'interval' from the ctree; 'interval' is w.r.t. the
1927 total ordering Position#compareTo(Position p) in the java-code
1928 val get_interval = fn
1929 : pos' -> : from is "move_up 1st-element" to return
1930 pos' -> : to the last element to be returned; from < to
1931 int -> : level: 0 gets the flattest sub-tree possible
1932 >999 gets the deepest sub-tree possible
1934 (pos' * : of the formula
1935 Term.term) : the formula
1938 fun get_interval from to level pt =
1939 (* val (from,level) = (f,lev);
1940 val (from, to, level) = (([3, 2, 1], Res), ([],Res), 9999);
1942 let fun get_inter c (from:pos') (to:pos') lev pt =
1943 (* val (c, from, to, lev) = ([], from, to, level);
1944 ------for recursion.......
1945 val (c, from:pos', to:pos') = (c @ [(from, f)], move_dn [] pt from, to);
1947 if eq_pos' from to orelse from = ([],Res)
1948 (*orelse ... avoids Exception- PTREE "end of calculation" raised,
1949 if 'to' has values NOT generated by move_dn, see systest/me.sml
1950 TODO.WN0501: introduce an order on pos' and check "from > to"..
1951 ...there is an order in Java!
1952 WN051224 the hack got worse with returning term instead ptform*)
1953 then let val (f,_,_) = pt_extract (pt, from)
1955 ModSpec (_,_,headline,_,_,_) => c @ [(from, headline)]
1956 | Form t => c @ [(from, t)]
1959 if lev < lev_of from
1960 then (get_inter c (move_dn [] pt from) to lev pt)
1961 handle (PTREE _(*from move_dn too far*)) => c
1962 else let val (f,_,_) = pt_extract (pt, from)
1963 val term = case f of
1964 ModSpec (_,_,headline,_,_,_)=> headline
1966 in (get_inter (c @ [(from, term)])
1967 (move_dn [] pt from) to lev pt)
1968 handle (PTREE _(*from move_dn too far*))
1969 => c @ [(from, term)] end
1970 in get_inter [] from to level pt end;
1973 fun posform2str (pos:pos', form) =
1974 "("^ pos'2str pos ^", "^
1976 Form f => term2str f
1977 | ModSpec c => term2str (#3 c(*the headline*)))
1979 fun posforms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
1980 (map posform2str)) pfs;
1981 fun posterm2str (pos:pos', t) =
1982 "("^ pos'2str pos ^", "^term2str t^")";
1983 fun posterms2str pfs = (strs2str' o (map (curry op ^ "\n")) o
1984 (map posterm2str)) pfs;
1987 (*WN050225 omits the last step, if pt is incomplete*)
1989 tracing (posterms2str (get_interval ([],Frm) ([],Res) 99999 pt));
1991 (*.get a calchead from a PblObj-node in the ctree;
1992 preconditions must be calculated.*)
1993 fun get_ocalhd (pt, pos' as (p,Pbl):pos') =
1994 let val PblObj {origin = (oris, ospec, hdf'), spec, probl,...} =
1996 val {prls,where_,...} = get_pbt (#2 (some_spec ospec spec))
1997 val pre = check_preconds (assoc_thy"Isac") prls where_ probl
1998 in (ocalhd_complete probl pre spec, Pbl, hdf', probl, pre, spec):ocalhd end
1999 | get_ocalhd (pt, pos' as (p,Met):pos') =
2000 let val PblObj {fmz = fmz as (fmz_,_), origin = (oris, ospec, hdf'),
2003 val {prls,pre,...} = get_met (#3 (some_spec ospec spec))
2004 val pre = check_preconds (assoc_thy"Isac") prls pre meth
2005 in (ocalhd_complete meth pre spec, Met, hdf', meth, pre, spec):ocalhd end;
2007 (*.at the activeFormula set the Model, the Guard and the Specification
2008 to empty and return a CalcHead;
2009 the 'origin' remains (for reconstructing all that).*)
2010 fun reset_calchead (pt, pos' as (p,_):pos') =
2011 let val PblObj {origin = (_, _, hdf'),...} = get_obj I pt p
2012 val pt = update_pbl pt p []
2013 val pt = update_met pt p []
2014 val pt = update_spec pt p e_spec
2015 in (pt, (p,Pbl):pos') end;