| /seL4-l4v-10.1.1/HOL4/examples/dev/sw/ |
| H A D | gr_t.sml | 12 A graph is represented by pair (t,m) where t is a search tree
|
| /seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/ |
| H A D | gr_t.sml | 12 A graph is represented by pair (t,m) where t is a search tree
|
| /seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/util/ |
| H A D | gr_t.sml | 12 A graph is represented by pair (t,m) where t is a search tree
|
| /seL4-l4v-10.1.1/HOL4/polyml/mlsource/extra/Win/ |
| H A D | Metafile.sml | 166 (* The application and picture names are encoded as a pair. *)
|
| /seL4-l4v-10.1.1/HOL4/src/HolQbf/ |
| H A D | QDimacs.sml | 78 Lib.S Lib.pair List.length
|
| /seL4-l4v-10.1.1/HOL4/src/emit/ |
| H A D | basis_emitScript.sml | 23 val _ = eSML "pair" defs;
24 val _ = eCAML "pair" defs;
699 :: OPEN ["pair","num","list"]
705 :: OPEN ["pair","num","list"]
|
| H A D | EmitML.sml | 448 | keyword l = ("let", hd l) :: (map (pair "and") (tl l))
717 val clauses' = ("fun",hd clauses)::map (pair "and") (tl clauses)
805 val clauses' = (s,hd clauses)::map (pair "and") (tl clauses)
1231 pr_list pp_tydec add_newline (map (pair tyvars) tynames)
|
| /seL4-l4v-10.1.1/HOL4/src/parse/ |
| H A D | TermParse.sml | 127 val newbody = APP(l3, APP(l3, QIDENT(l3, "pair", ","), t1), t3)
|
| /seL4-l4v-10.1.1/HOL4/src/postkernel/ |
| H A D | DB.sml | 31 The pair of strings is theory * bindname
|
| /seL4-l4v-10.1.1/HOL4/src/quotient/src/ |
| H A D | quotient_pairScript.sml | 162 (* pair theory: FST, SND, COMMA, CURRY, UNCURRY, ## *)
|
| /seL4-l4v-10.1.1/graph-refine/ |
| H A D | loop_bounds.py | 475 funs = [f for pair in target_objects.pairings[fname]
476 for f in pair.funs.values ()]
|
| /seL4-l4v-10.1.1/HOL4/examples/HolCheck/ |
| H A D | ctlTools.sml | 65 T is a (string * term) list where each pair is (action name, corresponding transition relation)
|
| /seL4-l4v-10.1.1/HOL4/tools/Holmake/ |
| H A D | basis2002.sml | 812 val pair = (i,c) value
814 if P pair then SOME pair
|
| /seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/ |
| H A D | TYPEIDCODE.sml | 510 the reference and apply it the pair of the value and the depth. *)
518 base printer functions and then to the pair of the value and depth. *)
1081 else (* We need a function that takes two arguments rather than a single pair. *)
1262 (* Exported function. Returns a function from an ML pair of values to bool.
1263 N.B. This differs from the functions in the typeID which take a Poly pair. *)
|
| /seL4-l4v-10.1.1/isabelle/src/Doc/Logics/document/ |
| H A D | CTT.tex | 70 \cdx{pair} & $[i,i]\to i$ & constructor\\
618 can produce multiple outcomes for each suitable pair of assumptions. In
924 an ordered pair, whose components are two new unknowns.%
1101 a $\lambda$-abstraction and an ordered pair. The pair's components are
|
| /seL4-l4v-10.1.1/l4v/isabelle/src/Doc/Logics/document/ |
| H A D | CTT.tex | 70 \cdx{pair} & $[i,i]\to i$ & constructor\\
618 can produce multiple outcomes for each suitable pair of assumptions. In
924 an ordered pair, whose components are two new unknowns.%
1101 a $\lambda$-abstraction and an ordered pair. The pair's components are
|
| /seL4-l4v-10.1.1/HOL4/src/1/ |
| H A D | TypeBasePure.sml | 839 val pair = Pair enc_tyop enc_args value
841 mk_comb(mk_type_var,pair)
985 (* where each arg_i is a (name,type) pair showing how the ith field should *)
|
| /seL4-l4v-10.1.1/HOL4/examples/bmark/ |
| H A D | Bmark.sml | 628 (* Already exists in theory "pair" *)
|
| /seL4-l4v-10.1.1/HOL4/src/HolSat/ |
| H A D | dimacsTools.sml | 92 ** Convert a literal to a (bool * integer) pair, where
|
| /seL4-l4v-10.1.1/HOL4/src/datatype/ |
| H A D | selftest.sml | 49 val _ = Hol_datatype `pair = CONST of 'a#'b`;
|
| /seL4-l4v-10.1.1/HOL4/src/integer/ |
| H A D | CooperSyntax.sml | 366 for some pair of integer literals d1 and d2, with the variable j. *)
|
| /seL4-l4v-10.1.1/HOL4/src/metis/ |
| H A D | mlibRewrite.sml | 447 in rewrite rw ord o pair ~1
|
| /seL4-l4v-10.1.1/HOL4/src/portableML/ |
| H A D | Table.sml | 439 List.concat (map (fn (key, xs) => map (pair key) xs) (dest tab))
|
| /seL4-l4v-10.1.1/HOL4/src/proofman/ |
| H A D | goalStack.sml | 60 * goal in the goal list is a (term list, term) pair. The validation
|
| /seL4-l4v-10.1.1/HOL4/src/quotient/examples/lambda/ |
| H A D | termScript.sml | 346 (* This consists of the variables on the LHS of each pair *)
|