Loading theory "InformationFlowSlicing_Inter.NonInterferenceInter" (required by "InformationFlowSlicing_Inter.LiftingInter") locale NonInterferenceInterGraph fixes sourcenode :: "'edge \ 'node" and targetnode :: "'edge \ 'node" and kind :: "'edge \ ('var, 'val, 'ret, 'pname) edge_kind" and valid_edge :: "'edge \ bool" and Entry :: "'node" ("'('_Entry'_')") and get_proc :: "'node \ 'pname" and get_return_edges :: "'edge \ 'edge set" and procs :: "('pname \ 'var list \ 'var list) list" and Main :: "'pname" and Exit :: "'node" ("'('_Exit'_')") and Def :: "'node \ 'var set" and Use :: "'node \ 'var set" and ParamDefs :: "'node \ 'var list" and ParamUses :: "'node \ 'var set list" and H :: "'var set" and L :: "'var set" and High :: "'node" ("'('_High'_')") and Low :: "'node" ("'('_Low'_')") assumes "NonInterferenceInterGraph sourcenode targetnode kind valid_edge (_Entry_) get_proc get_return_edges procs Main (_Exit_) Def Use ParamDefs ParamUses H L (_High_) (_Low_)" ### Ambiguous input (line 119 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a') ("_position" as')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.list.Cons" ("_position" a') ("_position" as'))) ### ("\<^const>local.path" ("\<^fixed>High") ("_position" as') ### ("\<^const>HOL.conj" ("_position" n) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a') ("_position" as')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.list.Cons" ("_position" a') ("_position" as'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.path" ("\<^fixed>High") ("_position" as') ### ("_position" n)) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" a') ("_position" as')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.list.Cons" ("_position" a') ("_position" as'))) ### ("\<^const>HOL.eq" ### ("\<^const>local.path" ("\<^fixed>High") ("_position" as') ### ("\<^const>HOL.conj" ("_position" n) ### ("_applC" ("_position" kind) ("_position" a')))) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 198 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry"))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry")))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 144 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.append" ("_position" as') ### ("_list" ("_position" a')))) ### ("\<^const>local.path" ("_position" n) ("_position" as') ### ("\<^const>HOL.conj" ("\<^fixed>Low") ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.append" ("_position" as') ### ("_list" ("_position" a')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.path" ("_position" n) ("_position" as') ### ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" as') ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" as) ### ("\<^const>List.append" ("_position" as') ### ("_list" ("_position" a')))) ### ("\<^const>HOL.eq" ### ("\<^const>local.path" ("_position" n) ("_position" as') ### ("\<^const>HOL.conj" ("\<^fixed>Low") ### ("_applC" ("_position" kind) ("_position" a')))) ### ("\<^const>BasicDefs.edge_kind.PredicateEdge" ### ("_lambda" ("_position" s) ("_position" True))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 263 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry"))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" hd) ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" hd) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry")))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" hd) ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" hd) ### ("_cargs" ("_position" s') ("_position" V)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 287 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 4 parse trees: ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1077 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 201 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry"))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry")))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 204 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("\<^const>local.notin_SDG_Def" ("_position" V) ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" sourcenodes) ("_position" as)) ### ("_position" V)) ### ("_position" n''))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("_applC" ("_position" parent_node) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" n'') ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as)))) ### ("_position" V)) ### ("_position" n'')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("_applC" ("_position" valid_SDG_node) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ("_position" n'') ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V)) ### ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V)) ### ("_position" n'')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V))) ### ("_position" n''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as)))) ### ("_position" V)) ### ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))) ### ("_position" V)) ### ("_position" n'')))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 249 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("\<^const>local.notin_SDG_Def" ("_position" V) ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" sourcenodes) ("_position" as)) ### ("_position" V)) ### ("_position" n''))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("_applC" ("_position" parent_node) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" n'') ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as)))) ### ("_position" V)) ### ("_position" n'')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("_applC" ("_position" valid_SDG_node) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ("_position" n'') ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V)) ### ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V)) ### ("_position" n'')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))))) ### ("_position" V))) ### ("_position" n''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as)))) ### ("_position" V)) ### ("_position" n''))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" n'') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_SDG_node) ("_position" n'')) ### ("\<^const>Set.member" ### ("_applC" ("_position" parent_node) ("_position" n'')) ### ("\<^const>local.notin_SDG_Def" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" set) ### ("_applC" ("_position" sourcenodes) ("_position" as))) ### ("_position" V)) ### ("_position" n'')))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 265 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry"))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry")))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 309 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 312 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 328 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 329 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 334 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 4 parse trees: ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" a) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" a)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" a) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" a)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" a) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" a)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ("_position" cs) ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ("_position" cs) ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" a) ### ("_applC" ("_position" set) ("_position" cs)) ### ("_applC" ("_position" valid_edge) ("_position" a)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ("_position" cs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("_position" cs))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 344 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 516 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 4 parse trees: ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ### ("_position" a) ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ### ("_position" a) ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)) ### ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ### ("_position" a) ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### ("\<^const>Pure.all_binder" ### ("_idts" ("_position" m) ### ("_idts" ("_position" as') ("_idts" ("_position" s) ("_position" s')))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" upd_cs) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as))) ### ("\<^const>List.list.Nil"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" same_level_path_aux) ### ("_cargs" ### ("\<^const>List.list.Cons" ("_position" a) ("_position" cs)) ### ("_position" as')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" c) ### ("_applC" ("_position" set) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_applC" ("_position" valid_edge) ("_position" c)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as) ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.path" ("_position" m) ("_position" as') ### ("\<^fixed>Low"))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs))) ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)) ### ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s) ### ("_position" i))) ### ("_applC" ("_position" snd) ### ("\<^const>List.nth" ("_position" s') ### ("_position" i)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ### ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s)))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" preds) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ### ("_position" as'))) ### ("_position" s')))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s)) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ("_position" a) ### ("_position" cs)))))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" s')) ### ("_applC" ("_position" Suc) ### ("_applC" ("_position" length) ### ("\<^const>List.list.Cons" ### ("_position" a) ("_position" cs)))))))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as))) ### ("_position" s))) ### ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ### ("_applC" ("_position" transfers) ### ("_cargs" ### ("_applC" ("_position" slice_kinds) ### ("_cargs" ("_position" S) ("_position" as'))) ### ("_position" s'))) ### ("_position" V)))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 527 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ("_position" i))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### ("\<^const>HOL.Trueprop" ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cs)) ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ### ("\<^const>List.nth" ("_position" cs) ("_position" i)))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s) ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))) ### ("_applC" ("_position" fst) ### ("_cargs" ### ("\<^const>List.nth" ("_position" s') ### ("_applC" ("_position" Suc) ("_position" i))) ### ("_position" V))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 565 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 574 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 577 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 592 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 593 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("_lambda" ("_position" cf) ("_position" False))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("_lambda" ("_position" cf) ("_position" False)) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 602 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q')) ### ("_position" p') ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p') ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 602 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 610 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 611 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("_lambda" ("_position" cf) ("_position" False))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("_lambda" ("_position" cf) ("_position" False)) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 616 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 623 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 631 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ("_position" a)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ### ("_applC" ("_position" sourcenode) ("_position" a))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 633 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s) ("_position" V))) ### ("_applC" ("_position" state_val) ### ("_cargs" ("_position" s') ("_position" V)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 638 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 639 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. locale NonInterferenceInter fixes sourcenode :: "'edge \ 'node" and targetnode :: "'edge \ 'node" and kind :: "'edge \ ('var, 'val, 'ret, 'pname) edge_kind" and valid_edge :: "'edge \ bool" and Entry :: "'node" ("'('_Entry'_')") and get_proc :: "'node \ 'pname" and get_return_edges :: "'edge \ 'edge set" and procs :: "('pname \ 'var list \ 'var list) list" and Main :: "'pname" and Exit :: "'node" ("'('_Exit'_')") and Def :: "'node \ 'var set" and Use :: "'node \ 'var set" and ParamDefs :: "'node \ 'var list" and ParamUses :: "'node \ 'var set list" and sem :: "'com \ ('var \ 'val option) list \ 'com \ ('var \ 'val option) list \ bool" ("((1\_,/_\) \/ (1\_,/_\))" [0, 0, 0, 0] 81) and identifies :: "'node \ 'com \ bool" ("_ \ _" [51, 0] 80) and H :: "'var set" and L :: "'var set" and High :: "'node" ("'('_High'_')") and Low :: "'node" ("'('_Low'_')") and final :: "'com \ bool" assumes "NonInterferenceInter sourcenode targetnode kind valid_edge (_Entry_) get_proc get_return_edges procs Main (_Exit_) Def Use ParamDefs ParamUses sem identifies H L (_High_) (_Low_) final" ### theory "InformationFlowSlicing_Inter.NonInterferenceInter" ### 4.374s elapsed time, 6.524s cpu time, 0.156s GC time Loading theory "InformationFlowSlicing_Inter.LiftingInter" ### Ambiguous input (line 643 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 644 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 647 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 649 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 650 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("_position" Q)) ### ("_position" r) ("_position" p) ### ("_applC" ("_position" cspp) ### ("_cargs" ("_applC" ("_position" targetnode) ("_position" a)) ### ("_cargs" ("_applC" ("_position" HRB_slice) ("_position" S)) ### ("_position" fs)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" slice_kind) ### ("_cargs" ("_position" S) ("_position" a))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ### ("_applC" ("_position" cspp) ### ("_cargs" ("_applC" ("_position" targetnode) ("_position" a)) ### ("_cargs" ("_applC" ("_position" HRB_slice) ("_position" S)) ### ("_position" fs))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 658 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 660 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Proofs for inductive predicate(s) "lift_valid_edge" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 670 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 674 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Found termination order: "{}" Proofs for inductive predicate(s) "lift_get_return_edgesp" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... *** Type unification failed: Clash of types "_ set" and "_ \ _" *** *** Type error in application: incompatible operand type *** *** Operator: (=) (csppa (targetnode a) (HRB_slice S) 0 fs ! i) :: *** (('var \ 'val option) \ 'val option) *** \ bool *** Operand: {} :: ??'a set *** *** At command "have" (line 702 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") ### Ambiguous input (line 1096 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1098 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Proofs for inductive predicate(s) "lift_Def_setp" ### Ambiguous input (line 1115 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 1116 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m)))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ("_applC" ("_position" Use) ("\<^fixed>Low")) ### ("\<^const>Set.member" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Proofs for inductive predicate(s) "lift_Use_setp" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 1165 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("_position" m))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("_position" m)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Found termination order: "{}" Found termination order: "{}" ### Ambiguous input (line 1205 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("_applC" ("\<^const>local.relevant_vars" ("_position" S)) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry"))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" V) ### ("\<^const>local.relevant_vars" ### ("_applC" ("_position" S) ### ("_applC" ("_position" CFG_node) ("\<^fixed>Entry")))) ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" V)) ### ("_applC" ("_position" cf') ("_position" V))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### theory "InformationFlowSlicing_Inter.LiftingInter" ### 2.023s elapsed time, 3.964s cpu time, 0.288s GC time ### Ambiguous input (line 175 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 189 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" Main) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" Main) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 194 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" Main) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" Main) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 199 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 211 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 217 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 223 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 224 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 228 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 229 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" targetnode) ("_position" a')) ### ("_applC" ("_position" targetnode) ("_position" ax)))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Qx) ### ("_position" rx) ("_position" p) ("_position" fsx))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" targetnode) ("_position" a')) ### ("_applC" ("_position" targetnode) ("_position" ax)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Qx))) ### ("_position" rx) ("_position" p) ("_position" fsx))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" targetnode) ("_position" a')) ### ("_applC" ("_position" targetnode) ("_position" ax)))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Qx)) ### ("_position" rx) ("_position" p) ("_position" fsx)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 235 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx))) ### ("_position" rx) ("_position" p) ("_position" fsx))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx)) ### ("_position" rx) ("_position" p) ("_position" fsx)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Qx) ### ("_position" rx) ("_position" p) ("_position" fsx))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 241 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("_position" Qx))) ### ("_position" rx) ("_position" p) ("_position" fsx))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("_position" Qx)) ### ("_position" rx) ("_position" p) ("_position" fsx)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Qx) ### ("_position" rx) ("_position" p) ("_position" fsx))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 261 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" trg) ("_position" a')) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Qx) ### ("_position" rx) ("_position" p) ("_position" fsx))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" trg) ("_position" a')) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx))) ### ("_position" rx) ("_position" p) ("_position" fsx))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" trg) ("_position" a')) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ### ("_idts" ("_position" rx) ("_position" fsx))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx)) ### ("_position" rx) ("_position" p) ("_position" fsx)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 266 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 267 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 271 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 272 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" sourcenode) ("_position" a')) ### ("_applC" ("_position" sourcenode) ("_position" ax)))) ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Qx) ### ("_position" p) ("_position" fx))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" sourcenode) ("_position" a')) ### ("_applC" ("_position" sourcenode) ("_position" ax)))) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Qx))) ### ("_position" p) ("_position" fx))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" sourcenode) ("_position" a')) ### ("_applC" ("_position" sourcenode) ("_position" ax)))) ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Qx)) ### ("_position" p) ("_position" fx)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 278 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx))) ### ("_position" p) ("_position" fx))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx)) ### ("_position" p) ("_position" fx)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Qx) ### ("_position" p) ("_position" fx))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 284 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("_position" Qx))) ### ("_position" p) ("_position" fx))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("_position" Qx)) ### ("_position" p) ("_position" fx)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Qx) ### ("_position" p) ("_position" fx))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 303 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" src) ("_position" a')) ### ("_applC" ("_position" src) ("_position" a)))) ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Qx) ### ("_position" p) ("_position" fx))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" src) ("_position" a')) ### ("_applC" ("_position" src) ("_position" a)))) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx))) ### ("_position" p) ("_position" fx))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" a') ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.eq" ("_applC" ("_position" src) ("_position" a')) ### ("_applC" ("_position" src) ("_position" a)))) ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Qx) ("_position" fx)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Qx)) ### ("_position" p) ("_position" fx)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 308 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 314 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 315 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 337 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 339 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 340 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 346 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 346 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q')) ### ("_position" Main) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" Main) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 358 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 362 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ### ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_idts" ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 370 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 372 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q'))) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q')) ### ("_position" p) ("_position" f')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f'))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 376 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 377 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 378 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q'))) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q')) ### ("_position" p) ("_position" f')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ("_idts" ("_position" Q') ("_position" f')) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f'))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 386 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 387 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" lift_get_return_edges) ### ("_cargs" ("_position" get_return_edges) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ("_position" a')))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.conj" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs)) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" lift_get_return_edges) ### ("_cargs" ("_position" get_return_edges) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ("_position" a')))))))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" lift_valid_edge) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ### ("_cargs" ("_position" Entry) ### ("_cargs" ("_position" Exit) ("_position" a')))))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" lift_get_return_edges) ### ("_cargs" ("_position" get_return_edges) ### ("_cargs" ("_position" valid_edge) ### ("_cargs" ("_position" sourcenode) ### ("_cargs" ("_position" targetnode) ### ("_cargs" ("_position" kind) ("_position" a')))))))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 393 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 393 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 395 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" a'))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs)) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" a'))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ex1" ("_position" a') ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" a')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" a'))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 398 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 400 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" x)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" x))))) ### ("\<^const>HOL.eq" ("_position" x) ("_position" a'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" x)) ### ("\<^const>HOL.conj" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs)) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" x))))) ### ("\<^const>HOL.eq" ("_position" x) ("_position" a'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" valid_edge) ("_position" x)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ### ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>Set.member" ("_position" a) ### ("_applC" ("_position" get_return_edges) ("_position" x))))) ### ("\<^const>HOL.eq" ("_position" x) ("_position" a'))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 407 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 414 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 414 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" ?e')) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" ?e')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 423 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 427 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 444 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 444 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q))) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" Q) ("_idts" ("_position" r) ("_position" fs))) ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ### ("_position" r) ("_position" p) ("_position" fs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ignoring duplicate introduction (intro) ### \?P ?a; \x. ?P x \ x = ?a\ ### \ \!x. ?P x ### Ambiguous input (line 716 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 720 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 721 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 752 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 757 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 497 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 758 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 502 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" ax)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 519 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 524 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 525 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 536 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 789 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 793 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 794 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 795 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 804 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ignoring duplicate introduction (intro) ### \?P ?a; \x. ?P x \ x = ?a\ ### \ \!x. ?P x ### Ambiguous input (line 812 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 813 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 589 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 819 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 594 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 595 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 606 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 854 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 858 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 859 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 860 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ignoring duplicate introduction (intro) ### \?P ?a; \x. ?P x \ x = ?a\ ### \ \!x. ?P x ### Ambiguous input (line 660 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q\<^sub>1)) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>1) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 660 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q\<^sub>2)) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>2) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 665 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q\<^sub>1)) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>1) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 665 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q\<^sub>2)) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>2) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 666 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q\<^sub>1)) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>1) ### ("_position" r\<^sub>1) ("_position" p) ("_position" fs\<^sub>1)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 666 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("_position" Q\<^sub>2)) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q\<^sub>2) ### ("_position" r\<^sub>2) ("_position" p) ("_position" fs\<^sub>2)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1024 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1028 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1029 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1030 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1036 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1036 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q')) ### ("_position" r') ("_position" p') ("_position" fs'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q') ### ("_position" r') ("_position" p') ("_position" fs')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1040 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1043 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1046 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q')) ### ("_position" r') ("_position" p') ("_position" fs'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q') ### ("_position" r') ("_position" p') ("_position" fs')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1049 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("_position" Q')) ### ("_position" r') ("_position" p') ("_position" fs'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q') ### ("_position" r') ("_position" p') ("_position" fs')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1054 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1054 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("_position" Q')) ### ("_position" r') ("_position" p') ("_position" fs'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q') ### ("_position" r') ("_position" p') ("_position" fs')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1061 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1067 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1069 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1075 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1082 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1083 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ("_position" cf'))) ### ("\<^const>BasicDefs.fun_upds" ("_position" cf') ### ("_applC" ("_position" lift_ParamDefs) ### ("_cargs" ("_position" ParamDefs) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ("_position" cf') ("_position" cf')) ### ("_applC" ("_position" lift_ParamDefs) ### ("_cargs" ("_position" ParamDefs) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" f') ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" cf')) ### ("_position" cf')) ### ("_applC" ("_position" lift_ParamDefs) ### ("_cargs" ("_position" ParamDefs) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ("_position" cf'))) ### ("_position" cf')) ### ("_applC" ("_position" lift_ParamDefs) ### ("_cargs" ("_position" ParamDefs) ### ("_applC" ("_position" trg) ("_position" a)))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1086 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" e)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1087 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1088 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q')) ### ("_position" p) ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p) ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1089 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ("_position" cf'))) ### ("\<^const>BasicDefs.fun_upds" ("_position" cf') ### ("_applC" ("_position" ParamDefs) ### ("_applC" ("_position" targetnode) ("_position" a))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ("_position" cf') ("_position" cf')) ### ("_applC" ("_position" ParamDefs) ### ("_applC" ("_position" targetnode) ("_position" a))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" f') ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ("_applC" ("_position" cf) ("_position" cf')) ### ("_position" cf')) ### ("_applC" ("_position" ParamDefs) ### ("_applC" ("_position" targetnode) ("_position" a))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.fun_upds" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" f') ### ("_cargs" ("_position" cf) ("_position" cf'))) ### ("_position" cf')) ### ("_applC" ("_position" ParamDefs) ### ("_applC" ("_position" targetnode) ("_position" a))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" cf) ("_position" outs))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1155 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1842 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1847 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1847 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" Main) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" Main) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1856 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1858 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1865 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1870 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1870 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("_position" Q)) ### ("_position" Main) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" Main) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1878 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("_position" Q')) ### ("_position" p') ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" knd) ("_position" a')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p') ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1880 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("_position" Q')) ### ("_position" p') ("_position" f'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" x')) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q') ### ("_position" p') ("_position" f')))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1370 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1397 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.CallEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" r) ("_position" p) ("_position" fs))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.CallEdge" ("_position" Q) ("_position" r) ### ("_position" p) ("_position" fs)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1424 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1442 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1471 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1496 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ambiguous input (line 1513 of "~~/afp/thys/InformationFlowSlicing_Inter/LiftingInter.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("_position" Q)) ### ("_position" p) ("_position" f))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" kind) ("_position" a)) ### ("\<^const>BasicDefs.edge_kind.ReturnEdge" ("_position" Q) ### ("_position" p) ("_position" f)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. isabelle document -d /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/InformationFlowSlicing_Inter/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/InformationFlowSlicing_Inter/outline -o pdf -n outline -t /proof,/ML *** Type unification failed: Clash of types "_ set" and "_ \ _" *** *** Type error in application: incompatible operand type *** *** Operator: (=) (csppa (targetnode a) (HRB_slice S) 0 fs ! i) :: *** (('var \ 'val option) \ 'val option) *** \ bool *** Operand: {} :: ??'a set *** *** At command "have" (line 702 of "~~/afp/thys/InformationFlowSlicing_Inter/NonInterferenceInter.thy")