Searched refs:subtypes (Results 1 - 23 of 23) sorted by relevance

/seL4-l4v-master/HOL4/examples/miller/subtypes/
H A DsubtypeTools.sml156 {facts : factdb, subtypes : vthm ovdiscrim};
193 PSUBTYPE_CONTEXT {facts = set_factdb, subtypes = empty_ovdiscrim};
197 val psubtype_context_subtypes = #subtypes o dest_psubtype_context;
198 fun psubtype_context_update_facts f (PSUBTYPE_CONTEXT {facts, subtypes}) =
199 PSUBTYPE_CONTEXT {facts = f facts, subtypes = subtypes};
200 fun psubtype_context_update_subtypes f (PSUBTYPE_CONTEXT {facts, subtypes}) =
201 PSUBTYPE_CONTEXT {facts = facts, subtypes = f subtypes};
236 add_string "#subtypes
408 val subtypes = SUBTYPE_CHECK false depth sc elt value
[all...]
H A DsubtypeScript.sml46 (* bool theory subtypes. *)
/seL4-l4v-master/HOL4/src/quotient/src/
H A Dquotient_optionScript.sml35 (* the corresponding functions/relations of the constituent subtypes *)
H A Dquotient_sumScript.sml34 (* the corresponding functions/relations of the constituent subtypes *)
H A Dquotient_pairScript.sml33 (* the corresponding functions/relations of the constituent subtypes *)
H A Dquotient_listScript.sml37 (* the corresponding functions/relations of the constituent subtypes *)
H A Dquotient_pred_setScript.sml38 (* the corresponding functions/relations of the constituent subtypes *)
H A DquotientScript.sml34 (* the corresponding functions/relations of the constituent subtypes *)
H A Dquotient.sml3762 (* nstys holds all subtypes of the types in natys which contain a type
/seL4-l4v-master/graph-refine/
H A Dsyntax.py313 def subtypes (self): member in class:Type
315 return structs[self.name].subtypes()
317 return [self] + self.el_typ.subtypes()
564 def subtypes (self): member in class:Struct
569 xs.extend(typ2.subtypes())
/seL4-l4v-master/HOL4/examples/acl2/examples/
H A Dmiller-rabin.sml13 "../../miller/subtypes",
/seL4-l4v-master/HOL4/src/quotient/choice/
H A DquotientScript.sml47 (* the corresponding functions/relations of the constituent subtypes *)
/seL4-l4v-master/HOL4/src/res_quan/Manual/
H A Ddescription.tex118 simulating subtypes and dependent types; the qualifying predicate $P$ can be
/seL4-l4v-master/HOL4/examples/miller/groups/
H A Dmult_groupScript.sml3 loadPath := ["../ho_prover","../subtypes","../RSA","../formalize"] @ !loadPath;
H A Dextra_arithScript.sml3 loadPath := ["../ho_prover","../subtypes","../formalize"] @ !loadPath;
/seL4-l4v-master/HOL4/examples/acl2/ml/
H A DencodeLib.sml1255 val subtypes = get_sub_types basetype t value
1260 subtypes
1972 val subtypes = sub_types t value
/seL4-l4v-master/HOL4/Manual/Description/
H A Dversion2.tex79 simulating subtypes and dependent types; the qualifying predicate $p$ can be
272 Meeting and implements a method of simulating subtypes and dependent
/seL4-l4v-master/HOL4/Manual/Translations/IT/Description/
H A Dversion2.tex79 simulating subtypes and dependent types; the qualifying predicate $p$ can be
272 Meeting and implements a method of simulating subtypes and dependent
/seL4-l4v-master/HOL4/examples/set-theory/zfset/
H A DzfsetScript.sml1259 (* Restrictions of functions and binary operators to subtypes. *)
/seL4-l4v-master/HOL4/src/quotient/Manual/
H A Dquotient.tex667 equivalence relations for component subtypes, and return
677 Given equivalence theorems for the constituent subtypes, the
1530 constituent subtypes.
1594 % constituent subtypes of the aggregate type.
1602 given the quotient theorems for the subtypes which are the arguments to
1633 for the constituent subtypes that are arguments
1817 %that the constituent subtypes
/seL4-l4v-master/isabelle/src/Doc/Logics/document/
H A DCTT.tex569 versions of the other rules permit rewriting of subterms and subtypes.
/seL4-l4v-master/l4v/isabelle/src/Doc/Logics/document/
H A DCTT.tex569 versions of the other rules permit rewriting of subterms and subtypes.
/seL4-l4v-master/HOL4/Manual/Logic/
H A Dsemantics.tex1137 mechanism for introducing new types which are subtypes of existing

Completed in 165 milliseconds