fact stringlengths 5 23.4k | type stringclasses 2
values | library stringclasses 36
values | imports listlengths 0 55 | filename stringlengths 14 86 | symbolic_name stringlengths 1 68 | docstring stringclasses 1
value |
|---|---|---|---|---|---|---|
intersect : #a:eqtype -> #f:cmp a -> ordset a f -> ordset a f -> Tot (ordset a f) val choose : #a:eqtype -> #f:cmp a -> s:ordset a f -> Tot (option a) | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | intersect | |
remove : #a:eqtype -> #f:cmp a -> a -> ordset a f -> Tot (ordset a f) val size : #a:eqtype -> #f:cmp a -> ordset a f -> Tot nat val subset : #a:eqtype -> #f:cmp a -> ordset a f -> ordset a f -> Tot bool | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | remove | |
singleton : #a:eqtype -> #f:cmp a -> a -> Tot (ordset a f) val minus : #a:eqtype -> #f:cmp a -> ordset a f -> ordset a f -> Tot (ordset a f) val strict_subset: #a:eqtype -> #f:cmp a -> ordset a f -> ordset a f -> Tot bool | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | singleton | |
eq_lemma : #a:eqtype -> #f:cmp a -> s1:ordset a f -> s2:ordset a f -> Lemma (requires (equal s1 s2)) (ensures (s1 = s2)) [SMTPat (equal s1 s2)] val mem_empty: #a:eqtype -> #f:cmp a -> x:a -> Lemma (requires True) (ensures (not (mem #a #f x (empty #a #f)))) [SMTPat (mem #a #f x (empty #a #f))] val mem_singleton: #a:eqty... | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | eq_lemma | |
choose_s : #a:eqtype -> #f:cmp a -> s:ordset a f -> Lemma (requires (not (s = (empty #a #f)))) (ensures (Some? (choose #a #f s) /\ s = union #a #f (singleton #a #f (Some?.v (choose #a #f s))) (remove #a #f (Some?.v (choose #a #f s)) s))) [SMTPat (choose #a #f s)] val mem_remove: #a:eqtype -> #f:cmp a -> x:a -> y:a -> s... | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | choose_s | |
as_set : #a:eqtype -> #f:cmp a -> ordset a f -> Tot (S.set a) val lemma_as_set_mem (#a:eqtype) (#f:cmp a) (s:ordset a f) (x:a) : Lemma (mem x s <==> S.mem x (as_set s)) [SMTPat (mem x s); SMTPat (S.mem x (as_set s))] val lemma_as_set_disjoint (#a:eqtype) (#f:cmp a) (s1 s2:ordset a f) : Lemma (intersect s1 s2 = empty <=... | val | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | as_set | |
total_order (a:eqtype) (f: (a -> a -> Tot bool)) = (forall a1 a2. (f a1 a2 /\ f a2 a1) ==> a1 = a2) (* anti-symmetry *) | type | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | total_order | |
cmp (a:eqtype) = f:(a -> a -> Tot bool){total_order a f} | type | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | cmp | |
condition a = a -> bool | type | ulib | [
"FStar.Set"
] | ulib/experimental/FStar.OrdSet.fsti | condition | |
dummy_range : range val open_with (t:term) (v:term) : term val open_term (t:term) (v:var) : term val close_term (t:term) (v:var) : term val rename (t:term) (x y:var) : term | val | ulib | [
"FStar.Reflection.V2",
"FStar.Range"
] | ulib/experimental/FStar.Reflection.Typing.Builtins.fsti | dummy_range | |
bindings_ok_for_pat : env -> list R.binding -> pattern -> Type0 val bindings_ok_pat_constant : g:env -> c:R.vconst -> Lemma (bindings_ok_for_pat g [] (Pat_Constant c)) let bindings_ok_for_branch (g:env) (bs : list R.binding) (br : branch) : Type0 = bindings_ok_for_pat g bs (fst br) let bindings_ok_for_branch_N (g:env) ... | val | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | bindings_ok_for_pat | |
subst_elt = | DT : nat -> term -> subst_elt | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | subst_elt | |
u = pack_ln (Tv_Type u) | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | u | |
term_ctxt = | Ctxt_hole : term_ctxt | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | term_ctxt | |
univ_eq : universe -> universe -> Type0 = | UN_Refl : | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | univ_eq | |
type comp_typ = tot_or_ghost & typ | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | type | |
relation = | R_Eq | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | relation | |
non_informative : env -> term -> Type0 = | Non_informative_type: | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | non_informative | |
typing : env -> term -> comp_typ -> Type0 = | T_Token : | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | typing | |
tot_typing (g:env) (e:term) (t:term) = typing g e (E_Total, t) | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | tot_typing | |
ghost_typing (g:env) (e:term) (t:term) = typing g e (E_Ghost, t) | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | ghost_typing | |
fstar_env = g:R.env{fstar_env_fvs g} | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | fstar_env | |
fstar_top_env = g:fstar_env { | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | fstar_top_env | |
sigelt_typing : env -> sigelt -> Type0 = | ST_Let : | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | sigelt_typing | |
dsl_tac_t = gt:(fstar_top_env & option R.typ) -> | type | ulib | [
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Tactics.V2.Builtins",
"FStar.Stubs.Tactics.Types",
"FStar.Tactics.Effect",
"R",
"FStar.List.Tot",
"FStar.Reflection.V2",
"FStar.Stubs.Reflection.V2.Data"
] | ulib/experimental/FStar.Reflection.Typing.fsti | dsl_tac_t | |
length : #ty: Type -> seq ty -> nat /// We represent the Dafny function `Seq#Empty` with `empty`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | length | |
empty : #ty: Type -> seq ty /// We represent the Dafny function `Seq#Singleton` with `singleton`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | empty | |
singleton : #ty: Type -> ty -> seq ty /// We represent the Dafny function `Seq#Index` with `index`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | singleton | |
index : #ty: Type -> s: seq ty -> i: nat{i < length s} -> ty | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | index | |
build : #ty: Type -> seq ty -> ty -> seq ty | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | build | |
append : #ty: Type -> seq ty -> seq ty -> seq ty | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | append | |
update : #ty: Type -> s: seq ty -> i: nat{i < length s} -> ty -> seq ty /// We represent the Dafny function `Seq#Contains` with `contains`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | update | |
contains : #ty: Type -> seq ty -> ty -> Type0 /// We represent the Dafny function `Seq#Take` with `take`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | contains | |
take : #ty: Type -> s: seq ty -> howMany: nat{howMany <= length s} -> seq ty /// We represent the Dafny function `Seq#Drop` with `drop`: | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | take | |
drop : #ty: Type -> s: seq ty -> howMany: nat{howMany <= length s} -> seq ty /// We represent the Dafny function `Seq#Equal` with `equal`. | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | drop | |
equal : #ty: Type -> seq ty -> seq ty -> Type0 | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | equal | |
is_prefix : #ty: Type -> seq ty -> seq ty -> Type0 | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | is_prefix | |
rank : #ty: Type -> ty -> ty (** We translate each sequence axiom from the Dafny prelude into an F* predicate ending in `_fact`. | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | rank | |
all_seq_facts_lemma : unit -> Lemma (all_seq_facts u#a) | val | ulib | [] | ulib/experimental/FStar.Sequence.Base.fsti | all_seq_facts_lemma | |
index : #a:Type -> #m:nat -> #n:nat -> matrix2 m n a -> i:nat{i < m} -> j:nat{j < n} -> Tot a | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | index | |
row : #a:Type -> #m:nat -> #n:nat -> matrix2 m n a -> i:nat{i<m} -> Tot (seq a) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | row | |
col : #a:Type -> #m:nat -> #n:nat -> matrix2 m n a -> j:nat{j<n} -> Tot (seq a) (* Constructors *) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | col | |
create : #a:Type -> m:nat -> n:nat -> a -> Tot (matrix2 m n a) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | create | |
emp : #a:Type -> Tot (matrix2 0 0 a) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | emp | |
upd : #a:Type -> #m:nat -> #n:nat -> x:matrix2 m n a -> i:nat{i<m} -> j:nat{j<n} -> a -> Tot (matrix2 m n a) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | upd | |
upd_row : #a:Type -> #m:nat -> #n:nat -> x:matrix2 m n a -> i:nat{i<m} -> r:seq a{Seq.length r = n} -> Tot (matrix2 m n a) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | upd_row | |
upd_col : #a:Type -> #m:nat -> #n:nat -> x:matrix2 m n a -> j:nat{j<n} -> c:seq a{Seq.length c = m} -> Tot (matrix2 m n a) (* Lemmas about length *) | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | upd_col | |
lemma_row_len : #a:Type -> m:nat -> n:nat -> x:matrix2 m n a -> i:nat{i<m} -> Lemma (requires True) (ensures (Seq.length (row x i) = n)) [SMTPat (Seq.length (row x i))] val lemma_col_len: #a:Type -> m:nat -> n:nat -> x:matrix2 m n a -> j:nat{j<n} -> Lemma (requires True) (ensures (Seq.length (col x j) = m)) [SMTPat (Se... | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | lemma_row_len | |
lemma_index_create : #a:Type -> m:nat -> n:nat -> v:a -> i:nat{i < m} -> j:nat{j < n} -> Lemma (requires True) (ensures (index (create m n v) i j == v)) [SMTPat (index (create m n v) i j)] val lemma_index_upd1: #a:Type -> m:nat -> n:nat -> x:matrix2 m n a -> i:nat{i<m} -> j:nat{j<n} -> v:a -> Lemma (requires True) (ens... | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | lemma_index_create | |
lemma_eq_intro : #a:Type -> #m:nat -> #n:nat -> x1:matrix2 m n a -> x2:matrix2 m n a -> Lemma (requires ((forall (i:nat{i < m}) (j:nat{j<n}). {:pattern (index x1 i j); (index x2 i j)} (index x1 i j == index x2 i j)))) (ensures (eq x1 x2)) [SMTPat (eq x1 x2)] val lemma_eq_elim: #a:Type -> #m:nat -> #n:nat -> x1:matrix2 ... | val | ulib | [
"FStar.Seq"
] | ulib/legacy/FStar.Matrix2.fsti | lemma_eq_intro | |
loc : Type u#0 val loc_none: loc val loc_union (s1 s2: loc) | val | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | loc | |
write : #a:typ -> b:pointer a -> z:type_of_typ a -> HST.Stack unit (requires (fun h -> live h b)) (ensures (fun h0 _ h1 -> live h0 b /\ live h1 b /\ modifies_1 b h0 h1 /\ readable h1 b /\ gread h1 b == z )) (** Given our model, this operation is stateful, however it should be translated to a no-op by Karamel, as the ta... | val | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | write | |
cloc_aloc : HS.rid -> nat -> Tot Type0 val cloc_cls: MG.cls cloc_aloc val cloc_of_loc (l: loc) : Tot (MG.loc cloc_cls) val loc_of_cloc (l: MG.loc cloc_cls) : Tot loc val loc_of_cloc_of_loc (l: loc) : Lemma (loc_of_cloc (cloc_of_loc l) == l) [SMTPat (loc_of_cloc (cloc_of_loc l))] val cloc_of_loc_of_cloc (l: MG.loc cloc_... | val | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | cloc_aloc | |
base_typ = | TUInt | type | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | base_typ | |
array_length_t = (length: UInt32.t { UInt32.v length > 0 } ) | type | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | array_length_t | |
typ = | TBase: | type | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | typ | |
array (length: array_length_t) (t: Type) = (s: Seq.seq t {Seq.length s == UInt32.v length}) | type | ulib | [
"FStar.HyperStack.ST",
"FStar.HyperStack",
"FStar.HyperStack",
"FStar.HyperStack.ST",
"FStar.ModifiesGen"
] | ulib/legacy/FStar.Pointer.Base.fsti | array |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.