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_qcode_Check_avx_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx_xcr0_support ())) | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_qcode_Check_avx_xcr0_support (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Check_avx_xcr0_support ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 358 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/u... | val va_qcode_Check_avx_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx_xcr0_support ()))
let va_qcode_Check_avx_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx_xcr0_support ())) = | false | null | false | (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 358 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Vale.Lib.X64.Cpuid.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRcx) (v... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [
"total"
] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Decls.va_const_opr64",
"Vale.X64.InsBasic.va_code_Xgetbv_Avx",
"Vale... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_qcode_Check_avx_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx_xcr0_support ())) | [] | Vale.Lib.X64.Cpuid.va_qcode_Check_avx_xcr0_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit
(Vale.Lib.X64.Cpuid.va_code_Check_avx_xcr0_support ()) | {
"end_col": 24,
"end_line": 1151,
"start_col": 2,
"start_line": 1113
} |
Prims.Tot | val va_qcode_Check_adx_bmi2_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_adx_bmi2_support ())) | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_qcode_Check_adx_bmi2_support (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Check_adx_bmi2_support ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 98 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/ut... | val va_qcode_Check_adx_bmi2_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_adx_bmi2_support ()))
let va_qcode_Check_adx_bmi2_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_adx_bmi2_support ())) = | false | null | false | (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 98 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Vale.Lib.X64.Cpuid.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR9) (va_... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [
"total"
] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machin... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_qcode_Check_adx_bmi2_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_adx_bmi2_support ())) | [] | Vale.Lib.X64.Cpuid.va_qcode_Check_adx_bmi2_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit
(Vale.Lib.X64.Cpuid.va_code_Check_adx_bmi2_support ()) | {
"end_col": 27,
"end_line": 288,
"start_col": 2,
"start_line": 243
} |
Prims.Tot | val va_qcode_Check_avx512_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_xcr0_support ())) | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_qcode_Check_avx512_xcr0_support (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Check_avx512_xcr0_support ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 389 column 10 of file /home/gebner/everest/hacl-star/vale/code... | val va_qcode_Check_avx512_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_xcr0_support ()))
let va_qcode_Check_avx512_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_xcr0_support ())) = | false | null | false | (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 389 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Vale.Lib.X64.Cpuid.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rRcx) (v... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [
"total"
] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rRcx",
"Vale.X64.Decls.va_const_opr64",
"Vale.X64.InsBasic.va_code_Xgetbv_Avx512",
"V... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_qcode_Check_avx512_xcr0_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_xcr0_support ())) | [] | Vale.Lib.X64.Cpuid.va_qcode_Check_avx512_xcr0_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit
(Vale.Lib.X64.Cpuid.va_code_Check_avx512_xcr0_support ()) | {
"end_col": 34,
"end_line": 1278,
"start_col": 2,
"start_line": 1214
} |
Prims.Tot | val va_qcode_Check_sse_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_sse_support ())) | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_qcode_Check_sse_support (va_mods:va_mods_t) : (va_quickCode unit (va_code_Check_sse_support
())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 202 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Va... | val va_qcode_Check_sse_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_sse_support ()))
let va_qcode_Check_sse_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_sse_support ())) = | false | null | false | (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 202 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Vale.Lib.X64.Cpuid.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR9) (va... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [
"total"
] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machin... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_qcode_Check_sse_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_sse_support ())) | [] | Vale.Lib.X64.Cpuid.va_qcode_Check_sse_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Lib.X64.Cpuid.va_code_Check_sse_support ()) | {
"end_col": 36,
"end_line": 688,
"start_col": 2,
"start_line": 618
} |
Prims.Ghost | val va_wpProof_Check_adx_bmi2_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_adx_bmi2_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_adx_bmi2_support ())
([va_Mod_flags; va_Mo... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_wpProof_Check_adx_bmi2_support va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Check_adx_bmi2_support (va_code_Check_adx_bmi2_support ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_reg64 rR9 va_sM (va_update_reg64 rRdx
va_sM (va_update_reg64 rRcx va_sM (v... | val va_wpProof_Check_adx_bmi2_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_adx_bmi2_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_adx_bmi2_support ())
([va_Mod_flags; va_Mo... | false | null | false | let va_sM, va_f0 = va_lemma_Check_adx_bmi2_support (va_code_Check_adx_bmi2_support ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_reg64 rR9
va_sM
(va_update_reg64 rRdx
va_sM
(va_update_re... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"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_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Mach... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_adx_bmi2_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_adx_bmi2_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_adx_bmi2_support ())
([va_Mod_flags; va_Mo... | [] | Vale.Lib.X64.Cpuid.va_wpProof_Check_adx_bmi2_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 319,
"start_col": 50,
"start_line": 310
} |
Prims.Ghost | val va_wpProof_Check_avx_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_avx_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_avx_support ()) ([va_Mod_flags;
va_Mod_reg64 rR9; va... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_wpProof_Check_avx_support va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Check_avx_support (va_code_Check_avx_support ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_reg64 rR9 va_sM (va_update_reg64 rRdx
va_sM (va_update_reg64 rRcx va_sM (va_update_reg64 ... | val va_wpProof_Check_avx_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_avx_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_avx_support ()) ([va_Mod_flags;
va_Mod_reg64 rR9; va... | false | null | false | let va_sM, va_f0 = va_lemma_Check_avx_support (va_code_Check_avx_support ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_reg64 rR9
va_sM
(va_update_reg64 rRdx
va_sM
(va_update_reg64 rRcx
... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"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_flags",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Mach... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_avx_support : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Check_avx_support va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Check_avx_support ()) ([va_Mod_flags;
va_Mod_reg64 rR9; va... | [] | Vale.Lib.X64.Cpuid.va_wpProof_Check_avx_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 410,
"start_col": 45,
"start_line": 401
} |
Prims.Ghost | val va_lemma_Check_adx_bmi2_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_adx_bmi2_support ()) 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_get_reg64 rRax ... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_lemma_Check_adx_bmi2_support va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rR9; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx; va_Mod_reg64 rRax; va_Mod_ok] in
let va_qc = va_qcode_Check_adx_bmi2_support va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_cod... | val va_lemma_Check_adx_bmi2_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_adx_bmi2_support ()) 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_get_reg64 rRax ... | false | null | false | let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_reg64 rR9;
va_Mod_reg64 rRdx;
va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx;
va_Mod_reg64 rRax;
va_Mod_ok
]
in
let va_qc = va_qcode_Check_adx_bmi2_support va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Check_adx_bmi2_support ())... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_adx_bmi2_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_adx_bmi2_support ()) 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_get_reg64 rRax ... | [] | Vale.Lib.X64.Cpuid.va_lemma_Check_adx_bmi2_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 306,
"start_col": 49,
"start_line": 291
} |
Prims.Ghost | val va_lemma_Check_rdrand_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_rdrand_support ()) 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_get_reg64 rRax va_s... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_lemma_Check_rdrand_support va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rR9; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx; va_Mod_reg64 rRax; va_Mod_ok] in
let va_qc = va_qcode_Check_rdrand_support va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Ch... | val va_lemma_Check_rdrand_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_rdrand_support ()) 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_get_reg64 rRax va_s... | false | null | false | let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_reg64 rR9;
va_Mod_reg64 rRdx;
va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx;
va_Mod_reg64 rRax;
va_Mod_ok
]
in
let va_qc = va_qcode_Check_rdrand_support va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Check_rdrand_support ())
... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_rdrand_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_rdrand_support ()) 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_get_reg64 rRax va_s... | [] | Vale.Lib.X64.Cpuid.va_lemma_Check_rdrand_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 797,
"start_col": 47,
"start_line": 782
} |
Prims.Ghost | val va_lemma_Check_avx_xcr0_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_avx_xcr0_support ()) va_s0 /\ va_get_ok va_s0 /\
osxsave_enabled))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_lemma_Check_avx_xcr0_support va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRax;
va_Mod_ok] in
let va_qc = va_qcode_Check_avx_xcr0_support va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Check_avx_xcr0_support ()) va_qc va... | val va_lemma_Check_avx_xcr0_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_avx_xcr0_support ()) va_s0 /\ va_get_ok va_s0 /\
osxsave_enabled))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
... | false | null | false | let va_mods:va_mods_t =
[va_Mod_flags; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRax; va_Mod_ok]
in
let va_qc = va_qcode_Check_avx_xcr0_support va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Check_avx_xcr0_support ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_avx_xcr0_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_avx_xcr0_support ()) va_s0 /\ va_get_ok va_s0 /\
osxsave_enabled))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
... | [] | Vale.Lib.X64.Cpuid.va_lemma_Check_avx_xcr0_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 1167,
"start_col": 49,
"start_line": 1154
} |
Prims.Ghost | val va_lemma_Check_osxsave_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_osxsave_support ()) 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_get_reg64 rRax va... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_lemma_Check_osxsave_support va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_reg64 rR9; va_Mod_reg64 rRdx; va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx; va_Mod_reg64 rRax; va_Mod_ok] in
let va_qc = va_qcode_Check_osxsave_support va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_... | val va_lemma_Check_osxsave_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_osxsave_support ()) 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_get_reg64 rRax va... | false | null | false | let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_reg64 rR9;
va_Mod_reg64 rRdx;
va_Mod_reg64 rRcx;
va_Mod_reg64 rRbx;
va_Mod_reg64 rRax;
va_Mod_ok
]
in
let va_qc = va_qcode_Check_osxsave_support va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Check_osxsave_support ())
... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.v... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_Check_osxsave_support : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Check_osxsave_support ()) 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_get_reg64 rRax va... | [] | Vale.Lib.X64.Cpuid.va_lemma_Check_osxsave_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.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": 1073,
"start_col": 48,
"start_line": 1058
} |
Prims.Tot | val va_qcode_Check_avx512_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_support ())) | [
{
"abbrev": false,
"full_module": "Vale.Lib.Basic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev": false,
... | false | let va_qcode_Check_avx512_support (va_mods:va_mods_t) : (va_quickCode unit
(va_code_Check_avx512_support ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 273 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/... | val va_qcode_Check_avx512_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_support ()))
let va_qcode_Check_avx512_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_support ())) = | false | null | false | (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 273 column 10 of file /home/gebner/everest/hacl-star/vale/code/lib/util/x64/Vale.Lib.X64.Cpuid.vaf *****"
(va_quick_Mov64 (va_op_dst_opr64_reg64 rR9) (va... | {
"checked_file": "Vale.Lib.X64.Cpuid.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsBasic.fsti.checked",
"Vale.X64.Decls.f... | [
"total"
] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsBasic.va_code_Mov64",
"Vale.X64.Decls.va_op_dst_opr64_reg64",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Decls.va_op_opr64_reg64",
"Vale.X64.Machine_s.rRbx",
"Vale.X64.Machin... | [] | module Vale.Lib.X64.Cpuid
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.QuickCode
open Vale.X64.QuickCodes
open Vale.X64.CPU_Features_s
//let pow2_values (u:unit) : Lemma
// (pow2 29 == 0x20000000 /\... | false | false | Vale.Lib.X64.Cpuid.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"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_qcode_Check_avx512_support (va_mods: va_mods_t)
: (va_quickCode unit (va_code_Check_avx512_support ())) | [] | Vale.Lib.X64.Cpuid.va_qcode_Check_avx512_support | {
"file_name": "obj/Vale.Lib.X64.Cpuid.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | va_mods: Vale.X64.QuickCode.va_mods_t
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.Lib.X64.Cpuid.va_code_Check_avx512_support ()) | {
"end_col": 47,
"end_line": 962,
"start_col": 2,
"start_line": 862
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integ... | false | let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256 | let vale_alg_of_alg (a: alg{a = AES128_GCM \/ a = AES256_GCM}) = | false | null | false | match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256 | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"total"
] | [
"Spec.Agile.AEAD.alg",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Spec.Agile.AEAD.AES128_GCM",
"Spec.Agile.AEAD.AES256_GCM",
"Vale.AES.AES_common_s.AES_128",
"Vale.AES.AES_common_s.AES_256",
"Vale.AES.AES_common_s.algorithm"
] | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0" | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 vale_alg_of_alg : a: Spec.Agile.AEAD.alg{a = Spec.Agile.AEAD.AES128_GCM \/ a = Spec.Agile.AEAD.AES256_GCM}
-> Vale.AES.AES_common_s.algorithm | [] | Spec.Agile.AEAD.vale_alg_of_alg | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Spec.Agile.AEAD.alg{a = Spec.Agile.AEAD.AES128_GCM \/ a = Spec.Agile.AEAD.AES256_GCM}
-> Vale.AES.AES_common_s.algorithm | {
"end_col": 40,
"end_line": 12,
"start_col": 2,
"start_line": 10
} | |
Prims.Tot | val encrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> p:plain a -> encrypted p | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agile",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agi... | false | let encrypt #a kv iv ad plain =
match a with
| CHACHA20_POLY1305 ->
Spec.Chacha20Poly1305.aead_encrypt kv iv plain ad
| AES128_GCM | AES256_GCM ->
// This step needs friend'ing.
let kv_nat = Vale.Def.Words.Seq_s.seq_uint8_to_seq_nat8 kv in
// The specification of gcm_encrypt_LE takes care... | val encrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> p:plain a -> encrypted p
let encrypt #a kv iv ad plain = | false | null | false | match a with
| CHACHA20_POLY1305 -> Spec.Chacha20Poly1305.aead_encrypt kv iv plain ad
| AES128_GCM
| AES256_GCM ->
let kv_nat = Vale.Def.Words.Seq_s.seq_uint8_to_seq_nat8 kv in
let iv_nat = Vale.Def.Words.Seq_s.seq_uint8_to_seq_nat8 iv in
let ad_nat = Vale.Def.Words.Seq_s.seq_uint8_to_seq_nat8 ad in
let plain_n... | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"total"
] | [
"Spec.Agile.AEAD.supported_alg",
"Spec.Agile.AEAD.kv",
"Spec.Agile.AEAD.iv",
"Spec.Agile.AEAD.ad",
"Spec.Agile.AEAD.plain",
"Spec.Chacha20Poly1305.aead_encrypt",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"FStar.Seq.Base.append",
"FStar.UInt8.t",
"Prims.unit",
"Spec.Agile.AEAD.gcm_encrypt_... | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0"
let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256
// For gctr_encrypt_recursive and its patter... | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 encrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> p:plain a -> encrypted p | [] | Spec.Agile.AEAD.encrypt | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
kv: Spec.Agile.AEAD.kv a ->
iv: Spec.Agile.AEAD.iv a ->
ad: Spec.Agile.AEAD.ad a ->
p: Spec.Agile.AEAD.plain a
-> Spec.Agile.AEAD.encrypted p | {
"end_col": 27,
"end_line": 69,
"start_col": 2,
"start_line": 46
} |
Prims.Tot | val decrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> c:cipher a -> option (decrypted c) | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agile",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Agi... | false | let decrypt #a kv iv ad cipher =
let tag = S.slice cipher (S.length cipher - tag_length a) (S.length cipher) in
let cipher = S.slice cipher 0 (S.length cipher - tag_length a) in
match a with
| CHACHA20_POLY1305 ->
Spec.Chacha20Poly1305.aead_decrypt kv iv cipher tag ad
| AES128_GCM | AES256_GCM ->
... | val decrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> c:cipher a -> option (decrypted c)
let decrypt #a kv iv ad cipher = | false | null | false | let tag = S.slice cipher (S.length cipher - tag_length a) (S.length cipher) in
let cipher = S.slice cipher 0 (S.length cipher - tag_length a) in
match a with
| CHACHA20_POLY1305 -> Spec.Chacha20Poly1305.aead_decrypt kv iv cipher tag ad
| AES128_GCM
| AES256_GCM ->
let kv_nat = Vale.Def.Words.Seq_s.seq_uint8_to_seq_na... | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"total"
] | [
"Spec.Agile.AEAD.supported_alg",
"Spec.Agile.AEAD.kv",
"Spec.Agile.AEAD.iv",
"Spec.Agile.AEAD.ad",
"Spec.Agile.AEAD.cipher",
"Spec.Chacha20Poly1305.aead_decrypt",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Prims.bool",
"FStar.Pervasives.Native.Some",
"Spec.Agile.AEAD.decrypted",
"FStar.Pe... | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0"
let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256
// For gctr_encrypt_recursive and its patter... | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 decrypt: #(a: supported_alg) -> kv a -> iv a -> ad a -> c:cipher a -> option (decrypted c) | [] | Spec.Agile.AEAD.decrypt | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
kv: Spec.Agile.AEAD.kv a ->
iv: Spec.Agile.AEAD.iv a ->
ad: Spec.Agile.AEAD.ad a ->
c: Spec.Agile.AEAD.cipher a
-> FStar.Pervasives.Native.option (Spec.Agile.AEAD.decrypted c) | {
"end_col": 42,
"end_line": 105,
"start_col": 32,
"start_line": 87
} |
FStar.Pervasives.Lemma | val gcm_decrypt_cipher_length (alg key iv plain auth tag: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_decrypt_LE alg key iv plain auth tag ... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integ... | false | let gcm_decrypt_cipher_length alg key iv plain auth tag: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\
S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures (
let c, t = Vale.AES.GCM_s.gcm_decrypt_LE alg key iv plain auth tag in
S.length c = S.len... | val gcm_decrypt_cipher_length (alg key iv plain auth tag: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_decrypt_LE alg key iv plain auth tag ... | false | null | true | Vale.AES.GCM_s.gcm_decrypt_LE_reveal () | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.AES.GCM_s.gcm_decrypt_LE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_common_s.is_aes_key",
"Prims.b2t",
"FStar.Integers.op_Less",
"FStar.Integers.Signed",
"FStar.In... | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0"
let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256
// For gctr_encrypt_recursive and its patter... | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"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 gcm_decrypt_cipher_length (alg key iv plain auth tag: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_decrypt_LE alg key iv plain auth tag ... | [] | Spec.Agile.AEAD.gcm_decrypt_cipher_length | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
plain: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
tag: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> FStar.Pervasives... | {
"end_col": 41,
"end_line": 82,
"start_col": 2,
"start_line": 82
} |
FStar.Pervasives.Lemma | val gcm_encrypt_cipher_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integ... | false | let gcm_encrypt_cipher_length alg key iv plain auth: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\
S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures (
let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
S.length c = S.length plai... | val gcm_encrypt_cipher_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | false | null | true | Vale.AES.GCM_s.gcm_encrypt_LE_reveal () | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.AES.GCM_s.gcm_encrypt_LE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_common_s.is_aes_key",
"Prims.b2t",
"FStar.Integers.op_Less",
"FStar.Integers.Signed",
"FStar.In... | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0"
let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256
// For gctr_encrypt_recursive and its patter... | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"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 gcm_encrypt_cipher_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | [] | Spec.Agile.AEAD.gcm_encrypt_cipher_length | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
plain: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> FStar.Pervasives.Lemma
(requires
Vale.AES.AES_common_s.... | {
"end_col": 41,
"end_line": 38,
"start_col": 2,
"start_line": 38
} |
FStar.Pervasives.Lemma | val gcm_encrypt_tag_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Integ... | false | let gcm_encrypt_tag_length alg key iv plain auth: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\
S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures (
let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
S.length t = 16))
=
Vale.AE... | val gcm_encrypt_tag_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | false | null | true | Vale.AES.GCM_s.gcm_encrypt_LE_reveal () | {
"checked_file": "Spec.Agile.AEAD.fst.checked",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.AES.GCTR.fst.checked",
"Vale.AES.GCM_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"Spec.Chacha20Poly1305.fst.checked",
"prims.fst.checked",
... | [
"lemma"
] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"Vale.AES.GCM_s.gcm_encrypt_LE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_common_s.is_aes_key",
"Prims.b2t",
"FStar.Integers.op_Less",
"FStar.Integers.Signed",
"FStar.In... | [] | module Spec.Agile.AEAD
open FStar.Integers
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0"
let vale_alg_of_alg (a: alg { a = AES128_GCM \/ a = AES256_GCM }) =
match a with
| AES128_GCM -> Vale.AES.AES_s.AES_128
| AES256_GCM -> Vale.AES.AES_s.AES_256
// For gctr_encrypt_recursive and its patter... | false | false | Spec.Agile.AEAD.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 1,
"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 gcm_encrypt_tag_length (alg key iv plain auth: _)
: Lemma
(requires
Vale.AES.AES_s.is_aes_key alg key /\ S.length plain < Vale.Def.Words_s.pow2_32 /\
S.length auth < Vale.Def.Words_s.pow2_32)
(ensures
(let c, t = Vale.AES.GCM_s.gcm_encrypt_LE alg key iv plain auth in
... | [] | Spec.Agile.AEAD.gcm_encrypt_tag_length | {
"file_name": "specs/Spec.Agile.AEAD.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
plain: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> FStar.Pervasives.Lemma
(requires
Vale.AES.AES_common_s.... | {
"end_col": 41,
"end_line": 27,
"start_col": 2,
"start_line": 27
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let a_spec (#t:limb_t) (#len:SN.bn_len t) (n:BD.lbignum t len{0 < BD.bn_v n}) =
Lib.NatMod.nat_mod (BD.bn_v n) | let a_spec (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len {0 < BD.bn_v n}) = | false | null | false | Lib.NatMod.nat_mod (BD.bn_v n) | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Lib.NatMod.nat_mod"
] | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 a_spec : n: Hacl.Spec.Bignum.Definitions.lbignum t len {0 < Hacl.Spec.Bignum.Definitions.bn_v n} -> Type0 | [] | Hacl.Bignum.MontExponentiation.a_spec | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | n: Hacl.Spec.Bignum.Definitions.lbignum t len {0 < Hacl.Spec.Bignum.Definitions.bn_v n} -> Type0 | {
"end_col": 32,
"end_line": 34,
"start_col": 2,
"start_line": 34
} | |
Prims.Tot | val linv (#t: limb_t) (#len: SN.bn_len t) (n a: BD.lbignum t len) : Type0 | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let linv (#t:limb_t) (#len:SN.bn_len t) (n:BD.lbignum t len) (a:BD.lbignum t len) : Type0 =
BD.bn_v a < BD.bn_v n | val linv (#t: limb_t) (#len: SN.bn_len t) (n a: BD.lbignum t len) : Type0
let linv (#t: limb_t) (#len: SN.bn_len t) (n a: BD.lbignum t len) : Type0 = | false | null | false | BD.bn_v a < BD.bn_v n | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v"
] | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 linv (#t: limb_t) (#len: SN.bn_len t) (n a: BD.lbignum t len) : Type0 | [] | Hacl.Bignum.MontExponentiation.linv | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | n: Hacl.Spec.Bignum.Definitions.lbignum t len -> a: Hacl.Spec.Bignum.Definitions.lbignum t len
-> Type0 | {
"end_col": 23,
"end_line": 38,
"start_col": 2,
"start_line": 38
} |
Prims.Tot | val refl (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (a: BD.lbignum t len {linv n a})
: a_spec n | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let refl (#t:limb_t) (#len:SN.bn_len t) (n:BD.lbignum t len) (a:BD.lbignum t len{linv n a}) : a_spec n =
BD.bn_v a | val refl (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (a: BD.lbignum t len {linv n a})
: a_spec n
let refl (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (a: BD.lbignum t len {linv n a})
: a_spec n = | false | null | false | BD.bn_v a | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Bignum.MontExponentiation.linv",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Hacl.Bignum.MontExponentiation.a_spec"
] | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 refl (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (a: BD.lbignum t len {linv n a})
: a_spec n | [] | Hacl.Bignum.MontExponentiation.refl | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
a: Hacl.Spec.Bignum.Definitions.lbignum t len {Hacl.Bignum.MontExponentiation.linv n a}
-> Hacl.Bignum.MontExponentiation.a_spec n | {
"end_col": 11,
"end_line": 42,
"start_col": 2,
"start_line": 42
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_st (t:limb_t) (len:BN.meta_len t) =
n:lbignum t len
-> mu:limb t
-> r2:lbignum t len
-> aM:lbignum t len
-> bBits:size_t
-> b:lbignum t (blocks0 bBits (size (bits t)))
-> resM:lbignum t len ->
Stack unit
(requires fun h ->
live h n /\ live h aM /\ live h b /\ live h resM /\ live ... | let bn_exp_mont_st (t: limb_t) (len: BN.meta_len t) = | false | null | false |
n: lbignum t len ->
mu: limb t ->
r2: lbignum t len ->
aM: lbignum t len ->
bBits: size_t ->
b: lbignum t (blocks0 bBits (size (bits t))) ->
resM: lbignum t len
-> Stack unit
(requires
fun h ->
live h n /\ live h aM /\ live h b /\ live h resM /\ live h r2 /\ disjoi... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.blocks0",
"Lib.IntTypes.size",
"Lib.IntTypes.bits",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.B... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_st : t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_st | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | t: Hacl.Bignum.Definitions.limb_t -> len: Hacl.Bignum.meta_len t -> Type0 | {
"end_col": 56,
"end_line": 199,
"start_col": 4,
"start_line": 183
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_pre
(#t:limb_t)
(#len:SN.bn_len t)
(n:BD.lbignum t len)
(mu:limb t)
(r2:BD.lbignum t len)
(aM:BD.lbignum t len)
(bBits:size_nat)
(b:BD.lbignum t (BD.blocks0 bBits (bits t)))
=
SM.bn_mont_pre n mu /\
BD.bn_v r2 == pow2 (2 * bits t * len) % BD.bn_v n /\
BD.bn_v b < pow2 bBits /\
... | let bn_exp_mont_pre
(#t: limb_t)
(#len: SN.bn_len t)
(n: BD.lbignum t len)
(mu: limb t)
(r2 aM: BD.lbignum t len)
(bBits: size_nat)
(b: BD.lbignum t (BD.blocks0 bBits (bits t)))
= | false | null | false | SM.bn_mont_pre n mu /\ BD.bn_v r2 == pow2 ((2 * bits t) * len) % BD.bn_v n /\ BD.bn_v b < pow2 bBits /\
BD.bn_v aM < BD.bn_v n | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
"Lib.IntTypes.bits",
"Prims.l_and",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Prims.eq2",
"Prims... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_pre : n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
mu: Hacl.Bignum.Definitions.limb t ->
r2: Hacl.Spec.Bignum.Definitions.lbignum t len ->
aM: Hacl.Spec.Bignum.Definitions.lbignum t len ->
bBits: Lib.IntTypes.size_nat ->
b:
Hacl.Spec.Bignum.Definitions.lbignum t
(Ha... | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_pre | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
mu: Hacl.Bignum.Definitions.limb t ->
r2: Hacl.Spec.Bignum.Definitions.lbignum t len ->
aM: Hacl.Spec.Bignum.Definitions.lbignum t len ->
bBits: Lib.IntTypes.size_nat ->
b:
Hacl.Spec.Bignum.Definitions.lbignum t
(Hacl.Spec.Bignum.De... | {
"end_col": 25,
"end_line": 178,
"start_col": 3,
"start_line": 175
} | |
Prims.Tot | val bn_exp_mont_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_vartime #t k n mu r2 aM bBits b resM =
if bBits <. size S.bn_exp_mont_vartime_threshold then
bn_exp_mont_bm_vartime k n mu r2 aM bBits b resM
else
bn_exp_mont_fw_vartime k 4ul n mu r2 aM bBits b resM | val bn_exp_mont_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_vartime #t k n mu r2 aM bBits b resM = | false | null | false | if bBits <. size S.bn_exp_mont_vartime_threshold
then bn_exp_mont_bm_vartime k n mu r2 aM bBits b resM
else bn_exp_mont_fw_vartime k 4ul n mu r2 aM bBits b resM | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.blocks0",
"Lib.IntTypes.size",... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_vartime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Bignum.Montgomery.mont t
-> Hacl.Bignum.MontExponentiation.bn_exp_mont_st t (Mkbn?.len (Mkmont?.bn k)) | {
"end_col": 56,
"end_line": 290,
"start_col": 2,
"start_line": 287
} |
Prims.Tot | val bn_exp_mont_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_consttime #t k n mu r2 aM bBits b resM =
if bBits <. size S.bn_exp_mont_consttime_threshold then
bn_exp_mont_bm_consttime k n mu r2 aM bBits b resM
else
bn_exp_mont_fw_consttime k 4ul n mu r2 aM bBits b resM | val bn_exp_mont_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_consttime #t k n mu r2 aM bBits b resM = | false | null | false | if bBits <. size S.bn_exp_mont_consttime_threshold
then bn_exp_mont_bm_consttime k n mu r2 aM bBits b resM
else bn_exp_mont_fw_consttime k 4ul n mu r2 aM bBits b resM | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.blocks0",
"Lib.IntTypes.size",... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_consttime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Bignum.Montgomery.mont t
-> Hacl.Bignum.MontExponentiation.bn_exp_mont_st t (Mkbn?.len (Mkmont?.bn k)) | {
"end_col": 58,
"end_line": 300,
"start_col": 2,
"start_line": 297
} |
Prims.Tot | val mk_bn_mont_concrete_ops
(t: limb_t)
(k: BM.mont t)
(n: Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len)))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.concrete_ops t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len) | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let mk_bn_mont_concrete_ops
(t:limb_t)
(k:BM.mont t)
(n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len)))
(mu:limb t{SM.bn_mont_pre n mu}) :
BE.concrete_ops t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len) =
{
BE.to = mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu;
BE.lone = bn_mont_one k n mu;
BE... | val mk_bn_mont_concrete_ops
(t: limb_t)
(k: BM.mont t)
(n: Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len)))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.concrete_ops t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
let mk_bn_mont_concrete_ops
(t: limb_t)
(k: BM.mont t)
(n: Gho... | false | null | false | {
BE.to = mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu;
BE.lone = bn_mont_one k n mu;
BE.lmul = bn_mont_mul k n mu;
BE.lsqr = bn_mont_sqr k n mu
} | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"FStar.Ghost.erased",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definition... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 mk_bn_mont_concrete_ops
(t: limb_t)
(k: BM.mont t)
(n: Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len)))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.concrete_ops t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len) | [] | Hacl.Bignum.MontExponentiation.mk_bn_mont_concrete_ops | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
t: Hacl.Bignum.Definitions.limb_t ->
k: Hacl.Bignum.Montgomery.mont t ->
n:
FStar.Ghost.erased (Hacl.Spec.Bignum.Definitions.lbignum t
(Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)))) ->
mu:
Hacl.Bignum.Definitions.limb t
{Hacl.Spec.Bignum.Montgomery.bn_mont_pre (FStar.Ghost... | {
"end_col": 31,
"end_line": 130,
"start_col": 2,
"start_line": 127
} |
Prims.Tot | val mk_to_nat_mont_ll_comm_monoid
(t: limb_t)
(len: BN.meta_len t)
(n: BD.lbignum t (v len))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.to_comm_monoid t len (len +! len) | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let mk_to_nat_mont_ll_comm_monoid
(t:limb_t)
(len:BN.meta_len t)
(n:BD.lbignum t (v len))
(mu:limb t{SM.bn_mont_pre n mu})
: BE.to_comm_monoid t len (len +! len) =
{
BE.a_spec = a_spec n;
BE.comm_monoid = E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (BD.bn_v n) (v mu);
BE.linv_ctx = linv_ctx n;
BE.li... | val mk_to_nat_mont_ll_comm_monoid
(t: limb_t)
(len: BN.meta_len t)
(n: BD.lbignum t (v len))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.to_comm_monoid t len (len +! len)
let mk_to_nat_mont_ll_comm_monoid
(t: limb_t)
(len: BN.meta_len t)
(n: BD.lbignum t (v len))
(mu: lim... | false | null | false | {
BE.a_spec = a_spec n;
BE.comm_monoid = E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (BD.bn_v n) (v mu);
BE.linv_ctx = linv_ctx n;
BE.linv = linv n;
BE.refl = refl n
} | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Impl.Exponentiation.Definitions.Mkto_comm_monoid",
"Lib.IntTy... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 mk_to_nat_mont_ll_comm_monoid
(t: limb_t)
(len: BN.meta_len t)
(n: BD.lbignum t (v len))
(mu: limb t {SM.bn_mont_pre n mu})
: BE.to_comm_monoid t len (len +! len) | [] | Hacl.Bignum.MontExponentiation.mk_to_nat_mont_ll_comm_monoid | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
t: Hacl.Bignum.Definitions.limb_t ->
len: Hacl.Bignum.meta_len t ->
n: Hacl.Spec.Bignum.Definitions.lbignum t (Lib.IntTypes.v len) ->
mu: Hacl.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}
-> Hacl.Impl.Exponentiation.Definitions.to_comm_monoid t len (len +! len) | {
"end_col": 19,
"end_line": 64,
"start_col": 2,
"start_line": 60
} |
Prims.Tot | val linv_ctx (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (ctx: BD.lbignum t (len + len))
: Type0 | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let linv_ctx (#t:limb_t) (#len:SN.bn_len t) (n:BD.lbignum t len) (ctx:BD.lbignum t (len + len)) : Type0 =
let ctx_n = LSeq.sub ctx 0 len in
let ctx_r2 = LSeq.sub ctx len len in
ctx_n == n /\
0 < BD.bn_v n /\ BD.bn_v ctx_r2 = pow2 (2 * bits t * len) % BD.bn_v n | val linv_ctx (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (ctx: BD.lbignum t (len + len))
: Type0
let linv_ctx (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (ctx: BD.lbignum t (len + len))
: Type0 = | false | null | false | let ctx_n = LSeq.sub ctx 0 len in
let ctx_r2 = LSeq.sub ctx len len in
ctx_n == n /\ 0 < BD.bn_v n /\ BD.bn_v ctx_r2 = pow2 ((2 * bits t) * len) % BD.bn_v n | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.op_Addition",
"Prims.l_and",
"Prims.eq2",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Prims.op_Equal... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 linv_ctx (#t: limb_t) (#len: SN.bn_len t) (n: BD.lbignum t len) (ctx: BD.lbignum t (len + len))
: Type0 | [] | Hacl.Bignum.MontExponentiation.linv_ctx | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
ctx: Hacl.Spec.Bignum.Definitions.lbignum t (len + len)
-> Type0 | {
"end_col": 71,
"end_line": 49,
"start_col": 105,
"start_line": 45
} |
Prims.Tot | val bn_mont_sqr:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lsqr_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_mont_sqr #t k n mu ctx aM resM =
let h0 = ST.get () in
SM.bn_mont_sqr_lemma n mu (as_seq h0 aM);
SM.bn_mont_mul_lemma n mu (as_seq h0 aM) (as_seq h0 aM);
let ctx_n = sub ctx 0ul k.BM.bn.BN.len in
k.BM.sqr ctx_n mu aM resM | val bn_mont_sqr:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lsqr_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu)
let bn_mont_sqr #t k n mu ctx aM resM = | false | null | false | let h0 = ST.get () in
SM.bn_mont_sqr_lemma n mu (as_seq h0 aM);
SM.bn_mont_mul_lemma n mu (as_seq h0 aM) (as_seq h0 aM);
let ctx_n = sub ctx 0ul k.BM.bn.BN.len in
k.BM.sqr ctx_n mu aM resM | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"FStar.Ghost.erased",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definition... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_mont_sqr:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lsqr_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [] | Hacl.Bignum.MontExponentiation.bn_mont_sqr | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Hacl.Bignum.Montgomery.mont t ->
n:
FStar.Ghost.erased (Hacl.Spec.Bignum.Definitions.lbignum t
(Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)))) ->
mu:
Hacl.Bignum.Definitions.limb t
{Hacl.Spec.Bignum.Montgomery.bn_mont_pre (FStar.Ghost.reveal n) mu}
-> Hacl.Impl.Exponentiat... | {
"end_col": 27,
"end_line": 116,
"start_col": 39,
"start_line": 111
} |
Prims.Tot | val bn_mont_mul:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lmul_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_mont_mul #t k n mu ctx aM bM resM =
let h0 = ST.get () in
SM.bn_mont_mul_lemma n mu (as_seq h0 aM) (as_seq h0 bM);
let ctx_n = sub ctx 0ul k.BM.bn.BN.len in
k.BM.mul ctx_n mu aM bM resM | val bn_mont_mul:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lmul_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu)
let bn_mont_mul #t k n mu ctx aM bM resM = | false | null | false | let h0 = ST.get () in
SM.bn_mont_mul_lemma n mu (as_seq h0 aM) (as_seq h0 bM);
let ctx_n = sub ctx 0ul k.BM.bn.BN.len in
k.BM.mul ctx_n mu aM bM resM | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"FStar.Ghost.erased",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definition... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_mont_mul:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lmul_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [] | Hacl.Bignum.MontExponentiation.bn_mont_mul | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Hacl.Bignum.Montgomery.mont t ->
n:
FStar.Ghost.erased (Hacl.Spec.Bignum.Definitions.lbignum t
(Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)))) ->
mu:
Hacl.Bignum.Definitions.limb t
{Hacl.Spec.Bignum.Montgomery.bn_mont_pre (FStar.Ghost.reveal n) mu}
-> Hacl.Impl.Exponentiat... | {
"end_col": 30,
"end_line": 99,
"start_col": 42,
"start_line": 95
} |
Prims.Tot | val bn_mont_one:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lone_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_mont_one #t k n mu ctx oneM =
[@inline_let] let len = k.BM.bn.BN.len in
let ctx_n = sub ctx 0ul len in
let ctx_r2 = sub ctx len len in
let h0 = ST.get () in
SM.bn_mont_one_lemma n mu (as_seq h0 ctx_r2);
BM.bn_mont_one len k.BM.from ctx_n mu ctx_r2 oneM | val bn_mont_one:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lone_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu)
let bn_mont_one #t k n mu ctx oneM = | false | null | false | [@@ inline_let ]let len = k.BM.bn.BN.len in
let ctx_n = sub ctx 0ul len in
let ctx_r2 = sub ctx len len in
let h0 = ST.get () in
SM.bn_mont_one_lemma n mu (as_seq h0 ctx_r2);
BM.bn_mont_one len k.BM.from ctx_n mu ctx_r2 oneM | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"FStar.Ghost.erased",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definition... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_mont_one:
#t:limb_t
-> k:BM.mont t
-> n:Ghost.erased (BD.lbignum t (v k.BM.bn.BN.len))
-> mu:limb t{SM.bn_mont_pre n mu} ->
BE.lone_st t k.BM.bn.BN.len (k.BM.bn.BN.len +! k.BM.bn.BN.len)
(mk_to_nat_mont_ll_comm_monoid t k.BM.bn.BN.len n mu) | [] | Hacl.Bignum.MontExponentiation.bn_mont_one | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Hacl.Bignum.Montgomery.mont t ->
n:
FStar.Ghost.erased (Hacl.Spec.Bignum.Definitions.lbignum t
(Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)))) ->
mu:
Hacl.Bignum.Definitions.limb t
{Hacl.Spec.Bignum.Montgomery.bn_mont_pre (FStar.Ghost.reveal n) mu}
-> Hacl.Impl.Exponentiat... | {
"end_col": 51,
"end_line": 83,
"start_col": 2,
"start_line": 78
} |
FStar.HyperStack.ST.Stack | val mk_ctx:
#t:limb_t
-> len:BN.meta_len t
-> n:lbignum t len
-> r2:lbignum t len
-> ctx:lbignum t (len +! len) ->
Stack unit
(requires fun h ->
live h n /\ live h r2 /\ live h ctx /\
disjoint n ctx /\ disjoint r2 ctx /\
0 < bn_v h n /\ bn_v h r2 == pow2 (2 * bits t * v len) % bn_v h n)
(e... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let mk_ctx #t len n r2 ctx =
let h0 = ST.get () in
update_sub ctx 0ul len n;
let h1 = ST.get () in
assert (LSeq.sub (as_seq h1 ctx) 0 (v len) == as_seq h0 n);
update_sub ctx len len r2;
let h2 = ST.get () in
LSeq.eq_intro
(LSeq.sub (as_seq h2 ctx) 0 (v len))
(LSeq.sub (as_seq h1 ctx) 0 (v len));
... | val mk_ctx:
#t:limb_t
-> len:BN.meta_len t
-> n:lbignum t len
-> r2:lbignum t len
-> ctx:lbignum t (len +! len) ->
Stack unit
(requires fun h ->
live h n /\ live h r2 /\ live h ctx /\
disjoint n ctx /\ disjoint r2 ctx /\
0 < bn_v h n /\ bn_v h r2 == pow2 (2 * bits t * v len) % bn_v h n)
(e... | true | null | false | let h0 = ST.get () in
update_sub ctx 0ul len n;
let h1 = ST.get () in
assert (LSeq.sub (as_seq h1 ctx) 0 (v len) == as_seq h0 n);
update_sub ctx len len r2;
let h2 = ST.get () in
LSeq.eq_intro (LSeq.sub (as_seq h2 ctx) 0 (v len)) (LSeq.sub (as_seq h1 ctx) 0 (v len));
assert (LSeq.sub (as_seq h2 ctx) 0 (v len) == as_seq... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.meta_len",
"Hacl.Bignum.Definitions.lbignum",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims._assert",
"Prims.eq2",
"Lib.Sequence.lseq",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.v",
"Lib.Sequence.sub",
"Lib.Buff... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 mk_ctx:
#t:limb_t
-> len:BN.meta_len t
-> n:lbignum t len
-> r2:lbignum t len
-> ctx:lbignum t (len +! len) ->
Stack unit
(requires fun h ->
live h n /\ live h r2 /\ live h ctx /\
disjoint n ctx /\ disjoint r2 ctx /\
0 < bn_v h n /\ bn_v h r2 == pow2 (2 * bits t * v len) % bn_v h n)
(e... | [] | Hacl.Bignum.MontExponentiation.mk_ctx | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
len: Hacl.Bignum.meta_len t ->
n: Hacl.Bignum.Definitions.lbignum t len ->
r2: Hacl.Bignum.Definitions.lbignum t len ->
ctx: Hacl.Bignum.Definitions.lbignum t (len +! len)
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 67,
"end_line": 161,
"start_col": 28,
"start_line": 150
} |
Prims.Tot | val bn_exp_mont_fw_vartime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_fw_vartime #t k l n mu r2 aM bBits b resM =
push_frame ();
let h0 = ST.get () in
[@inline_let] let len = k.BM.bn.BN.len in
let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (uint... | val bn_exp_mont_fw_vartime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_fw_vartime #t k l n mu r2 aM bBits b resM = | false | null | false | push_frame ();
let h0 = ST.get () in
[@@ inline_let ]let len = k.BM.bn.BN.len in
let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (uint #t #SEC 0) in
mk_ctx #t len n r2 ctx;
BE.lexp_fw_vartime len (len +! ... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.bits",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.pow2",
"Hacl.Bignu... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_fw_vartime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_fw_vartime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Hacl.Bignum.Montgomery.mont t ->
l:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v l /\ Lib.IntTypes.v l < Lib.IntTypes.bits Lib.IntTypes.U32 /\
Prims.pow2 (Lib.IntTypes.v l) * Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)) <=
Lib.IntTypes.max_size_t }
-> Hacl.Bignum.MontExponentiat... | {
"end_col": 14,
"end_line": 256,
"start_col": 2,
"start_line": 246
} |
Prims.Tot | val bn_exp_mont_fw_consttime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_fw_consttime #t k l n mu r2 aM bBits b resM =
push_frame ();
let h0 = ST.get () in
[@inline_let] let len = k.BM.bn.BN.len in
let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (ui... | val bn_exp_mont_fw_consttime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_fw_consttime #t k l n mu r2 aM bBits b resM = | false | null | false | push_frame ();
let h0 = ST.get () in
[@@ inline_let ]let len = k.BM.bn.BN.len in
let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (uint #t #SEC 0) in
mk_ctx #t len n r2 ctx;
BE.lexp_fw_consttime len (len +... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.bits",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.pow2",
"Hacl.Bignu... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_fw_consttime:
#t:limb_t
-> k:BM.mont t
-> l:size_t{0 < v l /\ v l < bits U32 /\ pow2 (v l) * v k.BM.bn.BN.len <= max_size_t} ->
bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_fw_consttime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
k: Hacl.Bignum.Montgomery.mont t ->
l:
Lib.IntTypes.size_t
{ 0 < Lib.IntTypes.v l /\ Lib.IntTypes.v l < Lib.IntTypes.bits Lib.IntTypes.U32 /\
Prims.pow2 (Lib.IntTypes.v l) * Lib.IntTypes.v (Mkbn?.len (Mkmont?.bn k)) <=
Lib.IntTypes.max_size_t }
-> Hacl.Bignum.MontExponentiat... | {
"end_col": 14,
"end_line": 278,
"start_col": 2,
"start_line": 268
} |
Prims.Tot | val bn_exp_mont_bm_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_bm_vartime #t k n mu r2 aM bBits b resM =
push_frame ();
let h0 = ST.get () in
[@inline_let] let len = k.BM.bn.BN.len in
[@inline_let] let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +... | val bn_exp_mont_bm_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_bm_vartime #t k n mu r2 aM bBits b resM = | false | null | false | push_frame ();
let h0 = ST.get () in
[@@ inline_let ]let len = k.BM.bn.BN.len in
[@@ inline_let ]let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (uint #t #SEC 0) in
mk_ctx #t len n r2 ctx;
BE.lexp_rl_vart... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.blocks0",
"Lib.IntTypes.size",... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_bm_vartime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_bm_vartime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Bignum.Montgomery.mont t
-> Hacl.Bignum.MontExponentiation.bn_exp_mont_st t (Mkbn?.len (Mkmont?.bn k)) | {
"end_col": 14,
"end_line": 216,
"start_col": 2,
"start_line": 206
} |
Prims.Tot | val bn_exp_mont_bm_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.MontExponentiation",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Exponentiation.Lemmas",
"short_module": "E"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation",
"short_module": "BE"
},... | false | let bn_exp_mont_bm_consttime #t k n mu r2 aM bBits b resM =
push_frame ();
let h0 = ST.get () in
[@inline_let] let len = k.BM.bn.BN.len in
[@inline_let] let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len... | val bn_exp_mont_bm_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len
let bn_exp_mont_bm_consttime #t k n mu r2 aM bBits b resM = | false | null | false | push_frame ();
let h0 = ST.get () in
[@@ inline_let ]let len = k.BM.bn.BN.len in
[@@ inline_let ]let bLen = blocks0 bBits (size (bits t)) in
let k1 = Ghost.hide (E.mk_nat_mont_ll_comm_monoid (bits t) (v len) (bn_v h0 n) (v mu)) in
let ctx = create (len +! len) (uint #t #SEC 0) in
mk_ctx #t len n r2 ctx;
BE.lexp_mont_la... | {
"checked_file": "Hacl.Bignum.MontExponentiation.fst.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.Exponentiation.Lemmas.fst.c... | [
"total"
] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Montgomery.mont",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.__proj__Mkbn__item__len",
"Hacl.Bignum.Montgomery.__proj__Mkmont__item__bn",
"Hacl.Bignum.Definitions.limb",
"Lib.IntTypes.size_t",
"Hacl.Bignum.Definitions.blocks0",
"Lib.IntTypes.size",... | [] | module Hacl.Bignum.MontExponentiation
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 LSeq = Lib.Sequence
module BD = Hacl.Spec.Bignum.Definitions
module SN = Hacl.Spec.Bignum
module SM = Hacl.Spec.B... | false | false | Hacl.Bignum.MontExponentiation.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 bn_exp_mont_bm_consttime: #t:limb_t -> k:BM.mont t -> bn_exp_mont_st t k.BM.bn.BN.len | [] | Hacl.Bignum.MontExponentiation.bn_exp_mont_bm_consttime | {
"file_name": "code/bignum/Hacl.Bignum.MontExponentiation.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Bignum.Montgomery.mont t
-> Hacl.Bignum.MontExponentiation.bn_exp_mont_st t (Mkbn?.len (Mkmont?.bn k)) | {
"end_col": 14,
"end_line": 234,
"start_col": 2,
"start_line": 223
} |
FStar.Pervasives.Lemma | val mem_existsb: #a:eqtype -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ mem x xs)))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec mem_existsb #a f xs =
match xs with
| [] -> ()
| hd::tl -> mem_existsb f tl | val mem_existsb: #a:eqtype -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ mem x xs))))
let rec mem_existsb #a f xs = | false | null | true | match xs with
| [] -> ()
| hd :: tl -> mem_existsb f tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Properties.mem_existsb",
"Prims.unit"
] | [] | (*
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.Properties.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_existsb: #a:eqtype -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ mem x xs)))) | [
"recursion"
] | FStar.List.Tot.Properties.mem_existsb | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> Prims.bool) -> xs: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.existsb f xs <==>
(exists (x: a). f x = true /\ FStar.List.Tot.Base.mem x xs)) | {
"end_col": 30,
"end_line": 107,
"start_col": 2,
"start_line": 105
} |
FStar.Pervasives.Lemma | val rev_acc_length : l:list 'a -> acc:list 'a ->
Lemma (requires True)
(ensures (length (rev_acc l acc) = length l + length acc)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev_acc_length l acc = match l with
| [] -> ()
| hd::tl -> rev_acc_length tl (hd::acc) | val rev_acc_length : l:list 'a -> acc:list 'a ->
Lemma (requires True)
(ensures (length (rev_acc l acc) = length l + length acc))
let rec rev_acc_length l acc = | false | null | true | match l with
| [] -> ()
| hd :: tl -> rev_acc_length tl (hd :: acc) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev_acc_length",
"Prims.Cons",
"Prims.unit"
] | [] | (*
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.Properties.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_length : l:list 'a -> acc:list 'a ->
Lemma (requires True)
(ensures (length (rev_acc l acc) = length l + length acc)) | [
"recursion"
] | FStar.List.Tot.Properties.rev_acc_length | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a -> acc: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (FStar.List.Tot.Base.rev_acc l acc) =
FStar.List.Tot.Base.length l + FStar.List.Tot.Base.length acc) | {
"end_col": 43,
"end_line": 126,
"start_col": 31,
"start_line": 124
} |
FStar.Pervasives.Lemma | val rev_mem : #a:eqtype -> l:list a -> x:a ->
Lemma (requires True)
(ensures (mem x (rev l) <==> mem x l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_mem l x = rev_memP l x | val rev_mem : #a:eqtype -> l:list a -> x:a ->
Lemma (requires True)
(ensures (mem x (rev l) <==> mem x l))
let rev_mem l x = | false | null | true | rev_memP l x | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.rev_memP",
"Prims.unit"
] | [] | (*
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.Properties.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_mem : #a:eqtype -> l:list a -> x:a ->
Lemma (requires True)
(ensures (mem x (rev l) <==> mem x l)) | [] | FStar.List.Tot.Properties.rev_mem | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.mem x (FStar.List.Tot.Base.rev l) <==> FStar.List.Tot.Base.mem x l) | {
"end_col": 30,
"end_line": 149,
"start_col": 18,
"start_line": 149
} |
FStar.Pervasives.Lemma | val append_inv_head: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l@l1) == (l@l2)))
(ensures (l1 == l2)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_inv_head l l1 l2 = match l with
| [] -> ()
| hd::tl -> append_inv_head tl l1 l2 | val append_inv_head: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l@l1) == (l@l2)))
(ensures (l1 == l2))
let rec append_inv_head l l1 l2 = | false | null | true | match l with
| [] -> ()
| hd :: tl -> append_inv_head tl l1 l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_inv_head",
"Prims.unit"
] | [] | (*
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.Properties.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_inv_head: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l@l1) == (l@l2)))
(ensures (l1 == l2)) | [
"recursion"
] | FStar.List.Tot.Properties.append_inv_head | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a -> l1: Prims.list 'a -> l2: Prims.list 'a
-> FStar.Pervasives.Lemma (requires l @ l1 == l @ l2) (ensures l1 == l2) | {
"end_col": 40,
"end_line": 242,
"start_col": 34,
"start_line": 240
} |
FStar.Pervasives.Lemma | val memP_existsb: #a: Type -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ memP x xs)))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec memP_existsb #a f xs =
match xs with
| [] -> ()
| hd::tl -> memP_existsb f tl | val memP_existsb: #a: Type -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ memP x xs))))
let rec memP_existsb #a f xs = | false | null | true | match xs with
| [] -> ()
| hd :: tl -> memP_existsb f tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Properties.memP_existsb",
"Prims.unit"
] | [] | (*
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.Properties.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_existsb: #a: Type -> f:(a -> Tot bool) -> xs:list a ->
Lemma(ensures (existsb f xs <==> (exists (x:a). (f x = true /\ memP x xs)))) | [
"recursion"
] | FStar.List.Tot.Properties.memP_existsb | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> Prims.bool) -> xs: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.existsb f xs <==>
(exists (x: a). f x = true /\ FStar.List.Tot.Base.memP x xs)) | {
"end_col": 31,
"end_line": 66,
"start_col": 2,
"start_line": 64
} |
FStar.Pervasives.Lemma | val append_mem: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (mem a (l1@l2) = (mem a l1 || mem a l2))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_mem #t l1 l2 a = match l1 with
| [] -> ()
| hd::tl -> append_mem tl l2 a | val append_mem: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (mem a (l1@l2) = (mem a l1 || mem a l2)))
let rec append_mem #t l1 l2 a = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_mem tl l2 a | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.append_mem",
"Prims.unit"
] | [] | (*
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.Properties.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_mem: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (mem a (l1@l2) = (mem a l1 || mem a l2))) | [
"recursion"
] | FStar.List.Tot.Properties.append_mem | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list t -> l2: Prims.list t -> a: t
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.mem a (l1 @ l2) =
(FStar.List.Tot.Base.mem a l1 || FStar.List.Tot.Base.mem a l2)) | {
"end_col": 32,
"end_line": 199,
"start_col": 32,
"start_line": 197
} |
FStar.Pervasives.Lemma | val append_assoc: l1:list 'a -> l2:list 'a -> l3:list 'a ->
Lemma (requires True)
(ensures ((l1@(l2@l3)) == ((l1@l2)@l3))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_assoc l1 l2 l3 = match l1 with
| [] -> ()
| hd::tl -> append_assoc tl l2 l3 | val append_assoc: l1:list 'a -> l2:list 'a -> l3:list 'a ->
Lemma (requires True)
(ensures ((l1@(l2@l3)) == ((l1@l2)@l3)))
let rec append_assoc l1 l2 l3 = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_assoc tl l2 l3 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_assoc",
"Prims.unit"
] | [] | (*
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.Properties.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_assoc: l1:list 'a -> l2:list 'a -> l3:list 'a ->
Lemma (requires True)
(ensures ((l1@(l2@l3)) == ((l1@l2)@l3))) | [
"recursion"
] | FStar.List.Tot.Properties.append_assoc | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list 'a -> l2: Prims.list 'a -> l3: Prims.list 'a
-> FStar.Pervasives.Lemma (ensures l1 @ l2 @ l3 == (l1 @ l2) @ l3) | {
"end_col": 37,
"end_line": 182,
"start_col": 32,
"start_line": 180
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let llist a (n:nat) = l:list a {length l = n} | let llist a (n: nat) = | false | null | false | l: list a {length l = n} | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"total"
] | [
"Prims.nat",
"Prims.list",
"Prims.b2t",
"Prims.op_Equality",
"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 | true | FStar.List.Tot.Properties.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 llist : a: Type -> n: Prims.nat -> Type | [] | FStar.List.Tot.Properties.llist | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | a: Type -> n: Prims.nat -> Type | {
"end_col": 45,
"end_line": 26,
"start_col": 22,
"start_line": 26
} | |
FStar.Pervasives.Lemma | val rev_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev (l1@l2)) == ((rev l2)@(rev l1)))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_append l1 l2 = rev_rev' l1; rev_rev' l2; rev_rev' (l1@l2); rev'_append l1 l2 | val rev_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev (l1@l2)) == ((rev l2)@(rev l1))))
let rev_append l1 l2 = | false | null | true | rev_rev' l1;
rev_rev' l2;
rev_rev' (l1 @ l2);
rev'_append l1 l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev'_append",
"Prims.unit",
"FStar.List.Tot.Properties.rev_rev'",
"FStar.List.Tot.Base.op_At"
] | [] | (*
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.Properties.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_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev (l1@l2)) == ((rev l2)@(rev l1)))) | [] | FStar.List.Tot.Properties.rev_append | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list 'a -> l2: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.rev (l1 @ l2) == FStar.List.Tot.Base.rev l2 @ FStar.List.Tot.Base.rev l1) | {
"end_col": 84,
"end_line": 343,
"start_col": 23,
"start_line": 343
} |
FStar.Pervasives.Lemma | val mem_memP (#a: eqtype) (x: a) (l: list a)
: Lemma (ensures (mem x l <==> memP x l)) [SMTPat (mem x l); SMTPat (memP x l)] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec mem_memP
(#a: eqtype)
(x: a)
(l: list a)
: Lemma (ensures (mem x l <==> memP x l))
[SMTPat (mem x l); SMTPat (memP x l)]
= match l with
| [] -> ()
| a :: q -> mem_memP x q | val mem_memP (#a: eqtype) (x: a) (l: list a)
: Lemma (ensures (mem x l <==> memP x l)) [SMTPat (mem x l); SMTPat (memP x l)]
let rec mem_memP (#a: eqtype) (x: a) (l: list a)
: Lemma (ensures (mem x l <==> memP x l)) [SMTPat (mem x l); SMTPat (memP x l)] = | false | null | true | match l with
| [] -> ()
| a :: q -> mem_memP x q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.mem_memP",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.memP",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.bool",
"Prims.... | [] | (*
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.Properties.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_memP (#a: eqtype) (x: a) (l: list a)
: Lemma (ensures (mem x l <==> memP x l)) [SMTPat (mem x l); SMTPat (memP x l)] | [
"recursion"
] | FStar.List.Tot.Properties.mem_memP | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.mem x l <==> FStar.List.Tot.Base.memP x l)
[SMTPat (FStar.List.Tot.Base.mem x l); SMTPat (FStar.List.Tot.Base.memP x l)] | {
"end_col": 26,
"end_line": 42,
"start_col": 2,
"start_line": 40
} |
FStar.Pervasives.Lemma | val lemma_index_memP (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (ensures ((index l i) `memP` l)) [SMTPat ((index l i) `memP` l)] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec lemma_index_memP (#t:Type) (l:list t) (i:nat{i < length l}) :
Lemma
(ensures (index l i `memP` l))
[SMTPat (index l i `memP` l)] =
match i with
| 0 -> ()
| _ -> lemma_index_memP (tl l) (i - 1) | val lemma_index_memP (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (ensures ((index l i) `memP` l)) [SMTPat ((index l i) `memP` l)]
let rec lemma_index_memP (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (ensures ((index l i) `memP` l)) [SMTPat ((index l i) `memP` l)] = | false | null | true | match i with
| 0 -> ()
| _ -> lemma_index_memP (tl l) (i - 1) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.int",
"FStar.List.Tot.Properties.lemma_index_memP",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.... | [] | (*
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.Properties.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_index_memP (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (ensures ((index l i) `memP` l)) [SMTPat ((index l i) `memP` l)] | [
"recursion"
] | FStar.List.Tot.Properties.lemma_index_memP | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list t -> i: Prims.nat{i < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.memP (FStar.List.Tot.Base.index l i) l)
[SMTPat (FStar.List.Tot.Base.memP (FStar.List.Tot.Base.index l i) l)] | {
"end_col": 40,
"end_line": 51,
"start_col": 2,
"start_line": 49
} |
FStar.Pervasives.Lemma | val lemma_snoc_length : (lx:(list 'a * 'a)) ->
Lemma (requires True)
(ensures (length (snoc lx) = length (fst lx) + 1)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let lemma_snoc_length (l, x) = append_length l [x] | val lemma_snoc_length : (lx:(list 'a * 'a)) ->
Lemma (requires True)
(ensures (length (snoc lx) = length (fst lx) + 1))
let lemma_snoc_length (l, x) = | false | null | true | append_length l [x] | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"FStar.List.Tot.Properties.append_length",
"Prims.Cons",
"Prims.Nil",
"Prims.unit"
] | [] | (*
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.Properties.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_snoc_length : (lx:(list 'a * 'a)) ->
Lemma (requires True)
(ensures (length (snoc lx) = length (fst lx) + 1)) | [] | FStar.List.Tot.Properties.lemma_snoc_length | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | lx: (Prims.list 'a * 'a)
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (FStar.List.Tot.Base.snoc lx) =
FStar.List.Tot.Base.length (FStar.Pervasives.Native.fst lx) + 1) | {
"end_col": 50,
"end_line": 362,
"start_col": 31,
"start_line": 362
} |
FStar.Pervasives.Lemma | val append_length_inv_tail (#a: Type) (left1 right1 left2 right2: list a)
: Lemma
(requires (append left1 right1 == append left2 right2 /\ length right1 == length right2))
(ensures (left1 == left2 /\ right1 == right2)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let append_length_inv_tail
(#a: Type)
(left1 right1 left2 right2: list a)
: Lemma
(requires (append left1 right1 == append left2 right2 /\ length right1 == length right2))
(ensures (left1 == left2 /\ right1 == right2))
= append_length left1 right1;
append_length left2 right2;
append_length_inv_head left1 ri... | val append_length_inv_tail (#a: Type) (left1 right1 left2 right2: list a)
: Lemma
(requires (append left1 right1 == append left2 right2 /\ length right1 == length right2))
(ensures (left1 == left2 /\ right1 == right2))
let append_length_inv_tail (#a: Type) (left1 right1 left2 right2: list a)
: Lemma... | false | null | true | append_length left1 right1;
append_length left2 right2;
append_length_inv_head left1 right1 left2 right2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_length_inv_head",
"Prims.unit",
"FStar.List.Tot.Properties.append_length",
"Prims.l_and",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"Prims.nat",
"FStar.List.Tot.Base.length",
"Prims.squash",
"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.Properties.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_length_inv_tail (#a: Type) (left1 right1 left2 right2: list a)
: Lemma
(requires (append left1 right1 == append left2 right2 /\ length right1 == length right2))
(ensures (left1 == left2 /\ right1 == right2)) | [] | FStar.List.Tot.Properties.append_length_inv_tail | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | left1: Prims.list a -> right1: Prims.list a -> left2: Prims.list a -> right2: Prims.list a
-> FStar.Pervasives.Lemma
(requires
left1 @ right1 == left2 @ right2 /\
FStar.List.Tot.Base.length right1 == FStar.List.Tot.Base.length right2)
(ensures left1 == left2 /\ right1 == right2) | {
"end_col": 50,
"end_line": 283,
"start_col": 2,
"start_line": 281
} |
FStar.Pervasives.Lemma | val memP_map_elim (#a #b: Type) (f: (a -> Tot b)) (y: b) (l: list a)
: Lemma (requires True)
(ensures (memP y (map f l) ==> (exists (x: a). memP x l /\ f x == y)))
(decreases l) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec memP_map_elim
(#a #b: Type)
(f: a -> Tot b)
(y: b)
(l: list a)
: Lemma
(requires True)
(ensures (memP y (map f l) ==> (exists (x : a) . memP x l /\ f x == y)))
(decreases l)
= match l with
| [] -> ()
| _ :: q -> memP_map_elim f y q | val memP_map_elim (#a #b: Type) (f: (a -> Tot b)) (y: b) (l: list a)
: Lemma (requires True)
(ensures (memP y (map f l) ==> (exists (x: a). memP x l /\ f x == y)))
(decreases l)
let rec memP_map_elim (#a #b: Type) (f: (a -> Tot b)) (y: b) (l: list a)
: Lemma (requires True)
(ensures (memP y (m... | false | null | true | match l with
| [] -> ()
| _ :: q -> memP_map_elim f y q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.memP_map_elim",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.map",
"Prims.l_Exists",
"Prims.l_and",
"Prims.eq2",
"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.Properties.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_map_elim (#a #b: Type) (f: (a -> Tot b)) (y: b) (l: list a)
: Lemma (requires True)
(ensures (memP y (map f l) ==> (exists (x: a). memP x l /\ f x == y)))
(decreases l) | [
"recursion"
] | FStar.List.Tot.Properties.memP_map_elim | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> b) -> y: b -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP y (FStar.List.Tot.Base.map f l) ==>
(exists (x: a). FStar.List.Tot.Base.memP x l /\ f x == y)) (decreases l) | {
"end_col": 33,
"end_line": 92,
"start_col": 2,
"start_line": 90
} |
FStar.Pervasives.Lemma | val append_count: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (count a (l1@l2) = (count a l1 + count a l2))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_count #t l1 l2 a = match l1 with
| [] -> ()
| hd::tl -> append_count tl l2 a | val append_count: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (count a (l1@l2) = (count a l1 + count a l2)))
let rec append_count #t l1 l2 a = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_count tl l2 a | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.append_count",
"Prims.unit"
] | [] | (*
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.Properties.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_count: #t:eqtype -> l1:list t
-> l2:list t
-> a:t
-> Lemma (requires True)
(ensures (count a (l1@l2) = (count a l1 + count a l2))) | [
"recursion"
] | FStar.List.Tot.Properties.append_count | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list t -> l2: Prims.list t -> a: t
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.count a (l1 @ l2) =
FStar.List.Tot.Base.count a l1 + FStar.List.Tot.Base.count a l2) | {
"end_col": 34,
"end_line": 216,
"start_col": 34,
"start_line": 214
} |
FStar.Pervasives.Lemma | val rev_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p hd ==> p (hd@[tl]))))
(ensures (p l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_ind p l = rev'_involutive l; rev'_list_ind p (rev' l) | val rev_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p hd ==> p (hd@[tl]))))
(ensures (p l))
let rev_ind p l = | false | null | true | rev'_involutive l;
rev'_list_ind p (rev' l) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.bool",
"FStar.List.Tot.Properties.rev'_list_ind",
"FStar.List.Tot.Properties.rev'",
"Prims.unit",
"FStar.List.Tot.Properties.rev'_involutive"
] | [] | (*
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.Properties.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_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p hd ==> p (hd@[tl]))))
(ensures (p l)) | [] | FStar.List.Tot.Properties.rev_ind | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: (_: Prims.list 'a -> Prims.bool) -> l: Prims.list 'a
-> FStar.Pervasives.Lemma
(requires p [] /\ (forall (hd: Prims.list 'a) (tl: 'a). p hd ==> p (hd @ [tl]))) (ensures p l) | {
"end_col": 61,
"end_line": 376,
"start_col": 18,
"start_line": 376
} |
FStar.Pervasives.Lemma | val append_length_inv_head (#a: Type) (left1 right1 left2 right2: list a)
: Lemma (requires (append left1 right1 == append left2 right2 /\ length left1 == length left2))
(ensures (left1 == left2 /\ right1 == right2))
(decreases left1) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_length_inv_head
(#a: Type)
(left1 right1 left2 right2: list a)
: Lemma
(requires (append left1 right1 == append left2 right2 /\ length left1 == length left2))
(ensures (left1 == left2 /\ right1 == right2))
(decreases left1)
= match left1 with
| [] -> ()
| _ :: left1' ->
append_length_in... | val append_length_inv_head (#a: Type) (left1 right1 left2 right2: list a)
: Lemma (requires (append left1 right1 == append left2 right2 /\ length left1 == length left2))
(ensures (left1 == left2 /\ right1 == right2))
(decreases left1)
let rec append_length_inv_head (#a: Type) (left1 right1 left2 right2:... | false | null | true | match left1 with
| [] -> ()
| _ :: left1' -> append_length_inv_head left1' right1 (tl left2) right2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_length_inv_head",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"Prims.nat",
"FStar.List.Tot.Base.length",
"Prims.squash",
"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.Properties.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_length_inv_head (#a: Type) (left1 right1 left2 right2: list a)
: Lemma (requires (append left1 right1 == append left2 right2 /\ length left1 == length left2))
(ensures (left1 == left2 /\ right1 == right2))
(decreases left1) | [
"recursion"
] | FStar.List.Tot.Properties.append_length_inv_head | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | left1: Prims.list a -> right1: Prims.list a -> left2: Prims.list a -> right2: Prims.list a
-> FStar.Pervasives.Lemma
(requires
left1 @ right1 == left2 @ right2 /\
FStar.List.Tot.Base.length left1 == FStar.List.Tot.Base.length left2)
(ensures left1 == left2 /\ right1 == right2)
(decre... | {
"end_col": 58,
"end_line": 273,
"start_col": 2,
"start_line": 270
} |
Prims.GTot | val index_of (#t: Type) (l: list t) (x: t{x `memP` l})
: GTot (i: nat{i < length l /\ index l i == x}) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec index_of (#t:Type) (l:list t) (x:t{x `memP` l}) :
GTot (i:nat{i < length l /\ index l i == x}) =
match l with
| [_] -> 0
| a :: rest ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (a == x) then (
0
) else (
1 + index_of rest x
) | val index_of (#t: Type) (l: list t) (x: t{x `memP` l})
: GTot (i: nat{i < length l /\ index l i == x})
let rec index_of (#t: Type) (l: list t) (x: t{x `memP` l})
: GTot (i: nat{i < length l /\ index l i == x}) = | false | null | false | match l with
| [_] -> 0
| a :: rest ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (a == x) then (0) else (1 + index_of rest x) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"sometrivial"
] | [
"Prims.list",
"FStar.List.Tot.Base.memP",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"Prims.op_Addition",
"FStar.List.Tot.Properties.index_of",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Bas... | [] | (*
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.Properties.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_of (#t: Type) (l: list t) (x: t{x `memP` l})
: GTot (i: nat{i < length l /\ index l i == x}) | [
"recursion"
] | FStar.List.Tot.Properties.index_of | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list t -> x: t{FStar.List.Tot.Base.memP x l}
-> Prims.GTot
(i: Prims.nat{i < FStar.List.Tot.Base.length l /\ FStar.List.Tot.Base.index l i == x}) | {
"end_col": 5,
"end_line": 516,
"start_col": 2,
"start_line": 509
} |
FStar.Pervasives.Lemma | val rev_memP : #a:Type -> l:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev l) <==> memP x l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_memP #a l x = rev_acc_memP l [] x | val rev_memP : #a:Type -> l:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev l) <==> memP x l))
let rev_memP #a l x = | false | null | true | rev_acc_memP l [] x | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev_acc_memP",
"Prims.Nil",
"Prims.unit"
] | [] | (*
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.Properties.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_memP : #a:Type -> l:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev l) <==> memP x l)) | [] | FStar.List.Tot.Properties.rev_memP | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x (FStar.List.Tot.Base.rev l) <==> FStar.List.Tot.Base.memP x l) | {
"end_col": 41,
"end_line": 144,
"start_col": 22,
"start_line": 144
} |
FStar.Pervasives.Lemma | val append_length: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures (length (l1@l2) = length l1 + length l2)) [SMTPat (length (l1 @ l2))] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_length l1 l2 = match l1 with
| [] -> ()
| hd::tl -> append_length tl l2 | val append_length: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures (length (l1@l2) = length l1 + length l2)) [SMTPat (length (l1 @ l2))]
let rec append_length l1 l2 = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_length tl l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_length",
"Prims.unit"
] | [] | (*
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.Properties.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_length: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures (length (l1@l2) = length l1 + length l2)) [SMTPat (length (l1 @ l2))] | [
"recursion"
] | FStar.List.Tot.Properties.append_length | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list 'a -> l2: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (l1 @ l2) =
FStar.List.Tot.Base.length l1 + FStar.List.Tot.Base.length l2)
[SMTPat (FStar.List.Tot.Base.length (l1 @ l2))] | {
"end_col": 33,
"end_line": 189,
"start_col": 30,
"start_line": 187
} |
FStar.Pervasives.Lemma | val assoc_memP_none (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (requires (assoc x l == None)) (ensures (forall y. ~(memP (x, y) l))) (decreases l) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec assoc_memP_none
(#a: eqtype)
(#b: Type)
(x: a)
(l: list (a * b))
: Lemma
(requires (assoc x l == None))
(ensures (forall y . ~ (memP (x, y) l)))
(decreases l)
= match l with
| [] -> ()
| (x', _) :: q -> if x = x' then assert False else assoc_memP_none x q | val assoc_memP_none (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (requires (assoc x l == None)) (ensures (forall y. ~(memP (x, y) l))) (decreases l)
let rec assoc_memP_none (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (requires (assoc x l == None)) (ensures (forall y. ~(memP (x, y) l))) ... | false | null | true | match l with
| [] -> ()
| (x', _) :: q -> if x = x' then assert False else assoc_memP_none x q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Equality",
"Prims._assert",
"Prims.l_False",
"Prims.bool",
"FStar.List.Tot.Properties.assoc_memP_none",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.List.Tot.Base.assoc",
"FStar.Pervasives.Native... | [] | (*
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.Properties.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_memP_none (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (requires (assoc x l == None)) (ensures (forall y. ~(memP (x, y) l))) (decreases l) | [
"recursion"
] | FStar.List.Tot.Properties.assoc_memP_none | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list (a * b)
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.assoc x l == FStar.Pervasives.Native.None)
(ensures forall (y: b). ~(FStar.List.Tot.Base.memP (x, y) l))
(decreases l) | {
"end_col": 72,
"end_line": 781,
"start_col": 2,
"start_line": 779
} |
FStar.Pervasives.Lemma | val mem_subset (#a: eqtype) (la lb: list a)
: Lemma (requires (forall x. mem x la ==> mem x lb)) (ensures (subset la lb)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec mem_subset (#a: eqtype) (la lb: list a)
: Lemma (requires (forall x. mem x la ==> mem x lb))
(ensures (subset la lb)) =
match la with
| [] -> ()
| hd :: tl -> mem_subset tl lb | val mem_subset (#a: eqtype) (la lb: list a)
: Lemma (requires (forall x. mem x la ==> mem x lb)) (ensures (subset la lb))
let rec mem_subset (#a: eqtype) (la lb: list a)
: Lemma (requires (forall x. mem x la ==> mem x lb)) (ensures (subset la lb)) = | false | null | true | match la with
| [] -> ()
| hd :: tl -> mem_subset tl lb | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.mem_subset",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"Prims.squash",
"FStar.List.Tot.Base.subset",
"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.Properties.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_subset (#a: eqtype) (la lb: list a)
: Lemma (requires (forall x. mem x la ==> mem x lb)) (ensures (subset la lb)) | [
"recursion"
] | FStar.List.Tot.Properties.mem_subset | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | la: Prims.list a -> lb: Prims.list a
-> FStar.Pervasives.Lemma
(requires forall (x: a). FStar.List.Tot.Base.mem x la ==> FStar.List.Tot.Base.mem x lb)
(ensures FStar.List.Tot.Base.subset la lb) | {
"end_col": 32,
"end_line": 582,
"start_col": 2,
"start_line": 580
} |
FStar.Pervasives.Lemma | val assoc_mem (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (ensures (mem x (map fst l) <==> (exists y. assoc x l == Some y))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let assoc_mem
(#a: eqtype)
(#b: Type)
(x: a)
(l: list (a * b))
: Lemma
(ensures (mem x (map fst l) <==> (exists y . assoc x l == Some y)))
= match assoc x l with
| None ->
assoc_memP_none x l;
mem_memP x (map fst l);
memP_map_elim fst x l
| Some y ->
assoc_memP_some x y l;
memP_map_int... | val assoc_mem (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (ensures (mem x (map fst l) <==> (exists y. assoc x l == Some y)))
let assoc_mem (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (ensures (mem x (map fst l) <==> (exists y. assoc x l == Some y))) = | false | null | true | match assoc x l with
| None ->
assoc_memP_none x l;
mem_memP x (map fst l);
memP_map_elim fst x l
| Some y ->
assoc_memP_some x y l;
memP_map_intro fst (x, y) l;
mem_memP x (map fst l) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.assoc",
"FStar.List.Tot.Properties.memP_map_elim",
"FStar.Pervasives.Native.fst",
"Prims.unit",
"FStar.List.Tot.Properties.mem_memP",
"FStar.List.Tot.Base.map",
"FStar.List.Tot.Properties.assoc_memP_none",
"FSta... | [] | (*
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.Properties.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_mem (#a: eqtype) (#b: Type) (x: a) (l: list (a * b))
: Lemma (ensures (mem x (map fst l) <==> (exists y. assoc x l == Some y))) | [] | FStar.List.Tot.Properties.assoc_mem | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list (a * b)
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.mem x (FStar.List.Tot.Base.map FStar.Pervasives.Native.fst l) <==>
(exists (y: b). FStar.List.Tot.Base.assoc x l == FStar.Pervasives.Native.Some y)) | {
"end_col": 26,
"end_line": 798,
"start_col": 2,
"start_line": 790
} |
FStar.Pervasives.Lemma | val partition_count_forall: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> Lemma (requires True)
(ensures (forall x. count x l = (count x (fst (partition f l)) + count x (snd (partition f l))))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec partition_count_forall #a f l= match l with
| [] -> ()
| hd::tl -> partition_count_forall f tl | val partition_count_forall: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> Lemma (requires True)
(ensures (forall x. count x l = (count x (fst (partition f l)) + count x (snd (partition f l)))))
let rec partition_count_forall #a f l = | false | null | true | match l with
| [] -> ()
| hd :: tl -> partition_count_forall f tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Properties.partition_count_forall",
"Prims.unit"
] | [] | (*
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.Properties.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_count_forall: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> Lemma (requires True)
(ensures (forall x. count x l = (count x (fst (partition f l)) + count x (snd (partition f l))))) | [
"recursion"
] | FStar.List.Tot.Properties.partition_count_forall | {
"file_name": "ulib/FStar.List.Tot.Properties.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.count x l =
FStar.List.Tot.Base.count x
(FStar.Pervasives.Native.fst (FStar.List.Tot.Base.partition f l)) +
FStar.List.Tot.Base.count x
(FStar.Pervasiv... | {
"end_col": 41,
"end_line": 573,
"start_col": 39,
"start_line": 571
} |
FStar.Pervasives.Lemma | val rev_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev (rev l) == l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_involutive l = rev_rev' l; rev_rev' (rev' l); rev'_involutive l | val rev_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev (rev l) == l))
let rev_involutive l = | false | null | true | rev_rev' l;
rev_rev' (rev' l);
rev'_involutive l | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev'_involutive",
"Prims.unit",
"FStar.List.Tot.Properties.rev_rev'",
"FStar.List.Tot.Properties.rev'"
] | [] | (*
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.Properties.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_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev (rev l) == l)) | [] | FStar.List.Tot.Properties.rev_involutive | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.rev (FStar.List.Tot.Base.rev l) == l) | {
"end_col": 71,
"end_line": 355,
"start_col": 23,
"start_line": 355
} |
FStar.Pervasives.Lemma | val rev_length : l:list 'a ->
Lemma (requires True)
(ensures (length (rev l) = length l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_length l = rev_acc_length l [] | val rev_length : l:list 'a ->
Lemma (requires True)
(ensures (length (rev l) = length l))
let rev_length l = | false | null | true | rev_acc_length l [] | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev_acc_length",
"Prims.Nil",
"Prims.unit"
] | [] | (*
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.Properties.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_length : l:list 'a ->
Lemma (requires True)
(ensures (length (rev l) = length l)) | [] | FStar.List.Tot.Properties.rev_length | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.length (FStar.List.Tot.Base.rev l) = FStar.List.Tot.Base.length l) | {
"end_col": 38,
"end_line": 131,
"start_col": 19,
"start_line": 131
} |
FStar.Pervasives.Lemma | val precedes_append_cons_r (#a: Type) (l1: list a) (x: a) (l2: list a)
: Lemma (requires True) (ensures (x << append l1 (x :: l2))) [SMTPat (x << append l1 (x :: l2))] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec precedes_append_cons_r
(#a: Type)
(l1: list a)
(x: a)
(l2: list a)
: Lemma
(requires True)
(ensures (x << append l1 (x :: l2)))
[SMTPat (x << append l1 (x :: l2))]
= match l1 with
| [] -> ()
| _ :: q -> precedes_append_cons_r q x l2 | val precedes_append_cons_r (#a: Type) (l1: list a) (x: a) (l2: list a)
: Lemma (requires True) (ensures (x << append l1 (x :: l2))) [SMTPat (x << append l1 (x :: l2))]
let rec precedes_append_cons_r (#a: Type) (l1: list a) (x: a) (l2: list a)
: Lemma (requires True) (ensures (x << append l1 (x :: l2))) [SMTPat ... | false | null | true | match l1 with
| [] -> ()
| _ :: q -> precedes_append_cons_r q x l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.precedes_append_cons_r",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.precedes",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"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.Properties.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 precedes_append_cons_r (#a: Type) (l1: list a) (x: a) (l2: list a)
: Lemma (requires True) (ensures (x << append l1 (x :: l2))) [SMTPat (x << append l1 (x :: l2))] | [
"recursion"
] | FStar.List.Tot.Properties.precedes_append_cons_r | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> x: a -> l2: Prims.list a
-> FStar.Pervasives.Lemma (ensures x << l1 @ x :: l2) [SMTPat (x << l1 @ x :: l2)] | {
"end_col": 43,
"end_line": 1033,
"start_col": 2,
"start_line": 1031
} |
FStar.Pervasives.Lemma | val partition_mem: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> x:a
-> Lemma (requires True)
(ensures (let l1, l2 = partition f l in
mem x l = (mem x l1 || mem x l2))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec partition_mem #a f l x = match l with
| [] -> ()
| hd::tl -> partition_mem f tl x | val partition_mem: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> x:a
-> Lemma (requires True)
(ensures (let l1, l2 = partition f l in
mem x l = (mem x l1 || mem x l2)))
let rec partition_mem #a f l x = | false | null | true | match l with
| [] -> ()
| hd :: tl -> partition_mem f tl x | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Properties.partition_mem",
"Prims.unit"
] | [] | (*
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.Properties.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_mem: #a:eqtype -> f:(a -> Tot bool)
-> l:list a
-> x:a
-> Lemma (requires True)
(ensures (let l1, l2 = partition f l in
mem x l = (mem x l1 || mem x l2))) | [
"recursion"
] | FStar.List.Tot.Properties.partition_mem | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> Prims.bool) -> l: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.partition f l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l1 l2 = _ in
FStar.List.Tot.Base.mem x l =
(FStar.List.Tot.Base.mem x l1 || FStar.List.Tot.Base.mem x l2... | {
"end_col": 34,
"end_line": 530,
"start_col": 33,
"start_line": 528
} |
FStar.Pervasives.Lemma | val assoc_precedes (#a: eqtype) (#b: Type) (x: a) (l: list (a * b)) (y: b)
: Lemma (requires (assoc x l == Some y)) (ensures (x << l /\ y << l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let assoc_precedes
(#a: eqtype)
(#b: Type)
(x: a)
(l: list (a * b))
(y: b)
: Lemma
(requires (assoc x l == Some y))
(ensures (x << l /\ y << l))
= assoc_memP_some x y l;
memP_precedes (x, y) l | val assoc_precedes (#a: eqtype) (#b: Type) (x: a) (l: list (a * b)) (y: b)
: Lemma (requires (assoc x l == Some y)) (ensures (x << l /\ y << l))
let assoc_precedes (#a: eqtype) (#b: Type) (x: a) (l: list (a * b)) (y: b)
: Lemma (requires (assoc x l == Some y)) (ensures (x << l /\ y << l)) = | false | null | true | assoc_memP_some x y l;
memP_precedes (x, y) l | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.memP_precedes",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"FStar.List.Tot.Properties.assoc_memP_some",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.List.Tot.Base.assoc",
"FStar.Pervasives.... | [] | (*
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.Properties.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_precedes (#a: eqtype) (#b: Type) (x: a) (l: list (a * b)) (y: b)
: Lemma (requires (assoc x l == Some y)) (ensures (x << l /\ y << l)) | [] | FStar.List.Tot.Properties.assoc_precedes | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list (a * b) -> y: b
-> FStar.Pervasives.Lemma
(requires FStar.List.Tot.Base.assoc x l == FStar.Pervasives.Native.Some y)
(ensures x << l /\ y << l) | {
"end_col": 24,
"end_line": 1075,
"start_col": 2,
"start_line": 1074
} |
FStar.Pervasives.Lemma | val strict_suffix_of_correct (#a: _) (l1 l2: list a)
: Lemma (requires True) (ensures (strict_suffix_of l1 l2 ==> l1 << l2)) (decreases l2) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec strict_suffix_of_correct (#a) (l1 l2: list a)
: Lemma
(requires True)
(ensures (strict_suffix_of l1 l2 ==> l1 << l2))
(decreases l2)
= match l2 with
| [] -> ()
| _ :: q ->
strict_suffix_of_correct l1 q | val strict_suffix_of_correct (#a: _) (l1 l2: list a)
: Lemma (requires True) (ensures (strict_suffix_of l1 l2 ==> l1 << l2)) (decreases l2)
let rec strict_suffix_of_correct #a (l1: list a) (l2: list a)
: Lemma (requires True) (ensures (strict_suffix_of l1 l2 ==> l1 << l2)) (decreases l2) = | false | null | true | match l2 with
| [] -> ()
| _ :: q -> strict_suffix_of_correct l1 q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.strict_suffix_of_correct",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.strict_suffix_of",
"Prims.precedes",
"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.Properties.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_suffix_of_correct (#a: _) (l1 l2: list a)
: Lemma (requires True) (ensures (strict_suffix_of l1 l2 ==> l1 << l2)) (decreases l2) | [
"recursion"
] | FStar.List.Tot.Properties.strict_suffix_of_correct | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.strict_suffix_of l1 l2 ==> l1 << l2)
(decreases l2) | {
"end_col": 33,
"end_line": 953,
"start_col": 2,
"start_line": 950
} |
FStar.Pervasives.Lemma | val fold_left_invar (#a #b: Type) (f: (a -> b -> Tot a)) (l: list b) (p: (a -> Tot Type0))
: Lemma (requires forall (x: a) (y: b). p x ==> memP y l ==> p (f x y))
(ensures forall (x: a). p x ==> p (fold_left f x l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec fold_left_invar
(#a #b: Type)
(f: (a -> b -> Tot a))
(l: list b)
(p: (a -> Tot Type0))
: Lemma
(requires forall (x: a) (y: b) . p x ==> memP y l ==> p (f x y) )
(ensures forall (x: a) . p x ==> p (fold_left f x l))
=
match l with
| [] -> ()
| y :: q -> fold_left_invar f q p | val fold_left_invar (#a #b: Type) (f: (a -> b -> Tot a)) (l: list b) (p: (a -> Tot Type0))
: Lemma (requires forall (x: a) (y: b). p x ==> memP y l ==> p (f x y))
(ensures forall (x: a). p x ==> p (fold_left f x l))
let rec fold_left_invar (#a #b: Type) (f: (a -> b -> Tot a)) (l: list b) (p: (a -> Tot Type0))... | false | null | true | match l with
| [] -> ()
| y :: q -> fold_left_invar f q p | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.fold_left_invar",
"Prims.unit",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"FStar.List.Tot.Base.fold_left",
"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.Properties.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_invar (#a #b: Type) (f: (a -> b -> Tot a)) (l: list b) (p: (a -> Tot Type0))
: Lemma (requires forall (x: a) (y: b). p x ==> memP y l ==> p (f x y))
(ensures forall (x: a). p x ==> p (fold_left f x l)) | [
"recursion"
] | FStar.List.Tot.Properties.fold_left_invar | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: b -> a) -> l: Prims.list b -> p: (_: a -> Type0)
-> FStar.Pervasives.Lemma
(requires forall (x: a) (y: b). p x ==> FStar.List.Tot.Base.memP y l ==> p (f x y))
(ensures forall (x: a). p x ==> p (FStar.List.Tot.Base.fold_left f x l)) | {
"end_col": 35,
"end_line": 813,
"start_col": 2,
"start_line": 811
} |
FStar.Pervasives.Lemma | val assoc_memP_some (#a: eqtype) (#b: Type) (x: a) (y: b) (l: list (a * b))
: Lemma (requires (assoc x l == Some y)) (ensures (memP (x, y) l)) (decreases l) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec assoc_memP_some
(#a: eqtype)
(#b: Type)
(x: a)
(y: b)
(l: list (a * b))
: Lemma
(requires (assoc x l == Some y))
(ensures (memP (x, y) l))
(decreases l)
= match l with
| [] -> ()
| (x', _) :: q -> if x = x' then () else assoc_memP_some x y q | val assoc_memP_some (#a: eqtype) (#b: Type) (x: a) (y: b) (l: list (a * b))
: Lemma (requires (assoc x l == Some y)) (ensures (memP (x, y) l)) (decreases l)
let rec assoc_memP_some (#a: eqtype) (#b: Type) (x: a) (y: b) (l: list (a * b))
: Lemma (requires (assoc x l == Some y)) (ensures (memP (x, y) l)) (decreas... | false | null | true | match l with
| [] -> ()
| (x', _) :: q -> if x = x' then () else assoc_memP_some x y q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Equality",
"Prims.bool",
"FStar.List.Tot.Properties.assoc_memP_some",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.List.Tot.Base.assoc",
"FStar.Pervasives.Native.Some",
"Prims.squash",
"FStar.Lis... | [] | (*
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.Properties.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_memP_some (#a: eqtype) (#b: Type) (x: a) (y: b) (l: list (a * b))
: Lemma (requires (assoc x l == Some y)) (ensures (memP (x, y) l)) (decreases l) | [
"recursion"
] | FStar.List.Tot.Properties.assoc_memP_some | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> y: b -> l: Prims.list (a * b)
-> FStar.Pervasives.Lemma
(requires FStar.List.Tot.Base.assoc x l == FStar.Pervasives.Native.Some y)
(ensures FStar.List.Tot.Base.memP (x, y) l)
(decreases l) | {
"end_col": 64,
"end_line": 768,
"start_col": 2,
"start_line": 766
} |
FStar.Pervasives.Lemma | val strict_suffix_of_or_eq_exists_append (#a: Type) (l1 l2: list a)
: Lemma (ensures ((strict_suffix_of l1 l2 \/ l1 == l2) ==> (exists l3. l2 == append l3 l1))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let strict_suffix_of_or_eq_exists_append
(#a: Type)
(l1 l2: list a)
: Lemma
(ensures ((strict_suffix_of l1 l2 \/ l1 == l2) ==> (exists l3 . l2 == append l3 l1)))
= FStar.Classical.or_elim
#(strict_suffix_of l1 l2)
#(l1 == l2)
#(fun _ -> exists l3 . l2 == append l3 l1)
(fun _ ->
strict_suffix... | val strict_suffix_of_or_eq_exists_append (#a: Type) (l1 l2: list a)
: Lemma (ensures ((strict_suffix_of l1 l2 \/ l1 == l2) ==> (exists l3. l2 == append l3 l1)))
let strict_suffix_of_or_eq_exists_append (#a: Type) (l1 l2: list a)
: Lemma (ensures ((strict_suffix_of l1 l2 \/ l1 == l2) ==> (exists l3. l2 == append... | false | null | true | FStar.Classical.or_elim #(strict_suffix_of l1 l2)
#(l1 == l2)
#(fun _ -> exists l3. l2 == append l3 l1)
(fun _ -> strict_suffix_of_exists_append l1 l2)
(fun _ -> FStar.Classical.exists_intro (fun l3 -> l2 == append l3 l1) []) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.Classical.or_elim",
"FStar.List.Tot.Base.strict_suffix_of",
"Prims.eq2",
"Prims.squash",
"Prims.l_or",
"Prims.l_Exists",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Properties.strict_suffix_of_exists_append",
"Prims.unit",
"FStar.Classical.exists_intro",
"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.Properties.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_suffix_of_or_eq_exists_append (#a: Type) (l1 l2: list a)
: Lemma (ensures ((strict_suffix_of l1 l2 \/ l1 == l2) ==> (exists l3. l2 == append l3 l1))) | [] | FStar.List.Tot.Properties.strict_suffix_of_or_eq_exists_append | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.strict_suffix_of l1 l2 \/ l1 == l2 ==>
(exists (l3: Prims.list a). l2 == l3 @ l1)) | {
"end_col": 14,
"end_line": 1012,
"start_col": 2,
"start_line": 1003
} |
FStar.Pervasives.Lemma | val memP_precedes (#a: Type) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> x << l)) (decreases l) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec memP_precedes
(#a: Type)
(x: a)
(l: list a)
: Lemma
(requires True)
(ensures (memP x l ==> x << l))
(decreases l)
= match l with
| [] -> ()
| y :: q ->
FStar.Classical.or_elim
#(x == y)
#(memP x q)
#(fun _ -> x << l)
(fun _ -> ())
(fun _ -> memP_precedes x q) | val memP_precedes (#a: Type) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> x << l)) (decreases l)
let rec memP_precedes (#a: Type) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> x << l)) (decreases l) = | false | null | true | match l with
| [] -> ()
| y :: q ->
FStar.Classical.or_elim #(x == y)
#(memP x q)
#(fun _ -> x << l)
(fun _ -> ())
(fun _ -> memP_precedes x q) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.Classical.or_elim",
"Prims.eq2",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Prims.l_or",
"Prims.precedes",
"Prims.unit",
"FStar.List.Tot.Properties.memP_precedes",
"Prims.l_True",
"Prims.l_imp",
"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.Properties.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_precedes (#a: Type) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> x << l)) (decreases l) | [
"recursion"
] | FStar.List.Tot.Properties.memP_precedes | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.memP x l ==> x << l) (decreases l) | {
"end_col": 34,
"end_line": 1063,
"start_col": 2,
"start_line": 1055
} |
FStar.Pervasives.Lemma | val strict_suffix_of_trans (#a: Type) (l1 l2 l3: list a)
: Lemma (requires True)
(ensures ((strict_suffix_of l1 l2 /\ strict_suffix_of l2 l3) ==> strict_suffix_of l1 l3))
(decreases l3)
[SMTPat (strict_suffix_of l1 l2); SMTPat (strict_suffix_of l2 l3)] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec strict_suffix_of_trans (#a: Type) (l1 l2 l3: list a)
: Lemma
(requires True)
(ensures ((strict_suffix_of l1 l2 /\ strict_suffix_of l2 l3) ==> strict_suffix_of l1 l3))
(decreases l3)
[SMTPat (strict_suffix_of l1 l2); SMTPat (strict_suffix_of l2 l3)]
= match l3 with
| [] -> ()
| _ :: q -> strict_suffi... | val strict_suffix_of_trans (#a: Type) (l1 l2 l3: list a)
: Lemma (requires True)
(ensures ((strict_suffix_of l1 l2 /\ strict_suffix_of l2 l3) ==> strict_suffix_of l1 l3))
(decreases l3)
[SMTPat (strict_suffix_of l1 l2); SMTPat (strict_suffix_of l2 l3)]
let rec strict_suffix_of_trans (#a: Type) (l1... | false | null | true | match l3 with
| [] -> ()
| _ :: q -> strict_suffix_of_trans l1 l2 q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.strict_suffix_of_trans",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.l_and",
"FStar.List.Tot.Base.strict_suffix_of",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"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.Properties.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_suffix_of_trans (#a: Type) (l1 l2 l3: list a)
: Lemma (requires True)
(ensures ((strict_suffix_of l1 l2 /\ strict_suffix_of l2 l3) ==> strict_suffix_of l1 l3))
(decreases l3)
[SMTPat (strict_suffix_of l1 l2); SMTPat (strict_suffix_of l2 l3)] | [
"recursion"
] | FStar.List.Tot.Properties.strict_suffix_of_trans | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> l2: Prims.list a -> l3: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.strict_suffix_of l1 l2 /\ FStar.List.Tot.Base.strict_suffix_of l2 l3 ==>
FStar.List.Tot.Base.strict_suffix_of l1 l3)
(decreases l3)
[
SMTPat (FStar.List.Tot.Base.st... | {
"end_col": 44,
"end_line": 943,
"start_col": 2,
"start_line": 941
} |
FStar.Pervasives.Lemma | val map_strict_suffix_of (#a #b: Type) (f: (a -> Tot b)) (l1 l2: list a)
: Lemma (requires True)
(ensures (strict_suffix_of l1 l2 ==> strict_suffix_of (map f l1) (map f l2)))
(decreases l2) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec map_strict_suffix_of (#a #b: Type) (f: a -> Tot b) (l1: list a) (l2: list a) :
Lemma
(requires True)
(ensures (strict_suffix_of l1 l2 ==> strict_suffix_of (map f l1) (map f l2)))
(decreases l2)
= match l2 with
| [] -> ()
| a::q ->
map_strict_suffix_of f l1 q | val map_strict_suffix_of (#a #b: Type) (f: (a -> Tot b)) (l1 l2: list a)
: Lemma (requires True)
(ensures (strict_suffix_of l1 l2 ==> strict_suffix_of (map f l1) (map f l2)))
(decreases l2)
let rec map_strict_suffix_of (#a #b: Type) (f: (a -> Tot b)) (l1 l2: list a)
: Lemma (requires True)
(en... | false | null | true | match l2 with
| [] -> ()
| a :: q -> map_strict_suffix_of f l1 q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.map_strict_suffix_of",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.strict_suffix_of",
"FStar.List.Tot.Base.map",
"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.Properties.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_strict_suffix_of (#a #b: Type) (f: (a -> Tot b)) (l1 l2: list a)
: Lemma (requires True)
(ensures (strict_suffix_of l1 l2 ==> strict_suffix_of (map f l1) (map f l2)))
(decreases l2) | [
"recursion"
] | FStar.List.Tot.Properties.map_strict_suffix_of | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> b) -> l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.strict_suffix_of l1 l2 ==>
FStar.List.Tot.Base.strict_suffix_of (FStar.List.Tot.Base.map f l1)
(FStar.List.Tot.Base.map f l2)) (decreases l2) | {
"end_col": 31,
"end_line": 963,
"start_col": 2,
"start_line": 960
} |
FStar.Pervasives.Lemma | val fold_left_append_monoid (#a: Type) (f: (a -> a -> Tot a)) (z: a) (l1 l2: list a)
: Lemma
(requires
(forall u v w. f u (f v w) == f (f u v) w) /\ (forall x. f x z == x) /\
(forall x. f z x == x))
(ensures fold_left f z (l1 @ l2) == f (fold_left f z l1) (fold_left f z l2)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let fold_left_append_monoid
(#a: Type)
(f: (a -> a -> Tot a))
(z: a)
(l1 l2: list a)
: Lemma
(requires
(forall u v w . f u (f v w) == f (f u v) w) /\
(forall x . f x z == x) /\
(forall x . f z x == x))
(ensures
fold_left f z (l1 @ l2) == f (fold_left f z l1) (fold_left f z l2))
= fold_left_a... | val fold_left_append_monoid (#a: Type) (f: (a -> a -> Tot a)) (z: a) (l1 l2: list a)
: Lemma
(requires
(forall u v w. f u (f v w) == f (f u v) w) /\ (forall x. f x z == x) /\
(forall x. f z x == x))
(ensures fold_left f z (l1 @ l2) == f (fold_left f z l1) (fold_left f z l2))
let fold_lef... | false | null | true | fold_left_append f l1 l2;
fold_left_monoid f z l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.fold_left_monoid",
"Prims.unit",
"FStar.List.Tot.Properties.fold_left_append",
"Prims.l_and",
"Prims.l_Forall",
"Prims.eq2",
"Prims.squash",
"FStar.List.Tot.Base.fold_left",
"FStar.List.Tot.Base.op_At",
"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.Properties.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_append_monoid (#a: Type) (f: (a -> a -> Tot a)) (z: a) (l1 l2: list a)
: Lemma
(requires
(forall u v w. f u (f v w) == f (f u v) w) /\ (forall x. f x z == x) /\
(forall x. f z x == x))
(ensures fold_left f z (l1 @ l2) == f (fold_left f z l1) (fold_left f z l2)) | [] | FStar.List.Tot.Properties.fold_left_append_monoid | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: a -> a) -> z: a -> l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(requires
(forall (u302: a) (v: a) (w: a). f u302 (f v w) == f (f u302 v) w) /\
(forall (x: a). f x z == x) /\ (forall (x: a). f z x == x))
(ensures
FStar.List.Tot.Base.fold_left f z (l... | {
"end_col": 25,
"end_line": 881,
"start_col": 2,
"start_line": 880
} |
FStar.Pervasives.Lemma | val lemma_snoc_unsnoc: #a:Type -> lx:(list a * a) ->
Lemma (requires True)
(ensures (unsnoc (snoc lx) == lx))
(decreases (length (fst (lx))))
[SMTPat (unsnoc (snoc lx))] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec lemma_snoc_unsnoc #a lx =
let l, x = lx in
match l with
| [] -> ()
| _ -> lemma_snoc_unsnoc (tl l, x) | val lemma_snoc_unsnoc: #a:Type -> lx:(list a * a) ->
Lemma (requires True)
(ensures (unsnoc (snoc lx) == lx))
(decreases (length (fst (lx))))
[SMTPat (unsnoc (snoc lx))]
let rec lemma_snoc_unsnoc #a lx = | false | null | true | let l, x = lx in
match l with
| [] -> ()
| _ -> lemma_snoc_unsnoc (tl l, x) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"FStar.List.Tot.Properties.lemma_snoc_unsnoc",
"FStar.Pervasives.Native.Mktuple2",
"FStar.List.Tot.Base.tl",
"Prims.unit"
] | [] | (*
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.Properties.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_snoc_unsnoc: #a:Type -> lx:(list a * a) ->
Lemma (requires True)
(ensures (unsnoc (snoc lx) == lx))
(decreases (length (fst (lx))))
[SMTPat (unsnoc (snoc lx))] | [
"recursion"
] | FStar.List.Tot.Properties.lemma_snoc_unsnoc | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | lx: (Prims.list a * a)
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.unsnoc (FStar.List.Tot.Base.snoc lx) == lx)
(decreases FStar.List.Tot.Base.length (FStar.Pervasives.Native.fst lx))
[SMTPat (FStar.List.Tot.Base.unsnoc (FStar.List.Tot.Base.snoc lx))] | {
"end_col": 36,
"end_line": 418,
"start_col": 33,
"start_line": 414
} |
FStar.Pervasives.Lemma | val append_init_last (#a: Type) (l: list a {Cons? l}) : Lemma (l == append (init l) [last l]) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_init_last (#a: Type) (l: list a { Cons? l }) : Lemma
(l == append (init l) [last l])
= match l with
| a :: q ->
if Cons? q
then
append_init_last q
else
() | val append_init_last (#a: Type) (l: list a {Cons? l}) : Lemma (l == append (init l) [last l])
let rec append_init_last (#a: Type) (l: list a {Cons? l}) : Lemma (l == append (init l) [last l]) = | false | null | true | match l with | a :: q -> if Cons? q then append_init_last q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.b2t",
"Prims.uu___is_Cons",
"FStar.List.Tot.Properties.append_init_last",
"Prims.bool",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Base.init",
"Prims.Cons",
"FStar.List.Tot.Base.last",
"Prims.Nil",
"FStar.... | [] | (*
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.Properties.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_init_last (#a: Type) (l: list a {Cons? l}) : Lemma (l == append (init l) [last l]) | [
"recursion"
] | FStar.List.Tot.Properties.append_init_last | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a {Cons? l}
-> FStar.Pervasives.Lemma (ensures l == FStar.List.Tot.Base.init l @ [FStar.List.Tot.Base.last l]) | {
"end_col": 8,
"end_line": 1105,
"start_col": 2,
"start_line": 1099
} |
FStar.Pervasives.Lemma | val map_lemma: f:('a -> Tot 'b)
-> l:(list 'a)
-> Lemma (requires True)
(ensures (length (map f l)) = length l)
[SMTPat (map f l)] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec map_lemma f l =
match l with
| [] -> ()
| h::t -> map_lemma f t | val map_lemma: f:('a -> Tot 'b)
-> l:(list 'a)
-> Lemma (requires True)
(ensures (length (map f l)) = length l)
[SMTPat (map f l)]
let rec map_lemma f l = | false | null | true | match l with
| [] -> ()
| h :: t -> map_lemma f t | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.map_lemma",
"Prims.unit"
] | [] | (*
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.Properties.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_lemma: f:('a -> Tot 'b)
-> l:(list 'a)
-> Lemma (requires True)
(ensures (length (map f l)) = length l)
[SMTPat (map f l)] | [
"recursion"
] | FStar.List.Tot.Properties.map_lemma | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: 'a -> 'b) -> l: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (FStar.List.Tot.Base.map f l) = FStar.List.Tot.Base.length l)
[SMTPat (FStar.List.Tot.Base.map f l)] | {
"end_col": 27,
"end_line": 388,
"start_col": 4,
"start_line": 386
} |
FStar.Pervasives.Lemma | val mem_strict_suffix_of (#a: eqtype) (l1: list a) (m: a) (l2: list a)
: Lemma (requires True) (ensures ((mem m l1 /\ strict_suffix_of l1 l2) ==> mem m l2)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec mem_strict_suffix_of (#a: eqtype) (l1: list a) (m: a) (l2: list a)
: Lemma
(requires True)
(ensures ((mem m l1 /\ strict_suffix_of l1 l2) ==> mem m l2))
= match l2 with
| [] -> ()
| a :: q ->
mem_strict_suffix_of l1 m q | val mem_strict_suffix_of (#a: eqtype) (l1: list a) (m: a) (l2: list a)
: Lemma (requires True) (ensures ((mem m l1 /\ strict_suffix_of l1 l2) ==> mem m l2))
let rec mem_strict_suffix_of (#a: eqtype) (l1: list a) (m: a) (l2: list a)
: Lemma (requires True) (ensures ((mem m l1 /\ strict_suffix_of l1 l2) ==> mem m... | false | null | true | match l2 with
| [] -> ()
| a :: q -> mem_strict_suffix_of l1 m q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.mem_strict_suffix_of",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.strict_suffix_of",
"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.Properties.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_strict_suffix_of (#a: eqtype) (l1: list a) (m: a) (l2: list a)
: Lemma (requires True) (ensures ((mem m l1 /\ strict_suffix_of l1 l2) ==> mem m l2)) | [
"recursion"
] | FStar.List.Tot.Properties.mem_strict_suffix_of | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> m: a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.mem m l1 /\ FStar.List.Tot.Base.strict_suffix_of l1 l2 ==>
FStar.List.Tot.Base.mem m l2) | {
"end_col": 31,
"end_line": 972,
"start_col": 2,
"start_line": 969
} |
FStar.Pervasives.Lemma | val assoc_append_elim_r (#a: eqtype) (#b: Type) (x: a) (l1 l2: list (a * b))
: Lemma (requires (assoc x l2 == None \/ ~(assoc x l1 == None)))
(ensures (assoc x (l1 @ l2) == assoc x l1))
(decreases l1) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec assoc_append_elim_r
(#a: eqtype)
(#b: Type)
(x: a)
(l1 l2: list (a * b))
: Lemma
(requires (assoc x l2 == None \/ ~ (assoc x l1 == None)))
(ensures (assoc x (l1 @ l2) == assoc x l1))
(decreases l1)
= match l1 with
| [] -> ()
| (x', _) :: q -> if x = x' then () else assoc_append_elim_r x q l2 | val assoc_append_elim_r (#a: eqtype) (#b: Type) (x: a) (l1 l2: list (a * b))
: Lemma (requires (assoc x l2 == None \/ ~(assoc x l1 == None)))
(ensures (assoc x (l1 @ l2) == assoc x l1))
(decreases l1)
let rec assoc_append_elim_r (#a: eqtype) (#b: Type) (x: a) (l1 l2: list (a * b))
: Lemma (requires ... | false | null | true | match l1 with
| [] -> ()
| (x', _) :: q -> if x = x' then () else assoc_append_elim_r x q l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Equality",
"Prims.bool",
"FStar.List.Tot.Properties.assoc_append_elim_r",
"Prims.unit",
"Prims.l_or",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.List.Tot.Base.assoc",
"FStar.Pervasives.Native.None",
"Prims.l... | [] | (*
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.Properties.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_append_elim_r (#a: eqtype) (#b: Type) (x: a) (l1 l2: list (a * b))
: Lemma (requires (assoc x l2 == None \/ ~(assoc x l1 == None)))
(ensures (assoc x (l1 @ l2) == assoc x l1))
(decreases l1) | [
"recursion"
] | FStar.List.Tot.Properties.assoc_append_elim_r | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l1: Prims.list (a * b) -> l2: Prims.list (a * b)
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.assoc x l2 == FStar.Pervasives.Native.None \/
~(FStar.List.Tot.Base.assoc x l1 == FStar.Pervasives.Native.None))
(ensures FStar.List.Tot.Base.assoc x (l1 @ l2) == FStar.List.Tot... | {
"end_col": 69,
"end_line": 741,
"start_col": 2,
"start_line": 739
} |
FStar.Pervasives.Lemma | val find_none (#a: Type) (f: (a -> Tot bool)) (l: list a) (x: a)
: Lemma (requires (find f l == None /\ memP x l)) (ensures (f x == false)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec find_none
(#a: Type)
(f: (a -> Tot bool))
(l: list a)
(x: a)
: Lemma
(requires (find f l == None /\ memP x l))
(ensures (f x == false))
= let (x' :: l') = l in
Classical.or_elim
#(x == x')
#(~ (x == x'))
#(fun _ -> f x == false)
(fun h -> ())
(fun h -> find_none f l' x) | val find_none (#a: Type) (f: (a -> Tot bool)) (l: list a) (x: a)
: Lemma (requires (find f l == None /\ memP x l)) (ensures (f x == false))
let rec find_none (#a: Type) (f: (a -> Tot bool)) (l: list a) (x: a)
: Lemma (requires (find f l == None /\ memP x l)) (ensures (f x == false)) = | false | null | true | let x' :: l' = l in
Classical.or_elim #(x == x')
#(~(x == x'))
#(fun _ -> f x == false)
(fun h -> ())
(fun h -> find_none f l' x) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.bool",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.eq2",
"Prims.l_not",
"Prims.squash",
"Prims.l_or",
"Prims.unit",
"FStar.List.Tot.Properties.find_none",
"Prims.l_and",
"FStar.Pervasives.Native.option",
"Prims.b2t",
"FStar.List.Tot.Base.find",
"FStar.Pervasives.Native.None",
... | [] | (*
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.Properties.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_none (#a: Type) (f: (a -> Tot bool)) (l: list a) (x: a)
: Lemma (requires (find f l == None /\ memP x l)) (ensures (f x == false)) | [
"recursion"
] | FStar.List.Tot.Properties.find_none | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> Prims.bool) -> l: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.find f l == FStar.Pervasives.Native.None /\ FStar.List.Tot.Base.memP x l
) (ensures f x == false) | {
"end_col": 31,
"end_line": 1093,
"start_col": 1,
"start_line": 1087
} |
FStar.Pervasives.Lemma | val lemma_unsnoc_snoc: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (snoc (unsnoc l) == l))
[SMTPat (snoc (unsnoc l))] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let lemma_unsnoc_snoc #a l =
let l', x = unsnoc l in
let l1, l2 = l', [x] in
lemma_splitAt_snd_length (length l - 1) l;
// assert ((l1, l2) == splitAt (length l - 1) l);
let rec aux (l:list a{length l > 0}) :
Lemma (let l1, l2 = splitAt (length l - 1) l in
append l1 l2 == l) =
if length l =... | val lemma_unsnoc_snoc: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (snoc (unsnoc l) == l))
[SMTPat (snoc (unsnoc l))]
let lemma_unsnoc_snoc #a l = | false | null | true | let l', x = unsnoc l in
let l1, l2 = l', [x] in
lemma_splitAt_snd_length (length l - 1) l;
let rec aux (l: list a {length l > 0})
: Lemma
(let l1, l2 = splitAt (length l - 1) l in
append l1 l2 == l) =
if length l = 1 then () else aux (tl l)
in
aux l | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt",
"Prims.op_Subtraction",
"Prims.Nil",
"FStar.Pervasives.... | [] | (*
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.Properties.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_unsnoc_snoc: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (snoc (unsnoc l) == l))
[SMTPat (snoc (unsnoc l))] | [] | FStar.List.Tot.Properties.lemma_unsnoc_snoc | {
"file_name": "ulib/FStar.List.Tot.Properties.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}
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.snoc (FStar.List.Tot.Base.unsnoc l) == l)
[SMTPat (FStar.List.Tot.Base.snoc (FStar.List.Tot.Base.unsnoc l))] | {
"end_col": 7,
"end_line": 406,
"start_col": 28,
"start_line": 397
} |
FStar.Pervasives.Lemma | val sortWith_permutation: #a:eqtype -> f:(a -> a -> Tot int) -> l:list a ->
Lemma (requires True)
(ensures (forall x. count x l = count x (sortWith f l)))
(decreases (length l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec sortWith_permutation #a f l = match l with
| [] -> ()
| pivot::tl ->
let hi, lo = partition (bool_of_compare f pivot) tl in
partition_length (bool_of_compare f pivot) tl;
partition_count_forall (bool_of_compare f pivot) tl;
sortWith_permutation f lo;
sortWith_permutat... | val sortWith_permutation: #a:eqtype -> f:(a -> a -> Tot int) -> l:list a ->
Lemma (requires True)
(ensures (forall x. count x l = count x (sortWith f l)))
(decreases (length l))
let rec sortWith_permutation #a f l = | false | null | true | match l with
| [] -> ()
| pivot :: tl ->
let hi, lo = partition (bool_of_compare f pivot) tl in
partition_length (bool_of_compare f pivot) tl;
partition_count_forall (bool_of_compare f pivot) tl;
sortWith_permutation f lo;
sortWith_permutation f hi;
append_count_forall (sortWith f lo) (pivot :: sortWith f h... | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.eqtype",
"Prims.int",
"Prims.list",
"FStar.List.Tot.Properties.append_count_forall",
"FStar.List.Tot.Base.sortWith",
"Prims.Cons",
"Prims.unit",
"FStar.List.Tot.Properties.sortWith_permutation",
"FStar.List.Tot.Properties.partition_count_forall",
"FStar.List.Tot.Base.bool_of_compare",
"FS... | [] | (*
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.Properties.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_permutation: #a:eqtype -> f:(a -> a -> Tot int) -> l:list a ->
Lemma (requires True)
(ensures (forall x. count x l = count x (sortWith f l)))
(decreases (length l)) | [
"recursion"
] | FStar.List.Tot.Properties.sortWith_permutation | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> _: a -> Prims.int) -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.List.Tot.Base.count x l =
FStar.List.Tot.Base.count x (FStar.List.Tot.Base.sortWith f l))
(decreases FStar.List.Tot.Base.length l) | {
"end_col": 65,
"end_line": 604,
"start_col": 38,
"start_line": 596
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev'T = rev' | let rev'T = | false | null | false | rev' | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"total"
] | [
"FStar.List.Tot.Properties.rev'",
"Prims.list"
] | [] | (*
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.Properties.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'T : _: Prims.list _ -> Prims.list _ | [] | FStar.List.Tot.Properties.rev'T | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | _: Prims.list _ -> Prims.list _ | {
"end_col": 16,
"end_line": 319,
"start_col": 12,
"start_line": 319
} | |
FStar.Pervasives.Lemma | val lemma_unsnoc_index (#t: Type) (l: list t) (i: nat)
: Lemma (requires (length l > 0 /\ i < length l - 1))
(ensures (i < length (fst (unsnoc l)) /\ index (fst (unsnoc l)) i == index l i)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec lemma_unsnoc_index (#t:Type) (l:list t) (i:nat) :
Lemma
(requires (length l > 0 /\ i < length l - 1))
(ensures (
i < length (fst (unsnoc l)) /\
index (fst (unsnoc l)) i == index l i)) =
match i with
| 0 -> ()
| _ -> lemma_unsnoc_index (tl l) (i - 1) | val lemma_unsnoc_index (#t: Type) (l: list t) (i: nat)
: Lemma (requires (length l > 0 /\ i < length l - 1))
(ensures (i < length (fst (unsnoc l)) /\ index (fst (unsnoc l)) i == index l i))
let rec lemma_unsnoc_index (#t: Type) (l: list t) (i: nat)
: Lemma (requires (length l > 0 /\ i < length l - 1))
... | false | null | true | match i with
| 0 -> ()
| _ -> lemma_unsnoc_index (tl l) (i - 1) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.nat",
"Prims.int",
"FStar.List.Tot.Properties.lemma_unsnoc_index",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.op_LessThan",
"Prims.squash",
"FStar.Pervasives.N... | [] | (*
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.Properties.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_unsnoc_index (#t: Type) (l: list t) (i: nat)
: Lemma (requires (length l > 0 /\ i < length l - 1))
(ensures (i < length (fst (unsnoc l)) /\ index (fst (unsnoc l)) i == index l i)) | [
"recursion"
] | FStar.List.Tot.Properties.lemma_unsnoc_index | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list t -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires FStar.List.Tot.Base.length l > 0 /\ i < FStar.List.Tot.Base.length l - 1)
(ensures
i < FStar.List.Tot.Base.length (FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc l)) /\
FStar.List.Tot.Base.index (FStar.Pervasives.... | {
"end_col": 42,
"end_line": 458,
"start_col": 2,
"start_line": 456
} |
FStar.Pervasives.Lemma | val subset_reflexive (#a: eqtype) (l: list a) : Lemma (subset l l) [SMTPat (subset l l)] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let subset_reflexive (#a: eqtype) (l: list a)
: Lemma (subset l l) [SMTPat (subset l l)] = mem_subset l l | val subset_reflexive (#a: eqtype) (l: list a) : Lemma (subset l l) [SMTPat (subset l l)]
let subset_reflexive (#a: eqtype) (l: list a) : Lemma (subset l l) [SMTPat (subset l l)] = | false | null | true | mem_subset l l | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.mem_subset",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"FStar.List.Tot.Base.subset",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.bool",
"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.Properties.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 subset_reflexive (#a: eqtype) (l: list a) : Lemma (subset l l) [SMTPat (subset l l)] | [] | FStar.List.Tot.Properties.subset_reflexive | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.subset l l)
[SMTPat (FStar.List.Tot.Base.subset l l)] | {
"end_col": 63,
"end_line": 585,
"start_col": 49,
"start_line": 585
} |
FStar.Pervasives.Lemma | val rev_acc_memP : #a:Type -> l:list a -> acc:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev_acc l acc) <==> (memP x l \/ memP x acc))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev_acc_memP #a l acc x = match l with
| [] -> ()
| hd::tl -> rev_acc_memP tl (hd::acc) x | val rev_acc_memP : #a:Type -> l:list a -> acc:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev_acc l acc) <==> (memP x l \/ memP x acc)))
let rec rev_acc_memP #a l acc x = | false | null | true | match l with
| [] -> ()
| hd :: tl -> rev_acc_memP tl (hd :: acc) x | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev_acc_memP",
"Prims.Cons",
"Prims.unit"
] | [] | (*
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.Properties.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_memP : #a:Type -> l:list a -> acc:list a -> x:a ->
Lemma (requires True)
(ensures (memP x (rev_acc l acc) <==> (memP x l \/ memP x acc))) | [
"recursion"
] | FStar.List.Tot.Properties.rev_acc_memP | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a -> acc: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x (FStar.List.Tot.Base.rev_acc l acc) <==>
FStar.List.Tot.Base.memP x l \/ FStar.List.Tot.Base.memP x acc) | {
"end_col": 43,
"end_line": 138,
"start_col": 34,
"start_line": 136
} |
FStar.Pervasives.Lemma | val append_l_cons: hd:'a -> tl:list 'a -> l:list 'a ->
Lemma (requires True)
(ensures ((l@(hd::tl)) == ((l@[hd])@tl))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_l_cons hd tl l = match l with
| [] -> ()
| hd'::tl' -> append_l_cons hd tl tl' | val append_l_cons: hd:'a -> tl:list 'a -> l:list 'a ->
Lemma (requires True)
(ensures ((l@(hd::tl)) == ((l@[hd])@tl)))
let rec append_l_cons hd tl l = | false | null | true | match l with
| [] -> ()
| hd' :: tl' -> append_l_cons hd tl tl' | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_l_cons",
"Prims.unit"
] | [] | (*
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.Properties.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_l_cons: hd:'a -> tl:list 'a -> l:list 'a ->
Lemma (requires True)
(ensures ((l@(hd::tl)) == ((l@[hd])@tl))) | [
"recursion"
] | FStar.List.Tot.Properties.append_l_cons | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | hd: 'a -> tl: Prims.list 'a -> l: Prims.list 'a
-> FStar.Pervasives.Lemma (ensures l @ hd :: tl == (l @ [hd]) @ tl) | {
"end_col": 41,
"end_line": 175,
"start_col": 32,
"start_line": 173
} |
FStar.Pervasives.Lemma | val memP_map_intro (#a #b: Type) (f: (a -> Tot b)) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> memP (f x) (map f l))) (decreases l) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec memP_map_intro
(#a #b: Type)
(f: a -> Tot b)
(x: a)
(l: list a)
: Lemma
(requires True)
(ensures (memP x l ==> memP (f x) (map f l)))
(decreases l)
= match l with
| [] -> ()
| _ :: q -> memP_map_intro f x q | val memP_map_intro (#a #b: Type) (f: (a -> Tot b)) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> memP (f x) (map f l))) (decreases l)
let rec memP_map_intro (#a #b: Type) (f: (a -> Tot b)) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> memP (f x) (map f l))) (decreases l) ... | false | null | true | match l with
| [] -> ()
| _ :: q -> memP_map_intro f x q | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma",
""
] | [
"Prims.list",
"FStar.List.Tot.Properties.memP_map_intro",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.map",
"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.Properties.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_map_intro (#a #b: Type) (f: (a -> Tot b)) (x: a) (l: list a)
: Lemma (requires True) (ensures (memP x l ==> memP (f x) (map f l))) (decreases l) | [
"recursion"
] | FStar.List.Tot.Properties.memP_map_intro | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: a -> b) -> x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x l ==>
FStar.List.Tot.Base.memP (f x) (FStar.List.Tot.Base.map f l)) (decreases l) | {
"end_col": 34,
"end_line": 79,
"start_col": 2,
"start_line": 77
} |
FStar.Pervasives.Lemma | val mem_count (#a: eqtype) (l: list a) (x: a) : Lemma (mem x l <==> count x l > 0) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec mem_count
(#a: eqtype)
(l: list a)
(x: a)
: Lemma
(mem x l <==> count x l > 0)
= match l with
| [] -> ()
| x' :: l' -> mem_count l' x | val mem_count (#a: eqtype) (l: list a) (x: a) : Lemma (mem x l <==> count x l > 0)
let rec mem_count (#a: eqtype) (l: list a) (x: a) : Lemma (mem x l <==> count x l > 0) = | false | null | true | match l with
| [] -> ()
| x' :: l' -> mem_count l' x | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.mem_count",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.count",
"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.Properties.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_count (#a: eqtype) (l: list a) (x: a) : Lemma (mem x l <==> count x l > 0) | [
"recursion"
] | FStar.List.Tot.Properties.mem_count | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list a -> x: a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.mem x l <==> FStar.List.Tot.Base.count x l > 0) | {
"end_col": 30,
"end_line": 117,
"start_col": 2,
"start_line": 115
} |
FStar.Pervasives.Lemma | val rev'_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev' (rev' l) == l)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev'_involutive = function
| [] -> ()
| hd::tl -> rev'_append (rev' tl) [hd]; rev'_involutive tl | val rev'_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev' (rev' l) == l))
let rec rev'_involutive = | false | null | true | function
| [] -> ()
| hd :: tl ->
rev'_append (rev' tl) [hd];
rev'_involutive tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.rev'_involutive",
"Prims.unit",
"FStar.List.Tot.Properties.rev'_append",
"FStar.List.Tot.Properties.rev'",
"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.Properties.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'_involutive : l:list 'a ->
Lemma (requires True)
(ensures (rev' (rev' l) == l)) | [
"recursion"
] | FStar.List.Tot.Properties.rev'_involutive | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Properties.rev' (FStar.List.Tot.Properties.rev' l) == l) | {
"end_col": 60,
"end_line": 350,
"start_col": 26,
"start_line": 348
} |
FStar.Pervasives.Lemma | val append_mem_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. mem a (l1@l2) = (mem a l1 || mem a l2))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_mem_forall #a l1 l2 = match l1 with
| [] -> ()
| hd::tl -> append_mem_forall tl l2 | val append_mem_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. mem a (l1@l2) = (mem a l1 || mem a l2)))
let rec append_mem_forall #a l1 l2 = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_mem_forall tl l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.append_mem_forall",
"Prims.unit"
] | [] | (*
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.Properties.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_mem_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. mem a (l1@l2) = (mem a l1 || mem a l2))) | [
"recursion"
] | FStar.List.Tot.Properties.append_mem_forall | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
forall (a: a).
FStar.List.Tot.Base.mem a (l1 @ l2) =
(FStar.List.Tot.Base.mem a l1 || FStar.List.Tot.Base.mem a l2)) | {
"end_col": 37,
"end_line": 207,
"start_col": 37,
"start_line": 205
} |
FStar.Pervasives.Lemma | val rev_acc_rev': l:list 'a -> acc:list 'a ->
Lemma (requires (True))
(ensures ((rev_acc l acc) == ((rev' l)@acc))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev_acc_rev' l acc = match l with
| [] -> ()
| hd::tl -> rev_acc_rev' tl (hd::acc); append_l_cons hd acc (rev' tl) | val rev_acc_rev': l:list 'a -> acc:list 'a ->
Lemma (requires (True))
(ensures ((rev_acc l acc) == ((rev' l)@acc)))
let rec rev_acc_rev' l acc = | false | null | true | match l with
| [] -> ()
| hd :: tl ->
rev_acc_rev' tl (hd :: acc);
append_l_cons hd acc (rev' tl) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_l_cons",
"FStar.List.Tot.Properties.rev'",
"Prims.unit",
"FStar.List.Tot.Properties.rev_acc_rev'",
"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.Properties.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_rev': l:list 'a -> acc:list 'a ->
Lemma (requires (True))
(ensures ((rev_acc l acc) == ((rev' l)@acc))) | [
"recursion"
] | FStar.List.Tot.Properties.rev_acc_rev' | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a -> acc: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.rev_acc l acc == FStar.List.Tot.Properties.rev' l @ acc) | {
"end_col": 73,
"end_line": 326,
"start_col": 29,
"start_line": 324
} |
FStar.Pervasives.Lemma | val rev_rev': l:list 'a ->
Lemma (requires True)
(ensures ((rev l) == (rev' l))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rev_rev' l = rev_acc_rev' l []; append_l_nil (rev' l) | val rev_rev': l:list 'a ->
Lemma (requires True)
(ensures ((rev l) == (rev' l)))
let rev_rev' l = | false | null | true | rev_acc_rev' l [];
append_l_nil (rev' l) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_l_nil",
"FStar.List.Tot.Properties.rev'",
"Prims.unit",
"FStar.List.Tot.Properties.rev_acc_rev'",
"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.Properties.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_rev': l:list 'a ->
Lemma (requires True)
(ensures ((rev l) == (rev' l))) | [] | FStar.List.Tot.Properties.rev_rev' | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a
-> FStar.Pervasives.Lemma (ensures FStar.List.Tot.Base.rev l == FStar.List.Tot.Properties.rev' l) | {
"end_col": 57,
"end_line": 331,
"start_col": 17,
"start_line": 331
} |
Prims.GTot | val split_using (#t: Type) (l: list t) (x: t{x `memP` l}) : GTot (list t * list t) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec split_using (#t:Type) (l:list t) (x:t{x `memP` l}) :
GTot (list t * list t) =
match l with
| [_] -> [], l
| a :: rest ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (a == x) then (
[], l
) else (
let l1', l2' = split_using rest x in
a :: l1', l2'
) | val split_using (#t: Type) (l: list t) (x: t{x `memP` l}) : GTot (list t * list t)
let rec split_using (#t: Type) (l: list t) (x: t{x `memP` l}) : GTot (list t * list t) = | false | null | false | match l with
| [_] -> [], l
| a :: rest ->
if FStar.StrongExcludedMiddle.strong_excluded_middle (a == x)
then ([], l)
else
(let l1', l2' = split_using rest x in
a :: l1', l2') | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"sometrivial"
] | [
"Prims.list",
"FStar.List.Tot.Base.memP",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.split_using"
] | [] | (*
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.Properties.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_using (#t: Type) (l: list t) (x: t{x `memP` l}) : GTot (list t * list t) | [
"recursion"
] | FStar.List.Tot.Properties.split_using | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list t -> x: t{FStar.List.Tot.Base.memP x l} -> Prims.GTot (Prims.list t * Prims.list t) | {
"end_col": 5,
"end_line": 476,
"start_col": 2,
"start_line": 468
} |
FStar.Pervasives.Lemma | val append_count_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. count a (l1@l2) = (count a l1 + count a l2))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_count_forall #a l1 l2 = match l1 with
| [] -> ()
| hd::tl -> append_count_forall tl l2 | val append_count_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. count a (l1@l2) = (count a l1 + count a l2)))
let rec append_count_forall #a l1 l2 = | false | null | true | match l1 with
| [] -> ()
| hd :: tl -> append_count_forall tl l2 | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.eqtype",
"Prims.list",
"FStar.List.Tot.Properties.append_count_forall",
"Prims.unit"
] | [] | (*
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.Properties.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_count_forall: #a:eqtype -> l1:list a
-> l2:list a
-> Lemma (requires True)
(ensures (forall a. count a (l1@l2) = (count a l1 + count a l2))) | [
"recursion"
] | FStar.List.Tot.Properties.append_count_forall | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
forall (a: a).
FStar.List.Tot.Base.count a (l1 @ l2) =
FStar.List.Tot.Base.count a l1 + FStar.List.Tot.Base.count a l2) | {
"end_col": 39,
"end_line": 225,
"start_col": 39,
"start_line": 223
} |
FStar.Pervasives.Lemma | val append_l_nil: l:list 'a ->
Lemma (requires True)
(ensures (l@[] == l)) [SMTPat (l@[])] | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_l_nil = function
| [] -> ()
| hd::tl -> append_l_nil tl | val append_l_nil: l:list 'a ->
Lemma (requires True)
(ensures (l@[] == l)) [SMTPat (l@[])]
let rec append_l_nil = | false | null | true | function
| [] -> ()
| hd :: tl -> append_l_nil tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_l_nil",
"Prims.unit"
] | [] | (*
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.Properties.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_l_nil: l:list 'a ->
Lemma (requires True)
(ensures (l@[] == l)) [SMTPat (l@[])] | [
"recursion"
] | FStar.List.Tot.Properties.append_l_nil | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a -> FStar.Pervasives.Lemma (ensures l @ [] == l) [SMTPat (l @ [])] | {
"end_col": 29,
"end_line": 163,
"start_col": 23,
"start_line": 161
} |
Prims.Tot | val rev': list 'a -> Tot (list 'a) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev' = function
| [] -> []
| hd::tl -> (rev' tl)@[hd] | val rev': list 'a -> Tot (list 'a)
let rec rev' = | false | null | false | function
| [] -> []
| hd :: tl -> (rev' tl) @ [hd] | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"total"
] | [
"Prims.list",
"Prims.Nil",
"FStar.List.Tot.Base.op_At",
"FStar.List.Tot.Properties.rev'",
"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.Properties.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) | [
"recursion"
] | FStar.List.Tot.Properties.rev' | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | _: Prims.list 'a -> Prims.list 'a | {
"end_col": 28,
"end_line": 318,
"start_col": 15,
"start_line": 316
} |
FStar.Pervasives.Lemma | val append_inv_tail: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l1@l) == (l2@l)))
(ensures (l1 == l2)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec append_inv_tail l l1 l2 = match l1, l2 with
| [], [] -> ()
| hd1::tl1, hd2::tl2 -> append_inv_tail l tl1 tl2
| [], hd2::tl2 ->
(match l with
| [] -> ()
| hd::tl -> append_l_cons hd tl tl2; append_inv_tail tl [] (tl2@[hd])
(* We can here apply the induction hypothesi... | val append_inv_tail: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l1@l) == (l2@l)))
(ensures (l1 == l2))
let rec append_inv_tail l l1 l2 = | false | null | true | match l1, l2 with
| [], [] -> ()
| hd1 :: tl1, hd2 :: tl2 -> append_inv_tail l tl1 tl2
| [], hd2 :: tl2 ->
(match l with
| [] -> ()
| hd :: tl ->
append_l_cons hd tl tl2;
append_inv_tail tl [] (tl2 @ [hd]))
| hd1 :: tl1, [] ->
(match l with
| [] -> ()
| hd :: tl ->
append_l_cons hd... | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"FStar.List.Tot.Properties.append_inv_tail",
"Prims.Nil",
"FStar.List.Tot.Base.op_At",
"Prims.Cons",
"Prims.unit",
"FStar.List.Tot.Properties.append_l_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.Properties.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_inv_tail: l:list 'a -> l1:list 'a -> l2:list 'a ->
Lemma (requires ((l1@l) == (l2@l)))
(ensures (l1 == l2)) | [
"recursion"
] | FStar.List.Tot.Properties.append_inv_tail | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: Prims.list 'a -> l1: Prims.list 'a -> l2: Prims.list 'a
-> FStar.Pervasives.Lemma (requires l1 @ l == l2 @ l) (ensures l1 == l2) | {
"end_col": 8,
"end_line": 261,
"start_col": 34,
"start_line": 247
} |
FStar.Pervasives.Lemma | val append_injective (#a: _) (l0 l0' l1 l1': list a)
: Lemma
(ensures
(length l0 == length l0' \/ length l1 == length l1') /\ append l0 l1 == append l0' l1' ==>
l0 == l0' /\ l1 == l1') | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let append_injective #a (l0 l0':list a)
(l1 l1':list a)
: Lemma
(ensures
(length l0 == length l0' \/ length l1 == length l1') /\
append l0 l1 == append l0' l1' ==>
l0 == l0' /\ l1 == l1')
= introduce
((length l0 == length l0' \/ length l1 == length l1') /\
... | val append_injective (#a: _) (l0 l0' l1 l1': list a)
: Lemma
(ensures
(length l0 == length l0' \/ length l1 == length l1') /\ append l0 l1 == append l0' l1' ==>
l0 == l0' /\ l1 == l1')
let append_injective #a (l0: list a) (l0': list a) (l1: list a) (l1': list a)
: Lemma
(ensures
(lengt... | false | null | true | introduce ((length l0 == length l0' \/ length l1 == length l1') /\ append l0 l1 == append l0' l1') ==> (
l0 == l0' /\ l1 == l1')
with _. eliminate (length l0 == length l0') \/ (length l1 == length l1')
returns _
with _ . append_length_inv_head l0 l1 l0' l1'
and _ . append_length_inv_tail l0 l1 l0' l1' | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.Classical.Sugar.implies_intro",
"Prims.l_and",
"Prims.l_or",
"Prims.eq2",
"Prims.nat",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Base.append",
"Prims.squash",
"FStar.Classical.Sugar.or_elim",
"Prims.l_not",
"FStar.List.Tot.Properties.append_length_inv_head",
"FStar.L... | [] | (*
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.Properties.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_injective (#a: _) (l0 l0' l1 l1': list a)
: Lemma
(ensures
(length l0 == length l0' \/ length l1 == length l1') /\ append l0 l1 == append l0' l1' ==>
l0 == l0' /\ l1 == l1') | [] | FStar.List.Tot.Properties.append_injective | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l0: Prims.list a -> l0': Prims.list a -> l1: Prims.list a -> l1': Prims.list a
-> FStar.Pervasives.Lemma
(ensures
(FStar.List.Tot.Base.length l0 == FStar.List.Tot.Base.length l0' \/
FStar.List.Tot.Base.length l1 == FStar.List.Tot.Base.length l1') /\ l0 @ l1 == l0' @ l1' ==>
l0 == l0' /\ l1 == ... | {
"end_col": 49,
"end_line": 301,
"start_col": 5,
"start_line": 292
} |
FStar.Pervasives.Lemma | val lemma_unsnoc_length: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (length (fst (unsnoc l)) == length l - 1)) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let lemma_unsnoc_length #a l =
lemma_snoc_length (unsnoc l) | val lemma_unsnoc_length: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (length (fst (unsnoc l)) == length l - 1))
let lemma_unsnoc_length #a l = | false | null | true | lemma_snoc_length (unsnoc l) | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Properties.lemma_snoc_length",
"FStar.List.Tot.Base.unsnoc",
"Prims.unit"
] | [] | (*
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.Properties.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_unsnoc_length: #a:Type -> l:list a{length l > 0} ->
Lemma (requires True)
(ensures (length (fst (unsnoc l)) == length l - 1)) | [] | FStar.List.Tot.Properties.lemma_unsnoc_length | {
"file_name": "ulib/FStar.List.Tot.Properties.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}
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc l)) ==
FStar.List.Tot.Base.length l - 1) | {
"end_col": 30,
"end_line": 425,
"start_col": 2,
"start_line": 425
} |
FStar.Pervasives.Lemma | val rev'_list_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p (rev' tl) ==> p (rev' (hd::tl)))))
(ensures (p (rev' l))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev'_list_ind p = function
| [] -> ()
| hd::tl -> rev'_list_ind p tl | val rev'_list_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p (rev' tl) ==> p (rev' (hd::tl)))))
(ensures (p (rev' l)))
let rec rev'_list_ind p = | false | null | true | function
| [] -> ()
| hd :: tl -> rev'_list_ind p tl | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"Prims.bool",
"FStar.List.Tot.Properties.rev'_list_ind",
"Prims.unit"
] | [] | (*
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.Properties.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_ind: p:(list 'a -> Tot bool) -> l:list 'a ->
Lemma (requires ((p []) /\ (forall hd tl. p (rev' tl) ==> p (rev' (hd::tl)))))
(ensures (p (rev' l))) | [
"recursion"
] | FStar.List.Tot.Properties.rev'_list_ind | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | p: (_: Prims.list 'a -> Prims.bool) -> l: Prims.list 'a
-> FStar.Pervasives.Lemma
(requires
p [] /\
(forall (hd: 'a) (tl: Prims.list 'a).
p (FStar.List.Tot.Properties.rev' tl) ==> p (FStar.List.Tot.Properties.rev' (hd :: tl)))
) (ensures p (FStar.List.Tot.Properties.rev' l)) | {
"end_col": 32,
"end_line": 371,
"start_col": 26,
"start_line": 369
} |
FStar.Pervasives.Lemma | val rev'_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev' (l1@l2)) == ((rev' l2)@(rev' l1)))) | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec rev'_append l1 l2 = match l1 with
| [] -> append_l_nil (rev' l2)
| hd::tl -> rev'_append tl l2; append_assoc (rev' l2) (rev' tl) [hd] | val rev'_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev' (l1@l2)) == ((rev' l2)@(rev' l1))))
let rec rev'_append l1 l2 = | false | null | true | match l1 with
| [] -> append_l_nil (rev' l2)
| hd :: tl ->
rev'_append tl l2;
append_assoc (rev' l2) (rev' tl) [hd] | {
"checked_file": "FStar.List.Tot.Properties.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FS... | [
"lemma"
] | [
"Prims.list",
"FStar.List.Tot.Properties.append_l_nil",
"FStar.List.Tot.Properties.rev'",
"FStar.List.Tot.Properties.append_assoc",
"Prims.Cons",
"Prims.Nil",
"Prims.unit",
"FStar.List.Tot.Properties.rev'_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.Properties.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'_append: l1:list 'a -> l2:list 'a ->
Lemma (requires True)
(ensures ((rev' (l1@l2)) == ((rev' l2)@(rev' l1)))) | [
"recursion"
] | FStar.List.Tot.Properties.rev'_append | {
"file_name": "ulib/FStar.List.Tot.Properties.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l1: Prims.list 'a -> l2: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Properties.rev' (l1 @ l2) ==
FStar.List.Tot.Properties.rev' l2 @ FStar.List.Tot.Properties.rev' l1) | {
"end_col": 72,
"end_line": 338,
"start_col": 28,
"start_line": 336
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.