Loading theory "Dependent_SIFUM_Type_Systems.Preliminaries" (required by "Dependent_SIFUM_Type_Systems.TypeSystem" via "Dependent_SIFUM_Type_Systems.Compositionality" via "Dependent_SIFUM_Type_Systems.Security") instantiation Sec :: complete_lattice Inf_Sec == Inf :: Sec set \ Sec Sup_Sec == Sup :: Sec set \ Sec bot_Sec == bot :: Sec sup_Sec == sup :: Sec \ Sec \ Sec top_Sec == top :: Sec inf_Sec == inf :: Sec \ Sec \ Sec less_eq_Sec == less_eq :: Sec \ Sec \ bool less_Sec == less :: Sec \ Sec \ bool locale sifum_security_init fixes dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and eval :: "((('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) \ ('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) set" and some_val :: "'Val" and INIT :: "('Var \ 'Val) \ bool" assumes "sifum_security_init dma \_vars eval" defines "\ \ \x. \_vars x" locale sifum_security fixes dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and eval :: "((('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) \ ('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) set" and some_val :: "'Val" assumes "sifum_security dma \_vars eval" defines "\ \ \x. \_vars x" locale sifum_security_init fixes dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and eval :: "((('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) \ ('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) set" and some_val :: "'Val" and INIT :: "('Var \ 'Val) \ bool" assumes "sifum_security_init dma \_vars eval" defines "\ \ \x. \_vars x" ### theory "Dependent_SIFUM_Type_Systems.Preliminaries" ### 1.493s elapsed time, 1.980s cpu time, 0.000s GC time Loading theory "Dependent_SIFUM_Type_Systems.Language" (required by "Dependent_SIFUM_Type_Systems.TypeSystem") ### Metis: Falling back on "metis (full_types)"... Loading theory "Dependent_SIFUM_Type_Systems.Security" (required by "Dependent_SIFUM_Type_Systems.TypeSystem" via "Dependent_SIFUM_Type_Systems.Compositionality") locale sifum_security_init fixes dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and eval :: "((('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) \ ('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) set" and some_val :: "'Val" and INIT :: "('Var \ 'Val) \ bool" assumes "sifum_security_init dma \_vars eval" defines "\ \ \x. \_vars x" Proofs for inductive predicate(s) "mevalp" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "neval" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Found termination order: "{}" ### Ambiguous input (line 106 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Security.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("\<^const>List.list.Cons" ("_position" n) ("_position" ns)) ### ("_cargs" ("_position" c) ("_position" c')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.Ex_binder" ("_position" c'') ("_position" c)) ### ("_position" n) ("_position" c'')) ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("_position" ns) ### ("_cargs" ("_position" c'') ("_position" c'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("\<^const>List.list.Cons" ("_position" n) ("_position" ns)) ### ("_cargs" ("_position" c) ("_position" c')))) ### ("\<^const>HOL.Ex_binder" ("_position" c'') ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ("_position" c) ("_position" n) ### ("_position" c'')) ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("_position" ns) ### ("_cargs" ("_position" c'') ("_position" c')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("\<^const>List.list.Cons" ("_position" n) ("_position" ns)) ### ("_cargs" ("_position" c) ("_position" c')))) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.Ex_binder" ("_position" c'') ("_position" c)) ### ("_position" n) ### ("\<^const>HOL.conj" ("_position" c'') ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("_position" ns) ### ("_cargs" ("_position" c'') ("_position" c')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("\<^const>List.list.Cons" ("_position" n) ("_position" ns)) ### ("_cargs" ("_position" c) ("_position" c')))) ### ("\<^const>HOL.Ex_binder" ("_position" c'') ### ("\<^const>local.meval_abv" ("_position" c) ("_position" n) ### ("\<^const>HOL.conj" ("_position" c'') ### ("_applC" ("_position" meval_sched) ### ("_cargs" ("_position" ns) ### ("_cargs" ("_position" c'') ("_position" c'))))))))) ### 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: "(\p. size_list size (fst p)) <*mlex*> {}" Proofs for inductive predicate(s) "mm_equivp" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 217 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Security.thy") produces 48 parse trees (10 displayed): ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### 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 230 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Security.thy") produces 144 parse trees (10 displayed): ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.implies" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ### ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" prog_sifum_secure_cont) ("_position" cmds)) ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" INIT) ("_position" mem\<^sub>2)) ### ("\<^const>local.low_eq" ("_position" mem\<^sub>1) ### ("_position" mem\<^sub>2)))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" sched) ### ("_idts" ("_position" cms\<^sub>1') ("_position" mem\<^sub>1'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.All_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.implies" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ### ("_position" cms\<^sub>2')))) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>2'))))) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ### ("_position" cms\<^sub>1') ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))))) ### 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) "loc_reachp" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 389 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Security.thy") produces 6 parse trees: ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("\<^const>local.meval_sched_abv" ("_position" gc) ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem'))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))) ### ("_position" mdss))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("_position" gc)) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem'))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))) ### ("_position" mdss)))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ("_position" gc) ### ("_position" sched) ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))) ### ("_position" mdss)))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("_position" gc)) ### ("_position" sched) ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))) ### ("_position" mdss))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ("_position" gc) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))))) ### ("_position" mdss))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" reachable_mode_states) ("_position" gc)) ### ("_Coll" ("_position" mdss) ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms') ### ("_idts" ("_position" mem') ("_position" sched))) ### ("_position" gc)) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms') ("_tuple_arg" ("_position" mem'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms'))))) ### ("_position" mdss)))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. consts sound_mode_use :: "('Com \ (Mode \ 'Var set)) list \ ('Var \ 'Val) \ bool" ### theory "Dependent_SIFUM_Type_Systems.Security" ### 2.967s elapsed time, 5.868s cpu time, 0.328s GC time Loading theory "Dependent_SIFUM_Type_Systems.Compositionality" (required by "Dependent_SIFUM_Type_Systems.TypeSystem") locale sifum_security_init fixes dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and eval :: "((('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) \ ('Com \ (Mode \ 'Var set)) \ ('Var \ 'Val)) set" and some_val :: "'Val" and INIT :: "('Var \ 'Val) \ bool" assumes "sifum_security_init dma \_vars eval" defines "\ \ \x. \_vars x" Found termination order: "{}" locale sifum_lang_no_dma fixes eval\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and eval\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" assumes "sifum_lang_no_dma eval\<^sub>A eval\<^sub>B aexp_vars bexp_vars" locale sifum_lang fixes eval\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and eval\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "'Var \ Sec" assumes "sifum_lang eval\<^sub>A eval\<^sub>B aexp_vars bexp_vars" locale sifum_lang_no_dma fixes eval\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and eval\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" assumes "sifum_lang_no_dma eval\<^sub>A eval\<^sub>B aexp_vars bexp_vars" consts update_modes :: "'Var ModeUpd \ (Mode \ 'Var set) \ Mode \ 'Var set" Found termination order: "{}" Found termination order: "{}" Proofs for inductive predicate(s) "eval\<^sub>w_simplep" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Found termination order: "{}" consts cxt_to_stmt :: "('Var, 'AExp, 'BExp) Stmt list \ ('Var, 'AExp, 'BExp) Stmt \ ('Var, 'AExp, 'BExp) Stmt" Proofs for inductive predicate(s) "no_await" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 538 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 2 parse trees: ### ("\<^const>Pure.eq" ### ("_applC" ("_position" globally_consistent) ### ("_cargs" ("_position" A) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("_case_syntax" ("_applC" ("_position" A) ("_position" x)) ### ("_case2" ### ("_case1" ### ("_applC" ("_position" Some) ### ("_tuple" ("_position" v) ("_tuple_arg" ("_position" v')))) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.disj" ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_position" v)) ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)) ### ("_position" v'))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x)))))) ### ("_case1" ("\<^const>Pure.dummy_pattern") ("_position" True))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x)))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))))) ### ("\<^const>Pure.eq" ### ("_applC" ("_position" globally_consistent) ### ("_cargs" ("_position" A) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("_case_syntax" ("_applC" ("_position" A) ("_position" x)) ### ("_case2" ### ("_case1" ### ("_applC" ("_position" Some) ### ("_tuple" ("_position" v) ("_tuple_arg" ("_position" v')))) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.disj" ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_position" v)) ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)) ### ("_position" v'))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x)))))) ### ("_case1" ("\<^const>Pure.dummy_pattern") ("_position" True))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x)))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))))) ### 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) "is_final" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "eval\<^sub>wp" ### Ambiguous input (line 573 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" k) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" k) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" k) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" k) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" k) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" k) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### 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 1910 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 24 parse trees (10 displayed): ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("\<^const>HOL.eq" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ### ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ### ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("\<^const>HOL.eq" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("\<^const>HOL.eq" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("\<^const>HOL.eq" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ### ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("\<^const>HOL.eq" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_position" ms)) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" ms) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^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 1921 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 12 parse trees (10 displayed): ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ### ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1)))) ### ("_position" ns) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>1'') ("_position" mem\<^sub>1'')) ### ("\<^const>local.meval_abv" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^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 1927 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 5 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("\<^const>List.append" ("_position" ns) ("_list" ("_position" n))) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^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 1937 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 12 parse trees (10 displayed): ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))))))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))))))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ### ("_idts" ("_position" mem\<^sub>2') ("_position" mems'))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### theory "Dependent_SIFUM_Type_Systems.Compositionality" ### 2.163s elapsed time, 4.288s cpu time, 0.760s GC time ### Ambiguous input (line 200 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Language.thy") produces 4 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" cxt_to_stmt) ### ("_cargs" ("_position" E) ("_position" c))) ### ("\<^const>Language.Stmt.ModeDecl" ("_position" c') ### ("_position" mu)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c) ### ("\<^const>Language.Stmt.ModeDecl" ("_position" c') ### ("_position" mu))) ### ("\<^const>HOL.eq" ("_position" E) ("\<^const>List.list.Nil"))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" cxt_to_stmt) ### ("_cargs" ("_position" E) ("_position" c))) ### ("_position" c')) ### ("_position" mu))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c) ### ("\<^const>Language.Stmt.ModeDecl" ("_position" c') ### ("_position" mu))) ### ("\<^const>HOL.eq" ("_position" E) ("\<^const>List.list.Nil"))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" cxt_to_stmt) ### ("_cargs" ("_position" E) ("_position" c))) ### ("\<^const>Language.Stmt.ModeDecl" ("_position" c') ### ("_position" mu)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ("_position" c) ("_position" c')) ### ("_position" mu)) ### ("\<^const>HOL.eq" ("_position" E) ("\<^const>List.list.Nil"))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" cxt_to_stmt) ### ("_cargs" ("_position" E) ("_position" c))) ### ("_position" c')) ### ("_position" mu))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ("_position" c) ("_position" c')) ### ("_position" mu)) ### ("\<^const>HOL.eq" ("_position" E) ("\<^const>List.list.Nil"))))) ### 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/Dependent_SIFUM_Type_Systems/Language.thy") produces 8 parse trees: ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem))))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem)))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem')))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" eval\<^sub>B) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ("_applC" ("_position" mem) ("_position" b)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem))))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem')))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ("_position" b) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem))))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("_applC" ("_position" no_await) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ("_position" c\<^sub>1) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem)))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" is_final) ("_position" c\<^sub>2)) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem')))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.eval\<^sub>w_abv" ### ("\<^const>local.conf\<^sub>w_abv" ### ("_applC" ("_position" Await) ### ("_cargs" ("_position" b) ("_position" c\<^sub>1))) ### ("_position" mds) ("_position" mem)) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" eval\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" b))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" no_await) ("_position" c\<^sub>1)) ### ("_applC" ("_position" is_final) ### ("\<^const>local.eval\<^sub>w_plus" ### ("\<^const>HOL.conj" ("_position" c\<^sub>2) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>1) ### ("_position" mds) ("_position" mem))) ### ("\<^const>local.conf\<^sub>w_abv" ("_position" c\<^sub>2) ### ("_position" mds') ("_position" mem')))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### theory "Dependent_SIFUM_Type_Systems.Language" ### 5.817s elapsed time, 11.540s cpu time, 1.088s GC time Loading theory "Dependent_SIFUM_Type_Systems.TypeSystem" locale sifum_lang_no_dma fixes eval\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and eval\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" assumes "sifum_lang_no_dma eval\<^sub>A eval\<^sub>B aexp_vars bexp_vars" locale sifum_types fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and bexp_neg :: "'BExp \ 'BExp" and assign_post :: "'BExp set \ 'Var \ 'AExp \ 'BExp set" and dma_type :: "'Var \ 'BExp set" and pred_False :: "'BExp" assumes "sifum_types ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars bexp_neg assign_post dma_type pred_False" defines "\ \ \x. \_vars x" Loading theory "Dependent_SIFUM_Type_Systems.LocallySoundModeUse" locale sifum_types_assign fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and bexp_neg :: "'BExp \ 'BExp" and dma_type :: "'Var \ 'BExp set" and pred_False :: "'BExp" and bexp_assign :: "'Var \ 'AExp \ 'BExp" assumes "sifum_types_assign ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars bexp_neg dma_type pred_False bexp_assign" defines "\ \ \x. \_vars x" locale sifum_lang_no_dma fixes eval\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and eval\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" assumes "sifum_lang_no_dma eval\<^sub>A eval\<^sub>B aexp_vars bexp_vars" ### Ambiguous input (line 163 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.eq" ### ("\<^const>Map.restrict_map" ("_position" P) ("_position" V)) ### ("_Coll" ("_position" e) ### ("\<^const>HOL.conj" ### ("\<^const>Set.member" ("_position" e) ("_position" P)) ### ("\<^const>Set.subset_eq" ### ("_applC" ("_position" bexp_vars) ("_position" e)) ### ("_position" V))))) ### ("\<^const>Pure.eq" ### ("\<^fixed>restrict_preds_to_vars" ("_position" P) ("_position" V)) ### ("_Coll" ("_position" e) ### ("\<^const>HOL.conj" ### ("\<^const>Set.member" ("_position" e) ("_position" P)) ### ("\<^const>Set.subset_eq" ### ("_applC" ("_position" bexp_vars) ("_position" e)) ### ("_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. locale sifum_modes fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" assumes "sifum_modes ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars" defines "\ \ \x. \_vars x" locale sifum_modes fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" assumes "sifum_modes ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars" defines "\ \ \x. \_vars x" locale sifum_types_assign fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and bexp_neg :: "'BExp \ 'BExp" and dma_type :: "'Var \ 'BExp set" and pred_False :: "'BExp" and bexp_assign :: "'Var \ 'AExp \ 'BExp" assumes "sifum_types_assign ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars bexp_neg dma_type pred_False bexp_assign" defines "\ \ \x. \_vars x" Found termination order: "(\p. size_list size (snd p)) <*mlex*> {}" ### Ambiguous input (line 46 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/LocallySoundModeUse.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" annotate) ### ("_cargs" ("_position" c) ### ("\<^const>List.list.Cons" ("_position" a) ("_position" as)))) ### ("\<^const>Language.Stmt.ModeDecl" ### ("_applC" ("_position" annotate) ### ("_cargs" ("_position" c) ("_position" as))) ### ("_position" a)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" annotate) ### ("_cargs" ("_position" c) ### ("\<^const>List.list.Cons" ("_position" a) ("_position" as)))) ### ("_applC" ("_position" annotate) ### ("_cargs" ("_position" c) ("_position" as)))) ### ("_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. Found termination order: "(\p. size_list size (snd p)) <*mlex*> {}" Proofs for inductive predicate(s) "mode_type" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... locale sifum_types fixes ev\<^sub>A :: "('Var \ 'Val) \ 'AExp \ 'Val" and ev\<^sub>B :: "('Var \ 'Val) \ 'BExp \ bool" and aexp_vars :: "'AExp \ 'Var set" and bexp_vars :: "'BExp \ 'Var set" and dma :: "('Var \ 'Val) \ 'Var \ Sec" and \_vars :: "'Var \ 'Var set" and \ :: "'Var set" and bexp_neg :: "'BExp \ 'BExp" and assign_post :: "'BExp set \ 'Var \ 'AExp \ 'BExp set" and dma_type :: "'Var \ 'BExp set" and pred_False :: "'BExp" assumes "sifum_types ev\<^sub>A ev\<^sub>B aexp_vars bexp_vars dma \_vars bexp_neg assign_post dma_type pred_False" defines "\ \ \x. \_vars x" ### theory "Dependent_SIFUM_Type_Systems.LocallySoundModeUse" ### 2.327s elapsed time, 4.620s cpu time, 0.380s GC time Proofs for inductive predicate(s) "type_aexpr" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "type_bexpr" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Found termination order: "{}" Found termination order: "{}" ### Ambiguous input (line 589 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.eq" ### ("\<^const>local.type_equiv" ("_position" \) ("_position" P) ### ("_position" \')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_applC" ("_position" dom) ("_position" \)) ### ("_applC" ("_position" dom) ("_position" \'))) ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ("_position" \')) ### ("_applC" ("_position" type_equiv) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_cargs" ("_position" P) ### ("_applC" ("_position" the) ### ("_applC" ("_position" \') ("_position" x))))))))) ### ("\<^const>Pure.eq" ### ("\<^fixed>context_equiv" ("_position" \) ("_position" P) ### ("_position" \')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_applC" ("_position" dom) ("_position" \)) ### ("_applC" ("_position" dom) ("_position" \'))) ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ("_position" \')) ### ("_applC" ("_position" type_equiv) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_cargs" ("_position" P) ### ("_applC" ("_position" the) ### ("_applC" ("_position" \') ("_position" x))))))))) ### 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) "has_type" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 127 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_applC" ("_position" fst) ### ("\<^const>Security.sifum_security_init.subst_abv" ### ("\<^const>List.nth" ("_position" mems) ("_position" i)) ### ("_position" \))) ### ("_position" x)) ### ("_applC" ### ("_applC" ("_position" fst) ### ("\<^const>List.nth" ("_position" mems) ("_position" i))) ### ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.sifum_security_init.subst_abv" ### ("_applC" ("_position" fst) ### ("\<^const>List.nth" ("_position" mems) ("_position" i))) ### ("_position" \)) ### ("_position" x)) ### ("_applC" ### ("_applC" ("_position" fst) ### ("\<^const>List.nth" ("_position" mems) ("_position" i))) ### ("_position" x)))) ### 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 131 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_applC" ("_position" fst) ### ("\<^const>Security.sifum_security_init.subst_abv" ### ("\<^const>List.nth" ("_position" mems) ("_position" i)) ### ("_position" \))) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.sifum_security_init.subst_abv" ### ("_applC" ("_position" fst) ### ("\<^const>List.nth" ("_position" mems) ("_position" i))) ### ("_position" \)) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### 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 797 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>Pure.eq" ### ("\<^fixed>tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^fixed>tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>Pure.eq" ### ("\<^fixed>tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>Pure.eq" ### ("\<^fixed>tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^fixed>tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^fixed>tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>Pure.eq" ### ("\<^fixed>tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2)) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^fixed>tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### 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 800 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" x))))) ### 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 810 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>Set.inter" ### ("_applC" ("_position" dom) ("_position" \)) ### ("_position" \)) ### ("_indexdefault") ("\<^const>Set.empty"))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>2) ### ("_index" ("_position" \)) ("_position" mem\<^sub>1)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>Set.inter" ### ("_applC" ("_position" dom) ("_position" \)) ### ("_position" \)) ### ("\<^const>Set.empty"))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" \)) ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>2) ### ("_index" ("_position" \)) ("_position" mem\<^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. Proofs for inductive predicate(s) "\\<^sub>1p" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "\\<^sub>3_aux" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "\p" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Ambiguous input (line 960 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>1_abv" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("_position" \') ("_position" \') ("_position" P') ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ("_position" mds) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>2))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>1_abv" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("_position" \') ("_position" \') ("_position" P') ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ("_position" mds) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 969 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>1_abv" ### ("\<^const>local.conf_abv" ("_position" c) ("_position" mds) ### ("_position" mem)) ### ("_position" \) ("_position" \) ("_position" P) ### ("\<^const>local.conf_abv" ("_position" c') ("_position" mds') ### ("_position" mem')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c) ("_position" c')))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>1_abv" ### ("\<^const>local.conf_abv" ("_position" c) ("_position" mds) ### ("_position" mem)) ### ("_position" \) ("_position" \) ("_position" P) ### ("\<^const>local.conf_abv" ("_position" c') ("_position" mds') ### ("_position" mem')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c) ("_indexdefault") ### ("_position" c')))) ### 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 974 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>3_aux" ("_position" lc) ### ("_position" \) ("_position" \) ("_position" P) ### ("_position" lc'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc))) ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\\<^sub>3_aux" ("_position" lc) ### ("_position" \) ("_position" \) ("_position" P) ### ("_position" lc'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc))) ### ("_indexdefault") ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc')))))) ### 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 981 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\_abv" ("_position" lc) ("_position" \) ### ("_position" \) ("_position" P) ("_position" lc'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc))) ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc')))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\_abv" ("_position" lc) ("_position" \) ### ("_position" \) ("_position" P) ("_position" lc'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc))) ### ("_indexdefault") ### ("_applC" ("_position" fst) ### ("_applC" ("_position" fst) ("_position" lc')))))) ### 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 995 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### 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 996 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^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 1005 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### 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 1006 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^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 1065 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\_abv" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("_position" \) ("_position" \) ("_position" P) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ("_position" mds') ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds) ("_position" mds')))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.\_abv" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("_position" \) ("_position" \) ("_position" P) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ("_position" mds') ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds) ("_indexdefault") ### ("_position" mds')))) ### 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 1264 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("_position" v))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("_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 1279 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Acq" ("_position" v) ### ("_position" GuarNoReadOrWrite))) ### ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Acq" ("_position" v) ### ("_position" GuarNoReadOrWrite))) ### ("_indexdefault") ("_position" \))) ### 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 1286 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ### ("_position" GuarNoReadOrWrite))) ### ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ### ("_position" GuarNoReadOrWrite))) ### ("_indexdefault") ("_position" \))) ### 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 1293 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Acq" ("_position" v) ### ("_position" GuarNoWrite))) ### ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Acq" ("_position" v) ### ("_position" GuarNoWrite))) ### ("_indexdefault") ("_position" \))) ### 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 1300 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ### ("_position" GuarNoWrite))) ### ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ### ("_position" GuarNoWrite))) ### ("_indexdefault") ("_position" \))) ### 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 1307 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ("_position" m)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ("_position" m))) ### ("_position" x)) ### ("_indexdefault") ("_applC" ("_position" \) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ("_position" m)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>local.add_anno" ("_position" \) ("_position" \) ### ("\<^const>Language.ModeUpd.Rel" ("_position" v) ("_position" m))) ### ("_position" x)) ### ("_applC" ("_position" \) ("_position" x))))) ### 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 1391 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_stable) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("_position" v)))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_stable) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))) ### ("_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 1406 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_position" P) ("_position" c) ("_position" \') ### ("_position" \') ("_position" P'))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c) ("_indexdefault") ### ("_position" Stop))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" context_equiv) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" \')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \') ### ("_indexdefault") ("_position" \)) ### ("\<^const>HOL.conj" ### ("\<^const>local.pred_entailment" ("_position" P) ### ("_position" P')) ### ("\<^const>HOL.All_binder" ("_position" mds) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \') ### ("_cargs" ("_position" \) ("_position" P')))))))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_position" P) ("_position" c) ("_position" \') ### ("_position" \') ("_position" P'))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c) ("_position" Stop))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" context_equiv) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" \')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \') ### ("_indexdefault") ("_position" \)) ### ("\<^const>HOL.conj" ### ("\<^const>local.pred_entailment" ("_position" P) ### ("_position" P')) ### ("\<^const>HOL.All_binder" ("_position" mds) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \') ### ("_cargs" ("_position" \) ("_position" P')))))))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_position" P) ("_position" c) ("_position" \') ### ("_position" \') ("_position" P'))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c) ("_indexdefault") ### ("_position" Stop))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" context_equiv) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" \')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" \') ("_position" \)) ### ("\<^const>HOL.conj" ### ("\<^const>local.pred_entailment" ("_position" P) ### ("_position" P')) ### ("\<^const>HOL.All_binder" ("_position" mds) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \') ### ("_cargs" ("_position" \) ("_position" P')))))))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_position" P) ("_position" c) ("_position" \') ### ("_position" \') ("_position" P'))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c) ("_position" Stop))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" context_equiv) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" \')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" \') ("_position" \)) ### ("\<^const>HOL.conj" ### ("\<^const>local.pred_entailment" ("_position" P) ### ("_position" P')) ### ("\<^const>HOL.All_binder" ("_position" mds) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \') ### ("_cargs" ("_position" \) ("_position" P')))))))))))) ### 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 1413 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>Map.restrict_map" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>local.restrict_preds_to_vars" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P')))))))) ### 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 1422 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" dom) ("_position" \)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" v) ("_position" t))) ### ("_cargs" ("_position" \) ("_position" P'))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" dom) ("_position" \)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" v) ("_position" t))) ### ("_cargs" ("_position" \) ("_position" P'))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>Map.restrict_map" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" dom) ("_position" \)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" v) ("_position" t))) ### ("_cargs" ("_position" \) ("_position" P'))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>local.restrict_preds_to_vars" ("_position" P'') ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" dom) ("_position" \)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" mds_consistent) ### ("_cargs" ("_position" mds) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" v) ("_position" t))) ### ("_cargs" ("_position" \) ("_position" P'))))))))) ### 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 1430 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))) ### 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 1431 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>Map.restrict_map" ### ("_applC" ("_position" assign_post) ### ("_cargs" ("_position" P) ### ("_cargs" ("_position" x) ("_position" e)))) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P') ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ### ("_applC" ("_position" assign_post) ### ("_cargs" ("_position" P) ### ("_cargs" ("_position" x) ("_position" e)))) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>Map.restrict_map" ### ("_applC" ("_position" assign_post) ### ("_cargs" ("_position" P) ### ("_cargs" ("_position" x) ("_position" e)))) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P') ### ("\<^const>local.restrict_preds_to_vars" ### ("_applC" ("_position" assign_post) ### ("_cargs" ("_position" P) ### ("_cargs" ("_position" x) ("_position" e)))) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_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 1452 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.subset_eq" ("_position" P\<^sub>1) ### ("_position" P\<^sub>2))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \\<^sub>2) ### ("_indexdefault") ("_position" \\<^sub>1))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \\<^sub>2) ### ("_cargs" ("_position" \) ("_position" P\<^sub>2))))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \\<^sub>1) ### ("_cargs" ("_position" \) ("_position" P\<^sub>1))))))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>Set.subset_eq" ("_position" P\<^sub>1) ### ("_position" P\<^sub>2))) ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \\<^sub>2) ### ("_position" \\<^sub>1))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \\<^sub>2) ### ("_cargs" ("_position" \) ("_position" P\<^sub>2))))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \\<^sub>1) ### ("_cargs" ("_position" \) ("_position" P\<^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 1465 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 32 parse trees (10 displayed): ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ### ("_indexdefault") ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ### ("_indexdefault") ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ### ("_indexdefault") ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ### ("_indexdefault") ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ### ("_indexdefault") ### ("\<^const>local.restrict_preds_to_vars" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ### ("_indexdefault") ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P'') ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>local.subtype" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" P'') ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \'') ("_position" x)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P'') ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ### ("_tuple" ("_applC" ("_position" mds) ("_position" AsmNoWrite)) ### ("_tuple_arg" ### ("_applC" ("_position" mds) ### ("_position" AsmNoReadOrWrite)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" anno_type_sec) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" P) ("_position" upd)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \'') ### ("_indexdefault") ### ("_applC" ("_position" add_anno_stable) ### ("_cargs" ("_position" \) ("_position" upd))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("_Ball" ("_position" v) ### ("_applC" ("_position" bexp_vars) ("_position" p)) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" v)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" P'') ### ("\<^const>Map.restrict_map" ("_position" P) ### ("_Coll" ("_position" v) ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \'') ("_position" v))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \'') ### ("\<^const>local.add_anno" ("_position" \) ### ("_position" \) ("_position" upd)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ### ("_applC" ("_position" update_modes) ### ("_cargs" ("_position" upd) ("_position" mds))) ### ("_cargs" ("_position" \'') ### ("_position" mem)))))))))))))) ### 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 1480 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem)))) ### ("_indexdefault") ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem)))) ### ("_indexdefault") ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem)))) ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem')))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" types_wellformed) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem)))) ### ("_applC" ("_position" tyenv_sec) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ("_position" mem')))))))) ### 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 2192 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" bisim_helper) ### ("_cargs" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ### ("_position" mds\<^sub>2) ("_position" mem\<^sub>2)))) ### ("_indexdefault") ### ("\<^const>local.low_mds_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" mds)) ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" bisim_helper) ### ("_cargs" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>2) ### ("_position" mds\<^sub>2) ("_position" mem\<^sub>2)))) ### ("\<^const>local.low_mds_eq_indexed" ("_position" mem\<^sub>1) ### ("_index" ("_position" mds)) ("_position" mem\<^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. ### Rule already declared as introduction (intro) ### (\x. ?f x = ?g x) \ ?f = ?g *** Type unification failed: Clash of types "_ set" and "_ \ _" *** *** Type error in application: incompatible operand type *** *** Operator: subst_abv mem :: *** ('Var \ 'Val option) \ 'Var \ 'Val *** Operand: {} :: ??'a set *** *** At command "have" (line 435 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") Found termination order: "{}" ### Ambiguous input (line 2206 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2207 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### 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 2230 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### 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 2253 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### 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 2941 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" S) ("_position" e)) ("_position" mem)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" S) ("_position" e)) ("_position" mem))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" S) ### ("_applC" ("_position" e) ("_position" mem))))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" pred) ("_position" P)) ("_position" S) ### ("_applC" ("_position" e) ("_position" mem)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" pred) ("_position" P)) ("_position" S) ### ("_position" e)) ### ("_position" mem))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" S) ### ("_position" e)) ### ("_position" mem)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Transitive_Closure.rtranclp.intros_1" ### Ambiguous input (line 3825 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### 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 3843 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### 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 3877 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" list_all) ### ("_cargs" ### ("_lambda" ("_pattern" ("_position" c) ("_position" m)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" \') ### ("_idts" ("_position" \') ("_position" P'))) ### ("\<^const>local.has_type" ### ("_applC" ("_position" \_of_mds) ("_position" m)) ### ("_applC" ("_position" \_of_mds) ("_position" m)) ### ("\<^const>Set.empty") ("_position" c) ### ("_position" \') ("_position" \') ### ("_position" P'))) ### ("_applC" ("_position" mds_yields_stable_types) ### ("_position" m)))) ### ("_position" cs)))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" mem) ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cs) ### ("_tuple_arg" ("_position" mem)))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" type_global) ("_position" cs)))) ### ("_bigimpl" ### ("_asms" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" list_all) ### ("_cargs" ### ("_lambda" ("_pattern" ("_position" c) ("_position" m)) ### ("\<^const>HOL.conj" ### ("_tuple" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" \') ### ("_idts" ("_position" \') ("_position" P'))) ### ("\<^fixed>type_global" ### ("_applC" ("_position" \_of_mds) ### ("_position" m)))) ### ("_tuple_args" ### ("_applC" ("_position" \_of_mds) ("_position" m)) ### ("_tuple_args" ### ("_applC" ("\<^const>Set.empty") ### ("_cargs" ("_Finset" ("_position" c)) ### ("_position" \'))) ### ("_tuple_args" ("_position" \') ### ("_tuple_arg" ("_position" P')))))) ### ("_applC" ("_position" mds_yields_stable_types) ### ("_position" m)))) ### ("_position" cs)))) ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" mem) ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cs) ### ("_tuple_arg" ("_position" mem)))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" type_global) ("_position" cs)))) ### 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) "type_global" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### Metis: Unused theorems: "Set.Un_subset_iff" ### Ambiguous input (line 3898 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_Finset" ("_position" pred_False)) ("_position" mem))) ### ("_position" High))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_Finset" ("_position" pred_False)) ("_position" mem))) ### ("_indexdefault") ("_position" High))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### theory "Dependent_SIFUM_Type_Systems.TypeSystem" ### 10.951s elapsed time, 21.936s cpu time, 4.704s GC time ### Metis: Unused theorems: "Set.Collect_empty_eq" ### Metis: Unused theorems: "local.mems'_k_2" ### Metis: Unused theorems: "local.diff_vars_impl" ### Metis: Unused theorems: "??.unknown" ### Metis: Unused theorems: "local.diff_vars_impl" ### Ignoring duplicate rewrite rule: ### ?c1 \\<^bsub>[]\<^esub> ?c'1 \ ?c1 = ?c'1 ### Ambiguous input (line 1955 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 5 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>1) ### ("_tuple_arg" ("_position" mem\<^sub>1))) ### ("_position" ns) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^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 1960 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 10 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2''))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems''))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" ns) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems''))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2''))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems''))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2))))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems''))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1'')))) ### ("\<^const>HOL.conj" ### ("_applC" ("_position" sound_mode_use) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1''))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'')))) ### ("_tuple" ("_position" cms\<^sub>2) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" ns) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1'') ### ("_tuple_arg" ("_position" mem\<^sub>1''))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" mems'')))))))) ### 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 1968 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_position" n) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" n) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_position" n) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2''))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cms\<^sub>2'') ### ("_tuple_arg" ("_position" mem\<^sub>2'')))) ### ("_position" n) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.dma_eq''" ### Metis: Unused theorems: "List.length_map", "List.length_replicate", "List.map_snd_zip" ### Metis: Unused theorems: "List.length_zip", "Nat.min_0L" ### Metis: Unused theorems: "Preliminaries.Sec.exhaust" ### Ambiguous input (line 2067 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2'))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems'))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("_applC" ("_position" makes_compatible) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>1') ### ("_tuple_arg" ("_position" mem\<^sub>1'))) ### ("_cargs" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_position" mems')))))) ### 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 2073 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy") produces 12 parse trees (10 displayed): ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ### ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x))))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ### ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ### ("_position" x)))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1'))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2)))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.Ex_binder" ### ("_idts" ("_position" cms\<^sub>2') ("_position" mem\<^sub>2')) ### ("\<^const>HOL.conj" ### ("\<^const>local.meval_sched_abv" ### ("_tuple" ("_position" cmds) ### ("_tuple_arg" ("_position" mem\<^sub>2))) ### ("_position" sched) ### ("\<^const>HOL.conj" ### ("_tuple" ("_position" cms\<^sub>2') ### ("_tuple_arg" ("_position" mem\<^sub>2'))) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>1'))) ### ("_applC" ("_position" map) ### ("_cargs" ("_position" snd) ("_position" cms\<^sub>2')))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" length) ("_position" cms\<^sub>2')) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')))))) ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.member" ("_position" x) ("_position" \)) ### ("_All_less" ("_position" i) ### ("_applC" ("_position" length) ("_position" cms\<^sub>1')) ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" snd) ### ("_cargs" ### ("\<^const>List.nth" ("_position" cms\<^sub>1') ### ("_position" i)) ### ("_position" AsmNoReadOrWrite))))))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1') ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2') ("_position" x)))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.loc_reach.refl", "Product_Type.surjective_pairing" ### Metis: Unused theorems: "local.INIT\<^sub>1", "local.INIT\<^sub>2" ### Metis: Unused theorems: "local.sifum_security_init_axioms" ### Ambiguous input (line 307 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Language.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ### ("\<^const>Language.Stmt.ModeDecl" ("_position" c) ("_position" mu)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Language.Stmt.ModeDecl" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" c)) ### ("_position" mu))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.cxt_eval", "local.eval\<^sub>w.decl" ### Metis: Unused theorems: "local.annotate.simps_1", "local.annotate.simps_2" ### Metis: Unused theorems: "local.annotate.simps_1", "local.annotate.simps_2" ### Metis: Unused theorems: "Set.IntD2", "local.assign.prems", "Lattices.inf_apply", "Lattices.semilattice_inf_class.le_iff_inf" ### Rule already declared as elimination (elim) ### \?A \ ?B; ?c \ ?A \ ?P; ### ?c \ ?B \ ?P\ ### \ ?P ### Metis: Unused theorems: "local.while.hyps_1" ### Metis: Unused theorems: "Set.IntI", "Set.empty_iff", "local.while.hyps_1" ### Metis: Unused theorems: "local.while.hyps_1" ### Metis: Unused theorems: "local.while.hyps_1" ### Ambiguous input (line 813 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### 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 814 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>Set.inter" ### ("_applC" ("_position" dom) ("_position" \)) ### ("_position" \)) ### ("_indexdefault") ("\<^const>Set.empty"))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>Set.inter" ### ("_applC" ("_position" dom) ("_position" \)) ### ("_position" \)) ### ("\<^const>Set.empty"))) ### 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 815 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### 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 817 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 819 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_applC" ("_position" dma_type) ("_position" x)) ### ("_position" mem\<^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 823 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_indexdefault") ("_position" Low))) ### 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 824 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>2) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### 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 827 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" x)) ### ("_applC" ("_position" Some) ("_position" t)))) ### 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 829 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### 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 831 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^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 834 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" t))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_indexdefault") ("_position" t))) ### 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 836 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^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 837 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "HOL.sym" ### Ambiguous input (line 841 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_indexdefault") ("_applC" ("_position" dma_type) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_applC" ("_position" dma_type) ("_position" x)))) ### 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 843 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>2))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^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 844 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "HOL.sym" ### Ignoring duplicate rewrite rule: ### type_max (dma_type ?x1) ?mem1 \ dma ?mem1 ?x1 ### Ambiguous input (line 931 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))) ### ("_indexdefault") ("_position" Low))) ### 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 933 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 944 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 950 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 998 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" vars_of_type) ("_position" t)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x))))) ### 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 1018 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" c))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" c))) ### 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 1018 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 1027 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem)) ### ("_applC" ("_position" dma) ("_position" mem')))) ### 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/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ("_position" \)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem')))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ### ("_applC" ("_position" dom) ("_position" \)) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem')))))) ### 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/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### 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/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem'))))) ### 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 1056 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds\<^sub>2) ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds\<^sub>2) ### ("_indexdefault") ("_position" mds))) ### 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 1094 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>2) ("_position" c\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>2) ### ("_indexdefault") ("_position" c\<^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 1096 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x))))))) ### 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 1097 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.disj" ### ("\<^const>Set.not_member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Set.IntD2" ### Ambiguous input (line 1105 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))))) ### 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 1106 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))))) ### 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 1110 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("_applC" ("_position" stable) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))))) ### 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 1184 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" p))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" p)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" p))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" p))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" p))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" p)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" p))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" p))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" p))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" p)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" p))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" p))))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" p) ("_position" P) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" p))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" p)))) ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" p))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" p))))))) ### 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 1189 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem\<^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 1190 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)))) ### ("_indexdefault") ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)))) ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem\<^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 1165 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 4 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x))))) ### 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 1167 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t\<^sub>x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" x)) ### ("_applC" ("_position" Some) ("_position" t\<^sub>x)))) ### 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 1169 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^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 1177 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^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 1179 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("_applC" ("_position" type_max) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1)) ### ("_position" A))) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" A)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("_applC" ("_position" type_max) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1)) ### ("_position" A))) ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>Orderings.ord_class.less_eq" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" A)) ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))))) ### 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 1116 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1)) ### ("_position" A))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" A)) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1)) ### ("_position" A))) ### ("_indexdefault") ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" A)) ### ("_indexdefault") ("_position" Low))) ### 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 1117 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))) ### 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 1122 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)))) ### 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 1122 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 1124 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t\<^sub>x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" x)) ### ("_applC" ("_position" Some) ("_position" t\<^sub>x)))) ### 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 1124 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ("_position" Low))) ### 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 1126 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^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 1134 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t\<^sub>x) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 1135 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 1140 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low))) ### 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 1206 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.not_equal" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" x)))) ### ("\<^const>HOL.Not" ### ("_applC" ("_position" var_asm_not_written) ### ("_cargs" ("_position" mds) ("_position" x))))))) ### 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 1207 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### 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 1238 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### 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 1251 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_position" A)) ### ("_position" x)) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.All_binder" ("_position" x) ### ("\<^const>HOL.implies" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x))) ### ("_indexdefault") ("_position" Low)) ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" x) ### ("_applC" ("_position" mds) ("_position" AsmNoReadOrWrite))) ### ("\<^const>Set.member" ("_position" x) ("_position" \)))) ### ("\<^const>HOL.eq" ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>1" ### ("_position" mem\<^sub>1) ("_position" A)) ### ("_position" x)) ### ("_applC" ### ("\<^const>Security.apply_adaptation\<^sub>2" ### ("_position" mem\<^sub>2) ("_position" A)) ### ("_position" x)))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.annotate.simps_1", "local.annotate.simps_2" ### Metis: Unused theorems: "Product_Type.prod.collapse" ### Metis: Unused theorems: "Product_Type.prod.collapse" ### Ambiguous input (line 1365 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" C)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" x)) ### ("_applC" ("_position" Some) ("_position" C)))) ### 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 1475 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" mds) ("_position" AsmNoWrite))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" P'') ("_indexdefault") ### ("_position" P)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("\<^const>Set.member" ("_position" v) ### ("_applC" ("_position" mds) ("_position" AsmNoWrite))) ### ("\<^const>HOL.eq" ("_position" P'') ("_position" P)))) ### 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 1484 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" the) ### ("_applC" ("_position" \) ("_position" x))) ### ("_position" mem'))))) ### 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 1557 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### 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 1563 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 1565 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### 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 1581 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 1618 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 1621 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 1622 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 1623 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_position" t))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_indexdefault") ("_position" t))) ### 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 1623 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" t) ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" t) ("_indexdefault") ### ("_position" t'))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Complete_Lattices.UN_I", "Set.contra_subsetD" ### Ambiguous input (line 1633 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" \) ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" \) ("_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 1635 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 1638 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### 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 1640 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem)) ### ("_applC" ("_position" dma) ("_position" mem')))) ### 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 1642 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### 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 1655 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 1670 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 1682 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" v')) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" v'))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" v')) ### ("_applC" ("_position" mem') ("_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 1684 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem') ("_position" v))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem') ("_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 1689 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### 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 1704 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" th))) ### 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 1704 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 1704 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 1722 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" el))) ### 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 1722 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 1722 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 1723 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ("_position" e)) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### 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 1724 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ("_position" e)) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### 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 1732 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ### ("_position" e)))))))) ### 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 1734 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" mem'))))) ### 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 1742 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Product_Type.snd_conv", "Set.subsetD", "local.type_wellformed_def", "local.types_wellformed_def" ### Metis: Unused theorems: "Product_Type.snd_conv", "Set.subsetD", "local.type_wellformed_def", "local.types_wellformed_def" ### Metis: Unused theorems: "Product_Type.snd_conv", "Set.subsetD", "local.type_wellformed_def", "local.types_wellformed_def" ### Ambiguous input (line 1767 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 1768 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 1769 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 1769 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" c\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" c\<^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 1769 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 1771 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \\<^sub>1) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \\<^sub>1) ### ("_indexdefault") ("_position" \))) ### 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 1787 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>HOL.eq" ("_position" c') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^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. ### Metis: Unused theorems: "local.seq_type.prems_2" ### Ambiguous input (line 1800 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>HOL.eq" ("_position" c') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^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 2211 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2215 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2221 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 2234 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 1894 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### 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 2238 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2244 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 1900 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 2257 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 1902 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### 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 2261 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2267 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 1918 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 1955 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 1958 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 1959 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 1960 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_position" t))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_indexdefault") ("_position" t))) ### 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 1960 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" t) ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" t) ("_indexdefault") ### ("_position" t'))) ### 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 1970 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" \) ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" \) ("_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 1972 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 1975 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" x)) ### ("_applC" ("_position" mem') ("_position" x))))) ### 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 1977 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem)) ### ("_applC" ("_position" dma) ("_position" mem')))) ### 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 1979 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### 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 1992 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ### ("_indexdefault") ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.eq" ("_position" mem') ### ("_Update" ("_position" mem) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem) ("_position" e))))))))) ### 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 2372 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \') ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \') ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2373 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2007 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2382 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 2019 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem) ("_position" v')) ("_indexdefault") ### ("_applC" ("_position" mem') ("_position" v'))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem) ("_position" v')) ### ("_applC" ("_position" mem') ("_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 2021 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem') ("_position" v))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem') ("_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 2026 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem'))))) ### 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 2428 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2428 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2428 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 2439 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2439 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2439 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2442 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.has_type.stop_type" ### Ambiguous input (line 2444 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 2041 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" th))) ### 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 2041 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 2041 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2450 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 2451 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 2454 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2455 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 2457 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 2459 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2465 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2059 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" el))) ### 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 2059 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 2059 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2060 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ("_position" e)) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" c') ("_position" \'') ("_position" \') ### ("_position" P''))) ### 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 2473 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 2061 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ("_position" e)) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.has_type" ("_position" \) ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" c') ("_position" \''') ("_position" \') ### ("_position" P'''))) ### 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 2475 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2476 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2477 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2479 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_position" v)) ### ("\<^const>HOL.eq" ("_position" x) ("_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 2485 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" x) ("_position" v))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_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 2069 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds') ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ### ("_position" e)))))))) ### 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 2071 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 3 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" bexp_neg) ("_position" e))) ### ("_position" mem'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.implies" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem))) ### ("_applC" ("_position" pred) ### ("_cargs" ### ("_applC" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" bexp_neg)) ### ("_position" e)) ### ("_position" mem'))))) ### 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 2079 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 8 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ### ("_indexdefault") ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" c') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds)) ### ("\<^const>HOL.conj" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop))))) ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))))) ### 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 2520 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2520 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2524 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2524 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2524 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2531 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 2532 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 2535 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2536 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Product_Type.snd_conv" ### Ambiguous input (line 2545 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 2547 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2556 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 2558 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2560 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_position" v)) ### ("\<^const>HOL.eq" ("_position" x) ("_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 2561 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" x) ("_position" v))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_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 2581 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2171 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 5 parse trees: ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ("_position" P)) ("_position" \) ### ("_position" e))))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))) ### ("_position" \) ("_position" e)))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))) ### ("_position" \) ("_position" e))))) ### ("_bigimpl" ### ("_asm" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_position" \) ("_position" e)))) ### 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 2590 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2591 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 2616 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2628 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" v')) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" v'))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" v')) ### ("_applC" ("_position" mem\<^sub>1') ("_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 2630 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_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 2635 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 2654 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2654 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2658 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2658 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2658 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2664 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')) ### ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1')) ### ("_applC" ("_position" dma) ("_position" mem\<^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 2678 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 2679 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 2680 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 2682 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2685 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2686 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 2688 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" ?\') ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" ?\') ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 2690 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 2694 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2696 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2701 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 2706 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 2709 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 2710 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1'))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1'))) ### ("_indexdefault") ("_position" Low))) ### 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 2715 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2722 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" y))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" y))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 2177 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ("_position" mem))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem)))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_applC" ("_position" e) ("_position" mem))))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" pred) ("_position" P)) ("_position" \) ### ("_position" e)) ### ("_position" mem)))) ### ("\<^const>Pure.imp" ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ("_position" P) ("_position" mem)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem))))) ### 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 2729 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" y)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" y)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" y)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" y)))) ### 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 2771 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2774 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 2775 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 2776 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_position" t))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_indexdefault") ("_position" t))) ### 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 2776 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" t) ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" t) ("_indexdefault") ### ("_position" t'))) ### 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 2786 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" \) ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" \) ("_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 2788 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 2791 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### 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 2793 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 2795 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 2819 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2819 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 2819 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.context_equiv_refl", "local.pred_entailment_refl" ### Ambiguous input (line 2842 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### 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 2104 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 2105 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 2106 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2106 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c') ("_position" c\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("_position" c\<^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 2106 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem') ("_position" mem))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem') ("_indexdefault") ### ("_position" mem))) ### 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 2108 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \\<^sub>1) ("_position" \))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \\<^sub>1) ### ("_indexdefault") ("_position" \))) ### 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 2876 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop)))))) ### 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 2877 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2878 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 2124 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>HOL.eq" ("_position" c') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^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 2136 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>HOL.eq" ("_position" c') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1') ("_position" mds') ### ("_position" mem'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c') ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1') ### ("_position" c\<^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. Enter MATCH \\ \ P mem\<^sub>2 c\<^sub>2' mem\<^sub>2' a b c. c \\<^sup>? ?Q25 c\<^sub>1' mds' mem\<^sub>1' \' \' P' c\<^sub>1' mds' mem\<^sub>2' \\ \ P mem\<^sub>2 c\<^sub>2' mem\<^sub>2' a. a \\<^sup>? ?Q24 c\<^sub>1' mds' mem\<^sub>1' \' \' P' c\<^sub>1' mds' mem\<^sub>2' Enter MATCH \\ \ P mem\<^sub>2 c\<^sub>2' mem\<^sub>2' a. a \\<^sup>? ?Q24 c\<^sub>1' mds' mem\<^sub>1' \' \' P' c\<^sub>1' mds' mem\<^sub>2' ### Ambiguous input (line 3013 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1'1) ("_position" c\<^sub>1'1'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1'1) ### ("_indexdefault") ("_position" c\<^sub>1'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 3032 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1'1) ("_position" c\<^sub>1'1'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1'1) ### ("_indexdefault") ("_position" c\<^sub>1'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 3116 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \') ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \') ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3117 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" x))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3126 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" x)))) ### 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 3169 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3169 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3169 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 3180 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3180 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3180 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 3183 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### 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 3185 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 3191 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 3192 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 3195 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3196 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 3198 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 3200 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3206 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3214 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 3216 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 3217 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 3218 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3220 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_position" v)) ### ("\<^const>HOL.eq" ("_position" x) ("_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 3226 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" x) ("_position" v))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_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 3261 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3261 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 3265 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3265 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3265 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 3272 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 3273 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 3276 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3277 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "Product_Type.snd_conv" ### Ambiguous input (line 3286 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 3288 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3297 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 3299 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 3301 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_position" v)) ### ("\<^const>HOL.eq" ("_position" x) ("_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 3302 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" x) ("_position" v))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" x) ("_indexdefault") ### ("_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 3322 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3331 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 3332 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_position" v)))))) ### ("\<^const>Pure.all_binder" ("_position" mem) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem) ("_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 2864 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" th))) ### 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 3357 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3369 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" v')) ### ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" v'))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" v') ### ("_applC" ("_position" \_vars) ("_position" v)) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" v')) ### ("_applC" ("_position" mem\<^sub>1') ("_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 3371 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_indexdefault") ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" v))) ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_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. ### Metis: Unused theorems: "local.if_type_8" ### Ambiguous input (line 2868 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" el))) ### 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 3376 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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. ### Metis: Unused theorems: "local.if_type_8" ### Ambiguous input (line 3395 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3395 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 2826 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" th))) ### 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 2826 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 2826 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2834 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" el))) ### 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 2834 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 2834 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3399 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3399 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3399 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 3405 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')) ### ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1')) ### ("_applC" ("_position" dma) ("_position" mem\<^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 3419 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("_indexdefault") ("_position" Low))) ### 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 3420 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 3421 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 3423 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3426 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3427 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 3429 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" ?\') ("_position" v))) ### ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" ?\') ("_position" v))) ### ("_indexdefault") ("_position" t'))) ### 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 3431 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 3435 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3437 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" v))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3442 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ### ("_cargs" ("_position" mem\<^sub>1') ("_position" v))) ### ("_indexdefault") ("_position" Low))) ### 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 3447 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_indexdefault") ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))) ### ("_position" v)) ### ("_applC" ### ("_Update" ("_position" mem\<^sub>2) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("_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 3450 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 3451 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1'))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1'))) ### ("_indexdefault") ("_position" Low))) ### 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 3456 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t) ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3463 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" y))) ### ("_position" mem\<^sub>1))) ### ("_position" Low))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ### ("_applC" ("_position" to_total) ### ("_cargs" ("_position" \) ("_position" y))) ### ("_position" mem\<^sub>1))) ### ("_indexdefault") ("_position" Low))) ### 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 3470 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" y)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>2) ("_position" y)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" y)) ### ("_applC" ("_position" mem\<^sub>2) ("_position" y)))) ### 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 3512 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3515 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x)) ### ("\<^const>HOL.eq" ("_position" v) ("_position" x)) ### 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 3516 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" v) ("_position" x))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" v) ("_indexdefault") ### ("_position" x))) ### 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 3517 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_position" t))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" the) ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v))) ### ("_indexdefault") ("_position" t))) ### 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 3517 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" t) ("_position" t'))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" t) ("_indexdefault") ### ("_position" t'))) ### 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 3527 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_indexdefault") ("_applC" ("_position" \) ("_position" v)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ### ("_MapUpd" ("_position" \) ### ("_maplet" ("_position" x) ("_position" t))) ### ("_position" v)) ### ("_applC" ("_position" \) ("_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 3529 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" \) ("_position" v)) ("_indexdefault") ### ("_applC" ("_position" Some) ("_position" t')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" \) ("_position" v)) ### ("_applC" ("_position" Some) ("_position" t')))) ### 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 3532 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ("_indexdefault") ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### ("\<^const>HOL.Trueprop" ### ("_Ball" ("_position" x) ("_position" \) ### ("\<^const>HOL.eq" ("_applC" ("_position" mem\<^sub>1) ("_position" x)) ### ("_applC" ("_position" mem\<^sub>1') ("_position" x))))) ### 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 3534 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ("_indexdefault") ### ("_applC" ("_position" dma) ("_position" mem\<^sub>1')))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_applC" ("_position" dma) ("_position" mem\<^sub>1)) ### ("_applC" ("_position" dma) ("_position" mem\<^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 3536 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_indexdefault") ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1'))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^sub>1))) ### ("_applC" ("_position" type_max) ### ("_cargs" ("_position" t') ("_position" mem\<^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 3560 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3560 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" Stop))) ### 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 3560 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ### ("_Update" ("_position" mem\<^sub>1) ### ("_updbind" ("_position" x) ### ("_applC" ("_position" ev\<^sub>A) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))))))) ### 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 3583 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_indexdefault") ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>1) ("_position" e))) ### ("_applC" ("_position" ev\<^sub>B) ### ("_cargs" ("_position" mem\<^sub>2) ("_position" e))))) ### 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 3617 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop)))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("_applC" ("_position" If) ### ("_cargs" ("_position" e) ### ("_cargs" ### ("\<^const>Language.Stmt.Seq" ("_position" c) ### ("_applC" ("_position" While) ### ("_cargs" ("_position" e) ("_position" c)))) ### ("_position" Stop)))))) ### 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 3618 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3619 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 3676 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem\<^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 3676 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem\<^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 3679 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 5 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ("_position" P)) ("_position" \) ### ("_position" e)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))) ### ("_position" \) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))) ### ("_position" \) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_position" \) ("_position" e))) ### 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 3685 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 5 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e))))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ("_position" P)) ("_position" \) ### ("_position" e)))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))) ### ("_position" \) ("_position" e))))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" tyenv_wellformed) ### ("\<^const>local.add_pred" ### ("_applC" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P)))) ### ("_position" \) ("_position" e)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ### ("_applC" ("_position" tyenv_wellformed) ### ("_cargs" ("_position" mds) ### ("_cargs" ("_position" \) ### ("_cargs" ("_position" \) ("_position" P))))) ### ("_position" \) ("_position" e))) ### 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 3685 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>1))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>1)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem\<^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 3685 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem\<^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 3689 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 6 parse trees: ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_applC" ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ### ("_applC" ("_position" e) ("_position" mem\<^sub>2)))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ### ("\<^const>local.add_pred" ("_applC" ("_position" pred) ("_position" P)) ### ("_position" \) ("_position" e)) ### ("_position" mem\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("_applC" ("_position" pred) ### ("_cargs" ### ("\<^const>local.add_pred" ("_position" P) ("_position" \) ### ("_position" e)) ### ("_position" mem\<^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 2323 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 2324 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 2325 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" c\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" c\<^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 2325 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 2325 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 2328 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 2328 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ("_position" \''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ("_indexdefault") ### ("_position" \''))) ### 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 2345 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 2349 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c\<^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 3722 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>2) ("_position" c\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>2) ### ("_indexdefault") ("_position" c\<^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 3771 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 3775 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### 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 3786 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### 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 3787 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c)))) ### 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 3725 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 3726 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3751 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c))))) ### 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 3766 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c))))) ### 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 3605 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" th))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.if_type_8" ### Ambiguous input (line 3609 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" el))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.if_type_8" ### Ambiguous input (line 3567 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" th))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" th))) ### 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 3567 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 3567 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3575 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" el))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" el))) ### 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 3575 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 3575 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3069 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ("_indexdefault") ### ("_position" Stop)) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop)) ### 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 3070 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3071 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" c\<^sub>2))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" c\<^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 3071 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mds') ("_position" mds))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mds') ("_indexdefault") ### ("_position" mds))) ### 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 3071 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" mem\<^sub>1') ("_position" mem\<^sub>1))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" mem\<^sub>1') ### ("_indexdefault") ("_position" mem\<^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 3074 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3074 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" \) ("_position" \''))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" \) ("_indexdefault") ### ("_position" \''))) ### 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 3091 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3095 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c\<^sub>2))))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.conj" ### ("\<^const>local.eval_abv2" ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1) ("_position" mds) ### ("_position" mem\<^sub>1)) ### ("\<^const>local.conf_abv" ("_position" c\<^sub>1'') ### ("_position" mds') ("_position" mem\<^sub>1'))) ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ### ("\<^const>Language.Stmt.Seq" ("_position" c\<^sub>1'') ### ("_position" c\<^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 3733 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3735 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1') ("_position" c))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1') ### ("_indexdefault") ("_position" c))) ### 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 3739 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Metis: Unused theorems: "local.tyenv_wellformed_sub" ### Ambiguous input (line 3740 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3743 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### 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 3746 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/TypeSystem.thy") produces 2 parse trees: ### ("\<^const>HOL.Trueprop" ### ("\<^const>HOL.eq" ("_position" c\<^sub>1) ("_position" Stop))) ### ("\<^const>HOL.Trueprop" ### ("\<^const>local.tyenv_eq_indexed" ("_position" c\<^sub>1) ### ("_indexdefault") ("_position" Stop))) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. Trying "simp", "auto", "blast", "metis", "argo", "linarith", "presburger", "algebra", "fast", "fastforce", "force", "meson", and "satx"... No proof found isabelle document -d /media/data/jenkins/workspace/isabelle-repo-afp/browser_info/AFP/Dependent_SIFUM_Type_Systems/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-repo-afp/browser_info/AFP/Dependent_SIFUM_Type_Systems/outline -o pdf -n outline -t /proof,/ML *** Type unification failed: Clash of types "_ set" and "_ \ _" *** *** Type error in application: incompatible operand type *** *** Operator: subst_abv mem :: *** ('Var \ 'Val option) \ 'Var \ 'Val *** Operand: {} :: ??'a set *** *** At command "have" (line 435 of "~~/afp/thys/Dependent_SIFUM_Type_Systems/Compositionality.thy")