Searched refs:Function (Results 76 - 100 of 115) sorted by relevance
12345
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/ParseTree/ |
H A D | TYPECHECK_PARSETREE.sml | 570 (* Function must be a constructor. *) 787 valTypeMessage (lex, typeEnv) ("Function:", f, funType), 804 valTypeMessage (lex, typeEnv) ("Function:", f, funType), 1876 valTypeMessage (lex, typeEnv) ("Function:", fvalAsTree, funType),
|
H A D | CODEGEN_PARSETREE.sml | 655 (* Function *) 1388 (* Function body. The debug state has a "start of function" entry that
|
/seL4-l4v-10.1.1/HOL4/examples/acl2/ml/ |
H A D | polytypicLib.sml | 1030 val func_exn = mkDebugExn "SPLIT_HFUN_CONV" "HO Function supplied is of the form \"(f x = A x) /\\ (g x =...\""; 1043 val _ = assert' [("Function list is not a list of variables",all is_var)] fvs 1429 val exn1 = debug_exn "Function clauses are not all of the form \"!x x0 .. xn. f x = A x0 ... xn\"" 1481 [("Function term is mutually recursive on different types", 1840 "Function term missing from existence proof") 2412 (* Function generators: *) 3459 (* Function generators *)
|
H A D | sexp.sml | 121 (* Function to add a list of theorems to acl2_simps *) 173 (* Function to add an entry to acl2_names *) 868 (* Function to add a list of string abbreviations to string_abbrevs *)
|
/seL4-l4v-10.1.1/HOL4/examples/acl2/examples/M1/ |
H A D | sexp.sml | 121 (* Function to add a list of theorems to acl2_simps *) 173 (* Function to add an entry to acl2_names *) 942 (* Function to add a list of string abbreviations to string_abbrevs *)
|
/seL4-l4v-10.1.1/HOL4/examples/acl2/examples/acl2-hol-ltl-paper-example/ |
H A D | sexp.sml | 121 (* Function to add a list of theorems to acl2_simps *) 173 (* Function to add an entry to acl2_names *) 868 (* Function to add a list of string abbreviations to string_abbrevs *)
|
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/ |
H A D | TYPEIDCODE.sml | 125 level: level (* Function nesting level. *) 208 createTypeValue{ (* Function. *)
|
/seL4-l4v-10.1.1/HOL4/examples/diningcryptos/ |
H A D | formalizeUseful.sml | 172 (* Function cacheing *)
|
H A D | subtypeUseful.sml | 172 (* Function cacheing *)
|
/seL4-l4v-10.1.1/HOL4/examples/l3-machine-code/common/ |
H A D | Import.sml | 231 (* Function call *)
|
/seL4-l4v-10.1.1/HOL4/src/tfl/src/ |
H A D | RW.sml | 598 (* Function eta_rhs packages up the new rhs, eta-expanding it *)
|
/seL4-l4v-10.1.1/HOL4/Manual/Interaction/ |
H A D | HOL-interaction.tex | 233 Function can be defined using {\tt Define}, \eg{} square is defined as follows.
|
/seL4-l4v-10.1.1/HOL4/examples/HolBdd/ |
H A D | DerivedBddRules.sml | 132 (* Function that always raises exception fail *)
|
/seL4-l4v-10.1.1/HOL4/polyml/basis/ |
H A D | Socket.sml | 658 (* Function to create the results. *)
|
/seL4-l4v-10.1.1/HOL4/Manual/Tutorial/ |
H A D | logic.tex | 199 \paragraph{Function application types} 259 \paragraph{Function types}
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/ |
H A D | mechReasoning.sml | 455 (* Specification for Function Calls *)
|
/seL4-l4v-10.1.1/HOL4/src/boss/ |
H A D | prove_base_assumsScript.sml | 59 | const_name (["Function"],"^") = {Thy=Thy,Name="Function_pow"}
|
/seL4-l4v-10.1.1/HOL4/src/datatype/ |
H A D | Datatype.sml | 383 treating elements in loops as equivalent. Function returns a list of
|
/seL4-l4v-10.1.1/HOL4/src/postkernel/ |
H A D | Theory.sml | 1023 Function f tries to extend current theory. If that fails then
|
/seL4-l4v-10.1.1/HOL4/src/quotient/src/ |
H A D | quotientScript.sml | 44 (* Function (ty1 -> ty2) (\x. f x) (rep1 --> abs2) (rep1 =-> abs2) *)
|
/seL4-l4v-10.1.1/HOL4/examples/separationLogic/src/holfoot/ |
H A D | holfootParser.sml | 798 Function calls might add to both sets by either their call-by-reference parameters or by
|
/seL4-l4v-10.1.1/HOL4/examples/ARM/arm6-verification/ |
H A D | coreScript.sml | 782 (* The State Function ------------------------------------------------------ *)
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/ |
H A D | mechReasoning.sml | 674 (* Specification for Function Calls *)
|
/seL4-l4v-10.1.1/HOL4/src/quotient/Manual/ |
H A D | quotient.tex | 1678 %(* Function (ty1 -> ty2) (\x. f x) (rep1 --> abs2) (rep1 =-> abs2) *) 1926 \begin{theorem}[Function quotients] 2394 \begin{theorem}[Function quotient extension]
|
/seL4-l4v-10.1.1/HOL4/examples/dev/ |
H A D | composeScript.sml | 37 (* Function used with PAT_X_ASSUM: PAT_X_ASSUM <term> kill *)
|
Completed in 285 milliseconds
12345