Searched refs:function (Results 101 - 125 of 876) sorted by relevance

1234567891011>>

/seL4-l4v-master/HOL4/src/simp/src/
H A DTraverse.sig38 * A continuation function, to be used if the reducer needs to
46 * Note that this function is *not* the same as
51 * collected by its "addcontext" function.
57 * A continuation function, to be used if the reducer
/seL4-l4v-master/HOL4/tools-poly/poly/
H A DBinaryset.sig80 [app f s] applies function f to the elements of s, in increasing
83 [revapp f s] applies function f to the elements of s, in decreasing
86 [foldl f e s] applies the folding function f to the entries of the
89 [foldr f e s] applies the folding function f to the entries of the
/seL4-l4v-master/isabelle/src/Tools/Metis/src/
H A DAtomNet.sig38 (* These function return OVER-APPROXIMATIONS! *)
H A DAtomNet.sml49 (* These function return OVER-APPROXIMATIONS! *)
H A DLiteralNet.sig40 (* These function return OVER-APPROXIMATIONS! *)
H A DPortablePolyml.sml40 (* Timing function applications. *)
H A DTermNet.sig40 (* These function return OVER-APPROXIMATIONS! *)
/seL4-l4v-master/HOL4/examples/temporal_deep/src/translations/
H A DtranslationsLib.sig23 * This function does the same translation as ltl2omega_rewrite.
25 * tells the function whether to search for multiple occurences of
36 * This function is similar to ltl2omega.
40 * This function is used to implement rltl2fctl and ltl2fctl
/seL4-l4v-master/l4v/isabelle/src/Tools/Metis/src/
H A DAtomNet.sig38 (* These function return OVER-APPROXIMATIONS! *)
H A DAtomNet.sml49 (* These function return OVER-APPROXIMATIONS! *)
H A DLiteralNet.sig40 (* These function return OVER-APPROXIMATIONS! *)
H A DPortablePolyml.sml40 (* Timing function applications. *)
H A DTermNet.sig40 (* These function return OVER-APPROXIMATIONS! *)
/seL4-l4v-master/HOL4/src/monad/
H A Dmonadsyntax.sig6 (* loading this module installs this function as an absyn transformer
/seL4-l4v-master/HOL4/src/AI/sml_inspection/
H A DsmlExecute.sig6 (* execution function *)
/seL4-l4v-master/l4v/proof/infoflow/tools/
H A Dauthority2infoflow-CaML.ml45 let rec map f = function
53 let rec unite = function
127 (* subjectReadsp g l x acc is the function that checks is x is in the "subjectReads g l" set, where acc is that set during the fixpoint computation *)
174 (* subjectAffectsp g l x acc is the function that checks is x is in the "subjectAffects g l" set, where acc is that set during the fixpoint computation *)
236 let rec clear_infoflow =function
347 (* apply f l applies recursively function f, of type 'a -> Unit, on the elements of l *)
349 let rec apply f = function
367 (* we define the tarjanp function, computing the partition of the infoflow graph g in strongly connected components *)
386 let rec aux = function
425 let rec string2int_labels name_t = function
[all...]
/seL4-l4v-master/HOL4/polyml/mlsource/MLCompiler/CodeTree/
H A DCODETREE_REMOVE_REDUNDANT.sml37 (* This function annotates the tree with information about how variables are used. This assists
40 bindings in case they are required. That was originally its only function; hence the name. *)
64 (* This array records the way the arguments are used inside the function. *)
79 (* If we have called this function somewhere and used the result that gives us a hint on the
80 preferred result. If the function is recursive, though, we can't assume anything
82 example they could be passed into an argument function which may require more fields.
197 (* If we have included a function in this
292 | doClean codeUse (Eval{function, argList, resultType}) =
294 the function is a variable it will be marked as "called". *)
301 function
[all...]
/seL4-l4v-master/HOL4/src/num/arith/src/
H A DInstance.sml31 re-instantiating. The first argument is a function for obtaining a
33 function should include in its result list any variables in the
H A DPrenex.sml48 fun failwith function = raise HOL_ERR{origin_structure = "Prenex",
49 origin_function = function,
/seL4-l4v-master/HOL4/src/num/reduce/src/
H A DreduceLib.sml9 fun failwith function = raise mk_HOL_ERR "reduceLib" function "";
/seL4-l4v-master/HOL4/src/parse/
H A DTermParse.sig44 For this reason, prim_ctxt_termS takes a function parameter which is given
53 and then use the p function from then on; that way the precedence matrix
/seL4-l4v-master/HOL4/src/search/
H A DdirGraphScript.sml15 (* A graph G is a function of type 'a -> 'a list. *)
24 (* Definition of reachability in a directed graph represented as a function *)
/seL4-l4v-master/HOL4/examples/dev/sw2/
H A Dcompiler.sml186 (* 1. enforce caller-save-style function calls *)
191 (* Replace function f with f' when f is called. *)
194 val renamed = (* Format: [function's old name |-> function's new name] *)
224 (* rename the function name in function application *)
/seL4-l4v-master/HOL4/src/datatype/
H A DDataSize.sml48 * Term size, as a function of types. The function gamma maps type *
50 * translated into the constant function that returns 0. The function theta *
53 * When actually building a measure function, the behaviour of theta is *
54 * changed to be such that it maps type variables to the constant function *
/seL4-l4v-master/HOL4/src/pred_set/src/
H A DPGspec.sml34 (* Local function: MK_PAIR *)
59 (* Local function: EXISTS_TUPLE_CONV *)
93 (* Local function: PAIR_EQ_CONV. *)
122 (* Local function: ELIM_EXISTS_CONV. *)
143 (* Local function: PROVE_EXISTS. *)
160 (* Internal function: list_variant *)

Completed in 155 milliseconds

1234567891011>>