effect
stringclasses
48 values
original_source_type
stringlengths
0
23k
opens_and_abbrevs
listlengths
2
92
isa_cross_project_example
bool
1 class
source_definition
stringlengths
9
57.9k
partial_definition
stringlengths
7
23.3k
is_div
bool
2 classes
is_type
null
is_proof
bool
2 classes
completed_definiton
stringlengths
1
250k
dependencies
dict
effect_flags
listlengths
0
2
ideal_premises
listlengths
0
236
mutual_with
listlengths
0
11
file_context
stringlengths
0
407k
interleaved
bool
1 class
is_simply_typed
bool
2 classes
file_name
stringlengths
5
48
vconfig
dict
is_simple_lemma
null
source_type
stringlengths
10
23k
proof_features
listlengths
0
1
name
stringlengths
8
95
source
dict
verbose_type
stringlengths
1
7.42k
source_range
dict
Prims.Tot
val va_codegen_success_Prefetchnta : v:va_operand_opr64 -> Tot va_pbool
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_codegen_success_Prefetchnta v = (va_ttrue ())
val va_codegen_success_Prefetchnta : v:va_operand_opr64 -> Tot va_pbool let va_codegen_success_Prefetchnta v =
false
null
false
(va_ttrue ())
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[ "total" ]
[ "Vale.X64.Decls.va_operand_opr64", "Vale.X64.Decls.va_ttrue", "Vale.X64.Decls.va_pbool" ]
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
true
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_codegen_success_Prefetchnta : v:va_operand_opr64 -> Tot va_pbool
[]
Vale.X64.InsBasic.va_codegen_success_Prefetchnta
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
v: Vale.X64.Decls.va_operand_opr64 -> Vale.X64.Decls.va_pbool
{ "end_col": 15, "end_line": 1195, "start_col": 2, "start_line": 1195 }
Prims.Ghost
val va_lemma_Sbb64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Sbb64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ Vale.X64.Decls.valid_cf (va...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Sbb64 va_b0 va_s0 dst src = va_reveal_opaque (`%va_code_Sbb64) (va_code_Sbb64 dst src); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Sbb64) dst src)) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Sbb64) dst src)) va_s0 in (va_sM, va_fM)
val va_lemma_Sbb64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Sbb64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ Vale.X64.Decls.valid_cf (va...
false
null
false
va_reveal_opaque (`%va_code_Sbb64) (va_code_Sbb64 dst src); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Sbb64) dst src)) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Sbb64) dst src)) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.Decls.va_operand_dst_opr64", "Vale.X64.Decls.va_operand_opr64", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Sbb64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Sbb64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ Vale.X64.Decls.valid_cf (va...
[]
Vale.X64.InsBasic.va_lemma_Sbb64
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> dst: Vale.X64.Decls.va_operand_dst_opr64 -> src: Vale.X64.Decls.va_operand_opr64 -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 363, "start_col": 2, "start_line": 359 }
Prims.Ghost
val va_lemma_IMul64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_IMul64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ va_mul_nat (va_eval_dst_o...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_IMul64 va_b0 va_s0 dst src = va_reveal_opaque (`%va_code_IMul64) (va_code_IMul64 dst src); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_IMul64) dst src)) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_IMul64) dst src)) va_s0 in lemma_mul_nat (va_e...
val va_lemma_IMul64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_IMul64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ va_mul_nat (va_eval_dst_o...
false
null
false
va_reveal_opaque (`%va_code_IMul64) (va_code_IMul64 dst src); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_IMul64) dst src)) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_IMul64) dst src)) va_s0 in lemma_mul_nat (va_eval_dst_opr64 va_old_s dst) (va_eval_opr64 va_old_s src)...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.Decls.va_operand_dst_opr64", "Vale.X64.Decls.va_operand_opr64", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.Decls.lemma_mul_in_bounds", "V...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_IMul64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_IMul64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0 /\ va_mul_nat (va_eval_dst_o...
[]
Vale.X64.InsBasic.va_lemma_IMul64
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> dst: Vale.X64.Decls.va_operand_dst_opr64 -> src: Vale.X64.Decls.va_operand_opr64 -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 470, "start_col": 2, "start_line": 464 }
Prims.Ghost
val va_lemma_Cpuid_Sha : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Sha ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Sha va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Sha) (va_code_Cpuid_Sha ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features ()...
val va_lemma_Cpuid_Sha : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Sha ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Sha) (va_code_Cpuid_Sha ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Sha : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Sha ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Sha
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 654, "start_col": 2, "start_line": 649 }
Prims.Ghost
val va_lemma_Cpuid_Adx_Bmi2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Adx_Bmi2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM v...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Adx_Bmi2 va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Adx_Bmi2) (va_code_Cpuid_Adx_Bmi2 ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cp...
val va_lemma_Cpuid_Adx_Bmi2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Adx_Bmi2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM v...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Adx_Bmi2) (va_code_Cpuid_Adx_Bmi2 ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Adx_Bmi2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Adx_Bmi2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM v...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Adx_Bmi2
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 686, "start_col": 2, "start_line": 681 }
Prims.Ghost
val va_wpProof_Cpuid_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg6...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Cpuid_Avx512 va_s0 va_k = let (va_sM, va_f0) = va_lemma_Cpuid_Avx512 (va_code_Cpuid_Avx512 ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRcx va_sM (va_update_reg64 rRbx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0)...
val va_wpProof_Cpuid_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg6...
false
null
false
let va_sM, va_f0 = va_lemma_Cpuid_Avx512 (va_code_Cpuid_Avx512 ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRcx va_sM (va_update_reg64 rRbx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRcx", "Vale.X64.Machine_s.r...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Cpuid_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg6...
[]
Vale.X64.InsBasic.va_wpProof_Cpuid_Avx512
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 890, "start_col": 40, "start_line": 882 }
Prims.Ghost
val va_lemma_Cpuid_Avx2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Avx2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ ...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Avx2 va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Avx2) (va_code_Cpuid_Avx2 ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features...
val va_lemma_Cpuid_Avx2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Avx2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ ...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Avx2) (va_code_Cpuid_Avx2 ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Avx2 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Avx2 ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 7 /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ ...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Avx2
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 750, "start_col": 2, "start_line": 745 }
Prims.Ghost
val va_wpProof_Cpuid_Osxsave : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Osxsave va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Osxsave ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_r...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Cpuid_Osxsave va_s0 va_k = let (va_sM, va_f0) = va_lemma_Cpuid_Osxsave (va_code_Cpuid_Osxsave ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRcx va_sM (va_update_reg64 rRbx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_...
val va_wpProof_Cpuid_Osxsave : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Osxsave va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Osxsave ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_r...
false
null
false
let va_sM, va_f0 = va_lemma_Cpuid_Osxsave (va_code_Cpuid_Osxsave ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRcx va_sM (va_update_reg64 rRbx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRcx", "Vale.X64.Machine_s.r...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Cpuid_Osxsave : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Cpuid_Osxsave va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Cpuid_Osxsave ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_r...
[]
Vale.X64.InsBasic.va_wpProof_Cpuid_Osxsave
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 922, "start_col": 41, "start_line": 914 }
Prims.Ghost
val va_lemma_Cpuid_Movbe : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Movbe ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale.A...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Movbe va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Movbe) (va_code_Cpuid_Movbe ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_featu...
val va_lemma_Cpuid_Movbe : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Movbe ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale.A...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Movbe) (va_code_Cpuid_Movbe ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Movbe : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Movbe ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale.A...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Movbe
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 814, "start_col": 2, "start_line": 809 }
Prims.Ghost
val va_wpProof_Xgetbv_Avx : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 va_k ((va_...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Xgetbv_Avx va_s0 va_k = let (va_sM, va_f0) = va_lemma_Xgetbv_Avx (va_code_Xgetbv_Avx ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0)))); va_lemma_norm_mods ([va_Mod_reg64 rRdx; va_Mod_reg64 rR...
val va_wpProof_Xgetbv_Avx : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 va_k ((va_...
false
null
false
let va_sM, va_f0 = va_lemma_Xgetbv_Avx (va_code_Xgetbv_Avx ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0)))); va_lemma_norm_mods ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_sM va_s0; let va_g = () in (va_sM, va_f...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRax", "Prims.Nil", "Prims...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Xgetbv_Avx : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 va_k ((va_...
[]
Vale.X64.InsBasic.va_wpProof_Xgetbv_Avx
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 953, "start_col": 38, "start_line": 946 }
Prims.Ghost
val va_lemma_Cpuid_Rdrand : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Rdrand ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Rdrand va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Rdrand) (va_code_Cpuid_Rdrand ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_fe...
val va_lemma_Cpuid_Rdrand : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Rdrand ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Rdrand) (va_code_Cpuid_Rdrand ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Rdrand : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Rdrand ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Vale...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Rdrand
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 846, "start_col": 2, "start_line": 841 }
Prims.Ghost
val va_lemma_Xgetbv_Avx : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Xgetbv_Avx va_b0 va_s0 = va_reveal_opaque (`%va_code_Xgetbv_Avx) (va_code_Xgetbv_Avx ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Xgetbv))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Xgetbv))) va_s0 in Vale.X64.CPU_Features_s.xgetbv_featu...
val va_lemma_Xgetbv_Avx : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va...
false
null
false
va_reveal_opaque (`%va_code_Xgetbv_Avx) (va_code_Xgetbv_Avx ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Xgetbv))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Xgetbv))) va_s0 in Vale.X64.CPU_Features_s.xgetbv_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.xgetbv_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Xgetbv_Avx : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va...
[]
Vale.X64.InsBasic.va_lemma_Xgetbv_Avx
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 942, "start_col": 2, "start_line": 937 }
Prims.Ghost
val va_lemma_Cpuid_Osxsave : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Osxsave ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Va...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Cpuid_Osxsave va_b0 va_s0 = va_reveal_opaque (`%va_code_Cpuid_Osxsave) (va_code_Cpuid_Osxsave ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid...
val va_lemma_Cpuid_Osxsave : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Osxsave ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Va...
false
null
false
va_reveal_opaque (`%va_code_Cpuid_Osxsave) (va_code_Cpuid_Osxsave ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Cpuid))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Cpuid))) va_s0 in Vale.X64.CPU_Features_s.cpuid_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.cpuid_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_i...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Cpuid_Osxsave : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Cpuid_Osxsave ()) va_s0 /\ va_get_ok va_s0 /\ va_get_reg64 rRax va_s0 = 1)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ Va...
[]
Vale.X64.InsBasic.va_lemma_Cpuid_Osxsave
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 910, "start_col": 2, "start_line": 905 }
Prims.Ghost
val va_wpProof_Xgetbv_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 v...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Xgetbv_Avx512 va_s0 va_k = let (va_sM, va_f0) = va_lemma_Xgetbv_Avx512 (va_code_Xgetbv_Avx512 ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0)))); va_lemma_norm_mods ([va_Mod_reg64 rRdx; va_Mod...
val va_wpProof_Xgetbv_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 v...
false
null
false
let va_sM, va_f0 = va_lemma_Xgetbv_Avx512 (va_code_Xgetbv_Avx512 ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_reg64 rRdx va_sM (va_update_reg64 rRax va_sM (va_update_ok va_sM va_s0)))); va_lemma_norm_mods ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_sM va_s0; let va_g = () in (va_sM...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRax", "Prims.Nil", "Prims...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Xgetbv_Avx512 : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Xgetbv_Avx512 va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Xgetbv_Avx512 ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRax]) va_s0 v...
[]
Vale.X64.InsBasic.va_wpProof_Xgetbv_Avx512
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 984, "start_col": 41, "start_line": 977 }
Prims.Ghost
val va_lemma_Mulx64 : va_b0:va_code -> va_s0:va_state -> dst_hi:va_operand_dst_opr64 -> dst_lo:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Mulx64 dst_hi dst_lo src) va_s0 /\ va_is_dst_dst_opr64 dst_hi va_s0 /\ va_is_dst_dst_opr64 dst_lo...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Mulx64 va_b0 va_s0 dst_hi dst_lo src = va_reveal_opaque (`%va_code_Mulx64) (va_code_Mulx64 dst_hi dst_lo src); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Mulx64) dst_hi dst_lo src)) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Mulx64) dst_hi dst...
val va_lemma_Mulx64 : va_b0:va_code -> va_s0:va_state -> dst_hi:va_operand_dst_opr64 -> dst_lo:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Mulx64 dst_hi dst_lo src) va_s0 /\ va_is_dst_dst_opr64 dst_hi va_s0 /\ va_is_dst_dst_opr64 dst_lo...
false
null
false
va_reveal_opaque (`%va_code_Mulx64) (va_code_Mulx64 dst_hi dst_lo src); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Mulx64) dst_hi dst_lo src)) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Mulx64) dst_hi dst_lo src)) va_s0 in lemma_fundamental_div_mod (va_get_reg64 rRdx ...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.Decls.va_operand_dst_opr64", "Vale.X64.Decls.va_operand_opr64", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.InsBasic.lemma_fundamental_div_m...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Mulx64 : va_b0:va_code -> va_s0:va_state -> dst_hi:va_operand_dst_opr64 -> dst_lo:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Mulx64 dst_hi dst_lo src) va_s0 /\ va_is_dst_dst_opr64 dst_hi va_s0 /\ va_is_dst_dst_opr64 dst_lo...
[]
Vale.X64.InsBasic.va_lemma_Mulx64
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> dst_hi: Vale.X64.Decls.va_operand_dst_opr64 -> dst_lo: Vale.X64.Decls.va_operand_dst_opr64 -> src: Vale.X64.Decls.va_operand_opr64 -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 434, "start_col": 2, "start_line": 429 }
Prims.Ghost
val va_wpProof_Comment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Comment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Comment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Comment c va_s0 va_k = let (va_sM, va_f0) = va_lemma_Comment (va_code_Comment c) va_s0 c in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
val va_wpProof_Comment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Comment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Comment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g)))) let va_wpPro...
false
null
false
let va_sM, va_f0 = va_lemma_Comment (va_code_Comment c) va_s0 c in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Prims.string", "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Prims._assert", "Vale.X64.Decls.va_state_eq", "Vale.X64.Decls.va_update_ok", "Vale.X64.Decls...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Comment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Comment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Comment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[]
Vale.X64.InsBasic.va_wpProof_Comment
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
c: Prims.string -> va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 1063, "start_col": 37, "start_line": 1057 }
Prims.Ghost
val va_lemma_Xgetbv_Avx512 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx512 ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Xgetbv_Avx512 va_b0 va_s0 = va_reveal_opaque (`%va_code_Xgetbv_Avx512) (va_code_Xgetbv_Avx512 ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Xgetbv))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_Xgetbv))) va_s0 in Vale.X64.CPU_Features_s.xge...
val va_lemma_Xgetbv_Avx512 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx512 ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get...
false
null
false
va_reveal_opaque (`%va_code_Xgetbv_Avx512) (va_code_Xgetbv_Avx512 ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr (I.ins_Xgetbv))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr (I.ins_Xgetbv))) va_s0 in Vale.X64.CPU_Features_s.xgetbv_features (); (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "Prims.unit", "Vale.X64.CPU_Features_s.xgetbv_features", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Xgetbv_Avx512 : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xgetbv_Avx512 ()) va_s0 /\ va_get_ok va_s0 /\ osxsave_enabled /\ va_get_reg64 rRcx va_s0 = 0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get...
[]
Vale.X64.InsBasic.va_lemma_Xgetbv_Avx512
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 973, "start_col": 2, "start_line": 968 }
Prims.Ghost
val va_lemma_Comment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Comment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM ...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Comment va_b0 va_s0 c = va_reveal_opaque (`%va_code_Comment) (va_code_Comment c); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Comment c) (S.AnnotateComment c))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Comment c) (S.Anno...
val va_lemma_Comment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Comment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM ...
false
null
false
va_reveal_opaque (`%va_code_Comment) (va_code_Comment c); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Comment c) (S.AnnotateComment c))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Comment c) (S.AnnotateComment c))) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Prims.string", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_ins", "Vale.X64.Taint_Semantics.mk_ins", ...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Comment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Comment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM ...
[]
Vale.X64.InsBasic.va_lemma_Comment
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> c: Prims.string -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1053, "start_col": 2, "start_line": 1048 }
Prims.Ghost
val va_lemma_Nat64Equal : va_b0:va_code -> va_s0:va_state -> dst:va_operand_reg_opr64 -> src:va_operand_reg_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Nat64Equal dst src) va_s0 /\ va_is_dst_reg_opr64 dst va_s0 /\ va_is_dst_reg_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Nat64Equal va_b0 va_s0 dst src = va_reveal_opaque (`%va_code_Nat64Equal) (va_code_Nat64Equal dst src); let (va_old_s:va_state) = va_s0 in let (va_b1:va_codes) = va_get_block va_b0 in let (va_s2, va_fc2) = va_lemma_Sub64Wrap (va_hd va_b1) va_s0 (va_coerce_reg_opr64_to_dst_opr64 src) (va_const_op...
val va_lemma_Nat64Equal : va_b0:va_code -> va_s0:va_state -> dst:va_operand_reg_opr64 -> src:va_operand_reg_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Nat64Equal dst src) va_s0 /\ va_is_dst_reg_opr64 dst va_s0 /\ va_is_dst_reg_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures...
false
null
false
va_reveal_opaque (`%va_code_Nat64Equal) (va_code_Nat64Equal dst src); let va_old_s:va_state = va_s0 in let va_b1:va_codes = va_get_block va_b0 in let va_s2, va_fc2 = va_lemma_Sub64Wrap (va_hd va_b1) va_s0 (va_coerce_reg_opr64_to_dst_opr64 src) (va_const_opr64 18446744073709551615) in let va_b2 = va_tl va_...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.Decls.va_operand_reg_opr64", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_lemma_merge_total", "FStar.Pervasives.Native.tuple2", "Vale.X64.State.vale_state", "Vale.X64.Decls.va_lemma_empty_total", "Pr...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Nat64Equal : va_b0:va_code -> va_s0:va_state -> dst:va_operand_reg_opr64 -> src:va_operand_reg_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Nat64Equal dst src) va_s0 /\ va_is_dst_reg_opr64 dst va_s0 /\ va_is_dst_reg_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures...
[]
Vale.X64.InsBasic.va_lemma_Nat64Equal
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> dst: Vale.X64.Decls.va_operand_reg_opr64 -> src: Vale.X64.Decls.va_operand_reg_opr64 -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1022, "start_col": 2, "start_line": 1006 }
Prims.Ghost
val va_lemma_Xor64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xor64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_f...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Xor64 va_b0 va_s0 dst src = va_reveal_opaque (`%va_code_Xor64) (va_code_Xor64 dst src); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Xor64) (S.AnnotateXor64 ()) dst src)) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Xor64) (S.Ann...
val va_lemma_Xor64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xor64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_f...
false
null
false
va_reveal_opaque (`%va_code_Xor64) (va_code_Xor64 dst src); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Xor64) (S.AnnotateXor64 ()) dst src)) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Xor64) (S.AnnotateXor64 ()) dst src)) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.Decls.va_operand_dst_opr64", "Vale.X64.Decls.va_operand_opr64", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Xor64 : va_b0:va_code -> va_s0:va_state -> dst:va_operand_dst_opr64 -> src:va_operand_opr64 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Xor64 dst src) va_s0 /\ va_is_dst_dst_opr64 dst va_s0 /\ va_is_src_opr64 src va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_f...
[]
Vale.X64.InsBasic.va_lemma_Xor64
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> dst: Vale.X64.Decls.va_operand_dst_opr64 -> src: Vale.X64.Decls.va_operand_opr64 -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 501, "start_col": 2, "start_line": 496 }
Prims.Ghost
val va_wpProof_LargeComment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_LargeComment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_LargeComment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g))...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_LargeComment c va_s0 va_k = let (va_sM, va_f0) = va_lemma_LargeComment (va_code_LargeComment c) va_s0 c in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
val va_wpProof_LargeComment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_LargeComment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_LargeComment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g))...
false
null
false
let va_sM, va_f0 = va_lemma_LargeComment (va_code_LargeComment c) va_s0 c in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Prims.string", "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Prims._assert", "Vale.X64.Decls.va_state_eq", "Vale.X64.Decls.va_update_ok", "Vale.X64.Decls...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_LargeComment : c:string -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_LargeComment c va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_LargeComment c) ([]) va_s0 va_k ((va_sM, va_f0, va_g))...
[]
Vale.X64.InsBasic.va_wpProof_LargeComment
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
c: Prims.string -> va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 1094, "start_col": 42, "start_line": 1088 }
Prims.Ghost
val va_lemma_LargeComment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_LargeComment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_LargeComment va_b0 va_s0 c = va_reveal_opaque (`%va_code_LargeComment) (va_code_LargeComment c); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_LargeComment c) (S.AnnotateLargeComment c))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate ...
val va_lemma_LargeComment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_LargeComment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update...
false
null
false
va_reveal_opaque (`%va_code_LargeComment) (va_code_LargeComment c); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_LargeComment c) (S.AnnotateLargeComment c))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_LargeComment c) (S.AnnotateLargeComment c))) va_s...
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Prims.string", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_ins", "Vale.X64.Taint_Semantics.mk_ins", ...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_LargeComment : va_b0:va_code -> va_s0:va_state -> c:string -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_LargeComment c) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update...
[]
Vale.X64.InsBasic.va_lemma_LargeComment
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> c: Prims.string -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1084, "start_col": 2, "start_line": 1078 }
Prims.Ghost
val va_wpProof_Newline : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Newline va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Newline ()) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Newline va_s0 va_k = let (va_sM, va_f0) = va_lemma_Newline (va_code_Newline ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
val va_wpProof_Newline : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Newline va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Newline ()) ([]) va_s0 va_k ((va_sM, va_f0, va_g)))) let va_wpProof_Newline va...
false
null
false
let va_sM, va_f0 = va_lemma_Newline (va_code_Newline ()) va_s0 in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Prims._assert", "Vale.X64.Decls.va_state_eq", "Vale.X64.Decls.va_update_ok", "Vale.X64.Decls.va_lemma_upd_upda...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Newline : va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Newline va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Newline ()) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[]
Vale.X64.InsBasic.va_wpProof_Newline
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 1154, "start_col": 35, "start_line": 1148 }
Prims.Ghost
val va_lemma_Newline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Newline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0)))
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Newline va_b0 va_s0 = va_reveal_opaque (`%va_code_Newline) (va_code_Newline ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Newline) (S.AnnotateNewline ()))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Newline) (S.AnnotateNewl...
val va_lemma_Newline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Newline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))) le...
false
null
false
va_reveal_opaque (`%va_code_Newline) (va_code_Newline ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Newline) (S.AnnotateNewline ()))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Newline) (S.AnnotateNewline ()))) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_ins", "Vale.X64.Taint_Semantics.mk_ins", "Vale.X64.InsLem...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Newline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Newline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0)))
[]
Vale.X64.InsBasic.va_lemma_Newline
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1144, "start_col": 2, "start_line": 1139 }
Prims.Ghost
val va_lemma_NoNewline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_NoNewline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_NoNewline va_b0 va_s0 = va_reveal_opaque (`%va_code_NoNewline) (va_code_NoNewline ()); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Space 0) (S.AnnotateSpace 0))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Space 0) (S.AnnotateS...
val va_lemma_NoNewline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_NoNewline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
false
null
false
va_reveal_opaque (`%va_code_NoNewline) (va_code_NoNewline ()); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Space 0) (S.AnnotateSpace 0))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Space 0) (S.AnnotateSpace 0))) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Prims.nat", "Vale.X64.Decls.va_eval_ins", "Vale.X64.Taint_Semantics.mk_ins", "Vale.X64.InsLem...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_NoNewline : va_b0:va_code -> va_s0:va_state -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_NoNewline ()) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
[]
Vale.X64.InsBasic.va_lemma_NoNewline
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1114, "start_col": 2, "start_line": 1109 }
Prims.Ghost
val va_wpProof_Space : n:nat -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Space n va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Space n) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Space n va_s0 va_k = let (va_sM, va_f0) = va_lemma_Space (va_code_Space n) va_s0 n in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
val va_wpProof_Space : n:nat -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Space n va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Space n) ([]) va_s0 va_k ((va_sM, va_f0, va_g)))) let va_wpProof_Space ...
false
null
false
let va_sM, va_f0 = va_lemma_Space (va_code_Space n) va_s0 n in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Prims.nat", "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Prims._assert", "Vale.X64.Decls.va_state_eq", "Vale.X64.Decls.va_update_ok", "Vale.X64.Decls.va...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Space : n:nat -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Space n va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Space n) ([]) va_s0 va_k ((va_sM, va_f0, va_g))))
[]
Vale.X64.InsBasic.va_wpProof_Space
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
n: Prims.nat -> va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 1184, "start_col": 35, "start_line": 1178 }
Prims.Ghost
val va_lemma_Space : va_b0:va_code -> va_s0:va_state -> n:nat -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Space n) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_lemma_Space va_b0 va_s0 n = va_reveal_opaque (`%va_code_Space) (va_code_Space n); let (va_old_s:va_state) = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Space n) (S.AnnotateSpace n))) va_s0; let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Space n) (S.AnnotateSpace n)...
val va_lemma_Space : va_b0:va_code -> va_s0:va_state -> n:nat -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Space n) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
false
null
false
va_reveal_opaque (`%va_code_Space) (va_code_Space n); let va_old_s:va_state = va_s0 in va_ins_lemma (mk_ins (make_instr_annotate (I.ins_Space n) (S.AnnotateSpace n))) va_s0; let va_sM, va_fM = va_eval_ins (mk_ins (make_instr_annotate (I.ins_Space n) (S.AnnotateSpace n))) va_s0 in (va_sM, va_fM)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_code", "Vale.X64.Decls.va_state", "Prims.nat", "Vale.X64.State.vale_state", "Vale.X64.Lemmas.fuel", "FStar.Pervasives.Native.Mktuple2", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.tuple2", "Vale.X64.Decls.va_eval_ins", "Vale.X64.Taint_Semantics.mk_ins", "Vale.X64.InsLem...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_lemma_Space : va_b0:va_code -> va_s0:va_state -> n:nat -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_Space n) va_s0 /\ va_get_ok va_s0)) (ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\ va_state_eq va_sM (va_update_ok va_sM va_s0))...
[]
Vale.X64.InsBasic.va_lemma_Space
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> n: Prims.nat -> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel)
{ "end_col": 16, "end_line": 1174, "start_col": 2, "start_line": 1169 }
Prims.Ghost
val va_wpProof_Prefetchnta : v:va_operand_opr64 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Prefetchnta v va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Prefetchnta v) ([]) va_s0 va_k ((va_sM, va_f...
[ { "abbrev": true, "full_module": "Vale.X64.Machine_Semantics_s", "short_module": "S" }, { "abbrev": true, "full_module": "Vale.X64.Instructions_s", "short_module": "I" }, { "abbrev": false, "full_module": "Vale.X64.Stack_i", "short_module": null }, { "abbrev": fal...
false
let va_wpProof_Prefetchnta v va_s0 va_k = let (va_sM, va_f0) = va_lemma_Prefetchnta (va_code_Prefetchnta v) va_s0 v in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
val va_wpProof_Prefetchnta : v:va_operand_opr64 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Prefetchnta v va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Prefetchnta v) ([]) va_s0 va_k ((va_sM, va_f...
false
null
false
let va_sM, va_f0 = va_lemma_Prefetchnta (va_code_Prefetchnta v) va_s0 v in va_lemma_upd_update va_sM; assert (va_state_eq va_sM (va_update_ok va_sM va_s0)); va_lemma_norm_mods ([]) va_sM va_s0; let va_g = () in (va_sM, va_f0, va_g)
{ "checked_file": "Vale.X64.InsBasic.fst.checked", "dependencies": [ "Vale.X64.Taint_Semantics.fst.checked", "Vale.X64.StateLemmas.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked...
[]
[ "Vale.X64.Decls.va_operand_opr64", "Vale.X64.Decls.va_state", "Prims.unit", "Vale.X64.Decls.va_fuel", "FStar.Pervasives.Native.Mktuple3", "Vale.X64.QuickCode.va_lemma_norm_mods", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Prims._assert", "Vale.X64.Decls.va_state_eq", "Vale.X64.Decls.va_update_ok"...
[]
module Vale.X64.InsBasic open Vale.X64 open Vale.X64.StateLemmas open Vale.X64.InsLemmas open Vale.X64.Taint_Semantics open Vale.X64.CPU_Features_s open Vale.X64.Memory open Vale.X64.Stack_i module I = Vale.X64.Instructions_s module S = Vale.X64.Machine_Semantics_s friend Vale.X64.Decls #reset-options "--initial_fuel 5...
false
false
Vale.X64.InsBasic.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 5, "initial_ifuel": 0, "max_fuel": 5, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val va_wpProof_Prefetchnta : v:va_operand_opr64 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0) -> Ghost (va_state & va_fuel & unit) (requires (va_t_require va_s0 /\ va_wp_Prefetchnta v va_s0 va_k)) (ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Prefetchnta v) ([]) va_s0 va_k ((va_sM, va_f...
[]
Vale.X64.InsBasic.va_wpProof_Prefetchnta
{ "file_name": "obj/Vale.X64.InsBasic.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
v: Vale.X64.Decls.va_operand_opr64 -> va_s0: Vale.X64.Decls.va_state -> va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0) -> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit)
{ "end_col": 22, "end_line": 1215, "start_col": 41, "start_line": 1209 }
Prims.Tot
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let less_than_max_input_length = Spec.Hash.Definitions.less_than_max_input_length
let less_than_max_input_length =
false
null
false
Spec.Hash.Definitions.less_than_max_input_length
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[ "total" ]
[ "Spec.Hash.Definitions.less_than_max_input_length" ]
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
true
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val less_than_max_input_length : l: Prims.int -> a: Spec.Hash.Definitions.hash_alg -> Prims.bool
[]
Hacl.Impl.RSAPSS.MGF.less_than_max_input_length
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
l: Prims.int -> a: Spec.Hash.Definitions.hash_alg -> Prims.bool
{ "end_col": 81, "end_line": 30, "start_col": 33, "start_line": 30 }
Prims.Tot
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let max_input_length = Hash.max_input_length
let max_input_length =
false
null
false
Hash.max_input_length
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[ "total" ]
[ "Spec.Hash.Definitions.max_input_length" ]
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
true
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val max_input_length : _: Spec.Hash.Definitions.hash_alg -> FStar.Pervasives.Native.option Prims.pos
[]
Hacl.Impl.RSAPSS.MGF.max_input_length
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
_: Spec.Hash.Definitions.hash_alg -> FStar.Pervasives.Native.option Prims.pos
{ "end_col": 44, "end_line": 27, "start_col": 23, "start_line": 27 }
Prims.Tot
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let mgf_hash_st (a:Hash.hash_alg{S.hash_is_supported a}) = len:size_t{v len + 4 <= max_size_t /\ (v len + 4) `less_than_max_input_length` a} -> mgfseed:lbuffer uint8 len -> maskLen:size_t{0 < v maskLen /\ S.blocks (v maskLen) (Hash.hash_length a) * Hash.hash_length a < pow2 32} -> res:lbuffer uint8 maskLen -> ...
let mgf_hash_st (a: Hash.hash_alg{S.hash_is_supported a}) =
false
null
false
len: size_t{v len + 4 <= max_size_t /\ (v len + 4) `less_than_max_input_length` a} -> mgfseed: lbuffer uint8 len -> maskLen: size_t {0 < v maskLen /\ S.blocks (v maskLen) (Hash.hash_length a) * Hash.hash_length a < pow2 32} -> res: lbuffer uint8 maskLen -> Stack unit (requires fun...
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[ "total" ]
[ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Spec.RSAPSS.hash_is_supported", "Lib.IntTypes.size_t", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Lib.IntTypes.max_size_t", "Hacl.Impl.RSAPSS.MGF.less_than_max_input_...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mgf_hash_st : a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> Type0
[]
Hacl.Impl.RSAPSS.MGF.mgf_hash_st
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> Type0
{ "end_col": 74, "end_line": 105, "start_col": 2, "start_line": 98 }
Prims.Tot
val hash_len: a:Hash.hash_alg{S.hash_is_supported a} -> Tot (res:size_t{v res == Hash.hash_length a})
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let hash_len a = Hacl.Hash.Definitions.hash_len a
val hash_len: a:Hash.hash_alg{S.hash_is_supported a} -> Tot (res:size_t{v res == Hash.hash_length a}) let hash_len a =
false
null
false
Hacl.Hash.Definitions.hash_len a
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[ "total" ]
[ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Spec.RSAPSS.hash_is_supported", "Hacl.Hash.Definitions.hash_len", "Lib.IntTypes.size_t", "Prims.eq2", "Prims.int", "Prims.l_or", "Lib.IntTypes.range", "Lib.IntTypes.U32", "Prims.l_and", "Prims.op_GreaterThanOrEqual", "Prims.op_LessThanOrEqual",...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val hash_len: a:Hash.hash_alg{S.hash_is_supported a} -> Tot (res:size_t{v res == Hash.hash_length a})
[]
Hacl.Impl.RSAPSS.MGF.hash_len
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> res: Lib.IntTypes.size_t{Lib.IntTypes.v res == Spec.Hash.Definitions.hash_length a}
{ "end_col": 34, "end_line": 24, "start_col": 2, "start_line": 24 }
FStar.HyperStack.ST.Stack
val hash: a:Hash.hash_alg{S.hash_is_supported a} -> mHash:lbuffer uint8 (hash_len a) -> msgLen:size_t{v msgLen `less_than_max_input_length` a} -> msg:lbuffer uint8 msgLen -> Stack unit (requires fun h -> live h mHash /\ live h msg /\ disjoint msg mHash) (ensures fun h0 _ h1 -> modifies (loc mHash) h0 h...
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let hash a mHash msgLen msg = match a with | Hash.SHA2_256 -> Hacl.Streaming.SHA2.hash_256 msg msgLen mHash | Hash.SHA2_384 -> Hacl.Streaming.SHA2.hash_384 msg msgLen mHash | Hash.SHA2_512 -> Hacl.Streaming.SHA2.hash_512 msg msgLen mHash
val hash: a:Hash.hash_alg{S.hash_is_supported a} -> mHash:lbuffer uint8 (hash_len a) -> msgLen:size_t{v msgLen `less_than_max_input_length` a} -> msg:lbuffer uint8 msgLen -> Stack unit (requires fun h -> live h mHash /\ live h msg /\ disjoint msg mHash) (ensures fun h0 _ h1 -> modifies (loc mHash) h0 h...
true
null
false
match a with | Hash.SHA2_256 -> Hacl.Streaming.SHA2.hash_256 msg msgLen mHash | Hash.SHA2_384 -> Hacl.Streaming.SHA2.hash_384 msg msgLen mHash | Hash.SHA2_512 -> Hacl.Streaming.SHA2.hash_512 msg msgLen mHash
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[]
[ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Spec.RSAPSS.hash_is_supported", "Lib.Buffer.lbuffer", "Lib.IntTypes.uint8", "Hacl.Impl.RSAPSS.MGF.hash_len", "Lib.IntTypes.size_t", "Hacl.Impl.RSAPSS.MGF.less_than_max_input_length", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Hacl...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val hash: a:Hash.hash_alg{S.hash_is_supported a} -> mHash:lbuffer uint8 (hash_len a) -> msgLen:size_t{v msgLen `less_than_max_input_length` a} -> msg:lbuffer uint8 msgLen -> Stack unit (requires fun h -> live h mHash /\ live h msg /\ disjoint msg mHash) (ensures fun h0 _ h1 -> modifies (loc mHash) h0 h...
[]
Hacl.Impl.RSAPSS.MGF.hash
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> mHash: Lib.Buffer.lbuffer Lib.IntTypes.uint8 (Hacl.Impl.RSAPSS.MGF.hash_len a) -> msgLen: Lib.IntTypes.size_t{Hacl.Impl.RSAPSS.MGF.less_than_max_input_length (Lib.IntTypes.v msgLen) a} -> msg: Lib.Buffer.lbuffer Lib.IntTypes.ui...
{ "end_col": 66, "end_line": 47, "start_col": 2, "start_line": 44 }
FStar.HyperStack.ST.Stack
val counter_to_bytes: i:size_t -> counter:lbuffer uint8 4ul -> Stack unit (requires fun h -> live h counter) (ensures fun h0 _ h1 -> modifies (loc counter) h0 h1 /\ as_seq h1 counter == BSeq.nat_to_intseq_be 4 (v i))
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let counter_to_bytes i c = let h0 = ST.get () in c.(0ul) <- to_u8 (i >>. 24ul); c.(1ul) <- to_u8 (i >>. 16ul); c.(2ul) <- to_u8 (i >>. 8ul); c.(3ul) <- to_u8 i; let h1 = ST.get () in BSeq.index_nat_to_intseq_be #U8 #SEC 4 (v i) 0; BSeq.index_nat_to_intseq_be #U8 #SEC 4 (v i) 1; BSeq.index_nat_to_intse...
val counter_to_bytes: i:size_t -> counter:lbuffer uint8 4ul -> Stack unit (requires fun h -> live h counter) (ensures fun h0 _ h1 -> modifies (loc counter) h0 h1 /\ as_seq h1 counter == BSeq.nat_to_intseq_be 4 (v i)) let counter_to_bytes i c =
true
null
false
let h0 = ST.get () in c.(0ul) <- to_u8 (i >>. 24ul); c.(1ul) <- to_u8 (i >>. 16ul); c.(2ul) <- to_u8 (i >>. 8ul); c.(3ul) <- to_u8 i; let h1 = ST.get () in BSeq.index_nat_to_intseq_be #U8 #SEC 4 (v i) 0; BSeq.index_nat_to_intseq_be #U8 #SEC 4 (v i) 1; BSeq.index_nat_to_intseq_be #U8 #SEC 4 (v i) 2; BSeq.index_nat_to_in...
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[]
[ "Lib.IntTypes.size_t", "Lib.Buffer.lbuffer", "Lib.IntTypes.uint8", "FStar.UInt32.__uint_to_t", "Lib.Sequence.eq_intro", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Lib.ByteSequence.nat_to_intseq_be", "Lib.IntTypes.U8", "Lib.IntTypes.SEC",...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val counter_to_bytes: i:size_t -> counter:lbuffer uint8 4ul -> Stack unit (requires fun h -> live h counter) (ensures fun h0 _ h1 -> modifies (loc counter) h0 h1 /\ as_seq h1 counter == BSeq.nat_to_intseq_be 4 (v i))
[]
Hacl.Impl.RSAPSS.MGF.counter_to_bytes
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
i: Lib.IntTypes.size_t -> counter: Lib.Buffer.lbuffer Lib.IntTypes.uint8 4ul -> FStar.HyperStack.ST.Stack Prims.unit
{ "end_col": 61, "end_line": 71, "start_col": 26, "start_line": 60 }
FStar.HyperStack.ST.Stack
val mgf_hash_f: a:Hash.hash_alg{S.hash_is_supported a} -> len:size_t{v len + 4 <= max_size_t /\ (v len + 4) `less_than_max_input_length` a} -> i:size_t -> mgfseed_counter:lbuffer uint8 (len +! 4ul) -> block:lbuffer uint8 (hash_len a) -> Stack unit (requires fun h -> live h mgfseed_counter /\ live h bloc...
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let mgf_hash_f a len i mgfseed_counter block = let h0 = ST.get () in update_sub_f h0 mgfseed_counter len 4ul (fun h -> BSeq.nat_to_intseq_be 4 (v i)) (fun _ -> let c = sub mgfseed_counter len 4ul in counter_to_bytes i c); hash a block (len +! 4ul) mgfseed_counter
val mgf_hash_f: a:Hash.hash_alg{S.hash_is_supported a} -> len:size_t{v len + 4 <= max_size_t /\ (v len + 4) `less_than_max_input_length` a} -> i:size_t -> mgfseed_counter:lbuffer uint8 (len +! 4ul) -> block:lbuffer uint8 (hash_len a) -> Stack unit (requires fun h -> live h mgfseed_counter /\ live h bloc...
true
null
false
let h0 = ST.get () in update_sub_f h0 mgfseed_counter len 4ul (fun h -> BSeq.nat_to_intseq_be 4 (v i)) (fun _ -> let c = sub mgfseed_counter len 4ul in counter_to_bytes i c); hash a block (len +! 4ul) mgfseed_counter
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[]
[ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Spec.RSAPSS.hash_is_supported", "Lib.IntTypes.size_t", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Lib.IntTypes.max_size_t", "Hacl.Impl.RSAPSS.MGF.less_than_max_input_...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mgf_hash_f: a:Hash.hash_alg{S.hash_is_supported a} -> len:size_t{v len + 4 <= max_size_t /\ (v len + 4) `less_than_max_input_length` a} -> i:size_t -> mgfseed_counter:lbuffer uint8 (len +! 4ul) -> block:lbuffer uint8 (hash_len a) -> Stack unit (requires fun h -> live h mgfseed_counter /\ live h bloc...
[]
Hacl.Impl.RSAPSS.MGF.mgf_hash_f
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> len: Lib.IntTypes.size_t { Lib.IntTypes.v len + 4 <= Lib.IntTypes.max_size_t /\ Hacl.Impl.RSAPSS.MGF.less_than_max_input_length (Lib.IntTypes.v len + 4) a } -> i: Lib.IntTypes.size_t -> mgfseed_counter: Lib.Bu...
{ "end_col": 43, "end_line": 93, "start_col": 46, "start_line": 86 }
Prims.Tot
val mgf_hash: a:Hash.hash_alg{S.hash_is_supported a} -> mgf_hash_st a
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Lib.Sequence", "short_module": "LSeq" }, { "abbrev": true, "full_module": "Lib.ByteSequence", "short_module": "BSeq" }, { "abbrev": true, "full_modu...
false
let mgf_hash a len mgfseed maskLen res = push_frame (); let mgfseed_counter = create (len +! 4ul) (u8 0) in update_sub mgfseed_counter 0ul len mgfseed; let hLen = hash_len a in let n = blocks maskLen hLen in let accLen = n *! hLen in let acc = create accLen (u8 0) in [@ inline_let] let a_spec = S.mgf...
val mgf_hash: a:Hash.hash_alg{S.hash_is_supported a} -> mgf_hash_st a let mgf_hash a len mgfseed maskLen res =
false
null
false
push_frame (); let mgfseed_counter = create (len +! 4ul) (u8 0) in update_sub mgfseed_counter 0ul len mgfseed; let hLen = hash_len a in let n = blocks maskLen hLen in let accLen = n *! hLen in let acc = create accLen (u8 0) in [@@ inline_let ]let a_spec = S.mgf_hash_a (v len) (v n) in let h0 = ST.get () in fill_blocks ...
{ "checked_file": "Hacl.Impl.RSAPSS.MGF.fst.checked", "dependencies": [ "Spec.RSAPSS.fst.checked", "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib...
[ "total" ]
[ "Spec.Hash.Definitions.hash_alg", "Prims.b2t", "Spec.RSAPSS.hash_is_supported", "Lib.IntTypes.size_t", "Prims.l_and", "Prims.op_LessThanOrEqual", "Prims.op_Addition", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Lib.IntTypes.max_size_t", "Hacl.Impl.RSAPSS.MGF.less_than_max_input_...
[]
module Hacl.Impl.RSAPSS.MGF open FStar.HyperStack open FStar.HyperStack.ST open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum.Definitions module ST = FStar.HyperStack.ST module S = Spec.RSAPSS module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module Hash = Spec.Agile.Hash #reset-options "--...
false
false
Hacl.Impl.RSAPSS.MGF.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mgf_hash: a:Hash.hash_alg{S.hash_is_supported a} -> mgf_hash_st a
[]
Hacl.Impl.RSAPSS.MGF.mgf_hash
{ "file_name": "code/rsapss/Hacl.Impl.RSAPSS.MGF.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} -> Hacl.Impl.RSAPSS.MGF.mgf_hash_st a
{ "end_col": 14, "end_line": 130, "start_col": 2, "start_line": 111 }
Prims.Tot
val cs:S.ciphersuite
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Spec.Agile.AEAD", "short_module": "AEAD" }, { "abbrev": true, "full_module": "Spec.Agile.DH", "short_module": "DH" }, { "abbrev": true, "full_module...
false
let cs:S.ciphersuite = (DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_256)
val cs:S.ciphersuite let cs:S.ciphersuite =
false
null
false
(DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_256)
{ "checked_file": "Hacl.HPKE.Curve51_CP128_SHA256.fsti.checked", "dependencies": [ "Spec.Agile.HPKE.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.DH.fst.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Hacl.Impl.HPKE.fsti.checked", "FStar.Pervasives.Native.fst...
[ "total" ]
[ "FStar.Pervasives.Native.Mktuple4", "Spec.Agile.DH.algorithm", "Spec.Agile.HPKE.hash_algorithm", "Spec.Agile.HPKE.aead", "Spec.Hash.Definitions.hash_alg", "Spec.Agile.DH.DH_Curve25519", "Spec.Hash.Definitions.SHA2_256", "Spec.Agile.HPKE.Seal", "Spec.Agile.AEAD.CHACHA20_POLY1305" ]
[]
module Hacl.HPKE.Curve51_CP128_SHA256 open Hacl.Impl.HPKE module S = Spec.Agile.HPKE module DH = Spec.Agile.DH module AEAD = Spec.Agile.AEAD module Hash = Spec.Agile.Hash
false
true
Hacl.HPKE.Curve51_CP128_SHA256.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val cs:S.ciphersuite
[]
Hacl.HPKE.Curve51_CP128_SHA256.cs
{ "file_name": "code/hpke/Hacl.HPKE.Curve51_CP128_SHA256.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Spec.Agile.HPKE.ciphersuite
{ "end_col": 102, "end_line": 10, "start_col": 23, "start_line": 10 }
Prims.Tot
val add1_: add1_t True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let add1_ out f1 f2 = let h0 = ST.get () in let c = BN.bn_add1 4ul f1 f2 out in let h1 = ST.get () in assert (let c1, r1 = CC.add1 (as_seq h0 f1) f2 in c == c1 /\ as_seq h1 out == r1); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_seq h1 out); c
val add1_: add1_t True let add1_ out f1 f2 =
false
null
false
let h0 = ST.get () in let c = BN.bn_add1 4ul f1 f2 out in let h1 = ST.get () in assert (let c1, r1 = CC.add1 (as_seq h0 f1) f2 in c == c1 /\ as_seq h1 out == r1); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_seq h1 out); c
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Lib.IntTypes.uint64", "FStar.Ghost.hide", "Prims.unit", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val add1_: add1_t True
[]
Hacl.Impl.Curve25519.Field64.Hacl.add1_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.add1_t Prims.l_True
{ "end_col": 3, "end_line": 35, "start_col": 21, "start_line": 28 }
Prims.Tot
val fsqr_: fsqr_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fsqr_ out f1 tmp = let h0 = ST.get () in BN.bn_sqr 4ul f1 tmp; SB.bn_sqr_lemma (as_seq h0 f1); let c0 = BN.bn_mul1_lshift_add_in_place 4ul (sub tmp 4ul 4ul) (u64 38) 4ul 0ul (sub tmp 0ul 4ul) in let c = BN.bn_add1 4ul (sub tmp 0ul 4ul) (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h...
val fsqr_: fsqr_t M64 True let fsqr_ out f1 tmp =
false
null
false
let h0 = ST.get () in BN.bn_sqr 4ul f1 tmp; SB.bn_sqr_lemma (as_seq h0 f1); let c0 = BN.bn_mul1_lshift_add_in_place 4ul (sub tmp 4ul 4ul) (u64 38) 4ul 0ul (sub tmp 0ul 4ul) in let c = BN.bn_add1 4ul (sub tmp 0ul 4ul) (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 ou...
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Impl.Curve25519.Fields.Core.felem_wide", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519.Fields.Core.n...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fsqr_: fsqr_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fsqr_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fsqr_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 35, "end_line": 114, "start_col": 22, "start_line": 104 }
Prims.Tot
val fsqr2_: fsqr2_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fsqr2_ out f tmp = let out1 = B.sub out 0ul 4ul in let out2 = B.sub out 4ul 4ul in let f1 = B.sub f 0ul 4ul in let f2 = B.sub f 4ul 4ul in fmul_ out1 f1 f1 tmp; fmul_ out2 f2 f2 tmp
val fsqr2_: fsqr2_t M64 True let fsqr2_ out f tmp =
false
null
false
let out1 = B.sub out 0ul 4ul in let out2 = B.sub out 4ul 4ul in let f1 = B.sub f 0ul 4ul in let f2 = B.sub f 4ul 4ul in fmul_ out1 f1 f1 tmp; fmul_ out2 f2 f2 tmp
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem2", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Impl.Curve25519.Fields.Core.felem_wide2", "Hacl.Impl.Curve25519.Field64.Hacl.fmul_", "Prims.unit", "Lib.Buffer.lbuffer_t", "Lib.Buffer.MUT", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FSt...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fsqr2_: fsqr2_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fsqr2_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fsqr2_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 22, "end_line": 124, "start_col": 22, "start_line": 118 }
Prims.Tot
val fmul1_: fmul1_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fmul1_ out f1 f2 = let h0 = ST.get () in let c0 = BN.bn_mul1 4ul f1 f2 out in let c = BN.bn_add1 4ul out (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fmul14 (as_seq h0 f1) f2); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_s...
val fmul1_: fmul1_t M64 True let fmul1_ out f1 f2 =
false
null
false
let h0 = ST.get () in let c0 = BN.bn_mul1 4ul f1 f2 out in let c = BN.bn_add1 4ul out (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fmul14 (as_seq h0 f1) f2); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_seq h1 out)
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Lib.IntTypes.uint64", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519.Fields.Core.nlimb", "Prims.unit", ...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fmul1_: fmul1_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fmul1_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fmul1_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 35, "end_line": 100, "start_col": 22, "start_line": 92 }
Prims.Tot
val fadd_: fadd_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fadd_ out f1 f2 = let h0 = ST.get () in let c0 = BN.bn_add_eq_len 4ul f1 f2 out in let c = BN.bn_add1 4ul out (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fadd4 (as_seq h0 f1) (as_seq h0 f2)); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v...
val fadd_: fadd_t M64 True let fadd_ out f1 f2 =
false
null
false
let h0 = ST.get () in let c0 = BN.bn_add_eq_len 4ul f1 f2 out in let c = BN.bn_add1 4ul out (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fadd4 (as_seq h0 f1) (as_seq h0 f2)); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_seq h0 f2); CD.bn_v_is_...
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519.Fields.Core.nlimb", "Prims.unit", "Prims._assert", "Prim...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fadd_: fadd_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fadd_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fadd_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 35, "end_line": 48, "start_col": 21, "start_line": 39 }
Prims.Tot
val fmul_: fmul_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fmul_ out f1 f2 tmp = let h0 = ST.get () in let tmp0 = sub tmp 0ul 8ul in BN.bn_mul 4ul 4ul f1 f2 tmp0; let c0 = BN.bn_mul1_lshift_add_in_place 4ul (sub tmp0 4ul 4ul) (u64 38) 4ul 0ul (sub tmp0 0ul 4ul) in let c = BN.bn_add1 4ul (sub tmp0 0ul 4ul) (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64...
val fmul_: fmul_t M64 True let fmul_ out f1 f2 tmp =
false
null
false
let h0 = ST.get () in let tmp0 = sub tmp 0ul 8ul in BN.bn_mul 4ul 4ul f1 f2 tmp0; let c0 = BN.bn_mul1_lshift_add_in_place 4ul (sub tmp0 4ul 4ul) (u64 38) 4ul 0ul (sub tmp0 0ul 4ul) in let c = BN.bn_add1 4ul (sub tmp0 0ul 4ul) (c0 *. u64 38) out in out.(0ul) <- out.(0ul) +. c *. u64 38; let h1 = ST.get () in assert (a...
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Impl.Curve25519.Fields.Core.felem_wide2", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519.Fields.Core....
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fmul_: fmul_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fmul_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fmul_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 35, "end_line": 76, "start_col": 25, "start_line": 65 }
Prims.Tot
val fsub_: fsub_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fsub_ out f1 f2 = let h0 = ST.get () in let c0 = BN.bn_sub_eq_len 4ul f1 f2 out in let c = BN.bn_sub1 4ul out (c0 *! u64 38) out in out.(0ul) <- out.(0ul) -. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fsub4 (as_seq h0 f1) (as_seq h0 f2)); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v...
val fsub_: fsub_t M64 True let fsub_ out f1 f2 =
false
null
false
let h0 = ST.get () in let c0 = BN.bn_sub_eq_len 4ul f1 f2 out in let c = BN.bn_sub1 4ul out (c0 *! u64 38) out in out.(0ul) <- out.(0ul) -. c *. u64 38; let h1 = ST.get () in assert (as_seq h1 out == CC.fsub4 (as_seq h0 f1) (as_seq h0 f2)); CD.bn_v_is_as_nat (as_seq h0 f1); CD.bn_v_is_as_nat (as_seq h0 f2); CD.bn_v_is_...
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat", "Lib.Buffer.as_seq", "Lib.Buffer.MUT", "Hacl.Impl.Curve25519.Fields.Core.limb", "Hacl.Impl.Curve25519.Fields.Core.nlimb", "Prims.unit", "Prims._assert", "Prim...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fsub_: fsub_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fsub_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fsub_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 35, "end_line": 61, "start_col": 21, "start_line": 52 }
Prims.Tot
val fmul2_: fmul2_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let fmul2_ out f1 f2 tmp = let out1 = B.sub out 0ul 4ul in let out2 = B.sub out 4ul 4ul in let f11 = B.sub f1 0ul 4ul in let f12 = B.sub f1 4ul 4ul in let f21 = B.sub f2 0ul 4ul in let f22 = B.sub f2 4ul 4ul in fmul_ out1 f11 f21 tmp; fmul_ out2 f12 f22 tmp
val fmul2_: fmul2_t M64 True let fmul2_ out f1 f2 tmp =
false
null
false
let out1 = B.sub out 0ul 4ul in let out2 = B.sub out 4ul 4ul in let f11 = B.sub f1 0ul 4ul in let f12 = B.sub f1 4ul 4ul in let f21 = B.sub f2 0ul 4ul in let f22 = B.sub f2 4ul 4ul in fmul_ out1 f11 f21 tmp; fmul_ out2 f12 f22 tmp
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Hacl.Impl.Curve25519.Fields.Core.felem2", "Hacl.Impl.Curve25519.Fields.Core.M64", "Hacl.Impl.Curve25519.Fields.Core.felem_wide2", "Hacl.Impl.Curve25519.Field64.Hacl.fmul_", "Prims.unit", "Lib.Buffer.lbuffer_t", "Lib.Buffer.MUT", "Lib.IntTypes.int_t", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "FSt...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fmul2_: fmul2_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.fmul2_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.fmul2_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 24, "end_line": 88, "start_col": 26, "start_line": 80 }
Prims.Tot
val cswap2_: cswap2_t M64 True
[ { "abbrev": true, "full_module": "Hacl.Spec.Bignum.Definitions", "short_module": "SD" }, { "abbrev": true, "full_module": "Hacl.Spec.Bignum", "short_module": "SB" }, { "abbrev": true, "full_module": "Hacl.Bignum.Definitions", "short_module": "BD" }, { "abbrev": tr...
false
let cswap2_ bit p1 p2 = let h0 = ST.get () in let mask = u64 0 -. bit in [@ inline_let] let inv h1 (i:nat{i <= 8}) = (forall (k:nat{k < i}). if v bit = 1 then (as_seq h1 p1).[k] == (as_seq h0 p2).[k] /\ (as_seq h1 p2).[k] == (as_seq h0 p1).[k] else (as_seq h1 p1).[k] == (as_seq h0 p1).[k]...
val cswap2_: cswap2_t M64 True let cswap2_ bit p1 p2 =
false
null
false
let h0 = ST.get () in let mask = u64 0 -. bit in [@@ inline_let ]let inv h1 (i: nat{i <= 8}) = (forall (k: nat{k < i}). if v bit = 1 then (as_seq h1 p1).[ k ] == (as_seq h0 p2).[ k ] /\ (as_seq h1 p2).[ k ] == (as_seq h0 p1).[ k ] else (as_seq h1 p1).[ k ] == (as_seq h0 p1).[ k ] /\ ...
{ "checked_file": "Hacl.Impl.Curve25519.Field64.Hacl.fst.checked", "dependencies": [ "prims.fst.checked", "Lib.Sequence.fsti.checked", "Lib.Loops.fsti.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field64.Definiti...
[ "total" ]
[ "Lib.IntTypes.uint64", "Prims.b2t", "Prims.op_LessThanOrEqual", "Lib.IntTypes.v", "Lib.IntTypes.U64", "Lib.IntTypes.SEC", "Hacl.Impl.Curve25519.Fields.Core.felem2", "Hacl.Impl.Curve25519.Fields.Core.M64", "Prims._assert", "Prims.op_Equality", "Prims.int", "Prims.eq2", "Lib.Sequence.lseq", ...
[]
module Hacl.Impl.Curve25519.Field64.Hacl open FStar.HyperStack open FStar.HyperStack.All open FStar.Mul open Lib.Sequence open Lib.IntTypes open Lib.Buffer module B = Lib.Buffer module ST = FStar.HyperStack.ST module BSeq = Lib.ByteSequence module LSeq = Lib.Sequence module CD = Hacl.Spec.Curve25519.Field64.Definit...
false
true
Hacl.Impl.Curve25519.Field64.Hacl.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val cswap2_: cswap2_t M64 True
[]
Hacl.Impl.Curve25519.Field64.Hacl.cswap2_
{ "file_name": "code/curve25519/Hacl.Impl.Curve25519.Field64.Hacl.fst", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Impl.Curve25519.Fields.Core.cswap2_t Hacl.Impl.Curve25519.Fields.Core.M64 Prims.l_True
{ "end_col": 80, "end_line": 153, "start_col": 23, "start_line": 128 }
Prims.Tot
val tl: l:list 'a {Cons? l} -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let tl = tail
val tl: l:list 'a {Cons? l} -> Tot (list 'a) let tl =
false
null
false
tail
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "FStar.List.Tot.Base.tail" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val tl: l:list 'a {Cons? l} -> Tot (list 'a)
[]
FStar.List.Tot.Base.tl
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a {Cons? l} -> Prims.list 'a
{ "end_col": 13, "end_line": 53, "start_col": 9, "start_line": 53 }
Prims.Tot
val isEmpty: list 'a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let isEmpty l = match l with | [] -> true | _ -> false
val isEmpty: list 'a -> Tot bool let isEmpty l =
false
null
false
match l with | [] -> true | _ -> false
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.bool" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val isEmpty: list 'a -> Tot bool
[]
FStar.List.Tot.Base.isEmpty
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a -> Prims.bool
{ "end_col": 14, "end_line": 34, "start_col": 16, "start_line": 32 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let op_At x y = append x y
let op_At x y =
false
null
false
append x y
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.List.Tot.Base.append" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val op_At : x: Prims.list _ -> y: Prims.list _ -> Prims.list _
[]
FStar.List.Tot.Base.op_At
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: Prims.list _ -> y: Prims.list _ -> Prims.list _
{ "end_col": 26, "end_line": 124, "start_col": 16, "start_line": 124 }
Prims.GTot
val map_gtot (#a #b: _) (f: (a -> GTot b)) (x: list a) : GTot (list b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let map_gtot #a #b (f:a -> GTot b) (x:list a) : GTot (list b) = fold_right_gtot x (fun x tl -> f x :: tl) []
val map_gtot (#a #b: _) (f: (a -> GTot b)) (x: list a) : GTot (list b) let map_gtot #a #b (f: (a -> GTot b)) (x: list a) : GTot (list b) =
false
null
false
fold_right_gtot x (fun x tl -> f x :: tl) []
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "sometrivial" ]
[ "Prims.list", "FStar.List.Tot.Base.fold_right_gtot", "Prims.Cons", "Prims.Nil" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val map_gtot (#a #b: _) (f: (a -> GTot b)) (x: list a) : GTot (list b)
[]
FStar.List.Tot.Base.map_gtot
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.GTot b) -> x: Prims.list a -> Prims.GTot (Prims.list b)
{ "end_col": 48, "end_line": 210, "start_col": 4, "start_line": 210 }
Prims.Tot
val contains: #a: eqtype -> a -> list a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let contains : #a:eqtype -> a -> list a -> Tot bool = mem
val contains: #a: eqtype -> a -> list a -> Tot bool let contains: #a: eqtype -> a -> list a -> Tot bool =
false
null
false
mem
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "FStar.List.Tot.Base.mem" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val contains: #a: eqtype -> a -> list a -> Tot bool
[]
FStar.List.Tot.Base.contains
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
_: a -> _: Prims.list a -> Prims.bool
{ "end_col": 57, "end_line": 248, "start_col": 54, "start_line": 248 }
Prims.Tot
val snoc: (list 'a * 'a) -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let snoc (l, x) = append l [x]
val snoc: (list 'a * 'a) -> Tot (list 'a) let snoc (l, x) =
false
null
false
append l [x]
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "FStar.Pervasives.Native.tuple2", "Prims.list", "FStar.List.Tot.Base.append", "Prims.Cons", "Prims.Nil" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val snoc: (list 'a * 'a) -> Tot (list 'a)
[]
FStar.List.Tot.Base.snoc
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
_: (Prims.list 'a * 'a) -> Prims.list 'a
{ "end_col": 30, "end_line": 137, "start_col": 18, "start_line": 137 }
Prims.Tot
val mapi: (int -> 'a -> Tot 'b) -> list 'a -> Tot (list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let mapi f l = mapi_init f l 0
val mapi: (int -> 'a -> Tot 'b) -> list 'a -> Tot (list 'b) let mapi f l =
false
null
false
mapi_init f l 0
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.int", "Prims.list", "FStar.List.Tot.Base.mapi_init" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mapi: (int -> 'a -> Tot 'b) -> list 'a -> Tot (list 'b)
[]
FStar.List.Tot.Base.mapi
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: Prims.int -> _: 'a -> 'b) -> l: Prims.list 'a -> Prims.list 'b
{ "end_col": 30, "end_line": 169, "start_col": 15, "start_line": 169 }
Prims.Pure
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let strict_prefix_of = strict_suffix_of
let strict_prefix_of =
false
null
false
strict_suffix_of
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "" ]
[ "FStar.List.Tot.Base.strict_suffix_of", "Prims.list", "Prims.l_True" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val strict_prefix_of : l1: Prims.list _ -> l2: Prims.list _ -> Prims.Pure Type0
[]
FStar.List.Tot.Base.strict_prefix_of
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l1: Prims.list _ -> l2: Prims.list _ -> Prims.Pure Type0
{ "end_col": 39, "end_line": 541, "start_col": 23, "start_line": 541 }
Prims.Tot
val bool_of_compare : #a:Type -> (a -> a -> Tot int) -> a -> a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let bool_of_compare #a f x y = f x y < 0
val bool_of_compare : #a:Type -> (a -> a -> Tot int) -> a -> a -> Tot bool let bool_of_compare #a f x y =
false
null
false
f x y < 0
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.int", "Prims.op_LessThan", "Prims.bool" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val bool_of_compare : #a:Type -> (a -> a -> Tot int) -> a -> a -> Tot bool
[]
FStar.List.Tot.Base.bool_of_compare
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> _: a -> Prims.int) -> x: a -> y: a -> Prims.bool
{ "end_col": 40, "end_line": 499, "start_col": 31, "start_line": 499 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let unzip l = split l
let unzip l =
false
null
false
split l
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.split" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val unzip : l: Prims.list (_ * _) -> Prims.list _ * Prims.list _
[]
FStar.List.Tot.Base.unzip
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list (_ * _) -> Prims.list _ * Prims.list _
{ "end_col": 21, "end_line": 426, "start_col": 14, "start_line": 426 }
FStar.Pervasives.Lemma
val mem_filter_forall (#a:Type) (f: (a -> Tot bool)) (l: list a) : Lemma (requires True) (ensures (forall x . memP x (filter f l) ==> f x)) [SMTPat (filter f l)]
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let mem_filter_forall f l = FStar.Classical.ghost_lemma (mem_filter f l)
val mem_filter_forall (#a:Type) (f: (a -> Tot bool)) (l: list a) : Lemma (requires True) (ensures (forall x . memP x (filter f l) ==> f x)) [SMTPat (filter f l)] let mem_filter_forall f l =
false
null
true
FStar.Classical.ghost_lemma (mem_filter f l)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "lemma" ]
[ "Prims.bool", "Prims.list", "FStar.Classical.ghost_lemma", "FStar.List.Tot.Base.memP", "FStar.List.Tot.Base.filter", "Prims.unit", "Prims.b2t", "FStar.List.Tot.Base.mem_filter" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mem_filter_forall (#a:Type) (f: (a -> Tot bool)) (l: list a) : Lemma (requires True) (ensures (forall x . memP x (filter f l) ==> f x)) [SMTPat (filter f l)]
[]
FStar.List.Tot.Base.mem_filter_forall
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.bool) -> l: Prims.list a -> FStar.Pervasives.Lemma (ensures forall (x: a). FStar.List.Tot.Base.memP x (FStar.List.Tot.Base.filter f l) ==> f x) [SMTPat (FStar.List.Tot.Base.filter f l)]
{ "end_col": 72, "end_line": 296, "start_col": 28, "start_line": 296 }
Prims.Tot
val compare_of_bool : #a:eqtype -> (a -> a -> Tot bool) -> a -> a -> Tot int
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let compare_of_bool #a rel x y = if x `rel` y then -1 else if x = y then 0 else 1
val compare_of_bool : #a:eqtype -> (a -> a -> Tot bool) -> a -> a -> Tot int let compare_of_bool #a rel x y =
false
null
false
if x `rel` y then - 1 else if x = y then 0 else 1
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.bool", "Prims.op_Minus", "Prims.op_Equality", "Prims.int" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val compare_of_bool : #a:eqtype -> (a -> a -> Tot bool) -> a -> a -> Tot int
[]
FStar.List.Tot.Base.compare_of_bool
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
rel: (_: a -> _: a -> Prims.bool) -> x: a -> y: a -> Prims.int
{ "end_col": 10, "end_line": 512, "start_col": 4, "start_line": 510 }
Prims.Tot
val rev: list 'a -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rev l = rev_acc l []
val rev: list 'a -> Tot (list 'a) let rev l =
false
null
false
rev_acc l []
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.List.Tot.Base.rev_acc", "Prims.Nil" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val rev: list 'a -> Tot (list 'a)
[]
FStar.List.Tot.Base.rev
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a -> Prims.list 'a
{ "end_col": 24, "end_line": 115, "start_col": 12, "start_line": 115 }
Prims.Tot
val length: list 'a -> Tot nat
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec length = function | [] -> 0 | _::tl -> 1 + length tl
val length: list 'a -> Tot nat let rec length =
false
null
false
function | [] -> 0 | _ :: tl -> 1 + length tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.op_Addition", "FStar.List.Tot.Base.length", "Prims.nat" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val length: list 'a -> Tot nat
[ "recursion" ]
FStar.List.Tot.Base.length
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
_: Prims.list 'a -> Prims.nat
{ "end_col": 26, "end_line": 76, "start_col": 17, "start_line": 74 }
Prims.Tot
val index: #a:Type -> l:list a -> i:nat{i < length l} -> Tot a
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec index #a (l: list a) (i:nat{i < length l}): Tot a = if i = 0 then hd l else index (tl l) (i - 1)
val index: #a:Type -> l:list a -> i:nat{i < length l} -> Tot a let rec index #a (l: list a) (i: nat{i < length l}) : Tot a =
false
null
false
if i = 0 then hd l else index (tl l) (i - 1)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "Prims.op_Equality", "Prims.int", "FStar.List.Tot.Base.hd", "Prims.bool", "FStar.List.Tot.Base.index", "FStar.List.Tot.Base.tl", "Prims.op_Subtraction" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val index: #a:Type -> l:list a -> i:nat{i < length l} -> Tot a
[ "recursion" ]
FStar.List.Tot.Base.index
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a -> i: Prims.nat{i < FStar.List.Tot.Base.length l} -> a
{ "end_col": 24, "end_line": 94, "start_col": 2, "start_line": 91 }
Prims.Tot
val tail: l:list 'a {Cons? l} -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let tail = function | _::tl -> tl
val tail: l:list 'a {Cons? l} -> Tot (list 'a) let tail =
false
null
false
function | _ :: tl -> tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.b2t", "Prims.uu___is_Cons" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val tail: l:list 'a {Cons? l} -> Tot (list 'a)
[]
FStar.List.Tot.Base.tail
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a {Cons? l} -> Prims.list 'a
{ "end_col": 15, "end_line": 47, "start_col": 11, "start_line": 46 }
Prims.Tot
val collect: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec collect f l = match l with | [] -> [] | hd::tl -> append (f hd) (collect f tl)
val collect: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) let rec collect f l =
false
null
false
match l with | [] -> [] | hd :: tl -> append (f hd) (collect f tl)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Nil", "FStar.List.Tot.Base.append", "FStar.List.Tot.Base.collect" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val collect: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b)
[ "recursion" ]
FStar.List.Tot.Base.collect
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> Prims.list 'b) -> l: Prims.list 'a -> Prims.list 'b
{ "end_col": 44, "end_line": 326, "start_col": 22, "start_line": 324 }
Prims.Tot
val flatten: list (list 'a) -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec flatten l = match l with | [] -> [] | hd::tl -> append hd (flatten tl)
val flatten: list (list 'a) -> Tot (list 'a) let rec flatten l =
false
null
false
match l with | [] -> [] | hd :: tl -> append hd (flatten tl)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Nil", "FStar.List.Tot.Base.append", "FStar.List.Tot.Base.flatten" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val flatten: list (list 'a) -> Tot (list 'a)
[ "recursion" ]
FStar.List.Tot.Base.flatten
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list (Prims.list 'a) -> Prims.list 'a
{ "end_col": 38, "end_line": 145, "start_col": 20, "start_line": 143 }
Prims.Tot
val last: l:list 'a {Cons? l} -> Tot 'a
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec last = function | [hd] -> hd | _::tl -> last tl
val last: l:list 'a {Cons? l} -> Tot 'a let rec last =
false
null
false
function | [hd] -> hd | _ :: tl -> last tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.b2t", "Prims.uu___is_Cons", "FStar.List.Tot.Base.last" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val last: l:list 'a {Cons? l} -> Tot 'a
[ "recursion" ]
FStar.List.Tot.Base.last
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a {Cons? l} -> 'a
{ "end_col": 20, "end_line": 61, "start_col": 15, "start_line": 59 }
Prims.Tot
val hd: l:list 'a{Cons? l} -> Tot 'a
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let hd = function | hd::_ -> hd
val hd: l:list 'a{Cons? l} -> Tot 'a let hd =
false
null
false
function | hd :: _ -> hd
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.b2t", "Prims.uu___is_Cons" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val hd: l:list 'a{Cons? l} -> Tot 'a
[]
FStar.List.Tot.Base.hd
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a {Cons? l} -> 'a
{ "end_col": 15, "end_line": 40, "start_col": 9, "start_line": 39 }
Prims.Tot
val count: #a:eqtype -> a -> list a -> Tot nat
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec count #a x = function | [] -> 0 | hd::tl -> if x=hd then 1 + count x tl else count x tl
val count: #a:eqtype -> a -> list a -> Tot nat let rec count #a x =
false
null
false
function | [] -> 0 | hd :: tl -> if x = hd then 1 + count x tl else count x tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.list", "Prims.op_Equality", "Prims.op_Addition", "FStar.List.Tot.Base.count", "Prims.bool", "Prims.nat" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val count: #a:eqtype -> a -> list a -> Tot nat
[ "recursion" ]
FStar.List.Tot.Base.count
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: a -> _: Prims.list a -> Prims.nat
{ "end_col": 57, "end_line": 102, "start_col": 21, "start_line": 100 }
Prims.Tot
val find: #a:Type -> f:(a -> Tot bool) -> list a -> Tot (option (x:a{f x}))
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec find #a f l = match l with | [] -> None #(x:a{f x}) //These type annotations are only present because it makes bootstrapping go much faster | hd::tl -> if f hd then Some #(x:a{f x}) hd else find f tl
val find: #a:Type -> f:(a -> Tot bool) -> list a -> Tot (option (x:a{f x})) let rec find #a f l =
false
null
false
match l with | [] -> None #(x: a{f x}) | hd :: tl -> if f hd then Some #(x: a{f x}) hd else find f tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.None", "Prims.b2t", "FStar.Pervasives.Native.Some", "FStar.List.Tot.Base.find", "FStar.Pervasives.Native.option" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val find: #a:Type -> f:(a -> Tot bool) -> list a -> Tot (option (x:a{f x}))
[ "recursion" ]
FStar.List.Tot.Base.find
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.bool) -> l: Prims.list a -> FStar.Pervasives.Native.option (x: a{f x})
{ "end_col": 61, "end_line": 268, "start_col": 22, "start_line": 266 }
Prims.Tot
val nth: list 'a -> nat -> Tot (option 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec nth l n = match l with | [] -> None | hd::tl -> if n = 0 then Some hd else nth tl (n - 1)
val nth: list 'a -> nat -> Tot (option 'a) let rec nth l n =
false
null
false
match l with | [] -> None | hd :: tl -> if n = 0 then Some hd else nth tl (n - 1)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.nat", "FStar.Pervasives.Native.None", "Prims.op_Equality", "Prims.int", "FStar.Pervasives.Native.Some", "Prims.bool", "FStar.List.Tot.Base.nth", "Prims.op_Subtraction", "FStar.Pervasives.Native.option" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val nth: list 'a -> nat -> Tot (option 'a)
[ "recursion" ]
FStar.List.Tot.Base.nth
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a -> n: Prims.nat -> FStar.Pervasives.Native.option 'a
{ "end_col": 55, "end_line": 84, "start_col": 18, "start_line": 82 }
Prims.GTot
val fold_right_gtot (#a #b: Type) (l: list a) (f: (a -> b -> GTot b)) (x: b) : GTot b
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec fold_right_gtot (#a:Type) (#b:Type) (l:list a) (f:a -> b -> GTot b) (x:b) : GTot b = match l with | [] -> x | hd::tl -> f hd (fold_right_gtot tl f x)
val fold_right_gtot (#a #b: Type) (l: list a) (f: (a -> b -> GTot b)) (x: b) : GTot b let rec fold_right_gtot (#a #b: Type) (l: list a) (f: (a -> b -> GTot b)) (x: b) : GTot b =
false
null
false
match l with | [] -> x | hd :: tl -> f hd (fold_right_gtot tl f x)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "sometrivial" ]
[ "Prims.list", "FStar.List.Tot.Base.fold_right_gtot" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fold_right_gtot (#a #b: Type) (l: list a) (f: (a -> b -> GTot b)) (x: b) : GTot b
[ "recursion" ]
FStar.List.Tot.Base.fold_right_gtot
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a -> f: (_: a -> _: b -> Prims.GTot b) -> x: b -> Prims.GTot b
{ "end_col": 45, "end_line": 205, "start_col": 4, "start_line": 203 }
Prims.Tot
val mapi_init: (int -> 'a -> Tot 'b) -> list 'a -> int -> Tot (list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec mapi_init f l i = match l with | [] -> [] | hd::tl -> (f i hd)::(mapi_init f tl (i+1))
val mapi_init: (int -> 'a -> Tot 'b) -> list 'a -> int -> Tot (list 'b) let rec mapi_init f l i =
false
null
false
match l with | [] -> [] | hd :: tl -> (f i hd) :: (mapi_init f tl (i + 1))
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.int", "Prims.list", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.mapi_init", "Prims.op_Addition" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mapi_init: (int -> 'a -> Tot 'b) -> list 'a -> int -> Tot (list 'b)
[ "recursion" ]
FStar.List.Tot.Base.mapi_init
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: Prims.int -> _: 'a -> 'b) -> l: Prims.list 'a -> i: Prims.int -> Prims.list 'b
{ "end_col": 48, "end_line": 162, "start_col": 26, "start_line": 160 }
Prims.Tot
val append: list 'a -> list 'a -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec append x y = match x with | [] -> y | a::tl -> a::append tl y
val append: list 'a -> list 'a -> Tot (list 'a) let rec append x y =
false
null
false
match x with | [] -> y | a :: tl -> a :: append tl y
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Cons", "FStar.List.Tot.Base.append" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val append: list 'a -> list 'a -> Tot (list 'a)
[ "recursion" ]
FStar.List.Tot.Base.append
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: Prims.list 'a -> y: Prims.list 'a -> Prims.list 'a
{ "end_col": 27, "end_line": 121, "start_col": 21, "start_line": 119 }
Prims.Tot
val map: ('a -> Tot 'b) -> list 'a -> Tot (list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec map f x = match x with | [] -> [] | a::tl -> f a::map f tl
val map: ('a -> Tot 'b) -> list 'a -> Tot (list 'b) let rec map f x =
false
null
false
match x with | [] -> [] | a :: tl -> f a :: map f tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.map" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val map: ('a -> Tot 'b) -> list 'a -> Tot (list 'b)
[ "recursion" ]
FStar.List.Tot.Base.map
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> 'b) -> x: Prims.list 'a -> Prims.list 'b
{ "end_col": 26, "end_line": 153, "start_col": 18, "start_line": 151 }
Prims.Tot
val init: l:list 'a {Cons? l} -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec init = function | [_] -> [] | hd::tl -> hd::(init tl)
val init: l:list 'a {Cons? l} -> Tot (list 'a) let rec init =
false
null
false
function | [_] -> [] | hd :: tl -> hd :: (init tl)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.b2t", "Prims.uu___is_Cons", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.init" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val init: l:list 'a {Cons? l} -> Tot (list 'a)
[ "recursion" ]
FStar.List.Tot.Base.init
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a {Cons? l} -> Prims.list 'a
{ "end_col": 27, "end_line": 69, "start_col": 15, "start_line": 67 }
Prims.Tot
val concatMap: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec concatMap f = function | [] -> [] | a::tl -> let fa = f a in let ftl = concatMap f tl in append fa ftl
val concatMap: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) let rec concatMap f =
false
null
false
function | [] -> [] | a :: tl -> let fa = f a in let ftl = concatMap f tl in append fa ftl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Nil", "FStar.List.Tot.Base.append", "FStar.List.Tot.Base.concatMap" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val concatMap: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b)
[ "recursion" ]
FStar.List.Tot.Base.concatMap
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> Prims.list 'b) -> _: Prims.list 'a -> Prims.list 'b
{ "end_col": 17, "end_line": 181, "start_col": 22, "start_line": 176 }
Prims.Tot
val split3: #a:Type -> l:list a -> i:nat{i < length l} -> Tot (list a * a * list a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let split3 #a l i = let a, rest = splitAt i l in lemma_splitAt_snd_length i l; let b :: c = rest in a, b, c
val split3: #a:Type -> l:list a -> i:nat{i < length l} -> Tot (list a * a * list a) let split3 #a l i =
false
null
false
let a, rest = splitAt i l in lemma_splitAt_snd_length i l; let b :: c = rest in a, b, c
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "FStar.Pervasives.Native.Mktuple3", "FStar.Pervasives.Native.tuple3", "Prims.unit", "FStar.List.Tot.Base.lemma_splitAt_snd_length", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.splitAt" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val split3: #a:Type -> l:list a -> i:nat{i < length l} -> Tot (list a * a * list a)
[]
FStar.List.Tot.Base.split3
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a -> i: Prims.nat{i < FStar.List.Tot.Base.length l} -> (Prims.list a * a) * Prims.list a
{ "end_col": 9, "end_line": 475, "start_col": 19, "start_line": 471 }
Prims.Tot
val mem: #a:eqtype -> a -> list a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec mem #a x = function | [] -> false | hd::tl -> if hd = x then true else mem x tl
val mem: #a:eqtype -> a -> list a -> Tot bool let rec mem #a x =
false
null
false
function | [] -> false | hd :: tl -> if hd = x then true else mem x tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.list", "Prims.op_Equality", "Prims.bool", "FStar.List.Tot.Base.mem" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val mem: #a:eqtype -> a -> list a -> Tot bool
[ "recursion" ]
FStar.List.Tot.Base.mem
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: a -> _: Prims.list a -> Prims.bool
{ "end_col": 47, "end_line": 242, "start_col": 19, "start_line": 240 }
Prims.Tot
val noRepeats : #a:eqtype -> list a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec noRepeats #a la = match la with | [] -> true | h :: tl -> not(mem h tl) && noRepeats tl
val noRepeats : #a:eqtype -> list a -> Tot bool let rec noRepeats #a la =
false
null
false
match la with | [] -> true | h :: tl -> not (mem h tl) && noRepeats tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.list", "Prims.op_AmpAmp", "Prims.op_Negation", "FStar.List.Tot.Base.mem", "FStar.List.Tot.Base.noRepeats", "Prims.bool" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val noRepeats : #a:eqtype -> list a -> Tot bool
[ "recursion" ]
FStar.List.Tot.Base.noRepeats
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
la: Prims.list a -> Prims.bool
{ "end_col": 44, "end_line": 391, "start_col": 2, "start_line": 389 }
Prims.Tot
val fold_left: ('a -> 'b -> Tot 'a) -> 'a -> l:list 'b -> Tot 'a (decreases l)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec fold_left f x l = match l with | [] -> x | hd::tl -> fold_left f (f x hd) tl
val fold_left: ('a -> 'b -> Tot 'a) -> 'a -> l:list 'b -> Tot 'a (decreases l) let rec fold_left f x l =
false
null
false
match l with | [] -> x | hd :: tl -> fold_left f (f x hd) tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total", "" ]
[ "Prims.list", "FStar.List.Tot.Base.fold_left" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fold_left: ('a -> 'b -> Tot 'a) -> 'a -> l:list 'b -> Tot 'a (decreases l)
[ "recursion" ]
FStar.List.Tot.Base.fold_left
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> _: 'b -> 'a) -> x: 'a -> l: Prims.list 'b -> Prims.Tot 'a
{ "end_col": 37, "end_line": 189, "start_col": 26, "start_line": 187 }
Prims.Tot
val for_all: ('a -> Tot bool) -> list 'a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec for_all f l = match l with | [] -> true | hd::tl -> if f hd then for_all f tl else false
val for_all: ('a -> Tot bool) -> list 'a -> Tot bool let rec for_all f l =
false
null
false
match l with | [] -> true | hd :: tl -> if f hd then for_all f tl else false
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "FStar.List.Tot.Base.for_all" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val for_all: ('a -> Tot bool) -> list 'a -> Tot bool
[ "recursion" ]
FStar.List.Tot.Base.for_all
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> Prims.bool) -> l: Prims.list 'a -> Prims.bool
{ "end_col": 52, "end_line": 305, "start_col": 22, "start_line": 303 }
Prims.Tot
val splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec splitAt (#a:Type) (n:nat) (l:list a) : Tot (list a * list a) = if n = 0 then [], l else match l with | [] -> [], l | x :: xs -> let l1, l2 = splitAt (n-1) xs in x :: l1, l2
val splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a) let rec splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a) =
false
null
false
if n = 0 then [], l else match l with | [] -> [], l | x :: xs -> let l1, l2 = splitAt (n - 1) xs in x :: l1, l2
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.nat", "Prims.list", "Prims.op_Equality", "Prims.int", "FStar.Pervasives.Native.Mktuple2", "Prims.Nil", "Prims.bool", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.splitAt", "Prims.op_Subtraction" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a)
[ "recursion" ]
FStar.List.Tot.Base.splitAt
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> l: Prims.list a -> Prims.list a * Prims.list a
{ "end_col": 61, "end_line": 448, "start_col": 2, "start_line": 444 }
Prims.Tot
val assoc: #a:eqtype -> #b:Type -> a -> list (a * b) -> Tot (option b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec assoc #a #b x = function | [] -> None | (x', y)::tl -> if x=x' then Some y else assoc x tl
val assoc: #a:eqtype -> #b:Type -> a -> list (a * b) -> Tot (option b) let rec assoc #a #b x =
false
null
false
function | [] -> None | (x', y) :: tl -> if x = x' then Some y else assoc x tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.list", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.None", "Prims.op_Equality", "FStar.Pervasives.Native.Some", "Prims.bool", "FStar.List.Tot.Base.assoc", "FStar.Pervasives.Native.option" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val assoc: #a:eqtype -> #b:Type -> a -> list (a * b) -> Tot (option b)
[ "recursion" ]
FStar.List.Tot.Base.assoc
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: a -> _: Prims.list (a * b) -> FStar.Pervasives.Native.option b
{ "end_col": 54, "end_line": 411, "start_col": 24, "start_line": 409 }
Prims.Tot
val unsnoc: #a:Type -> l:list a{length l > 0} -> Tot (list a * a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let unsnoc #a l = let l1, l2 = splitAt (length l - 1) l in lemma_splitAt_snd_length (length l - 1) l; l1, hd l2
val unsnoc: #a:Type -> l:list a{length l > 0} -> Tot (list a * a) let unsnoc #a l =
false
null
false
let l1, l2 = splitAt (length l - 1) l in lemma_splitAt_snd_length (length l - 1) l; l1, hd l2
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.b2t", "Prims.op_GreaterThan", "FStar.List.Tot.Base.length", "FStar.Pervasives.Native.Mktuple2", "FStar.List.Tot.Base.hd", "Prims.unit", "FStar.List.Tot.Base.lemma_splitAt_snd_length", "Prims.op_Subtraction", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.splitAt" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val unsnoc: #a:Type -> l:list a{length l > 0} -> Tot (list a * a)
[]
FStar.List.Tot.Base.unsnoc
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a {FStar.List.Tot.Base.length l > 0} -> Prims.list a * a
{ "end_col": 11, "end_line": 465, "start_col": 17, "start_line": 462 }
Prims.Tot
val unzip3: list ('a * 'b * 'c) -> Tot (list 'a * list 'b * list 'c)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec unzip3 l = match l with | [] -> ([],[],[]) | (hd1,hd2,hd3)::tl -> let (tl1,tl2,tl3) = unzip3 tl in (hd1::tl1,hd2::tl2,hd3::tl3)
val unzip3: list ('a * 'b * 'c) -> Tot (list 'a * list 'b * list 'c) let rec unzip3 l =
false
null
false
match l with | [] -> ([], [], []) | (hd1, hd2, hd3) :: tl -> let tl1, tl2, tl3 = unzip3 tl in (hd1 :: tl1, hd2 :: tl2, hd3 :: tl3)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.Pervasives.Native.tuple3", "FStar.Pervasives.Native.Mktuple3", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.unzip3" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val unzip3: list ('a * 'b * 'c) -> Tot (list 'a * list 'b * list 'c)
[ "recursion" ]
FStar.List.Tot.Base.unzip3
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list (('a * 'b) * 'c) -> (Prims.list 'a * Prims.list 'b) * Prims.list 'c
{ "end_col": 35, "end_line": 436, "start_col": 19, "start_line": 432 }
Prims.Pure
val fold_left2 : f:('a -> 'b -> 'c -> Tot 'a) -> accu:'a -> l1:(list 'b) -> l2:(list 'c) -> Pure 'a (requires (length l1 == length l2)) (ensures (fun _ -> True)) (decreases l1)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec fold_left2 f accu l1 l2 = match (l1, l2) with | ([], []) -> accu | (a1::l1, a2::l2) -> fold_left2 f (f accu a1 a2) l1 l2
val fold_left2 : f:('a -> 'b -> 'c -> Tot 'a) -> accu:'a -> l1:(list 'b) -> l2:(list 'c) -> Pure 'a (requires (length l1 == length l2)) (ensures (fun _ -> True)) (decreases l1) let rec fold_left2 f accu l1 l2 =
false
null
false
match (l1, l2) with | [], [] -> accu | a1 :: l1, a2 :: l2 -> fold_left2 f (f accu a1 a2) l1 l2
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "" ]
[ "Prims.list", "FStar.Pervasives.Native.Mktuple2", "FStar.List.Tot.Base.fold_left2" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fold_left2 : f:('a -> 'b -> 'c -> Tot 'a) -> accu:'a -> l1:(list 'b) -> l2:(list 'c) -> Pure 'a (requires (length l1 == length l2)) (ensures (fun _ -> True)) (decreases l1)
[ "recursion" ]
FStar.List.Tot.Base.fold_left2
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> _: 'b -> _: 'c -> 'a) -> accu: 'a -> l1: Prims.list 'b -> l2: Prims.list 'c -> Prims.Pure 'a
{ "end_col": 57, "end_line": 221, "start_col": 2, "start_line": 219 }
Prims.Tot
val sortWith: ('a -> 'a -> Tot int) -> l:list 'a -> Tot (list 'a) (decreases (length l))
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec sortWith f = function | [] -> [] | pivot::tl -> let hi, lo = partition (bool_of_compare f pivot) tl in partition_length (bool_of_compare f pivot) tl; append (sortWith f lo) (pivot::sortWith f hi)
val sortWith: ('a -> 'a -> Tot int) -> l:list 'a -> Tot (list 'a) (decreases (length l)) let rec sortWith f =
false
null
false
function | [] -> [] | pivot :: tl -> let hi, lo = partition (bool_of_compare f pivot) tl in partition_length (bool_of_compare f pivot) tl; append (sortWith f lo) (pivot :: sortWith f hi)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total", "" ]
[ "Prims.int", "Prims.list", "Prims.Nil", "FStar.List.Tot.Base.append", "FStar.List.Tot.Base.sortWith", "Prims.Cons", "Prims.unit", "FStar.List.Tot.Base.partition_length", "FStar.List.Tot.Base.bool_of_compare", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.partition" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val sortWith: ('a -> 'a -> Tot int) -> l:list 'a -> Tot (list 'a) (decreases (length l))
[ "recursion" ]
FStar.List.Tot.Base.sortWith
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> _: 'a -> Prims.int) -> l: Prims.list 'a -> Prims.Tot (Prims.list 'a)
{ "end_col": 50, "end_line": 528, "start_col": 21, "start_line": 523 }
Prims.Tot
val split: list ('a * 'b) -> Tot (list 'a * list 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec split l = match l with | [] -> ([],[]) | (hd1,hd2)::tl -> let (tl1,tl2) = split tl in (hd1::tl1,hd2::tl2)
val split: list ('a * 'b) -> Tot (list 'a * list 'b) let rec split l =
false
null
false
match l with | [] -> ([], []) | (hd1, hd2) :: tl -> let tl1, tl2 = split tl in (hd1 :: tl1, hd2 :: tl2)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.Pervasives.Native.tuple2", "FStar.Pervasives.Native.Mktuple2", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.split" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val split: list ('a * 'b) -> Tot (list 'a * list 'b)
[ "recursion" ]
FStar.List.Tot.Base.split
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list ('a * 'b) -> Prims.list 'a * Prims.list 'b
{ "end_col": 26, "end_line": 421, "start_col": 18, "start_line": 417 }
Prims.Tot
val tryFind: ('a -> Tot bool) -> list 'a -> Tot (option 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec tryFind p l = match l with | [] -> None | hd::tl -> if p hd then Some hd else tryFind p tl
val tryFind: ('a -> Tot bool) -> list 'a -> Tot (option 'a) let rec tryFind p l =
false
null
false
match l with | [] -> None | hd :: tl -> if p hd then Some hd else tryFind p tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.Some", "FStar.List.Tot.Base.tryFind", "FStar.Pervasives.Native.option" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val tryFind: ('a -> Tot bool) -> list 'a -> Tot (option 'a)
[ "recursion" ]
FStar.List.Tot.Base.tryFind
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
p: (_: 'a -> Prims.bool) -> l: Prims.list 'a -> FStar.Pervasives.Native.option 'a
{ "end_col": 54, "end_line": 336, "start_col": 22, "start_line": 334 }
Prims.Tot
val tryPick: ('a -> Tot (option 'b)) -> list 'a -> Tot (option 'b)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec tryPick f l = match l with | [] -> None | hd::tl -> match f hd with | Some x -> Some x | None -> tryPick f tl
val tryPick: ('a -> Tot (option 'b)) -> list 'a -> Tot (option 'b) let rec tryPick f l =
false
null
false
match l with | [] -> None | hd :: tl -> match f hd with | Some x -> Some x | None -> tryPick f tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "FStar.Pervasives.Native.option", "Prims.list", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.Some", "FStar.List.Tot.Base.tryPick" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val tryPick: ('a -> Tot (option 'b)) -> list 'a -> Tot (option 'b)
[ "recursion" ]
FStar.List.Tot.Base.tryPick
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> FStar.Pervasives.Native.option 'b) -> l: Prims.list 'a -> FStar.Pervasives.Native.option 'b
{ "end_col": 31, "end_line": 348, "start_col": 22, "start_line": 343 }
FStar.Pervasives.Lemma
val lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a) : Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n))
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec lemma_splitAt_snd_length (#a:Type) (n:nat) (l:list a) : Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) = match n, l with | 0, _ -> () | _, [] -> () | _, _ :: l' -> lemma_splitAt_snd_length (n - 1) l'
val lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a) : Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) let rec lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a) : Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) =
false
null
true
match n, l with | 0, _ -> () | _, [] -> () | _, _ :: l' -> lemma_splitAt_snd_length (n - 1) l'
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "lemma" ]
[ "Prims.nat", "Prims.list", "FStar.Pervasives.Native.Mktuple2", "Prims.int", "FStar.List.Tot.Base.lemma_splitAt_snd_length", "Prims.op_Subtraction", "Prims.unit", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.List.Tot.Base.length", "Prims.squash", "Prims.op_Equality", "FStar.Pervasives.Nati...
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a) : Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n))
[ "recursion" ]
FStar.List.Tot.Base.lemma_splitAt_snd_length
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> l: Prims.list a -> FStar.Pervasives.Lemma (requires n <= FStar.List.Tot.Base.length l) (ensures FStar.List.Tot.Base.length (FStar.Pervasives.Native.snd (FStar.List.Tot.Base.splitAt n l)) = FStar.List.Tot.Base.length l - n)
{ "end_col": 53, "end_line": 457, "start_col": 2, "start_line": 454 }
Prims.Tot
val list_unref : #a:Type -> #p:(a -> Type0) -> list (x:a{p x}) -> Tot (list a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec list_unref #a #p l = match l with | [] -> [] | x::xs -> x :: list_unref xs
val list_unref : #a:Type -> #p:(a -> Type0) -> list (x:a{p x}) -> Tot (list a) let rec list_unref #a #p l =
false
null
false
match l with | [] -> [] | x :: xs -> x :: list_unref xs
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.list_unref" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val list_unref : #a:Type -> #p:(a -> Type0) -> list (x:a{p x}) -> Tot (list a)
[ "recursion" ]
FStar.List.Tot.Base.list_unref
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list (x: a{p x}) -> Prims.list a
{ "end_col": 33, "end_line": 547, "start_col": 4, "start_line": 545 }
Prims.Tot
val partition: f:('a -> Tot bool) -> list 'a -> Tot (list 'a * list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec partition f = function | [] -> [], [] | hd::tl -> let l1, l2 = partition f tl in if f hd then hd::l1, l2 else l1, hd::l2
val partition: f:('a -> Tot bool) -> list 'a -> Tot (list 'a * list 'a) let rec partition f =
false
null
false
function | [] -> [], [] | hd :: tl -> let l1, l2 = partition f tl in if f hd then hd :: l1, l2 else l1, hd :: l2
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "FStar.Pervasives.Native.Mktuple2", "Prims.Nil", "Prims.Cons", "FStar.Pervasives.Native.tuple2", "FStar.List.Tot.Base.partition" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val partition: f:('a -> Tot bool) -> list 'a -> Tot (list 'a * list 'a)
[ "recursion" ]
FStar.List.Tot.Base.partition
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> Prims.bool) -> _: Prims.list 'a -> Prims.list 'a * Prims.list 'a
{ "end_col": 20, "end_line": 373, "start_col": 22, "start_line": 367 }
FStar.Pervasives.Lemma
val for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a) : Lemma (for_all f l <==> (forall x. memP x l ==> f x))
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a) : Lemma (for_all f l <==> (forall x . memP x l ==> f x)) = match l with | [] -> () | _ :: q -> for_all_mem f q
val for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a) : Lemma (for_all f l <==> (forall x. memP x l ==> f x)) let rec for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a) : Lemma (for_all f l <==> (forall x. memP x l ==> f x)) =
false
null
true
match l with | [] -> () | _ :: q -> for_all_mem f q
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "lemma" ]
[ "Prims.bool", "Prims.list", "FStar.List.Tot.Base.for_all_mem", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.l_iff", "Prims.b2t", "FStar.List.Tot.Base.for_all", "Prims.l_Forall", "Prims.l_imp", "FStar.List.Tot.Base.memP", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a) : Lemma (for_all f l <==> (forall x. memP x l ==> f x))
[ "recursion" ]
FStar.List.Tot.Base.for_all_mem
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.bool) -> l: Prims.list a -> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.for_all f l <==> (forall (x: a). FStar.List.Tot.Base.memP x l ==> f x))
{ "end_col": 29, "end_line": 316, "start_col": 2, "start_line": 314 }
Prims.Tot
val fold_right: ('a -> 'b -> Tot 'b) -> list 'a -> 'b -> Tot 'b
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec fold_right f l x = match l with | [] -> x | hd::tl -> f hd (fold_right f tl x)
val fold_right: ('a -> 'b -> Tot 'b) -> list 'a -> 'b -> Tot 'b let rec fold_right f l x =
false
null
false
match l with | [] -> x | hd :: tl -> f hd (fold_right f tl x)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.List.Tot.Base.fold_right" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val fold_right: ('a -> 'b -> Tot 'b) -> list 'a -> 'b -> Tot 'b
[ "recursion" ]
FStar.List.Tot.Base.fold_right
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: 'a -> _: 'b -> 'b) -> l: Prims.list 'a -> x: 'b -> 'b
{ "end_col": 38, "end_line": 197, "start_col": 27, "start_line": 195 }
Prims.Tot
val rev_acc: list 'a -> list 'a -> Tot (list 'a)
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec rev_acc l acc = match l with | [] -> acc | hd::tl -> rev_acc tl (hd::acc)
val rev_acc: list 'a -> list 'a -> Tot (list 'a) let rec rev_acc l acc =
false
null
false
match l with | [] -> acc | hd :: tl -> rev_acc tl (hd :: acc)
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "FStar.List.Tot.Base.rev_acc", "Prims.Cons" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val rev_acc: list 'a -> list 'a -> Tot (list 'a)
[ "recursion" ]
FStar.List.Tot.Base.rev_acc
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list 'a -> acc: Prims.list 'a -> Prims.list 'a
{ "end_col": 36, "end_line": 110, "start_col": 24, "start_line": 108 }
Prims.Tot
val existsb: #a:Type -> f:(a -> Tot bool) -> list a -> Tot bool
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec existsb #a f l = match l with | [] -> false | hd::tl -> if f hd then true else existsb f tl
val existsb: #a:Type -> f:(a -> Tot bool) -> list a -> Tot bool let rec existsb #a f l =
false
null
false
match l with | [] -> false | hd :: tl -> if f hd then true else existsb f tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "FStar.List.Tot.Base.existsb" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val existsb: #a:Type -> f:(a -> Tot bool) -> list a -> Tot bool
[ "recursion" ]
FStar.List.Tot.Base.existsb
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.bool) -> l: Prims.list a -> Prims.bool
{ "end_col": 48, "end_line": 258, "start_col": 25, "start_line": 256 }
Prims.Tot
val memP (#a: Type) (x: a) (l: list a) : Tot Type0
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec memP (#a: Type) (x: a) (l: list a) : Tot Type0 = match l with | [] -> False | y :: q -> x == y \/ memP x q
val memP (#a: Type) (x: a) (l: list a) : Tot Type0 let rec memP (#a: Type) (x: a) (l: list a) : Tot Type0 =
false
null
false
match l with | [] -> False | y :: q -> x == y \/ memP x q
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.list", "Prims.l_False", "Prims.l_or", "Prims.eq2", "FStar.List.Tot.Base.memP" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val memP (#a: Type) (x: a) (l: list a) : Tot Type0
[ "recursion" ]
FStar.List.Tot.Base.memP
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: a -> l: Prims.list a -> Type0
{ "end_col": 32, "end_line": 231, "start_col": 2, "start_line": 229 }
Prims.Tot
val filter : #a: Type -> f:(a -> Tot bool) -> l: list a -> Tot (m:list a{forall x. memP x m ==> f x})
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec filter #a f = function | [] -> [] | hd::tl -> if f hd then hd::filter f tl else filter f tl
val filter : #a: Type -> f:(a -> Tot bool) -> l: list a -> Tot (m:list a{forall x. memP x m ==> f x}) let rec filter #a f =
false
null
false
function | [] -> [] | hd :: tl -> if f hd then hd :: filter f tl else filter f tl
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.bool", "Prims.list", "Prims.Nil", "Prims.Cons", "FStar.List.Tot.Base.filter", "Prims.l_Forall", "Prims.l_imp", "FStar.List.Tot.Base.memP", "Prims.b2t" ]
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val filter : #a: Type -> f:(a -> Tot bool) -> l: list a -> Tot (m:list a{forall x. memP x m ==> f x})
[ "recursion" ]
FStar.List.Tot.Base.filter
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
f: (_: a -> Prims.bool) -> l: Prims.list a -> m: Prims.list a {forall (x: a). FStar.List.Tot.Base.memP x m ==> f x}
{ "end_col": 59, "end_line": 279, "start_col": 22, "start_line": 277 }
Prims.Tot
val list_refb: #a:eqtype -> #p:(a -> Tot bool) -> l:list a { for_all p l } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) })
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec list_refb #a #p l = match l with | hd :: tl -> hd :: list_refb #a #p tl | [] -> []
val list_refb: #a:eqtype -> #p:(a -> Tot bool) -> l:list a { for_all p l } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) }) let rec list_refb #a #p l =
false
null
false
match l with | hd :: tl -> hd :: list_refb #a #p tl | [] -> []
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.bool", "Prims.list", "Prims.b2t", "FStar.List.Tot.Base.for_all", "Prims.Cons", "FStar.List.Tot.Base.list_refb", "Prims.Nil", "Prims.l_and", "Prims.op_Equality", "Prims.nat", "FStar.List.Tot.Base.length", "Prims.l_Forall", "Prims.op_LessThan", "FStar.List.Tot.Base.i...
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val list_refb: #a:eqtype -> #p:(a -> Tot bool) -> l:list a { for_all p l } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) })
[ "recursion" ]
FStar.List.Tot.Base.list_refb
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a {FStar.List.Tot.Base.for_all p l} -> l': Prims.list (x: a{p x}) { FStar.List.Tot.Base.length l = FStar.List.Tot.Base.length l' /\ (forall (i: Prims.nat{i < FStar.List.Tot.Base.length l /\ i < FStar.List.Tot.Base.length l'}). {:pattern FStar.List.Tot.Base.index...
{ "end_col": 12, "end_line": 557, "start_col": 2, "start_line": 555 }
Prims.Tot
val list_ref: #a:eqtype -> #p:(a -> Tot prop) -> l:list a { forall x. {:pattern mem x l} mem x l ==> p x } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) })
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_modul...
false
let rec list_ref #a #p l = match l with | hd :: tl -> assert (mem hd l); assert (p hd); assert (forall x. {:pattern mem x tl} mem x tl ==> mem x l); hd :: list_ref #a #p tl | [] -> []
val list_ref: #a:eqtype -> #p:(a -> Tot prop) -> l:list a { forall x. {:pattern mem x l} mem x l ==> p x } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) }) let rec list_ref #a #p l =
false
null
false
match l with | hd :: tl -> assert (mem hd l); assert (p hd); assert (forall x. {:pattern mem x tl} mem x tl ==> mem x l); hd :: list_ref #a #p tl | [] -> []
{ "checked_file": "FStar.List.Tot.Base.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "FStar.List.Tot.Base.fst" }
[ "total" ]
[ "Prims.eqtype", "Prims.prop", "Prims.list", "Prims.l_Forall", "Prims.l_imp", "Prims.b2t", "FStar.List.Tot.Base.mem", "Prims.Cons", "FStar.List.Tot.Base.list_ref", "Prims.unit", "Prims._assert", "Prims.Nil", "Prims.l_and", "Prims.op_Equality", "Prims.nat", "FStar.List.Tot.Base.length", ...
[]
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
false
false
FStar.List.Tot.Base.fst
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val list_ref: #a:eqtype -> #p:(a -> Tot prop) -> l:list a { forall x. {:pattern mem x l} mem x l ==> p x } -> Tot (l':list (x:a{ p x }) { length l = length l' /\ (forall i. {:pattern (index l i) } index l i = index l' i) })
[ "recursion" ]
FStar.List.Tot.Base.list_ref
{ "file_name": "ulib/FStar.List.Tot.Base.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
l: Prims.list a {forall (x: a). {:pattern FStar.List.Tot.Base.mem x l} FStar.List.Tot.Base.mem x l ==> p x} -> l': Prims.list (x: a{p x}) { FStar.List.Tot.Base.length l = FStar.List.Tot.Base.length l' /\ (forall (i: Prims.nat{i < FStar.List.Tot.Base.length l /\ i < FSt...
{ "end_col": 12, "end_line": 571, "start_col": 2, "start_line": 565 }