Searched refs:list2 (Results 1 - 13 of 13) sorted by relevance

/seL4-l4v-master/HOL4/src/bool/
H A Dselftest.sml14 val list2 = find_in str apropos2 ; value
15 val true = length list1 = length list2 ;
17 val true = map #1 list1 = map #1 list2 ;
/seL4-l4v-master/l4v/tools/c-parser/standalone-parser/
H A Dbasics.sml122 fun eq_list eq (list1, list2) = let
126 length list1 = length list2 andalso eq_lst (list1, list2)
/seL4-l4v-master/HOL4/polyml/libpolymain/
H A DMakefile.in391 list2=; for p in $$list; do \
393 list2="$$list2 $$p"; \
396 test -z "$$list2" || { \
399 echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
400 $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
/seL4-l4v-master/HOL4/polyml/libpolyml/
H A DMakefile.in615 list2=; for p in $$list; do \
617 list2="$$list2 $$p"; \
620 test -z "$$list2" || { \
623 echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
624 $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
/seL4-l4v-master/HOL4/src/rational/
H A DratLib.sml269 val list2 = partition (fn x => isSome (snd x)) list1; value
270 val asms_toprove = map fst (snd list2);
271 val asms_proved = map (fn x => valOf (snd x)) (fst list2);
H A DratScript.sml767 val list2 = partition (fn x => isSome (snd x)) list1; value
768 val asms_toprove = map fst (snd list2);
769 val asms_proved = map (fn x => valOf (snd x)) (fst list2);
/seL4-l4v-master/HOL4/polyml/
H A DMakefile.in678 list2='$(man_MANS)'; \
680 && test -n "`echo $$list1$$list2`" \
685 if test -n "$$list2"; then \
686 for i in $$list2; do echo "$$i"; done \
/seL4-l4v-master/HOL4/src/integer/
H A DOmegaSymbolic.sml233 tm is of form evalupper x list1 /\ evallower x list2
H A DCooperShell.sml454 (* do a lexicographic comparison of list1 and list2, using c to compare
/seL4-l4v-master/HOL4/polyml/mlsource/MLCompiler/
H A DTYPEIDCODE.sml237 | (LabelledType{recList=list1, ...}, LabelledType{recList=list2, ...}) =>
240 (list1, list2)
/seL4-l4v-master/HOL4/examples/acl2/examples/acl2-hol-ltl-paper-example/
H A Dacl2_packageScript.sml3245 val (list1,list2) = (split_after (length listl div 2) listl handle e => ([],[]))
3250 else split4 x (list1,list2,list3,list4) term
3252 and split4 n (list1,list2,list3,list4) term =
3253 let val spec = map fromMLstring [hd list4,hd list3,hd list2]
3260 FORK_CONV (split_term_leq list2,split_term_leq list1)) THENC
/seL4-l4v-master/HOL4/examples/acl2/ml/
H A Dacl2_packageScript.sml3245 val (list1,list2) = (split_after (length listl div 2) listl handle e => ([],[]))
3250 else split4 x (list1,list2,list3,list4) term
3252 and split4 n (list1,list2,list3,list4) term =
3253 let val spec = map fromMLstring [hd list4,hd list3,hd list2]
3260 FORK_CONV (split_term_leq list2,split_term_leq list1)) THENC
/seL4-l4v-master/HOL4/examples/algebra/polynomial/
H A DpolyBinomialScript.sml3168 Since poly = 'a list, this is effectively: list1 = list2 <=> EL (list1) k = EL (list2) k.

Completed in 214 milliseconds