I agree Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our website without changing the browser settings you grant us permission to store that information on your device.

Download Files
### Definitions File

### Template File

### Check File

theory Defs imports "HOL-Library.Multiset" "HOL-Library.Pattern_Aliases" "HOL-Data_Structures.Tree2" Complex_Main begin end

theory Submission imports Defs begin end

theory Check imports Submission begin lemma lheap_instance: "Priority_Queue_Merge (\<lambda>t. t = \<langle>\<rangle>) insert get_min del_min (\<lambda>t. heap t \<and> ltree t) mset_tree empty merge" by (rule Submission.lheap.Priority_Queue_Merge_axioms) lemma T_merge_log: "ltree l \<Longrightarrow> ltree r \<Longrightarrow> T_merge l r \<le> log 2 (size1 l) + log 2 (size1 r) + 1" by (rule Submission.T_merge_log) end

Terms and Conditions