Searched refs:version (Results 501 - 525 of 687) sorted by relevance
<<2122232425262728
/seL4-l4v-10.1.1/HOL4/polyml/basis/ |
H A D | String.sml | 7 License version 2.1 as published by the Free Software Foundation. 248 as a cast version of it. *) 809 be \x. That's confirmed by the latest version of 1040 (* TODO: More efficient version. *)
|
H A D | Vector.sml | 8 License version 2.1 as published by the Free Software Foundation.
|
H A D | Word8Array.sml | 8 License version 2.1 as published by the Free Software Foundation.
|
H A D | BasicStreamIO.sml | 8 version 2.1 of the License, or (at your option) any later version.
|
H A D | Real.sml | 8 License version 2.1 as published by the Free Software Foundation. 246 that in the current version of the Basis library. *)
|
H A D | Thread.sml | 8 License version 2.1 as published by the Free Software Foundation. 675 defined here using the underlying calls. The original version with
|
/seL4-l4v-10.1.1/l4v/proof/infoflow/tools/ |
H A D | authority2infoflow-CaML.ml | 5 * the GNU General Public License version 2. Note that NO WARRANTY is provided.
|
/seL4-l4v-10.1.1/seL4/manual/parts/ |
H A D | bootup.tex | 5 % the GNU General Public License version 2. Note that NO WARRANTY is provided.
|
H A D | ipc.tex | 5 % the GNU General Public License version 2. Note that NO WARRANTY is provided.
|
/seL4-l4v-10.1.1/HOL4/src/1/ |
H A D | dep_rewrite.sml | 68 (* and the second contains the rewritten version of the original *) 80 (* version of dependent rewriting. *)
|
/seL4-l4v-10.1.1/HOL4/src/IndDef/ |
H A D | InductiveDefinition.sml | 30 version of variant also does not vary away from constants with the 428 (* Simplified version of MATCH_MP_TAC to avoid quantifier troubles. *)
|
/seL4-l4v-10.1.1/HOL4/tools/ |
H A D | buildutils.sml | 405 fun bincopy file path = (* Dead simple file copy - binary version *) 974 otherwise the log's bad version will be recorded *)
|
/seL4-l4v-10.1.1/HOL4/examples/lambda/other-models/ |
H A D | ncScript.sml | 169 (* Weaker version of Alpha Conversion. *) 681 (* can now prove a simple version of induction, where you don't want that
|
/seL4-l4v-10.1.1/HOL4/Manual/Interaction/ |
H A D | HOL-interaction.tex | 69 If your version of emacs does not highlight the active region, also add the following line 286 readable version of the theory is stored under {\tt mytreeTheory.sig}.
|
/seL4-l4v-10.1.1/HOL4/examples/HolBdd/ |
H A D | DerivedBddRules.sml | 60 (* recursive. But a tail recursive version of foldr is easy to uptain *) 466 ** The preliminary version below separates the substitution
|
/seL4-l4v-10.1.1/HOL4/examples/PSL/regexp/ |
H A D | matcherScript.sml | 1192 (* A version of the automata matcher that is easy to execute. *) 1464 (* Correctness of this version of the automata matcher. *)
|
/seL4-l4v-10.1.1/HOL4/examples/acl2/ml/ |
H A D | sexpScript.sml | 1202 (* Old version (some axioms untrue with this) 1561 (* HOL version of Matt's ACL2 function imported-symbol-names *)
|
/seL4-l4v-10.1.1/isabelle/src/Doc/Logics_ZF/document/ |
H A D | ZF.tex | 13 Wellordering Theorem and a version of Ramsey's Theorem. \texttt{ZF} provides 31 \section{Which version of axiomatic set theory?} 147 used to define binary union. The Isabelle version goes on to define 2041 define the tail-recursive version of \isa{n\_nodes}, using an 2060 Now, we can use \isa{n\_nodes\_aux} to define a tail-recursive version 2104 \footnote{It appeared in CADE~\cite{paulson-CADE}; a longer version is 2433 Directory \isa{HOL/IMP} contains a mechanised version of a semantic 2448 \item Theory \isa{Ramsey} proves the finite exponent 2 version of
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Doc/Logics_ZF/document/ |
H A D | ZF.tex | 13 Wellordering Theorem and a version of Ramsey's Theorem. \texttt{ZF} provides 31 \section{Which version of axiomatic set theory?} 147 used to define binary union. The Isabelle version goes on to define 2041 define the tail-recursive version of \isa{n\_nodes}, using an 2060 Now, we can use \isa{n\_nodes\_aux} to define a tail-recursive version 2104 \footnote{It appeared in CADE~\cite{paulson-CADE}; a longer version is 2433 Directory \isa{HOL/IMP} contains a mechanised version of a semantic 2448 \item Theory \isa{Ramsey} proves the finite exponent 2 version of
|
/seL4-l4v-10.1.1/isabelle/src/Pure/Tools/ |
H A D | server.scala | 538 "isabelle_version" -> Distribution.version))
|
/seL4-l4v-10.1.1/HOL4/polyml/ |
H A D | Makefile.in | 217 *) (install-info --version) >/dev/null 2>&1;; \ 751 if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ 1171 # It then builds a version of poly containing the new compiler.
|
H A D | configure | 1204 -version | --version | --versio | --versi | --vers | -V) 1425 -V, --version display version information and exit 1532 --with-system-libffi use the version of libffi installed on your system 1533 rather than the version supplied with poly 3282 case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 3296 test -d ./--version && rmdir ./--version 3443 if (cygpath --version) >/de [all...] |
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Tools/ |
H A D | server.scala | 538 "isabelle_version" -> Distribution.version))
|
/seL4-l4v-10.1.1/HOL4/examples/dev/ |
H A D | compile.sml | 1138 (* A faster version of STANDARDIZE_EXISTS_CONV. *) 1171 (print"STANDARDIZE_EXISTS_CONV: new version broken,\ 1172 \ so calling the old version"; 1225 (print"STANDARDIZE_EXISTS_CONV: new version broken,\ 1226 \ so calling the old version";
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/ |
H A D | Makefile.in | 358 *) (install-info --version) >/dev/null 2>&1;; \ 620 src/tile/ffitarget.h src/tile/tile.S libtool-version \ 701 libffi_la_LDFLAGS = -no-undefined -version-info `grep -v '^\#' $(srcdir)/libtool-version` $(LTLDFLAGS) $(AM_LTLDFLAGS) 1441 if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
|
Completed in 312 milliseconds
<<2122232425262728