Searched refs:depth (Results 126 - 147 of 147) sorted by relevance
123456
| /seL4-l4v-master/HOL4/src/parse/ |
| H A D | Parse.sml | 1035 fun result (tyg, tmg) _ _ ppfns (pgr,lgr,rgr) depth tm =
|
| /seL4-l4v-master/HOL4/src/HolSmt/ |
| H A D | Z3_ProofReplay.sml | 905 (* We use a depth-first post-order traversal of the proof, checking
|
| /seL4-l4v-master/HOL4/src/IndDef/Manual/ |
| H A D | paper.tex | 710 sometimes referred to as induction over the structure (or the depth) of
|
| /seL4-l4v-master/HOL4/examples/STE/ |
| H A D | STEScript.sml | 1338 (* Defining Sequence beyond the depth of a trajectory formula is X *)
|
| /seL4-l4v-master/isabelle/src/Doc/Logics_ZF/document/ |
| H A D | FOL.tex | 299 depth-first search, to solve subgoal~$i$.
|
| H A D | ZF.tex | 2151 (The proof uses depth-first search.)
|
| /seL4-l4v-master/l4v/isabelle/src/Doc/Logics_ZF/document/ |
| H A D | FOL.tex | 299 depth-first search, to solve subgoal~$i$.
|
| H A D | ZF.tex | 2151 (The proof uses depth-first search.)
|
| /seL4-l4v-master/HOL4/src/1/ |
| H A D | selftest.sml | 521 fun bfnprinter gs be sys (ppfns : term_pp_types.ppstream_funs) gravs depth t =
|
| H A D | Drule.sml | 1539 * Modify bound variable names at depth. (Not very efficient...) *
|
| /seL4-l4v-master/HOL4/Manual/Description/ |
| H A D | misc.tex | 1125 \item[\texttt{depth}=$n$]
1126 Causes printing to be done with a maximum print depth of $n$; see Section~\ref{sec:pretty-print-depth}.
|
| H A D | holCheck.tex | 462 As long as we are restricted to model checking, this internal formal model is not important. However, \hc{} has some experimental support for model decomposition using \HOL{} (see \S\ref{sec:decomp} for details). This requires manipulation of the formal model and then it becomes important to know what the models contain. For the moment this support is automatic, so in-depth knowledge of formal models is not required. This subsection is here, for the moment, mainly as an explanation for what we see in the \hc{} output theorems.
|
| /seL4-l4v-master/HOL4/Manual/Translations/IT/Description/ |
| H A D | holCheck.tex | 462 As long as we are restricted to model checking, this internal formal model is not important. However, \hc{} has some experimental support for model decomposition using \HOL{} (see \S\ref{sec:decomp} for details). This requires manipulation of the formal model and then it becomes important to know what the models contain. For the moment this support is automatic, so in-depth knowledge of formal models is not required. This subsection is here, for the moment, mainly as an explanation for what we see in the \hc{} output theorems.
|
| H A D | libraries.tex | 1606 successo nel fare questo, o falliranno con un eccezione ``depth exceeded''. Se
|
| /seL4-l4v-master/seL4/manual/parts/ |
| H A D | threads.tex | 635 the underlying hardware primitives and operations. As a result an in depth familiarity with
|
| /seL4-l4v-master/HOL4/Manual/Tutorial/ |
| H A D | logic.tex | 1428 than a reasonable depth.
|
| /seL4-l4v-master/HOL4/examples/HolCheck/ |
| H A D | muCheck.sml | 535 (* ado: max same_quant nesting depth is 2 and immediate outer bv (if any) has the same fp operator as this one,
|
| /seL4-l4v-master/HOL4/examples/theorem-prover/lisp-runtime/implementation/ |
| H A D | lisp_invScript.sml | 1446 (* depth limit *)
|
| /seL4-l4v-master/isabelle/src/Doc/Tutorial/document/ |
| H A D | rules.tex | 1786 \isa{fast} but it uses a best-first search instead of depth-first search.
|
| /seL4-l4v-master/l4v/isabelle/src/Doc/Tutorial/document/ |
| H A D | rules.tex | 1786 \isa{fast} but it uses a best-first search instead of depth-first search.
|
| /seL4-l4v-master/l4v/isabelle/src/Doc/Nitpick/document/ |
| H A D | root.tex | 997 depth}~= 1:
|
| /seL4-l4v-master/isabelle/src/Doc/Nitpick/document/ |
| H A D | root.tex | 997 depth}~= 1:
|
Completed in 484 milliseconds
123456