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_quick_Xor64 (dst: va_operand_dst_opr64) (src: va_operand_opr64) : (va_quickCode unit (va_code_Xor64 dst src))
[ { "abbrev": false, "full_module": "Vale.X64.CPU_Features_s", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.QuickCode", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Decls", "short_module": null }, { "abbrev": false, ...
false
let va_quick_Xor64 (dst:va_operand_dst_opr64) (src:va_operand_opr64) : (va_quickCode unit (va_code_Xor64 dst src)) = (va_QProc (va_code_Xor64 dst src) ([va_Mod_flags; va_mod_dst_opr64 dst]) (va_wp_Xor64 dst src) (va_wpProof_Xor64 dst src))
val va_quick_Xor64 (dst: va_operand_dst_opr64) (src: va_operand_opr64) : (va_quickCode unit (va_code_Xor64 dst src)) let va_quick_Xor64 (dst: va_operand_dst_opr64) (src: va_operand_opr64) : (va_quickCode unit (va_code_Xor64 dst src)) =
false
null
false
(va_QProc (va_code_Xor64 dst src) ([va_Mod_flags; va_mod_dst_opr64 dst]) (va_wp_Xor64 dst src) (va_wpProof_Xor64 dst src))
{ "checked_file": "Vale.X64.InsBasic.fsti.checked", "dependencies": [ "Vale.X64.State.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.QuickCode.fst.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Flags.fsti.checked", "Vale.X64.Decls.fsti.ch...
[ "total" ]
[ "Vale.X64.Decls.va_operand_dst_opr64", "Vale.X64.Decls.va_operand_opr64", "Vale.X64.QuickCode.va_QProc", "Prims.unit", "Vale.X64.InsBasic.va_code_Xor64", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_flags", "Vale.X64.QuickCode.va_mod_dst_opr64", "Prims.Nil", "Vale.X64.Ins...
[]
module Vale.X64.InsBasic open FStar.Mul open Vale.Def.Types_s open Vale.Arch.HeapImpl open Vale.Arch.Types open Vale.X64.Machine_s open Vale.X64.State open Vale.X64.Decls open Vale.X64.QuickCode unfold let vale_heap = Vale.X64.Memory.vale_heap unfold let vale_stack = Vale.X64.Stack_i.vale_stack open Vale.X64.CPU_Featur...
false
false
Vale.X64.InsBasic.fsti
{ "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_quick_Xor64 (dst: va_operand_dst_opr64) (src: va_operand_opr64) : (va_quickCode unit (va_code_Xor64 dst src))
[]
Vale.X64.InsBasic.va_quick_Xor64
{ "file_name": "obj/Vale.X64.InsBasic.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
dst: Vale.X64.Decls.va_operand_dst_opr64 -> src: Vale.X64.Decls.va_operand_opr64 -> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsBasic.va_code_Xor64 dst src)
{ "end_col": 31, "end_line": 647, "start_col": 2, "start_line": 646 }
Prims.Tot
val va_quick_Cpuid_Avx: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Avx ()))
[ { "abbrev": false, "full_module": "Vale.X64.CPU_Features_s", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.QuickCode", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Decls", "short_module": null }, { "abbrev": false, ...
false
let va_quick_Cpuid_Avx () : (va_quickCode unit (va_code_Cpuid_Avx ())) = (va_QProc (va_code_Cpuid_Avx ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRbx; va_Mod_reg64 rRax]) va_wp_Cpuid_Avx va_wpProof_Cpuid_Avx)
val va_quick_Cpuid_Avx: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Avx ())) let va_quick_Cpuid_Avx () : (va_quickCode unit (va_code_Cpuid_Avx ())) =
false
null
false
(va_QProc (va_code_Cpuid_Avx ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRbx; va_Mod_reg64 rRax]) va_wp_Cpuid_Avx va_wpProof_Cpuid_Avx)
{ "checked_file": "Vale.X64.InsBasic.fsti.checked", "dependencies": [ "Vale.X64.State.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.QuickCode.fst.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Flags.fsti.checked", "Vale.X64.Decls.fsti.ch...
[ "total" ]
[ "Prims.unit", "Vale.X64.QuickCode.va_QProc", "Vale.X64.InsBasic.va_code_Cpuid_Avx", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRcx", "Vale.X64.Machine_s.rRbx", "Vale.X64.Machine_s.rRax", "Prims.Nil", "Vale.X64.In...
[]
module Vale.X64.InsBasic open FStar.Mul open Vale.Def.Types_s open Vale.Arch.HeapImpl open Vale.Arch.Types open Vale.X64.Machine_s open Vale.X64.State open Vale.X64.Decls open Vale.X64.QuickCode unfold let vale_heap = Vale.X64.Memory.vale_heap unfold let vale_stack = Vale.X64.Stack_i.vale_stack open Vale.X64.CPU_Featur...
false
false
Vale.X64.InsBasic.fsti
{ "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_quick_Cpuid_Avx: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Avx ()))
[]
Vale.X64.InsBasic.va_quick_Cpuid_Avx
{ "file_name": "obj/Vale.X64.InsBasic.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
_: Prims.unit -> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsBasic.va_code_Cpuid_Avx ())
{ "end_col": 61, "end_line": 890, "start_col": 2, "start_line": 889 }
Prims.Tot
val va_quick_Cpuid_Osxsave: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Osxsave ()))
[ { "abbrev": false, "full_module": "Vale.X64.CPU_Features_s", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.QuickCode", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Decls", "short_module": null }, { "abbrev": false, ...
false
let va_quick_Cpuid_Osxsave () : (va_quickCode unit (va_code_Cpuid_Osxsave ())) = (va_QProc (va_code_Cpuid_Osxsave ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRbx; va_Mod_reg64 rRax]) va_wp_Cpuid_Osxsave va_wpProof_Cpuid_Osxsave)
val va_quick_Cpuid_Osxsave: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Osxsave ())) let va_quick_Cpuid_Osxsave () : (va_quickCode unit (va_code_Cpuid_Osxsave ())) =
false
null
false
(va_QProc (va_code_Cpuid_Osxsave ()) ([va_Mod_reg64 rRdx; va_Mod_reg64 rRcx; va_Mod_reg64 rRbx; va_Mod_reg64 rRax]) va_wp_Cpuid_Osxsave va_wpProof_Cpuid_Osxsave)
{ "checked_file": "Vale.X64.InsBasic.fsti.checked", "dependencies": [ "Vale.X64.State.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.QuickCode.fst.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Flags.fsti.checked", "Vale.X64.Decls.fsti.ch...
[ "total" ]
[ "Prims.unit", "Vale.X64.QuickCode.va_QProc", "Vale.X64.InsBasic.va_code_Cpuid_Osxsave", "Prims.Cons", "Vale.X64.QuickCode.mod_t", "Vale.X64.QuickCode.va_Mod_reg64", "Vale.X64.Machine_s.rRdx", "Vale.X64.Machine_s.rRcx", "Vale.X64.Machine_s.rRbx", "Vale.X64.Machine_s.rRax", "Prims.Nil", "Vale.X6...
[]
module Vale.X64.InsBasic open FStar.Mul open Vale.Def.Types_s open Vale.Arch.HeapImpl open Vale.Arch.Types open Vale.X64.Machine_s open Vale.X64.State open Vale.X64.Decls open Vale.X64.QuickCode unfold let vale_heap = Vale.X64.Memory.vale_heap unfold let vale_stack = Vale.X64.Stack_i.vale_stack open Vale.X64.CPU_Featur...
false
false
Vale.X64.InsBasic.fsti
{ "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_quick_Cpuid_Osxsave: Prims.unit -> (va_quickCode unit (va_code_Cpuid_Osxsave ()))
[]
Vale.X64.InsBasic.va_quick_Cpuid_Osxsave
{ "file_name": "obj/Vale.X64.InsBasic.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
_: Prims.unit -> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsBasic.va_code_Cpuid_Osxsave ())
{ "end_col": 69, "end_line": 1091, "start_col": 2, "start_line": 1090 }
Prims.Tot
val va_quick_NoNewline: Prims.unit -> (va_quickCode unit (va_code_NoNewline ()))
[ { "abbrev": false, "full_module": "Vale.X64.CPU_Features_s", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.QuickCode", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Decls", "short_module": null }, { "abbrev": false, ...
false
let va_quick_NoNewline () : (va_quickCode unit (va_code_NoNewline ())) = (va_QProc (va_code_NoNewline ()) ([]) va_wp_NoNewline va_wpProof_NoNewline)
val va_quick_NoNewline: Prims.unit -> (va_quickCode unit (va_code_NoNewline ())) let va_quick_NoNewline () : (va_quickCode unit (va_code_NoNewline ())) =
false
null
false
(va_QProc (va_code_NoNewline ()) ([]) va_wp_NoNewline va_wpProof_NoNewline)
{ "checked_file": "Vale.X64.InsBasic.fsti.checked", "dependencies": [ "Vale.X64.State.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.QuickCode.fst.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Flags.fsti.checked", "Vale.X64.Decls.fsti.ch...
[ "total" ]
[ "Prims.unit", "Vale.X64.QuickCode.va_QProc", "Vale.X64.InsBasic.va_code_NoNewline", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Vale.X64.InsBasic.va_wp_NoNewline", "Vale.X64.InsBasic.va_wpProof_NoNewline", "Vale.X64.QuickCode.va_quickCode" ]
[]
module Vale.X64.InsBasic open FStar.Mul open Vale.Def.Types_s open Vale.Arch.HeapImpl open Vale.Arch.Types open Vale.X64.Machine_s open Vale.X64.State open Vale.X64.Decls open Vale.X64.QuickCode unfold let vale_heap = Vale.X64.Memory.vale_heap unfold let vale_stack = Vale.X64.Stack_i.vale_stack open Vale.X64.CPU_Featur...
false
false
Vale.X64.InsBasic.fsti
{ "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_quick_NoNewline: Prims.unit -> (va_quickCode unit (va_code_NoNewline ()))
[]
Vale.X64.InsBasic.va_quick_NoNewline
{ "file_name": "obj/Vale.X64.InsBasic.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
_: Prims.unit -> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsBasic.va_code_NoNewline ())
{ "end_col": 77, "end_line": 1269, "start_col": 2, "start_line": 1269 }
Prims.Tot
val va_quick_Newline: Prims.unit -> (va_quickCode unit (va_code_Newline ()))
[ { "abbrev": false, "full_module": "Vale.X64.CPU_Features_s", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.QuickCode", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Decls", "short_module": null }, { "abbrev": false, ...
false
let va_quick_Newline () : (va_quickCode unit (va_code_Newline ())) = (va_QProc (va_code_Newline ()) ([]) va_wp_Newline va_wpProof_Newline)
val va_quick_Newline: Prims.unit -> (va_quickCode unit (va_code_Newline ())) let va_quick_Newline () : (va_quickCode unit (va_code_Newline ())) =
false
null
false
(va_QProc (va_code_Newline ()) ([]) va_wp_Newline va_wpProof_Newline)
{ "checked_file": "Vale.X64.InsBasic.fsti.checked", "dependencies": [ "Vale.X64.State.fsti.checked", "Vale.X64.Stack_i.fsti.checked", "Vale.X64.QuickCode.fst.checked", "Vale.X64.Memory.fsti.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Flags.fsti.checked", "Vale.X64.Decls.fsti.ch...
[ "total" ]
[ "Prims.unit", "Vale.X64.QuickCode.va_QProc", "Vale.X64.InsBasic.va_code_Newline", "Prims.Nil", "Vale.X64.QuickCode.mod_t", "Vale.X64.InsBasic.va_wp_Newline", "Vale.X64.InsBasic.va_wpProof_Newline", "Vale.X64.QuickCode.va_quickCode" ]
[]
module Vale.X64.InsBasic open FStar.Mul open Vale.Def.Types_s open Vale.Arch.HeapImpl open Vale.Arch.Types open Vale.X64.Machine_s open Vale.X64.State open Vale.X64.Decls open Vale.X64.QuickCode unfold let vale_heap = Vale.X64.Memory.vale_heap unfold let vale_stack = Vale.X64.Stack_i.vale_stack open Vale.X64.CPU_Featur...
false
false
Vale.X64.InsBasic.fsti
{ "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_quick_Newline: Prims.unit -> (va_quickCode unit (va_code_Newline ()))
[]
Vale.X64.InsBasic.va_quick_Newline
{ "file_name": "obj/Vale.X64.InsBasic.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
_: Prims.unit -> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsBasic.va_code_Newline ())
{ "end_col": 71, "end_line": 1293, "start_col": 2, "start_line": 1293 }
Prims.Tot
val cs:S.ciphersuite
[ { "abbrev": true, "full_module": "Spec.Agile.Hash", "short_module": "Hash" }, { "abbrev": true, "full_module": "Spec.Agile.AEAD", "short_module": "AEAD" }, { "abbrev": true, "full_module": "Spec.Agile.DH", "short_module": "DH" }, { "abbrev": true, "full_module...
false
let cs:S.ciphersuite = (DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_512)
val cs:S.ciphersuite let cs:S.ciphersuite =
false
null
false
(DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_512)
{ "checked_file": "Hacl.HPKE.Curve51_CP128_SHA512.fsti.checked", "dependencies": [ "Spec.Agile.HPKE.fsti.checked", "Spec.Agile.Hash.fsti.checked", "Spec.Agile.DH.fst.checked", "Spec.Agile.AEAD.fsti.checked", "prims.fst.checked", "Hacl.Impl.HPKE.fsti.checked", "FStar.Pervasives.Native.fst...
[ "total" ]
[ "FStar.Pervasives.Native.Mktuple4", "Spec.Agile.DH.algorithm", "Spec.Agile.HPKE.hash_algorithm", "Spec.Agile.HPKE.aead", "Spec.Hash.Definitions.hash_alg", "Spec.Agile.DH.DH_Curve25519", "Spec.Hash.Definitions.SHA2_256", "Spec.Agile.HPKE.Seal", "Spec.Agile.AEAD.CHACHA20_POLY1305", "Spec.Hash.Defini...
[]
module Hacl.HPKE.Curve51_CP128_SHA512 open Hacl.Impl.HPKE module S = Spec.Agile.HPKE module DH = Spec.Agile.DH module AEAD = Spec.Agile.AEAD module Hash = Spec.Agile.Hash
false
true
Hacl.HPKE.Curve51_CP128_SHA512.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val cs:S.ciphersuite
[]
Hacl.HPKE.Curve51_CP128_SHA512.cs
{ "file_name": "code/hpke/Hacl.HPKE.Curve51_CP128_SHA512.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Spec.Agile.HPKE.ciphersuite
{ "end_col": 102, "end_line": 10, "start_col": 23, "start_line": 10 }
Prims.Tot
val trivial_pure_post (a: Type) : pure_post a
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let trivial_pure_post (a: Type) : pure_post a = fun _ -> True
val trivial_pure_post (a: Type) : pure_post a let trivial_pure_post (a: Type) : pure_post a =
false
null
false
fun _ -> True
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.l_True", "Prims.pure_post" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val trivial_pure_post (a: Type) : pure_post a
[]
FStar.Pervasives.trivial_pure_post
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> Prims.pure_post a
{ "end_col": 61, "end_line": 132, "start_col": 48, "start_line": 132 }
FStar.Pervasives.Lemma
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let reveal_opaque (s: string) = norm_spec [delta_only [s]]
let reveal_opaque (s: string) =
false
null
true
norm_spec [delta_only [s]]
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "lemma" ]
[ "Prims.string", "FStar.Pervasives.norm_spec", "Prims.Cons", "FStar.Pervasives.norm_step", "FStar.Pervasives.delta_only", "Prims.Nil", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.Pervasives.norm", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val reveal_opaque : s: Prims.string -> x: _ -> FStar.Pervasives.Lemma (ensures FStar.Pervasives.norm [FStar.Pervasives.delta_only [s]] x == x)
[]
FStar.Pervasives.reveal_opaque
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
s: Prims.string -> x: _ -> FStar.Pervasives.Lemma (ensures FStar.Pervasives.norm [FStar.Pervasives.delta_only [s]] x == x)
{ "end_col": 58, "end_line": 330, "start_col": 32, "start_line": 330 }
Prims.Tot
val pure_return (a: Type) (x: a) : pure_wp a
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let pure_return (a:Type) (x:a) : pure_wp a = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_return0 a x
val pure_return (a: Type) (x: a) : pure_wp a let pure_return (a: Type) (x: a) : pure_wp a =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_return0 a x
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_return0", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.logical", "Prims.pure_wp_monotonic", "Prims.pure_wp" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val pure_return (a: Type) (x: a) : pure_wp a
[]
FStar.Pervasives.pure_return
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> x: a -> Prims.pure_wp a
{ "end_col": 18, "end_line": 338, "start_col": 2, "start_line": 337 }
Prims.Tot
val pure_ite_wp (a: Type) (wp: pure_wp a) : Tot (pure_wp a)
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let pure_ite_wp (a:Type) (wp:pure_wp a) : Tot (pure_wp a) = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_ite_wp0 a wp
val pure_ite_wp (a: Type) (wp: pure_wp a) : Tot (pure_wp a) let pure_ite_wp (a: Type) (wp: pure_wp a) : Tot (pure_wp a) =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_ite_wp0 a wp
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_wp", "Prims.pure_ite_wp0", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.logical", "Prims.pure_wp_monotonic" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val pure_ite_wp (a: Type) (wp: pure_wp a) : Tot (pure_wp a)
[]
FStar.Pervasives.pure_ite_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> wp: Prims.pure_wp a -> Prims.pure_wp a
{ "end_col": 19, "end_line": 353, "start_col": 2, "start_line": 352 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_bind_wp (heap: Type) (a b: Type) (wp1: st_wp_h heap a) (wp2: (a -> GTot (st_wp_h heap b))) (p: st_post_h heap b) (h0: heap) = wp1 (fun a h1 -> wp2 a p h1) h0
let st_bind_wp (heap a b: Type) (wp1: st_wp_h heap a) (wp2: (a -> GTot (st_wp_h heap b))) (p: st_post_h heap b) (h0: heap) =
false
null
false
wp1 (fun a h1 -> wp2 a p h1) h0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "FStar.Pervasives.st_post_h", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_bind_wp : heap: Type -> a: Type -> b: Type -> wp1: FStar.Pervasives.st_wp_h heap a -> wp2: (_: a -> Prims.GTot (FStar.Pervasives.st_wp_h heap b)) -> p: FStar.Pervasives.st_post_h heap b -> h0: heap -> Type0
[]
FStar.Pervasives.st_bind_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> b: Type -> wp1: FStar.Pervasives.st_wp_h heap a -> wp2: (_: a -> Prims.GTot (FStar.Pervasives.st_wp_h heap b)) -> p: FStar.Pervasives.st_post_h heap b -> h0: heap -> Type0
{ "end_col": 38, "end_line": 460, "start_col": 7, "start_line": 460 }
Prims.Tot
val id (#a: Type) (x: a) : a
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let id (#a: Type) (x: a) : a = x
val id (#a: Type) (x: a) : a let id (#a: Type) (x: a) : a =
false
null
false
x
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val id (#a: Type) (x: a) : a
[]
FStar.Pervasives.id
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: a -> a
{ "end_col": 32, "end_line": 128, "start_col": 31, "start_line": 128 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_wp_h (heap a: Type) = st_post_h heap a -> Tot (st_pre_h heap)
let st_wp_h (heap a: Type) =
false
null
false
st_post_h heap a -> Tot (st_pre_h heap)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_post_h", "FStar.Pervasives.st_pre_h" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_wp_h : heap: Type -> a: Type -> Type
[]
FStar.Pervasives.st_wp_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> Type
{ "end_col": 68, "end_line": 445, "start_col": 29, "start_line": 445 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_pre_h (heap: Type) = heap -> GTot Type0
let st_pre_h (heap: Type) =
false
null
false
heap -> GTot Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_pre_h : heap: Type -> Type
[]
FStar.Pervasives.st_pre_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> Type
{ "end_col": 46, "end_line": 434, "start_col": 28, "start_line": 434 }
Prims.Tot
val pure_bind_wp (a b: Type) (wp1: pure_wp a) (wp2: (a -> Tot (pure_wp b))) : Tot (pure_wp b)
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let pure_bind_wp (a b:Type) (wp1:pure_wp a) (wp2:(a -> Tot (pure_wp b))) : Tot (pure_wp b) = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_bind_wp0 a b wp1 wp2
val pure_bind_wp (a b: Type) (wp1: pure_wp a) (wp2: (a -> Tot (pure_wp b))) : Tot (pure_wp b) let pure_bind_wp (a b: Type) (wp1: pure_wp a) (wp2: (a -> Tot (pure_wp b))) : Tot (pure_wp b) =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_bind_wp0 a b wp1 wp2
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_wp", "Prims.pure_bind_wp0", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.logical", "Prims.pure_wp_monotonic" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val pure_bind_wp (a b: Type) (wp1: pure_wp a) (wp2: (a -> Tot (pure_wp b))) : Tot (pure_wp b)
[]
FStar.Pervasives.pure_bind_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> b: Type -> wp1: Prims.pure_wp a -> wp2: (_: a -> Prims.pure_wp b) -> Prims.pure_wp b
{ "end_col": 27, "end_line": 343, "start_col": 2, "start_line": 342 }
Prims.Tot
val pure_null_wp (a: Type) : Tot (pure_wp a)
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let pure_null_wp (a:Type) : Tot (pure_wp a) = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_null_wp0 a
val pure_null_wp (a: Type) : Tot (pure_wp a) let pure_null_wp (a: Type) : Tot (pure_wp a) =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_null_wp0 a
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_null_wp0", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.logical", "Prims.pure_wp_monotonic", "Prims.pure_wp" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val pure_null_wp (a: Type) : Tot (pure_wp a)
[]
FStar.Pervasives.pure_null_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> Prims.pure_wp a
{ "end_col": 17, "end_line": 363, "start_col": 2, "start_line": 362 }
Prims.Tot
val pure_close_wp (a b: Type) (wp: (b -> Tot (pure_wp a))) : Tot (pure_wp a)
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let pure_close_wp (a b:Type) (wp:b -> Tot (pure_wp a)) : Tot (pure_wp a) = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_close_wp0 a b wp
val pure_close_wp (a b: Type) (wp: (b -> Tot (pure_wp a))) : Tot (pure_wp a) let pure_close_wp (a b: Type) (wp: (b -> Tot (pure_wp a))) : Tot (pure_wp a) =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; pure_close_wp0 a b wp
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_wp", "Prims.pure_close_wp0", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.logical", "Prims.pure_wp_monotonic" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val pure_close_wp (a b: Type) (wp: (b -> Tot (pure_wp a))) : Tot (pure_wp a)
[]
FStar.Pervasives.pure_close_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> b: Type -> wp: (_: b -> Prims.pure_wp a) -> Prims.pure_wp a
{ "end_col": 23, "end_line": 358, "start_col": 2, "start_line": 357 }
Prims.GTot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_return (heap a: Type) (x: a) (p: st_post_h heap a) = p x
let st_return (heap a: Type) (x: a) (p: st_post_h heap a) =
false
null
false
p x
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "sometrivial" ]
[ "FStar.Pervasives.st_post_h", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_return : heap: Type -> a: Type -> x: a -> p: FStar.Pervasives.st_post_h heap a -> _: heap{Prims.l_True} -> Prims.GTot Type0
[]
FStar.Pervasives.st_return
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> x: a -> p: FStar.Pervasives.st_post_h heap a -> _: heap{Prims.l_True} -> Prims.GTot Type0
{ "end_col": 63, "end_line": 449, "start_col": 60, "start_line": 449 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_stronger (heap a: Type) (wp1 wp2: st_wp_h heap a) = (forall (p: st_post_h heap a) (h: heap). wp1 p h ==> wp2 p h)
let st_stronger (heap a: Type) (wp1 wp2: st_wp_h heap a) =
false
null
false
(forall (p: st_post_h heap a) (h: heap). wp1 p h ==> wp2 p h)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "Prims.l_Forall", "FStar.Pervasives.st_post_h", "Prims.l_imp", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_stronger : heap: Type -> a: Type -> wp1: FStar.Pervasives.st_wp_h heap a -> wp2: FStar.Pervasives.st_wp_h heap a -> Prims.logical
[]
FStar.Pervasives.st_stronger
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp1: FStar.Pervasives.st_wp_h heap a -> wp2: FStar.Pervasives.st_wp_h heap a -> Prims.logical
{ "end_col": 63, "end_line": 481, "start_col": 2, "start_line": 481 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_post_h (heap a: Type) = st_post_h' heap a True
let st_post_h (heap a: Type) =
false
null
false
st_post_h' heap a True
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_post_h'", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_post_h : heap: Type -> a: Type -> Type
[]
FStar.Pervasives.st_post_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> Type
{ "end_col": 53, "end_line": 442, "start_col": 31, "start_line": 442 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_post_h' (heap a pre: Type) = a -> _: heap{pre} -> GTot Type0
let st_post_h' (heap a pre: Type) =
false
null
false
a -> _: heap{pre} -> GTot Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_post_h' : heap: Type -> a: Type -> pre: Type -> Type
[]
FStar.Pervasives.st_post_h'
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> pre: Type -> Type
{ "end_col": 67, "end_line": 439, "start_col": 36, "start_line": 439 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_trivial (heap a: Type) (wp: st_wp_h heap a) = (forall h0. wp (fun r h1 -> True) h0)
let st_trivial (heap a: Type) (wp: st_wp_h heap a) =
false
null
false
(forall h0. wp (fun r h1 -> True) h0)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "Prims.l_Forall", "Prims.l_True", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_trivial : heap: Type -> a: Type -> wp: FStar.Pervasives.st_wp_h heap a -> Prims.logical
[]
FStar.Pervasives.st_trivial
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp: FStar.Pervasives.st_wp_h heap a -> Prims.logical
{ "end_col": 90, "end_line": 490, "start_col": 53, "start_line": 490 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_wp (a: Type) = ex_post a -> GTot ex_pre
let ex_wp (a: Type) =
false
null
false
ex_post a -> GTot ex_pre
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_post", "FStar.Pervasives.ex_pre" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_wp : a: Type -> Type
[]
FStar.Pervasives.ex_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> Type
{ "end_col": 46, "end_line": 531, "start_col": 22, "start_line": 531 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_post (a: Type) = ex_post' a True
let ex_post (a: Type) =
false
null
false
ex_post' a True
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_post'", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_post : a: Type -> Type
[]
FStar.Pervasives.ex_post
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> Type
{ "end_col": 39, "end_line": 528, "start_col": 24, "start_line": 528 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_if_then_else (a p: Type) (wp_then wp_else: ex_wp a) (post: ex_post a) = wp_then post /\ (~p ==> wp_else post)
let ex_if_then_else (a p: Type) (wp_then wp_else: ex_wp a) (post: ex_post a) =
false
null
false
wp_then post /\ (~p ==> wp_else post)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_wp", "FStar.Pervasives.ex_post", "Prims.l_and", "Prims.l_imp", "Prims.l_not", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_if_then_else : a: Type -> p: Type0 -> wp_then: FStar.Pervasives.ex_wp a -> wp_else: FStar.Pervasives.ex_wp a -> post: FStar.Pervasives.ex_post a -> Prims.logical
[]
FStar.Pervasives.ex_if_then_else
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> p: Type0 -> wp_then: FStar.Pervasives.ex_wp a -> wp_else: FStar.Pervasives.ex_wp a -> post: FStar.Pervasives.ex_post a -> Prims.logical
{ "end_col": 39, "end_line": 553, "start_col": 2, "start_line": 553 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_post' (a pre: Type) = _: result a {pre} -> GTot Type0
let ex_post' (a pre: Type) =
false
null
false
_: result a {pre} -> GTot Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.result" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_post' : a: Type -> pre: Type -> Type
[]
FStar.Pervasives.ex_post'
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> pre: Type -> Type
{ "end_col": 60, "end_line": 525, "start_col": 29, "start_line": 525 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_if_then_else (heap a p: Type) (wp_then wp_else: st_wp_h heap a) (post: st_post_h heap a) (h0: heap) = wp_then post h0 /\ (~p ==> wp_else post h0)
let st_if_then_else (heap a p: Type) (wp_then wp_else: st_wp_h heap a) (post: st_post_h heap a) (h0: heap) =
false
null
false
wp_then post h0 /\ (~p ==> wp_else post h0)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "FStar.Pervasives.st_post_h", "Prims.l_and", "Prims.l_imp", "Prims.l_not", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_if_then_else : heap: Type -> a: Type -> p: Type0 -> wp_then: FStar.Pervasives.st_wp_h heap a -> wp_else: FStar.Pervasives.st_wp_h heap a -> post: FStar.Pervasives.st_post_h heap a -> h0: heap -> Prims.logical
[]
FStar.Pervasives.st_if_then_else
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> p: Type0 -> wp_then: FStar.Pervasives.st_wp_h heap a -> wp_else: FStar.Pervasives.st_wp_h heap a -> post: FStar.Pervasives.st_post_h heap a -> h0: heap -> Prims.logical
{ "end_col": 50, "end_line": 469, "start_col": 7, "start_line": 469 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_pre = Type0
let ex_pre =
false
null
false
Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_pre : Type
[]
FStar.Pervasives.ex_pre
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
Type
{ "end_col": 18, "end_line": 522, "start_col": 13, "start_line": 522 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_stronger (a: Type) (wp1 wp2: ex_wp a) = (forall (p: ex_post a). wp1 p ==> wp2 p)
let ex_stronger (a: Type) (wp1 wp2: ex_wp a) =
false
null
false
(forall (p: ex_post a). wp1 p ==> wp2 p)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_wp", "Prims.l_Forall", "FStar.Pervasives.ex_post", "Prims.l_imp", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_stronger : a: Type -> wp1: FStar.Pervasives.ex_wp a -> wp2: FStar.Pervasives.ex_wp a -> Prims.logical
[]
FStar.Pervasives.ex_stronger
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> wp1: FStar.Pervasives.ex_wp a -> wp2: FStar.Pervasives.ex_wp a -> Prims.logical
{ "end_col": 87, "end_line": 563, "start_col": 47, "start_line": 563 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_ite_wp (heap a: Type) (wp: st_wp_h heap a) (post: st_post_h heap a) (h0: heap) = forall (k: st_post_h heap a). (forall (x: a) (h: heap). {:pattern (guard_free (k x h))} post x h ==> k x h) ==> wp k h0
let st_ite_wp (heap a: Type) (wp: st_wp_h heap a) (post: st_post_h heap a) (h0: heap) =
false
null
false
forall (k: st_post_h heap a). (forall (x: a) (h: heap). {:pattern (guard_free (k x h))} post x h ==> k x h) ==> wp k h0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "FStar.Pervasives.st_post_h", "Prims.l_Forall", "Prims.l_imp", "Prims.guard_free", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_ite_wp : heap: Type -> a: Type -> wp: FStar.Pervasives.st_wp_h heap a -> post: FStar.Pervasives.st_post_h heap a -> h0: heap -> Prims.logical
[]
FStar.Pervasives.st_ite_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp: FStar.Pervasives.st_wp_h heap a -> post: FStar.Pervasives.st_post_h heap a -> h0: heap -> Prims.logical
{ "end_col": 93, "end_line": 476, "start_col": 2, "start_line": 475 }
Prims.GTot
val ex_return (a: Type) (x: a) (p: ex_post a) : GTot Type0
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_return (a: Type) (x: a) (p: ex_post a) : GTot Type0 = p (V x)
val ex_return (a: Type) (x: a) (p: ex_post a) : GTot Type0 let ex_return (a: Type) (x: a) (p: ex_post a) : GTot Type0 =
false
null
false
p (V x)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "sometrivial" ]
[ "FStar.Pervasives.ex_post", "FStar.Pervasives.V" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_return (a: Type) (x: a) (p: ex_post a) : GTot Type0
[]
FStar.Pervasives.ex_return
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> x: a -> p: FStar.Pervasives.ex_post a -> Prims.GTot Type0
{ "end_col": 68, "end_line": 535, "start_col": 61, "start_line": 535 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_post_h (h a: Type) = all_post_h' h a True
let all_post_h (h a: Type) =
false
null
false
all_post_h' h a True
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_post_h'", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_post_h : h: Type -> a: Type -> Type
[]
FStar.Pervasives.all_post_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
h: Type -> a: Type -> Type
{ "end_col": 49, "end_line": 623, "start_col": 29, "start_line": 623 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let lift_div_exn (a: Type) (wp: pure_wp a) (p: ex_post a) = wp (fun a -> p (V a))
let lift_div_exn (a: Type) (wp: pure_wp a) (p: ex_post a) =
false
null
false
wp (fun a -> p (V a))
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_wp", "FStar.Pervasives.ex_post", "Prims.l_True", "FStar.Pervasives.V", "Prims.pure_pre" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val lift_div_exn : a: Type -> wp: Prims.pure_wp a -> p: FStar.Pervasives.ex_post a -> Prims.pure_pre
[]
FStar.Pervasives.lift_div_exn
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> wp: Prims.pure_wp a -> p: FStar.Pervasives.ex_post a -> Prims.pure_pre
{ "end_col": 81, "end_line": 595, "start_col": 60, "start_line": 595 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_pre_h (h: Type) = h -> GTot Type0
let all_pre_h (h: Type) =
false
null
false
h -> GTot Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_pre_h : h: Type -> Type
[]
FStar.Pervasives.all_pre_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
h: Type -> Type
{ "end_col": 41, "end_line": 617, "start_col": 26, "start_line": 617 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let st_close_wp (heap a b: Type) (wp: (b -> GTot (st_wp_h heap a))) (p: st_post_h heap a) (h: heap) = (forall (b: b). wp b p h)
let st_close_wp (heap a b: Type) (wp: (b -> GTot (st_wp_h heap a))) (p: st_post_h heap a) (h: heap) =
false
null
false
(forall (b: b). wp b p h)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.st_wp_h", "FStar.Pervasives.st_post_h", "Prims.l_Forall", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val st_close_wp : heap: Type -> a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.st_wp_h heap a)) -> p: FStar.Pervasives.st_post_h heap a -> h: heap -> Prims.logical
[]
FStar.Pervasives.st_close_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.st_wp_h heap a)) -> p: FStar.Pervasives.st_post_h heap a -> h: heap -> Prims.logical
{ "end_col": 27, "end_line": 486, "start_col": 2, "start_line": 486 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_trivial (heap a: Type) (wp: all_wp_h heap a) = (forall (h0: heap). wp (fun r h1 -> True) h0)
let all_trivial (heap a: Type) (wp: all_wp_h heap a) =
false
null
false
(forall (h0: heap). wp (fun r h1 -> True) h0)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_wp_h", "Prims.l_Forall", "FStar.Pervasives.result", "Prims.l_True", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_trivial : heap: Type -> a: Type -> wp: FStar.Pervasives.all_wp_h heap a -> Prims.logical
[]
FStar.Pervasives.all_trivial
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp: FStar.Pervasives.all_wp_h heap a -> Prims.logical
{ "end_col": 100, "end_line": 682, "start_col": 55, "start_line": 682 }
Prims.Tot
val dfst (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot a
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let dfst (#a: Type) (#b: a -> GTot Type) (t: dtuple2 a b) : Tot a = Mkdtuple2?._1 t
val dfst (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot a let dfst (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot a =
false
null
false
Mkdtuple2?._1 t
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.dtuple2", "Prims.__proj__Mkdtuple2__item___1" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val dfst (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot a
[]
FStar.Pervasives.dfst
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
t: Prims.dtuple2 a b -> a
{ "end_col": 19, "end_line": 734, "start_col": 4, "start_line": 734 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_if_then_else (heap a p: Type) (wp_then wp_else: all_wp_h heap a) (post: all_post_h heap a) (h0: heap) = wp_then post h0 /\ (~p ==> wp_else post h0)
let all_if_then_else (heap a p: Type) (wp_then wp_else: all_wp_h heap a) (post: all_post_h heap a) (h0: heap) =
false
null
false
wp_then post h0 /\ (~p ==> wp_else post h0)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_wp_h", "FStar.Pervasives.all_post_h", "Prims.l_and", "Prims.l_imp", "Prims.l_not", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_if_then_else : heap: Type -> a: Type -> p: Type0 -> wp_then: FStar.Pervasives.all_wp_h heap a -> wp_else: FStar.Pervasives.all_wp_h heap a -> post: FStar.Pervasives.all_post_h heap a -> h0: heap -> Prims.logical
[]
FStar.Pervasives.all_if_then_else
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> p: Type0 -> wp_then: FStar.Pervasives.all_wp_h heap a -> wp_else: FStar.Pervasives.all_wp_h heap a -> post: FStar.Pervasives.all_post_h heap a -> h0: heap -> Prims.logical
{ "end_col": 50, "end_line": 658, "start_col": 7, "start_line": 658 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_stronger (heap a: Type) (wp1 wp2: all_wp_h heap a) = (forall (p: all_post_h heap a) (h: heap). wp1 p h ==> wp2 p h)
let all_stronger (heap a: Type) (wp1 wp2: all_wp_h heap a) =
false
null
false
(forall (p: all_post_h heap a) (h: heap). wp1 p h ==> wp2 p h)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_wp_h", "Prims.l_Forall", "FStar.Pervasives.all_post_h", "Prims.l_imp", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_stronger : heap: Type -> a: Type -> wp1: FStar.Pervasives.all_wp_h heap a -> wp2: FStar.Pervasives.all_wp_h heap a -> Prims.logical
[]
FStar.Pervasives.all_stronger
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp1: FStar.Pervasives.all_wp_h heap a -> wp2: FStar.Pervasives.all_wp_h heap a -> Prims.logical
{ "end_col": 64, "end_line": 669, "start_col": 2, "start_line": 669 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_close_wp (heap a b: Type) (wp: (b -> GTot (all_wp_h heap a))) (p: all_post_h heap a) (h: heap) = (forall (b: b). wp b p h)
let all_close_wp (heap a b: Type) (wp: (b -> GTot (all_wp_h heap a))) (p: all_post_h heap a) (h: heap) =
false
null
false
(forall (b: b). wp b p h)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_wp_h", "FStar.Pervasives.all_post_h", "Prims.l_Forall", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_close_wp : heap: Type -> a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.all_wp_h heap a)) -> p: FStar.Pervasives.all_post_h heap a -> h: heap -> Prims.logical
[]
FStar.Pervasives.all_close_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.all_wp_h heap a)) -> p: FStar.Pervasives.all_post_h heap a -> h: heap -> Prims.logical
{ "end_col": 32, "end_line": 678, "start_col": 7, "start_line": 678 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_trivial (a: Type) (wp: ex_wp a) = wp (fun r -> True)
let ex_trivial (a: Type) (wp: ex_wp a) =
false
null
false
wp (fun r -> True)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_wp", "FStar.Pervasives.result", "Prims.l_True", "FStar.Pervasives.ex_pre" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_trivial : a: Type -> wp: FStar.Pervasives.ex_wp a -> FStar.Pervasives.ex_pre
[]
FStar.Pervasives.ex_trivial
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> wp: FStar.Pervasives.ex_wp a -> FStar.Pervasives.ex_pre
{ "end_col": 59, "end_line": 571, "start_col": 41, "start_line": 571 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_ite_wp (a: Type) (wp: ex_wp a) (post: ex_post a) = forall (k: ex_post a). (forall (rb: result a). {:pattern (guard_free (k rb))} post rb ==> k rb) ==> wp k
let ex_ite_wp (a: Type) (wp: ex_wp a) (post: ex_post a) =
false
null
false
forall (k: ex_post a). (forall (rb: result a). {:pattern (guard_free (k rb))} post rb ==> k rb) ==> wp k
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_wp", "FStar.Pervasives.ex_post", "Prims.l_Forall", "Prims.l_imp", "FStar.Pervasives.result", "Prims.guard_free", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_ite_wp : a: Type -> wp: FStar.Pervasives.ex_wp a -> post: FStar.Pervasives.ex_post a -> Prims.logical
[]
FStar.Pervasives.ex_ite_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> wp: FStar.Pervasives.ex_wp a -> post: FStar.Pervasives.ex_post a -> Prims.logical
{ "end_col": 85, "end_line": 559, "start_col": 2, "start_line": 558 }
Prims.GTot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_return (heap a: Type) (x: a) (p: all_post_h heap a) = p (V x)
let all_return (heap a: Type) (x: a) (p: all_post_h heap a) =
false
null
false
p (V x)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "sometrivial" ]
[ "FStar.Pervasives.all_post_h", "FStar.Pervasives.V", "Prims.l_True" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_return : heap: Type -> a: Type -> x: a -> p: FStar.Pervasives.all_post_h heap a -> _: heap{Prims.l_True} -> Prims.GTot Type0
[]
FStar.Pervasives.all_return
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> x: a -> p: FStar.Pervasives.all_post_h heap a -> _: heap{Prims.l_True} -> Prims.GTot Type0
{ "end_col": 69, "end_line": 631, "start_col": 62, "start_line": 631 }
Prims.Tot
val dsnd (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot (b (Mkdtuple2?._1 t))
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let dsnd (#a: Type) (#b: a -> GTot Type) (t: dtuple2 a b) : Tot (b (Mkdtuple2?._1 t)) = Mkdtuple2?._2 t
val dsnd (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot (b (Mkdtuple2?._1 t)) let dsnd (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot (b (Mkdtuple2?._1 t)) =
false
null
false
Mkdtuple2?._2 t
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.dtuple2", "Prims.__proj__Mkdtuple2__item___2", "Prims.__proj__Mkdtuple2__item___1" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val dsnd (#a: Type) (#b: (a -> GTot Type)) (t: dtuple2 a b) : Tot (b (Mkdtuple2?._1 t))
[]
FStar.Pervasives.dsnd
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
t: Prims.dtuple2 a b -> b (Mkdtuple2?._1 t)
{ "end_col": 19, "end_line": 738, "start_col": 4, "start_line": 738 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_wp_h (h a: Type) = all_post_h h a -> Tot (all_pre_h h)
let all_wp_h (h a: Type) =
false
null
false
all_post_h h a -> Tot (all_pre_h h)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_post_h", "FStar.Pervasives.all_pre_h" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_wp_h : h: Type -> a: Type -> Type
[]
FStar.Pervasives.all_wp_h
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
h: Type -> a: Type -> Type
{ "end_col": 62, "end_line": 626, "start_col": 27, "start_line": 626 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_close_wp (a b: Type) (wp: (b -> GTot (ex_wp a))) (p: ex_post a) = (forall (b: b). wp b p)
let ex_close_wp (a b: Type) (wp: (b -> GTot (ex_wp a))) (p: ex_post a) =
false
null
false
(forall (b: b). wp b p)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.ex_wp", "FStar.Pervasives.ex_post", "Prims.l_Forall", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_close_wp : a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.ex_wp a)) -> p: FStar.Pervasives.ex_post a -> Prims.logical
[]
FStar.Pervasives.ex_close_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> b: Type -> wp: (_: b -> Prims.GTot (FStar.Pervasives.ex_wp a)) -> p: FStar.Pervasives.ex_post a -> Prims.logical
{ "end_col": 96, "end_line": 567, "start_col": 73, "start_line": 567 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_post_h' (h a pre: Type) = result a -> _: h{pre} -> GTot Type0
let all_post_h' (h a pre: Type) =
false
null
false
result a -> _: h{pre} -> GTot Type0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.result" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_post_h' : h: Type -> a: Type -> pre: Type -> Type
[]
FStar.Pervasives.all_post_h'
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
h: Type -> a: Type -> pre: Type -> Type
{ "end_col": 69, "end_line": 620, "start_col": 34, "start_line": 620 }
Prims.Tot
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_ite_wp (heap a: Type) (wp: all_wp_h heap a) (post: all_post_h heap a) (h0: heap) = forall (k: all_post_h heap a). (forall (x: result a) (h: heap). {:pattern (guard_free (k x h))} post x h ==> k x h) ==> wp k h0
let all_ite_wp (heap a: Type) (wp: all_wp_h heap a) (post: all_post_h heap a) (h0: heap) =
false
null
false
forall (k: all_post_h heap a). (forall (x: result a) (h: heap). {:pattern (guard_free (k x h))} post x h ==> k x h) ==> wp k h0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "FStar.Pervasives.all_wp_h", "FStar.Pervasives.all_post_h", "Prims.l_Forall", "Prims.l_imp", "FStar.Pervasives.result", "Prims.guard_free", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_ite_wp : heap: Type -> a: Type -> wp: FStar.Pervasives.all_wp_h heap a -> post: FStar.Pervasives.all_post_h heap a -> h0: heap -> Prims.logical
[]
FStar.Pervasives.all_ite_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> wp: FStar.Pervasives.all_wp_h heap a -> post: FStar.Pervasives.all_post_h heap a -> h0: heap -> Prims.logical
{ "end_col": 100, "end_line": 664, "start_col": 2, "start_line": 663 }
Prims.Tot
val div_hoare_to_wp (#a: Type) (#pre: pure_pre) (post: pure_post' a pre) : Tot (pure_wp a)
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let div_hoare_to_wp (#a:Type) (#pre:pure_pre) (post:pure_post' a pre) : Tot (pure_wp a) = reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; fun (p:pure_post a) -> pre /\ (forall a. post a ==> p a)
val div_hoare_to_wp (#a: Type) (#pre: pure_pre) (post: pure_post' a pre) : Tot (pure_wp a) let div_hoare_to_wp (#a: Type) (#pre: pure_pre) (post: pure_post' a pre) : Tot (pure_wp a) =
false
null
false
reveal_opaque (`%pure_wp_monotonic) pure_wp_monotonic; fun (p: pure_post a) -> pre /\ (forall a. post a ==> p a)
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.pure_pre", "Prims.pure_post'", "Prims.pure_post", "Prims.l_and", "Prims.l_Forall", "Prims.l_imp", "Prims.logical", "Prims.unit", "FStar.Pervasives.reveal_opaque", "Prims.pure_wp'", "Prims.pure_wp_monotonic", "Prims.pure_wp" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val div_hoare_to_wp (#a: Type) (#pre: pure_pre) (post: pure_post' a pre) : Tot (pure_wp a)
[]
FStar.Pervasives.div_hoare_to_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
post: Prims.pure_post' a pre -> Prims.pure_wp a
{ "end_col": 58, "end_line": 406, "start_col": 2, "start_line": 405 }
Prims.GTot
val ex_bind_wp (a b: Type) (wp1: ex_wp a) (wp2: (a -> GTot (ex_wp b))) (p: ex_post b) : GTot Type0
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let ex_bind_wp (a b: Type) (wp1: ex_wp a) (wp2: (a -> GTot (ex_wp b))) (p: ex_post b) : GTot Type0 = forall (k: ex_post b). (forall (rb: result b). {:pattern (guard_free (k rb))} p rb ==> k rb) ==> (wp1 (function | V ra1 -> wp2 ra1 k | E e -> k (E e) | Err m -> k (Err m)))
val ex_bind_wp (a b: Type) (wp1: ex_wp a) (wp2: (a -> GTot (ex_wp b))) (p: ex_post b) : GTot Type0 let ex_bind_wp (a b: Type) (wp1: ex_wp a) (wp2: (a -> GTot (ex_wp b))) (p: ex_post b) : GTot Type0 =
false
null
false
forall (k: ex_post b). (forall (rb: result b). {:pattern (guard_free (k rb))} p rb ==> k rb) ==> (wp1 (function | V ra1 -> wp2 ra1 k | E e -> k (E e) | Err m -> k (Err m)))
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "sometrivial" ]
[ "FStar.Pervasives.ex_wp", "FStar.Pervasives.ex_post", "Prims.l_Forall", "Prims.l_imp", "FStar.Pervasives.result", "Prims.guard_free", "Prims.l_True", "Prims.exn", "FStar.Pervasives.E", "Prims.string", "FStar.Pervasives.Err" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val ex_bind_wp (a b: Type) (wp1: ex_wp a) (wp2: (a -> GTot (ex_wp b))) (p: ex_post b) : GTot Type0
[]
FStar.Pervasives.ex_bind_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Type -> b: Type -> wp1: FStar.Pervasives.ex_wp a -> wp2: (_: a -> Prims.GTot (FStar.Pervasives.ex_wp b)) -> p: FStar.Pervasives.ex_post b -> Prims.GTot Type0
{ "end_col": 32, "end_line": 547, "start_col": 2, "start_line": 542 }
Prims.GTot
val all_bind_wp (heap a b: Type) (wp1: all_wp_h heap a) (wp2: (a -> GTot (all_wp_h heap b))) (p: all_post_h heap b) (h0: heap) : GTot Type0
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let all_bind_wp (heap: Type) (a b: Type) (wp1: all_wp_h heap a) (wp2: (a -> GTot (all_wp_h heap b))) (p: all_post_h heap b) (h0: heap) : GTot Type0 = wp1 (fun ra h1 -> (match ra with | V v -> wp2 v p h1 | E e -> p (E e) h1 | Err msg -> p (E...
val all_bind_wp (heap a b: Type) (wp1: all_wp_h heap a) (wp2: (a -> GTot (all_wp_h heap b))) (p: all_post_h heap b) (h0: heap) : GTot Type0 let all_bind_wp (heap a b: Type) (wp1: all_wp_h heap a) (wp2: (a -> GTot (all_wp_h heap b))) (p: all_post_h heap b) ...
false
null
false
wp1 (fun ra h1 -> (match ra with | V v -> wp2 v p h1 | E e -> p (E e) h1 | Err msg -> p (Err msg) h1)) h0
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "sometrivial" ]
[ "FStar.Pervasives.all_wp_h", "FStar.Pervasives.all_post_h", "FStar.Pervasives.result", "Prims.l_True", "Prims.exn", "FStar.Pervasives.E", "Prims.string", "FStar.Pervasives.Err" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val all_bind_wp (heap a b: Type) (wp1: all_wp_h heap a) (wp2: (a -> GTot (all_wp_h heap b))) (p: all_post_h heap b) (h0: heap) : GTot Type0
[]
FStar.Pervasives.all_bind_wp
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
heap: Type -> a: Type -> b: Type -> wp1: FStar.Pervasives.all_wp_h heap a -> wp2: (_: a -> Prims.GTot (FStar.Pervasives.all_wp_h heap b)) -> p: FStar.Pervasives.all_post_h heap b -> h0: heap -> Prims.GTot Type0
{ "end_col": 6, "end_line": 649, "start_col": 2, "start_line": 644 }
Prims.Tot
val coerce_eq: #a: Type -> #b: Type -> squash (a == b) -> x: a -> b
[ { "abbrev": false, "full_module": "FStar.Pervasives.Native", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null } ]
false
let coerce_eq (#a:Type) (#b:Type) (_:squash (a == b)) (x:a) : b = x
val coerce_eq: #a: Type -> #b: Type -> squash (a == b) -> x: a -> b let coerce_eq (#a: Type) (#b: Type) (_: squash (a == b)) (x: a) : b =
false
null
false
x
{ "checked_file": "FStar.Pervasives.fsti.checked", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked" ], "interface_file": false, "source_file": "FStar.Pervasives.fsti" }
[ "total" ]
[ "Prims.squash", "Prims.eq2" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.Pervasives.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val coerce_eq: #a: Type -> #b: Type -> squash (a == b) -> x: a -> b
[]
FStar.Pervasives.coerce_eq
{ "file_name": "ulib/FStar.Pervasives.fsti", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
_: Prims.squash (a == b) -> x: a -> b
{ "end_col": 67, "end_line": 1210, "start_col": 66, "start_line": 1210 }
Prims.Tot
[ { "abbrev": true, "full_module": "FStar.HyperStack.ST", "short_module": "ST" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "Lib.Buffer", "short_module": "LB" }, { "abbrev": false, "full_module": "...
false
let finish_st (a: keccak_alg) = s:state (| a, () |) -> dst:B.buffer Lib.IntTypes.uint8 -> l:Lib.IntTypes.size_t { B.length dst == (if is_shake a then Lib.IntTypes.(v (l <: size_t)) else Spec.Hash.Definitions.hash_length a) } -> ST.Stack unit (requires (fun h -> B.live h s /\ B.live h dst /\ B.disjoint s ...
let finish_st (a: keccak_alg) =
false
null
false
s: state (| a, () |) -> dst: B.buffer Lib.IntTypes.uint8 -> l: Lib.IntTypes.size_t { B.length dst == (if is_shake a then let open Lib.IntTypes in v (l <: size_t) else Spec.Hash.Definitions.hash_length a) } -> ST.Stack unit (requires (fun h -> B.live h...
{ "checked_file": "Hacl.Hash.SHA3.fsti.checked", "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.Seq.fst.checked", "FStar...
[ "total" ]
[ "Spec.Hash.Definitions.keccak_alg", "Hacl.Hash.Definitions.state", "Prims.Mkdtuple2", "Spec.Hash.Definitions.hash_alg", "Hacl.Hash.Definitions.m_spec", "LowStar.Buffer.buffer", "Lib.IntTypes.uint8", "Lib.IntTypes.size_t", "Prims.eq2", "Prims.int", "Prims.l_or", "Prims.b2t", "Prims.op_Greater...
[]
module Hacl.Hash.SHA3 // This module contains low-level implementations that implement the // "incremental" API, found in Spec.Hash.Incremental. // // This is just a lightweight wrapper around the actual implementation in // code/sha3; by re-exporting the correct type signatures, this makes // instantiating the stream...
false
true
Hacl.Hash.SHA3.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val finish_st : a: Spec.Hash.Definitions.keccak_alg -> Type0
[]
Hacl.Hash.SHA3.finish_st
{ "file_name": "code/hash/Hacl.Hash.SHA3.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.keccak_alg -> Type0
{ "end_col": 86, "end_line": 69, "start_col": 2, "start_line": 62 }
Prims.Tot
val v_len (a: _) (l: Lib.IntTypes.size_t) : Spec.Hash.Definitions.output_length a
[ { "abbrev": true, "full_module": "Lib.Buffer", "short_module": "LB" }, { "abbrev": false, "full_module": "Lib.IntTypes", "short_module": null }, { "abbrev": true, "full_module": "FStar.HyperStack.ST", "short_module": "ST" }, { "abbrev": true, "full_module": "F...
false
let v_len a (l: Lib.IntTypes.size_t): Spec.Hash.Definitions.output_length a = let _ = allow_inversion hash_alg in if is_shake a then Lib.IntTypes.(v #U32 #PUB (l <: size_t)) else ()
val v_len (a: _) (l: Lib.IntTypes.size_t) : Spec.Hash.Definitions.output_length a let v_len a (l: Lib.IntTypes.size_t) : Spec.Hash.Definitions.output_length a =
false
null
false
let _ = allow_inversion hash_alg in if is_shake a then let open Lib.IntTypes in v #U32 #PUB (l <: size_t)
{ "checked_file": "Hacl.Hash.SHA3.fsti.checked", "dependencies": [ "Spec.Hash.Definitions.fst.checked", "Spec.Agile.Hash.fsti.checked", "prims.fst.checked", "LowStar.Buffer.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Hash.Definitions.fst.checked", "FStar.Seq.fst.checked", "FStar...
[ "total" ]
[ "Spec.Hash.Definitions.hash_alg", "Lib.IntTypes.size_t", "Spec.Hash.Definitions.is_shake", "Lib.IntTypes.v", "Lib.IntTypes.U32", "Lib.IntTypes.PUB", "Prims.bool", "Spec.Hash.Definitions.output_length", "Prims.unit", "FStar.Pervasives.allow_inversion" ]
[]
module Hacl.Hash.SHA3 // This module contains low-level implementations that implement the // "incremental" API, found in Spec.Hash.Incremental. // // This is just a lightweight wrapper around the actual implementation in // code/sha3; by re-exporting the correct type signatures, this makes // instantiating the stream...
false
false
Hacl.Hash.SHA3.fsti
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
null
val v_len (a: _) (l: Lib.IntTypes.size_t) : Spec.Hash.Definitions.output_length a
[]
Hacl.Hash.SHA3.v_len
{ "file_name": "code/hash/Hacl.Hash.SHA3.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
a: Spec.Hash.Definitions.hash_alg -> l: Lib.IntTypes.size_t -> Spec.Hash.Definitions.output_length a
{ "end_col": 6, "end_line": 49, "start_col": 77, "start_line": 44 }
Prims.Tot
val t_limbs:Hacl.Bignum.Definitions.limb_t
[ { "abbrev": true, "full_module": "Hacl.Bignum.MontArithmetic", "short_module": "MA" }, { "abbrev": true, "full_module": "Hacl.Bignum.SafeAPI", "short_module": "BS" }, { "abbrev": true, "full_module": "Hacl.Bignum", "short_module": "BN" }, { "abbrev": false, "f...
false
let t_limbs: Hacl.Bignum.Definitions.limb_t = Lib.IntTypes.U32
val t_limbs:Hacl.Bignum.Definitions.limb_t let t_limbs:Hacl.Bignum.Definitions.limb_t =
false
null
false
Lib.IntTypes.U32
{ "checked_file": "Hacl.Bignum4096_32.fsti.checked", "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Bignum.SafeAPI.fst.checked", "Hacl.Bignum.MontArithmetic.fsti.checked", "Hacl.Bignum.Definitions.fst.checked", "Hacl.Bignum.Convert.fst.checked", "Hacl.Bignum.fs...
[ "total" ]
[ "Lib.IntTypes.U32" ]
[]
module Hacl.Bignum4096_32 open FStar.Mul module BN = Hacl.Bignum module BS = Hacl.Bignum.SafeAPI module MA = Hacl.Bignum.MontArithmetic #set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
false
true
Hacl.Bignum4096_32.fsti
{ "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 t_limbs:Hacl.Bignum.Definitions.limb_t
[]
Hacl.Bignum4096_32.t_limbs
{ "file_name": "code/bignum/Hacl.Bignum4096_32.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Bignum.Definitions.limb_t
{ "end_col": 62, "end_line": 12, "start_col": 46, "start_line": 12 }
Prims.Tot
[ { "abbrev": true, "full_module": "Hacl.Bignum.MontArithmetic", "short_module": "MA" }, { "abbrev": true, "full_module": "Hacl.Bignum.SafeAPI", "short_module": "BS" }, { "abbrev": true, "full_module": "Hacl.Bignum", "short_module": "BN" }, { "abbrev": false, "f...
false
let lbignum = Hacl.Bignum.Definitions.lbignum
let lbignum =
false
null
false
Hacl.Bignum.Definitions.lbignum
{ "checked_file": "Hacl.Bignum4096_32.fsti.checked", "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Bignum.SafeAPI.fst.checked", "Hacl.Bignum.MontArithmetic.fsti.checked", "Hacl.Bignum.Definitions.fst.checked", "Hacl.Bignum.Convert.fst.checked", "Hacl.Bignum.fs...
[ "total" ]
[ "Hacl.Bignum.Definitions.lbignum" ]
[]
module Hacl.Bignum4096_32 open FStar.Mul module BN = Hacl.Bignum module BS = Hacl.Bignum.SafeAPI module MA = Hacl.Bignum.MontArithmetic #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" inline_for_extraction noextract let t_limbs: Hacl.Bignum.Definitions.limb_t = Lib.IntTypes.U32 inline_for_extraction noextract let ...
false
true
Hacl.Bignum4096_32.fsti
{ "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 lbignum : t: Hacl.Bignum.Definitions.limb_t -> len: Lib.IntTypes.size_t -> Type0
[]
Hacl.Bignum4096_32.lbignum
{ "file_name": "code/bignum/Hacl.Bignum4096_32.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
t: Hacl.Bignum.Definitions.limb_t -> len: Lib.IntTypes.size_t -> Type0
{ "end_col": 45, "end_line": 28, "start_col": 14, "start_line": 28 }
Prims.Tot
val n_limbs:BN.meta_len t_limbs
[ { "abbrev": true, "full_module": "Hacl.Bignum.MontArithmetic", "short_module": "MA" }, { "abbrev": true, "full_module": "Hacl.Bignum.SafeAPI", "short_module": "BS" }, { "abbrev": true, "full_module": "Hacl.Bignum", "short_module": "BN" }, { "abbrev": false, "f...
false
let n_limbs: BN.meta_len t_limbs = 128ul
val n_limbs:BN.meta_len t_limbs let n_limbs:BN.meta_len t_limbs =
false
null
false
128ul
{ "checked_file": "Hacl.Bignum4096_32.fsti.checked", "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Bignum.SafeAPI.fst.checked", "Hacl.Bignum.MontArithmetic.fsti.checked", "Hacl.Bignum.Definitions.fst.checked", "Hacl.Bignum.Convert.fst.checked", "Hacl.Bignum.fs...
[ "total" ]
[ "FStar.UInt32.__uint_to_t" ]
[]
module Hacl.Bignum4096_32 open FStar.Mul module BN = Hacl.Bignum module BS = Hacl.Bignum.SafeAPI module MA = Hacl.Bignum.MontArithmetic #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" inline_for_extraction noextract let t_limbs: Hacl.Bignum.Definitions.limb_t = Lib.IntTypes.U32
false
true
Hacl.Bignum4096_32.fsti
{ "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 n_limbs:BN.meta_len t_limbs
[]
Hacl.Bignum4096_32.n_limbs
{ "file_name": "code/bignum/Hacl.Bignum4096_32.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
Hacl.Bignum.meta_len Hacl.Bignum4096_32.t_limbs
{ "end_col": 40, "end_line": 15, "start_col": 35, "start_line": 15 }
Prims.Tot
[ { "abbrev": true, "full_module": "Hacl.Bignum.MontArithmetic", "short_module": "MA" }, { "abbrev": true, "full_module": "Hacl.Bignum.SafeAPI", "short_module": "BS" }, { "abbrev": true, "full_module": "Hacl.Bignum", "short_module": "BN" }, { "abbrev": false, "f...
false
let n_bytes = n_limbs `FStar.UInt32.mul` 4ul
let n_bytes =
false
null
false
n_limbs `FStar.UInt32.mul` 4ul
{ "checked_file": "Hacl.Bignum4096_32.fsti.checked", "dependencies": [ "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Hacl.Bignum.SafeAPI.fst.checked", "Hacl.Bignum.MontArithmetic.fsti.checked", "Hacl.Bignum.Definitions.fst.checked", "Hacl.Bignum.Convert.fst.checked", "Hacl.Bignum.fs...
[ "total" ]
[ "FStar.UInt32.mul", "Hacl.Bignum4096_32.n_limbs", "FStar.UInt32.__uint_to_t" ]
[]
module Hacl.Bignum4096_32 open FStar.Mul module BN = Hacl.Bignum module BS = Hacl.Bignum.SafeAPI module MA = Hacl.Bignum.MontArithmetic #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" inline_for_extraction noextract let t_limbs: Hacl.Bignum.Definitions.limb_t = Lib.IntTypes.U32 inline_for_extraction noextract let ...
false
true
Hacl.Bignum4096_32.fsti
{ "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 n_bytes : FStar.UInt32.t
[]
Hacl.Bignum4096_32.n_bytes
{ "file_name": "code/bignum/Hacl.Bignum4096_32.fsti", "git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e", "git_url": "https://github.com/hacl-star/hacl-star.git", "project_name": "hacl-star" }
FStar.UInt32.t
{ "end_col": 44, "end_line": 18, "start_col": 14, "start_line": 18 }
Prims.Tot
val carry_uint64 (a b: uint_t 64) : Tot (uint_t 64)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let carry_uint64 (a b: uint_t 64) : Tot (uint_t 64) = let ( ^^ ) = UInt.logxor in let ( |^ ) = UInt.logor in let ( -%^ ) = UInt.sub_mod in let ( >>^ ) = UInt.shift_right in a ^^ ((a ^^ b) |^ ((a -%^ b) ^^ b)) >>^ 63
val carry_uint64 (a b: uint_t 64) : Tot (uint_t 64) let carry_uint64 (a b: uint_t 64) : Tot (uint_t 64) =
false
null
false
let ( ^^ ) = UInt.logxor in let ( |^ ) = UInt.logor in let ( -%^ ) = UInt.sub_mod in let ( >>^ ) = UInt.shift_right in a ^^ ((a ^^ b) |^ ((a -%^ b) ^^ b)) >>^ 63
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "Prims.nat", "FStar.UInt.shift_right", "FStar.UInt.sub_mod", "FStar.UInt.logor", "FStar.UInt.logxor" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 carry_uint64 (a b: uint_t 64) : Tot (uint_t 64)
[]
FStar.UInt128.carry_uint64
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> FStar.UInt.uint_t 64
{ "end_col": 44, "end_line": 48, "start_col": 53, "start_line": 43 }
Prims.Tot
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let carry_bv (a b: uint_t 64) = bvshr (bvxor (int2bv a) (bvor (bvxor (int2bv a) (int2bv b)) (bvxor (bvsub (int2bv a) (int2bv b)) (int2bv b)))) 63
let carry_bv (a b: uint_t 64) =
false
null
false
bvshr (bvxor (int2bv a) (bvor (bvxor (int2bv a) (int2bv b)) (bvxor (bvsub (int2bv a) (int2bv b)) (int2bv b)))) 63
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "FStar.BV.bvshr", "FStar.BV.bvxor", "FStar.BV.int2bv", "FStar.BV.bvor", "FStar.BV.bvsub", "FStar.BV.bv_t" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 carry_bv : a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> FStar.BV.bv_t 64
[]
FStar.UInt128.carry_bv
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> FStar.BV.bv_t 64
{ "end_col": 12, "end_line": 55, "start_col": 4, "start_line": 53 }
Prims.Tot
val lem_ult_2 (a b: uint_t 64) : squash (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let lem_ult_2 (a b:uint_t 64) : squash (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b) = assert (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b) by (T.norm [delta_only [`%fact0;`%carry_bv]]; set_options "--smtencoding.elim_box true --using_facts_from '__Nothing__' --z3smtopt '(set-option :smt.c...
val lem_ult_2 (a b: uint_t 64) : squash (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b) let lem_ult_2 (a b: uint_t 64) : squash (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b) =
false
null
true
FStar.Tactics.Effect.assert_by_tactic (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b) (fun _ -> (); (T.norm [delta_only [`%fact0; `%carry_bv]]; set_options "--smtencoding.elim_box true --using_facts_from '__Nothing__' --z3smtopt '(set-option :smt.case_split 1)'" ))
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "FStar.Tactics.Effect.assert_by_tactic", "Prims.l_imp", "Prims.b2t", "Prims.op_Negation", "FStar.BV.bvult", "FStar.BV.int2bv", "FStar.UInt128.fact0", "Prims.unit", "FStar.Tactics.V2.Builtins.set_options", "FStar.Tactics.V2.Builtins.norm", "Prims.Cons", "FStar.Pervasives....
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 lem_ult_2 (a b: uint_t 64) : squash (not (bvult (int2bv a) (int2bv b)) ==> fact0 a b)
[]
FStar.UInt128.lem_ult_2
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> Prims.squash (Prims.op_Negation (FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b)) ==> FStar.UInt128.fact0 a b)
{ "end_col": 130, "end_line": 81, "start_col": 4, "start_line": 79 }
Prims.Tot
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let fact1 (a b: uint_t 64) = carry_bv a b == int2bv 1
let fact1 (a b: uint_t 64) =
false
null
false
carry_bv a b == int2bv 1
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "Prims.eq2", "FStar.BV.bv_t", "FStar.UInt128.carry_bv", "FStar.BV.int2bv", "Prims.logical" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 fact1 : a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> Prims.logical
[]
FStar.UInt128.fact1
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> Prims.logical
{ "end_col": 53, "end_line": 67, "start_col": 29, "start_line": 67 }
FStar.Pervasives.Lemma
val u64_logor_comm (a b: U64.t) : Lemma (U64.logor a b == U64.logor b a)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u64_logor_comm (a b:U64.t) : Lemma (U64.logor a b == U64.logor b a) = UInt.logor_commutative (U64.v a) (U64.v b)
val u64_logor_comm (a b: U64.t) : Lemma (U64.logor a b == U64.logor b a) let u64_logor_comm (a b: U64.t) : Lemma (U64.logor a b == U64.logor b a) =
false
null
true
UInt.logor_commutative (U64.v a) (U64.v b)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.UInt.logor_commutative", "FStar.UInt64.n", "FStar.UInt64.v", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt64.logor", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u64_logor_comm (a b: U64.t) : Lemma (U64.logor a b == U64.logor b a)
[]
FStar.UInt128.u64_logor_comm
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt64.t -> b: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.logor a b == FStar.UInt64.logor b a)
{ "end_col": 44, "end_line": 854, "start_col": 2, "start_line": 854 }
FStar.Pervasives.Lemma
val u64_1s_and (a b:U64.t) : Lemma (U64.v a = pow2 64 - 1 /\ U64.v b = pow2 64 - 1 ==> U64.v (U64.logand a b) = pow2 64 - 1) [SMTPat (U64.logand a b)]
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u64_1s_and a b = UInt.logand_lemma_2 (U64.v a)
val u64_1s_and (a b:U64.t) : Lemma (U64.v a = pow2 64 - 1 /\ U64.v b = pow2 64 - 1 ==> U64.v (U64.logand a b) = pow2 64 - 1) [SMTPat (U64.logand a b)] let u64_1s_and a b =
false
null
true
UInt.logand_lemma_2 (U64.v a)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.UInt.logand_lemma_2", "FStar.UInt64.n", "FStar.UInt64.v", "Prims.unit" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u64_1s_and (a b:U64.t) : Lemma (U64.v a = pow2 64 - 1 /\ U64.v b = pow2 64 - 1 ==> U64.v (U64.logand a b) = pow2 64 - 1) [SMTPat (U64.logand a b)]
[]
FStar.UInt128.u64_1s_and
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt64.t -> b: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.v a = Prims.pow2 64 - 1 /\ FStar.UInt64.v b = Prims.pow2 64 - 1 ==> FStar.UInt64.v (FStar.UInt64.logand a b) = Prims.pow2 64 - 1) [SMTPat (FStar.UInt64.logand a b)]
{ "end_col": 50, "end_line": 834, "start_col": 21, "start_line": 834 }
FStar.Pervasives.Lemma
val shift_left_large_val (#n1 #n2: nat) (a1: UInt.uint_t n1) (a2: UInt.uint_t n2) (s: nat) : Lemma ((a1 + a2 * pow2 n1) * pow2 s == (a1 * pow2 s + a2 * pow2 (n1 + s)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_left_large_val (#n1:nat) (#n2: nat) (a1:UInt.uint_t n1) (a2:UInt.uint_t n2) (s:nat) : Lemma ((a1 + a2 * pow2 n1) * pow2 s == (a1 * pow2 s + a2 * pow2 (n1+s))) = Math.distributivity_add_left a1 (a2 * pow2 n1) (pow2 s); Math.paren_mul_right a2 (pow2 n1) (pow2 s); Math.pow2_plus n1 s
val shift_left_large_val (#n1 #n2: nat) (a1: UInt.uint_t n1) (a2: UInt.uint_t n2) (s: nat) : Lemma ((a1 + a2 * pow2 n1) * pow2 s == (a1 * pow2 s + a2 * pow2 (n1 + s))) let shift_left_large_val (#n1 #n2: nat) (a1: UInt.uint_t n1) (a2: UInt.uint_t n2) (s: nat) : Lemma ((a1 + a2 * pow2 n1) * pow2 s == (a1 * pow2 s...
false
null
true
Math.distributivity_add_left a1 (a2 * pow2 n1) (pow2 s); Math.paren_mul_right a2 (pow2 n1) (pow2 s); Math.pow2_plus n1 s
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "FStar.UInt.uint_t", "FStar.Math.Lemmas.pow2_plus", "Prims.unit", "FStar.Math.Lemmas.paren_mul_right", "Prims.pow2", "FStar.Math.Lemmas.distributivity_add_left", "FStar.Mul.op_Star", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.int", "Prims.op_Addition", "Prims.Nil", ...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_left_large_val (#n1 #n2: nat) (a1: UInt.uint_t n1) (a2: UInt.uint_t n2) (s: nat) : Lemma ((a1 + a2 * pow2 n1) * pow2 s == (a1 * pow2 s + a2 * pow2 (n1 + s)))
[]
FStar.UInt128.shift_left_large_val
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a1: FStar.UInt.uint_t n1 -> a2: FStar.UInt.uint_t n2 -> s: Prims.nat -> FStar.Pervasives.Lemma (ensures (a1 + a2 * Prims.pow2 n1) * Prims.pow2 s == a1 * Prims.pow2 s + a2 * Prims.pow2 (n1 + s))
{ "end_col": 21, "end_line": 499, "start_col": 2, "start_line": 497 }
Prims.Tot
val plh (x y: U64.t) : n: UInt.uint_t 64 {n < pow2 64 - pow2 32 - 1}
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let plh (x y: U64.t) : n:UInt.uint_t 64{n < pow2 64 - pow2 32 - 1} = mul32_bound (l32 (U64.v x)) (h32 (U64.v y))
val plh (x y: U64.t) : n: UInt.uint_t 64 {n < pow2 64 - pow2 32 - 1} let plh (x y: U64.t) : n: UInt.uint_t 64 {n < pow2 64 - pow2 32 - 1} =
false
null
false
mul32_bound (l32 (U64.v x)) (h32 (U64.v y))
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt64.t", "FStar.UInt128.mul32_bound", "FStar.UInt128.l32", "FStar.UInt64.v", "FStar.UInt128.h32", "FStar.UInt.uint_t", "Prims.b2t", "Prims.op_LessThan", "Prims.op_Subtraction", "Prims.pow2" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 plh (x y: U64.t) : n: UInt.uint_t 64 {n < pow2 64 - pow2 32 - 1}
[]
FStar.UInt128.plh
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt64.t -> y: FStar.UInt64.t -> n: FStar.UInt.uint_t 64 {n < Prims.pow2 64 - Prims.pow2 32 - 1}
{ "end_col": 45, "end_line": 979, "start_col": 2, "start_line": 979 }
FStar.Pervasives.Lemma
val u64_or_0 (a b:U64.t) : Lemma (U64.v a = 0 /\ U64.v b = 0 ==> U64.v (U64.logor a b) = 0) [SMTPat (U64.logor a b)]
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u64_or_0 a b = UInt.logor_lemma_1 (U64.v a)
val u64_or_0 (a b:U64.t) : Lemma (U64.v a = 0 /\ U64.v b = 0 ==> U64.v (U64.logor a b) = 0) [SMTPat (U64.logor a b)] let u64_or_0 a b =
false
null
true
UInt.logor_lemma_1 (U64.v a)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.UInt.logor_lemma_1", "FStar.UInt64.n", "FStar.UInt64.v", "Prims.unit" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u64_or_0 (a b:U64.t) : Lemma (U64.v a = 0 /\ U64.v b = 0 ==> U64.v (U64.logor a b) = 0) [SMTPat (U64.logor a b)]
[]
FStar.UInt128.u64_or_0
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt64.t -> b: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.v a = 0 /\ FStar.UInt64.v b = 0 ==> FStar.UInt64.v (FStar.UInt64.logor a b) = 0 ) [SMTPat (FStar.UInt64.logor a b)]
{ "end_col": 47, "end_line": 869, "start_col": 19, "start_line": 869 }
FStar.Pervasives.Lemma
val mod_add: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma ((n1 % k + n2 % k) % k == (n1 + n2) % k)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mod_add n1 n2 k = Math.modulo_distributivity n1 n2 k
val mod_add: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma ((n1 % k + n2 % k) % k == (n1 + n2) % k) let mod_add n1 n2 k =
false
null
true
Math.modulo_distributivity n1 n2 k
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.b2t", "Prims.op_GreaterThan", "FStar.Math.Lemmas.modulo_distributivity", "Prims.unit" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 mod_add: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma ((n1 % k + n2 % k) % k == (n1 + n2) % k)
[]
FStar.UInt128.mod_add
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n1: Prims.nat -> n2: Prims.nat -> k: Prims.nat{k > 0} -> FStar.Pervasives.Lemma (ensures (n1 % k + n2 % k) % k == (n1 + n2) % k)
{ "end_col": 56, "end_line": 228, "start_col": 22, "start_line": 228 }
FStar.Pervasives.Lemma
val u64_logand_comm (a b: U64.t) : Lemma (U64.logand a b == U64.logand b a)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u64_logand_comm (a b:U64.t) : Lemma (U64.logand a b == U64.logand b a) = UInt.logand_commutative (U64.v a) (U64.v b)
val u64_logand_comm (a b: U64.t) : Lemma (U64.logand a b == U64.logand b a) let u64_logand_comm (a b: U64.t) : Lemma (U64.logand a b == U64.logand b a) =
false
null
true
UInt.logand_commutative (U64.v a) (U64.v b)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.UInt.logand_commutative", "FStar.UInt64.n", "FStar.UInt64.v", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.eq2", "FStar.UInt64.logand", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u64_logand_comm (a b: U64.t) : Lemma (U64.logand a b == U64.logand b a)
[]
FStar.UInt128.u64_logand_comm
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt64.t -> b: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.logand a b == FStar.UInt64.logand b a)
{ "end_col": 45, "end_line": 818, "start_col": 2, "start_line": 818 }
FStar.Pervasives.Lemma
val v_inj (x1 x2: t): Lemma (requires (v x1 == v x2)) (ensures (x1 == x2))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let v_inj (x1 x2: t): Lemma (requires (v x1 == v x2)) (ensures x1 == x2) = assert (uint_to_t (v x1) == uint_to_t (v x2)); assert (uint_to_t (v x1) == x1); assert (uint_to_t (v x2) == x2); ()
val v_inj (x1 x2: t): Lemma (requires (v x1 == v x2)) (ensures (x1 == x2)) let v_inj (x1 x2: t) : Lemma (requires (v x1 == v x2)) (ensures x1 == x2) =
false
null
true
assert (uint_to_t (v x1) == uint_to_t (v x2)); assert (uint_to_t (v x1) == x1); assert (uint_to_t (v x2) == x2); ()
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt128.t", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.UInt128.uint_to_t", "FStar.UInt128.v", "FStar.UInt.uint_t", "FStar.UInt128.n", "Prims.squash", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 v_inj (x1 x2: t): Lemma (requires (v x1 == v x2)) (ensures (x1 == x2))
[]
FStar.UInt128.v_inj
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x1: FStar.UInt128.t -> x2: FStar.UInt128.t -> FStar.Pervasives.Lemma (requires FStar.UInt128.v x1 == FStar.UInt128.v x2) (ensures x1 == x2)
{ "end_col": 3, "end_line": 133, "start_col": 1, "start_line": 130 }
FStar.Pervasives.Lemma
val shift_t_mod_val (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + (U64.v a.high * pow2 64) * pow2 s % pow2 128)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_t_mod_val (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + (U64.v a.high * pow2 64) * pow2 s % pow2 128) = let a_l = U64.v a.low in let a_h = U64.v a.high in shift_t_mod_val' a s; Math.pow2_plus 64 s; Math.paren_mul_right a_h (pow2 64) (pow2 s); ()
val shift_t_mod_val (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + (U64.v a.high * pow2 64) * pow2 s % pow2 128) let shift_t_mod_val (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + (U64.v a.high * pow2 64) * pow2 s % ...
false
null
true
let a_l = U64.v a.low in let a_h = U64.v a.high in shift_t_mod_val' a s; Math.pow2_plus 64 s; Math.paren_mul_right a_h (pow2 64) (pow2 s); ()
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt128.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.unit", "FStar.Math.Lemmas.paren_mul_right", "Prims.pow2", "FStar.Math.Lemmas.pow2_plus", "FStar.UInt128.shift_t_mod_val'", "FStar.UInt.uint_t", "FStar.UInt64.v", "FStar.UInt128.__proj__Mkuint128__item__high", "FStar.UIn...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_t_mod_val (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + (U64.v a.high * pow2 64) * pow2 s % pow2 128)
[]
FStar.UInt128.shift_t_mod_val
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: Prims.nat{s < 64} -> FStar.Pervasives.Lemma (ensures FStar.UInt128.v a * Prims.pow2 s % Prims.pow2 128 == FStar.UInt64.v (Mkuint128?.low a) * Prims.pow2 s + (FStar.UInt64.v (Mkuint128?.high a) * Prims.pow2 64) * Prims.pow2 s % Prims.pow2 128)
{ "end_col": 4, "end_line": 674, "start_col": 78, "start_line": 668 }
Prims.Tot
val u32_32:x: U32.t{U32.v x == 32}
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u32_32 : x:U32.t{U32.v x == 32} = U32.uint_to_t 32
val u32_32:x: U32.t{U32.v x == 32} let u32_32:x: U32.t{U32.v x == 32} =
false
null
false
U32.uint_to_t 32
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt32.uint_to_t" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u32_32:x: U32.t{U32.v x == 32}
[]
FStar.UInt128.u32_32
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt32.t{FStar.UInt32.v x == 32}
{ "end_col": 54, "end_line": 914, "start_col": 38, "start_line": 914 }
FStar.Pervasives.Lemma
val mod_add_small: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma (requires (n1 % k + n2 % k < k)) (ensures (n1 % k + n2 % k == (n1 + n2) % k))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mod_add_small n1 n2 k = mod_add n1 n2 k; Math.small_modulo_lemma_1 (n1%k + n2%k) k
val mod_add_small: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma (requires (n1 % k + n2 % k < k)) (ensures (n1 % k + n2 % k == (n1 + n2) % k)) let mod_add_small n1 n2 k =
false
null
true
mod_add n1 n2 k; Math.small_modulo_lemma_1 (n1 % k + n2 % k) k
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.b2t", "Prims.op_GreaterThan", "FStar.Math.Lemmas.small_modulo_lemma_1", "Prims.op_Addition", "Prims.op_Modulus", "Prims.unit", "FStar.UInt128.mod_add" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 mod_add_small: n1:nat -> n2:nat -> k:nat{k > 0} -> Lemma (requires (n1 % k + n2 % k < k)) (ensures (n1 % k + n2 % k == (n1 + n2) % k))
[]
FStar.UInt128.mod_add_small
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n1: Prims.nat -> n2: Prims.nat -> k: Prims.nat{k > 0} -> FStar.Pervasives.Lemma (requires n1 % k + n2 % k < k) (ensures n1 % k + n2 % k == (n1 + n2) % k)
{ "end_col": 43, "end_line": 235, "start_col": 2, "start_line": 234 }
Prims.Tot
val h32 (x: UInt.uint_t 64) : UInt.uint_t 32
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let h32 (x: UInt.uint_t 64) : UInt.uint_t 32 = x / pow2 32
val h32 (x: UInt.uint_t 64) : UInt.uint_t 32 let h32 (x: UInt.uint_t 64) : UInt.uint_t 32 =
false
null
false
x / pow2 32
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "Prims.op_Division", "Prims.pow2" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 h32 (x: UInt.uint_t 64) : UInt.uint_t 32
[]
FStar.UInt128.h32
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt.uint_t 64 -> FStar.UInt.uint_t 32
{ "end_col": 58, "end_line": 968, "start_col": 47, "start_line": 968 }
Prims.Pure
val shift_left: a:t -> s:UInt32.t -> Pure t (requires (U32.v s < n)) (ensures (fun c -> v c = ((v a * pow2 (UInt32.v s)) % pow2 n)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_left a s = if (U32.lt s u32_64) then shift_left_small a s else shift_left_large a s
val shift_left: a:t -> s:UInt32.t -> Pure t (requires (U32.v s < n)) (ensures (fun c -> v c = ((v a * pow2 (UInt32.v s)) % pow2 n))) let shift_left a s =
false
null
false
if (U32.lt s u32_64) then shift_left_small a s else shift_left_large a s
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt128.t", "FStar.UInt32.t", "FStar.UInt32.lt", "FStar.UInt128.u32_64", "FStar.UInt128.shift_left_small", "Prims.bool", "FStar.UInt128.shift_left_large" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_left: a:t -> s:UInt32.t -> Pure t (requires (U32.v s < n)) (ensures (fun c -> v c = ((v a * pow2 (UInt32.v s)) % pow2 n)))
[]
FStar.UInt128.shift_left
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt128.t
{ "end_col": 27, "end_line": 711, "start_col": 2, "start_line": 710 }
FStar.Pervasives.Lemma
val div_add_small: n:nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (k1*m / (k1*k2) == (n + k1*m) / (k1*k2)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let div_add_small n m k1 k2 = div_product (k1*m) k1 k2; div_product (n+k1*m) k1 k2; mul_div_cancel m k1; assert (k1*m/k1 == m); div_plus_multiple n m k1
val div_add_small: n:nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (k1*m / (k1*k2) == (n + k1*m) / (k1*k2))) let div_add_small n m k1 k2 =
false
null
true
div_product (k1 * m) k1 k2; div_product (n + k1 * m) k1 k2; mul_div_cancel m k1; assert (k1 * m / k1 == m); div_plus_multiple n m k1
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.pos", "FStar.UInt128.div_plus_multiple", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.op_Division", "FStar.Mul.op_Star", "FStar.UInt128.mul_div_cancel", "FStar.UInt128.div_product", "Prims.op_Addition" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 div_add_small: n:nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (k1*m / (k1*k2) == (n + k1*m) / (k1*k2)))
[]
FStar.UInt128.div_add_small
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> m: Prims.nat -> k1: Prims.pos -> k2: Prims.pos -> FStar.Pervasives.Lemma (requires n < k1) (ensures k1 * m / (k1 * k2) == (n + k1 * m) / (k1 * k2))
{ "end_col": 26, "end_line": 576, "start_col": 2, "start_line": 572 }
Prims.Tot
val carry_uint64_ok (a b: uint_t 64) : squash (int2bv (carry_uint64 a b) == carry_bv a b)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let carry_uint64_ok (a b:uint_t 64) : squash (int2bv (carry_uint64 a b) == carry_bv a b) = _ by (T.norm [delta_only [`%carry_uint64]; unascribe]; let open FStar.Tactics.BV in mapply (`trans); arith_to_bv_tac (); arith_to_bv_tac (); T.norm [delta_only [`%carry_bv]]; ...
val carry_uint64_ok (a b: uint_t 64) : squash (int2bv (carry_uint64 a b) == carry_bv a b) let carry_uint64_ok (a b: uint_t 64) : squash (int2bv (carry_uint64 a b) == carry_bv a b) =
false
null
true
FStar.Tactics.Effect.synth_by_tactic (fun _ -> (T.norm [delta_only [`%carry_uint64]; unascribe]; let open FStar.Tactics.BV in mapply (`trans); arith_to_bv_tac (); arith_to_bv_tac (); T.norm [delta_only [`%carry_bv]]; trefl ()))
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt.uint_t", "Prims.squash", "Prims.eq2", "FStar.BV.bv_t", "FStar.BV.int2bv", "FStar.UInt128.carry_uint64", "FStar.UInt128.carry_bv" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 carry_uint64_ok (a b: uint_t 64) : squash (int2bv (carry_uint64 a b) == carry_bv a b)
[]
FStar.UInt128.carry_uint64_ok
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> b: FStar.UInt.uint_t 64 -> Prims.squash (FStar.BV.int2bv (FStar.UInt128.carry_uint64 a b) == FStar.UInt128.carry_bv a b)
{ "end_col": 18, "end_line": 65, "start_col": 4, "start_line": 59 }
FStar.Pervasives.Lemma
val mod_mul_pow2 : n:nat -> e1:nat -> e2:nat -> Lemma (n % pow2 e1 * pow2 e2 <= pow2 (e1+e2) - pow2 e2)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mod_mul_pow2 n e1 e2 = Math.lemma_mod_lt n (pow2 e1); Math.lemma_mult_le_right (pow2 e2) (n % pow2 e1) (pow2 e1 - 1); assert (n % pow2 e1 * pow2 e2 <= pow2 e1 * pow2 e2 - pow2 e2); Math.pow2_plus e1 e2
val mod_mul_pow2 : n:nat -> e1:nat -> e2:nat -> Lemma (n % pow2 e1 * pow2 e2 <= pow2 (e1+e2) - pow2 e2) let mod_mul_pow2 n e1 e2 =
false
null
true
Math.lemma_mod_lt n (pow2 e1); Math.lemma_mult_le_right (pow2 e2) (n % pow2 e1) (pow2 e1 - 1); assert ((n % pow2 e1) * pow2 e2 <= pow2 e1 * pow2 e2 - pow2 e2); Math.pow2_plus e1 e2
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "FStar.Math.Lemmas.pow2_plus", "Prims.unit", "Prims._assert", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.Mul.op_Star", "Prims.op_Modulus", "Prims.pow2", "Prims.op_Subtraction", "FStar.Math.Lemmas.lemma_mult_le_right", "FStar.Math.Lemmas.lemma_mod_lt" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 mod_mul_pow2 : n:nat -> e1:nat -> e2:nat -> Lemma (n % pow2 e1 * pow2 e2 <= pow2 (e1+e2) - pow2 e2)
[]
FStar.UInt128.mod_mul_pow2
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> e1: Prims.nat -> e2: Prims.nat -> FStar.Pervasives.Lemma (ensures (n % Prims.pow2 e1) * Prims.pow2 e2 <= Prims.pow2 (e1 + e2) - Prims.pow2 e2)
{ "end_col": 22, "end_line": 536, "start_col": 2, "start_line": 533 }
Prims.Tot
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mul_wide_high (x y: U64.t) = phh x y + (phl x y + pll_h x y) / pow2 32 + (plh x y + (phl x y + pll_h x y) % pow2 32) / pow2 32
let mul_wide_high (x y: U64.t) =
false
null
false
phh x y + (phl x y + pll_h x y) / pow2 32 + (plh x y + (phl x y + pll_h x y) % pow2 32) / pow2 32
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt64.t", "Prims.op_Addition", "FStar.UInt128.phh", "Prims.op_Division", "FStar.UInt128.phl", "FStar.UInt128.pll_h", "Prims.pow2", "FStar.UInt128.plh", "Prims.op_Modulus", "Prims.int" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
true
FStar.UInt128.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 mul_wide_high : x: FStar.UInt64.t -> y: FStar.UInt64.t -> Prims.int
[]
FStar.UInt128.mul_wide_high
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt64.t -> y: FStar.UInt64.t -> Prims.int
{ "end_col": 57, "end_line": 995, "start_col": 2, "start_line": 993 }
Prims.Tot
val uint64_to_uint128: a:U64.t -> b:t{v b == U64.v a}
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let uint64_to_uint128 (a:U64.t) = { low = a; high = U64.uint_to_t 0; }
val uint64_to_uint128: a:U64.t -> b:t{v b == U64.v a} let uint64_to_uint128 (a: U64.t) =
false
null
false
{ low = a; high = U64.uint_to_t 0 }
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt64.t", "FStar.UInt128.Mkuint128", "FStar.UInt64.uint_to_t", "FStar.UInt128.t", "Prims.eq2", "Prims.int", "Prims.l_or", "FStar.UInt.size", "FStar.UInt128.n", "FStar.UInt64.n", "FStar.UInt128.v", "FStar.UInt64.v" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 uint64_to_uint128: a:U64.t -> b:t{v b == U64.v a}
[]
FStar.UInt128.uint64_to_uint128
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt64.t -> b: FStar.UInt128.t{FStar.UInt128.v b == FStar.UInt64.v a}
{ "end_col": 68, "end_line": 894, "start_col": 36, "start_line": 894 }
FStar.Pervasives.Lemma
val product_bound (a b: nat) (k: pos) : Lemma (requires (a < k /\ b < k)) (ensures a * b <= k * k - 2 * k + 1)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let product_bound (a b:nat) (k:pos) : Lemma (requires (a < k /\ b < k)) (ensures a * b <= k * k - 2*k + 1) = Math.lemma_mult_le_right b a (k-1); Math.lemma_mult_le_left (k-1) b (k-1)
val product_bound (a b: nat) (k: pos) : Lemma (requires (a < k /\ b < k)) (ensures a * b <= k * k - 2 * k + 1) let product_bound (a b: nat) (k: pos) : Lemma (requires (a < k /\ b < k)) (ensures a * b <= k * k - 2 * k + 1) =
false
null
true
Math.lemma_mult_le_right b a (k - 1); Math.lemma_mult_le_left (k - 1) b (k - 1)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.pos", "FStar.Math.Lemmas.lemma_mult_le_left", "Prims.op_Subtraction", "Prims.unit", "FStar.Math.Lemmas.lemma_mult_le_right", "Prims.l_and", "Prims.b2t", "Prims.op_LessThan", "Prims.squash", "Prims.op_LessThanOrEqual", "FStar.Mul.op_Star", "Prims.op_Addition", "Prims.Nil...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 product_bound (a b: nat) (k: pos) : Lemma (requires (a < k /\ b < k)) (ensures a * b <= k * k - 2 * k + 1)
[]
FStar.UInt128.product_bound
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Prims.nat -> b: Prims.nat -> k: Prims.pos -> FStar.Pervasives.Lemma (requires a < k /\ b < k) (ensures a * b <= k * k - 2 * k + 1)
{ "end_col": 39, "end_line": 927, "start_col": 2, "start_line": 926 }
Prims.Pure
val add: a:t -> b:t -> Pure t (requires (size (v a + v b) n)) (ensures (fun c -> v a + v b = v c))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let add (a b: t) : Pure t (requires (v a + v b < pow2 128)) (ensures (fun r -> v a + v b = v r)) = let l = U64.add_mod a.low b.low in carry_sum_ok a.low b.low; { low = l; high = U64.add (U64.add a.high b.high) (carry l b.low); }
val add: a:t -> b:t -> Pure t (requires (size (v a + v b) n)) (ensures (fun c -> v a + v b = v c)) let add (a b: t) : Pure t (requires (v a + v b < pow2 128)) (ensures (fun r -> v a + v b = v r)) =
false
null
false
let l = U64.add_mod a.low b.low in carry_sum_ok a.low b.low; { low = l; high = U64.add (U64.add a.high b.high) (carry l b.low) }
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt128.t", "FStar.UInt128.Mkuint128", "FStar.UInt64.add", "FStar.UInt128.__proj__Mkuint128__item__high", "FStar.UInt128.carry", "FStar.UInt128.__proj__Mkuint128__item__low", "Prims.unit", "FStar.UInt128.carry_sum_ok", "FStar.UInt64.t", "FStar.UInt64.add_mod", "Prims.b2t", "Prims.op_Les...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 add: a:t -> b:t -> Pure t (requires (size (v a + v b) n)) (ensures (fun c -> v a + v b = v c))
[]
FStar.UInt128.add
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> b: FStar.UInt128.t -> Prims.Pure FStar.UInt128.t
{ "end_col": 61, "end_line": 187, "start_col": 40, "start_line": 183 }
Prims.Pure
val eq (a:t) (b:t) : Pure bool (requires True) (ensures (fun r -> r == eq #n (v a) (v b)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let eq (a b:t) = U64.eq a.low b.low && U64.eq a.high b.high
val eq (a:t) (b:t) : Pure bool (requires True) (ensures (fun r -> r == eq #n (v a) (v b))) let eq (a b: t) =
false
null
false
U64.eq a.low b.low && U64.eq a.high b.high
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt128.t", "Prims.op_AmpAmp", "FStar.UInt64.eq", "FStar.UInt128.__proj__Mkuint128__item__low", "FStar.UInt128.__proj__Mkuint128__item__high", "Prims.bool" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 eq (a:t) (b:t) : Pure bool (requires True) (ensures (fun r -> r == eq #n (v a) (v b)))
[]
FStar.UInt128.eq
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> b: FStar.UInt128.t -> Prims.Pure Prims.bool
{ "end_col": 59, "end_line": 807, "start_col": 17, "start_line": 807 }
Prims.Pure
val logxor: a:t -> b:t -> Pure t (requires True) (ensures (fun r -> v r == logxor (v a) (v b)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let logxor (a b: t) : Pure t (requires True) (ensures (fun r -> v r = UInt.logxor #128 (v a) (v b))) = let r = { low = U64.logxor a.low b.low; high = U64.logxor a.high b.high } in to_vec_v r; assert (vec128 r == Seq.append (vec64 r.high) (vec64 r.low)); logxor_vec_append (vec64 a.high) (vec64 b.high) (v...
val logxor: a:t -> b:t -> Pure t (requires True) (ensures (fun r -> v r == logxor (v a) (v b))) let logxor (a b: t) : Pure t (requires True) (ensures (fun r -> v r = UInt.logxor #128 (v a) (v b))) =
false
null
false
let r = { low = U64.logxor a.low b.low; high = U64.logxor a.high b.high } in to_vec_v r; assert (vec128 r == Seq.append (vec64 r.high) (vec64 r.low)); logxor_vec_append (vec64 a.high) (vec64 b.high) (vec64 a.low) (vec64 b.low); to_vec_v a; to_vec_v b; assert (vec128 r == BV.logxor_vec (vec128 a) (vec128 b)); r
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt128.t", "Prims.unit", "Prims._assert", "Prims.eq2", "FStar.BitVector.bv_t", "FStar.UInt128.vec128", "FStar.BitVector.logxor_vec", "FStar.UInt128.to_vec_v", "FStar.UInt128.logxor_vec_append", "FStar.UInt128.vec64", "FStar.UInt128.__proj__Mkuint128__item__high", "FStar.UInt128.__proj_...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 logxor: a:t -> b:t -> Pure t (requires True) (ensures (fun r -> v r == logxor (v a) (v b)))
[]
FStar.UInt128.logxor
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> b: FStar.UInt128.t -> Prims.Pure FStar.UInt128.t
{ "end_col": 3, "end_line": 435, "start_col": 59, "start_line": 425 }
FStar.Pervasives.Lemma
val to_vec_append : #n1:nat{n1 > 0} -> #n2:nat{n2 > 0} -> num1:UInt.uint_t n1 -> num2:UInt.uint_t n2 -> Lemma (UInt.to_vec (append_uint num1 num2) == Seq.append (UInt.to_vec num2) (UInt.to_vec num1))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let to_vec_append #n1 #n2 num1 num2 = UInt.append_lemma (UInt.to_vec num2) (UInt.to_vec num1)
val to_vec_append : #n1:nat{n1 > 0} -> #n2:nat{n2 > 0} -> num1:UInt.uint_t n1 -> num2:UInt.uint_t n2 -> Lemma (UInt.to_vec (append_uint num1 num2) == Seq.append (UInt.to_vec num2) (UInt.to_vec num1)) let to_vec_append #n1 #n2 num1 num2 =
false
null
true
UInt.append_lemma (UInt.to_vec num2) (UInt.to_vec num1)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.b2t", "Prims.op_GreaterThan", "FStar.UInt.uint_t", "FStar.UInt.append_lemma", "FStar.UInt.to_vec", "Prims.unit" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 to_vec_append : #n1:nat{n1 > 0} -> #n2:nat{n2 > 0} -> num1:UInt.uint_t n1 -> num2:UInt.uint_t n2 -> Lemma (UInt.to_vec (append_uint num1 num2) == Seq.append (UInt.to_vec num2) (UInt.to_vec num1))
[]
FStar.UInt128.to_vec_append
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
num1: FStar.UInt.uint_t n1 -> num2: FStar.UInt.uint_t n2 -> FStar.Pervasives.Lemma (ensures FStar.UInt.to_vec (FStar.UInt128.append_uint num1 num2) == FStar.Seq.Base.append (FStar.UInt.to_vec num2) (FStar.UInt.to_vec num1))
{ "end_col": 57, "end_line": 386, "start_col": 2, "start_line": 386 }
FStar.Pervasives.Lemma
val u128_div_pow2 (a: t) (s:nat{s < 64}) : Lemma (v a / pow2 s == U64.v a.low / pow2 s + U64.v a.high * pow2 (64 - s))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u128_div_pow2 a s = Math.pow2_plus (64-s) s; Math.paren_mul_right (U64.v a.high) (pow2 (64-s)) (pow2 s); Math.division_addition_lemma (U64.v a.low) (pow2 s) (U64.v a.high * pow2 (64 - s))
val u128_div_pow2 (a: t) (s:nat{s < 64}) : Lemma (v a / pow2 s == U64.v a.low / pow2 s + U64.v a.high * pow2 (64 - s)) let u128_div_pow2 a s =
false
null
true
Math.pow2_plus (64 - s) s; Math.paren_mul_right (U64.v a.high) (pow2 (64 - s)) (pow2 s); Math.division_addition_lemma (U64.v a.low) (pow2 s) (U64.v a.high * pow2 (64 - s))
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt128.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.Math.Lemmas.division_addition_lemma", "FStar.UInt64.v", "FStar.UInt128.__proj__Mkuint128__item__low", "Prims.pow2", "FStar.Mul.op_Star", "FStar.UInt128.__proj__Mkuint128__item__high", "Prims.op_Subtraction", "Prims.unit",...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u128_div_pow2 (a: t) (s:nat{s < 64}) : Lemma (v a / pow2 s == U64.v a.low / pow2 s + U64.v a.high * pow2 (64 - s))
[]
FStar.UInt128.u128_div_pow2
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: Prims.nat{s < 64} -> FStar.Pervasives.Lemma (ensures FStar.UInt128.v a / Prims.pow2 s == FStar.UInt64.v (Mkuint128?.low a) / Prims.pow2 s + FStar.UInt64.v (Mkuint128?.high a) * Prims.pow2 (64 - s))
{ "end_col": 84, "end_line": 771, "start_col": 2, "start_line": 769 }
FStar.Pervasives.Lemma
val u64_pow2_bound (a: UInt.uint_t 64) (s: nat) : Lemma (a * pow2 s < pow2 (64 + s))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u64_pow2_bound (a: UInt.uint_t 64) (s: nat) : Lemma (a * pow2 s < pow2 (64+s)) = Math.pow2_plus 64 s; Math.lemma_mult_le_right (pow2 s) a (pow2 64)
val u64_pow2_bound (a: UInt.uint_t 64) (s: nat) : Lemma (a * pow2 s < pow2 (64 + s)) let u64_pow2_bound (a: UInt.uint_t 64) (s: nat) : Lemma (a * pow2 s < pow2 (64 + s)) =
false
null
true
Math.pow2_plus 64 s; Math.lemma_mult_le_right (pow2 s) a (pow2 64)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt.uint_t", "Prims.nat", "FStar.Math.Lemmas.lemma_mult_le_right", "Prims.pow2", "Prims.unit", "FStar.Math.Lemmas.pow2_plus", "Prims.l_True", "Prims.squash", "Prims.b2t", "Prims.op_LessThan", "FStar.Mul.op_Star", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u64_pow2_bound (a: UInt.uint_t 64) (s: nat) : Lemma (a * pow2 s < pow2 (64 + s))
[]
FStar.UInt128.u64_pow2_bound
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t 64 -> s: Prims.nat -> FStar.Pervasives.Lemma (ensures a * Prims.pow2 s < Prims.pow2 (64 + s))
{ "end_col": 47, "end_line": 651, "start_col": 2, "start_line": 650 }
FStar.Pervasives.Lemma
val add_mod_small: n: nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (n + (k1 * m) % (k1 * k2) == (n + k1 * m) % (k1 * k2)))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let add_mod_small n m k1 k2 = mod_spec (k1 * m) (k1 * k2); mod_spec (n + k1 * m) (k1 * k2); div_add_small n m k1 k2
val add_mod_small: n: nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (n + (k1 * m) % (k1 * k2) == (n + k1 * m) % (k1 * k2))) let add_mod_small n m k1 k2 =
false
null
true
mod_spec (k1 * m) (k1 * k2); mod_spec (n + k1 * m) (k1 * k2); div_add_small n m k1 k2
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.pos", "FStar.UInt128.div_add_small", "Prims.unit", "FStar.UInt128.mod_spec", "Prims.op_Addition", "FStar.Mul.op_Star" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 add_mod_small: n: nat -> m:nat -> k1:pos -> k2:pos -> Lemma (requires (n < k1)) (ensures (n + (k1 * m) % (k1 * k2) == (n + k1 * m) % (k1 * k2)))
[]
FStar.UInt128.add_mod_small
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> m: Prims.nat -> k1: Prims.pos -> k2: Prims.pos -> FStar.Pervasives.Lemma (requires n < k1) (ensures n + k1 * m % (k1 * k2) == (n + k1 * m) % (k1 * k2))
{ "end_col": 25, "end_line": 585, "start_col": 2, "start_line": 583 }
FStar.Pervasives.Lemma
val div_pow2_diff: a:nat -> n1:nat -> n2:nat{n2 <= n1} -> Lemma (requires True) (ensures (a / pow2 (n1 - n2) == a * pow2 n2 / pow2 n1))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let div_pow2_diff a n1 n2 = Math.pow2_plus n2 (n1-n2); assert (a * pow2 n2 / pow2 n1 == a * pow2 n2 / (pow2 n2 * pow2 (n1 - n2))); div_product (a * pow2 n2) (pow2 n2) (pow2 (n1-n2)); mul_div_cancel a (pow2 n2)
val div_pow2_diff: a:nat -> n1:nat -> n2:nat{n2 <= n1} -> Lemma (requires True) (ensures (a / pow2 (n1 - n2) == a * pow2 n2 / pow2 n1)) let div_pow2_diff a n1 n2 =
false
null
true
Math.pow2_plus n2 (n1 - n2); assert (a * pow2 n2 / pow2 n1 == a * pow2 n2 / (pow2 n2 * pow2 (n1 - n2))); div_product (a * pow2 n2) (pow2 n2) (pow2 (n1 - n2)); mul_div_cancel a (pow2 n2)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.b2t", "Prims.op_LessThanOrEqual", "FStar.UInt128.mul_div_cancel", "Prims.pow2", "Prims.unit", "FStar.UInt128.div_product", "FStar.Mul.op_Star", "Prims.op_Subtraction", "Prims._assert", "Prims.eq2", "Prims.int", "Prims.op_Division", "FStar.Math.Lemmas.pow2_plus" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 div_pow2_diff: a:nat -> n1:nat -> n2:nat{n2 <= n1} -> Lemma (requires True) (ensures (a / pow2 (n1 - n2) == a * pow2 n2 / pow2 n1))
[]
FStar.UInt128.div_pow2_diff
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: Prims.nat -> n1: Prims.nat -> n2: Prims.nat{n2 <= n1} -> FStar.Pervasives.Lemma (ensures a / Prims.pow2 (n1 - n2) == a * Prims.pow2 n2 / Prims.pow2 n1)
{ "end_col": 28, "end_line": 528, "start_col": 2, "start_line": 525 }
FStar.Pervasives.Lemma
val shift_t_mod_val' (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + U64.v a.high * pow2 (64 + s) % pow2 128)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_t_mod_val' (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + U64.v a.high * pow2 (64+s) % pow2 128) = let a_l = U64.v a.low in let a_h = U64.v a.high in u64_pow2_bound a_l s; mul_mod_bound a_h (64+s) 128; // assert (a_h * pow2 (64+s) % pow2 128 <= pow2 12...
val shift_t_mod_val' (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + U64.v a.high * pow2 (64 + s) % pow2 128) let shift_t_mod_val' (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + U64.v a.high * pow2 (64 + s) % pow2 128) =
false
null
true
let a_l = U64.v a.low in let a_h = U64.v a.high in u64_pow2_bound a_l s; mul_mod_bound a_h (64 + s) 128; add_lt_le (a_l * pow2 s) (pow2 (64 + s)) (a_h * pow2 (64 + s) % pow2 128) (pow2 128 - pow2 (64 + s)); add_mod_small' (a_l * pow2 s) (a_h * pow2 (64 + s)) (pow2 128); shift_t_val a s; ()
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt128.t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.unit", "FStar.UInt128.shift_t_val", "FStar.UInt128.add_mod_small'", "FStar.Mul.op_Star", "Prims.pow2", "Prims.op_Addition", "FStar.UInt128.add_lt_le", "Prims.op_Modulus", "Prims.op_Subtraction", "FStar.UInt128.mul_mod...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_t_mod_val' (a: t) (s: nat{s < 64}) : Lemma ((v a * pow2 s) % pow2 128 == U64.v a.low * pow2 s + U64.v a.high * pow2 (64 + s) % pow2 128)
[]
FStar.UInt128.shift_t_mod_val'
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: Prims.nat{s < 64} -> FStar.Pervasives.Lemma (ensures FStar.UInt128.v a * Prims.pow2 s % Prims.pow2 128 == FStar.UInt64.v (Mkuint128?.low a) * Prims.pow2 s + FStar.UInt64.v (Mkuint128?.high a) * Prims.pow2 (64 + s) % Prims.pow2 128)
{ "end_col": 4, "end_line": 664, "start_col": 71, "start_line": 655 }
FStar.Pervasives.Lemma
val mod_spec_multiply : n:nat -> k:pos -> Lemma ((n - n%k) / k * k == n - n%k)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mod_spec_multiply n k = Math.lemma_mod_spec2 n k
val mod_spec_multiply : n:nat -> k:pos -> Lemma ((n - n%k) / k * k == n - n%k) let mod_spec_multiply n k =
false
null
true
Math.lemma_mod_spec2 n k
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.nat", "Prims.pos", "FStar.Math.Lemmas.lemma_mod_spec2", "Prims.unit" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 mod_spec_multiply : n:nat -> k:pos -> Lemma ((n - n%k) / k * k == n - n%k)
[]
FStar.UInt128.mod_spec_multiply
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
n: Prims.nat -> k: Prims.pos -> FStar.Pervasives.Lemma (ensures ((n - n % k) / k) * k == n - n % k)
{ "end_col": 26, "end_line": 1135, "start_col": 2, "start_line": 1135 }
Prims.Pure
val u32_combine' (hi lo: U64.t) : Pure U64.t (requires (U64.v lo < pow2 32)) (ensures (fun r -> U64.v r = U64.v hi * pow2 32 % pow2 64 + U64.v lo))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let u32_combine' (hi lo: U64.t) : Pure U64.t (requires (U64.v lo < pow2 32)) (ensures (fun r -> U64.v r = U64.v hi * pow2 32 % pow2 64 + U64.v lo)) = U64.add lo (U64.shift_left hi u32_32)
val u32_combine' (hi lo: U64.t) : Pure U64.t (requires (U64.v lo < pow2 32)) (ensures (fun r -> U64.v r = U64.v hi * pow2 32 % pow2 64 + U64.v lo)) let u32_combine' (hi lo: U64.t) : Pure U64.t (requires (U64.v lo < pow2 32)) (ensures (fun r -> U64.v r = U64.v hi * pow2 32 % pow2 64 + U64...
false
null
false
U64.add lo (U64.shift_left hi u32_32)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt64.t", "FStar.UInt64.add", "FStar.UInt64.shift_left", "FStar.UInt128.u32_32", "Prims.b2t", "Prims.op_LessThan", "FStar.UInt64.v", "Prims.pow2", "Prims.op_Equality", "Prims.int", "Prims.op_Addition", "Prims.op_Modulus", "FStar.Mul.op_Star" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 u32_combine' (hi lo: U64.t) : Pure U64.t (requires (U64.v lo < pow2 32)) (ensures (fun r -> U64.v r = U64.v hi * pow2 32 % pow2 64 + U64.v lo))
[]
FStar.UInt128.u32_combine'
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
hi: FStar.UInt64.t -> lo: FStar.UInt64.t -> Prims.Pure FStar.UInt64.t
{ "end_col": 39, "end_line": 1024, "start_col": 2, "start_line": 1024 }
FStar.Pervasives.Lemma
val product_low_expand (x y: U64.t) : Lemma ((U64.v x * U64.v y) % pow2 64 == ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) % pow2 64)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let product_low_expand (x y: U64.t) : Lemma ((U64.v x * U64.v y) % pow2 64 == ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) % pow2 64) = product_expand x y; Math.lemma_mod_plus ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) (phh x y) (pow2 64)
val product_low_expand (x y: U64.t) : Lemma ((U64.v x * U64.v y) % pow2 64 == ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) % pow2 64) let product_low_expand (x y: U64.t) : Lemma ((U64.v x * U64.v y) % pow2 64 == ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) % pow2 64) =
false
null
true
product_expand x y; Math.lemma_mod_plus ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) (phh x y) (pow2 64)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.Math.Lemmas.lemma_mod_plus", "Prims.op_Addition", "FStar.Mul.op_Star", "FStar.UInt128.plh", "FStar.UInt128.phl", "FStar.UInt128.pll_h", "Prims.pow2", "FStar.UInt128.pll_l", "FStar.UInt128.phh", "Prims.unit", "FStar.UInt128.product_expand", "Prims.l_True", "Prims.sq...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 product_low_expand (x y: U64.t) : Lemma ((U64.v x * U64.v y) % pow2 64 == ((plh x y + phl x y + pll_h x y) * pow2 32 + pll_l x y) % pow2 64)
[]
FStar.UInt128.product_low_expand
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt64.t -> y: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.v x * FStar.UInt64.v y % Prims.pow2 64 == ((FStar.UInt128.plh x y + FStar.UInt128.phl x y + FStar.UInt128.pll_h x y) * Prims.pow2 32 + FStar.UInt128.pll_l x y) % Prims.pow2 64)
{ "end_col": 97, "end_line": 1083, "start_col": 2, "start_line": 1082 }
FStar.Pervasives.Lemma
val int2bv_ult (#n: pos) (a b: uint_t n) : Lemma (ensures a < b <==> bvult #n (int2bv #n a) (int2bv #n b))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let int2bv_ult (#n: pos) (a b: uint_t n) : Lemma (ensures a < b <==> bvult #n (int2bv #n a) (int2bv #n b)) = introduce (a < b) ==> (bvult #n (int2bv #n a) (int2bv #n b)) with _ . FStar.BV.int2bv_lemma_ult_1 a b; introduce (bvult #n (int2bv #n a) (int2bv #n b)) ==> (a < b) with _ . FStar.BV.int2bv_lemma_...
val int2bv_ult (#n: pos) (a b: uint_t n) : Lemma (ensures a < b <==> bvult #n (int2bv #n a) (int2bv #n b)) let int2bv_ult (#n: pos) (a b: uint_t n) : Lemma (ensures a < b <==> bvult #n (int2bv #n a) (int2bv #n b)) =
false
null
true
introduce (a < b) ==> (bvult #n (int2bv #n a) (int2bv #n b)) with _. FStar.BV.int2bv_lemma_ult_1 a b; introduce (bvult #n (int2bv #n a) (int2bv #n b)) ==> (a < b) with _. FStar.BV.int2bv_lemma_ult_2 a b
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "Prims.pos", "FStar.UInt.uint_t", "FStar.Classical.Sugar.implies_intro", "Prims.b2t", "FStar.BV.bvult", "FStar.BV.int2bv", "Prims.squash", "Prims.op_LessThan", "FStar.BV.int2bv_lemma_ult_2", "Prims.unit", "FStar.BV.int2bv_lemma_ult_1", "Prims.l_True", "Prims.l_iff", "Prims.Nil", "FStar.P...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 int2bv_ult (#n: pos) (a b: uint_t n) : Lemma (ensures a < b <==> bvult #n (int2bv #n a) (int2bv #n b))
[]
FStar.UInt128.int2bv_ult
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> FStar.Pervasives.Lemma (ensures a < b <==> FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b))
{ "end_col": 44, "end_line": 88, "start_col": 4, "start_line": 85 }
Prims.Tot
val uint128_to_uint64: a:t -> b:U64.t{U64.v b == v a % pow2 64}
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let uint128_to_uint64 (a:t) : b:U64.t{U64.v b == v a % pow2 64} = a.low
val uint128_to_uint64: a:t -> b:U64.t{U64.v b == v a % pow2 64} let uint128_to_uint64 (a: t) : b: U64.t{U64.v b == v a % pow2 64} =
false
null
false
a.low
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt128.t", "FStar.UInt128.__proj__Mkuint128__item__low", "FStar.UInt64.t", "Prims.eq2", "Prims.int", "FStar.UInt64.v", "Prims.op_Modulus", "FStar.UInt128.v", "Prims.pow2" ]
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 uint128_to_uint64: a:t -> b:U64.t{U64.v b == v a % pow2 64}
[]
FStar.UInt128.uint128_to_uint64
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> b: FStar.UInt64.t{FStar.UInt64.v b == FStar.UInt128.v a % Prims.pow2 64}
{ "end_col": 71, "end_line": 896, "start_col": 66, "start_line": 896 }
Prims.Pure
val shift_left_small (a: t) (s: U32.t) : Pure t (requires (U32.v s < 64)) (ensures (fun r -> v r = (v a * pow2 (U32.v s)) % pow2 128))
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_left_small (a: t) (s: U32.t) : Pure t (requires (U32.v s < 64)) (ensures (fun r -> v r = (v a * pow2 (U32.v s)) % pow2 128)) = if U32.eq s 0ul then a else let r = { low = U64.shift_left a.low s; high = add_u64_shift_left_respec a.high a.low s; } in let s = U32.v s in let a_l ...
val shift_left_small (a: t) (s: U32.t) : Pure t (requires (U32.v s < 64)) (ensures (fun r -> v r = (v a * pow2 (U32.v s)) % pow2 128)) let shift_left_small (a: t) (s: U32.t) : Pure t (requires (U32.v s < 64)) (ensures (fun r -> v r = (v a * pow2 (U32.v s)) % pow2 128)) =
false
null
false
if U32.eq s 0ul then a else let r = { low = U64.shift_left a.low s; high = add_u64_shift_left_respec a.high a.low s } in let s = U32.v s in let a_l = U64.v a.low in let a_h = U64.v a.high in mod_spec_rew_n (a_l * pow2 s) (pow2 64); shift_t_mod_val a s; r
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[]
[ "FStar.UInt128.t", "FStar.UInt32.t", "FStar.UInt32.eq", "FStar.UInt32.__uint_to_t", "Prims.bool", "Prims.unit", "FStar.UInt128.shift_t_mod_val", "FStar.UInt128.mod_spec_rew_n", "FStar.Mul.op_Star", "Prims.pow2", "FStar.UInt.uint_t", "FStar.UInt64.v", "FStar.UInt128.__proj__Mkuint128__item__h...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_left_small (a: t) (s: U32.t) : Pure t (requires (U32.v s < 64)) (ensures (fun r -> v r = (v a * pow2 (U32.v s)) % pow2 128))
[]
FStar.UInt128.shift_left_small
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt128.t
{ "end_col": 5, "end_line": 689, "start_col": 2, "start_line": 680 }
FStar.Pervasives.Lemma
val product_high32 : x:U64.t -> y:U64.t -> Lemma ((U64.v x * U64.v y) / pow2 32 == phh x y * pow2 32 + plh x y + phl x y + pll_h x y)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let product_high32 x y = Math.pow2_plus 32 32; product_expand x y; Math.division_addition_lemma (plh x y + phl x y + pll_h x y) (pow2 32) (phh x y * pow2 32); mul_div_cancel (phh x y * pow2 32) (pow2 32); mul_div_cancel (plh x y + phl x y + pll_h x y) (pow2 32); Math.small_division_lemma_1 (pll_l x y) (pow2...
val product_high32 : x:U64.t -> y:U64.t -> Lemma ((U64.v x * U64.v y) / pow2 32 == phh x y * pow2 32 + plh x y + phl x y + pll_h x y) let product_high32 x y =
false
null
true
Math.pow2_plus 32 32; product_expand x y; Math.division_addition_lemma (plh x y + phl x y + pll_h x y) (pow2 32) (phh x y * pow2 32); mul_div_cancel (phh x y * pow2 32) (pow2 32); mul_div_cancel (plh x y + phl x y + pll_h x y) (pow2 32); Math.small_division_lemma_1 (pll_l x y) (pow2 32)
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.Math.Lemmas.small_division_lemma_1", "FStar.UInt128.pll_l", "Prims.pow2", "Prims.unit", "FStar.UInt128.mul_div_cancel", "Prims.op_Addition", "FStar.UInt128.plh", "FStar.UInt128.phl", "FStar.UInt128.pll_h", "FStar.Mul.op_Star", "FStar.UInt128.phh", "FStar.Math.Lemmas....
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 product_high32 : x:U64.t -> y:U64.t -> Lemma ((U64.v x * U64.v y) / pow2 32 == phh x y * pow2 32 + plh x y + phl x y + pll_h x y)
[]
FStar.UInt128.product_high32
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt64.t -> y: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt64.v x * FStar.UInt64.v y / Prims.pow2 32 == FStar.UInt128.phh x y * Prims.pow2 32 + FStar.UInt128.plh x y + FStar.UInt128.phl x y + FStar.UInt128.pll_h x y)
{ "end_col": 51, "end_line": 1117, "start_col": 2, "start_line": 1112 }
Prims.Tot
val shift_left_large : a:t -> s:U32.t{U32.v s >= 64 /\ U32.v s < 128} -> r:t{v r = (v a * pow2 (U32.v s)) % pow2 128}
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_left_large a s = let h_shift = U32.sub s u32_64 in assert (U32.v h_shift < 64); let r = { low = U64.uint_to_t 0; high = U64.shift_left a.low h_shift; } in assert (U64.v r.high == (U64.v a.low * pow2 (U32.v s - 64)) % pow2 64); mod_mul (U64.v a.low * pow2 (U32.v s - 64)) (pow2 64) (pow2 6...
val shift_left_large : a:t -> s:U32.t{U32.v s >= 64 /\ U32.v s < 128} -> r:t{v r = (v a * pow2 (U32.v s)) % pow2 128} let shift_left_large a s =
false
null
false
let h_shift = U32.sub s u32_64 in assert (U32.v h_shift < 64); let r = { low = U64.uint_to_t 0; high = U64.shift_left a.low h_shift } in assert (U64.v r.high == (U64.v a.low * pow2 (U32.v s - 64)) % pow2 64); mod_mul (U64.v a.low * pow2 (U32.v s - 64)) (pow2 64) (pow2 64); Math.pow2_plus (U32.v s - 64) 64; assert (U64....
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "total" ]
[ "FStar.UInt128.t", "FStar.UInt32.t", "Prims.l_and", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "FStar.UInt32.v", "Prims.op_LessThan", "Prims.unit", "FStar.UInt128.shift_left_large_lemma_t", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Mul.op_Star", "FStar.UInt64.v", "FStar.UInt128....
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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": 5, "quake_keep": false, "quake_lo": 1, "retry": true, "reuse_hint_for": null, "smtencoding_eli...
null
val shift_left_large : a:t -> s:U32.t{U32.v s >= 64 /\ U32.v s < 128} -> r:t{v r = (v a * pow2 (U32.v s)) % pow2 128}
[]
FStar.UInt128.shift_left_large
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a: FStar.UInt128.t -> s: FStar.UInt32.t{FStar.UInt32.v s >= 64 /\ FStar.UInt32.v s < 128} -> r: FStar.UInt128.t {FStar.UInt128.v r = FStar.UInt128.v a * Prims.pow2 (FStar.UInt32.v s) % Prims.pow2 128}
{ "end_col": 3, "end_line": 706, "start_col": 26, "start_line": 696 }
FStar.Pervasives.Lemma
val mul_wide_low_ok (x y: U64.t) : Lemma (mul_wide_low x y == (U64.v x * U64.v y) % pow2 64)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let mul_wide_low_ok (x y: U64.t) : Lemma (mul_wide_low x y == (U64.v x * U64.v y) % pow2 64) = Math.pow2_plus 32 32; mod_mul (plh x y + (phl x y + pll_h x y) % pow2 32) (pow2 32) (pow2 32); assert (mul_wide_low x y == (plh x y + (phl x y + pll_h x y) % pow2 32) % pow2 32 * pow2 32 + pll_l x y); add_...
val mul_wide_low_ok (x y: U64.t) : Lemma (mul_wide_low x y == (U64.v x * U64.v y) % pow2 64) let mul_wide_low_ok (x y: U64.t) : Lemma (mul_wide_low x y == (U64.v x * U64.v y) % pow2 64) =
false
null
true
Math.pow2_plus 32 32; mod_mul (plh x y + (phl x y + pll_h x y) % pow2 32) (pow2 32) (pow2 32); assert (mul_wide_low x y == ((plh x y + (phl x y + pll_h x y) % pow2 32) % pow2 32) * pow2 32 + pll_l x y); add_mod_then_mod (plh x y) (phl x y + pll_h x y) (pow2 32); assert (mul_wide_low x y == ((plh x y + phl x y + pll...
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt64.t", "FStar.UInt128.product_low_expand", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.UInt128.mul_wide_low", "Prims.op_Modulus", "Prims.op_Addition", "FStar.Mul.op_Star", "FStar.UInt128.plh", "FStar.UInt128.phl", "FStar.UInt128.pll_h", "Prims.pow2", "FStar...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 mul_wide_low_ok (x y: U64.t) : Lemma (mul_wide_low x y == (U64.v x * U64.v y) % pow2 64)
[]
FStar.UInt128.mul_wide_low_ok
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
x: FStar.UInt64.t -> y: FStar.UInt64.t -> FStar.Pervasives.Lemma (ensures FStar.UInt128.mul_wide_low x y == FStar.UInt64.v x * FStar.UInt64.v y % Prims.pow2 64)
{ "end_col": 24, "end_line": 1106, "start_col": 2, "start_line": 1097 }
FStar.Pervasives.Lemma
val shift_right_reconstruct : a_h:UInt.uint_t 64 -> s:nat{s < 64} -> Lemma (a_h * pow2 (64-s) == a_h / pow2 s * pow2 64 + a_h * pow2 64 / pow2 s % pow2 64)
[ { "abbrev": true, "full_module": "FStar.Tactics.BV", "short_module": "TBV" }, { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_mod...
false
let shift_right_reconstruct a_h s = mul_pow2_diff a_h 64 s; mod_spec_rew_n (a_h * pow2 (64-s)) (pow2 64); div_product_comm (a_h * pow2 64) (pow2 s) (pow2 64); mul_div_cancel a_h (pow2 64); assert (a_h / pow2 s * pow2 64 == a_h * pow2 64 / pow2 s / pow2 64 * pow2 64); ()
val shift_right_reconstruct : a_h:UInt.uint_t 64 -> s:nat{s < 64} -> Lemma (a_h * pow2 (64-s) == a_h / pow2 s * pow2 64 + a_h * pow2 64 / pow2 s % pow2 64) let shift_right_reconstruct a_h s =
false
null
true
mul_pow2_diff a_h 64 s; mod_spec_rew_n (a_h * pow2 (64 - s)) (pow2 64); div_product_comm (a_h * pow2 64) (pow2 s) (pow2 64); mul_div_cancel a_h (pow2 64); assert ((a_h / pow2 s) * pow2 64 == (a_h * pow2 64 / pow2 s / pow2 64) * pow2 64); ()
{ "checked_file": "FStar.UInt128.fst.checked", "dependencies": [ "prims.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt.fsti.checked", "FStar.Tactics.V2.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Tactics.BV.fst.checked", "FStar.Seq.f...
[ "lemma" ]
[ "FStar.UInt.uint_t", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.int", "FStar.Mul.op_Star", "Prims.op_Division", "Prims.pow2", "FStar.UInt128.mul_div_cancel", "FStar.UInt128.div_product_comm", "FStar.UInt128.mod_spec_rew_n", "Prims.op...
[]
(* Copyright 2008-2018 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 applicable law or agre...
false
false
FStar.UInt128.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 shift_right_reconstruct : a_h:UInt.uint_t 64 -> s:nat{s < 64} -> Lemma (a_h * pow2 (64-s) == a_h / pow2 s * pow2 64 + a_h * pow2 64 / pow2 s % pow2 64)
[]
FStar.UInt128.shift_right_reconstruct
{ "file_name": "ulib/FStar.UInt128.fst", "git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
a_h: FStar.UInt.uint_t 64 -> s: Prims.nat{s < 64} -> FStar.Pervasives.Lemma (ensures a_h * Prims.pow2 (64 - s) == (a_h / Prims.pow2 s) * Prims.pow2 64 + a_h * Prims.pow2 64 / Prims.pow2 s % Prims.pow2 64)
{ "end_col": 4, "end_line": 764, "start_col": 2, "start_line": 759 }