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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
PulseCore.Semantics.fst | PulseCore.Semantics.act_as_m0 | val act_as_m0 (#st: state u#s u#act) (#t: Type u#0) (a: action st t) : Dv (m t a.pre a.post) | val act_as_m0 (#st: state u#s u#act) (#t: Type u#0) (a: action st t) : Dv (m t a.pre a.post) | let act_as_m0
(#st:state u#s u#act)
(#t:Type u#0)
(a:action st t)
: Dv (m t a.pre a.post)
= let k (x:U.raise_t u#0 u#act t)
: Dv (m t (a.post (U.downgrade_val x)) a.post)
= Ret (U.downgrade_val x)
in
mbind (act (raise_action a)) k | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 310,
"start_col": 0,
"start_line": 301
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st t
-> FStar.Pervasives.Dv (PulseCore.Semantics.m t (Mkaction?.pre a) (Mkaction?.post a)) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.mbind",
"FStar.Universe.raise_t",
"PulseCore.Semantics.__proj__Mkaction__item__pre",
"PulseCore.Semantics.raise_action",
"PulseCore.Semantics.__proj__Mkaction__item__post",
"PulseCore.Semantics.act",
"PulseCore.Semantics... | [] | false | true | false | false | false | let act_as_m0 (#st: state u#s u#act) (#t: Type u#0) (a: action st t) : Dv (m t a.pre a.post) =
| let k (x: U.raise_t u#0 u#act t) : Dv (m t (a.post (U.downgrade_val x)) a.post) =
Ret (U.downgrade_val x)
in
mbind (act (raise_action a)) k | false |
PulseCore.Semantics.fst | PulseCore.Semantics.act | val act (#st: state u#s u#act) (#t: Type u#act) (a: action st t) : m t a.pre a.post | val act (#st: state u#s u#act) (#t: Type u#act) (a: action st t) : m t a.pre a.post | let act
(#st:state u#s u#act)
(#t:Type u#act)
(a:action st t)
: m t a.pre a.post
= Act a Ret | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 269,
"start_col": 0,
"start_line": 264
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st t -> PulseCore.Semantics.m t (Mkaction?.pre a) (Mkaction?.post a) | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.Act",
"PulseCore.Semantics.__proj__Mkaction__item__post",
"PulseCore.Semantics.Ret",
"PulseCore.Semantics.m",
"PulseCore.Semantics.__proj__Mkaction__item__pre"
] | [] | false | false | false | false | false | let act (#st: state u#s u#act) (#t: Type u#act) (a: action st t) : m t a.pre a.post =
| Act a Ret | false |
Hacl.Spec.Bignum.Addition.fst | Hacl.Spec.Bignum.Addition.bn_sub_lemma_loop_step | val bn_sub_lemma_loop_step:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen
-> i:pos{i <= aLen}
-> c1_res1:generate_elem_a (limb t) (carry t) aLen (i - 1) -> Lemma
(requires
(let (c1, res1) = c1_res1 in
bn_v #t #(i - 1) res1 - v c1 * pow2 (bits t * (i - 1)) == eval_ aLen a (i -... | val bn_sub_lemma_loop_step:
#t:limb_t
-> #aLen:size_nat
-> a:lbignum t aLen
-> b:lbignum t aLen
-> i:pos{i <= aLen}
-> c1_res1:generate_elem_a (limb t) (carry t) aLen (i - 1) -> Lemma
(requires
(let (c1, res1) = c1_res1 in
bn_v #t #(i - 1) res1 - v c1 * pow2 (bits t * (i - 1)) == eval_ aLen a (i -... | let bn_sub_lemma_loop_step #t #aLen a b i (c1, res1) =
let pbits = bits t in
let (c, res) = generate_elem_f aLen (bn_sub_f a b) (i - 1) (c1, res1) in
let c, e = bn_sub_f a b (i - 1) c1 in
assert (v e - v c * pow2 pbits == v a.[i - 1] - v b.[i - 1] - v c1);
calc (==) {
bn_v #t #i res - v c * pow2 (pbits *... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Addition.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 441,
"start_col": 0,
"start_line": 416
} | module Hacl.Spec.Bignum.Addition
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
open Hacl.Spec.Bignum.Base
open Hacl.Spec.Lib
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val bn_sub_carry_f: #t:limb_t -> #aLen:size_nat -> a:lbignum t aLen -> i:size_nat{i < aLen} -> c_in:... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Lib.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": fals... | {
"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 ->
i: Prims.pos{i <= aLen} ->
c1_res1:
Hacl.Spec.Lib.generate_elem_a (Hacl.Spec.Bignum.Definitions.limb t)
(Hacl.Spec.Bignum.Base.carry t)
aLen
(i - 1)
-> FStar.Pervasives.Le... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.pos",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Hacl.Spec.Lib.generate_elem_a",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Base.carry",
"Prims.op_Subtraction",
"Lib.Sequence... | [] | false | false | true | false | false | let bn_sub_lemma_loop_step #t #aLen a b i (c1, res1) =
| let pbits = bits t in
let c, res = generate_elem_f aLen (bn_sub_f a b) (i - 1) (c1, res1) in
let c, e = bn_sub_f a b (i - 1) c1 in
assert (v e - v c * pow2 pbits == v a.[ i - 1 ] - v b.[ i - 1 ] - v c1);
calc ( == ) {
bn_v #t #i res - v c * pow2 (pbits * i);
( == ) { bn_eval_snoc #t #(i - 1) res1 e }
bn_v #t #(i ... | false |
Hacl.Impl.Blake2.Constants.fst | Hacl.Impl.Blake2.Constants.ivTable_S | val ivTable_S:(x:
glbuffer (Spec.pub_word_t Spec.Blake2S) 8ul
{witnessed x (Spec.ivTable Spec.Blake2S) /\ recallable x}) | val ivTable_S:(x:
glbuffer (Spec.pub_word_t Spec.Blake2S) 8ul
{witnessed x (Spec.ivTable Spec.Blake2S) /\ recallable x}) | let ivTable_S: (x:glbuffer (Spec.pub_word_t Spec.Blake2S) 8ul{witnessed x (Spec.ivTable Spec.Blake2S) /\ recallable x}) =
createL_global Spec.list_iv_S | {
"file_name": "code/blake2/Hacl.Impl.Blake2.Constants.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 32,
"start_col": 0,
"start_line": 31
} | module Hacl.Impl.Blake2.Constants
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.LoopCombinators
module ST = FStar.HyperStack.ST
module Seq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Spec = Spec.Blake2
/// We need to unfold m... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tac... | [
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"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 | x:
(c:
Lib.Buffer.lbuffer_t Lib.Buffer.CONST
(Spec.Blake2.Definitions.pub_word_t Spec.Blake2.Definitions.Blake2S)
(8ul <: FStar.UInt32.t) {LowStar.ConstBuffer.qual_of c == LowStar.ConstBuffer.IMMUTABLE})
{ Lib.Buffer.witnessed x (Spec.Blake2.ivTable Spec.Blake2.Definitions.Blake2S) /\
Lib.Buffer.recalla... | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Spec.Blake2.list_iv_S",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | false | false | let ivTable_S:(x:
glbuffer (Spec.pub_word_t Spec.Blake2S) 8ul
{witnessed x (Spec.ivTable Spec.Blake2S) /\ recallable x}) =
| createL_global Spec.list_iv_S | false |
PulseCore.Semantics.fst | PulseCore.Semantics.act_as_m1 | val act_as_m1 (#st: state u#s u#(max 1 b)) (#t: Type u#1) (a: action st t) : Dv (m t a.pre a.post) | val act_as_m1 (#st: state u#s u#(max 1 b)) (#t: Type u#1) (a: action st t) : Dv (m t a.pre a.post) | let act_as_m1
(#st:state u#s u#(max 1 b))
(#t:Type u#1)
(a:action st t)
: Dv (m t a.pre a.post)
= let k (x:U.raise_t t)
: Dv (m t (a.post (U.downgrade_val x)) a.post)
= Ret (U.downgrade_val x)
in
mbind (act (raise_action a)) k | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 321,
"start_col": 0,
"start_line": 312
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st t
-> FStar.Pervasives.Dv (PulseCore.Semantics.m t (Mkaction?.pre a) (Mkaction?.post a)) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.mbind",
"FStar.Universe.raise_t",
"PulseCore.Semantics.__proj__Mkaction__item__pre",
"PulseCore.Semantics.raise_action",
"PulseCore.Semantics.__proj__Mkaction__item__post",
"PulseCore.Semantics.act",
"PulseCore.Semantics... | [] | false | true | false | false | false | let act_as_m1 (#st: state u#s u#(max 1 b)) (#t: Type u#1) (a: action st t) : Dv (m t a.pre a.post) =
| let k (x: U.raise_t t) : Dv (m t (a.post (U.downgrade_val x)) a.post) = Ret (U.downgrade_val x) in
mbind (act (raise_action a)) k | false |
PulseCore.Semantics.fst | PulseCore.Semantics.run | val run (#st: state u#s u#act) (#pre: st.pred) (#a: Type u#a) (#post: post st a) (f: m a pre post)
: Dv (nmst_sep st a pre post) | val run (#st: state u#s u#act) (#pre: st.pred) (#a: Type u#a) (#post: post st a) (f: m a pre post)
: Dv (nmst_sep st a pre post) | let rec run (#st:state u#s u#act)
(#pre:st.pred)
(#a:Type u#a)
(#post:post st a)
(f:m a pre post)
: Dv (nmst_sep st a pre post)
= match f with
| Ret x ->
weaken <| return x
| _ ->
let k (s:step_result a post st.emp)
: Dv (nmst_sep st a (Step?.next s) po... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 36,
"end_line": 242,
"start_col": 0,
"start_line": 227
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.m a pre post
-> FStar.Pervasives.Dv (PulseCore.Semantics.nmst_sep st a pre post) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.post",
"PulseCore.Semantics.m",
"PulseCore.NondeterministicMonotonicStateMonad.weaken",
"PulseCore.Semantics.full_mem",
"PulseCore.Semantics.__proj__Mkstate__item__evolves",
"Prims.l_True",
"Prims.pr... | [
"recursion"
] | false | true | false | false | false | let rec run
(#st: state u#s u#act)
(#pre: st.pred)
(#a: Type u#a)
(#post: post st a)
(f: m a pre post)
: Dv (nmst_sep st a pre post) =
| match f with
| Ret x -> weaken <| return x
| _ ->
let k (s: step_result a post st.emp) : Dv (nmst_sep st a (Step?.next s) post) =
let Step _ f = s in
run f
in
weaken <| bind (step f st.emp) k | false |
PulseCore.Semantics.fst | PulseCore.Semantics.par | val par
(#st: state u#s u#act)
(#p0 #q0: _)
(m0: m unit p0 (as_post q0))
(#p1 #q1: _)
(m1: m unit p1 (as_post q1))
: Dv (m unit (p0 `st.star` p1) (as_post (q0 `st.star` q1))) | val par
(#st: state u#s u#act)
(#p0 #q0: _)
(m0: m unit p0 (as_post q0))
(#p1 #q1: _)
(m1: m unit p1 (as_post q1))
: Dv (m unit (p0 `st.star` p1) (as_post (q0 `st.star` q1))) | let par (#st:state u#s u#act)
#p0 #q0 (m0:m unit p0 (as_post q0))
#p1 #q1 (m1:m unit p1 (as_post q1))
: Dv (m unit (p0 `st.star` p1) (as_post (q0 `st.star` q1)))
= let m0' = mbind m0 (fun _ -> Ret #_ #_ #(as_post q0) (U.raise_val u#0 u#0 ())) in
let m1' = mbind m1 (fun _ -> Ret #_ #_ #(as_post q1) ... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 23,
"end_line": 391,
"start_col": 0,
"start_line": 385
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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 |
m0: PulseCore.Semantics.m Prims.unit p0 (PulseCore.Semantics.as_post q0) ->
m1: PulseCore.Semantics.m Prims.unit p1 (PulseCore.Semantics.as_post q1)
-> FStar.Pervasives.Dv
(PulseCore.Semantics.m Prims.unit
(Mkstate?.star st p0 p1)
(PulseCore.Semantics.as_post (Mkstate?.star st q0 q1))) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.m",
"Prims.unit",
"PulseCore.Semantics.as_post",
"PulseCore.Semantics.Par",
"PulseCore.Semantics.__proj__Mkstate__item__star",
"PulseCore.Semantics.Ret",
"FStar.Universe.raise_t",
"PulseCore.Semant... | [] | false | true | false | false | false | let par
(#st: state u#s u#act)
#p0
#q0
(m0: m unit p0 (as_post q0))
#p1
#q1
(m1: m unit p1 (as_post q1))
: Dv (m unit (p0 `st.star` p1) (as_post (q0 `st.star` q1))) =
| let m0' = mbind m0 (fun _ -> Ret #_ #_ #(as_post q0) (U.raise_val u#0 u#0 ())) in
let m1' = mbind m1 (fun _ -> Ret #_ #_ #(as_post q1) (U.raise_val u#0 u#0 ())) in
Par m0' m1' (Ret ()) | false |
PulseCore.Semantics.fst | PulseCore.Semantics.act_as_m2 | val act_as_m2 (#st: state u#s u#(max 2 b)) (#t: Type u#2) (a: action st t) : Dv (m t a.pre a.post) | val act_as_m2 (#st: state u#s u#(max 2 b)) (#t: Type u#2) (a: action st t) : Dv (m t a.pre a.post) | let act_as_m2
(#st:state u#s u#(max 2 b))
(#t:Type u#2)
(a:action st t)
: Dv (m t a.pre a.post)
= let k (x:U.raise_t t)
: Dv (m t (a.post (U.downgrade_val x)) a.post)
= Ret (U.downgrade_val x)
in
mbind (act (raise_action a)) k | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 32,
"end_line": 332,
"start_col": 0,
"start_line": 323
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st t
-> FStar.Pervasives.Dv (PulseCore.Semantics.m t (Mkaction?.pre a) (Mkaction?.post a)) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.mbind",
"FStar.Universe.raise_t",
"PulseCore.Semantics.__proj__Mkaction__item__pre",
"PulseCore.Semantics.raise_action",
"PulseCore.Semantics.__proj__Mkaction__item__post",
"PulseCore.Semantics.act",
"PulseCore.Semantics... | [] | false | true | false | false | false | let act_as_m2 (#st: state u#s u#(max 2 b)) (#t: Type u#2) (a: action st t) : Dv (m t a.pre a.post) =
| let k (x: U.raise_t t) : Dv (m t (a.post (U.downgrade_val x)) a.post) = Ret (U.downgrade_val x) in
mbind (act (raise_action a)) k | false |
PulseCore.Semantics.fst | PulseCore.Semantics.mbind | val mbind
(#st: state u#s u#act)
(#a: Type u#a)
(#b: Type u#b)
(#p: st.pred)
(#q: post st a)
(#r: post st b)
(f: m a p q)
(g: (x: a -> Dv (m b (q x) r)))
: Dv (m b p r) | val mbind
(#st: state u#s u#act)
(#a: Type u#a)
(#b: Type u#b)
(#p: st.pred)
(#q: post st a)
(#r: post st b)
(f: m a p q)
(g: (x: a -> Dv (m b (q x) r)))
: Dv (m b p r) | let rec mbind
(#st:state u#s u#act)
(#a:Type u#a)
(#b:Type u#b)
(#p:st.pred)
(#q:post st a)
(#r:post st b)
(f:m a p q)
(g: (x:a -> Dv (m b (q x) r)))
: Dv (m b p r)
= match f with
| Ret x -> g x
| Act act k ->
Act act (fun x -> mbind (k x) g)
| Par #_ #pre0 ... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 19,
"end_line": 299,
"start_col": 0,
"start_line": 275
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.m a p q -> g: (x: a -> FStar.Pervasives.Dv (PulseCore.Semantics.m b (q x) r))
-> FStar.Pervasives.Dv (PulseCore.Semantics.m b p r) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.post",
"PulseCore.Semantics.m",
"PulseCore.Semantics.action",
"PulseCore.Semantics.__proj__Mkaction__item__post",
"PulseCore.Semantics.Act",
"PulseCore.Semantics.mbind",
"FStar.Universe.raise_t",
"... | [
"recursion"
] | false | true | false | false | false | let rec mbind
(#st: state u#s u#act)
(#a: Type u#a)
(#b: Type u#b)
(#p: st.pred)
(#q: post st a)
(#r: post st b)
(f: m a p q)
(g: (x: a -> Dv (m b (q x) r)))
: Dv (m b p r) =
| match f with
| Ret x -> g x
| Act act k -> Act act (fun x -> mbind (k x) g)
| Par #_ #pre0 #post0 ml #pre1 #post1 mr #postk k ->
let k:m b (post0 `st.star` post1) r = mbind k g in
let ml':m (U.raise_t u#0 u#b unit) pre0 (as_post post0) =
mbind ml (fun _ -> Ret #_ #(U.raise_t u#0 u#b unit) #(as_post post0) (U.ra... | false |
PulseCore.Semantics.fst | PulseCore.Semantics.frame_action | val frame_action (#st: state u#s u#act) (#a: Type u#act) (f: action st a) (frame: st.pred)
: g:
action st a
{g.post == F.on_dom a (fun x -> (f.post x) `st.star` frame) /\ g.pre == f.pre `st.star` frame} | val frame_action (#st: state u#s u#act) (#a: Type u#act) (f: action st a) (frame: st.pred)
: g:
action st a
{g.post == F.on_dom a (fun x -> (f.post x) `st.star` frame) /\ g.pre == f.pre `st.star` frame} | let frame_action (#st:state u#s u#act) (#a:Type u#act)
(f:action st a) (frame:st.pred)
: g:action st a { g.post == F.on_dom a (fun x -> f.post x `st.star` frame) /\
g.pre == f.pre `st.star` frame }
= let step (fr:st.pred)
: mst_sep st a
((f.pre `st.star` frame) `st.star` ... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 10,
"end_line": 353,
"start_col": 0,
"start_line": 341
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st a -> frame: Mkstate?.pred st
-> g:
PulseCore.Semantics.action st a
{ Mkaction?.post g ==
FStar.FunctionalExtensionality.on_dom a
(fun x -> Mkstate?.star st (Mkaction?.post f x) frame) /\
Mkaction?.pre g == Mkstate?.star st (Mkaction?.pre f) frame } | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.Mkaction",
"PulseCore.Semantics.__proj__Mkstate__item__star",
"PulseCore.Semantics.__proj__Mkaction__item__pre",
"FStar.FunctionalExtensionality.on_dom",
"PulseCore.Semant... | [] | false | false | false | false | false | let frame_action (#st: state u#s u#act) (#a: Type u#act) (f: action st a) (frame: st.pred)
: g:
action st a
{g.post == F.on_dom a (fun x -> (f.post x) `st.star` frame) /\ g.pre == f.pre `st.star` frame} =
| let step (fr: st.pred)
: mst_sep st
a
((f.pre `st.star` frame) `st.star` fr)
(F.on_dom a (fun x -> ((f.post x) `st.star` frame) `st.star` fr)) =
f.step (frame `st.star` fr)
in
{ pre = _; post = F.on_dom a (fun x -> (f.post x) `st.star` frame); step = step } | false |
PulseCore.Semantics.fst | PulseCore.Semantics.raise_action | val raise_action (#st: state u#s u#(max a b)) (#t: Type u#a) (a: action st t)
: action st (U.raise_t u#a u#(max a b) t) | val raise_action (#st: state u#s u#(max a b)) (#t: Type u#a) (a: action st t)
: action st (U.raise_t u#a u#(max a b) t) | let raise_action
(#st:state u#s u#(max a b))
(#t:Type u#a)
(a:action st t)
: action st (U.raise_t u#a u#(max a b) t)
= {
pre = a.pre;
post = F.on_dom _ (fun (x:U.raise_t u#a u#(max a b) t) -> a.post (U.downgrade_val x));
step = (fun frame ->
M.weaken <|
M.bi... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 4,
"end_line": 262,
"start_col": 0,
"start_line": 250
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.action st t -> PulseCore.Semantics.action st (FStar.Universe.raise_t t) | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.action",
"PulseCore.Semantics.Mkaction",
"FStar.Universe.raise_t",
"PulseCore.Semantics.__proj__Mkaction__item__pre",
"FStar.FunctionalExtensionality.on_dom",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.__proj__Mkaction__ite... | [] | false | false | false | false | false | let raise_action (#st: state u#s u#(max a b)) (#t: Type u#a) (a: action st t)
: action st (U.raise_t u#a u#(max a b) t) =
| {
pre = a.pre;
post = F.on_dom _ (fun (x: U.raise_t u#a u#(max a b) t) -> a.post (U.downgrade_val x));
step
=
(fun frame ->
M.weaken <| (M.bind (a.step frame) <| (fun x -> M.return <| U.raise_val u#a u#(max a b) x)))
} | false |
PulseCore.Semantics.fst | PulseCore.Semantics.conv | val conv
(#st: state u#s u#act)
(a: Type u#a)
(#p: st.pred)
(#q: post st a)
(q': post st a {forall x. q x == q' x})
: Lemma (m a p q == m a p q') | val conv
(#st: state u#s u#act)
(a: Type u#a)
(#p: st.pred)
(#q: post st a)
(q': post st a {forall x. q x == q' x})
: Lemma (m a p q == m a p q') | let conv (#st:state u#s u#act) (a:Type u#a)
(#p:st.pred)
(#q:post st a)
(q':post st a { forall x. q x == q' x })
: Lemma (m a p q == m a p q')
= F.extensionality _ _ q q' | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 27,
"end_line": 398,
"start_col": 0,
"start_line": 393
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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 -> q': PulseCore.Semantics.post st a {forall (x: a). q x == q' x}
-> FStar.Pervasives.Lemma (ensures PulseCore.Semantics.m a p q == PulseCore.Semantics.m a p q') | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.post",
"Prims.l_Forall",
"Prims.eq2",
"FStar.FunctionalExtensionality.extensionality",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"PulseCore.Semantics.m",
"Prims.Nil",
"FStar.Pervasives.patt... | [] | false | false | true | false | false | let conv
(#st: state u#s u#act)
(a: Type u#a)
(#p: st.pred)
(#q: post st a)
(q': post st a {forall x. q x == q' x})
: Lemma (m a p q == m a p q') =
| F.extensionality _ _ q q' | false |
Hacl.Impl.Blake2.Constants.fst | Hacl.Impl.Blake2.Constants.sigmaTable | val sigmaTable:x: glbuffer Spec.sigma_elt_t 160ul {witnessed x Spec.sigmaTable /\ recallable x} | val sigmaTable:x: glbuffer Spec.sigma_elt_t 160ul {witnessed x Spec.sigmaTable /\ recallable x} | let sigmaTable : x:glbuffer Spec.sigma_elt_t 160ul{witnessed x Spec.sigmaTable /\ recallable x} =
createL_global Spec.list_sigma | {
"file_name": "code/blake2/Hacl.Impl.Blake2.Constants.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 29,
"start_col": 0,
"start_line": 28
} | module Hacl.Impl.Blake2.Constants
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.LoopCombinators
module ST = FStar.HyperStack.ST
module Seq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Spec = Spec.Blake2
/// We need to unfold m... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tac... | [
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "Lib.LoopCombinators",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "Seq"
},
{
"abbrev": true,
"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 | x:
(c:
Lib.Buffer.lbuffer_t Lib.Buffer.CONST
Spec.Blake2.Definitions.sigma_elt_t
(160ul <: FStar.UInt32.t) {LowStar.ConstBuffer.qual_of c == LowStar.ConstBuffer.IMMUTABLE})
{Lib.Buffer.witnessed x Spec.Blake2.sigmaTable /\ Lib.Buffer.recallable x} | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Spec.Blake2.Definitions.sigma_elt_t",
"Prims.Cons",
"Lib.IntTypes.size",
"Prims.Nil"
] | [] | false | false | false | false | false | let sigmaTable:x: glbuffer Spec.sigma_elt_t 160ul {witnessed x Spec.sigmaTable /\ recallable x} =
| createL_global Spec.list_sigma | false |
PulseCore.Semantics.fst | PulseCore.Semantics.frame | val frame
(#st: state u#s u#act)
(#a: Type u#a)
(#p: st.pred)
(#q: post st a)
(fr: st.pred)
(f: m a p q)
: Dv (m a (p `st.star` fr) (F.on_dom a (fun x -> (q x) `st.star` fr))) | val frame
(#st: state u#s u#act)
(#a: Type u#a)
(#p: st.pred)
(#q: post st a)
(fr: st.pred)
(f: m a p q)
: Dv (m a (p `st.star` fr) (F.on_dom a (fun x -> (q x) `st.star` fr))) | let rec frame (#st:state u#s u#act)
(#a:Type u#a)
(#p:st.pred)
(#q:post st a)
(fr:st.pred)
(f:m a p q)
: Dv (m a (p `st.star` fr) (F.on_dom a (fun x -> q x `st.star` fr)))
= match f with
| Ret x -> Ret x
| Act f k ->
Act (frame... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 20,
"end_line": 379,
"start_col": 0,
"start_line": 358
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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 | fr: Mkstate?.pred st -> f: PulseCore.Semantics.m a p q
-> FStar.Pervasives.Dv
(PulseCore.Semantics.m a
(Mkstate?.star st p fr)
(FStar.FunctionalExtensionality.on_dom a (fun x -> Mkstate?.star st (q x) fr))) | FStar.Pervasives.Dv | [] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.post",
"PulseCore.Semantics.m",
"PulseCore.Semantics.Ret",
"FStar.FunctionalExtensionality.on_dom",
"PulseCore.Semantics.__proj__Mkstate__item__star",
"PulseCore.Semantics.action",
"PulseCore.Semanti... | [
"recursion"
] | false | true | false | false | false | let rec frame
(#st: state u#s u#act)
(#a: Type u#a)
(#p: st.pred)
(#q: post st a)
(fr: st.pred)
(f: m a p q)
: Dv (m a (p `st.star` fr) (F.on_dom a (fun x -> (q x) `st.star` fr))) =
| match f with
| Ret x -> Ret x
| Act f k -> Act (frame_action f fr) (fun x -> frame fr (k x))
| Par #_ #pre0 #post0 m0 #pre1 #post1 m1 #postk k ->
let m0':m (U.raise_t u#0 u#a unit)
(pre0 `st.star` fr)
(F.on_dom _ (fun x -> ((as_post post0) x) `st.star` fr)) =
frame fr m0
in
let m0':m (U.raise_t u#0 u#... | false |
PulseCore.Semantics.fst | PulseCore.Semantics.step | val step
(#st: state u#s u#act)
(#p: st.pred)
(#a: Type u#a)
(#q: post st a)
(f: m a p q)
(frame: st.pred)
: Tot
(nmst_sep st
(step_result a q frame)
(p `st.star` frame)
(fun x -> (Step?.next x) `st.star` frame)) (decreases f) | val step
(#st: state u#s u#act)
(#p: st.pred)
(#a: Type u#a)
(#q: post st a)
(f: m a p q)
(frame: st.pred)
: Tot
(nmst_sep st
(step_result a q frame)
(p `st.star` frame)
(fun x -> (Step?.next x) `st.star` frame)) (decreases f) | let rec step
(#st:state u#s u#act)
(#p:st.pred)
(#a:Type u#a)
(#q:post st a)
(f:m a p q)
(frame:st.pred)
: Tot (nmst_sep st
(step_result a q frame)
(p `st.star` frame)
(fun x -> Step?.next x `st.star` frame))
(decreases f)
= match f with
| Ret x ->
weaken <|... | {
"file_name": "lib/pulse_core/PulseCore.Semantics.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 222,
"start_col": 0,
"start_line": 181
} | (*
Copyright 2024 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"PulseCore.NondeterministicMonotonicStateMonad.fsti.checked",
"PulseCore.MonotonicStateMonad.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensi... | [
{
"abbrev": false,
"full_module": "FStar.Preorder",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.NondeterministicMonotonicStateMonad",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
... | {
"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: PulseCore.Semantics.m a p q -> frame: Mkstate?.pred st
-> Prims.Tot
(PulseCore.Semantics.nmst_sep st
(PulseCore.Semantics.step_result a q frame)
(Mkstate?.star st p frame)
(fun x -> Mkstate?.star st (Step?.next x) frame)) | Prims.Tot | [
"total",
""
] | [] | [
"PulseCore.Semantics.state",
"PulseCore.Semantics.__proj__Mkstate__item__pred",
"PulseCore.Semantics.post",
"PulseCore.Semantics.m",
"PulseCore.NondeterministicMonotonicStateMonad.weaken",
"PulseCore.Semantics.full_mem",
"PulseCore.Semantics.__proj__Mkstate__item__evolves",
"PulseCore.Semantics.step_r... | [
"recursion"
] | false | false | false | false | false | let rec step
(#st: state u#s u#act)
(#p: st.pred)
(#a: Type u#a)
(#q: post st a)
(f: m a p q)
(frame: st.pred)
: Tot
(nmst_sep st
(step_result a q frame)
(p `st.star` frame)
(fun x -> (Step?.next x) `st.star` frame)) (decreases f) =
| match f with
| Ret x -> weaken <| (return <| Step (q x) (Ret x))
| Act f k ->
let k (x: _)
: Dv
(nmst_sep st
(step_result a q frame)
((f.post x) `st.star` frame)
(fun v -> (Step?.next v) `st.star` frame)) =
let n:m a (f.post x) q = k x in
weaken (return (Step _ n))
... | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.table_len_t | val table_len_t : len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Type0 | let table_len_t (len:size_t{v len > 0}) =
table_len:size_t{v table_len * v len <= max_size_t} | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 124,
"start_col": 0,
"start_line": 123
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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 | len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.max_size_t"
] | [] | false | false | false | false | true | let table_len_t (len: size_t{v len > 0}) =
| table_len: size_t{v table_len * v len <= max_size_t} | false | |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update_block | val update_block:Impl.blake2_update_block_st Spec.Blake2S Core.M32 | val update_block:Impl.blake2_update_block_st Spec.Blake2S Core.M32 | let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32 | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 11,
"start_col": 0,
"start_line": 10
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline] | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_block_st Spec.Blake2.Definitions.Blake2S
Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update_block",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32"
] | [] | false | false | false | true | false | let update_block:Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
| Impl.blake2_update_block #Spec.Blake2S #Core.M32 | false |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update_key | val update_key:Impl.blake2_update_key_st Spec.Blake2S Core.M32 | val update_key:Impl.blake2_update_key_st Spec.Blake2S Core.M32 | let update_key : Impl.blake2_update_key_st Spec.Blake2S Core.M32 =
Impl.blake2_update_key #Spec.Blake2S #Core.M32 update_block | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 61,
"end_line": 17,
"start_col": 0,
"start_line": 16
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_key_st Spec.Blake2.Definitions.Blake2S
Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update_key",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32",
"Hacl.Blake2s_32.update_block"
] | [] | false | false | false | true | false | let update_key:Impl.blake2_update_key_st Spec.Blake2S Core.M32 =
| Impl.blake2_update_key #Spec.Blake2S #Core.M32 update_block | false |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.init | val init:Impl.blake2_init_st Spec.Blake2S Core.M32 | val init:Impl.blake2_init_st Spec.Blake2S Core.M32 | let init : Impl.blake2_init_st Spec.Blake2S Core.M32 =
Impl.blake2_init #Spec.Blake2S #Core.M32 | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 14,
"start_col": 0,
"start_line": 13
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32 | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_init_st Spec.Blake2.Definitions.Blake2S Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_init",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32"
] | [] | false | false | false | true | false | let init:Impl.blake2_init_st Spec.Blake2S Core.M32 =
| Impl.blake2_init #Spec.Blake2S #Core.M32 | false |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update_multi | val update_multi:Impl.blake2_update_multi_st Spec.Blake2S Core.M32 | val update_multi:Impl.blake2_update_multi_st Spec.Blake2S Core.M32 | let update_multi : Impl.blake2_update_multi_st Spec.Blake2S Core.M32 =
Impl.blake2_update_multi #Spec.Blake2S #Core.M32 update_block | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 20,
"start_col": 0,
"start_line": 19
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_multi_st Spec.Blake2.Definitions.Blake2S
Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update_multi",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32",
"Hacl.Blake2s_32.update_block"
] | [] | false | false | false | true | false | let update_multi:Impl.blake2_update_multi_st Spec.Blake2S Core.M32 =
| Impl.blake2_update_multi #Spec.Blake2S #Core.M32 update_block | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.size_window_t | val size_window_t : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0}
-> Type0 | let size_window_t (a_t:inttype_a) (len:size_t{v len > 0}) =
l:size_t{0 < v l /\ v l < bits a_t /\ v l < 32 /\ pow2 (v l) * v len <= max_size_t} | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 120,
"start_col": 0,
"start_line": 119
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0}
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.l_and",
"Prims.op_LessThan",
"Lib.IntTypes.bits",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.pow2",
"L... | [] | false | false | false | false | true | let size_window_t (a_t: inttype_a) (len: size_t{v len > 0}) =
| l: size_t{0 < v l /\ v l < bits a_t /\ v l < 32 /\ pow2 (v l) * v len <= max_size_t} | false | |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.table_inv_t | val table_inv_t : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
table_len: Hacl.Impl.Exponentiation.table_len_t len
-> Type | let table_inv_t (a_t:inttype_a) (len:size_t{v len > 0}) (table_len:table_len_t len) =
a:LSeq.lseq (uint_t a_t SEC) (v len)
-> table:LSeq.lseq (uint_t a_t SEC) (v (table_len *! len)) -> GTot Type0 | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 129,
"start_col": 0,
"start_line": 127
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
table_len: Hacl.Impl.Exponentiation.table_len_t len
-> Type | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.table_len_t",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.SEC",
"Lib.IntTypes.op_Star_... | [] | false | false | false | false | true | let table_inv_t (a_t: inttype_a) (len: size_t{v len > 0}) (table_len: table_len_t len) =
| a: LSeq.lseq (uint_t a_t SEC) (v len) -> table: LSeq.lseq (uint_t a_t SEC) (v (table_len *! len))
-> GTot Type0 | false | |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update_blocks | val update_blocks:Impl.blake2_update_blocks_st Spec.Blake2S Core.M32 | val update_blocks:Impl.blake2_update_blocks_st Spec.Blake2S Core.M32 | let update_blocks : Impl.blake2_update_blocks_st Spec.Blake2S Core.M32 =
Impl.blake2_update_blocks #Spec.Blake2S #Core.M32 update_multi update_last | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 76,
"end_line": 27,
"start_col": 0,
"start_line": 26
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_blocks_st Spec.Blake2.Definitions.Blake2S
Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update_blocks",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32",
"Hacl.Blake2s_32.update_multi",
"Hacl.Blake2s_32.update_last"
] | [] | false | false | false | true | false | let update_blocks:Impl.blake2_update_blocks_st Spec.Blake2S Core.M32 =
| Impl.blake2_update_blocks #Spec.Blake2S #Core.M32 update_multi update_last | false |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update_last | val update_last:Impl.blake2_update_last_st Spec.Blake2S Core.M32 | val update_last:Impl.blake2_update_last_st Spec.Blake2S Core.M32 | let update_last : Impl.blake2_update_last_st Spec.Blake2S Core.M32 =
Impl.blake2_update_last #Spec.Blake2S #Core.M32 update_block | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 23,
"start_col": 0,
"start_line": 22
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_last_st Spec.Blake2.Definitions.Blake2S
Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update_last",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32",
"Hacl.Blake2s_32.update_block"
] | [] | false | false | false | true | false | let update_last:Impl.blake2_update_last_st Spec.Blake2S Core.M32 =
| Impl.blake2_update_last #Spec.Blake2S #Core.M32 update_block | false |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.update | val update:Impl.blake2_update_st Spec.Blake2S Core.M32 | val update:Impl.blake2_update_st Spec.Blake2S Core.M32 | let update : Impl.blake2_update_st Spec.Blake2S Core.M32 =
Impl.blake2_update #Spec.Blake2S #Core.M32 update_key update_blocks | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 69,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_update_st Spec.Blake2.Definitions.Blake2S Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_update",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32",
"Hacl.Blake2s_32.update_key",
"Hacl.Blake2s_32.update_blocks"
] | [] | false | false | false | true | false | let update:Impl.blake2_update_st Spec.Blake2S Core.M32 =
| Impl.blake2_update #Spec.Blake2S #Core.M32 update_key update_blocks | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.lexp_fw_st | val lexp_fw_st : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len
-> Type0 | let lexp_fw_st
(a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len)
(l:size_window_t a_t len) =
ctx:lbuffer (uint_t a_t SEC) ctx_len
-> a:lbuffer (uint_t a_t SEC) len
-> bLen:size_t
-> bBits:size_t{(v bBits - 1) / bits a_t < v bLen}
-> b:lbuffer (uint_t a_t SEC... | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 100,
"end_line": 270,
"start_col": 0,
"start_line": 247
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"Hacl.Impl.Exponentiation.size_window_t",
"Lib.Buffer.lbuffer",
"Lib.IntTyp... | [] | false | false | false | false | true | let lexp_fw_st
(a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
=
|
ctx: lbuffer (uint_t a_t SEC) ctx_len ->
a: lbuffer (uint_t a_t SEC) len ->
bLen: size_t ->
bBits: size_t{(v bBits - 1) / bits a_t < v bLen} ->
b: lbuffer (uint_t a_t SEC) bLen ->
res: lbuffer (uint_t a_t SEC) len
-> Stack unit
(requires
fun h ->
live h a /\ live h b /... | false | |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.malloc_with_key | val malloc_with_key:Impl.blake2_malloc_st Spec.Blake2S Core.M32 | val malloc_with_key:Impl.blake2_malloc_st Spec.Blake2S Core.M32 | let malloc_with_key : Impl.blake2_malloc_st Spec.Blake2S Core.M32 =
Impl.blake2_malloc Spec.Blake2S Core.M32 | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 37,
"start_col": 0,
"start_line": 36
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_malloc_st Spec.Blake2.Definitions.Blake2S Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_malloc",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32"
] | [] | false | false | false | true | false | let malloc_with_key:Impl.blake2_malloc_st Spec.Blake2S Core.M32 =
| Impl.blake2_malloc Spec.Blake2S Core.M32 | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.pow_a_to_small_b_st | val pow_a_to_small_b_st : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len ->
table_len:... | let pow_a_to_small_b_st
(a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len)
(l:size_window_t a_t len)
(table_len:table_len_t len)
(table_inv:table_inv_t a_t len table_len) =
ctx:lbuffer (uint_t a_t SEC) ctx_len
-> a:Ghost.erased (LSeq.lseq (uint_t a_t SEC) (v le... | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 76,
"end_line": 154,
"start_col": 0,
"start_line": 133
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len ->
table_len: Hacl.Impl.Exponentia... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"Hacl.Impl.Exponentiation.size_window_t",
"Hacl.Impl.Exponentiation.table_len... | [] | false | false | false | false | true | let pow_a_to_small_b_st
(a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
(table_len: table_len_t len)
(table_inv: table_inv_t a_t len table_len)
=
|
ctx: lbuffer (uint_t a_t SEC) ctx_len ->
a: Ghost.erased (LSeq.lseq (uint_t a_t SEC) (v len)) ->
table: clbuffer (uint_t a_t SEC) (table_len *! len) ->
b: uint_t a_t SEC {v b < pow2 (v l)} ->
res: lbuffer (uint_t a_t SEC) len
-> Stack unit
(requires
fun h ->
live h table /... | false | |
Hacl.Blake2s_32.fst | Hacl.Blake2s_32.finish | val finish:Impl.blake2_finish_st Spec.Blake2S Core.M32 | val finish:Impl.blake2_finish_st Spec.Blake2S Core.M32 | let finish : Impl.blake2_finish_st Spec.Blake2S Core.M32 =
Impl.blake2_finish #Spec.Blake2S #Core.M32 | {
"file_name": "code/blake2/Hacl.Blake2s_32.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 34,
"start_col": 0,
"start_line": 33
} | module Hacl.Blake2s_32
module Spec = Spec.Blake2
module Impl = Hacl.Impl.Blake2.Generic
module Core = Hacl.Impl.Blake2.Core
(* Some specialized components of blake2 *)
[@CInline]
private
let update_block : Impl.blake2_update_block_st Spec.Blake2S Core.M32 =
Impl.blake2_update_block #Spec.Blake2S #Core.M32
let init... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"Hacl.Impl.Blake2.Generic.fst.checked",
"Hacl.Impl.Blake2.Core.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Hacl.Blake2s_32.fst"
} | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": "Core"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Blake2.Generic",
"short_module": "Impl"
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": false,
... | {
"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 | Hacl.Impl.Blake2.Generic.blake2_finish_st Spec.Blake2.Definitions.Blake2S Hacl.Impl.Blake2.Core.M32 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Blake2.Generic.blake2_finish",
"Spec.Blake2.Definitions.Blake2S",
"Hacl.Impl.Blake2.Core.M32"
] | [] | false | false | false | true | false | let finish:Impl.blake2_finish_st Spec.Blake2S Core.M32 =
| Impl.blake2_finish #Spec.Blake2S #Core.M32 | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.table_inv_precomp | val table_inv_precomp
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
(table_len: table_len_t len)
: table_inv_t a_t len table_len | val table_inv_precomp
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
(table_len: table_len_t len)
: table_inv_t a_t len table_len | let table_inv_precomp
(#a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len)
(l:size_window_t a_t len)
(table_len:table_len_t len) : table_inv_t a_t len table_len =
fun a table ->
1 < v table_len /\ v table_len = pow2 (v l) /\
(forall (j:nat{j < v table_len}).
... | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 61,
"end_line": 215,
"start_col": 0,
"start_line": 205
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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 |
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len ->
table_len: Hacl.Impl.Exponentiation.table_len_t len
-> Hacl.Impl.Exponentiation.table_in... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"Hacl.Impl.Exponentiation.size_window_t",
"Hacl.Impl.Exponentiation.table_len... | [] | false | false | false | false | false | let table_inv_precomp
(#a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
(table_len: table_len_t len)
: table_inv_t a_t len table_len =
| fun a table ->
1 < v table_len /\ v table_len = pow2 (v l) /\
(forall (j: nat{j < v table_len}). PT.precomp_table_inv len ctx_len k a table_len table j) | false |
Hacl.Impl.Exponentiation.fsti | Hacl.Impl.Exponentiation.lexp_fw_table_st | val lexp_fw_table_st : a_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len ->
table_len: Ha... | let lexp_fw_table_st
(a_t:inttype_a)
(len:size_t{v len > 0})
(ctx_len:size_t)
(k:concrete_ops a_t len ctx_len)
(l:size_window_t a_t len)
(table_len:table_len_t len)
(table_inv:table_inv_t a_t len table_len) =
ctx:lbuffer (uint_t a_t SEC) ctx_len
-> a:lbuffer (uint_t a_t SEC) len
-> bLen:size_t
-... | {
"file_name": "code/bignum/Hacl.Impl.Exponentiation.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 87,
"end_line": 184,
"start_col": 0,
"start_line": 158
} | module Hacl.Impl.Exponentiation
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 S = Lib.Exponentiation
module BD = Hacl.Bignum.Definitions
module PT = Hacl.Impl.PrecompTable
include Hacl.Impl.Exponenti... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.PrecompTable.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Bignu... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
"abbrev": true,
"full_module": "Hacl.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SN"
},
{
"abbrev": true,
"full... | {
"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_t: Hacl.Impl.Exponentiation.Definitions.inttype_a ->
len: Lib.IntTypes.size_t{Lib.IntTypes.v len > 0} ->
ctx_len: Lib.IntTypes.size_t ->
k: Hacl.Impl.Exponentiation.Definitions.concrete_ops a_t len ctx_len ->
l: Hacl.Impl.Exponentiation.size_window_t a_t len ->
table_len: Hacl.Impl.Exponentia... | Prims.Tot | [
"total"
] | [] | [
"Hacl.Impl.Exponentiation.Definitions.inttype_a",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"Hacl.Impl.Exponentiation.size_window_t",
"Hacl.Impl.Exponentiation.table_len... | [] | false | false | false | false | true | let lexp_fw_table_st
(a_t: inttype_a)
(len: size_t{v len > 0})
(ctx_len: size_t)
(k: concrete_ops a_t len ctx_len)
(l: size_window_t a_t len)
(table_len: table_len_t len)
(table_inv: table_inv_t a_t len table_len)
=
|
ctx: lbuffer (uint_t a_t SEC) ctx_len ->
a: lbuffer (uint_t a_t SEC) len ->
bLen: size_t ->
bBits: size_t{(v bBits - 1) / bits a_t < v bLen} ->
b: lbuffer (uint_t a_t SEC) bLen ->
table: clbuffer (uint_t a_t SEC) (table_len *! len) ->
res: lbuffer (uint_t a_t SEC) len
-> Stack unit
... | false | |
Steel.Reference.fst | Steel.Reference.read_refine_pt | val read_refine_pt (#a:Type0) (#p:perm) (q:a -> vprop) (r:ref a)
: SteelT a (h_exists (fun (v:a) -> pts_to r p v `star` q v))
(fun v -> pts_to r p v `star` q v) | val read_refine_pt (#a:Type0) (#p:perm) (q:a -> vprop) (r:ref a)
: SteelT a (h_exists (fun (v:a) -> pts_to r p v `star` q v))
(fun v -> pts_to r p v `star` q v) | let read_refine_pt #a #p q r =
Classical.forall_intro_2 reveal_equiv;
lift_exists (fun (v:a) -> pts_to r p v `star` q v);
exists_cong (fun (v:U.raise_t a) -> pts_to r p (U.downgrade_val v) `star` q (U.downgrade_val v))
(fun (v:U.raise_t a) -> H.pts_to r p v `star` U.lift_dom q v);
let x = H.read... | {
"file_name": "lib/steel/Steel.Reference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 28,
"end_line": 122,
"start_col": 0,
"start_line": 112
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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 agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"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 | q: (_: a -> Steel.Effect.Common.vprop) -> r: Steel.Reference.ref a -> Steel.Effect.SteelT a | Steel.Effect.SteelT | [] | [] | [
"Steel.FractionalPermission.perm",
"Steel.Effect.Common.vprop",
"Steel.Reference.ref",
"Steel.Effect.Atomic.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.Effect.Common.VStar",
"Steel.Reference.pts_to",
"FStar.Universe.downgrade_val",
"Prims.unit"... | [] | false | true | false | false | false | let read_refine_pt #a #p q r =
| Classical.forall_intro_2 reveal_equiv;
lift_exists (fun (v: a) -> (pts_to r p v) `star` (q v));
exists_cong (fun (v: U.raise_t a) -> (pts_to r p (U.downgrade_val v)) `star` (q (U.downgrade_val v))
)
(fun (v: U.raise_t a) -> (H.pts_to r p v) `star` (U.lift_dom q v));
let x = H.read_refine (U.lift_dom q) r in
rewrite... | false |
Hacl.Impl.Ed25519.Verify.fst | Hacl.Impl.Ed25519.Verify.verify | val verify:
public_key:lbuffer uint8 32ul
-> msg_len:size_t
-> msg:lbuffer uint8 msg_len
-> signature:lbuffer uint8 64ul ->
Stack bool
(requires fun h ->
live h public_key /\ live h msg /\ live h signature)
(ensures fun h0 z h1 -> modifies0 h0 h1 /\
z == Spec.Ed25519.verify (as_seq h0 pu... | val verify:
public_key:lbuffer uint8 32ul
-> msg_len:size_t
-> msg:lbuffer uint8 msg_len
-> signature:lbuffer uint8 64ul ->
Stack bool
(requires fun h ->
live h public_key /\ live h msg /\ live h signature)
(ensures fun h0 z h1 -> modifies0 h0 h1 /\
z == Spec.Ed25519.verify (as_seq h0 pu... | let verify public_key msg_len msg signature =
push_frame ();
let a' = create 20ul (u64 0) in
let h0 = ST.get () in
Spec.Ed25519.Lemmas.point_decompress_lemma (as_seq h0 public_key);
let b = Hacl.Impl.Ed25519.PointDecompress.point_decompress a' public_key in
let res = if b then verify_valid_pk public_key msg... | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.Verify.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 144,
"start_col": 0,
"start_line": 136
} | module Hacl.Impl.Ed25519.Verify
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module BSeq = Lib.ByteSequence
open Hacl.Bignum25519
module F51 = Hacl.Impl.Ed25519.Field51
module PM = Hacl.Impl.Ed25519.Ladder
#reset-options "--z3rlimi... | {
"checked_file": "/",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.SHA512.ModQ.fst.checked",
"Hacl.Impl.Load56.fst.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "PM"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Field51",
"short_module": "F51"
},
{
"abbrev": false,
"full_module": "Hacl.Bignum25519",
"short_module": null
},
{
"abbrev": tr... | {
"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 |
public_key: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
msg_len: Lib.IntTypes.size_t ->
msg: Lib.Buffer.lbuffer Lib.IntTypes.uint8 msg_len ->
signature: Lib.Buffer.lbuffer Lib.IntTypes.uint8 64ul
-> FStar.HyperStack.ST.Stack Prims.bool | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Lib.IntTypes.size_t",
"Prims.bool",
"Prims.unit",
"FStar.HyperStack.ST.pop_frame",
"Hacl.Impl.Ed25519.Verify.verify_valid_pk",
"Hacl.Impl.Ed25519.PointDecompress.point_decompress",
"Spec.Ed25519.Lemmas.point_decompress_lemma"... | [] | false | true | false | false | false | let verify public_key msg_len msg signature =
| push_frame ();
let a' = create 20ul (u64 0) in
let h0 = ST.get () in
Spec.Ed25519.Lemmas.point_decompress_lemma (as_seq h0 public_key);
let b = Hacl.Impl.Ed25519.PointDecompress.point_decompress a' public_key in
let res = if b then verify_valid_pk public_key msg_len msg signature a' else false in
pop_frame ();
res | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_nondep_correct9 | val compute_gen_elim_nondep_correct9 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7 t8 t9: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7; t8; t9]) | val compute_gen_elim_nondep_correct9 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7 t8 t9: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7; t8; t9]) | let compute_gen_elim_nondep_correct9
(i0: gen_elim_i)
(t1 t2 t3 t4 t5 t6 t7 t8 t9: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7; t8; t9])
= fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _) (exists_ (fun x1 -> exists_ (fun x2 -> exists_ (fun x3 -> e... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 637,
"start_col": 0,
"start_line": 618
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
i0: Steel.ST.GenElim1.Base.gen_elim_i ->
t1: Type ->
t2: Type ->
t3: Type ->
t4: Type ->
t5: Type ->
t6: Type ->
t7: Type ->
t8: Type ->
t9: Type
-> Steel.ST.GenElim1.compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7; t8; t9] | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.Base.curried_function_type",
"Prims.Cons",
"Prims.Nil",
"FStar.Universe.raise_t",
"Prims.unit",
"Steel.Effect.Common.vprop",
"Prims.prop",
"Steel.ST.GenElim1.vprop_rewrite",
"Steel.ST.GenElim1.Base.compute_gen_elim_p",
"Steel.ST.GenElim1.ge... | [] | false | false | false | false | false | let compute_gen_elim_nondep_correct9 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7 t8 t9: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7; t8; t9]) =
| fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _)
(exists_ (fun x1 ->
exists_ (fun x2 ->
exists_ (fun x3 ->
exists_ (fun x4 ->
exists_ (fun x5 ->
exists_ (fun x6 ->
... | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.splitAt_length | val splitAt_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l_1, l_2 = splitAt n l in
if length l < n
then length l_1 == length l /\ length l_2 == 0
else length l_1 == n /\ length l_2 = length l - n))
(decreases n) | val splitAt_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l_1, l_2 = splitAt n l in
if length l < n
then length l_1 == length l /\ length l_2 == 0
else length l_1 == n /\ length l_2 = length l - n))
(decreases n) | let rec splitAt_length
(#a:Type)
(n:nat)
(l:list a)
: Lemma (requires True)
(ensures begin
let l_1, l_2 = splitAt n l in
if length l < n then
length l_1 == length l /\ length l_2 == 0
else
length l_1 == n /\ length l_2 = length l - n
end)
(decreases n)
=
if n = 0 ... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 42,
"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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.splitAt n l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l_1 l_2 = _ in
(match FStar.List.Tot.Base.length l < n with
| true ->
FStar.List.Tot.Base.length ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.List.Pure.Properties.splitAt_length",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.l_and",
"Prims.eq2",
"Prims.b2t",
"FSt... | [
"recursion"
] | false | false | true | false | false | let rec splitAt_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l_1, l_2 = splitAt n l in
if length l < n
then length l_1 == length l /\ length l_2 == 0
else length l_1 == n /\ length l_2 = length l - n))
(decreases n) =
| if n = 0
then ()
else
match l with
| [] -> ()
| _ :: xs -> splitAt_length (n - 1) xs | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.splitAt_length_total | val splitAt_length_total (#a: Type) (l: list a)
: Lemma (requires True) (ensures (splitAt (length l) l == (l, []))) (decreases l) | val splitAt_length_total (#a: Type) (l: list a)
: Lemma (requires True) (ensures (splitAt (length l) l == (l, []))) (decreases l) | let rec splitAt_length_total (#a:Type) (l:list a)
: Lemma (requires True) (ensures (splitAt (length l) l == (l, []))) (decreases l)
=
match l with
| [] -> ()
| x :: xs -> splitAt_length_total xs | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 69,
"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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.splitAt (FStar.List.Tot.Base.length l) l == (l, []))
(decreases l) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.list",
"FStar.List.Pure.Properties.splitAt_length_total",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt",
"FStar.List.Tot.Base.length",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"FStar.Pervasives.pattern"... | [
"recursion"
] | false | false | true | false | false | let rec splitAt_length_total (#a: Type) (l: list a)
: Lemma (requires True) (ensures (splitAt (length l) l == (l, []))) (decreases l) =
| match l with
| [] -> ()
| x :: xs -> splitAt_length_total xs | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.splitAt_assoc | val splitAt_assoc (#a: Type) (n1 n2: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l1, l2 = splitAt n1 l in
let l2, l3 = splitAt n2 l2 in
let l1', l2' = splitAt (n1 + n2) l in
l1' == l1 @ l2 /\ l2' == l3))
(decreases n1) | val splitAt_assoc (#a: Type) (n1 n2: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l1, l2 = splitAt n1 l in
let l2, l3 = splitAt n2 l2 in
let l1', l2' = splitAt (n1 + n2) l in
l1' == l1 @ l2 /\ l2' == l3))
(decreases n1) | let rec splitAt_assoc
(#a:Type)
(n1 n2:nat)
(l:list a)
: Lemma (requires True)
(ensures begin
let l1, l2 = splitAt n1 l in
let l2, l3 = splitAt n2 l2 in
let l1', l2' = splitAt (n1+n2) l in
l1' == l1 @ l2 /\ l2' == l3
end)
(decreases n1)
=
if n1 = 0 then ()
else
match... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 61,
"start_col": 0,
"start_line": 44
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 | n1: Prims.nat -> n2: Prims.nat -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.splitAt n1 l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l1 l2 = _ in
let _ = FStar.List.Tot.Base.splitAt n2 l2 in
(let FStar.Pervasives.Native.Mktuple2 ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.List.Pure.Properties.splitAt_assoc",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"FStar.List.Tot.Base.op_At",
"FStar.Pervasives.Native.tuple2",
"FStar.L... | [
"recursion"
] | false | false | true | false | false | let rec splitAt_assoc (#a: Type) (n1 n2: nat) (l: list a)
: Lemma (requires True)
(ensures
(let l1, l2 = splitAt n1 l in
let l2, l3 = splitAt n2 l2 in
let l1', l2' = splitAt (n1 + n2) l in
l1' == l1 @ l2 /\ l2' == l3))
(decreases n1) =
| if n1 = 0
then ()
else
match l with
| [] -> ()
| x :: xs -> splitAt_assoc (n1 - 1) n2 xs | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_append_splitAt | val lemma_append_splitAt (#t: Type) (l1 l2: list t)
: Lemma (ensures (splitAt (length l1) (append l1 l2) == (l1, l2))) | val lemma_append_splitAt (#t: Type) (l1 l2: list t)
: Lemma (ensures (splitAt (length l1) (append l1 l2) == (l1, l2))) | let rec lemma_append_splitAt (#t:Type) (l1 l2:list t) :
Lemma
(ensures (splitAt (length l1) (append l1 l2) == (l1, l2))) =
match l1 with
| [] -> ()
| _ -> lemma_append_splitAt (tl l1) l2 | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 94,
"start_col": 0,
"start_line": 89
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 | l1: Prims.list t -> l2: Prims.list t
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.splitAt (FStar.List.Tot.Base.length l1) (l1 @ l2) == (l1, l2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.List.Pure.Properties.lemma_append_splitAt",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Base.append",
"FStar.Pervasives.N... | [
"recursion"
] | false | false | true | false | false | let rec lemma_append_splitAt (#t: Type) (l1 l2: list t)
: Lemma (ensures (splitAt (length l1) (append l1 l2) == (l1, l2))) =
| match l1 with
| [] -> ()
| _ -> lemma_append_splitAt (tl l1) l2 | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt | val lemma_splitAt (#t: Type) (l l1 l2: list t) (n: nat{n <= length l})
: Lemma (splitAt n l == (l1, l2) <==> l == l1 @ l2 /\ length l1 = n) | val lemma_splitAt (#t: Type) (l l1 l2: list t) (n: nat{n <= length l})
: Lemma (splitAt n l == (l1, l2) <==> l == l1 @ l2 /\ length l1 = n) | let lemma_splitAt (#t: Type) (l l1 l2:list t) (n:nat{n <= length l}) :
Lemma (splitAt n l == (l1, l2) <==> l == l1 @ l2 /\ length l1 = n) =
lemma_splitAt_append n l;
lemma_append_splitAt l1 l2 | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 101,
"start_col": 0,
"start_line": 98
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t ->
l1: Prims.list t ->
l2: Prims.list t ->
n: Prims.nat{n <= FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.splitAt n l == (l1, l2) <==>
l == l1 @ l2 /\ FStar.List.Tot.Base.length l1 = n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"FStar.List.Pure.Properties.lemma_append_splitAt",
"Prims.unit",
"FStar.List.Pure.Properties.lemma_splitAt_append",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Prims.eq2",
"FStar.Pervasives.... | [] | true | false | true | false | false | let lemma_splitAt (#t: Type) (l l1 l2: list t) (n: nat{n <= length l})
: Lemma (splitAt n l == (l1, l2) <==> l == l1 @ l2 /\ length l1 = n) =
| lemma_splitAt_append n l;
lemma_append_splitAt l1 l2 | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt_append | val lemma_splitAt_append (#a: Type) (n: nat) (l: list a)
: Lemma (requires n <= length l)
(ensures
(let l1, l2 = splitAt n l in
append l1 l2 == l /\ length l1 = n)) | val lemma_splitAt_append (#a: Type) (n: nat) (l: list a)
: Lemma (requires n <= length l)
(ensures
(let l1, l2 = splitAt n l in
append l1 l2 == l /\ length l1 = n)) | let rec lemma_splitAt_append (#a:Type) (n:nat) (l:list a) :
Lemma
(requires n <= length l)
(ensures (let l1, l2 = splitAt n l in
append l1 l2 == l /\ length l1 = n)) =
match n with
| 0 -> ()
| _ ->
match l with
| [] -> ()
| x :: xs -> lemma_splitAt_append (n-1) xs | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 84,
"start_col": 0,
"start_line": 74
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 -> l: Prims.list a
-> FStar.Pervasives.Lemma (requires n <= FStar.List.Tot.Base.length l)
(ensures
(let _ = FStar.List.Tot.Base.splitAt n l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ l1 l2 = _ in
l1 @ l2 == l /\ FStar.List.Tot.Base.length l1 = n)
<:
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.int",
"FStar.List.Pure.Properties.lemma_splitAt_append",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"Prims.op_Equali... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_append (#a: Type) (n: nat) (l: list a)
: Lemma (requires n <= length l)
(ensures
(let l1, l2 = splitAt n l in
append l1 l2 == l /\ length l1 = n)) =
| match n with
| 0 -> ()
| _ ->
match l with
| [] -> ()
| x :: xs -> lemma_splitAt_append (n - 1) xs | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt_shorten_left | val lemma_splitAt_shorten_left
(#t: Type)
(l1 l2: list t)
(i: nat{i <= length l1 /\ i <= length l2})
(j: nat{j <= i})
: Lemma (requires (fst (splitAt i l1) == fst (splitAt i l2)))
(ensures (fst (splitAt j l1) == fst (splitAt j l2))) | val lemma_splitAt_shorten_left
(#t: Type)
(l1 l2: list t)
(i: nat{i <= length l1 /\ i <= length l2})
(j: nat{j <= i})
: Lemma (requires (fst (splitAt i l1) == fst (splitAt i l2)))
(ensures (fst (splitAt j l1) == fst (splitAt j l2))) | let rec lemma_splitAt_shorten_left
(#t:Type) (l1 l2:list t) (i:nat{i <= length l1 /\ i <= length l2}) (j:nat{j <= i}) :
Lemma
(requires (fst (splitAt i l1) == fst (splitAt i l2)))
(ensures (fst (splitAt j l1) == fst (splitAt j l2))) =
match j with
| 0 -> ()
| _ ->
lemma_splitAt_shorten_left (tl ... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 128,
"start_col": 0,
"start_line": 120
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 |
l1: Prims.list t ->
l2: Prims.list t ->
i: Prims.nat{i <= FStar.List.Tot.Base.length l1 /\ i <= FStar.List.Tot.Base.length l2} ->
j: Prims.nat{j <= i}
-> FStar.Pervasives.Lemma
(requires
FStar.Pervasives.Native.fst (FStar.List.Tot.Base.splitAt i l1) ==
FStar.Pervasives.Native.fs... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.int",
"FStar.List.Pure.Properties.lemma_splitAt_shorten_left",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.fst",
... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_shorten_left
(#t: Type)
(l1 l2: list t)
(i: nat{i <= length l1 /\ i <= length l2})
(j: nat{j <= i})
: Lemma (requires (fst (splitAt i l1) == fst (splitAt i l2)))
(ensures (fst (splitAt j l1) == fst (splitAt j l2))) =
| match j with
| 0 -> ()
| _ -> lemma_splitAt_shorten_left (tl l1) (tl l2) (i - 1) (j - 1) | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_index | val lemma_split3_index (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
b == index l n)) | val lemma_split3_index (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
b == index l n)) | let lemma_split3_index (#t:Type) (l:list t) (n:nat{n < length l}) :
Lemma
(requires True)
(ensures (
let a, b, c = split3 l n in
b == index l n)) =
lemma_splitAt_index_hd n l | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 179,
"start_col": 0,
"start_line": 173
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> n: Prims.nat{n < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.split3 l n in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ _ b _ = _ in
b == FStar.List.Tot.Base.index l n)
<:
Type0)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.List.Pure.Properties.lemma_splitAt_index_hd",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.index",
"FStar.Pervasives.Native.tuple3",
"FStar.List.Tot.Base.split... | [] | true | false | true | false | false | let lemma_split3_index (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
b == index l n)) =
| lemma_splitAt_index_hd n l | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt_reindex_left | val lemma_splitAt_reindex_left (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j < i)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length left /\ index left j == index l j)) | val lemma_splitAt_reindex_left (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j < i)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length left /\ index left j == index l j)) | let rec lemma_splitAt_reindex_left (#t:Type) (i:nat) (l:list t) (j:nat) :
Lemma
(requires i <= length l /\ j < i)
(ensures (
let left, right = splitAt i l in
splitAt_length i l;
j < length left /\ index left j == index l j)) =
match i, j with
| 1, _ | _, 0 -> ()
| _ -> lemma_spli... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 141,
"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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 | i: Prims.nat -> l: Prims.list t -> j: Prims.nat
-> FStar.Pervasives.Lemma (requires i <= FStar.List.Tot.Base.length l /\ j < i)
(ensures
(let _ = FStar.List.Tot.Base.splitAt i l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ left _ = _ in
FStar.List.Pure.Properties.splitAt_length i... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"Prims.int",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Pure.Properties.lemma_splitAt_reindex_left",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FSta... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_reindex_left (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j < i)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length left /\ index left j == index l j)) =
| match i, j with
| 1, _ | _, 0 -> ()
| _ -> lemma_splitAt_reindex_left (i - 1) (tl l) (j - 1) | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt_index_hd | val lemma_splitAt_index_hd (#t: Type) (n: nat) (l: list t)
: Lemma (requires (n < length l))
(ensures
(let l1, l2 = splitAt n l in
splitAt_length n l;
length l2 > 0 /\ hd l2 == index l n)) | val lemma_splitAt_index_hd (#t: Type) (n: nat) (l: list t)
: Lemma (requires (n < length l))
(ensures
(let l1, l2 = splitAt n l in
splitAt_length n l;
length l2 > 0 /\ hd l2 == index l n)) | let rec lemma_splitAt_index_hd (#t:Type) (n:nat) (l:list t) :
Lemma
(requires (n < length l))
(ensures (let l1, l2 = splitAt n l in
splitAt_length n l;
length l2 > 0 /\ hd l2 == index l n)) =
let x :: xs = l in
match n with
| 0 -> ()
| _ -> lemma_splitAt_index_hd (n - 1) (t... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 115,
"start_col": 0,
"start_line": 106
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 -> l: Prims.list t
-> FStar.Pervasives.Lemma (requires n < FStar.List.Tot.Base.length l)
(ensures
(let _ = FStar.List.Tot.Base.splitAt n l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ _ l2 = _ in
FStar.List.Pure.Properties.splitAt_length n l;
FStar.List.T... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.int",
"FStar.List.Pure.Properties.lemma_splitAt_index_hd",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.squash",
"Prims.l_and",
"Prims.op_GreaterThan",
"Prims.eq2",
... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_index_hd (#t: Type) (n: nat) (l: list t)
: Lemma (requires (n < length l))
(ensures
(let l1, l2 = splitAt n l in
splitAt_length n l;
length l2 > 0 /\ hd l2 == index l n)) =
| let x :: xs = l in
match n with
| 0 -> ()
| _ -> lemma_splitAt_index_hd (n - 1) (tl l) | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_append | val lemma_split3_append (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
l == append a (b :: c))) | val lemma_split3_append (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
l == append a (b :: c))) | let lemma_split3_append (#t:Type) (l:list t) (n:nat{n < length l}) :
Lemma
(requires True)
(ensures (
let a, b, c = split3 l n in
l == append a (b :: c))) =
lemma_splitAt_append n l | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 169,
"start_col": 0,
"start_line": 163
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> n: Prims.nat{n < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.split3 l n in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ a b c = _ in
l == a @ b :: c)
<:
Type0)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.List.Pure.Properties.lemma_splitAt_append",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"FStar.Pervasives.Native.tuple3",
"FStar.List... | [] | true | false | true | false | false | let lemma_split3_append (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
l == append a (b :: c))) =
| lemma_splitAt_append n l | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_r_hd | val lemma_split3_r_hd (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma
(ensures
(let a, b, c = split3 l i in
lemma_split3_length l i;
length c > 0 ==> i + 1 < length l /\ hd c == index l (i + 1))) | val lemma_split3_r_hd (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma
(ensures
(let a, b, c = split3 l i in
lemma_split3_length l i;
length c > 0 ==> i + 1 < length l /\ hd c == index l (i + 1))) | let rec lemma_split3_r_hd (#t:Type) (l:list t) (i:nat{i < length l}) :
Lemma
(ensures (let a, b, c = split3 l i in
lemma_split3_length l i;
length c > 0 ==> i + 1 < length l /\ hd c == index l (i + 1))) =
match i with
| 0 -> ()
| _ -> lemma_split3_r_hd (tl l) (i - 1) | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 275,
"start_col": 0,
"start_line": 268
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> i: Prims.nat{i < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.split3 l i in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ _ _ c = _ in
FStar.List.Pure.Properties.lemma_split3_length l i;
FStar.List.Tot.Base.leng... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.int",
"FStar.List.Pure.Properties.lemma_split3_r_hd",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Prims.op_GreaterThan",
"... | [
"recursion"
] | false | false | true | false | false | let rec lemma_split3_r_hd (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma
(ensures
(let a, b, c = split3 l i in
lemma_split3_length l i;
length c > 0 ==> i + 1 < length l /\ hd c == index l (i + 1))) =
| match i with
| 0 -> ()
| _ -> lemma_split3_r_hd (tl l) (i - 1) | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_splitAt_reindex_right | val lemma_splitAt_reindex_right (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j + i < length l)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length right /\ index right j == index l (j + i))) | val lemma_splitAt_reindex_right (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j + i < length l)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length right /\ index right j == index l (j + i))) | let rec lemma_splitAt_reindex_right (#t:Type) (i:nat) (l:list t) (j:nat) :
Lemma
(requires i <= length l /\ j + i < length l)
(ensures (
let left, right = splitAt i l in
splitAt_length i l;
j < length right /\ index right j == index l (j + i))) =
match i with
| 0 -> ()
| _ -> lem... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 155,
"start_col": 0,
"start_line": 146
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 | i: Prims.nat -> l: Prims.list t -> j: Prims.nat
-> FStar.Pervasives.Lemma
(requires i <= FStar.List.Tot.Base.length l /\ j + i < FStar.List.Tot.Base.length l)
(ensures
(let _ = FStar.List.Tot.Base.splitAt i l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ _ right = _ in
FStar... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.int",
"FStar.List.Pure.Properties.lemma_splitAt_reindex_right",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.op_LessThan",
"Prims.op_Addition",
... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_reindex_right (#t: Type) (i: nat) (l: list t) (j: nat)
: Lemma (requires i <= length l /\ j + i < length l)
(ensures
(let left, right = splitAt i l in
splitAt_length i l;
j < length right /\ index right j == index l (j + i))) =
| match i with
| 0 -> ()
| _ -> lemma_splitAt_reindex_right (i - 1) (tl l) j | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_unsnoc_split3 | val lemma_unsnoc_split3 (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (requires (i <> length l - 1))
(ensures
(let xs, x = unsnoc l in
i < length xs /\
(let a0, b0, c0 = split3 l i in
let a1, b1, c1 = split3 xs i in
a0 == a1 /\ b0 == b1))) | val lemma_unsnoc_split3 (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (requires (i <> length l - 1))
(ensures
(let xs, x = unsnoc l in
i < length xs /\
(let a0, b0, c0 = split3 l i in
let a1, b1, c1 = split3 xs i in
a0 == a1 /\ b0 == b1))) | let lemma_unsnoc_split3 (#t:Type) (l:list t) (i:nat{i < length l}) :
Lemma
(requires (i <> length l - 1))
(ensures (
let xs, x = unsnoc l in
i < length xs /\ (
let a0, b0, c0 = split3 l i in
let a1, b1, c1 = split3 xs i in
a0 == a1 /\ b0 == b1))) =
let xs,... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 265,
"start_col": 0,
"start_line": 246
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> i: Prims.nat{i < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma (requires i <> FStar.List.Tot.Base.length l - 1)
(ensures
(let _ = FStar.List.Tot.Base.unsnoc l in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ xs _ = _ in
i < FStar.List.Tot.Base.length xs /... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.List.Pure.Properties.lemma_split3_on_same_leftprefix",
"Prims.unit",
"FStar.List.Pure.Properties.lemma_splitAt_shorten_left",
"Prims.op_Addition",
"FStar.List.Pure.Properties.splitAt_length_total",
... | [] | false | false | true | false | false | let lemma_unsnoc_split3 (#t: Type) (l: list t) (i: nat{i < length l})
: Lemma (requires (i <> length l - 1))
(ensures
(let xs, x = unsnoc l in
i < length xs /\
(let a0, b0, c0 = split3 l i in
let a1, b1, c1 = split3 xs i in
a0 == a1 /\ b0 == b1))) =
| let xs, x = unsnoc l in
lemma_unsnoc_length l;
let a0, b0, c0 = split3 l i in
let a1, b1, c1 = split3 xs i in
splitAt_length_total xs;
lemma_splitAt_shorten_left xs l (length xs) (i + 1);
lemma_split3_on_same_leftprefix l xs i | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_unsnoc | val lemma_split3_unsnoc (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires (n <> length l - 1))
(ensures
(let a, b, c = split3 l n in
lemma_split3_length l n;
length c > 0 /\
(let xs, x = unsnoc l in
let ys, y = unsnoc c in
append a (b... | val lemma_split3_unsnoc (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires (n <> length l - 1))
(ensures
(let a, b, c = split3 l n in
lemma_split3_length l n;
length c > 0 /\
(let xs, x = unsnoc l in
let ys, y = unsnoc c in
append a (b... | let rec lemma_split3_unsnoc (#t:Type) (l:list t) (n:nat{n < length l}) :
Lemma
(requires (n <> length l - 1))
(ensures (
let a, b, c = split3 l n in
lemma_split3_length l n;
length c > 0 /\ (
let xs, x = unsnoc l in
let ys, y = unsnoc c in
append a (b :: y... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 241,
"start_col": 0,
"start_line": 229
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> n: Prims.nat{n < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma (requires n <> FStar.List.Tot.Base.length l - 1)
(ensures
(let _ = FStar.List.Tot.Base.split3 l n in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ a b c = _ in
FStar.List.Pure.Properties.le... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.int",
"FStar.List.Pure.Properties.lemma_split3_unsnoc",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.op_disEquality",
"Prims.squash",
"Prims.l_and",
"Prims.op_Greater... | [
"recursion"
] | false | false | true | false | false | let rec lemma_split3_unsnoc (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires (n <> length l - 1))
(ensures
(let a, b, c = split3 l n in
lemma_split3_length l n;
length c > 0 /\
(let xs, x = unsnoc l in
let ys, y = unsnoc c in
append ... | match n with
| 0 -> ()
| _ -> lemma_split3_unsnoc (tl l) (n - 1) | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.sel | val sel (#a #b: _) (m: map' a b) (x: a) : Tot (option (b x)) | val sel (#a #b: _) (m: map' a b) (x: a) : Tot (option (b x)) | let sel #a #b (m:map' a b) (x:a)
: Tot (option (b x))
= m x | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 39,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.map' a b -> x: a -> FStar.Pervasives.Native.option (b x) | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Map.map'",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | false | false | let sel #a #b (m: map' a b) (x: a) : Tot (option (b x)) =
| m x | false |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_on_same_leftprefix | val lemma_split3_on_same_leftprefix
(#t: Type)
(l1 l2: list t)
(n: nat{n < length l1 /\ n < length l2})
: Lemma (requires (fst (splitAt (n + 1) l1) == fst (splitAt (n + 1) l2)))
(ensures
(let a1, b1, c1 = split3 l1 n in
let a2, b2, c2 = split3 l2 n in
a1 == a2 /\ ... | val lemma_split3_on_same_leftprefix
(#t: Type)
(l1 l2: list t)
(n: nat{n < length l1 /\ n < length l2})
: Lemma (requires (fst (splitAt (n + 1) l1) == fst (splitAt (n + 1) l2)))
(ensures
(let a1, b1, c1 = split3 l1 n in
let a2, b2, c2 = split3 l2 n in
a1 == a2 /\ ... | let lemma_split3_on_same_leftprefix
(#t:Type) (l1 l2:list t) (n:nat{n < length l1 /\ n < length l2}) :
Lemma
(requires (fst (splitAt (n+1) l1) == fst (splitAt (n+1) l2)))
(ensures (let a1, b1, c1 = split3 l1 n in
let a2, b2, c2 = split3 l2 n in
a1 == a2 /\ b1 == b2)) =
let a1... | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 224,
"start_col": 0,
"start_line": 194
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 |
l1: Prims.list t ->
l2: Prims.list t ->
n: Prims.nat{n < FStar.List.Tot.Base.length l1 /\ n < FStar.List.Tot.Base.length l2}
-> FStar.Pervasives.Lemma
(requires
FStar.Pervasives.Native.fst (FStar.List.Tot.Base.splitAt (n + 1) l1) ==
FStar.Pervasives.Native.fst (FStar.List.Tot.Base.s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.unit",
"FStar.List.Tot.Properties.append_length_inv_tail",
"Prims.Cons",
"Prims.Nil",
"FStar.List.Tot.Properties.append_length_inv_head",
"FStar.List.Tot.Base.append",
"FStar.List... | [] | false | false | true | false | false | let lemma_split3_on_same_leftprefix
(#t: Type)
(l1 l2: list t)
(n: nat{n < length l1 /\ n < length l2})
: Lemma (requires (fst (splitAt (n + 1) l1) == fst (splitAt (n + 1) l2)))
(ensures
(let a1, b1, c1 = split3 l1 n in
let a2, b2, c2 = split3 l2 n in
a1 == a2 /\ ... | let a1, b1, c1 = split3 l1 n in
let a2, b2, c2 = split3 l2 n in
lemma_split3_append l1 n;
lemma_split3_append l2 n;
lemma_split3_length l1 n;
lemma_split3_length l2 n;
append_l_cons b1 c1 a1;
append_l_cons b2 c2 a2;
let x1, y1 = splitAt (n + 1) l1 in
let x2, y2 = splitAt (n + 1) l2 in
lemma_splitAt_append (n + 1) l1;
l... | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.grows | val grows : FStar.Preorder.preorder (FStar.Monotonic.Map.map a b inv) | let grows #a #b #inv = grows_aux #a #b #inv | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | FStar.Preorder.preorder (FStar.Monotonic.Map.map a b inv) | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.grows_aux",
"FStar.Preorder.preorder",
"FStar.Monotonic.Map.map"
] | [] | false | false | false | false | false | let grows #a #b #inv =
| grows_aux #a #b #inv | false | |
FStar.List.Pure.Properties.fst | FStar.List.Pure.Properties.lemma_split3_length | val lemma_split3_length (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
length a = n /\ length c = length l - n - 1)) | val lemma_split3_length (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
length a = n /\ length c = length l - n - 1)) | let lemma_split3_length (#t:Type) (l:list t) (n:nat{n < length l}) :
Lemma
(requires True)
(ensures (
let a, b, c = split3 l n in
length a = n /\ length c = length l - n - 1)) =
splitAt_length n l | {
"file_name": "ulib/FStar.List.Pure.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 189,
"start_col": 0,
"start_line": 183
} | (*
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.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Pure.Base.fst.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Pure.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Base",
"short_module": null
},
{
"abbrev": fa... | {
"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 t -> n: Prims.nat{n < FStar.List.Tot.Base.length l}
-> FStar.Pervasives.Lemma
(ensures
(let _ = FStar.List.Tot.Base.split3 l n in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ a _ c = _ in
FStar.List.Tot.Base.length a = n /\
FStar.List.Tot.Base.length c = FStar.Lis... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.List.Pure.Properties.splitAt_length",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple3",
... | [] | true | false | true | false | false | let lemma_split3_length (#t: Type) (l: list t) (n: nat{n < length l})
: Lemma (requires True)
(ensures
(let a, b, c = split3 l n in
length a = n /\ length c = length l - n - 1)) =
| splitAt_length n l | false |
FStar.Fin.fsti | FStar.Fin.fin | val fin : n: Prims.nat -> Type0 | let fin (n: nat) = k: int {0 <= k /\ k < n} | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sh... | {
"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 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan"
] | [] | false | false | false | true | true | let fin (n: nat) =
| k: int{0 <= k /\ k < n} | false | |
FStar.Fin.fsti | FStar.Fin.under | val under : p: Prims.nat -> Type0 | let under (p:nat) = x:nat {x<p} | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 42,
"start_col": 0,
"start_line": 42
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sh... | {
"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 | p: Prims.nat -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan"
] | [] | false | false | false | true | true | let under (p: nat) =
| x: nat{x < p} | false | |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.empty_map | val empty_map (a b: _) : Tot (map' a b) | val empty_map (a b: _) : Tot (map' a b) | let empty_map a b
: Tot (map' a b)
= fun x -> None | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 54,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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: (_: a -> Type) -> FStar.Monotonic.Map.map' a b | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"FStar.Monotonic.Map.map'"
] | [] | false | false | false | false | false | let empty_map a b : Tot (map' a b) =
| fun x -> None | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.fresh | val fresh (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 | val fresh (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 | let fresh #r #a #b #inv (m:t r a b inv) (x:a) (h:HS.mem)
: GTot Type0
= None? (sel (HS.sel h m) x) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 80,
"start_col": 0,
"start_line": 78
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_None",
"FStar.Monotonic.Map.sel",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows"
] | [] | false | false | false | false | true | let fresh #r #a #b #inv (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 =
| None? (sel (HS.sel h m) x) | false |
FStar.Fin.fsti | FStar.Fin.in_ | val in_ : s: FStar.Seq.Base.seq a -> Type0 | let in_ (#a: Type) (s: S.seq a) = n: nat{n < S.length s} | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 54,
"start_col": 0,
"start_line": 54
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sh... | {
"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.Seq.Base.seq a -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length"
] | [] | false | false | false | true | true | let in_ (#a: Type) (s: S.seq a) =
| n: nat{n < S.length s} | false | |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.defined | val defined (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 | val defined (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 | let defined #r #a #b #inv (m:t r a b inv) (x:a) (h:HS.mem)
: GTot Type0
= Some? (sel (HS.sel h m) x) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 68,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.Monotonic.Map.sel",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows"
] | [] | false | false | false | false | true | let defined #r #a #b #inv (m: t r a b inv) (x: a) (h: HS.mem) : GTot Type0 =
| Some? (sel (HS.sel h m) x) | false |
FStar.Fin.fsti | FStar.Fin.items_of | val items_of : eq: FStar.Fin.equivalence_relation a -> s: FStar.Seq.Base.seq a -> Type | let items_of #a (eq: equivalence_relation a) (s: S.seq a)
= x:a { contains_eq eq s x } | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 133,
"start_col": 0,
"start_line": 132
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"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 | eq: FStar.Fin.equivalence_relation a -> s: FStar.Seq.Base.seq a -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"FStar.Fin.contains_eq"
] | [] | false | false | false | true | true | let items_of #a (eq: equivalence_relation a) (s: S.seq a) =
| x: a{contains_eq eq s x} | false | |
FStar.Fin.fsti | FStar.Fin.contains_eq | val contains_eq : eq: FStar.Fin.equivalence_relation a -> s: FStar.Seq.Base.seq a -> x: a -> Prims.logical | let contains_eq #a (eq: equivalence_relation a) (s: S.seq a) (x:a)
= exists (i:under (S.length s)). eq x (S.index s i) | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 124,
"start_col": 0,
"start_line": 123
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"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 | eq: FStar.Fin.equivalence_relation a -> s: FStar.Seq.Base.seq a -> x: a -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"Prims.l_Exists",
"FStar.Fin.under",
"FStar.Seq.Base.length",
"Prims.b2t",
"FStar.Seq.Base.index",
"Prims.logical"
] | [] | false | false | false | true | true | let contains_eq #a (eq: equivalence_relation a) (s: S.seq a) (x: a) =
| exists (i: under (S.length s)). eq x (S.index s i) | false | |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.upd | val upd (#a: eqtype) (#b: _) (m: map' a b) (x: a) (y: b x) : Tot (map' a b) | val upd (#a: eqtype) (#b: _) (m: map' a b) (x: a) (y: b x) : Tot (map' a b) | let upd (#a:eqtype) #b (m:map' a b) (x:a) (y:b x)
: Tot (map' a b)
= fun z -> if x = z then Some y else m z | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 35,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.map' a b -> x: a -> y: b x -> FStar.Monotonic.Map.map' a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.Monotonic.Map.map'",
"Prims.op_Equality",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | false | false | let upd (#a: eqtype) #b (m: map' a b) (x: a) (y: b x) : Tot (map' a b) =
| fun z -> if x = z then Some y else m z | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.grows_aux | val grows_aux (#a #b #inv: _) : Preorder.preorder (map a b inv) | val grows_aux (#a #b #inv: _) : Preorder.preorder (map a b inv) | let grows_aux #a #b #inv :Preorder.preorder (map a b inv) =
fun (m1 m2:map a b inv) ->
forall x.{:pattern (Some? (m1 x))}
Some? (m1 x) ==> Some? (m2 x) /\ Some?.v (m1 x) == Some?.v (m2 x) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 71,
"end_line": 44,
"start_col": 0,
"start_line": 41
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | FStar.Preorder.preorder (FStar.Monotonic.Map.map a b inv) | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.map",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.__proj__Some__item__v",
"Prims.logical",
"FStar.Preorder.preorder"
] | [] | false | false | false | false | false | let grows_aux #a #b #inv : Preorder.preorder (map a b inv) =
| fun (m1: map a b inv) (m2: map a b inv) ->
forall x. {:pattern (Some? (m1 x))}
Some? (m1 x) ==> Some? (m2 x) /\ Some?.v (m1 x) == Some?.v (m2 x) | false |
FStar.UInt.fsti | FStar.UInt.max_int | val max_int (n: nat) : Tot int | val max_int (n: nat) : Tot int | let max_int (n:nat) : Tot int = pow2 n - 1 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | n: Prims.nat -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Subtraction",
"Prims.pow2",
"Prims.int"
] | [] | false | false | false | true | false | let max_int (n: nat) : Tot int =
| pow2 n - 1 | false |
FStar.UInt.fsti | FStar.UInt.min_int | val min_int (n: nat) : Tot int | val min_int (n: nat) : Tot int | let min_int (n:nat) : Tot int = 0 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | n: Prims.nat -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.int"
] | [] | false | false | false | true | false | let min_int (n: nat) : Tot int =
| 0 | false |
FStar.UInt.fsti | FStar.UInt.fits | val fits (x: int) (n: nat) : Tot bool | val fits (x: int) (n: nat) : Tot bool | let fits (x:int) (n:nat) : Tot bool = min_int n <= x && x <= max_int n | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | x: Prims.int -> n: Prims.nat -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"FStar.UInt.min_int",
"FStar.UInt.max_int",
"Prims.bool"
] | [] | false | false | false | true | false | let fits (x: int) (n: nat) : Tot bool =
| min_int n <= x && x <= max_int n | false |
FStar.UInt.fsti | FStar.UInt.size | val size (x: int) (n: nat) : Tot Type0 | val size (x: int) (n: nat) : Tot Type0 | let size (x:int) (n:nat) : Tot Type0 = b2t(fits x n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 50,
"start_col": 0,
"start_line": 50
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | x: Prims.int -> n: Prims.nat -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.nat",
"Prims.b2t",
"FStar.UInt.fits"
] | [] | false | false | false | true | true | let size (x: int) (n: nat) : Tot Type0 =
| b2t (fits x n) | false |
FStar.Fin.fsti | FStar.Fin.vect | val vect : n: Prims.nat -> a: Type -> Type | let vect (n: nat) (a: Type) = l: list a {L.length l = n} | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sh... | {
"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 -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.b2t",
"Prims.op_Equality",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | true | true | let vect (n: nat) (a: Type) =
| l: list a {L.length l = n} | false | |
FStar.Fin.fsti | FStar.Fin.seqn | val seqn : n: Prims.nat -> a: Type -> Type | let seqn (n: nat) (a: Type) = s: S.seq a {S.length s = n} | {
"file_name": "ulib/FStar.Fin.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 50,
"start_col": 0,
"start_line": 50
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Fin.fsti"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sh... | {
"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 -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"Prims.b2t",
"Prims.op_Equality",
"FStar.Seq.Base.length"
] | [] | false | false | false | true | true | let seqn (n: nat) (a: Type) =
| s: S.seq a {S.length s = n} | false | |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.contains_stable | val contains_stable (#r #a #b #inv: _) (m: t r a b inv) (x: a) (y: b x)
: Lemma (ensures (stable_on_t m (contains m x y))) | val contains_stable (#r #a #b #inv: _) (m: t r a b inv) (x: a) (y: b x)
: Lemma (ensures (stable_on_t m (contains m x y))) | let contains_stable #r #a #b #inv (m:t r a b inv) (x:a) (y:b x)
: Lemma (ensures (stable_on_t m (contains m x y)))
= reveal_opaque (`%grows) (grows #a #b #inv) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 84,
"start_col": 0,
"start_line": 82
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a -> y: b x
-> FStar.Pervasives.Lemma
(ensures FStar.HyperStack.ST.stable_on_t m (FStar.Monotonic.Map.contains m x y)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.HyperStack.ST.stable_on_t",
"FStar.Monotoni... | [] | true | false | true | false | false | let contains_stable #r #a #b #inv (m: t r a b inv) (x: a) (y: b x)
: Lemma (ensures (stable_on_t m (contains m x y))) =
| reveal_opaque (`%grows) (grows #a #b #inv) | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.contains | val contains (#r #a #b #inv: _) (m: t r a b inv) (x: a) (y: b x) (h: HS.mem) : GTot Type0 | val contains (#r #a #b #inv: _) (m: t r a b inv) (x: a) (y: b x) (h: HS.mem) : GTot Type0 | let contains #r #a #b #inv (m:t r a b inv) (x:a) (y:b x) (h:HS.mem)
: GTot Type0
= Some? (sel (HS.sel h m) x) /\ Some?.v (sel (HS.sel h m) x) == y | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 72,
"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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a -> y: b x -> h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.Monotonic.Map.sel",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grow... | [] | false | false | false | false | true | let contains #r #a #b #inv (m: t r a b inv) (x: a) (y: b x) (h: HS.mem) : GTot Type0 =
| Some? (sel (HS.sel h m) x) /\ Some?.v (sel (HS.sel h m) x) == y | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.value | val value (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem{defined m x h})
: GTot (r: b x {contains m x r h}) | val value (#r #a #b #inv: _) (m: t r a b inv) (x: a) (h: HS.mem{defined m x h})
: GTot (r: b x {contains m x r h}) | let value #r #a #b #inv (m:t r a b inv) (x:a) (h:HS.mem{defined m x h})
: GTot (r:b x{contains m x r h})
= Some?.v (sel (HS.sel h m) x) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 76,
"start_col": 0,
"start_line": 74
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 |
m: FStar.Monotonic.Map.t r a b inv ->
x: a ->
h: FStar.Monotonic.HyperStack.mem{FStar.Monotonic.Map.defined m x h}
-> Prims.GTot (r: b x {FStar.Monotonic.Map.contains m x r h}) | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.Map.defined",
"FStar.Pervasives.Native.__proj__Some__item__v",
"FStar.Monotonic.Map.sel",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Map.map",
"FStar.Monotoni... | [] | false | false | false | false | false | let value #r #a #b #inv (m: t r a b inv) (x: a) (h: HS.mem{defined m x h})
: GTot (r: b x {contains m x r h}) =
| Some?.v (sel (HS.sel h m) x) | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.lookup | val lookup (#r #a #b #inv: _) (m: t r a b inv) (x: a)
: ST (option (b x))
(requires (fun h -> True))
(ensures
(fun h0 y h1 ->
h0 == h1 /\ y == sel (HS.sel h1 m) x /\ (None? y ==> fresh m x h1) /\
(Some? y ==>
defined m x h1 /\ contains m x (Some?.v y) h1 /\ ... | val lookup (#r #a #b #inv: _) (m: t r a b inv) (x: a)
: ST (option (b x))
(requires (fun h -> True))
(ensures
(fun h0 y h1 ->
h0 == h1 /\ y == sel (HS.sel h1 m) x /\ (None? y ==> fresh m x h1) /\
(Some? y ==>
defined m x h1 /\ contains m x (Some?.v y) h1 /\ ... | let lookup #r #a #b #inv (m:t r a b inv) (x:a)
: ST (option (b x))
(requires (fun h -> True))
(ensures (fun h0 y h1 ->
h0==h1 /\
y == sel (HS.sel h1 m) x /\
(None? y ==> fresh m x h1) /\
(Some? y ==>
defined m x h1 /\
contains m x (Some?.v y) h1 /\
... | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 126,
"start_col": 0,
"start_line": 106
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a
-> FStar.HyperStack.ST.ST (FStar.Pervasives.Native.option (b x)) | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.HyperStack.ST.erid",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.Pervasives.Native.option",
"Prims.unit",
"FStar.HyperStack.ST.mr_witness",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows",
"FStar.Monotonic.Map.contains",
"FStar.Monotonic.Map.defined",
"FStar.Monoton... | [] | false | true | false | false | false | let lookup #r #a #b #inv (m: t r a b inv) (x: a)
: ST (option (b x))
(requires (fun h -> True))
(ensures
(fun h0 y h1 ->
h0 == h1 /\ y == sel (HS.sel h1 m) x /\ (None? y ==> fresh m x h1) /\
(Some? y ==>
defined m x h1 /\ contains m x (Some?.v y) h1 /\ HST.w... | reveal_opaque (`%grows) (grows #a #b #inv);
let y = sel !m x in
match y with
| None -> y
| Some b ->
contains_stable m x b;
mr_witness m (defined m x);
mr_witness m (contains m x b);
y | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.alloc | val alloc (#r: rid) (#a #b #inv: _)
: ST (t r a b inv)
(requires (fun h -> inv (empty_map a b) /\ witnessed (region_contains_pred r)))
(ensures (fun h0 x h1 -> inv (empty_map a b) /\ ralloc_post r (empty_map a b) h0 x h1)) | val alloc (#r: rid) (#a #b #inv: _)
: ST (t r a b inv)
(requires (fun h -> inv (empty_map a b) /\ witnessed (region_contains_pred r)))
(ensures (fun h0 x h1 -> inv (empty_map a b) /\ ralloc_post r (empty_map a b) h0 x h1)) | let alloc (#r:rid) #a #b #inv
: ST (t r a b inv)
(requires (fun h -> inv (empty_map a b) /\ witnessed (region_contains_pred r)))
(ensures (fun h0 x h1 ->
inv (empty_map a b) /\
ralloc_post r (empty_map a b) h0 x h1))
= ralloc r (empty_map a b) | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 64,
"start_col": 0,
"start_line": 58
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | FStar.HyperStack.ST.ST (FStar.Monotonic.Map.t r a b inv) | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.Monotonic.Map.rid",
"FStar.Monotonic.Map.map'",
"FStar.HyperStack.ST.ralloc",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows",
"FStar.Monotonic.Map.empty_map",
"FStar.HyperStack.ST.mref",
"FStar.Monotonic.Map.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"FStar.HyperStack.ST... | [] | false | true | false | false | false | let alloc (#r: rid) #a #b #inv
: ST (t r a b inv)
(requires (fun h -> inv (empty_map a b) /\ witnessed (region_contains_pred r)))
(ensures (fun h0 x h1 -> inv (empty_map a b) /\ ralloc_post r (empty_map a b) h0 x h1)) =
| ralloc r (empty_map a b) | false |
FStar.Monotonic.Map.fst | FStar.Monotonic.Map.extend | val extend
(#r: rid)
(#a: eqtype)
(#b: (a -> Type))
(#inv: (map' a b -> Type0))
(m: t r a b inv)
(x: a)
(y: b x)
: ST unit
(requires
(fun h ->
let cur = HS.sel h m in
inv (upd cur x y) /\ sel cur x == None))
(ensures
(fun ... | val extend
(#r: rid)
(#a: eqtype)
(#b: (a -> Type))
(#inv: (map' a b -> Type0))
(m: t r a b inv)
(x: a)
(y: b x)
: ST unit
(requires
(fun h ->
let cur = HS.sel h m in
inv (upd cur x y) /\ sel cur x == None))
(ensures
(fun ... | let extend (#r:rid) (#a:eqtype) (#b:a -> Type) (#inv:(map' a b -> Type0)) (m:t r a b inv) (x:a) (y:b x)
: ST unit
(requires (fun h -> let cur = HS.sel h m in inv (upd cur x y) /\ sel cur x == None))
(ensures (fun h0 u h1 ->
let cur = HS.sel h0 m in
let hsref = m in
HS.contains h1 m... | {
"file_name": "ulib/FStar.Monotonic.Map.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 104,
"start_col": 0,
"start_line": 86
} | (*
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.Set.fsti.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_file": "FStar.Monotonic.Map.fst"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"f... | {
"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 | m: FStar.Monotonic.Map.t r a b inv -> x: a -> y: b x -> FStar.HyperStack.ST.ST Prims.unit | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.Monotonic.Map.rid",
"Prims.eqtype",
"FStar.Monotonic.Map.map'",
"FStar.Monotonic.Map.t",
"FStar.HyperStack.ST.mr_witness",
"FStar.Monotonic.Map.map",
"FStar.Monotonic.Map.grows",
"FStar.Monotonic.Map.contains",
"Prims.unit",
"FStar.Monotonic.Map.defined",
"FStar.Monotonic.Map.contains_sta... | [] | false | true | false | false | false | let extend
(#r: rid)
(#a: eqtype)
(#b: (a -> Type))
(#inv: (map' a b -> Type0))
(m: t r a b inv)
(x: a)
(y: b x)
: ST unit
(requires
(fun h ->
let cur = HS.sel h m in
inv (upd cur x y) /\ sel cur x == None))
(ensures
(fun ... | recall m;
reveal_opaque (`%grows) (grows #a #b #inv);
let cur = !m in
m := upd cur x y;
contains_stable m x y;
mr_witness m (defined m x);
mr_witness m (contains m x y) | false |
FStar.UInt.fsti | FStar.UInt.ones | val ones (n: nat) : Tot (uint_t n) | val ones (n: nat) : Tot (uint_t n) | let ones (n:nat) : Tot (uint_t n) = max_int n | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 64,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | n: Prims.nat -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.max_int",
"FStar.UInt.uint_t"
] | [] | false | false | false | false | false | let ones (n: nat) : Tot (uint_t n) =
| max_int n | false |
FStar.UInt.fsti | FStar.UInt.zero | val zero (n: nat) : Tot (uint_t n) | val zero (n: nat) : Tot (uint_t n) | let zero (n:nat) : Tot (uint_t n) = 0 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 57,
"start_col": 0,
"start_line": 57
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | n: Prims.nat -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t"
] | [] | false | false | false | false | false | let zero (n: nat) : Tot (uint_t n) =
| 0 | false |
FStar.UInt.fsti | FStar.UInt.pow2_n | val pow2_n (#n: pos) (p: nat{p < n}) : Tot (uint_t n) | val pow2_n (#n: pos) (p: nat{p < n}) : Tot (uint_t n) | let pow2_n (#n:pos) (p:nat{p < n}) : Tot (uint_t n) =
pow2_le_compat (n - 1) p; pow2 p | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 60,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | p: Prims.nat{p < n} -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Prims.unit",
"FStar.Math.Lemmas.pow2_le_compat",
"Prims.op_Subtraction",
"FStar.UInt.uint_t"
] | [] | false | false | false | false | false | let pow2_n (#n: pos) (p: nat{p < n}) : Tot (uint_t n) =
| pow2_le_compat (n - 1) p;
pow2 p | false |
FStar.UInt.fsti | FStar.UInt.decr_mod | val decr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) | val decr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) | let decr_mod (#n:nat) (a:uint_t n) : Tot (uint_t n) = (a - 1) % (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 85,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Modulus",
"Prims.op_Subtraction",
"Prims.pow2"
] | [] | false | false | false | false | false | let decr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) =
| (a - 1) % (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.incr | val incr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a < max_int n))) (ensures (fun _ -> True)) | val incr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a < max_int n))) (ensures (fun _ -> True)) | let incr (#n:nat) (a:uint_t n) : Pure (uint_t n)
(requires (b2t (a < max_int n))) (ensures (fun _ -> True))
= a + 1 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 69,
"start_col": 0,
"start_line": 67
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Addition",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt.max_int",
"Prims.l_True"
] | [] | false | false | false | false | false | let incr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a < max_int n))) (ensures (fun _ -> True)) =
| a + 1 | false |
FStar.UInt.fsti | FStar.UInt.incr_mod | val incr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) | val incr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) | let incr_mod (#n:nat) (a:uint_t n) : Tot (uint_t n) = (a + 1) % (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 83,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Modulus",
"Prims.op_Addition",
"Prims.pow2"
] | [] | false | false | false | false | false | let incr_mod (#n: nat) (a: uint_t n) : Tot (uint_t n) =
| (a + 1) % (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.add | val add (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a + b) n)) (ensures (fun _ -> True)) | val add (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a + b) n)) (ensures (fun _ -> True)) | let add (#n:nat) (a:uint_t n) (b:uint_t n) : Pure (uint_t n)
(requires (size (a + b) n))
(ensures (fun _ -> True))
= a + b | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 91,
"start_col": 0,
"start_line": 88
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Addition",
"FStar.UInt.size",
"Prims.l_True"
] | [] | false | false | false | false | false | let add (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a + b) n)) (ensures (fun _ -> True)) =
| a + b | false |
FStar.UInt.fsti | FStar.UInt.one | val one (n: pos) : Tot (uint_t n) | val one (n: pos) : Tot (uint_t n) | let one (n:pos) : Tot (uint_t n) = 1 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 62,
"start_col": 0,
"start_line": 62
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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 | n: Prims.pos -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t"
] | [] | false | false | false | false | false | let one (n: pos) : Tot (uint_t n) =
| 1 | false |
FStar.UInt.fsti | FStar.UInt.gt | val gt (#n: _) (a b: uint_t n) : Tot bool | val gt (#n: _) (a b: uint_t n) : Tot bool | let gt #n (a:uint_t n) (b:uint_t n) : Tot bool = (a > b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 166,
"start_col": 0,
"start_line": 166
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_GreaterThan",
"Prims.bool"
] | [] | false | false | false | false | false | let gt #n (a: uint_t n) (b: uint_t n) : Tot bool =
| (a > b) | false |
FStar.UInt.fsti | FStar.UInt.sub_mod | val sub_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | val sub_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | let sub_mod (#n:nat) (a:uint_t n) (b:uint_t n) : Tot (uint_t n) =
(a - b) % (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Modulus",
"Prims.op_Subtraction",
"Prims.pow2"
] | [] | false | false | false | false | false | let sub_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) =
| (a - b) % (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.gte | val gte (#n: _) (a b: uint_t n) : Tot bool | val gte (#n: _) (a b: uint_t n) : Tot bool | let gte #n (a:uint_t n) (b:uint_t n) : Tot bool = (a >= b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 167,
"start_col": 0,
"start_line": 167
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_GreaterThanOrEqual",
"Prims.bool"
] | [] | false | false | false | false | false | let gte #n (a: uint_t n) (b: uint_t n) : Tot bool =
| (a >= b) | false |
FStar.UInt.fsti | FStar.UInt.add_mod | val add_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | val add_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | let add_mod (#n:nat) (a:uint_t n) (b:uint_t n) : Tot (uint_t n) =
(a + b) % (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 99,
"start_col": 0,
"start_line": 98
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Modulus",
"Prims.op_Addition",
"Prims.pow2"
] | [] | false | false | false | false | false | let add_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) =
| (a + b) % (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.decr | val decr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a > min_int n))) (ensures (fun _ -> True)) | val decr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a > min_int n))) (ensures (fun _ -> True)) | let decr (#n:nat) (a:uint_t n) : Pure (uint_t n)
(requires (b2t (a > min_int n))) (ensures (fun _ -> True))
= a - 1 | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 73,
"start_col": 0,
"start_line": 71
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Subtraction",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.UInt.min_int",
"Prims.l_True"
] | [] | false | false | false | false | false | let decr (#n: nat) (a: uint_t n)
: Pure (uint_t n) (requires (b2t (a > min_int n))) (ensures (fun _ -> True)) =
| a - 1 | false |
FStar.UInt.fsti | FStar.UInt.lt | val lt (#n: _) (a b: uint_t n) : Tot bool | val lt (#n: _) (a b: uint_t n) : Tot bool | let lt #n (a:uint_t n) (b:uint_t n) : Tot bool = (a < b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 168,
"start_col": 0,
"start_line": 168
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_LessThan",
"Prims.bool"
] | [] | false | false | false | false | false | let lt #n (a: uint_t n) (b: uint_t n) : Tot bool =
| (a < b) | false |
FStar.UInt.fsti | FStar.UInt.lte | val lte (#n: _) (a b: uint_t n) : Tot bool | val lte (#n: _) (a b: uint_t n) : Tot bool | let lte #n (a:uint_t n) (b:uint_t n) : Tot bool = (a <= b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 169,
"start_col": 0,
"start_line": 169
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_LessThanOrEqual",
"Prims.bool"
] | [] | false | false | false | false | false | let lte #n (a: uint_t n) (b: uint_t n) : Tot bool =
| (a <= b) | false |
FStar.UInt.fsti | FStar.UInt.mod | val mod (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (uint_t n) | val mod (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (uint_t n) | let mod (#n:nat) (a:uint_t n) (b:uint_t n{b <> 0}) : Tot (uint_t n) =
a - ((a/b) * b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 162,
"start_col": 0,
"start_line": 161
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n {b <> 0} -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"Prims.op_Subtraction",
"FStar.Mul.op_Star",
"Prims.op_Division"
] | [] | false | false | false | false | false | let mod (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (uint_t n) =
| a - ((a / b) * b) | false |
FStar.UInt.fsti | FStar.UInt.mul_mod | val mul_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | val mul_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) | let mul_mod (#n:nat) (a:uint_t n) (b:uint_t n) : Tot (uint_t n) =
(a * b) % (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 127,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.pow2"
] | [] | false | false | false | false | false | let mul_mod (#n: nat) (a b: uint_t n) : Tot (uint_t n) =
| (a * b) % (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.mul | val mul (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a * b) n)) (ensures (fun _ -> True)) | val mul (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a * b) n)) (ensures (fun _ -> True)) | let mul (#n:nat) (a:uint_t n) (b:uint_t n) : Pure (uint_t n)
(requires (size (a * b) n))
(ensures (fun _ -> True))
= a * b | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 119,
"start_col": 0,
"start_line": 116
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"FStar.Mul.op_Star",
"FStar.UInt.size",
"Prims.l_True"
] | [] | false | false | false | false | false | let mul (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a * b) n)) (ensures (fun _ -> True)) =
| a * b | false |
FStar.UInt.fsti | FStar.UInt.sub | val sub (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a - b) n)) (ensures (fun _ -> True)) | val sub (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a - b) n)) (ensures (fun _ -> True)) | let sub (#n:nat) (a:uint_t n) (b:uint_t n) : Pure (uint_t n)
(requires (size (a - b) n))
(ensures (fun _ -> True))
= a - b | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 105,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Subtraction",
"FStar.UInt.size",
"Prims.l_True"
] | [] | false | false | false | false | false | let sub (#n: nat) (a b: uint_t n)
: Pure (uint_t n) (requires (size (a - b) n)) (ensures (fun _ -> True)) =
| a - b | false |
FStar.UInt.fsti | FStar.UInt.div | val div (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0})
: Pure (uint_t n) (requires (size (a / b) n)) (ensures (fun c -> b <> 0 ==> a / b = c)) | val div (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0})
: Pure (uint_t n) (requires (size (a / b) n)) (ensures (fun c -> b <> 0 ==> a / b = c)) | let div (#n:nat) (a:uint_t n) (b:uint_t n{b <> 0}) : Pure (uint_t n)
(requires (size (a / b) n))
(ensures (fun c -> b <> 0 ==> a / b = c))
= a / b | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 145,
"start_col": 0,
"start_line": 142
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n {b <> 0} -> Prims.Pure (FStar.UInt.uint_t n) | Prims.Pure | [] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"Prims.op_Division",
"FStar.UInt.size",
"Prims.l_imp",
"Prims.op_Equality"
] | [] | false | false | false | false | false | let div (#n: nat) (a: uint_t n) (b: uint_t n {b <> 0})
: Pure (uint_t n) (requires (size (a / b) n)) (ensures (fun c -> b <> 0 ==> a / b = c)) =
| a / b | false |
FStar.UInt.fsti | FStar.UInt.mul_div | val mul_div (#n: nat) (a b: uint_t n) : Tot (uint_t n) | val mul_div (#n: nat) (a b: uint_t n) : Tot (uint_t n) | let mul_div (#n:nat) (a:uint_t n) (b:uint_t n) : Tot (uint_t n) =
FStar.Math.Lemmas.lemma_mult_lt_sqr a b (pow2 n);
lt_square_div_lt (a * b) (pow2 n);
(a * b) / (pow2 n) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 138,
"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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Division",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.unit",
"FStar.UInt.lt_square_div_lt",
"FStar.Math.Lemmas.lemma_mult_lt_sqr"
] | [] | false | false | false | false | false | let mul_div (#n: nat) (a b: uint_t n) : Tot (uint_t n) =
| FStar.Math.Lemmas.lemma_mult_lt_sqr a b (pow2 n);
lt_square_div_lt (a * b) (pow2 n);
(a * b) / (pow2 n) | false |
FStar.UInt.fsti | FStar.UInt.xor | val xor (b b': bool) : Tot bool | val xor (b b': bool) : Tot bool | let xor (b:bool) (b':bool) : Tot bool = b <> b' | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 380,
"start_col": 8,
"start_line": 380
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"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: Prims.bool -> b': Prims.bool -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.op_disEquality"
] | [] | false | false | false | true | false | let xor (b b': bool) : Tot bool =
| b <> b' | false |
FStar.UInt.fsti | FStar.UInt.eq | val eq (#n: _) (a b: uint_t n) : Tot bool | val eq (#n: _) (a b: uint_t n) : Tot bool | let eq #n (a:uint_t n) (b:uint_t n) : Tot bool = (a = b) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 165,
"start_col": 0,
"start_line": 165
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt.uint_t",
"Prims.op_Equality",
"Prims.bool"
] | [] | false | false | false | false | false | let eq #n (a: uint_t n) (b: uint_t n) : Tot bool =
| (a = b) | false |
FStar.UInt.fsti | FStar.UInt.udiv | val udiv (#n: pos) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (c: uint_t n {b <> 0 ==> a / b = c}) | val udiv (#n: pos) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (c: uint_t n {b <> 0 ==> a / b = c}) | let udiv (#n:pos) (a:uint_t n) (b:uint_t n{b <> 0}) : Tot (c:uint_t n{b <> 0 ==> a / b = c}) =
div_size #n a b;
a / b | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 157,
"start_col": 0,
"start_line": 155
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"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: FStar.UInt.uint_t n -> b: FStar.UInt.uint_t n {b <> 0}
-> c: FStar.UInt.uint_t n {b <> 0 ==> a / b = c} | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.UInt.uint_t",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.int",
"Prims.op_Division",
"Prims.unit",
"FStar.UInt.div_size",
"Prims.l_imp",
"Prims.op_Equality"
] | [] | false | false | false | false | false | let udiv (#n: pos) (a: uint_t n) (b: uint_t n {b <> 0}) : Tot (c: uint_t n {b <> 0 ==> a / b = c}) =
| div_size #n a b;
a / b | false |
FStar.UInt.fsti | FStar.UInt.from_vec | val from_vec (#n: nat) (vec: bv_t n) : Tot (uint_t n) | val from_vec (#n: nat) (vec: bv_t n) : Tot (uint_t n) | let rec from_vec (#n:nat) (vec:bv_t n) : Tot (uint_t n) =
if n = 0 then 0
else 2 * from_vec #(n - 1) (slice vec 0 (n - 1)) + (if index vec (n - 1) then 1 else 0) | {
"file_name": "ulib/FStar.UInt.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 89,
"end_line": 186,
"start_col": 0,
"start_line": 184
} | (*
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.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.BitVector.fst.checked"
],
"interface_file": false,
"source_file": "FStar.UInt.fsti"
} | [
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Math.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.BitVector",
"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 | vec: FStar.BitVector.bv_t n -> FStar.UInt.uint_t n | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.BitVector.bv_t",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"FStar.UInt.from_vec",
"Prims.op_Subtraction",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.index",
"FStar.UInt.uint_t"
] | [
"recursion"
] | false | false | false | false | false | let rec from_vec (#n: nat) (vec: bv_t n) : Tot (uint_t n) =
| if n = 0
then 0
else 2 * from_vec #(n - 1) (slice vec 0 (n - 1)) + (if index vec (n - 1) then 1 else 0) | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.