Searched refs:first (Results 251 - 275 of 742) sorted by relevance

<<11121314151617181920>>

/seL4-l4v-master/HOL4/src/prekernel/
H A DFinalNet-sig.sml49 "most specific match first" order.
/seL4-l4v-master/HOL4/src/refute/
H A DAC.sml27 end handle HOL_ERR _ => first (fn th => aconv (concl th) tm) thl
/seL4-l4v-master/HOL4/src/simp/src/
H A DBackchainingLib.sml77 (* As a first simple test prove just R1 again. *)
H A DSequence.sml32 (*The list of the first n elements, paired with rest of sequence.
/seL4-l4v-master/HOL4/tools/Holmake/
H A Dunix-systeml.sml4 very first thing compiled by the HOL build process so it absolutely
H A DwinNT-systeml.sml4 It is the very first thing compiled by the HOL build process so it
/seL4-l4v-master/HOL4/tools-poly/Holmake/
H A Dunix-systeml.sml4 very first thing compiled by the HOL build process so it absolutely
/seL4-l4v-master/HOL4/Manual/Tutorial/
H A Dpreface.tex18 This document, \TUTORIAL, is intended to be the first item read by new
/seL4-l4v-master/HOL4/doc/hol-mode/
H A Dhol-mode.tex11 All of these commands are executed by first typing the HOL prefix
/seL4-l4v-master/HOL4/examples/HolCheck/
H A DctlCheck.sml44 if Option.isSome(#th(ic)) (* possibly empty if first call *)
/seL4-l4v-master/HOL4/examples/acl2/examples/M1/
H A Dcomplex_rationalScript.sml166 (* DIVIDES : int->int->bool tests if first argument divides second argument *)
/seL4-l4v-master/HOL4/examples/acl2/examples/acl2-hol-ltl-paper-example/
H A Dcomplex_rationalScript.sml166 (* DIVIDES : int->int->bool tests if first argument divides second argument *)
/seL4-l4v-master/HOL4/examples/acl2/ml/
H A Dcomplex_rationalScript.sml166 (* DIVIDES : int->int->bool tests if first argument divides second argument *)
/seL4-l4v-master/HOL4/polyml/mlsource/MLCompiler/
H A DExportTree.sml32 | PTreferences of bool * location list (* The references to the ID. The first is true if this is exported. *)
/seL4-l4v-master/isabelle/src/Pure/Isar/
H A Dtoken.scala252 def first = tokens.head
253 def rest = new Token_Reader(tokens.tail, pos.advance(first))
/seL4-l4v-master/isabelle/src/Tools/Metis/src/
H A DMap.sig74 {first : 'key * 'a -> 'c option,
H A DTerm.sml12 (* A type of first order logic terms. *)
499 fn tm => Useful.first (fn q => dest q tm) quants
688 first (List.map bracket bracks) ||
689 first (List.map quantifier quants)
H A DUseful.sig118 val first : ('a -> 'b option) -> 'a list -> 'b option value
/seL4-l4v-master/HOL4/examples/temporal_deep/src/translations/
H A DtranslationsLib.sig48 * a model checker. The first parameter is always the knows fast switch
/seL4-l4v-master/HOL4/help/src-sml/
H A DDoc2Txt.sml127 | find_docpart (_ :: t) = raise Fail "Can't happen \\DOC not first entry"
/seL4-l4v-master/HOL4/examples/machine-code/acl2/
H A Dm1_progLib.sml23 val th = match_thm (first (can match_thm) m1_thms)
/seL4-l4v-master/HOL4/examples/set-theory/zfset/
H A Dzfset_axiomsScript.sml8 (* (i.e. first order) ZF plus the existence of some large cardinals. *)
/seL4-l4v-master/l4v/isabelle/src/Pure/Isar/
H A Dtoken.scala252 def first = tokens.head
253 def rest = new Token_Reader(tokens.tail, pos.advance(first))
/seL4-l4v-master/l4v/isabelle/src/Tools/Metis/src/
H A DMap.sig74 {first : 'key * 'a -> 'c option,
H A DTerm.sml12 (* A type of first order logic terms. *)
499 fn tm => Useful.first (fn q => dest q tm) quants
688 first (List.map bracket bracks) ||
689 first (List.map quantifier quants)

Completed in 229 milliseconds

<<11121314151617181920>>