/seL4-l4v-10.1.1/graph-refine/ |
H A D | graph-refine.py | 121 def name_search (s, tags = None): 126 if not tags or tags.issubset (set (pair.tags))])) 135 def check_search (s, tags = None, report_mode = False, 137 pair = name_search (s, tags = tags) 216 def check_all (omit_set = set (), loops = True, tags = None, 220 if not tags or tags [all...] |
H A D | check.py | 55 ref_tags = p.pairing.tags 63 if pair.tags == ref_tags]] 77 if 'C' not in p.pairing.tags: 79 [compare_tag] = [tag for tag in p.pairing.tags if tag != 'C'] 90 if inline_tag in pair.tags] 137 tag_map = dict ([(tag, tag) for tag in p.tags ()]) 320 tags = p.pairing.tags 333 return [(restrs, hyps + split_no_loop_hyps (tags, split, restrs), 335 (restrs, hyps + split_loop_hyps (tags, spli [all...] |
H A D | search.py | 132 def init_case_splits (p, hyps, tags = None): 135 if tags == None: 136 tags = p.pairing.tags 147 for tag in p.pairing.tags] 153 tag_div_ns = [[[n for n in ns if p.node_tags[n][0] == t] for t in tags] 175 for tag in p.pairing.tags] 251 def __init__ (self, rep, name, restrs, hyps, tags, cand_elts = None): 256 self.tags = tags [all...] |
H A D | debug.py | 91 tags = set ([tag for (tag, n, vc) in rep.node_pc_env_order]) 92 if p.pairing and tags == set (p.pairing.tags): 93 tags = reversed (p.pairing.tags) 94 for tag in tags: 205 l_tag, r_tag = rep.p.pairing.tags 445 def trace_mems (rep, m, verbose = False, symbs = True, tags = None): 446 if tags == None: 448 tags [all...] |
H A D | logic.py | 67 def mk_mem_eqs (a_imem, c_imem, a_omem, c_omem, tags): 69 a_tag, c_tag = tags 205 def __init__ (self, tags, funs, eqs, notes = None): 206 [l_tag, r_tag] = tags 207 self.tags = tags 208 assert set (funs) == set (tags) 1211 def interesting_node_exprs (p, n, tags = None, use_pairings = True): 1212 if tags == None: 1213 tags [all...] |
H A D | rep_graph.py | 823 if pair.funs[pair.tags[0]] == fnames[0]: 837 tags = pair.tags 838 (c, s) = mem_calls_compatible (tags, l_mem_calls, r_mem_calls) 848 (ltag, rtag) = pair.tags 1184 def mem_calls_compatible (tags, l_mem_calls, r_mem_calls): 1190 if pair.tags == tags] 1195 r_fun = pair.funs[tags[1]] 1199 r_cast_calls[pair.funs[tags[ [all...] |
/seL4-l4v-10.1.1/isabelle/src/Pure/Thy/ |
H A D | present.scala | 205 def document_tags(tags: List[String]): String = 208 tags.map(tag => 221 tags: List[String] = Nil) 251 File.write(dir + Path.explode("isabelletags.sty"), document_tags(tags)) 293 var tags: List[String] = Nil 313 "t:" -> (arg => tags = space_explode(',', arg))) 320 document_format = document_format, tags = tags)
|
H A D | thy_header.scala | 62 (THEORY, Keyword.Spec(Keyword.THY_BEGIN, tags = List("theory"))), 63 ("ML", Keyword.Spec(Keyword.THY_DECL, tags = List("ML")))) 128 atom("outer syntax keyword specification", _.is_name) ~ opt_files ~ tags ^^ 172 tags ~! document_source 174 (rep(heading) ~ command(THEORY) ~ tags) ~! args ^^ { case _ ~ x => x }
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Thy/ |
H A D | present.scala | 205 def document_tags(tags: List[String]): String = 208 tags.map(tag => 221 tags: List[String] = Nil) 251 File.write(dir + Path.explode("isabelletags.sty"), document_tags(tags)) 293 var tags: List[String] = Nil 313 "t:" -> (arg => tags = space_explode(',', arg))) 320 document_format = document_format, tags = tags)
|
H A D | thy_header.scala | 62 (THEORY, Keyword.Spec(Keyword.THY_BEGIN, tags = List("theory"))), 63 ("ML", Keyword.Spec(Keyword.THY_DECL, tags = List("ML")))) 128 atom("outer syntax keyword specification", _.is_name) ~ opt_files ~ tags ^^ 172 tags ~! document_source 174 (rep(heading) ~ command(THEORY) ~ tags) ~! args ^^ { case _ ~ x => x }
|
/seL4-l4v-10.1.1/HOL4/tools/unicode-grep/ |
H A D | ugrep.sml | 137 fun recurse linenum tags sofar = 142 val tagdump = Binarymap.foldr tagfold [] tags 154 fun foldthis ((_, (f, tag)), (b, tags)) = 158 (b andalso b', if not b' then inc tag tags else tags) 160 val (c, tags) = List.foldl foldthis (true, tags) (#tests opts) 165 recurse (linenum + 1) tags (c andalso sofar)
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/include/ |
H A D | Makefile.in | 395 tags: tags-am 396 TAGS: tags 398 tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 442 distclean-tags: 443 -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags 519 distclean-am: clean-am distclean-generic distclean-tags 583 distclean-generic distclean-libtool distclean-tags distdir dvi \ 592 mostlyclean-libtool pdf pdf-am ps ps-am tags tags [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/modules/ |
H A D | Makefile.in | 125 tags-recursive uninstall-recursive 406 tags: tags-recursive 407 TAGS: tags 409 tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 466 distclean-tags: 467 -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags 565 distclean-am: clean-am distclean-generic distclean-tags 630 distclean-tags distdir dvi dvi-am html html-am info info-am \ 638 ps ps-am tags tag [all...] |
/seL4-l4v-10.1.1/isabelle/src/Pure/Isar/ |
H A D | keyword.scala | 100 sealed case class Spec(kind: String, exts: List[String] = Nil, tags: List[String] = Nil) 107 (if (tags.isEmpty) "" else tags.map(quote).mkString(" % ", " % ", ""))
|
H A D | parse.scala | 83 def tags: Parser[List[String]] = rep($$$("%") ~> tag_name)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Isar/ |
H A D | keyword.scala | 100 sealed case class Spec(kind: String, exts: List[String] = Nil, tags: List[String] = Nil) 107 (if (tags.isEmpty) "" else tags.map(quote).mkString(" % ", " % ", ""))
|
H A D | parse.scala | 83 def tags: Parser[List[String]] = rep($$$("%") ~> tag_name)
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolymain/ |
H A D | Makefile.in | 465 tags: tags-am 466 TAGS: tags 468 tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 512 distclean-tags: 513 -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags 591 distclean-tags 658 distclean-libtool distclean-tags distdir dvi dvi-am html \ 667 tags tags [all...] |
/seL4-l4v-10.1.1/seL4/libsel4/tools/ |
H A D | bitfield_gen.py | 202 """ LBRACE masks tags RBRACE""" 203 t[0] = TaggedUnion(name=t[2], tagname=t[3], classes=t[5], tags=t[6]) 206 """tags :""" 210 """tags : tags TAG IDENTIFIER INTLIT""" 1201 def __init__(self, name, tagname, classes, tags): 1206 # Check for duplicate tags 1209 for name, value in tags: 1218 self.tags = tags [all...] |
/seL4-l4v-10.1.1/seL4/manual/tools/libsel4_tools/ |
H A D | bitfield_gen.py | 202 """ LBRACE masks tags RBRACE""" 203 t[0] = TaggedUnion(name=t[2], tagname=t[3], classes=t[5], tags=t[6]) 206 """tags :""" 210 """tags : tags TAG IDENTIFIER INTLIT""" 1201 def __init__(self, name, tagname, classes, tags): 1206 # Check for duplicate tags 1209 for name, value in tags: 1218 self.tags = tags [all...] |
/seL4-l4v-10.1.1/seL4/tools/ |
H A D | bitfield_gen.py | 202 """ LBRACE masks tags RBRACE""" 203 t[0] = TaggedUnion(name=t[2], tagname=t[3], classes=t[5], tags=t[6]) 206 """tags :""" 210 """tags : tags TAG IDENTIFIER INTLIT""" 1201 def __init__(self, name, tagname, classes, tags): 1206 # Check for duplicate tags 1209 for name, value in tags: 1218 self.tags = tags [all...] |
/seL4-l4v-10.1.1/HOL4/src/floating-point/native/ |
H A D | selftest.sml | 47 fun has_tags tags thm = 49 (ts, []) => Lib.set_eq ts tags
|
/seL4-l4v-10.1.1/HOL4/src/quotient/examples/lambda/ |
H A D | barendregt.sml | 351 val (tags,groups) = split match_groups value 352 (* val (xs,bodies) = split tags *) 355 val lambda_thms = map (MAKE_LIST_CLEAN_VAR_THM free_vrs) tags 356 val t_lambda_thms = zip tags lambda_thms
|
/seL4-l4v-10.1.1/HOL4/src/quotient/examples/sigma/ |
H A D | barendregt.sml | 366 val (tags,groups) = split match_groups value 367 (* val (xs,bodies) = split tags *) 370 val sigma_thms = map (MAKE_LIST_CLEAN_VAR_THM free_vrs) tags 371 val t_sigma_thms = zip tags sigma_thms
|
/seL4-l4v-10.1.1/HOL4/polyml/ |
H A D | Makefile.in | 213 tags-recursive uninstall-recursive 745 tags: tags-recursive 746 TAGS: tags 748 tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) 811 distclean-tags: 812 -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags 1055 distclean-hdr distclean-libtool distclean-tags 1131 distclean-tags distcleancheck distdir distuninstallcheck dvi \ 1141 mostlyclean-libtool pdf pdf-am ps ps-am tags tag [all...] |