Searched refs:pairs (Results 76 - 100 of 170) sorted by relevance

1234567

/seL4-l4v-10.1.1/HOL4/examples/theorem-prover/milawa-prover/
H A Dcore.lisp1033 (let ((pairs (second x))
1036 (true-listp pairs)
1037 (tuple-listp 2 pairs)
1038 (let* ((vars (strip-firsts pairs))
1039 (terms (strip-seconds pairs))
/seL4-l4v-10.1.1/HOL4/examples/lambda/basics/
H A DnomsetScript.sml16 (* permutations are represented as lists of pairs of strings. These
272 builtin types: functions, sets, lists, pairs, etc
439 (* pairs *)
555 (* lists of pairs of strings, (concrete rep for permutations) *)
793 (* pairs *)
/seL4-l4v-10.1.1/HOL4/src/TeX/
H A DmungeTools.sml285 fun mk_s2smap pairs = let
289 List.foldl foldthis m pairs
/seL4-l4v-10.1.1/HOL4/src/parse/
H A DOverload.sml218 (* will keep okopc, but should now remove from cnst2op all pairs of the form
260 (* a predicate on pairs of operations and types that returns true if
H A Dparse_term.sml501 (* these next equality pairs will never have terms interfering between
514 (* string is name of term; list of pairs, is list of token-pairs between
/seL4-l4v-10.1.1/HOL4/Manual/Quick/
H A Dquick.tex147 \hol{bossLib}{std_ss} & as above + pairs, options, sums, numeral evaluation \& eta reduction \\
166 \holnoref{pairSimps}{PAIR_ss} & rewrites for pairs \\
/seL4-l4v-10.1.1/HOL4/src/integer/
H A DOmegaSimple.sml179 and ~c is not <= d. X may be the sum of multiple ci * vi pairs.
/seL4-l4v-10.1.1/HOL4/src/new-datatype/
H A DNDDB.sml84 (*-- injective pairs --*)
/seL4-l4v-10.1.1/HOL4/src/postkernel/
H A DSharingTables.sml9 IDs (also known as Theory-X pairs, where X is a Name for a constant,
/seL4-l4v-10.1.1/HOL4/Manual/Translations/IT/Description/
H A DQuantHeuristics.tex112 \texttt{std\_qp} adds support for common datatypes like pairs or lists.
295 Records are similar to pairs, because they can always be instantiated. Here, it is interesting that the necessary
318 for pairs and the default one for records.
/seL4-l4v-10.1.1/HOL4/examples/HolBdd/
H A DDerivedBddRules.sml203 let val pairs = Varmap.dest varmap value
205 case assoc2 n pairs of
772 (* computes a list of pairs of the form (with j = 0,1,...,i-1) *)
/seL4-l4v-10.1.1/HOL4/src/quotient/Manual/
H A Dquotient.tex211 %in particular lists, pairs, sums, options, and function types.
214 and supporting the equivalence of aggregate types, such as lists and pairs.
247 of the integers from pairs of non-negative natural numbers,
250 the rationals from pairs of integers.
317 and does not deal with aggregate types, such as lists or pairs
370 lists, pairs, sums, and options have theorems pre-proven
587 Similarly, equivalence relations on pairs, sums, and options
679 lists, pairs, sums, and options) may be created by the following
701 which may be a complex type expression with lists, pairs, etc.
792 and pairs, th
[all...]
/seL4-l4v-10.1.1/graph-refine/
H A Dlogic.py1226 pairs = [pair for pair in pairings.get (node.fname, [])
1228 if not pairs:
1230 [pair] = pairs
/seL4-l4v-10.1.1/HOL4/examples/elliptic/
H A DsubtypeTools.sml447 (* Subtype context pairs: one for simplification, the other for *)
/seL4-l4v-10.1.1/HOL4/src/coretypes/
H A DPairRules.sml168 (* into pairs of the form (FST t,SND t). *)
238 (* us to find these pairs and map them back into nonpairs where *)
1606 and pairs = fst(strip_pforall con) value
1608 PSPECL (snd(itlist f pairs (hxs @ fxs,[]))) th
/seL4-l4v-10.1.1/HOL4/src/coretypes/pair-Manual/
H A Ddescription.tex40 about pairs (and tuples), particularly paired quantifications and abstractions.
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/src/
H A Dmklrtable.sml144 terminal * rule pairs. Each additional reduction is then merged into this
/seL4-l4v-10.1.1/HOL4/examples/set-theory/vbg/
H A DvbgsetScript.sml372 (* ordered pairs that work when classes are involved *)
/seL4-l4v-10.1.1/HOL4/examples/CCS/
H A DCCSConv.sml185 else (* actl_not is not empty => the list of pairs lp is not empty as well *)
/seL4-l4v-10.1.1/HOL4/src/1/
H A DPmatch.sml790 Given a list of (pattern,expression) pairs, mk_pattern_fn creates a term
797 handle HOL_ERR _ => err "empty list of (pattern,expression) pairs"
/seL4-l4v-10.1.1/HOL4/examples/acl2/ml/
H A DpolytypicLib.sml301 fun add_new (x,y) pairs =
302 union (all_pairs (x::ep x pairs) (y::sp y pairs)) pairs;
304 fun TC pairs = foldl (uncurry add_new) [] pairs
305 fun RTC pairs = TC (foldl (fn ((x,y),l) => insert (x,x) (insert (y,y) l)) pairs pairs)
/seL4-l4v-10.1.1/HOL4/Manual/Logic/
H A Dsyntax.tex47 consisting of ordered pairs $(x,y)$ with $x\in X$ and $y\in Y$, with
48 the usual set-theoretic coding of ordered pairs, \viz\
64 certain sets of ordered pairs. Thus the set $X\fun Y$ of all functions
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/
H A DrulesScript.sml479 | VT of VEXP # VEXP (* pairs *)
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/
H A DCFL_RulesScript.sml481 | VT of VEXP # VEXP (* pairs *)
/seL4-l4v-10.1.1/HOL4/src/enumfset/
H A DtcScript.sml93 (* Outer ^| s is meant just to trim off (x,x) pairs for x NOTIN s, and we

Completed in 309 milliseconds

1234567