Searched refs:version (Results 501 - 525 of 687) sorted by relevance

<<2122232425262728

/seL4-l4v-10.1.1/HOL4/polyml/basis/
H A DString.sml7 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 DVector.sml8 License version 2.1 as published by the Free Software Foundation.
H A DWord8Array.sml8 License version 2.1 as published by the Free Software Foundation.
H A DBasicStreamIO.sml8 version 2.1 of the License, or (at your option) any later version.
H A DReal.sml8 License version 2.1 as published by the Free Software Foundation.
246 that in the current version of the Basis library. *)
H A DThread.sml8 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 Dauthority2infoflow-CaML.ml5 * the GNU General Public License version 2. Note that NO WARRANTY is provided.
/seL4-l4v-10.1.1/seL4/manual/parts/
H A Dbootup.tex5 % the GNU General Public License version 2. Note that NO WARRANTY is provided.
H A Dipc.tex5 % the GNU General Public License version 2. Note that NO WARRANTY is provided.
/seL4-l4v-10.1.1/HOL4/src/1/
H A Ddep_rewrite.sml68 (* 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 DInductiveDefinition.sml30 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 Dbuildutils.sml405 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 DncScript.sml169 (* 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 DHOL-interaction.tex69 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 DDerivedBddRules.sml60 (* 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 DmatcherScript.sml1192 (* 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 DsexpScript.sml1202 (* 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 DZF.tex13 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 DZF.tex13 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 Dserver.scala538 "isabelle_version" -> Distribution.version))
/seL4-l4v-10.1.1/HOL4/polyml/
H A DMakefile.in217 *) (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 Dconfigure1204 -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 Dserver.scala538 "isabelle_version" -> Distribution.version))
/seL4-l4v-10.1.1/HOL4/examples/dev/
H A Dcompile.sml1138 (* 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 DMakefile.in358 *) (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