conditional compilation via system option "isac_test" and antiquotation \<^isac_test>CARTOUCHE:
option is provided in session ROOT, or interactively via $ISABELLE_HOME_USER/etc/preferences (i.e. Isabelle/jEdit plugin preferences);
1 (* Title: Specify/o-model.sml
2 Author: Walther Neuper 110226
3 (c) due to copyright terms
5 An \<open>O_Model\<close> holds \<open>O\<close>riginal data, \<open>descriptor\<close> and \<open>values\<close> parsed from \<open>Formalise.model\<close>
6 selected with respect to a \<open>Model_Pattern\<close> and combined with respective \<open>m_field\<close>s.
7 \<open>complete_for\<close> a \<open>Model_Pattern\<close> is done by \<open>Tactic.Model_Problem\<close>
8 (with defaults from \<open>Formalise\<close>refs), by \<open>Tactic.Specify_Problem\<close> and \<open>Tactic.Specify_Method\<close>
10 \<open>O_Model\<close> serves efficiency of student's interactive modelling via \<open>I_Model\<close>.
12 \<open>O_Model\<close> marks elements with \<open>m_field\<close> \<open>#undef\<close>, which are not required by the \<open>Model_Pattern\<close>
13 of the \<open>Problem\<close> or the \<open>MethodC\<close> .. TODO redes: \<open>m_field\<close> probably different in root..Subproblem
15 TODO: revise with an example with more than 1 variant.
16 + consider: drop m_field ?
19 signature ORIGINAL_MODEL =
29 val to_string: T -> string
30 val single_to_string: single -> string
31 val single_empty: single
33 (*val init: theory -> Formalise.model -> Model_Pattern.T -> T ..TODO*)
34 val init: Formalise.model -> theory -> Model_Pattern.T -> T
35 val values : T -> term list
36 val values': T -> Formalise.model * term list
37 val complete_for: Model_Pattern.T -> T -> T * Proof.context -> T * Proof.context
38 (*/------- rename -------\*)
39 (*val seek_oridts: Proof.context -> ?/////? -> descriptor * values -> T -> message * single * values*)
40 val seek_oridts: Proof.context -> m_field -> descriptor * values -> T -> message * single * values
41 (*val single_for_values:!!! values -> Proof.context -> m_field -> T -> message * single * values*)
42 val seek_orits: Proof.context -> m_field -> values -> T -> message * single * values
43 (*val ?contains:!!! term -> Proof.context -> m_field -> T -> message * single * values*)
44 val is_known: Proof.context -> m_field -> T -> term -> message * single * values
45 (*val typeless: term -> term*)
46 val typeless: term -> term
47 (*val test_types: Proof.context -> descriptor * values -> string*)
48 val test_types: Proof.context -> descriptor * values -> string
50 (*put add_id into a new auxiliary fun, see ONLY call..*)
51 val add_id: 'a list -> (int * 'a) list
53 (* ---- for tests only: shifted from below to remove the Warning "unused" at fun.def. --------- *)
54 (*val cpy_nam: Model_Pattern.T -> preori list -> Model_Pattern.single -> preori*)
55 val cpy_nam: Model_Pattern.T -> preori list -> Model_Pattern.single -> preori
56 val is_copy_named: Model_Pattern.single -> bool
57 val is_copy_named_idstr: string -> bool
58 val is_copy_named_generating_idstr: string -> bool
59 val is_copy_named_generating: Model_Pattern.single -> bool
61 val preoris2str : preori list -> string
62 (*val getr_ct: theory -> single -> m_field * UnparseC.term_as_string*)
63 val getr_ct: theory -> single -> m_field * UnparseC.term_as_string
66 val add_field: theory -> Model_Pattern.T -> descriptor * values -> m_field * descriptor * values
67 val add_variants: ('a * ''b * 'c) list -> (int * ('a * ''b * 'c)) list
68 (*val max: variants -> int*)
69 val max: variants -> int
70 (*val coll_variants: ('a * ''b) list -> ('a list * ''b) list*)
71 val coll_variants: ('a * ''b) list -> ('a list * ''b) list
72 (*val replace_0: int -> int list -> int list*)
73 val replace_0: int -> int list -> int list
74 val flattup: 'a * ('b * ('c * 'd * 'e)) -> 'a * 'b * 'c * 'd * 'e
75 (*val mark: ('a * 'a -> bool) -> 'a list -> (int * 'a) list*)
76 val mark: ('a * 'a -> bool) -> 'a list -> (int * 'a) list
77 (*\------- rename -------/*)
82 structure O_Model(**) : ORIGINAL_MODEL(**) =
88 type variant = Model_Def.variant;
89 type variants = Model_Def.variants;
90 type m_field = Model_Def.m_field;
91 type descriptor = Model_Def.descriptor;
92 type values = Model_Def.values;
93 type message = string;
95 type T = Model_Def.o_model;
96 type single = Model_Def.o_model_single
97 val single_empty = Model_Def.o_model_empty;
98 val single_to_string = Model_Def.o_model_single_to_string;
99 val to_string = Model_Def.o_model_to_string;
101 (* O_Model.single without leading integer *)
102 type preori = (variants * m_field * term * term list);
103 fun preori2str (vs, fi, t, ts) =
104 "(" ^ (strs2str o (map string_of_int)) vs ^ ", " ^ fi ^ ", " ^
105 UnparseC.term t ^ ", " ^ (strs2str o (map UnparseC.term)) ts ^ ")";
106 val preoris2str = (strs2str' o (map (linefeed o preori2str)));
108 (* get the first term in ts from ori *)
109 fun getr_ct thy (_, _, fd, d, ts) =
110 (fd, ((UnparseC.term_in_thy thy) o Input_Descript.join) (d,[hd ts]))
113 (** initialise O_Model **)
115 (* compare d and dsc in pbt and transfer field to pre-ori *)
116 fun add_field (_: theory) pbt (d,ts) =
117 let fun eq d pt = (d = (fst o snd) pt);
118 in case filter (eq d) pbt of
119 [(fi, (_, _))] => (fi, d, ts)
120 | [] => ("#undef", d, ts) (*may come with met.ppc*)
121 | _ => raise ERROR ("add_field: " ^ UnparseC.term d ^ " more than once in pbt")
125 mark an element with the position within a plateau;
126 a plateau with length 1 is marked with 0
128 fun mark _ [] = raise ERROR "mark []"
131 fun mar xx _ [x] n = xx @ [(if n = 1 then 0 else n, x)]
132 | mar _ _ [] _ = raise ERROR "mark []"
133 | mar xx eq (x:: x' :: xs) n =
134 if eq(x, x') then mar (xx @ [(n, x)]) eq (x' :: xs) (n + 1)
135 else mar (xx @ [(if n = 1 then 0 else n, x)]) eq (x' :: xs) 1;
136 in mar [] eq xs 1 end;
139 assumes equal descriptions to be in adjacent 'plateaus',
140 items at a certain position within the plateaus form a variant;
141 length = 1 ... marked with 0: covers all variants
143 fun add_variants fdts =
145 fun eq (a, b) = curry op= (snd3 a) (snd3 b);
148 fun max [] = raise ERROR "max of []"
151 | mx x (y :: ys) = if x < y then mx y ys else mx x ys;
154 fun coll_variants (((v,x) :: vxs)) =
156 fun col xs (vs, x) [] = xs @ [(vs, x)]
157 | col xs (vs, x) ((v', x') :: vxs') =
158 if x = x' then col xs (vs @ [v'], x') vxs'
159 else col (xs @ [(vs, x)]) ([v'], x') vxs';
160 in col [] ([v], x) vxs end
161 | coll_variants _ = raise ERROR "coll_variants: called with []";
163 fun replace_0 vm [0] = intsto vm
164 | replace_0 _ vs = vs;
166 fun add_id [] = raise ERROR "O_Model.add_id []"
170 | add n (x :: xs) = (n, x) :: add (n + 1) xs;
173 fun flattup (a, (b, (c, d, e))) = (a, b, c, d, e);
180 |> TermC.parseNEW'' thy
181 |> Input_Descript.split
182 |> add_field thy pbt) fmz)
184 val maxv = model |> map fst |> max;
185 val maxv = if maxv = 0 then 1 else maxv;
188 |> map (replace_0 maxv |> apfst)
194 (** get the values **)
196 fun mkval _(*dsc*) [] = raise ERROR "mkval called with []"
198 | mkval _ ts = TermC.list2isalist ((type_of o hd) ts) ts;
199 fun mkval' x = mkval TermC.empty x;
200 (*TODO: unify with values'*)
201 fun values (oris:T) =
202 ((map (mkval' o (#5))) o (filter ((member_swap op= 1) o (#2)))) oris
205 (** complete wrt. Model_Pattern.T by use of root's O_Model.T **)
207 fun complete_for m_patt root_model (o_model, ctxt) =
209 val missing = m_patt |> filter_out
210 (fn (_, (descriptor, _)) => (member op = (map #4 o_model) descriptor))
211 val add = (root_model
213 (fn (_, _, _, descriptor, _) => (member op = (map (fst o snd) missing)) descriptor))
216 |> map (fn (a, b, _, descr, e) =>
217 case Model_Pattern.get_field descr m_patt of
218 SOME m_field => (a, b, m_field, descr, e)
219 | NONE => (a, b, "#undef", descr, e))
220 |> map (fn (_, b, c, d, e) => (b, c, d, e)) (* for correct enumeration *)
221 |> add_id (* for correct enumeration *)
222 |> map (fn (a, (b, c, d, e)) => (a, b, c, d, e)), (* for correct enumeration *)
223 ctxt |> ContextC.add_constraints (add |> values |> TermC.vars'))
229 (* make oris from args of the stac SubProblem and from pbt.
230 can this formal argument (of a model-pattern) be omitted in the arg-list
231 of a SubProblem ? see calcelems.sml 'type met ' *)
232 fun is_copy_named_idstr str =
233 case (rev o Symbol.explode) str of
234 "'" :: _ :: "'" :: _ => true
236 fun is_copy_named (_, (_, t)) = (is_copy_named_idstr o TermC.free2str) t
238 (* should this formal argument (of a model-pattern) create a new identifier? *)
239 fun is_copy_named_generating_idstr str =
240 if is_copy_named_idstr str
242 case (rev o Symbol.explode) str of
243 "'" :: "'" :: "'" :: _ => false
246 fun is_copy_named_generating (_, (_, t)) = (is_copy_named_generating_idstr o TermC.free2str) t
248 (* generate a new variable "x_i" name from a related given one "x"
249 by use of oris relating "v_v'i'" (is_copy_named!) to "v_v"
250 e.g. (v_v, x) & (v_v'i', ?) --> (v_v'i', x_i),
251 but leave is_copy_named_generating as is, e.t. ss''' *)
252 fun cpy_nam pbt oris (p as (field, (dsc, t))) =
253 (if is_copy_named_generating p
254 then (*WN051014 kept strange old code ...*)
255 let fun sel (_,_,d,ts) = Input_Descript.join'''' (d, ts)
256 val cy' = (implode o (drop_last_n 3) o Symbol.explode o TermC.free2str) t
257 val ext = (last_elem o drop_last o Symbol.explode o TermC.free2str) t
258 val vars' = map (Term.term_name o snd o snd) pbt (*cpy-nam filtered_out*)
259 val vals = map sel oris
260 val cy_ext = (Term.term_name o the) (assoc (vars' ~~ vals, cy')) ^ "_" ^ ext
261 in ([1], field, dsc, [TermC.mk_free (type_of t) cy_ext]) end
262 else ([1], field, dsc, [t])
263 ) handle _ => raise ERROR ("cpy_nam: for "^ UnparseC.term t)
265 (* ["BOOL (1+x=2)", "REAL x"] --match_ags--> oris
266 --values'--> ["equality (1+x=2)", "boundVariable x", "solutions L"] *)
267 (*TODO: unify with values*)
269 let fun ori2fmz_vals (_, _, _, dsc, ts) =
270 ((UnparseC.term o Input_Descript.join') (dsc, ts), last_elem ts)
271 handle _ => raise ERROR ("ori2fmz_env called with " ^ UnparseC.terms ts)
272 in (split_list o (map ori2fmz_vals)) oris end
275 (** tools for I_Model **)
277 fun seek_oridts ctxt m_field (descript, vals) [] =
278 ("seek_oridts: input ('" ^
279 (UnparseC.term_in_ctxt ctxt (Input_Descript.join (descript, vals))) ^
280 "') not found in oris (typed)", (0, [], m_field, descript, vals), [])
281 | seek_oridts ctxt sel (d, ts) ((id, vat, sel', d', ts') :: oris) =
282 if sel = sel' andalso d = d' andalso (inter op = ts ts') <> []
283 then ("", (id, vat, sel, d, inter op = ts ts'), ts')
284 else seek_oridts ctxt sel (d, ts) oris
286 (* to an input (_ $ values) find the according O_Model.single and insert the values *)
287 fun seek_orits ctxt _ vals [] =
288 ("seek_orits: input (_, '" ^ strs2str (map (UnparseC.term_in_ctxt ctxt) vals) ^
289 "') not found in oris (typed)", single_empty, [])
290 | seek_orits ctxt m_field vals ((id, vat, m_field', descr, vals') :: oris) =
291 if m_field = m_field' andalso (inter op = vals vals') <> []
293 if m_field = m_field'
294 then ("", (id, vat, m_field, descr, inter op = vals vals'), vals')
295 else ((strs2str' o map (UnparseC.term_in_ctxt ctxt)) vals ^
296 " not for " ^ m_field, single_empty, [])
297 else seek_orits ctxt m_field vals oris
299 fun test_types ctxt (d,ts) =
301 val opt = (try Input_Descript.join) (d, ts)
302 val msg = case opt of
304 | NONE => (UnparseC.term_in_ctxt ctxt d ^ " " ^
305 (strs2str' o map (UnparseC.term_in_ctxt ctxt)) ts ^ " is illtyped")
308 (* make a term 'typeless' for comparing with another 'typeless' term;
309 'type-less' usually is illtyped *)
310 fun typeless (Const (s, _)) = (Const (s, TermC.typ_empty))
311 | typeless (Free (s, _)) = (Free (s, TermC.typ_empty))
312 | typeless (Var (n, _)) = (Var (n, TermC.typ_empty))
313 | typeless (Bound i) = (Bound i)
314 | typeless (Abs (s, _,t)) = Abs(s, TermC.typ_empty, typeless t)
315 | typeless (t1 $ t2) = (typeless t1) $ (typeless t2)
317 (* is the term t input (or taken from fmz) known in O_Model ?
318 give feedback on all(?) strange input;
319 return _all_ terms already input to this item (e.g. valuesFor a,b) *)
320 fun is_known ctxt sel ori t =
322 val ots = ((distinct op =) o flat o (map #5)) ori
323 val oids = ((map (fst o dest_Free)) o (distinct op =) o flat o (map TermC.vars)) ots
324 val (d, ts) = Input_Descript.split t
325 val ids = map (fst o dest_Free) (((distinct op =) o (flat o (map TermC.vars))) ts)
327 if (subtract op = oids ids) <> []
328 then ("identifiers " ^ strs2str' (subtract op = oids ids) ^ " not in example", single_empty, [])
332 if not (subset op = (map typeless ts, map typeless ots))
333 then ("terms '" ^ (strs2str' o (map (UnparseC.term_in_ctxt ctxt))) ts ^
334 "' not in example (typeless)", single_empty, [])
336 (case seek_orits ctxt sel ts(*..values*) ori of
337 ("", ori_ as (_, _, _, d, ts), all) =>
338 (case test_types ctxt (d,ts) of
339 "" => ("", ori_, all)
340 | msg => (msg, single_empty, []))
341 | (msg, _, _) => (msg, single_empty, []))
343 if member op = (map #4 ori) d
344 then seek_oridts ctxt sel (d, ts) ori
345 else (UnparseC.term_in_ctxt ctxt d ^ " not in example", (0, [], sel, d, ts), [])