Searched refs:terminate (Results 26 - 50 of 62) sorted by relevance
123
| /seL4-l4v-10.1.1/isabelle/src/Pure/Tools/ |
| H A D | build.scala | 319 def terminate: Unit = future_result.cancel
325 Some(Event_Timer.request(Time.now() + info.timeout) { terminate })
538 for ((_, (_, job)) <- running) job.terminate
|
| /seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Tools/ |
| H A D | build.scala | 319 def terminate: Unit = future_result.cancel
325 Some(Event_Timer.request(Time.now() + info.timeout) { terminate })
538 for ((_, (_, job)) <- running) job.terminate
|
| /seL4-l4v-10.1.1/HOL4/examples/dev/sw/examples/ |
| H A D | simple_examples.sml | 126 (*equivalence proof does not terminate, therefore use false for equivalence check parameter
|
| /seL4-l4v-10.1.1/HOL4/src/search/ |
| H A D | bftScript.sml | 27 (* terminate. *)
|
| H A D | dftScript.sml | 27 (* terminate. *)
|
| /seL4-l4v-10.1.1/HOL4/polyml/basis/ |
| H A D | Unix.sml | 121 terminate this process. We're supposed to
|
| H A D | OS.sml | 102 val terminate : status -> 'a value
1168 fun terminate n = (doCall n; raise Fail "never") function
|
| H A D | BasicStreamIO.sml | 544 (* Flush the stream, terminate it and return the underlying writer. *)
|
| H A D | Thread.sml | 88 a thread should be allowed to clean up and terminate by using the
|
| H A D | FinalPolyML.sml | 327 OS.Process.terminate OS.Process.failure
657 (* Allow ^C to terminate the debugger and raise Interrupt in
|
| /seL4-l4v-10.1.1/HOL4/src/holyhammer/ |
| H A D | holyHammer.sml | 182 Run function in parallel and terminate as soon as one returned a
|
| /seL4-l4v-10.1.1/HOL4/Manual/Interaction/ |
| H A D | HOL-interaction.tex | 228 Press {\tt M-h~C-c} to interrupt HOL4 --- useful when a tactic fails to terminate
229 (\eg{} {\tt\small metis\_tac} often fails to terminate when unsuccessfully applied).
|
| /seL4-l4v-10.1.1/isabelle/src/Pure/PIDE/ |
| H A D | session.scala | 557 prover.get.terminate
|
| /seL4-l4v-10.1.1/l4v/isabelle/src/Pure/PIDE/ |
| H A D | session.scala | 557 prover.get.terminate
|
| /seL4-l4v-10.1.1/HOL4/examples/decidable_separationLogic/doc/ |
| H A D | ds.tex | 252 finite, this recursion has to terminate and the definition is well founded.
1063 terminate. That's obvious for step 1. Step 2 may loop because of applications
1067 terminate and transform ${\eta,\pi,\Pi,\Sigma}\vdash{\Pi',\Sigma'}$ to a
|
| H A D | presentation-content.tex | 332 \item continued applications of inferences will terminate
|
| /seL4-l4v-10.1.1/HOL4/src/HolQbf/ |
| H A D | QbfCertificate.sml | 93 "resolution: '0' expected to terminate list of clauses"
|
| /seL4-l4v-10.1.1/HOL4/src/num/termination/ |
| H A D | TotalDefn.sml | 2 Proving that definitions terminate.
|
| /seL4-l4v-10.1.1/HOL4/src/tactictoe/src/ |
| H A D | tttSearch.sml | 56 do (debug_search ("terminate thread " ^ int_to_string pid);
|
| /seL4-l4v-10.1.1/HOL4/tools/Holmake/ |
| H A D | basis2002.sml | 522 val terminate : status -> 'a value
|
| /seL4-l4v-10.1.1/isabelle/src/Doc/Logics/document/ |
| H A D | LK.tex | 615 frequently fails to terminate. It is generally unsuitable for depth-first
|
| /seL4-l4v-10.1.1/isabelle/src/Doc/Tutorial/document/ |
| H A D | fp.tex | 16 they must terminate for all inputs. Lazy data structures are not
|
| /seL4-l4v-10.1.1/l4v/isabelle/src/Doc/Logics/document/ |
| H A D | LK.tex | 615 frequently fails to terminate. It is generally unsuitable for depth-first
|
| /seL4-l4v-10.1.1/l4v/isabelle/src/Doc/Tutorial/document/ |
| H A D | fp.tex | 16 they must terminate for all inputs. Lazy data structures are not
|
| /seL4-l4v-10.1.1/HOL4/examples/fun-op-sem/ml/ |
| H A D | typeSoundScript.sml | 1598 well-typed expressions do not fail, if they terminate with a value then the
1599 value has the same type as the original expression, and if they terminate with
|
Completed in 155 milliseconds
123