1 (* Title: Specify/specify-step.sml
3 (c) due to copyright terms
5 Code for the specify-phase in analogy to structure Solve_Step for the solve-phase.
8 signature SPECIFY_STEP =
10 val check: Tactic.input -> Calc.T -> Applicable.T
11 val add: Tactic.T -> Istate_Def.T * Proof.context -> Calc.T -> Test_Out.T
13 val complete_for: MethodC.id -> Calc.T -> O_Model.T * Proof.context * I_Model.T
17 structure Specify_Step(**): SPECIFY_STEP(**) =
21 fun complete_for mID (ctree, pos) =
23 val {origin = (o_model, o_refs, _), spec = refs, probl = i_prob, ctxt,
24 ...} = Calc.specify_data (ctree, pos);
25 val (dI, _, _) = References.select_input o_refs refs;
26 val {ppc = m_patt, pre, prls, ...} = MethodC.from_store mID
27 val {origin = (root_model, _, _), ...} = Calc.specify_data (ctree, ([], Pos.Und))
28 val (o_model', ctxt') = O_Model.complete_for m_patt root_model (o_model, ctxt)
29 val thy = ThyC.get_theory dI
30 val (_, (i_model, _)) = M_Match.match_itms_oris thy i_prob (m_patt, pre, prls) o_model';
32 (o_model', ctxt', i_model)
36 check tactics (input by the user, mostly) for applicability
37 and determine as much of the result of the tactic as possible initially.
39 fun check (Tactic.Add_Find ct') _ = Applicable.Yes (Tactic.Add_Find' (ct', [(*filled later*)]))
40 (*Add_.. should reject (dsc //) (see fmz=[] in sqrt*)
41 | check (Tactic.Add_Given ct') _ = Applicable.Yes (Tactic.Add_Given' (ct', [(*filled later*)]))
42 | check (Tactic.Add_Relation ct') _ = Applicable.Yes (Tactic.Add_Relation' (ct', [(*filled later*)]))
43 (*required for corner cases, e.g. test setup in inssort.sml*)
44 | check (Tactic.Del_Find ct') _ = Applicable.Yes (Tactic.Del_Find' ct')
45 | check (Tactic.Del_Given ct') _ = Applicable.Yes (Tactic.Del_Given' ct')
46 | check (Tactic.Del_Relation ct') _ = Applicable.Yes (Tactic.Del_Relation' ct')
47 | check Tactic.Model_Problem (pt, (p, _)) =
49 val pI' = case Ctree.get_obj I pt p of
50 Ctree.PblObj {origin = (_, (_, pI', _),_), ...} => pI'
51 | _ => raise ERROR "Specify_Step.check Model_Problem: uncovered case Ctree.get_obj"
52 val {ppc, ...} = Problem.from_store pI'
53 val pbl = I_Model.init ppc
54 in Applicable.Yes (Tactic.Model_Problem' (pI', pbl, [])) end
55 | check (Tactic.Refine_Problem pI) (pt, (p, _)) =
57 val (dI, dI', itms) = case Ctree.get_obj I pt p of
58 Ctree.PblObj {origin= (_, (dI, _, _), _), spec= (dI', _, _), probl = itms, ...}
60 | _ => raise ERROR "Specify_Step.check Refine_Problem: uncovered case Ctree.get_obj"
61 val thy = if dI' = ThyC.id_empty then dI else dI';
63 case Refine.problem (ThyC.get_theory thy) pI itms of
64 NONE => Applicable.No (Tactic.input_to_string (Tactic.Refine_Problem pI) ^ " not applicable")
65 | SOME (rf as (pI', _)) =>
67 then Applicable.No (Tactic.input_to_string (Tactic.Refine_Problem pI) ^ " not applicable")
68 else Applicable.Yes (Tactic.Refine_Problem' rf)
70 | check (Tactic.Refine_Tacitly pI) (pt, (p, _)) =
72 val oris = case Ctree.get_obj I pt p of
73 Ctree.PblObj {origin = (oris, _, _), ...} => oris
74 | _ => raise ERROR "Specify_Step.check Refine_Tacitly: uncovered case Ctree.get_obj"
76 case Refine.refine_ori oris pI of
78 Applicable.Yes (Tactic.Refine_Tacitly' (pI, pblID, ThyC.id_empty, MethodC.id_empty, [(*filled later*)]))
79 | NONE => Applicable.No (Tactic.input_to_string (Tactic.Refine_Tacitly pI) ^ " not applicable")
81 | check (Tactic.Specify_Method mID) (ctree, pos) =
83 val (o_model, _, i_model) = complete_for mID (ctree, pos)
85 Applicable.Yes (Tactic.Specify_Method' (mID, o_model, i_model))
87 | check (Tactic.Specify_Problem pID) (pt, (p, _)) =
89 val (oris, dI, pI, dI', pI', itms) = case Ctree.get_obj I pt p of
90 Ctree.PblObj {origin = (oris, (dI, pI, _), _), spec = (dI', pI', _), probl = itms, ...}
91 => (oris, dI, pI, dI', pI', itms)
92 | _ => raise ERROR "Specify_Step.check Specify_Problem: uncovered case Ctree.get_obj"
93 val thy = ThyC.get_theory (if dI' = ThyC.id_empty then dI else dI');
94 val {ppc, where_, prls, ...} = Problem.from_store pID;
95 val pbl = if pI' = Problem.id_empty andalso pI = Problem.id_empty
96 then (false, (I_Model.init ppc, []))
97 else M_Match.match_itms_oris thy itms (ppc, where_, prls) oris;
99 Applicable.Yes (Tactic.Specify_Problem' (pID, pbl))
101 | check (Tactic.Specify_Theory dI)_ = Applicable.Yes (Tactic.Specify_Theory' dI)
102 | check Tactic.Empty_Tac _ = Applicable.No "Empty_Tac is not applicable"
103 | check tac (_, pos) =
104 raise ERROR ("Specify_Step.check called for " ^ Tactic.input_to_string tac ^ " at" ^ Pos.pos'2str pos);
106 (* exceed line length, because result type will change *)
107 fun add (Tactic.Model_Problem' (_, itms, met)) (_, ctxt) (pt, pos as (p, _)) =
109 val pt = Ctree.update_pbl pt p itms
110 val pt = Ctree.update_met pt p met
112 (pos, [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []), pt)
114 | add (Tactic.Add_Given' (_, itmlist)) (_, ctxt) (pt, pos as (p, p_)) =
115 (pos, [], Test_Out.PpcKF (Test_Out.Upblmet,P_Model.from (Proof_Context.theory_of ctxt) [][]),
117 Pos.Pbl => Ctree.update_pbl pt p itmlist
118 | Pos.Met => Ctree.update_met pt p itmlist
119 | _ => raise ERROR ("uncovered case " ^ Pos.pos_2str p_))
120 | add (Tactic.Add_Find' (_, itmlist)) (_, ctxt) (pt, pos as (p, p_)) =
121 (pos, [], (Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] [])),
123 Pos.Pbl => Ctree.update_pbl pt p itmlist
124 | Pos.Met => Ctree.update_met pt p itmlist
125 | _ => raise ERROR ("uncovered case " ^ Pos.pos_2str p_))
126 | add (Tactic.Add_Relation' (_, itmlist)) (_, ctxt) (pt, pos as (p, p_)) =
127 (pos, [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []),
129 Pos.Pbl => Ctree.update_pbl pt p itmlist
130 | Pos.Met => Ctree.update_met pt p itmlist
131 | _ => raise ERROR ("uncovered case " ^ Pos.pos_2str p_))
132 | add (Tactic.Specify_Theory' domID) (_, ctxt) (pt, pos as (p,_)) =
133 (pos, [] , Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []),
134 Ctree.update_domID pt p domID)
135 | add (Tactic.Specify_Problem' (pI, (_, (itms, _)))) (_, ctxt) (pt, (p, _)) =
137 val pt = Ctree.update_pbl pt p itms
138 val pt = Ctree.update_pblID pt p pI
140 ((p, Pos.Pbl), [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []), pt)
142 | add (Tactic.Specify_Method' (mID, oris, itms)) (_, ctxt) (pt, (p, _)) =
144 val pt = Ctree.update_oris pt p oris
145 val pt = Ctree.update_met pt p itms
146 val pt = Ctree.update_metID pt p mID
148 ((p, Pos.Met), [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []), pt)
150 | add (Tactic.Refine_Tacitly' (_, pIre, domID, metID, pbl)) (_, ctxt) (pt, pos as (p, _)) =
152 val pt = Ctree.update_pbl pt p pbl
153 val pt = Ctree.update_orispec pt p (domID, pIre, metID)
155 (pos, [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []), pt)
157 | add (Tactic.Refine_Problem' (pI, _)) (_, ctxt) (pt, pos as (p, _)) =
159 val (dI, _, mI) = Ctree.get_obj Ctree.g_spec pt p
160 val pt = Ctree.update_spec pt p (dI, pI, mI)
162 (pos, [], Test_Out.PpcKF (Test_Out.Upblmet, P_Model.from (Proof_Context.theory_of ctxt) [] []), pt)
164 | add (Tactic.Begin_Trans' t) l (pt, (p, Frm)) =
166 val (pt, c) = Ctree.cappend_form pt p l t
167 val pt = Ctree.update_branch pt p Ctree.TransitiveB
168 val p = (Pos.lev_on o Pos.lev_dn (* starts with [...,0] *)) p
169 val (pt, c') = Ctree.cappend_form pt p l t
171 ((p, Frm), c @ c', Test_Out.FormKF (UnparseC.term t), pt)
173 | add (Tactic.End_Trans' tasm) l (pt, (p, _)) = (* used at all ? *)
175 val p' = Pos.lev_up p
176 val (pt, c) = Ctree.append_result pt p' l tasm Ctree.Complete
178 ((p', Pos.Res), c, Test_Out.FormKF "DUMMY" (*term2str t ..ERROR (t) has not been declared*), pt)
180 | add m' _ (_, pos) =
181 raise ERROR ("Specify_Step.add: not impl.for " ^ Tactic.string_of m' ^ " at " ^ Pos.pos'2str pos)