file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
DM4F.fst | DM4F.ite_wp | val ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a | val ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a | let ite_wp (#a:Type) (#st:Type0) (wpf wpg:wp st a) (b:bool) : wp st a =
fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 43,
"start_col": 0,
"start_line": 42
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | wpf: DM4F.wp st a -> wpg: DM4F.wp st a -> b: Prims.bool -> DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"DM4F.wp",
"Prims.bool",
"FStar.Pervasives.Native.tuple2",
"Prims.l_and",
"Prims.l_imp",
"Prims.b2t",
"Prims.l_not",
"Prims.logical"
] | [] | false | false | false | true | false | let ite_wp (#a: Type) (#st: Type0) (wpf wpg: wp st a) (b: bool) : wp st a =
| fun s0 p -> (b ==> wpf s0 p) /\ ((~b) ==> wpg s0 p) | false |
DM4F.fst | DM4F.lift_pure_st | val lift_pure_st (a wp st: _) (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) | val lift_pure_st (a wp st: _) (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) | let lift_pure_st a wp st (f : unit -> PURE a wp)
: repr a st (lift_wp wp)
= elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 88,
"start_col": 0,
"start_line": 85
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | a: Type -> wp: Prims.pure_wp a -> st: Type0 -> f: (_: Prims.unit -> Prims.PURE a)
-> DM4F.repr a st (DM4F.lift_wp wp) | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.Monotonic.Pure.elim_pure_wp_monotonicity_forall",
"DM4F.repr",
"DM4F.lift_wp"
] | [] | false | false | false | false | false | let lift_pure_st a wp st (f: (unit -> PURE a wp)) : repr a st (lift_wp wp) =
| elim_pure_wp_monotonicity_forall ();
fun s0 -> (f (), s0) | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.point2 | val point2:lbytes 32 | val point2:lbytes 32 | let point2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe5uy; 0x21uy; 0x0fuy; 0x12uy; 0x78uy; 0x68uy; 0x11uy; 0xd3uy;
0xf4uy; 0xb7uy; 0x95uy; 0x9duy; 0x05uy; 0x38uy; 0xaeuy; 0x2cuy;
0x31uy; 0xdbuy; 0xe7uy; 0x10uy; 0x6fuy; 0xc0uy; 0x3cuy; 0x3euy;
0xfcuy; 0x4cuy; 0xd5uy; 0x49uy; 0xc7uy; 0x15uy; ... | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 57,
"start_col": 0,
"start_line": 49
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons"... | [] | false | false | false | false | false | let point2:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xe5uy; 0x21uy; 0x0fuy; 0x12uy; 0x78uy; 0x68uy; 0x11uy; 0xd3uy; 0xf4uy; 0xb7uy; 0x95uy; 0x9duy;
0x05uy; 0x38uy; 0xaeuy; 0x2cuy; 0x31uy; 0xdbuy; 0xe7uy; 0x10uy; 0x6fuy; 0xc0uy; 0x3cuy; 0x3euy;
0xfcuy; 0x4cuy; 0xd5uy; 0x49uy; 0xc7uy; 0x15uy; 0xa4uy; 0x93uy
... | false |
DM4F.fst | DM4F.bind | val bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) | val bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) | let bind (a:Type) (b:Type) (st:Type0)
(wp_c : wp st a)
(wp_f : a -> wp st b)
(c : repr a st wp_c)
(f : (x:a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f)
= fun s0 -> let (y, s1) = c s0 in
f y s1 | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 39,
"start_col": 0,
"start_line": 32
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false |
a: Type ->
b: Type ->
st: Type0 ->
wp_c: DM4F.wp st a ->
wp_f: (_: a -> DM4F.wp st b) ->
c: DM4F.repr a st wp_c ->
f: (x: a -> DM4F.repr b st (wp_f x))
-> DM4F.repr b st (DM4F.bind_wp wp_c wp_f) | Prims.Tot | [
"total"
] | [] | [
"DM4F.wp",
"DM4F.repr",
"FStar.Pervasives.Native.tuple2",
"DM4F.bind_wp"
] | [] | false | false | false | false | false | let bind
(a b: Type)
(st: Type0)
(wp_c: wp st a)
(wp_f: (a -> wp st b))
(c: repr a st wp_c)
(f: (x: a -> repr b st (wp_f x)))
: repr b st (bind_wp wp_c wp_f) =
| fun s0 ->
let y, s1 = c s0 in
f y s1 | false |
DM4F.fst | DM4F.subcomp | val subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) | val subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) | let subcomp
(a:Type)
(st:Type0)
(wpf wpg : wp st a)
(f : repr a st wpf)
: Pure (repr a st wpg)
(requires (stronger wpg wpf))
(ensures (fun _ -> True))
= f | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 70,
"start_col": 0,
"start_line": 62
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | a: Type -> st: Type0 -> wpf: DM4F.wp st a -> wpg: DM4F.wp st a -> f: DM4F.repr a st wpf
-> Prims.Pure (DM4F.repr a st wpg) | Prims.Pure | [] | [] | [
"DM4F.wp",
"DM4F.repr",
"DM4F.stronger",
"Prims.l_True"
] | [] | false | false | false | false | false | let subcomp (a: Type) (st: Type0) (wpf wpg: wp st a) (f: repr a st wpf)
: Pure (repr a st wpg) (requires (stronger wpg wpf)) (ensures (fun _ -> True)) =
| f | false |
DM4F.fst | DM4F.lift_wp | val lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a | val lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a | let lift_wp (#a:Type) (#st:Type0) (w:pure_wp a) : wp st a =
elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 83,
"start_col": 0,
"start_line": 81
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | w: Prims.pure_wp a -> DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"FStar.Pervasives.Native.tuple2",
"Prims.l_True",
"FStar.Pervasives.Native.Mktuple2",
"Prims.pure_pre",
"Prims.unit",
"FStar.Monotonic.Pure.elim_pure_wp_monotonicity_forall",
"DM4F.wp"
] | [] | false | false | false | true | false | let lift_wp (#a: Type) (#st: Type0) (w: pure_wp a) : wp st a =
| elim_pure_wp_monotonicity_forall ();
fun s0 p -> w (fun x -> p (x, s0)) | false |
DM4F.fst | DM4F.get | val get: #st: _ -> Prims.unit -> ST st st (fun s0 p -> p (s0, s0)) | val get: #st: _ -> Prims.unit -> ST st st (fun s0 p -> p (s0, s0)) | let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
ST?.reflect (fun s0 -> (s0, s0)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 96,
"start_col": 0,
"start_line": 95
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | _: Prims.unit -> DM4F.ST st | DM4F.ST | [] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2"
] | [] | false | true | false | false | false | let get #st () : ST st st (fun s0 p -> p (s0, s0)) =
| ST?.reflect (fun s0 -> (s0, s0)) | false |
DM4F.fst | DM4F.put | val put (#st: _) (s: st) : ST unit st (fun _ p -> p ((), s)) | val put (#st: _) (s: st) : ST unit st (fun _ p -> p ((), s)) | let put #st (s:st) : ST unit st (fun _ p -> p ((), s)) =
ST?.reflect (fun _ -> ((), s)) | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 99,
"start_col": 0,
"start_line": 98
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | s: st -> DM4F.ST Prims.unit | DM4F.ST | [] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"FStar.Pervasives.Native.tuple2"
] | [] | false | true | false | false | false | let put #st (s: st) : ST unit st (fun _ p -> p ((), s)) =
| ST?.reflect (fun _ -> ((), s)) | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.point1 | val point1:lbytes 32 | val point1:lbytes 32 | let point1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy;
0x35uy; 0x94uy; 0xc1uy; 0xa4uy; 0x24uy; 0xb1uy; 0x5fuy; 0x7cuy;
0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; ... | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 46,
"start_col": 0,
"start_line": 38
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons"... | [] | false | false | false | false | false | let point1:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xe6uy; 0xdbuy; 0x68uy; 0x67uy; 0x58uy; 0x30uy; 0x30uy; 0xdbuy; 0x35uy; 0x94uy; 0xc1uy; 0xa4uy;
0x24uy; 0xb1uy; 0x5fuy; 0x7cuy; 0x72uy; 0x66uy; 0x24uy; 0xecuy; 0x26uy; 0xb3uy; 0x35uy; 0x3buy;
0x10uy; 0xa9uy; 0x03uy; 0xa6uy; 0xd0uy; 0xabuy; 0x1cuy; 0x4cuy
... | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.expected1 | val expected1:lbytes 32 | val expected1:lbytes 32 | let expected1 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0xc3uy; 0xdauy; 0x55uy; 0x37uy; 0x9duy; 0xe9uy; 0xc6uy; 0x90uy;
0x8euy; 0x94uy; 0xeauy; 0x4duy; 0xf2uy; 0x8duy; 0x08uy; 0x4fuy;
0x32uy; 0xecuy; 0xcfuy; 0x03uy; 0x49uy; 0x1cuy; 0x71uy; 0xf7uy;
0x54uy; 0xb4uy; 0x07uy; 0x55uy; 0x77uy; 0xa2u... | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 68,
"start_col": 0,
"start_line": 60
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons"... | [] | false | false | false | false | false | let expected1:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0xc3uy; 0xdauy; 0x55uy; 0x37uy; 0x9duy; 0xe9uy; 0xc6uy; 0x90uy; 0x8euy; 0x94uy; 0xeauy; 0x4duy;
0xf2uy; 0x8duy; 0x08uy; 0x4fuy; 0x32uy; 0xecuy; 0xcfuy; 0x03uy; 0x49uy; 0x1cuy; 0x71uy; 0xf7uy;
0x54uy; 0xb4uy; 0x07uy; 0x55uy; 0x77uy; 0xa2uy; 0x85uy; 0x52uy
... | false |
DM4F.fst | DM4F.null | val null (#st #a: _) : wp st a | val null (#st #a: _) : wp st a | let null #st #a : wp st a =
fun s0 p -> forall r. p r | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 93,
"start_col": 0,
"start_line": 92
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | DM4F.wp st a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2",
"Prims.l_Forall",
"Prims.logical",
"DM4F.wp"
] | [] | false | false | false | true | false | let null #st #a : wp st a =
| fun s0 p -> forall r. p r | false |
Spec.Curve25519.Test.fst | Spec.Curve25519.Test.scalar2 | val scalar2:lbytes 32 | val scalar2:lbytes 32 | let scalar2 : lbytes 32 =
let l = List.Tot.map u8_from_UInt8 [
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy;
0x5auy; 0xd2uy; 0x26uy; 0x91uy; 0x95uy; 0x7duy; 0x6auy; 0xf5uy;
0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy;... | {
"file_name": "specs/tests/Spec.Curve25519.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 35,
"start_col": 0,
"start_line": 27
} | module Spec.Curve25519.Test
open Lib.IntTypes
open Lib.RawIntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
(* ********************* *)
(* RFC 7748 Test Vectors *)
(* ********************* *)
let scalar1 : lbytes 32 =
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.UInt8.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.SEC) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"FStar.List.Tot.Base.map",
"FStar.UInt8.t",
"Lib.RawIntTypes.u8_from_UInt8",
"Prims.Cons"... | [] | false | false | false | false | false | let scalar2:lbytes 32 =
| let l =
List.Tot.map u8_from_UInt8
[
0x4buy; 0x66uy; 0xe9uy; 0xd4uy; 0xd1uy; 0xb4uy; 0x67uy; 0x3cuy; 0x5auy; 0xd2uy; 0x26uy; 0x91uy;
0x95uy; 0x7duy; 0x6auy; 0xf5uy; 0xc1uy; 0x1buy; 0x64uy; 0x21uy; 0xe0uy; 0xeauy; 0x01uy; 0xd4uy;
0x2cuy; 0xa4uy; 0x16uy; 0x9euy; 0x79uy; 0x18uy; 0xbauy; 0x0duy
... | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_qcode_Gf128MulRev128 | val va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) | val va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) | let va_qcode_Gf128MulRev128 (va_mods:va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(a:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in let
(b:Vale.Math.Poly2_s.poly) = Vale.Math.Poly... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 1091,
"start_col": 0,
"start_line": 1081
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Mul.va_code_Gf128MulRev128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128",
"Prims.Nil",
"Vale.PPC64LE.Machine_s.precode",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.... | [] | false | false | false | false | false | let va_qcode_Gf128MulRev128 (va_mods: va_mods_t) : (va_quickCode unit (va_code_Gf128MulRev128 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let a:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 1 va_s) in
let b:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 2 va_s) in
va_QBind va_range1
"***** P... | false |
DM4F.fst | DM4F.test | val test: Prims.unit -> ST int int null | val test: Prims.unit -> ST int int null | let test () : ST int int null =
let x = get () in
put (x + x);
get () + get () | {
"file_name": "examples/layeredeffects/DM4F.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 104,
"start_col": 0,
"start_line": 101
} | module DM4F
open FStar.Monotonic.Pure
#set-options "--print_universes"
(* Simulating state effect in DM4F, hopefully doable by a tactic. *)
type wp0 (st:Type u#0) (a:Type u#ua) : Type u#(max 1 ua) =
st -> (a & st -> Type0) -> Type0
let st_monotonic #st #a (w : wp0 st a) : Type0 =
//forall s0 p1 p2. (forall r. ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Pure.fst.checked"
],
"interface_file": false,
"source_file": "DM4F.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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... | false | _: Prims.unit -> DM4F.ST Prims.int | DM4F.ST | [] | [] | [
"Prims.unit",
"Prims.op_Addition",
"Prims.int",
"DM4F.get",
"DM4F.put",
"DM4F.null"
] | [] | false | true | false | false | false | let test () : ST int int null =
| let x = get () in
put (x + x);
get () + get () | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_Gf128ModulusRev | val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va... | val va_lemma_Gf128ModulusRev : va_b0:va_code -> va_s0:va_state -> dst:va_operand_vec_opr
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128ModulusRev dst) va_s0 /\ va_is_dst_vec_opr dst
va_s0 /\ va_get_ok va_s0 /\ dst =!= 3))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va... | let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let (va_s3, va_fc3) = va_lemma_Vxor (v... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 926,
"start_col": 0,
"start_line": 899
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
dst: Vale.PPC64LE.Decls.va_operand_vec_opr
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.Decls.va_operand_vec_opr",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_lemma_merge_total",
"FStar.Pervasives.Native.tuple2",
"Vale.PPC64LE.Machine_s.state",
"Vale.PPC64LE.Decls.va_... | [] | false | false | false | false | false | let va_lemma_Gf128ModulusRev va_b0 va_s0 dst =
| va_reveal_opaque (`%va_code_Gf128ModulusRev) (va_code_Gf128ModulusRev dst);
let va_old_s:va_state = va_s0 in
let va_b1:va_codes = va_get_block va_b0 in
Vale.AES.GF128.lemma_gf128_constant_rev (va_eval_vec_opr va_s0 dst);
let va_s3, va_fc3 = va_lemma_Vxor (va_hd va_b1) va_s0 dst dst dst in
let va_b3 = va_tl va_b1 in
let... | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_qcode_ReduceMulRev128 | val va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) | val va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) | let va_qcode_ReduceMulRev128 (va_mods:va_mods_t) (a:poly) (b:poly) : (va_quickCode unit
(va_code_ReduceMulRev128 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 1037,
"start_col": 0,
"start_line": 986
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> a: Vale.Math.Poly2_s.poly -> b: Vale.Math.Poly2_s.poly
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Mul.va_code_ReduceMulRev128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ClmulRev128",
"Vale.PPC64LE.InsVector.va_code_Vmr",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64L... | [] | false | false | false | false | false | let va_qcode_ReduceMulRev128 (va_mods: va_mods_t) (a b: poly)
: (va_quickCode unit (va_code_ReduceMulRev128 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_qPURE va_range1
"***** PRECONDITION NOT MET AT line 329 column 23 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Mul.vaf *****"
(fun (_: unit) ->... | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_wpProof_ReduceMulRev128 | val va_wpProof_ReduceMulRev128 : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ReduceMulRev128 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ReduceMulRev128 ()) ([va_Mod_vec 6;
... | val va_wpProof_ReduceMulRev128 : a:poly -> b:poly -> va_s0:va_state -> va_k:(va_state -> unit ->
Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ReduceMulRev128 a b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ReduceMulRev128 ()) ([va_Mod_vec 6;
... | let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_up... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1067,
"start_col": 0,
"start_line": 1058
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false |
a: Vale.Math.Poly2_s.poly ->
b: Vale.Math.Poly2_s.poly ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_re... | [] | false | false | false | false | false | let va_wpProof_ReduceMulRev128 a b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_ReduceMulRev128 (va_code_ReduceMulRev128 ()) va_s0 a b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
... | false |
FStar.BV.fst | FStar.BV.bv2int | val bv2int (#n: pos) (vec: bv_t n) : Tot (uint_t n) | val bv2int (#n: pos) (vec: bv_t n) : Tot (uint_t n) | let bv2int = U.from_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | vec: FStar.BV.bv_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt.from_vec"
] | [] | false | false | false | false | false | let bv2int =
| U.from_vec | false |
FStar.BV.fst | FStar.BV.int2bv_lemma_2 | val int2bv_lemma_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (int2bv a = int2bv b)) (ensures a = b) | val int2bv_lemma_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (int2bv a = int2bv b)) (ensures a = b) | let int2bv_lemma_2 = U.to_vec_lemma_2 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires FStar.BV.int2bv a = FStar.BV.int2bv b) (ensures a = b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.to_vec_lemma_2"
] | [] | true | false | true | false | false | let int2bv_lemma_2 =
| U.to_vec_lemma_2 | false |
FStar.BV.fst | FStar.BV.int2bv | val int2bv (#n: pos) (num: uint_t n) : Tot (bv_t n) | val int2bv (#n: pos) (num: uint_t n) : Tot (bv_t n) | let int2bv = U.to_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | num: FStar.UInt.uint_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt.to_vec"
] | [] | false | false | false | false | false | let int2bv =
| U.to_vec | false |
FStar.BV.fst | FStar.BV.bv_uext | val bv_uext (#n #m: pos) (a: bv_t n) : Tot (normalize (bv_t (m + n))) | val bv_uext (#n #m: pos) (a: bv_t n) : Tot (normalize (bv_t (m + n))) | let bv_uext #n #i a =
Seq.append (Seq.create i false) a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 25,
"start_col": 0,
"start_line": 24
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> FStar.Pervasives.normalize (FStar.BV.bv_t (m + n)) | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Base.append",
"Prims.bool",
"FStar.Seq.Base.create",
"FStar.Pervasives.normalize",
"Prims.op_Addition"
] | [] | false | false | false | false | false | let bv_uext #n #i a =
| Seq.append (Seq.create i false) a | false |
FStar.BV.fst | FStar.BV.int2bv_lemma_1 | val int2bv_lemma_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a = b) (ensures (int2bv #n a = int2bv #n b)) | val int2bv_lemma_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a = b) (ensures (int2bv #n a = int2bv #n b)) | let int2bv_lemma_1 = U.to_vec_lemma_1 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires a = b) (ensures FStar.BV.int2bv a = FStar.BV.int2bv b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.to_vec_lemma_1"
] | [] | true | false | true | false | false | let int2bv_lemma_1 =
| U.to_vec_lemma_1 | false |
FStar.BV.fst | FStar.BV.bv_t | val bv_t (n: nat) : eqtype | val bv_t (n: nat) : eqtype | let bv_t (n : nat) = B.bv_t n | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | n: Prims.nat -> Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.BitVector.bv_t",
"Prims.eqtype"
] | [] | false | false | false | true | false | let bv_t (n: nat) =
| B.bv_t n | false |
FStar.BV.fst | FStar.BV.list2bv | val list2bv (#n: pos) (l: list bool {List.length l = n}) : Tot (bv_t n) | val list2bv (#n: pos) (l: list bool {List.length l = n}) : Tot (bv_t n) | let list2bv #n l = S.seq_of_list l | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | l: Prims.list Prims.bool {FStar.List.Tot.Base.length l = n} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Prims.list",
"Prims.bool",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.Seq.Base.seq_of_list",
"FStar.BV.bv_t"
] | [] | false | false | false | false | false | let list2bv #n l =
| S.seq_of_list l | false |
FStar.BV.fst | FStar.BV.int2bv_nat | val int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) | val int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) | let int2bv_nat (#n: pos) (num: nat): Tot (bv_t n) = U.to_vec (num % pow2 n) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 37,
"start_col": 0,
"start_line": 37
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | num: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Prims.nat",
"FStar.UInt.to_vec",
"Prims.op_Modulus",
"Prims.pow2",
"FStar.BV.bv_t"
] | [] | false | false | false | false | false | let int2bv_nat (#n: pos) (num: nat) : Tot (bv_t n) =
| U.to_vec (num % pow2 n) | false |
FStar.BV.fst | FStar.BV.inverse_vec_lemma | val inverse_vec_lemma (#n: pos) (vec: bv_t n)
: Lemma (requires True) (ensures vec = (int2bv (bv2int vec))) [SMTPat (int2bv (bv2int vec))] | val inverse_vec_lemma (#n: pos) (vec: bv_t n)
: Lemma (requires True) (ensures vec = (int2bv (bv2int vec))) [SMTPat (int2bv (bv2int vec))] | let inverse_vec_lemma = U.inverse_vec_lemma | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | vec: FStar.BV.bv_t n
-> FStar.Pervasives.Lemma (ensures vec = FStar.BV.int2bv (FStar.BV.bv2int vec))
[SMTPat (FStar.BV.int2bv (FStar.BV.bv2int vec))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.inverse_vec_lemma"
] | [] | true | false | true | false | false | let inverse_vec_lemma =
| U.inverse_vec_lemma | false |
FStar.BV.fst | FStar.BV.int2bv_logand | val int2bv_logand:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvand #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logand #n x y) == z) | val int2bv_logand:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvand #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logand #n x y) == z) | let int2bv_logand #n #x #y #z pf =
inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 53,
"start_col": 0,
"start_line": 52
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvand (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logand x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvand",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logand #n #x #y #z pf =
| inverse_vec_lemma #n (bvand #n (int2bv #n x) (int2bv #n y)) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_ReduceMulRev128 | val va_lemma_ReduceMulRev128 : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ReduceMulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_get_vec 1 va_s0 ==
Vale.Mat... | val va_lemma_ReduceMulRev128 : va_b0:va_code -> va_s0:va_state -> a:poly -> b:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ReduceMulRev128 ()) va_s0 /\ va_get_ok va_s0 /\
Vale.Math.Poly2_s.degree a <= 127 /\ Vale.Math.Poly2_s.degree b <= 127 /\ va_get_vec 1 va_s0 ==
Vale.Mat... | let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1054,
"start_col": 0,
"start_line": 1040
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
a: Vale.Math.Poly2_s.poly ->
b: Vale.Math.Poly2_s.poly
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.... | [] | false | false | false | false | false | let va_lemma_ReduceMulRev128 va_b0 va_s0 a b =
| let va_mods:va_mods_t =
[
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
]
in
let va_qc = va_qcode_ReduceMulRev128 va_mods a b in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_ReduceMulRev128 ... | false |
FStar.BV.fst | FStar.BV.int2bv_nat_lemma | val int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) | val int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) | let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma
(ensures (int2bv_nat #n num == int2bv #n num)) =
assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 44,
"start_col": 0,
"start_line": 39
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | num: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv_nat num == FStar.BV.int2bv num) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims._assert",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.modulo_lemma",
"Prims.op_LessThan",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bv_t",
"FStar.BV.int2bv_nat",
... | [] | true | false | true | false | false | let int2bv_nat_lemma (#n: pos) (num: uint_t n)
: Lemma (ensures (int2bv_nat #n num == int2bv #n num)) =
| assert (num < pow2 n);
FStar.Math.Lemmas.modulo_lemma num (pow2 n);
assert (num % pow2 n = num) | false |
FStar.BV.fst | FStar.BV.list2bv_bij | val list2bv_bij (#n: pos) (a: list bool {List.length a = n})
: Lemma (requires (True)) (ensures (bv2list (list2bv #n a) = a)) | val list2bv_bij (#n: pos) (a: list bool {List.length a = n})
: Lemma (requires (True)) (ensures (bv2list (list2bv #n a) = a)) | let list2bv_bij #n a = S.lemma_list_seq_bij a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: Prims.list Prims.bool {FStar.List.Tot.Base.length a = n}
-> FStar.Pervasives.Lemma (ensures FStar.BV.bv2list (FStar.BV.list2bv a) = a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.list",
"Prims.bool",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.Seq.Properties.lemma_list_seq_bij",
"Prims.unit"
] | [] | true | false | true | false | false | let list2bv_bij #n a =
| S.lemma_list_seq_bij a | false |
FStar.BV.fst | FStar.BV.bvand | val bvand (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvand (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvand = B.logand_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 51,
"start_col": 0,
"start_line": 51
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logand_vec"
] | [] | false | false | false | false | false | let bvand =
| B.logand_vec | false |
FStar.BV.fst | FStar.BV.inverse_num_lemma | val inverse_num_lemma (#n: pos) (num: uint_t n)
: Lemma (requires True)
(ensures num = bv2int #n (int2bv #n num))
[SMTPat (bv2int #n (int2bv #n num))] | val inverse_num_lemma (#n: pos) (num: uint_t n)
: Lemma (requires True)
(ensures num = bv2int #n (int2bv #n num))
[SMTPat (bv2int #n (int2bv #n num))] | let inverse_num_lemma = U.inverse_num_lemma | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | num: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (ensures num = FStar.BV.bv2int (FStar.BV.int2bv num))
[SMTPat (FStar.BV.bv2int (FStar.BV.int2bv num))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.UInt.inverse_num_lemma"
] | [] | true | false | true | false | false | let inverse_num_lemma =
| U.inverse_num_lemma | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_wpProof_Gf128MulRev128 | val va_wpProof_Gf128MulRev128 : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128MulRev128 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128MulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; v... | val va_wpProof_Gf128MulRev128 : va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128MulRev128 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128MulRev128 ()) ([va_Mod_vec 6;
va_Mod_vec 5; va_Mod_vec 4; v... | let va_wpProof_Gf128MulRev128 va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128MulRev128 (va_code_Gf128MulRev128 ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 ... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1122,
"start_col": 0,
"start_line": 1113
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false |
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Prims.Nil",
"Prims.... | [] | false | false | false | false | false | let va_wpProof_Gf128MulRev128 va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Gf128MulRev128 (va_code_Gf128MulRev128 ()) va_s0 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
... | false |
FStar.BV.fst | FStar.BV.bvor | val bvor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvor = B.logor_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 59,
"start_col": 0,
"start_line": 59
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logor_vec"
] | [] | false | false | false | false | false | let bvor =
| B.logor_vec | false |
FStar.BV.fst | FStar.BV.bv2list_bij | val bv2list_bij (#n: pos) (a: bv_t n)
: Lemma (requires (True)) (ensures (list2bv (bv2list #n a) = a)) | val bv2list_bij (#n: pos) (a: bv_t n)
: Lemma (requires (True)) (ensures (list2bv (bv2list #n a) = a)) | let bv2list_bij #n a = S.lemma_seq_list_bij a | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 49,
"start_col": 0,
"start_line": 49
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> FStar.Pervasives.Lemma (ensures FStar.BV.list2bv (FStar.BV.bv2list a) = a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Properties.lemma_seq_list_bij",
"Prims.bool",
"Prims.unit"
] | [] | true | false | true | false | false | let bv2list_bij #n a =
| S.lemma_seq_list_bij a | false |
FStar.BV.fst | FStar.BV.int2bv_logxor | val int2bv_logxor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvxor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logxor #n x y) == z) | val int2bv_logxor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvxor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logxor #n x y) == z) | let int2bv_logxor #n #x #y #z pf =
inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 57,
"start_col": 0,
"start_line": 56
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvxor (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logxor x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvxor",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logxor #n #x #y #z pf =
| inverse_vec_lemma #n (bvxor #n (int2bv x) (int2bv y)) | false |
FStar.BV.fst | FStar.BV.int2bv_lognot | val int2bv_lognot: #n: pos -> #x: uint_t n -> #z: bv_t n -> squash (bvnot #n (int2bv #n x) == z)
-> Lemma (int2bv #n (lognot #n x) == z) | val int2bv_lognot: #n: pos -> #x: uint_t n -> #z: bv_t n -> squash (bvnot #n (int2bv #n x) == z)
-> Lemma (int2bv #n (lognot #n x) == z) | let int2bv_lognot #n #x #y pf =
inverse_vec_lemma #n (bvnot #n (int2bv x)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 65,
"start_col": 0,
"start_line": 64
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvnot (FStar.BV.int2bv x) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.lognot x) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvnot",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lognot #n #x #y pf =
| inverse_vec_lemma #n (bvnot #n (int2bv x)) | false |
FStar.BV.fst | FStar.BV.bvnot | val bvnot (#n: pos) (a: bv_t n) : Tot (bv_t n) | val bvnot (#n: pos) (a: bv_t n) : Tot (bv_t n) | let bvnot = B.lognot_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 63,
"start_col": 0,
"start_line": 63
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.lognot_vec"
] | [] | false | false | false | false | false | let bvnot =
| B.lognot_vec | false |
FStar.BV.fst | FStar.BV.bv2list | val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n}) | val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n}) | let bv2list #n s = S.seq_to_list s | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 47,
"start_col": 0,
"start_line": 47
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | s: FStar.BV.bv_t n -> l: Prims.list Prims.bool {FStar.List.Tot.Base.length l = n} | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.Seq.Base.seq_to_list",
"Prims.bool",
"Prims.list",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | false | false | let bv2list #n s =
| S.seq_to_list s | false |
FStar.BV.fst | FStar.BV.int2bv_logor | val int2bv_logor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logor #n x y) == z) | val int2bv_logor:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvor #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (logor #n x y) == z) | let int2bv_logor #n #x #y #z pf =
inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 61,
"start_col": 0,
"start_line": 60
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvor (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.logor x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvor",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_logor #n #x #y #z pf =
| inverse_vec_lemma #n (bvor #n (int2bv x) (int2bv y)) | false |
FStar.BV.fst | FStar.BV.bvshl' | val bvshl' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | val bvshl' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | let bvshl' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_left_vec #n a (bv2int #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 69,
"start_col": 0,
"start_line": 68
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> s: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BitVector.shift_left_vec",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvshl' (#n: pos) (a s: bv_t n) : bv_t n =
| B.shift_left_vec #n a (bv2int #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shr' | val int2bv_shr':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | val int2bv_shr':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | let int2bv_shr' #n #x #y #z pf =
inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvshr' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_right x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshr'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_shr' #n #x #y #z pf =
| inverse_vec_lemma #n (bvshr' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.bvshr' | val bvshr' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | val bvshr' (#n: pos) (a: bv_t n) (s: bv_t n) : Tot (bv_t n) | let bvshr' (#n: pos) (a: bv_t n) (s: bv_t n): bv_t n =
B.shift_right_vec #n a (bv2int #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 80,
"start_col": 0,
"start_line": 79
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> s: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BitVector.shift_right_vec",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvshr' (#n: pos) (a s: bv_t n) : bv_t n =
| B.shift_right_vec #n a (bv2int #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shl' | val int2bv_shl':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | val int2bv_shl':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | let int2bv_shl' #n #x #y #z pf =
inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 74,
"start_col": 0,
"start_line": 73
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvshl' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_left x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshl'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_shl' #n #x #y #z pf =
| inverse_vec_lemma #n (bvshl' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.bvxor | val bvxor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvxor (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvxor = B.logxor_vec | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 55,
"start_col": 0,
"start_line": 55
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"FStar.BitVector.logxor_vec"
] | [] | false | false | false | false | false | let bvxor =
| B.logxor_vec | false |
FStar.BV.fst | FStar.BV.bvshl | val bvshl (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | val bvshl (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | let bvshl (#n: pos) (a: bv_t n) (s: nat): bv_t n =
bvshl' #n a (int2bv_nat #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 71,
"start_col": 0,
"start_line": 70
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> s: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.nat",
"FStar.BV.bvshl'",
"FStar.BV.int2bv_nat"
] | [] | false | false | false | false | false | let bvshl (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
| bvshl' #n a (int2bv_nat #n s) | false |
Vale.AES.PPC64LE.GF128_Mul.fst | Vale.AES.PPC64LE.GF128_Mul.va_lemma_Gf128MulRev128 | val va_lemma_Gf128MulRev128 : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128MulRev128 ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (a:Vale.Math.Poly2_s.poly) = V... | val va_lemma_Gf128MulRev128 : va_b0:va_code -> va_s0:va_state
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128MulRev128 ()) va_s0 /\ va_get_ok va_s0))
(ensures (fun (va_sM, va_fM) -> va_ensure_total va_b0 va_s0 va_sM va_fM /\ va_get_ok va_sM /\
(let (a:Vale.Math.Poly2_s.poly) = V... | let va_lemma_Gf128MulRev128 va_b0 va_s0 =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_Gf128MulRev128 va_mods in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Gf128MulR... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Mul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1109,
"start_col": 0,
"start_line": 1094
} | module Vale.AES.PPC64LE.GF128_Mul
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.TypesNative
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open Vale.AES.GF128
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.St... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.fsti.checked",
"Vale.PPC64LE.InsBasi... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.Types_helpers",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbrev": fal... | {
"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... | false | va_b0: Vale.PPC64LE.Decls.va_code -> va_s0: Vale.PPC64LE.Decls.va_state
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec... | [] | false | false | false | false | false | let va_lemma_Gf128MulRev128 va_b0 va_s0 =
| let va_mods:va_mods_t =
[
va_Mod_vec 6;
va_Mod_vec 5;
va_Mod_vec 4;
va_Mod_vec 3;
va_Mod_vec 2;
va_Mod_vec 1;
va_Mod_vec 0;
va_Mod_reg 10;
va_Mod_ok
]
in
let va_qc = va_qcode_Gf128MulRev128 va_mods in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Gf128MulRev128 ())
... | false |
FStar.BV.fst | FStar.BV.bvshr | val bvshr (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | val bvshr (#n: pos) (a: bv_t n) (s: nat) : Tot (bv_t n) | let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
bvshr' #n a (int2bv_nat #n s) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 82,
"start_col": 0,
"start_line": 81
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> s: Prims.nat -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.nat",
"FStar.BV.bvshr'",
"FStar.BV.int2bv_nat"
] | [] | false | false | false | false | false | let bvshr (#n: pos) (a: bv_t n) (s: nat) : bv_t n =
| bvshr' #n a (int2bv_nat #n s) | false |
FStar.BV.fst | FStar.BV.int2bv_shl | val int2bv_shl:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | val int2bv_shl:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshl #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_left #n x y) == z) | let int2bv_shl #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 77,
"start_col": 0,
"start_line": 75
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvshl (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_left x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshl",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit",
"FStar.BV.int2bv_nat_lemma"
] | [] | true | false | true | false | false | let int2bv_shl #n #x #y #z pf =
| int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshl #n (int2bv #n x) y) | false |
FStar.BV.fst | FStar.BV.bvsub | val bvsub (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvsub (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvsub #n a b =
int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 108,
"start_col": 0,
"start_line": 107
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.sub_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvsub #n a b =
| int2bv #n (U.sub_mod (bv2int #n a) (bv2int #n b)) | false |
FStar.BV.fst | FStar.BV.bvult | val bvult (#n: pos) (a b: bv_t n) : Tot (bool) | val bvult (#n: pos) (a b: bv_t n) : Tot (bool) | let bvult #n a b = (bv2int #n a) < (bv2int #n b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 91,
"start_col": 0,
"start_line": 91
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_LessThan",
"FStar.BV.bv2int",
"Prims.bool"
] | [] | false | false | false | false | false | let bvult #n a b =
| (bv2int #n a) < (bv2int #n b) | false |
FStar.BV.fst | FStar.BV.int2bv_shr | val int2bv_shr:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | val int2bv_shr:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvshr #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (shift_right #n x y) == z) | let int2bv_shr #n #x #y #z pf =
int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 87,
"start_col": 0,
"start_line": 85
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvshr (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.shift_right x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvshr",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit",
"FStar.BV.int2bv_nat_lemma"
] | [] | true | false | true | false | false | let int2bv_shr #n #x #y #z pf =
| int2bv_nat_lemma #n y;
inverse_vec_lemma #n (bvshr #n (int2bv #n x) y) | false |
FStar.WellFounded.fst | FStar.WellFounded.binrel | val binrel : a: Type -> Type | let binrel (a:Type) = a -> a -> Type | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | true | let binrel (a: Type) =
| a -> a -> Type | false | |
FStar.WellFounded.fst | FStar.WellFounded.well_founded | val well_founded : r: FStar.WellFounded.binrel a -> Type | let well_founded (#a:Type u#a) (r:binrel u#a u#r a) = x:a -> acc r x | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false | r: FStar.WellFounded.binrel a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc"
] | [] | false | false | false | true | true | let well_founded (#a: Type u#a) (r: binrel u#a u#r a) =
| x: a -> acc r x | false | |
FStar.BV.fst | FStar.BV.int2bv_lemma_ult_2 | val int2bv_lemma_ult_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (bvult #n (int2bv #n a) (int2bv #n b))) (ensures a < b) | val int2bv_lemma_ult_2 (#n: pos) (a b: uint_t n)
: Lemma (requires (bvult #n (int2bv #n a) (int2bv #n b))) (ensures a < b) | let int2bv_lemma_ult_2 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 99,
"start_col": 0,
"start_line": 97
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b))
(ensures a < b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.inverse_num_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lemma_ult_2 #n a b =
| inverse_num_lemma #n a;
inverse_num_lemma #n b | false |
FStar.BV.fst | FStar.BV.int2bv_add | val int2bv_add:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvadd #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (add_mod #n x y) == z) | val int2bv_add:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvadd #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (add_mod #n x y) == z) | let int2bv_add #n #x #y #z pf =
inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 105,
"start_col": 0,
"start_line": 104
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvadd (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.add_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvadd",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_add #n #x #y #z pf =
| inverse_vec_lemma #n (bvadd #n (int2bv #n x) (int2bv #n y)) | false |
FStar.WellFounded.fst | FStar.WellFounded.well_founded_relation | val well_founded_relation : a: Type -> Type | let well_founded_relation (a:Type) = rel:binrel a{is_well_founded rel} | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 64,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.is_well_founded"
] | [] | false | false | false | true | true | let well_founded_relation (a: Type) =
| rel: binrel a {is_well_founded rel} | false | |
FStar.BV.fst | FStar.BV.int2bv_lemma_ult_1 | val int2bv_lemma_ult_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a < b) (ensures (bvult #n (int2bv #n a) (int2bv #n b))) | val int2bv_lemma_ult_1 (#n: pos) (a b: uint_t n)
: Lemma (requires a < b) (ensures (bvult #n (int2bv #n a) (int2bv #n b))) | let int2bv_lemma_ult_1 #n a b =
inverse_num_lemma #n a;
inverse_num_lemma #n b | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 95,
"start_col": 0,
"start_line": 93
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n
-> FStar.Pervasives.Lemma (requires a < b)
(ensures FStar.BV.bvult (FStar.BV.int2bv a) (FStar.BV.int2bv b)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.inverse_num_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_lemma_ult_1 #n a b =
| inverse_num_lemma #n a;
inverse_num_lemma #n b | false |
FStar.WellFounded.fst | FStar.WellFounded.is_well_founded | val is_well_founded : rel: FStar.WellFounded.binrel a -> Prims.logical | let is_well_founded (#a:Type) (rel:binrel a) =
forall (x:a). squash (acc rel x) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 62,
"start_col": 0,
"start_line": 61
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false | rel: FStar.WellFounded.binrel a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"Prims.l_Forall",
"Prims.squash",
"FStar.WellFounded.acc",
"Prims.logical"
] | [] | false | false | false | true | true | let is_well_founded (#a: Type) (rel: binrel a) =
| forall (x: a). squash (acc rel x) | false | |
FStar.WellFounded.fst | FStar.WellFounded.fix | val fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x | val fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x | let fix (#aa:Type) (#r:binrel aa) (rwf:well_founded r)
(p:aa -> Type) (f:(x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa)
: p x
= fix_F f x (rwf x) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 59,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false |
rwf: FStar.WellFounded.well_founded r ->
p: (_: aa -> Type) ->
f: (x: aa -> _: (y: aa -> _: r y x -> p y) -> p x) ->
x: aa
-> p x | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.fix_F"
] | [] | false | false | false | false | false | let fix
(#aa: Type)
(#r: binrel aa)
(rwf: well_founded r)
(p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
: p x =
| fix_F f x (rwf x) | false |
FStar.BV.fst | FStar.BV.bvadd | val bvadd (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvadd (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvadd #n a b =
int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 103,
"start_col": 0,
"start_line": 102
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.add_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvadd #n a b =
| int2bv #n (U.add_mod (bv2int #n a) (bv2int #n b)) | false |
FStar.WellFounded.fst | FStar.WellFounded.inverse_image | val inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a | val inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a | let inverse_image (#a:Type u#a) (#b:Type u#b) (r_b:binrel u#b u#r b) (f:a -> b) : binrel u#a u#r a =
fun x y -> r_b (f x) (f y) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 120,
"start_col": 0,
"start_line": 119
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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... | false | r_b: FStar.WellFounded.binrel b -> f: (_: a -> b) -> FStar.WellFounded.binrel a | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel"
] | [] | false | false | false | true | false | let inverse_image (#a: Type u#a) (#b: Type u#b) (r_b: binrel u#b u#r b) (f: (a -> b))
: binrel u#a u#r a =
| fun x y -> r_b (f x) (f y) | false |
FStar.BV.fst | FStar.BV.bvmul' | val bvmul' (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvmul' (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvmul' #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) (bv2int #n b)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 136,
"start_col": 0,
"start_line": 135
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.BV.int2bv",
"FStar.UInt.mul_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmul' #n a b =
| int2bv #n (U.mul_mod #n (bv2int #n a) (bv2int #n b)) | false |
FStar.BV.fst | FStar.BV.int2bv_sub | val int2bv_sub:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvsub #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (sub_mod #n x y) == z) | val int2bv_sub:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvsub #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (sub_mod #n x y) == z) | let int2bv_sub #n #x #y #z pf =
inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 110,
"start_col": 0,
"start_line": 109
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvsub (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.sub_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvsub",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_sub #n #x #y #z pf =
| inverse_vec_lemma #n (bvsub #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.int2bv_mod | val int2bv_mod:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvmod #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mod #n x y) == z) | val int2bv_mod:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvmod #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mod #n x y) == z) | let int2bv_mod #n #x #y #z pf =
inverse_vec_lemma #n (bvmod #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 124,
"start_col": 0,
"start_line": 123
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvmod (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmod",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mod #n #x #y #z pf =
| inverse_vec_lemma #n (bvmod #n (int2bv #n x) y) | false |
FStar.BV.fst | FStar.BV.bvdiv | val bvdiv (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | val bvdiv (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | let bvdiv #n a b =
int2bv #n (U.udiv #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 113,
"start_col": 0,
"start_line": 112
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n {b <> 0} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.int2bv",
"FStar.UInt.udiv",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvdiv #n a b =
| int2bv #n (U.udiv #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvdiv_unsafe | val bvdiv_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvdiv_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvdiv_unsafe #n a b = if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 117,
"start_col": 0,
"start_line": 117
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv2int",
"FStar.BV.bvdiv",
"Prims.bool",
"FStar.BV.int2bv"
] | [] | false | false | false | false | false | let bvdiv_unsafe #n a b =
| if (bv2int b <> 0) then bvdiv a (bv2int b) else int2bv 0 | false |
FStar.BV.fst | FStar.BV.bvmod | val bvmod (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | val bvmod (#n: pos) (a: bv_t n) (b: uint_t n {b <> 0}) : Tot (bv_t n) | let bvmod #n a b =
int2bv #n (U.mod #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 122,
"start_col": 0,
"start_line": 121
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n {b <> 0} -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.int2bv",
"FStar.UInt.mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmod #n a b =
| int2bv #n (U.mod #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvmul | val bvmul (#n: pos) (a: bv_t n) (b: uint_t n) : Tot (bv_t n) | val bvmul (#n: pos) (a: bv_t n) (b: uint_t n) : Tot (bv_t n) | let bvmul #n a b =
int2bv #n (U.mul_mod #n (bv2int #n a) b) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 131,
"start_col": 0,
"start_line": 130
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.UInt.uint_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"FStar.UInt.uint_t",
"FStar.BV.int2bv",
"FStar.UInt.mul_mod",
"FStar.BV.bv2int"
] | [] | false | false | false | false | false | let bvmul #n a b =
| int2bv #n (U.mul_mod #n (bv2int #n a) b) | false |
FStar.BV.fst | FStar.BV.bvmod_unsafe | val bvmod_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | val bvmod_unsafe (#n: pos) (a b: bv_t n) : Tot (bv_t n) | let bvmod_unsafe #n a b = if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0 | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 126,
"start_col": 0,
"start_line": 126
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | a: FStar.BV.bv_t n -> b: FStar.BV.bv_t n -> FStar.BV.bv_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.BV.bv_t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv2int",
"FStar.BV.bvmod",
"Prims.bool",
"FStar.BV.int2bv"
] | [] | false | false | false | false | false | let bvmod_unsafe #n a b =
| if (bv2int b <> 0) then bvmod a (bv2int b) else int2bv 0 | false |
FStar.BV.fst | FStar.BV.int2bv_mul' | val int2bv_mul':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | val int2bv_mul':
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul' #n (int2bv #n x) (int2bv #n y) == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | let int2bv_mul' #n #x #y #z pf =
inverse_vec_lemma #n (bvmul' #n (int2bv #n x) (int2bv #n y)) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 139,
"start_col": 0,
"start_line": 138
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvmul' (FStar.BV.int2bv x) (FStar.BV.int2bv y) == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mul_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmul'",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mul' #n #x #y #z pf =
| inverse_vec_lemma #n (bvmul' #n (int2bv #n x) (int2bv #n y)) | false |
FStar.BV.fst | FStar.BV.int2bv_mul | val int2bv_mul:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | val int2bv_mul:
#n: pos ->
#x: uint_t n ->
#y: uint_t n ->
#z: bv_t n ->
squash (bvmul #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (mul_mod #n x y) == z) | let int2bv_mul #n #x #y #z pf =
inverse_vec_lemma #n (bvmul #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 133,
"start_col": 0,
"start_line": 132
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvmul (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.mul_mod x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvmul",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_mul #n #x #y #z pf =
| inverse_vec_lemma #n (bvmul #n (int2bv #n x) y) | false |
Hacl.P256.PrecompTable.fst | Hacl.P256.PrecompTable.lemma_proj_g_pow2_64_eval | val lemma_proj_g_pow2_64_eval : unit ->
Lemma (SE.exp_pow2 S.mk_p256_concrete_ops S.base_point 64 == proj_g_pow2_64) | val lemma_proj_g_pow2_64_eval : unit ->
Lemma (SE.exp_pow2 S.mk_p256_concrete_ops S.base_point 64 == proj_g_pow2_64) | let lemma_proj_g_pow2_64_eval () =
SPT256.exp_pow2_rec_is_exp_pow2 S.mk_p256_concrete_ops S.base_point 64;
let qX, qY, qZ = normalize_term (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64) in
normalize_term_spec (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64);
let rX : S.felem = 0x000931... | {
"file_name": "code/ecdsap256/Hacl.P256.PrecompTable.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 56,
"start_col": 0,
"start_line": 49
} | module Hacl.P256.PrecompTable
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module SPT = Hacl.Spec.PrecompBaseTable
module SPT256 = Hacl.Spec.Pr... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.Lemmas.fsti.checked",
"Spec.P256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hac... | [
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.P256.Point",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.P256.Lemmas",
"short_module": "SL"
},
{
"abbrev": true,
"... | {
"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... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Spec.Exponentiation.exp_pow2 Spec.P256.mk_p256_concrete_ops Spec.P256.PointOps.base_point 64 ==
Hacl.P256.PrecompTable.proj_g_pow2_64) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"Prims.nat",
"FStar.Pervasives.assert_norm",
"Prims.l_and",
"Prims.eq2",
"Spec.P256.PointOps.felem",
"FStar.Pervasives.normalize_term_spec",
"Spec.P256.PointOps.proj_point",
"Hacl.Spec.PrecompBaseTable256.exp_pow2_rec",
"Spec.P256.mk_p256_concrete_ops",
"Spec.P256.PointOps.base_poi... | [] | false | false | true | false | false | let lemma_proj_g_pow2_64_eval () =
| SPT256.exp_pow2_rec_is_exp_pow2 S.mk_p256_concrete_ops S.base_point 64;
let qX, qY, qZ = normalize_term (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64) in
normalize_term_spec (SPT256.exp_pow2_rec S.mk_p256_concrete_ops S.base_point 64);
let rX:S.felem = 0x000931f4ae428a4ad81ee0aa89cf5247ce85d4dd696c61b4bb9... | false |
FStar.BV.fst | FStar.BV.int2bv_div | val int2bv_div:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvdiv #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (udiv #n x y) == z) | val int2bv_div:
#n: pos ->
#x: uint_t n ->
#y: uint_t n {y <> 0} ->
#z: bv_t n ->
squash (bvdiv #n (int2bv #n x) y == z)
-> Lemma (int2bv #n (udiv #n x y) == z) | let int2bv_div #n #x #y #z pf =
inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y) | {
"file_name": "ulib/FStar.BV.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 115,
"start_col": 0,
"start_line": 114
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": true,
"source_file": "FStar.BV.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.BitVector",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.UInt",
"short_module": "U"
},
{
"abbrev": false,
"full_module": "FStar.UInt"... | {
"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... | false | pf: Prims.squash (FStar.BV.bvdiv (FStar.BV.int2bv x) y == z)
-> FStar.Pervasives.Lemma (ensures FStar.BV.int2bv (FStar.UInt.udiv x y) == z) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"FStar.BV.bv_t",
"Prims.squash",
"Prims.eq2",
"FStar.BV.bvdiv",
"FStar.BV.int2bv",
"FStar.BV.inverse_vec_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let int2bv_div #n #x #y #z pf =
| inverse_vec_lemma #n (bvdiv #n (int2bv #n x) y) | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.id_t_a | val id_t_a : a: Type0 -> Type0 | let id_t_a (a:Type0) = x:a -> stt a emp (fun _ -> emp) | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 44,
"start_col": 0,
"start_line": 44
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
e... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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... | false | a: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.Core.stt",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | true | true | let id_t_a (a: Type0) =
| x: a -> stt a emp (fun _ -> emp) | false | |
FStar.WellFounded.fst | FStar.WellFounded.subrelation_wf | val subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r | val subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r | let subrelation_wf (#a:Type) (#r #sub_r:binrel a)
(sub_w:(x:a -> y:a -> sub_r x y -> r x y))
(r_wf:well_founded r)
: well_founded sub_r
= let rec aux (x:a) (acc_r:acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x ->
aux y
(match acc_r with
| AccIntro f... | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 91,
"start_col": 0,
"start_line": 82
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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... | false | sub_w: (x: a -> y: a -> _: sub_r x y -> r x y) -> r_wf: FStar.WellFounded.well_founded r
-> FStar.WellFounded.well_founded sub_r | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.acc",
"FStar.WellFounded.AccIntro",
"Prims.precedes"
] | [] | false | false | false | false | false | let subrelation_wf
(#a: Type)
(#r #sub_r: binrel a)
(sub_w: (x: a -> y: a -> sub_r x y -> r x y))
(r_wf: well_founded r)
: well_founded sub_r =
| let rec aux (x: a) (acc_r: acc r x) : Tot (acc sub_r x) (decreases acc_r) =
AccIntro (fun y sub_r_y_x -> aux y (match acc_r with | AccIntro f -> f y (sub_w y x sub_r_y_x)))
in
fun x -> aux x (r_wf x) | false |
FStar.WellFounded.fst | FStar.WellFounded.fix_F | val fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) | val fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) | let rec fix_F (#aa:Type) (#r:binrel aa) (#p:(aa -> Type))
(f: (x:aa -> (y:aa -> r y x -> p y) -> p x))
(x:aa) (a:acc r x)
: Tot (p x) (decreases a)
= f x (fun y h -> fix_F f y (a.access_smaller y h)) | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 53,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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... | false | f: (x: aa -> _: (y: aa -> _: r y x -> p y) -> p x) -> x: aa -> a: FStar.WellFounded.acc r x
-> Prims.Tot (p x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc",
"FStar.WellFounded.fix_F",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller"
] | [
"recursion"
] | false | false | false | false | false | let rec fix_F
(#aa: Type)
(#r: binrel aa)
(#p: (aa -> Type))
(f: (x: aa -> (y: aa -> r y x -> p y) -> p x))
(x: aa)
(a: acc r x)
: Tot (p x) (decreases a) =
| f x (fun y h -> fix_F f y (a.access_smaller y h)) | false |
FStar.WellFounded.fst | FStar.WellFounded.subrelation_squash_wf | val subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) | val subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) | let subrelation_squash_wf (#a:Type u#a)
(#r:binrel u#a u#r a)
(#sub_r:binrel u#a u#sr a)
(sub_w:(x:a -> y:a -> sub_r x y -> squash (r x y)))
(r_wf:well_founded r)
: Lemma (is_well_founded sub_r)
= introduce foral... | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 109,
"start_col": 0,
"start_line": 93
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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... | false |
sub_w: (x: a -> y: a -> _: sub_r x y -> Prims.squash (r x y)) ->
r_wf: FStar.WellFounded.well_founded r
-> FStar.Pervasives.Lemma (ensures FStar.WellFounded.is_well_founded sub_r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.WellFounded.binrel",
"Prims.squash",
"FStar.WellFounded.well_founded",
"FStar.Classical.Sugar.forall_intro",
"FStar.WellFounded.acc",
"FStar.Squash.return_squash",
"FStar.WellFounded.AccIntro",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller",
"FStar.IndefiniteDescription.elim_squas... | [] | false | false | true | false | false | let subrelation_squash_wf
(#a: Type u#a)
(#r: binrel u#a u#r a)
(#sub_r: binrel u#a u#sr a)
(sub_w: (x: a -> y: a -> sub_r x y -> squash (r x y)))
(r_wf: well_founded r)
: Lemma (is_well_founded sub_r) =
| introduce forall (x: a) . squash (acc sub_r x)
with (let rec acc_y (x: a) (acc_r: acc r x) (y: a) (p: sub_r y x)
: Tot (acc sub_r y) (decreases acc_r) =
AccIntro (acc_y y (acc_r.access_smaller y (elim_squash (sub_w y x p))))
in
FStar.Squash.return_squash (FStar.Squash.return_squash (AccIntro (acc_y x (r_w... | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.id_t | val id_t : Type | let id_t = (#a:Type0) -> x:a -> stt a emp (fun _ -> emp) | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 56,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
e... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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... | false | Type | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.Core.stt",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | true | true | let id_t =
| #a: Type0 -> x: a -> stt a emp (fun _ -> emp) | false | |
FStar.WellFounded.fst | FStar.WellFounded.inverse_image_wf | val inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) | val inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) | let inverse_image_wf (#a:Type u#a) (#b:Type u#b) (#r_b:binrel u#b u#r b)
(f:a -> b)
(r_b_wf:well_founded r_b)
: well_founded (inverse_image r_b f)
= let rec aux (x:a) (acc_r_b:acc r_b (f x))
: Tot (acc (inverse_image r_b f) x)
(decreases acc_r_b) =
AccIntro (fun y p -> aux y (acc_r_b.acc... | {
"file_name": "ulib/FStar.WellFounded.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 131,
"start_col": 0,
"start_line": 122
} | (*
Copyright 2015 Chantal Keller and Catalin Hritcu, Microsoft Research and Inria
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
U... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IndefiniteDescription.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.WellFounded.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.IndefiniteDescription",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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... | false | f: (_: a -> b) -> r_b_wf: FStar.WellFounded.well_founded r_b
-> FStar.WellFounded.well_founded (FStar.WellFounded.inverse_image r_b f) | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFounded.acc",
"FStar.WellFounded.inverse_image",
"FStar.WellFounded.AccIntro",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller"
] | [] | false | false | false | false | false | let inverse_image_wf
(#a: Type u#a)
(#b: Type u#b)
(#r_b: binrel u#b u#r b)
(f: (a -> b))
(r_b_wf: well_founded r_b)
: well_founded (inverse_image r_b f) =
| let rec aux (x: a) (acc_r_b: acc r_b (f x)) : Tot (acc (inverse_image r_b f) x) (decreases acc_r_b)
=
AccIntro (fun y p -> aux y (acc_r_b.access_smaller (f y) p))
in
fun x -> aux x (r_b_wf (f x)) | false |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.next | val next : c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.int
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun y ->
Mkctr?.inv c (FStar.Ghost.reveal i + 1) ** Pulse.Lib.Core.pure (y == FStar.Ghost.reveal i)
) | let next c = c.next | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 19,
"end_line": 60,
"start_col": 0,
"start_line": 60
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
e... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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... | false | c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.int
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun y ->
Mkctr?.inv c (FStar.Ghost.reveal i + 1) ** Pulse.Lib.Core.pure (y == FStar.Ghost.reveal i)
) | Prims.Tot | [
"total"
] | [] | [
"PulseTutorial.HigherOrder.ctr",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__next",
"FStar.Ghost.erased",
"Prims.int",
"Pulse.Lib.Core.stt",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__inv",
"FStar.Ghost.reveal",
"Pulse.Lib.Core.op_Star_Star",
"Prims.op_Addition",
"Pulse.Lib.Core.pure",
... | [] | false | false | false | false | false | let next c =
| c.next | false | |
PulseTutorial.HigherOrder.fst | PulseTutorial.HigherOrder.destroy | val destroy : c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.unit
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun _ -> Pulse.Lib.Core.emp) | let destroy c = c.destroy | {
"file_name": "share/steel/examples/pulse/by-example/PulseTutorial.HigherOrder.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 61,
"start_col": 0,
"start_line": 61
} | module PulseTutorial.HigherOrder
open Pulse.Lib.Pervasives
module B = Pulse.Lib.Box
```pulse //apply$
fn apply (#a:Type0)
(#b:a -> Type0)
(#pre:a -> vprop)
(#post: (x:a -> b x -> vprop))
(f: (x:a -> stt (b x) (pre x) (fun y -> post x y)))
(x:a)
requires pre x
returns y:b x
e... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Box.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseTutorial.HigherOrder.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Box",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseTutorial",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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... | false | c: PulseTutorial.HigherOrder.ctr -> i: FStar.Ghost.erased Prims.int
-> Pulse.Lib.Core.stt Prims.unit
(Mkctr?.inv c (FStar.Ghost.reveal i))
(fun _ -> Pulse.Lib.Core.emp) | Prims.Tot | [
"total"
] | [] | [
"PulseTutorial.HigherOrder.ctr",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__destroy",
"FStar.Ghost.erased",
"Prims.int",
"Pulse.Lib.Core.stt",
"Prims.unit",
"PulseTutorial.HigherOrder.__proj__Mkctr__item__inv",
"FStar.Ghost.reveal",
"Pulse.Lib.Core.emp",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | false | false | let destroy c =
| c.destroy | false | |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.op_At | val op_At : x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | let (@) = L.op_At | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 30,
"start_col": 8,
"start_line": 30
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"FStar.List.Tot.Base.op_At",
"Prims.list"
] | [] | false | false | false | true | false | <UNK> | <UNK> | false | |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_mul_threshold | val bn_mul_threshold : Prims.int | let bn_mul_threshold = 32 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
... | {
"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... | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let bn_mul_threshold =
| 32 | false | |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.name_of_bv | val name_of_bv (bv: bv) : Tac string | val name_of_bv (bv: bv) : Tac string | let name_of_bv (bv : bv) : Tac string =
unseal ((inspect_bv bv).bv_ppname) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 33,
"start_col": 0,
"start_line": 32
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | bv: FStar.Stubs.Reflection.Types.bv -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.bv",
"FStar.Tactics.Unseal.unseal",
"Prims.string",
"FStar.Stubs.Reflection.V1.Data.__proj__Mkbv_view__item__bv_ppname",
"FStar.Stubs.Reflection.V1.Builtins.inspect_bv"
] | [] | false | true | false | false | false | let name_of_bv (bv: bv) : Tac string =
| unseal ((inspect_bv bv).bv_ppname) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.name_of_binder | val name_of_binder (b: binder) : Tac string | val name_of_binder (b: binder) : Tac string | let name_of_binder (b : binder) : Tac string =
name_of_bv (bv_of_binder b) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 40,
"start_col": 0,
"start_line": 39
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | b: FStar.Stubs.Reflection.Types.binder -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.binder",
"FStar.Tactics.V1.Derived.name_of_bv",
"FStar.Reflection.V1.Derived.bv_of_binder",
"Prims.string"
] | [] | false | true | false | false | false | let name_of_binder (b: binder) : Tac string =
| name_of_bv (bv_of_binder b) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.bv_to_string | val bv_to_string (bv: bv) : Tac string | val bv_to_string (bv: bv) : Tac string | let bv_to_string (bv : bv) : Tac string =
(* Could also print type...? *)
name_of_bv bv | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 37,
"start_col": 0,
"start_line": 35
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | bv: FStar.Stubs.Reflection.Types.bv -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.bv",
"FStar.Tactics.V1.Derived.name_of_bv",
"Prims.string"
] | [] | false | true | false | false | false | let bv_to_string (bv: bv) : Tac string =
| name_of_bv bv | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.binder_to_string | val binder_to_string (b: binder) : Tac string | val binder_to_string (b: binder) : Tac string | let binder_to_string (b : binder) : Tac string =
bv_to_string (bv_of_binder b) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 43,
"start_col": 0,
"start_line": 42
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | b: FStar.Stubs.Reflection.Types.binder -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.binder",
"FStar.Tactics.V1.Derived.bv_to_string",
"FStar.Reflection.V1.Derived.bv_of_binder",
"Prims.string"
] | [] | false | true | false | false | false | let binder_to_string (b: binder) : Tac string =
| bv_to_string (bv_of_binder b) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.goals | val goals: Prims.unit -> Tac (list goal) | val goals: Prims.unit -> Tac (list goal) | let goals () : Tac (list goal) = goals_of (get ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 47,
"start_col": 0,
"start_line": 47
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac (Prims.list FStar.Stubs.Tactics.Types.goal) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goals_of",
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Stubs.Tactics.Types.proofstate",
"FStar.Tactics.Effect.get"
] | [] | false | true | false | false | false | let goals () : Tac (list goal) =
| goals_of (get ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.smt_goals | val smt_goals: Prims.unit -> Tac (list goal) | val smt_goals: Prims.unit -> Tac (list goal) | let smt_goals () : Tac (list goal) = smt_goals_of (get ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac (Prims.list FStar.Stubs.Tactics.Types.goal) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.smt_goals_of",
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Stubs.Tactics.Types.proofstate",
"FStar.Tactics.Effect.get"
] | [] | false | true | false | false | false | let smt_goals () : Tac (list goal) =
| smt_goals_of (get ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_env | val cur_env: Prims.unit -> Tac env | val cur_env: Prims.unit -> Tac env | let cur_env () : Tac env = goal_env (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 66,
"start_col": 0,
"start_line": 66
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.env | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_env",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_env () : Tac env =
| goal_env (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_goal | val cur_goal: Prims.unit -> Tac typ | val cur_goal: Prims.unit -> Tac typ | let cur_goal () : Tac typ = goal_type (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 69,
"start_col": 0,
"start_line": 69
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.typ | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_type",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_goal () : Tac typ =
| goal_type (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_witness | val cur_witness: Prims.unit -> Tac term | val cur_witness: Prims.unit -> Tac term | let cur_witness () : Tac term = goal_witness (_cur_goal ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 72,
"start_col": 0,
"start_line": 72
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.term | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.Types.goal_witness",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V1.Derived._cur_goal"
] | [] | false | true | false | false | false | let cur_witness () : Tac term =
| goal_witness (_cur_goal ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.cur_binders | val cur_binders: Prims.unit -> Tac binders | val cur_binders: Prims.unit -> Tac binders | let cur_binders () : Tac binders =
binders_of_env (cur_env ()) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.binders | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Reflection.V1.Builtins.binders_of_env",
"FStar.Stubs.Reflection.Types.binders",
"FStar.Stubs.Reflection.Types.env",
"FStar.Tactics.V1.Derived.cur_env"
] | [] | false | true | false | false | false | let cur_binders () : Tac binders =
| binders_of_env (cur_env ()) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.exact | val exact (t: term) : Tac unit | val exact (t: term) : Tac unit | let exact (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true false t) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 97,
"start_col": 0,
"start_line": 96
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | t: FStar.Stubs.Reflection.Types.term -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.V1.Derived.with_policy",
"Prims.unit",
"FStar.Stubs.Tactics.Types.SMT",
"FStar.Stubs.Tactics.V1.Builtins.t_exact"
] | [] | false | true | false | false | false | let exact (t: term) : Tac unit =
| with_policy SMT (fun () -> t_exact true false t) | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_sign_abs | val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen) | val bn_sign_abs:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen ->
tuple2 (carry t) (lbignum t aLen) | let bn_sign_abs #t #aLen a b =
let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 37,
"start_col": 0,
"start_line": 33
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
... | {
"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... | false | a: Hacl.Spec.Bignum.Definitions.lbignum t aLen -> b: Hacl.Spec.Bignum.Definitions.lbignum t aLen
-> Hacl.Spec.Bignum.Base.carry t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Base.carry",
"FStar.Pervasives.Native.Mktuple2",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.b2t",
"Prims... | [] | false | false | false | false | false | let bn_sign_abs #t #aLen a b =
| let c0, t0 = bn_sub a b in
let c1, t1 = bn_sub b a in
let res = map2 (mask_select (uint #t 0 -. c0)) t1 t0 in
c0, res | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_middle_karatsuba | val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen | val bn_middle_karatsuba:
#t:limb_t
-> #aLen:size_nat
-> c0:carry t
-> c1:carry t
-> c2:carry t
-> t01:lbignum t aLen
-> t23:lbignum t aLen ->
limb t & lbignum t aLen | let bn_middle_karatsuba #t #aLen c0 c1 c2 t01 t23 =
let c_sign = c0 ^. c1 in
let c3, t45 = bn_sub t01 t23 in let c3 = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in let c4 = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45 = map2 (mask_select mask) t67 t45 in
let c5 = mask_select mask c4 c3 in
c5, t45 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 9,
"end_line": 99,
"start_col": 0,
"start_line": 92
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
... | {
"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... | false |
c0: Hacl.Spec.Bignum.Base.carry t ->
c1: Hacl.Spec.Bignum.Base.carry t ->
c2: Hacl.Spec.Bignum.Base.carry t ->
t01: Hacl.Spec.Bignum.Definitions.lbignum t aLen ->
t23: Hacl.Spec.Bignum.Definitions.lbignum t aLen
-> Hacl.Spec.Bignum.Definitions.limb t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Base.carry",
"Hacl.Spec.Bignum.Definitions.lbignum",
"FStar.Pervasives.Native.Mktuple2",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Base.mask_select",
"Lib.Sequence.lseq",
"Prims.l_Forall",
"Prims.nat",
... | [] | false | false | false | false | false | let bn_middle_karatsuba #t #aLen c0 c1 c2 t01 t23 =
| let c_sign = c0 ^. c1 in
let c3, t45 = bn_sub t01 t23 in
let c3 = c2 -. c3 in
let c4, t67 = bn_add t01 t23 in
let c4 = c2 +. c4 in
let mask = uint #t 0 -. c_sign in
let t45 = map2 (mask_select mask) t67 t45 in
let c5 = mask_select mask c4 c3 in
c5, t45 | false |
Hacl.Spec.Bignum.Karatsuba.fst | Hacl.Spec.Bignum.Karatsuba.bn_lshift_add_early_stop | val bn_lshift_add_early_stop:
#t:limb_t
-> #aLen:size_nat
-> #bLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t bLen
-> i:nat{i + bLen <= aLen} ->
tuple2 (carry t) (lbignum t aLen) | val bn_lshift_add_early_stop:
#t:limb_t
-> #aLen:size_nat
-> #bLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t bLen
-> i:nat{i + bLen <= aLen} ->
tuple2 (carry t) (lbignum t aLen) | let bn_lshift_add_early_stop #t #aLen #bLen a b i =
let r = sub a i bLen in
let c, r' = bn_add r b in
let a' = update_sub a i bLen r' in
c, a' | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Karatsuba.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 304,
"start_col": 0,
"start_line": 300
} | module Hacl.Spec.Bignum.Karatsuba
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.LoopCombinators
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Bignum.Lib
open Hacl.Spec.Lib
open Hacl.Spec.Bignum.Addition
open Hacl.Spec.Bignum.Multiplication
open Hacl.Spec.Bignum.Squaring
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Karatsuba.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Squaring.fst.checked",
"Hacl.Spec.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Karatsuba.Lemmas",
"short_module": "K"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Squaring",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Multiplication",
"short_module": null
},
{
... | {
"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... | false |
a: Hacl.Spec.Bignum.Definitions.lbignum t aLen ->
b: Hacl.Spec.Bignum.Definitions.lbignum t bLen ->
i: Prims.nat{i + bLen <= aLen}
-> Hacl.Spec.Bignum.Base.carry t * Hacl.Spec.Bignum.Definitions.lbignum t aLen | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Hacl.Spec.Bignum.Base.carry",
"FStar.Pervasives.Native.Mktuple2",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions... | [] | false | false | false | false | false | let bn_lshift_add_early_stop #t #aLen #bLen a b i =
| let r = sub a i bLen in
let c, r' = bn_add r b in
let a' = update_sub a i bLen r' in
c, a' | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.exact_with_ref | val exact_with_ref (t: term) : Tac unit | val exact_with_ref (t: term) : Tac unit | let exact_with_ref (t : term) : Tac unit =
with_policy SMT (fun () -> t_exact true true t) | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 103,
"start_col": 0,
"start_line": 102
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | t: FStar.Stubs.Reflection.Types.term -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.V1.Derived.with_policy",
"Prims.unit",
"FStar.Stubs.Tactics.Types.SMT",
"FStar.Stubs.Tactics.V1.Builtins.t_exact"
] | [] | false | true | false | false | false | let exact_with_ref (t: term) : Tac unit =
| with_policy SMT (fun () -> t_exact true true t) | false |
FStar.Tactics.V1.Derived.fst | FStar.Tactics.V1.Derived.trivial | val trivial: Prims.unit -> Tac unit | val trivial: Prims.unit -> Tac unit | let trivial () : Tac unit =
norm [iota; zeta; reify_; delta; primops; simplify; unmeta];
let g = cur_goal () in
match term_as_formula g with
| True_ -> exact (`())
| _ -> raise Goal_not_trivial | {
"file_name": "ulib/FStar.Tactics.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 110,
"start_col": 0,
"start_line": 105
} | (*
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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Tactics.Visit.fst.checked",
"FStar.Tactics.V1.SyntaxHelpers.fst.checked",
"FStar.Tactics.Util.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Stubs.Tactics.V1.Builtins.fsti.checke... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Visit",
"short_module": "V"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot.Base",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"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... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V1.Derived.exact",
"FStar.Reflection.V1.Formula.formula",
"FStar.Tactics.Effect.raise",
"FStar.Tactics.V1.Derived.Goal_not_trivial",
"FStar.Reflection.V1.Formula.term_as_formula",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.V1.Derived.cur_goal",
"FStar.Stubs.Tacti... | [] | false | true | false | false | false | let trivial () : Tac unit =
| norm [iota; zeta; reify_; delta; primops; simplify; unmeta];
let g = cur_goal () in
match term_as_formula g with
| True_ -> exact (`())
| _ -> raise Goal_not_trivial | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.