@@ -20,7 +20,7 @@ open bdd_genTheory;
2020val _ = new_theory " bdd_gen_new" ;
2121
2222
23-
23+ (*
2424
2525(* new BDD types *)
2626
8383
8484
8585
86+ Definition COUNT_LIST_local_def:
87+ (COUNT_LIST_local 0n = []) ∧
88+ (COUNT_LIST_local n = COUNT_LIST_local (n-1) ++ [n-1])
89+ End
8690
8791
8892
@@ -92,7 +96,7 @@ Definition mk_new_labels_content_new_def:
9296 all_contents = MAP (λ(n,x',((id,content),(id',content'))). content) l ++
9397 MAP (λ(n,x',((id,content),(id',content'))). content') l;
9498 unique_contents = nub all_contents;
95- indices = COUNT_LIST (LENGTH unique_contents)
99+ indices = COUNT_LIST_local (LENGTH unique_contents)
96100 in
97101 ZIP (indices, unique_contents)
98102End
@@ -208,11 +212,6 @@ Definition merge_new_def:
208212End
209213
210214
211- Definition has_parent_def:
212- has_parent edges n n' =
213- EXISTS (λ(parent, (left, right)). (left = n' ∨ right = n')
214- ∧ parent ≠ n' ∧ parent ≠ n) edges
215- End
216215
217216Definition eliminable_new_def:
218217 eliminable_new ((r,edges,labels_id):'b BDD_mini) n =
232231val _ = type_abbrev("distrub_st", ``:( (string, (num list) option) alist # num list # num list)``);
233232
234233
235- Definition update_internals_def:
236- (update_internals pre [] n x = []) ∧
237- (update_internals pre (h::internals) n x =
238- let (var, node_list_op) = h in
239- (if var ≠ x then
240- update_internals (pre++[h]) internals n x
241- else
242- (
243- case node_list_op of
244- | SOME l => pre++[(var, SOME (n::l))]++internals
245- | NONE => pre++[(var, SOME [n])]++internals
246- )
247- )
248- )
249- End
250-
251-
252-
253234Definition distrubute_labels_new_def:
254235 (distrubute_labels_new [] (acc:distrub_st) = acc) ∧
255236 (distrubute_labels_new ((n,lbl,m)::labels_id) (internals, ntl, tl) =
@@ -378,6 +359,6 @@ Definition mk_BDDPred_opt_new_def:
378359 )
379360End
380361
381-
362+ *)
382363
383364val _ = export_theory ();
0 commit comments