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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Steel.Effect.Common.fsti | Steel.Effect.Common.solve_return_eqs | val solve_return_eqs (fuel: nat) : Tac unit | val solve_return_eqs (fuel: nat) : Tac unit | let rec solve_return_eqs (fuel: nat) : Tac unit =
if fuel = 0
then ()
else match goals () with
| [] -> ()
| hd::_ ->
let f = term_as_formula' (goal_type hd) in
match f with
| Comp (Eq _) l r ->
trefl();
solve_return_eqs (fuel - 1)
| _ -> later(); solve_return_eqs (fuel - 1) | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 47,
"end_line": 2738,
"start_col": 0,
"start_line": 2727
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | fuel: Prims.nat -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Prims.bool",
"FStar.Stubs.Tactics.Types.goal",
"Prims.list",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.NamedView.term",
"Steel.Effect.Common.solve_return_eqs",
"Prims.op_Subtraction",
"FS... | [
"recursion"
] | false | true | false | false | false | let rec solve_return_eqs (fuel: nat) : Tac unit =
| if fuel = 0
then ()
else
match goals () with
| [] -> ()
| hd :: _ ->
let f = term_as_formula' (goal_type hd) in
match f with
| Comp (Eq _) l r ->
trefl ();
solve_return_eqs (fuel - 1)
| _ ->
later ();
solve_return_eqs (fuel - 1) | false |
Steel.Primitive.ForkJoin.Unix.fst | Steel.Primitive.ForkJoin.Unix.bind | val bind
(a b: Type)
(#framed_f #framed_g: eqtype_as_type bool)
(#[@@@ framing_implicit]pre_f: pre_t)
(#[@@@ framing_implicit]post_f: post_t a)
(#[@@@ framing_implicit]pre_g: (a -> pre_t))
(#[@@@ framing_implicit]post_g: post_t b)
(#[@@@ framing_implicit]frame_f #[@@@ framing_i... | val bind
(a b: Type)
(#framed_f #framed_g: eqtype_as_type bool)
(#[@@@ framing_implicit]pre_f: pre_t)
(#[@@@ framing_implicit]post_f: post_t a)
(#[@@@ framing_implicit]pre_g: (a -> pre_t))
(#[@@@ framing_implicit]post_g: post_t b)
(#[@@@ framing_implicit]frame_f #[@@@ framing_i... | let bind (a:Type) (b:Type)
(#framed_f:eqtype_as_type bool) (#framed_g:eqtype_as_type bool)
(#[@@@ framing_implicit] pre_f:pre_t) (#[@@@ framing_implicit] post_f:post_t a)
(#[@@@ framing_implicit] pre_g:a -> pre_t) (#[@@@ framing_implicit] post_g:post_t b)
(#[@@@ framing_implicit] frame_f:vprop) (#[@@@ framing_i... | {
"file_name": "lib/steel/Steel.Primitive.ForkJoin.Unix.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 87,
"end_line": 117,
"start_col": 0,
"start_line": 85
} | (*
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.Reference.fsti.checked",
"Steel.Primitive.ForkJoin.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactic... | [
{
"abbrev": false,
"full_module": "Steel.Primitive.ForkJoin",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"ful... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
b: Type ->
f: Steel.Primitive.ForkJoin.Unix.steelK a framed_f pre_f post_f ->
g: (x: a -> Steel.Primitive.ForkJoin.Unix.steelK b framed_g (pre_g x) post_g)
-> Steel.Primitive.ForkJoin.Unix.steelK b
true
(Steel.Effect.Common.star pre_f frame_f)
(fun y -> Steel.Effect.Commo... | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.eqtype_as_type",
"Prims.bool",
"Steel.Effect.Common.pre_t",
"Steel.Effect.Common.post_t",
"Steel.Effect.Common.vprop",
"Prims.squash",
"Steel.Effect.Common.can_be_split_forall",
"Steel.Effect.Common.star",
"Steel.Effect.Common.maybe_emp",
"Steel.Primitive.ForkJoin.Unix.steelK",
... | [] | false | false | false | false | false | let bind
(a b: Type)
(#framed_f #framed_g: eqtype_as_type bool)
(#[@@@ framing_implicit]pre_f: pre_t)
(#[@@@ framing_implicit]post_f: post_t a)
(#[@@@ framing_implicit]pre_g: (a -> pre_t))
(#[@@@ framing_implicit]post_g: post_t b)
(#[@@@ framing_implicit]frame_f #[@@@ framing_i... | fun
#frame
(#post: vprop)
(k: (y: b -> SteelT unit (frame `star` ((post_g y) `star` frame_g)) (fun _ -> post)))
->
change_slprop_equiv (frame `star` (pre_f `star` frame_f))
((frame `star` frame_f) `star` pre_f)
(rearrange3 frame frame_f pre_f;
equiv_symmetric ((frame `star` frame_f) `star` pre_f... | false |
Steel.Effect.Common.fsti | Steel.Effect.Common.solve_maybe_emps | val solve_maybe_emps (fuel: nat) : Tac unit | val solve_maybe_emps (fuel: nat) : Tac unit | let rec solve_maybe_emps (fuel: nat) : Tac unit =
if fuel = 0
then ()
else match goals () with
| [] -> ()
| _::_ ->
let f = term_as_formula' (cur_goal ()) in (
match f with
| App hd0 t ->
if not (is_fvar hd0 (`%squash))
then later ()
else
let hd, args = collect_app t in
... | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 31,
"end_line": 3054,
"start_col": 0,
"start_line": 3030
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | fuel: Prims.nat -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Prims.bool",
"FStar.Stubs.Tactics.Types.goal",
"Prims.list",
"Steel.Effect.Common.solve_maybe_emps",
"Prims.op_Subtraction",
"FStar.Tactics.NamedView.term",
"Prims.op_Negation",
"FStar.Reflection.V2.Derived.is_fvar",
"FStar.Tactic... | [
"recursion"
] | false | true | false | false | false | let rec solve_maybe_emps (fuel: nat) : Tac unit =
| if fuel = 0
then ()
else
match goals () with
| [] -> ()
| _ :: _ ->
let f = term_as_formula' (cur_goal ()) in
(match f with
| App hd0 t ->
if not (is_fvar hd0 (`%squash))
then later ()
else
let hd, args = collect_app t in
if hd `is_fvar` (`%maybe_emp)
... | false |
Steel.Effect.Common.fsti | Steel.Effect.Common.ite_soundness_tac | val ite_soundness_tac: Prims.unit -> Tac unit | val ite_soundness_tac: Prims.unit -> Tac unit | let ite_soundness_tac () : Tac unit =
let slgs, loggoals = filter_goals (goals ()) in
set_goals slgs;
solve_indirection_eqs (List.Tot.length slgs);
// This is the actual subcomp goal. We can only solve it
// once all uvars are solved
let subcomp_goal = _cur_goal () in
match goals () with
| [] -> fail "s... | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 8,
"end_line": 3168,
"start_col": 0,
"start_line": 3143
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Tactics.V2.Derived.fail",
"FStar.Tactics.V2.Derived.smt",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Nil",
"FStar.Pervasives.norm_step",
"FStar.Stubs.Tactics.V2.Builtins.set_goals",
"Prims.Cons",
"Steel.Effect.Common.resolv... | [] | false | true | false | false | false | let ite_soundness_tac () : Tac unit =
| let slgs, loggoals = filter_goals (goals ()) in
set_goals slgs;
solve_indirection_eqs (List.Tot.length slgs);
let subcomp_goal = _cur_goal () in
match goals () with
| [] -> fail "should not happen"
| _ :: tl ->
set_goals tl;
or_else (fun _ -> apply_lemma (`equiv_forall_refl)) assumption;
or_else (fun _ ->
... | false |
Steel.Effect.Common.fsti | Steel.Effect.Common.filter_goals | val filter_goals (l: list goal) : Tac (list goal * list goal) | val filter_goals (l: list goal) : Tac (list goal * list goal) | let rec filter_goals (l:list goal) : Tac (list goal * list goal) =
match l with
| [] -> [], []
| hd::tl ->
let slgoals, loggoals = filter_goals tl in
match term_as_formula' (goal_type hd) with
| Comp (Eq t) _ _ ->
if Some? t then
let b = typ_contains_req_ens (Some?.v t) in
... | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 30,
"end_line": 3020,
"start_col": 0,
"start_line": 3001
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 FStar.Stubs.Tactics.Types.goal
-> FStar.Tactics.Effect.Tac
(Prims.list FStar.Stubs.Tactics.Types.goal * Prims.list FStar.Stubs.Tactics.Types.goal) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.list",
"FStar.Stubs.Tactics.Types.goal",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.NamedView.term",
"FStar.Pervasives.Native.uu___is_Some",
"Prims.Cons",
"Prims.bo... | [
"recursion"
] | false | true | false | false | false | let rec filter_goals (l: list goal) : Tac (list goal * list goal) =
| match l with
| [] -> [], []
| hd :: tl ->
let slgoals, loggoals = filter_goals tl in
match term_as_formula' (goal_type hd) with
| Comp (Eq t) _ _ ->
if Some? t
then
let b = typ_contains_req_ens (Some?.v t) in
if b then (slgoals, hd :: loggoals) else (hd :: slgoals, loggoals)
else (hd :: sl... | false |
Steel.Effect.Common.fsti | Steel.Effect.Common.norm_return_pre | val norm_return_pre (fuel: nat) : Tac unit | val norm_return_pre (fuel: nat) : Tac unit | let rec norm_return_pre (fuel: nat) : Tac unit =
if fuel = 0
then ()
else match goals () with
| [] -> ()
| _::_ -> norm [delta_only [`%return_pre]]; later(); norm_return_pre (fuel - 1) | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 81,
"end_line": 3062,
"start_col": 0,
"start_line": 3057
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | fuel: Prims.nat -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.unit",
"Prims.bool",
"FStar.Stubs.Tactics.Types.goal",
"Prims.list",
"Steel.Effect.Common.norm_return_pre",
"Prims.op_Subtraction",
"FStar.Tactics.V2.Derived.later",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Cons",
"FStar.Pervasives.... | [
"recursion"
] | false | true | false | false | false | let rec norm_return_pre (fuel: nat) : Tac unit =
| if fuel = 0
then ()
else
match goals () with
| [] -> ()
| _ :: _ ->
norm [delta_only [`%return_pre]];
later ();
norm_return_pre (fuel - 1) | false |
Example.fst | Example.main | val main: Prims.unit -> HST.Stack (unit) (fun _ -> True) (fun _ _ _ -> True) | val main: Prims.unit -> HST.Stack (unit) (fun _ -> True) (fun _ _ _ -> True) | let main () : HST.Stack (unit) (fun _ -> True) (fun _ _ _ -> True) =
HST.push_frame ();
let d : dll UInt32.t = dll_new () in
let n1 = node_of 1ul in
let n2 = node_of 2ul in
dll_insert_at_head d n1;
dll_insert_at_tail d n2;
let h0 = HST.get () in
reverse d;
let h1 = HST.get () in
assert (n2 `L.memP` ... | {
"file_name": "examples/doublylinkedlist/Example.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 67,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.che... | [
{
"abbrev": false,
"full_module": "DoublyLinkedListIface",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "DoublyLinkedListIface",
"short_module": "DLL"
},
{
"abbrev": true,
"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 | _: Prims.unit -> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Prims.unit",
"FStar.HyperStack.ST.pop_frame",
"Prims._assert",
"Prims.eq2",
"FStar.UInt32.t",
"FStar.UInt32.__uint_to_t",
"DoublyLinkedListIface.node_val",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface.dll_head",
"FStar.List.Tot.Base.memP",
"DoublyLinkedListIface.as_list",
"FStar.Monot... | [] | false | true | false | false | false | let main () : HST.Stack (unit) (fun _ -> True) (fun _ _ _ -> True) =
| HST.push_frame ();
let d:dll UInt32.t = dll_new () in
let n1 = node_of 1ul in
let n2 = node_of 2ul in
dll_insert_at_head d n1;
dll_insert_at_tail d n2;
let h0 = HST.get () in
reverse d;
let h1 = HST.get () in
assert (n2 `L.memP` (as_list h1 d));
let n1' = dll_head d in
let t = node_val n1' in
assert (t == 2ul);
HST.pop... | false |
Steel.Effect.Common.fsti | Steel.Effect.Common.open_existentials_forall_dep | val open_existentials_forall_dep: Prims.unit -> Tac unit | val open_existentials_forall_dep: Prims.unit -> Tac unit | let open_existentials_forall_dep () : Tac unit
=
let e = cur_env () in
if Nil? (lookup_attr (`solve_can_be_split_forall_dep_lookup) e)
then fail "Tactic disabled: no available lemmas in context";
norm [
delta_only [
`%FStar.Algebra.CommMonoid.Equiv.__proj__CM__item__unit;
`%FStar.Algebra.CommMonoid.... | {
"file_name": "lib/steel/Steel.Effect.Common.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 71,
"end_line": 2515,
"start_col": 0,
"start_line": 2474
} | (*
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",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.CanonCommMonoidSimple.Equiv.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Reflection.V2... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Derived.Lemmas",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Algebra.CommMonoid.Equiv",
"short_module": "CE"
},
{
"abbrev": false,
"full_module": "FStar.Tactics.CanonCommMonoidSimple.Equiv",
"short... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.NamedView.term",
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Reflection.V2.Derived.is_fvar",
"FStar.Tactics.NamedView.binder",
"FStar.Tactics.V2.Derived.fail",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Nil",
"... | [] | false | true | false | false | false | let open_existentials_forall_dep () : Tac unit =
| let e = cur_env () in
if Nil? (lookup_attr (`solve_can_be_split_forall_dep_lookup) e)
then fail "Tactic disabled: no available lemmas in context";
norm [
delta_only [
`%FStar.Algebra.CommMonoid.Equiv.__proj__CM__item__unit;
`%FStar.Algebra.CommMonoid.Equiv.__proj__CM__item__mult;
`%rm
... | false |
CQueue.LList.fst | CQueue.LList.alloc_llist | val alloc_llist
(#a: Type0)
(head: ccell_ptrvalue a)
(tail: ref (ccell_ptrvalue a))
: Steel (cllist_lvalue a)
emp
(fun res -> cllist res)
(requires (fun _ -> True))
(ensures (fun _ res h' ->
h' (cllist res) == ({ vllist_head = head; vllist_tail = tail; }) /\
freeable res
)) | val alloc_llist
(#a: Type0)
(head: ccell_ptrvalue a)
(tail: ref (ccell_ptrvalue a))
: Steel (cllist_lvalue a)
emp
(fun res -> cllist res)
(requires (fun _ -> True))
(ensures (fun _ res h' ->
h' (cllist res) == ({ vllist_head = head; vllist_tail = tail; }) /\
freeable res
)) | let alloc_llist
#a head tail
=
let rhead = ralloc head in
let rtail = ralloc tail in
let res : cllist_lvalue a = ({ head = rhead; tail = rtail; all_or_none_null = () }) in
change_equal_slprop (vptr rhead) (vptr (cllist_head res));
change_equal_slprop (vptr rtail) (vptr (cllist_tail res));
intro_cllist res... | {
"file_name": "share/steel/examples/steel/CQueue.LList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 12,
"end_line": 156,
"start_col": 0,
"start_line": 147
} | module CQueue.LList
noeq
type cllist_ptrvalue (a: Type0) = {
head: ref (ccell_ptrvalue a);
tail: ref (ref (ccell_ptrvalue a));
all_or_none_null: squash (is_null head == is_null tail);
}
let cllist_ptrvalue_null a = {head = null; tail = null; all_or_none_null = ()}
let cllist_ptrvalue_is_null #a x = is_null x.h... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "CQueue.LList.fst"
} | [
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"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 | head: CQueue.Cell.ccell_ptrvalue a -> tail: Steel.Reference.ref (CQueue.Cell.ccell_ptrvalue a)
-> Steel.Effect.Steel (CQueue.LList.cllist_lvalue a) | Steel.Effect.Steel | [] | [] | [
"CQueue.Cell.ccell_ptrvalue",
"Steel.Reference.ref",
"Steel.Effect.Atomic.return",
"CQueue.LList.cllist_lvalue",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"CQueue.LList.cllist",
"Steel.Effect.Common.vprop",
"Prims.unit",
"CQueue.LList.intro_cllist",
"Steel... | [] | false | true | false | false | false | let alloc_llist #a head tail =
| let rhead = ralloc head in
let rtail = ralloc tail in
let res:cllist_lvalue a = ({ head = rhead; tail = rtail; all_or_none_null = () }) in
change_equal_slprop (vptr rhead) (vptr (cllist_head res));
change_equal_slprop (vptr rtail) (vptr (cllist_tail res));
intro_cllist res;
return res | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.uints_from_bytes_le_lemma64_1 | val uints_from_bytes_le_lemma64_1: b:lseq uint8 16 -> Lemma
(let lo:lseq uint64 1 = uints_from_bytes_le (sub b 0 8) in
let hi:lseq uint64 1 = uints_from_bytes_le (sub b 8 8) in
nat_from_bytes_le b == pow2 64 * uint_v hi.[0] + uint_v lo.[0]) | val uints_from_bytes_le_lemma64_1: b:lseq uint8 16 -> Lemma
(let lo:lseq uint64 1 = uints_from_bytes_le (sub b 0 8) in
let hi:lseq uint64 1 = uints_from_bytes_le (sub b 8 8) in
nat_from_bytes_le b == pow2 64 * uint_v hi.[0] + uint_v lo.[0]) | let uints_from_bytes_le_lemma64_1 b =
index_uints_from_bytes_le #U64 #SEC #1 (sub b 0 8) 0;
index_uints_from_bytes_le #U64 #SEC #1 (sub b 8 8) 0;
uint_from_bytes_le_lemma b | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 38,
"start_col": 0,
"start_line": 35
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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: Lib.Sequence.lseq Lib.IntTypes.uint8 16
-> FStar.Pervasives.Lemma
(ensures
(let lo = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 0 8) in
let hi = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 8 8) in
Lib.ByteSequence.nat_from_bytes_le b ==
Prims.pow2 64 * L... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Hacl.Impl.Poly1305.Lemmas.uint_from_bytes_le_lemma",
"Prims.unit",
"Lib.ByteSequence.index_uints_from_bytes_le",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.Sequence.sub"
] | [] | true | false | true | false | false | let uints_from_bytes_le_lemma64_1 b =
| index_uints_from_bytes_le #U64 #SEC #1 (sub b 0 8) 0;
index_uints_from_bytes_le #U64 #SEC #1 (sub b 8 8) 0;
uint_from_bytes_le_lemma b | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.uint_from_bytes_le_lemma | val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 8) in
nat_from_bytes_le b == pow2 64 * uint_v hi + uint_v lo) | val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 8) in
nat_from_bytes_le b == pow2 64 * uint_v hi + uint_v lo) | let uint_from_bytes_le_lemma b =
let r1 = nat_from_bytes_le b in
let r2 = uints_from_bytes_le #U64 #SEC #2 b in
uints_from_bytes_le_nat_lemma #U64 #SEC #2 b;
assert (r1 == nat_from_intseq_le r2);
nat_from_intseq_le_slice_lemma #U64 #SEC #2 r2 1;
assert (r1 == nat_from_intseq_le (Seq.slice r2 0 1) + pow2 64 ... | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 67,
"end_line": 27,
"start_col": 0,
"start_line": 17
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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: Lib.Sequence.lseq Lib.IntTypes.uint8 16
-> FStar.Pervasives.Lemma
(ensures
(let lo = Lib.ByteSequence.uint_from_bytes_le (Lib.Sequence.sub b 0 8) in
let hi = Lib.ByteSequence.uint_from_bytes_le (Lib.Sequence.sub b 8 8) in
Lib.ByteSequence.nat_from_bytes_le b ==
Prims.pow2 64 * Lib... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"FStar.Classical.forall_intro",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.Sequence.index",
"Lib.ByteSequence.uints_from_bytes_le",
"Lib.ByteSequence.ui... | [] | false | false | true | false | false | let uint_from_bytes_le_lemma b =
| let r1 = nat_from_bytes_le b in
let r2 = uints_from_bytes_le #U64 #SEC #2 b in
uints_from_bytes_le_nat_lemma #U64 #SEC #2 b;
assert (r1 == nat_from_intseq_le r2);
nat_from_intseq_le_slice_lemma #U64 #SEC #2 r2 1;
assert (r1 ==
nat_from_intseq_le (Seq.slice r2 0 1) +
pow2 64 * nat_from_intseq_le #U64 #SEC (Seq.s... | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.nat_from_bytes_le_eq_lemma | val nat_from_bytes_le_eq_lemma: len:size_nat{len < 16} -> b:lseq uint8 len -> Lemma
(let tmp = create 16 (u8 0) in
nat_from_bytes_le b == nat_from_bytes_le (update_sub tmp 0 len b)) | val nat_from_bytes_le_eq_lemma: len:size_nat{len < 16} -> b:lseq uint8 len -> Lemma
(let tmp = create 16 (u8 0) in
nat_from_bytes_le b == nat_from_bytes_le (update_sub tmp 0 len b)) | let nat_from_bytes_le_eq_lemma len b = nat_from_bytes_le_eq_lemma_ len b | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 72,
"end_line": 125,
"start_col": 0,
"start_line": 125
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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_nat{len < 16} -> b: Lib.Sequence.lseq Lib.IntTypes.uint8 len
-> FStar.Pervasives.Lemma
(ensures
(let tmp = Lib.Sequence.create 16 (Lib.IntTypes.u8 0) in
Lib.ByteSequence.nat_from_bytes_le b ==
Lib.ByteSequence.nat_from_bytes_le (Lib.Sequence.update_sub tmp 0 len b))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Hacl.Impl.Poly1305.Lemmas.nat_from_bytes_le_eq_lemma_",
"Prims.unit"
] | [] | true | false | true | false | false | let nat_from_bytes_le_eq_lemma len b =
| nat_from_bytes_le_eq_lemma_ len b | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.uints64_to_bytes_le_lemma | val uints64_to_bytes_le_lemma: lo:uint64 -> hi:uint64 -> Lemma
(concat (uint_to_bytes_le lo) (uint_to_bytes_le hi) == nat_to_bytes_le 16 (v hi * pow2 64 + v lo)) | val uints64_to_bytes_le_lemma: lo:uint64 -> hi:uint64 -> Lemma
(concat (uint_to_bytes_le lo) (uint_to_bytes_le hi) == nat_to_bytes_le 16 (v hi * pow2 64 + v lo)) | let uints64_to_bytes_le_lemma lo hi =
let lp = nat_to_bytes_le #SEC 16 (v hi * pow2 64 + v lo) in
let rp = concat (uint_to_bytes_le lo) (uint_to_bytes_le hi) in
assert (nat_from_bytes_le lp == v hi * pow2 64 + v lo);
Seq.append_slices (uint_to_bytes_le lo) (uint_to_bytes_le hi);
nat_from_intseq_le_slice_lemma... | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 90,
"start_col": 0,
"start_line": 80
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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 | lo: Lib.IntTypes.uint64 -> hi: Lib.IntTypes.uint64
-> FStar.Pervasives.Lemma
(ensures
Lib.Sequence.concat (Lib.ByteSequence.uint_to_bytes_le lo)
(Lib.ByteSequence.uint_to_bytes_le hi) ==
Lib.ByteSequence.nat_to_bytes_le 16 (Lib.IntTypes.v hi * Prims.pow2 64 + Lib.IntTypes.v lo)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.uint64",
"Lib.ByteSequence.nat_from_intseq_le_inj",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.unit",
"Lib.ByteSequence.lemma_uint_to_bytes_le_preserves_value",
"Lib.IntTypes.U64",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Lib.ByteSequence.nat_from_bytes_le",
"Prims.op_Addit... | [] | true | false | true | false | false | let uints64_to_bytes_le_lemma lo hi =
| let lp = nat_to_bytes_le #SEC 16 (v hi * pow2 64 + v lo) in
let rp = concat (uint_to_bytes_le lo) (uint_to_bytes_le hi) in
assert (nat_from_bytes_le lp == v hi * pow2 64 + v lo);
Seq.append_slices (uint_to_bytes_le lo) (uint_to_bytes_le hi);
nat_from_intseq_le_slice_lemma #U8 #SEC #16 rp 8;
assert (nat_from_bytes_le rp... | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.lemma_nat_from_bytes_le_zeroes | val lemma_nat_from_bytes_le_zeroes: len:size_nat -> b:lseq uint8 len -> Lemma
(requires (forall (i:nat). i < len ==> b.[i] == u8 0))
(ensures nat_from_intseq_le b == 0) | val lemma_nat_from_bytes_le_zeroes: len:size_nat -> b:lseq uint8 len -> Lemma
(requires (forall (i:nat). i < len ==> b.[i] == u8 0))
(ensures nat_from_intseq_le b == 0) | let rec lemma_nat_from_bytes_le_zeroes len b =
if len = 0 then ()
else begin
nat_from_intseq_le_slice_lemma #U8 #SEC #len b 1;
nat_from_intseq_le_lemma0 (Seq.slice b 0 1);
lemma_nat_from_bytes_le_zeroes (len-1) (Seq.slice b 1 len) end | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 66,
"end_line": 102,
"start_col": 0,
"start_line": 97
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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_nat -> b: Lib.Sequence.lseq Lib.IntTypes.uint8 len
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.nat). i < len ==> b.[ i ] == Lib.IntTypes.u8 0)
(ensures Lib.ByteSequence.nat_from_intseq_le b == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_nat",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Hacl.Impl.Poly1305.Lemmas.lemma_nat_from_bytes_le_zeroes",
"Prims.op_Subtraction",
"FStar.Seq.Base.slice",
"Prims.unit",
"Lib.ByteSequence.nat_from_intseq_le_lemma0",
"Lib.IntTy... | [
"recursion"
] | false | false | true | false | false | let rec lemma_nat_from_bytes_le_zeroes len b =
| if len = 0
then ()
else
(nat_from_intseq_le_slice_lemma #U8 #SEC #len b 1;
nat_from_intseq_le_lemma0 (Seq.slice b 0 1);
lemma_nat_from_bytes_le_zeroes (len - 1) (Seq.slice b 1 len)) | false |
Steel.Closure.fst | Steel.Closure.new_counter' | val new_counter' (u:unit) :
SteelT ctr_t emp (fun r -> dfst r 0) | val new_counter' (u:unit) :
SteelT ctr_t emp (fun r -> dfst r 0) | let new_counter' () =
let x = alloc_pt 0 in
let f : ctr x = next x in
let res : ctr_t = (| repr x, f |) in
rewrite_slprop (repr x 0) (dfst res 0) (fun _ -> ());
return res | {
"file_name": "lib/steel/Steel.Closure.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 12,
"end_line": 45,
"start_col": 0,
"start_line": 40
} | (*
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.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": t... | [
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"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 | u13: Prims.unit -> Steel.Effect.SteelT Steel.Closure.ctr_t | Steel.Effect.SteelT | [] | [] | [
"Prims.unit",
"Steel.Effect.Atomic.return",
"Steel.Closure.ctr_t",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"FStar.Pervasives.dfst",
"Prims.int",
"Steel.Effect.Common.vprop",
"FStar.Ghost.erased",
"Prims.eq2",
"Prims.op_Addition",
"FStar.Ghost.reveal",
... | [] | false | true | false | false | false | let new_counter' () =
| let x = alloc_pt 0 in
let f:ctr x = next x in
let res:ctr_t = (| repr x, f |) in
rewrite_slprop (repr x 0) (dfst res 0) (fun _ -> ());
return res | false |
Spec.Frodo.KEM.fst | Spec.Frodo.KEM.crypto_kem_keypair | val crypto_kem_keypair:
a:frodo_alg
-> gen_a:frodo_gen_a
-> state:Spec.Frodo.Random.state_t
-> lbytes (crypto_publickeybytes a) & lbytes (crypto_secretkeybytes a) | val crypto_kem_keypair:
a:frodo_alg
-> gen_a:frodo_gen_a
-> state:Spec.Frodo.Random.state_t
-> lbytes (crypto_publickeybytes a) & lbytes (crypto_secretkeybytes a) | let crypto_kem_keypair a gen_a state = KeyGen.crypto_kem_keypair a gen_a state | {
"file_name": "specs/frodo/Spec.Frodo.KEM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | module Spec.Frodo.KEM
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Frodo.Params
module KeyGen = Spec.Frodo.KEM.KeyGen
module Encaps = Spec.Frodo.KEM.Encaps
module Decaps = Spec.Frodo.KEM.Decaps
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val crypto_kem_keypair:
a:frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Random.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.KeyGen.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"Spec.Frodo.KEM.Decaps.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fs... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Decaps",
"short_module": "Decaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "Encaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.KeyGen",
"short_module": "KeyGen"
},
{
"abb... | {
"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: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a ->
state: Spec.Frodo.Random.state_t
-> Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_publickeybytes a) *
Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_secretkeybytes a) | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Spec.Frodo.Random.state_t",
"Spec.Frodo.KEM.KeyGen.crypto_kem_keypair",
"FStar.Pervasives.Native.tuple2",
"Lib.ByteSequence.lbytes",
"Spec.Frodo.Params.crypto_publickeybytes",
"Spec.Frodo.Params.crypto_secretkeybytes"
] | [] | false | false | false | false | false | let crypto_kem_keypair a gen_a state =
| KeyGen.crypto_kem_keypair a gen_a state | false |
Spec.Frodo.KEM.fst | Spec.Frodo.KEM.crypto_kem_enc | val crypto_kem_enc:
a:frodo_alg
-> gen_a:frodo_gen_a
-> state:Spec.Frodo.Random.state_t
-> pk:lbytes (crypto_publickeybytes a)
-> lbytes (crypto_ciphertextbytes a) & lbytes (crypto_bytes a) | val crypto_kem_enc:
a:frodo_alg
-> gen_a:frodo_gen_a
-> state:Spec.Frodo.Random.state_t
-> pk:lbytes (crypto_publickeybytes a)
-> lbytes (crypto_ciphertextbytes a) & lbytes (crypto_bytes a) | let crypto_kem_enc a gen_a state pk = Encaps.crypto_kem_enc a gen_a state pk | {
"file_name": "specs/frodo/Spec.Frodo.KEM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 76,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | module Spec.Frodo.KEM
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Frodo.Params
module KeyGen = Spec.Frodo.KEM.KeyGen
module Encaps = Spec.Frodo.KEM.Encaps
module Decaps = Spec.Frodo.KEM.Decaps
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val crypto_kem_keypair:
a:frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Random.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.KeyGen.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"Spec.Frodo.KEM.Decaps.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fs... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Decaps",
"short_module": "Decaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "Encaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.KeyGen",
"short_module": "KeyGen"
},
{
"abb... | {
"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: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a ->
state: Spec.Frodo.Random.state_t ->
pk: Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_publickeybytes a)
-> Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_ciphertextbytes a) *
Lib.ByteSequence.lbytes (Spec.Frodo.Param... | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Spec.Frodo.Random.state_t",
"Lib.ByteSequence.lbytes",
"Spec.Frodo.Params.crypto_publickeybytes",
"Spec.Frodo.KEM.Encaps.crypto_kem_enc",
"FStar.Pervasives.Native.tuple2",
"Spec.Frodo.Params.crypto_ciphertextbytes",
"Spec.Frodo.Params.... | [] | false | false | false | false | false | let crypto_kem_enc a gen_a state pk =
| Encaps.crypto_kem_enc a gen_a state pk | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.uints_from_bytes_le_lemma64_2 | val uints_from_bytes_le_lemma64_2: b:lseq uint8 32 -> Lemma
(let lo:lseq uint64 2 = uints_from_bytes_le (sub b 0 16) in
let hi:lseq uint64 2 = uints_from_bytes_le (sub b 16 16) in
let b1 = nat_from_bytes_le (sub b 0 16) in
let b2 = nat_from_bytes_le (sub b 16 16) in
b1 == pow2 64 * uint_v lo.[1] + uint_v lo.[0... | val uints_from_bytes_le_lemma64_2: b:lseq uint8 32 -> Lemma
(let lo:lseq uint64 2 = uints_from_bytes_le (sub b 0 16) in
let hi:lseq uint64 2 = uints_from_bytes_le (sub b 16 16) in
let b1 = nat_from_bytes_le (sub b 0 16) in
let b2 = nat_from_bytes_le (sub b 16 16) in
b1 == pow2 64 * uint_v lo.[1] + uint_v lo.[0... | let uints_from_bytes_le_lemma64_2 b =
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #2 (sub b 0 16));
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #2 (sub b 16 16));
uint_from_bytes_le_lemma (sub b 0 16);
uint_from_bytes_le_lemma (sub b 16 16) | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 53,
"start_col": 0,
"start_line": 49
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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: Lib.Sequence.lseq Lib.IntTypes.uint8 32
-> FStar.Pervasives.Lemma
(ensures
(let lo = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 0 16) in
let hi = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 16 16) in
let b1 = Lib.ByteSequence.nat_from_bytes_le (Lib.Sequence.sub ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Hacl.Impl.Poly1305.Lemmas.uint_from_bytes_le_lemma",
"Lib.Sequence.sub",
"Prims.unit",
"FStar.Classical.forall_intro",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.... | [] | false | false | true | false | false | let uints_from_bytes_le_lemma64_2 b =
| Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #2 (sub b 0 16));
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #2 (sub b 16 16));
uint_from_bytes_le_lemma (sub b 0 16);
uint_from_bytes_le_lemma (sub b 16 16) | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.nat_from_bytes_le_eq_lemma_ | val nat_from_bytes_le_eq_lemma_: len:size_nat{len < 16} -> b:lseq uint8 len -> Lemma
(let tmp = create 16 (u8 0) in
nat_from_intseq_le b == nat_from_intseq_le (update_sub tmp 0 len b)) | val nat_from_bytes_le_eq_lemma_: len:size_nat{len < 16} -> b:lseq uint8 len -> Lemma
(let tmp = create 16 (u8 0) in
nat_from_intseq_le b == nat_from_intseq_le (update_sub tmp 0 len b)) | let nat_from_bytes_le_eq_lemma_ len b =
let tmp = create 16 (u8 0) in
let r = update_sub tmp 0 len b in
assert (Seq.slice r 0 len == b);
assert (forall (i:nat). len <= i /\ i < 16 ==> r.[i] == u8 0);
assert (forall (i:nat). i < 16 - len ==> Seq.index (Seq.slice r len 16) i == u8 0);
nat_from_intseq_le_slice... | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 64,
"end_line": 118,
"start_col": 0,
"start_line": 109
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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_nat{len < 16} -> b: Lib.Sequence.lseq Lib.IntTypes.uint8 len
-> FStar.Pervasives.Lemma
(ensures
(let tmp = Lib.Sequence.create 16 (Lib.IntTypes.u8 0) in
Lib.ByteSequence.nat_from_intseq_le b ==
Lib.ByteSequence.nat_from_intseq_le (Lib.Sequence.update_sub tmp 0 len b))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Hacl.Impl.Poly1305.Lemmas.lemma_nat_from_bytes_le_zeroes",
"Prims.op_Subtraction",
"FStar.Seq.Base.slice",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Prims.int",
"Lib.ByteSequence.nat_fro... | [] | false | false | true | false | false | let nat_from_bytes_le_eq_lemma_ len b =
| let tmp = create 16 (u8 0) in
let r = update_sub tmp 0 len b in
assert (Seq.slice r 0 len == b);
assert (forall (i: nat). len <= i /\ i < 16 ==> r.[ i ] == u8 0);
assert (forall (i: nat). i < 16 - len ==> Seq.index (Seq.slice r len 16) i == u8 0);
nat_from_intseq_le_slice_lemma #U8 #SEC #16 r len;
assert (nat_from_ints... | false |
Spec.Frodo.KEM.fst | Spec.Frodo.KEM.crypto_kem_dec | val crypto_kem_dec:
a:frodo_alg
-> gen_a:frodo_gen_a
-> ct:lbytes (crypto_ciphertextbytes a)
-> sk:lbytes (crypto_secretkeybytes a)
-> lbytes (crypto_bytes a) | val crypto_kem_dec:
a:frodo_alg
-> gen_a:frodo_gen_a
-> ct:lbytes (crypto_ciphertextbytes a)
-> sk:lbytes (crypto_secretkeybytes a)
-> lbytes (crypto_bytes a) | let crypto_kem_dec a gen_a ct sk = Decaps.crypto_kem_dec a gen_a ct sk | {
"file_name": "specs/frodo/Spec.Frodo.KEM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 70,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | module Spec.Frodo.KEM
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Frodo.Params
module KeyGen = Spec.Frodo.KEM.KeyGen
module Encaps = Spec.Frodo.KEM.Encaps
module Decaps = Spec.Frodo.KEM.Decaps
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val crypto_kem_keypair:
a:frod... | {
"checked_file": "/",
"dependencies": [
"Spec.Frodo.Random.fst.checked",
"Spec.Frodo.Params.fst.checked",
"Spec.Frodo.KEM.KeyGen.fst.checked",
"Spec.Frodo.KEM.Encaps.fst.checked",
"Spec.Frodo.KEM.Decaps.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fs... | [
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Decaps",
"short_module": "Decaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.Encaps",
"short_module": "Encaps"
},
{
"abbrev": true,
"full_module": "Spec.Frodo.KEM.KeyGen",
"short_module": "KeyGen"
},
{
"abb... | {
"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: Spec.Frodo.Params.frodo_alg ->
gen_a: Spec.Frodo.Params.frodo_gen_a ->
ct: Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_ciphertextbytes a) ->
sk: Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_secretkeybytes a)
-> Lib.ByteSequence.lbytes (Spec.Frodo.Params.crypto_bytes a) | Prims.Tot | [
"total"
] | [] | [
"Spec.Frodo.Params.frodo_alg",
"Spec.Frodo.Params.frodo_gen_a",
"Lib.ByteSequence.lbytes",
"Spec.Frodo.Params.crypto_ciphertextbytes",
"Spec.Frodo.Params.crypto_secretkeybytes",
"Spec.Frodo.KEM.Decaps.crypto_kem_dec",
"Spec.Frodo.Params.crypto_bytes"
] | [] | false | false | false | false | false | let crypto_kem_dec a gen_a ct sk =
| Decaps.crypto_kem_dec a gen_a ct sk | false |
Hacl.Impl.Poly1305.Lemmas.fst | Hacl.Impl.Poly1305.Lemmas.uints_from_bytes_le_lemma64_4 | val uints_from_bytes_le_lemma64_4: b:lseq uint8 64 -> Lemma
(let lo:lseq uint64 4 = uints_from_bytes_le (sub b 0 32) in
let hi:lseq uint64 4 = uints_from_bytes_le (sub b 32 32) in
let b1 = nat_from_bytes_le (sub b 0 16) in
let b2 = nat_from_bytes_le (sub b 16 16) in
let b3 = nat_from_bytes_le (sub b 32 16) in
... | val uints_from_bytes_le_lemma64_4: b:lseq uint8 64 -> Lemma
(let lo:lseq uint64 4 = uints_from_bytes_le (sub b 0 32) in
let hi:lseq uint64 4 = uints_from_bytes_le (sub b 32 32) in
let b1 = nat_from_bytes_le (sub b 0 16) in
let b2 = nat_from_bytes_le (sub b 16 16) in
let b3 = nat_from_bytes_le (sub b 32 16) in
... | let uints_from_bytes_le_lemma64_4 b =
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #4 (sub b 0 32));
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #4 (sub b 32 32));
uint_from_bytes_le_lemma (sub b 0 16);
uint_from_bytes_le_lemma (sub b 16 16);
uint_from_bytes_le_lemma (sub b 32 1... | {
"file_name": "code/poly1305/Hacl.Impl.Poly1305.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 74,
"start_col": 0,
"start_line": 68
} | module Hacl.Impl.Poly1305.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.IntVector
open Lib.Sequence
open Lib.ByteSequence
#set-options "--z3rlimit 50 --max_fuel 1"
val uint_from_bytes_le_lemma: b:lseq uint8 16 -> Lemma
(let lo = uint_from_bytes_le #U64 (sub b 0 8) in
let hi = uint_from_bytes_le #U64 (sub b 8 ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Classic... | [
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector",
"short_module": null
},
{
"abbrev": false,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": 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: Lib.Sequence.lseq Lib.IntTypes.uint8 64
-> FStar.Pervasives.Lemma
(ensures
(let lo = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 0 32) in
let hi = Lib.ByteSequence.uints_from_bytes_le (Lib.Sequence.sub b 32 32) in
let b1 = Lib.ByteSequence.nat_from_bytes_le (Lib.Sequence.sub ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Hacl.Impl.Poly1305.Lemmas.uint_from_bytes_le_lemma",
"Lib.Sequence.sub",
"Prims.unit",
"FStar.Classical.forall_intro",
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.... | [] | false | false | true | false | false | let uints_from_bytes_le_lemma64_4 b =
| Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #4 (sub b 0 32));
Classical.forall_intro (index_uints_from_bytes_le #U64 #SEC #4 (sub b 32 32));
uint_from_bytes_le_lemma (sub b 0 16);
uint_from_bytes_le_lemma (sub b 16 16);
uint_from_bytes_le_lemma (sub b 32 16);
uint_from_bytes_le_lemma (sub b 48 16) | false |
Spec.SHA2.fst | Spec.SHA2.block_w | val block_w : a: Spec.Hash.Definitions.sha2_alg -> Type0 | let block_w (a: sha2_alg) = m:S.seq (word a) {S.length m = block_word_length a} | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"FStar.Seq.Base.seq",
"Spec.Hash.Definitions.word",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Spec.Hash.Definitions.block_word_length"
] | [] | false | false | false | true | true | let block_w (a: sha2_alg) =
| m: S.seq (word a) {S.length m = block_word_length a} | false | |
Spec.SHA2.fst | Spec.SHA2.op384_512 | val op384_512:ops | val op384_512:ops | let op384_512: ops = {
c0 = 28ul; c1 = 34ul; c2 = 39ul;
c3 = 14ul; c4 = 18ul; c5 = 41ul;
e0 = 1ul ; e1 = 8ul; e2 = 7ul;
e3 = 19ul; e4 = 61ul; e5 = 6ul
} | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 60,
"start_col": 0,
"start_line": 55
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | Spec.SHA2.ops | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.Mkops",
"FStar.UInt32.__uint_to_t"
] | [] | false | false | false | true | false | let op384_512:ops =
| {
c0 = 28ul;
c1 = 34ul;
c2 = 39ul;
c3 = 14ul;
c4 = 18ul;
c5 = 41ul;
e0 = 1ul;
e1 = 8ul;
e2 = 7ul;
e3 = 19ul;
e4 = 61ul;
e5 = 6ul
} | false |
Spec.SHA2.fst | Spec.SHA2.op224_256 | val op224_256:ops | val op224_256:ops | let op224_256: ops = {
c0 = 2ul; c1 = 13ul; c2 = 22ul;
c3 = 6ul; c4 = 11ul; c5 = 25ul;
e0 = 7ul; e1 = 18ul; e2 = 3ul;
e3 = 17ul; e4 = 19ul; e5 = 10ul
} | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 52,
"start_col": 0,
"start_line": 47
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | Spec.SHA2.ops | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.Mkops",
"FStar.UInt32.__uint_to_t"
] | [] | false | false | false | true | false | let op224_256:ops =
| {
c0 = 2ul;
c1 = 13ul;
c2 = 22ul;
c3 = 6ul;
c4 = 11ul;
c5 = 25ul;
e0 = 7ul;
e1 = 18ul;
e2 = 3ul;
e3 = 17ul;
e4 = 19ul;
e5 = 10ul
} | false |
Spec.SHA2.fst | Spec.SHA2.counter | val counter : Type0 | let counter = nat | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 35,
"start_col": 0,
"start_line": 35
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.nat"
] | [] | false | false | false | true | true | let counter =
| nat | false | |
CQueue.LList.fst | CQueue.LList.cllist_not_null | val cllist_not_null
(#opened: _)
(#a: Type0)
(c: cllist_ptrvalue a)
: SteelGhost (squash (cllist_ptrvalue_is_null c == false)) opened
(cllist c)
(fun _ -> cllist c)
(fun _ -> True)
(fun h _ h' ->
h' (cllist c) == h (cllist c)
) | val cllist_not_null
(#opened: _)
(#a: Type0)
(c: cllist_ptrvalue a)
: SteelGhost (squash (cllist_ptrvalue_is_null c == false)) opened
(cllist c)
(fun _ -> cllist c)
(fun _ -> True)
(fun h _ h' ->
h' (cllist c) == h (cllist c)
) | let cllist_not_null
#opened #a c
=
let c1 = elim_cllist_ghost c in
let c2 : cllist_lvalue a = c in
change_equal_slprop (vptr (cllist_head c1)) (vptr (cllist_head c2));
change_equal_slprop (vptr (cllist_tail c1)) (vptr (cllist_tail c2));
intro_cllist c2;
change_equal_slprop (cllist c2) (cllist c);
() | {
"file_name": "share/steel/examples/steel/CQueue.LList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 4,
"end_line": 136,
"start_col": 0,
"start_line": 127
} | module CQueue.LList
noeq
type cllist_ptrvalue (a: Type0) = {
head: ref (ccell_ptrvalue a);
tail: ref (ref (ccell_ptrvalue a));
all_or_none_null: squash (is_null head == is_null tail);
}
let cllist_ptrvalue_null a = {head = null; tail = null; all_or_none_null = ()}
let cllist_ptrvalue_is_null #a x = is_null x.h... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "CQueue.LList.fst"
} | [
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"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 | c: CQueue.LList.cllist_ptrvalue a
-> Steel.Effect.Atomic.SteelGhost (Prims.squash (CQueue.LList.cllist_ptrvalue_is_null c == false)) | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"CQueue.LList.cllist_ptrvalue",
"Prims.squash",
"Prims.eq2",
"Prims.bool",
"CQueue.LList.cllist_ptrvalue_is_null",
"Prims.unit",
"Steel.Effect.Atomic.change_equal_slprop",
"CQueue.LList.cllist",
"CQueue.LList.intro_cllist",
"Steel.Reference.vptr",
"Steel.Reference.ref",
... | [] | false | true | true | false | false | let cllist_not_null #opened #a c =
| let c1 = elim_cllist_ghost c in
let c2:cllist_lvalue a = c in
change_equal_slprop (vptr (cllist_head c1)) (vptr (cllist_head c2));
change_equal_slprop (vptr (cllist_tail c1)) (vptr (cllist_tail c2));
intro_cllist c2;
change_equal_slprop (cllist c2) (cllist c);
() | false |
Spec.SHA2.fst | Spec.SHA2._Ch | val _Ch: a:sha2_alg -> x:(word a) -> y:(word a) -> z:(word a) -> Tot (word a) | val _Ch: a:sha2_alg -> x:(word a) -> y:(word a) -> z:(word a) -> Tot (word a) | let _Ch a x y z = (x &. y) ^. (~.x &. z) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 110,
"start_col": 0,
"start_line": 110
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
x: Spec.Hash.Definitions.word a ->
y: Spec.Hash.Definitions.word a ->
z: Spec.Hash.Definitions.word a
-> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Amp_Dot",
"Spec.SHA2.op_Tilde_Dot"
] | [] | false | false | false | false | false | let _Ch a x y z =
| (x &. y) ^. (~.x &. z) | false |
Spec.SHA2.fst | Spec.SHA2.word_n | val word_n: sha2_alg -> Tot nat | val word_n: sha2_alg -> Tot nat | let word_n: sha2_alg -> Tot nat = function
| SHA2_224 | SHA2_256 -> 32
| SHA2_384 | SHA2_512 -> 64 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 21,
"start_col": 0,
"start_line": 19
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | _: Spec.Hash.Definitions.sha2_alg -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Prims.nat"
] | [] | false | false | false | true | false | let word_n: sha2_alg -> Tot nat =
| function
| SHA2_224 | SHA2_256 -> 32
| SHA2_384 | SHA2_512 -> 64 | false |
Spec.SHA2.fst | Spec.SHA2._Maj | val _Maj: a:sha2_alg -> x:(word a) -> y:(word a) -> z:(word a) -> Tot (word a) | val _Maj: a:sha2_alg -> x:(word a) -> y:(word a) -> z:(word a) -> Tot (word a) | let _Maj a x y z = (x &. y) ^. ((x &. z) ^. (y &. z)) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 115,
"start_col": 0,
"start_line": 115
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
x: Spec.Hash.Definitions.word a ->
y: Spec.Hash.Definitions.word a ->
z: Spec.Hash.Definitions.word a
-> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Amp_Dot"
] | [] | false | false | false | false | false | let _Maj a x y z =
| (x &. y) ^. ((x &. z) ^. (y &. z)) | false |
Spec.SHA2.fst | Spec.SHA2.k_w | val k_w : a: Spec.Hash.Definitions.sha2_alg -> Type0 | let k_w (a: sha2_alg) = m:S.seq (word a) {S.length m = size_k_w a} | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"FStar.Seq.Base.seq",
"Spec.Hash.Definitions.word",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"Spec.SHA2.size_k_w"
] | [] | false | false | false | true | true | let k_w (a: sha2_alg) =
| m: S.seq (word a) {S.length m = size_k_w a} | false | |
Spec.SHA2.fst | Spec.SHA2.to_word | val to_word (a: sha2_alg) (n: nat{n < pow2 (word_n a)}) : word a | val to_word (a: sha2_alg) (n: nat{n < pow2 (word_n a)}) : word a | let to_word (a:sha2_alg) (n:nat{n < pow2 (word_n a)}) : word a =
match a with
| SHA2_224 | SHA2_256 -> u32 n
| SHA2_384 | SHA2_512 -> u64 n | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 27,
"start_col": 0,
"start_line": 24
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> n: Prims.nat{n < Prims.pow2 (Spec.SHA2.word_n a)}
-> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"Spec.SHA2.word_n",
"Lib.IntTypes.u32",
"Lib.IntTypes.u64",
"Spec.Hash.Definitions.word"
] | [] | false | false | false | false | false | let to_word (a: sha2_alg) (n: nat{n < pow2 (word_n a)}) : word a =
| match a with
| SHA2_224 | SHA2_256 -> u32 n
| SHA2_384 | SHA2_512 -> u64 n | false |
Spec.SHA2.fst | Spec.SHA2.v' | val v' : x: Spec.Hash.Definitions.word a
-> x:
Prims.int
{ Lib.IntTypes.range x Lib.IntTypes.U32 \/ Lib.IntTypes.range x Lib.IntTypes.U64 \/
Lib.IntTypes.range x Lib.IntTypes.U64 \/ Lib.IntTypes.range x Lib.IntTypes.U32 } | let v' (#a: sha2_alg) (x:word a) = match a with
| SHA2_224 | SHA2_256 -> uint_v #U32 #SEC x
| SHA2_384 | SHA2_512 -> uint_v #U64 #SEC x | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 31,
"start_col": 0,
"start_line": 29
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | x: Spec.Hash.Definitions.word a
-> x:
Prims.int
{ Lib.IntTypes.range x Lib.IntTypes.U32 \/ Lib.IntTypes.range x Lib.IntTypes.U64 \/
Lib.IntTypes.range x Lib.IntTypes.U64 \/ Lib.IntTypes.range x Lib.IntTypes.U32 } | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Lib.IntTypes.uint_v",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Lib.IntTypes.U64",
"Prims.int",
"Prims.l_or",
"Lib.IntTypes.range"
] | [] | false | false | false | false | false | let v' (#a: sha2_alg) (x: word a) =
| match a with
| SHA2_224 | SHA2_256 -> uint_v #U32 #SEC x
| SHA2_384 | SHA2_512 -> uint_v #U64 #SEC x | false | |
Spec.SHA2.fst | Spec.SHA2.size_k_w | val size_k_w: sha2_alg -> Tot nat | val size_k_w: sha2_alg -> Tot nat | let size_k_w: sha2_alg -> Tot nat = function
| SHA2_224 | SHA2_256 -> 64
| SHA2_384 | SHA2_512 -> 80 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 16,
"start_col": 0,
"start_line": 14
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *) | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | _: Spec.Hash.Definitions.sha2_alg -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Prims.nat"
] | [] | false | false | false | true | false | let size_k_w: sha2_alg -> Tot nat =
| function
| SHA2_224 | SHA2_256 -> 64
| SHA2_384 | SHA2_512 -> 80 | false |
Spec.SHA2.fst | Spec.SHA2.op0 | val op0 (a: sha2_alg) : Tot ops | val op0 (a: sha2_alg) : Tot ops | let op0: a:sha2_alg -> Tot ops = function
| SHA2_224 -> op224_256
| SHA2_256 -> op224_256
| SHA2_384 -> op384_512
| SHA2_512 -> op384_512 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 67,
"start_col": 0,
"start_line": 63
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> Spec.SHA2.ops | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.op224_256",
"Spec.SHA2.op384_512",
"Spec.SHA2.ops"
] | [] | false | false | false | true | false | let op0: a: sha2_alg -> Tot ops =
| function
| SHA2_224 -> op224_256
| SHA2_256 -> op224_256
| SHA2_384 -> op384_512
| SHA2_512 -> op384_512 | false |
Spec.SHA2.fst | Spec.SHA2.shuffle_core_pre | val shuffle_core_pre : a: Spec.Hash.Definitions.sha2_alg ->
k_t: Spec.Hash.Definitions.word a ->
ws_t: Spec.Hash.Definitions.word a ->
hash: Spec.Hash.Definitions.words_state a
-> Spec.Hash.Definitions.words_state a | let shuffle_core_pre = shuffle_core_pre_ | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 173,
"start_col": 0,
"start_line": 173
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
k_t: Spec.Hash.Definitions.word a ->
ws_t: Spec.Hash.Definitions.word a ->
hash: Spec.Hash.Definitions.words_state a
-> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.shuffle_core_pre_"
] | [] | false | false | false | false | false | let shuffle_core_pre =
| shuffle_core_pre_ | false | |
CPS.DoubleDefun.fst | CPS.DoubleDefun.eval | val eval : expr -> Tot int | val eval : expr -> Tot int | let eval e = eval_cps e C0 | {
"file_name": "examples/termination/CPS.DoubleDefun.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 58,
"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.Pervasives.fsti.checked",
"CPS.Expr.fst.checked"
],
"interface_file": false,
"source_file": "CPS.DoubleDefun.fst"
} | [
{
"abbrev": false,
"full_module": "CPS.Expr",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"s... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | e: CPS.Expr.expr -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"CPS.Expr.expr",
"CPS.DoubleDefun.eval_cps",
"CPS.DoubleDefun.C0",
"Prims.int"
] | [] | false | false | false | true | false | let eval e =
| eval_cps e C0 | false |
Spec.SHA2.fst | Spec.SHA2.shuffle | val shuffle : a: Spec.Hash.Definitions.sha2_alg ->
hash: Spec.Hash.Definitions.words_state a ->
block: Spec.SHA2.block_w a
-> Spec.Hash.Definitions.words_state a | let shuffle = shuffle_pre | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 210,
"start_col": 0,
"start_line": 210
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
hash: Spec.Hash.Definitions.words_state a ->
block: Spec.SHA2.block_w a
-> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.shuffle_pre"
] | [] | false | false | false | false | false | let shuffle =
| shuffle_pre | false | |
CPS.DoubleDefun.fst | CPS.DoubleDefun.stack | val stack : cont -> Tot (list expr) | val stack : cont -> Tot (list expr) | let rec stack = function
| C0 -> []
| C1 k _ -> stack k
| C2 k e -> e::(stack k) | {
"file_name": "examples/termination/CPS.DoubleDefun.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 35,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"CPS.Expr.fst.checked"
],
"interface_file": false,
"source_file": "CPS.DoubleDefun.fst"
} | [
{
"abbrev": false,
"full_module": "CPS.Expr",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"s... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | _: CPS.DoubleDefun.cont -> Prims.list CPS.Expr.expr | Prims.Tot | [
"total"
] | [] | [
"CPS.DoubleDefun.cont",
"Prims.Nil",
"CPS.Expr.expr",
"Prims.int",
"CPS.DoubleDefun.stack",
"Prims.Cons",
"Prims.list"
] | [
"recursion"
] | false | false | false | true | false | let rec stack =
| function
| C0 -> []
| C1 k _ -> stack k
| C2 k e -> e :: (stack k) | false |
Spec.SHA2.fst | Spec.SHA2.init | val init: a:sha2_alg -> init_t a | val init: a:sha2_alg -> init_t a | let init a = h0 a | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 212,
"start_col": 0,
"start_line": 212
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spe... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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: Spec.Hash.Definitions.sha2_alg -> Spec.Hash.Definitions.init_t a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.h0",
"Spec.Hash.Definitions.init_t"
] | [] | false | false | false | false | false | let init a =
| h0 a | false |
IOWPInconsistent.fst | IOWPInconsistent.prop | val prop : Type | let prop = p:Type0{forall (x y:p). x == y} | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 42,
"start_col": 0,
"start_line": 42
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | Type | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2"
] | [] | false | false | false | true | true | let prop =
| p: Type0{forall (x: p) (y: p). x == y} | false | |
Spec.SHA2.fst | Spec.SHA2.ws_pre | val ws_pre : a: Spec.Hash.Definitions.sha2_alg -> block: Spec.SHA2.block_w a -> Spec.SHA2.k_w a | let ws_pre = ws_pre_ | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 201,
"start_col": 0,
"start_line": 201
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> block: Spec.SHA2.block_w a -> Spec.SHA2.k_w a | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.ws_pre_"
] | [] | false | false | false | false | false | let ws_pre =
| ws_pre_ | false | |
CPS.DoubleDefun.fst | CPS.DoubleDefun.eval_cps | val eval_cps : e:expr -> k:cont -> Tot int (decreases %[e::(stack k);k;1]) | val eval_cps : e:expr -> k:cont -> Tot int (decreases %[e::(stack k);k;1]) | let rec apply e k r = match k with
| C0 -> r
| C1 k r1 -> apply e k (r1 + r)
| C2 k e2 -> eval_cps e2 (C1 k r)
and eval_cps e k =
match e with
| Const n -> apply e k n
| Plus e1 e2 -> eval_cps e1 (C2 k e2) | {
"file_name": "examples/termination/CPS.DoubleDefun.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 55,
"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.Pervasives.fsti.checked",
"CPS.Expr.fst.checked"
],
"interface_file": false,
"source_file": "CPS.DoubleDefun.fst"
} | [
{
"abbrev": false,
"full_module": "CPS.Expr",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "CPS",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"s... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 | e: CPS.Expr.expr -> k: CPS.DoubleDefun.cont -> Prims.Tot Prims.int | Prims.Tot | [
"total",
""
] | [
"apply",
"eval_cps"
] | [
"CPS.Expr.expr",
"CPS.DoubleDefun.cont",
"Prims.int",
"CPS.DoubleDefun.apply",
"CPS.DoubleDefun.eval_cps",
"CPS.DoubleDefun.C2"
] | [
"mutual recursion"
] | false | false | false | true | false | let rec eval_cps e k =
| match e with
| Const n -> apply e k n
| Plus e1 e2 -> eval_cps e1 (C2 k e2) | false |
IOWPInconsistent.fst | IOWPInconsistent.f | val f (#a: Type) (p: (either (out_wp a) a -> prop)) : either (out_wp a) a | val f (#a: Type) (p: (either (out_wp a) a -> prop)) : either (out_wp a) a | let f (#a:Type) (p:either (out_wp a) a -> prop) : either (out_wp a) a =
Inl (Intro (inj p)) | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 62,
"start_col": 0,
"start_line": 61
} | (*
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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | p: (_: FStar.Pervasives.either (IOWPInconsistent.out_wp a) a -> IOWPInconsistent.prop)
-> FStar.Pervasives.either (IOWPInconsistent.out_wp a) a | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp",
"IOWPInconsistent.prop",
"FStar.Pervasives.Inl",
"IOWPInconsistent.Intro",
"IOWPInconsistent.inj"
] | [] | false | false | false | true | false | let f (#a: Type) (p: (either (out_wp a) a -> prop)) : either (out_wp a) a =
| Inl (Intro (inj p)) | false |
IOWPInconsistent.fst | IOWPInconsistent.x0 | val x0 : FStar.Pervasives.either (IOWPInconsistent.out_wp a) a | let x0 (#a:Type) = f #a p0 | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 73,
"start_col": 0,
"start_line": 73
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | FStar.Pervasives.either (IOWPInconsistent.out_wp a) a | Prims.Tot | [
"total"
] | [] | [
"IOWPInconsistent.f",
"IOWPInconsistent.p0",
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp"
] | [] | false | false | false | true | false | let x0 (#a: Type) =
| f #a p0 | false | |
Spec.SHA2.fst | Spec.SHA2._Sigma0 | val _Sigma0: a:sha2_alg -> x:(word a) -> Tot (word a) | val _Sigma0: a:sha2_alg -> x:(word a) -> Tot (word a) | let _Sigma0 a x = (x >>>. (op0 a).c0) ^. (x >>>. (op0 a).c1) ^. (x >>>. (op0 a).c2) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 83,
"end_line": 120,
"start_col": 0,
"start_line": 120
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> x: Spec.Hash.Definitions.word a -> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Greater_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__c0",
"Spec.SHA2.op0",
"Spec.SHA2.__proj__Mkops__item__c1",
"Spec.SHA2.__proj__Mkops__item__c2"
] | [] | false | false | false | false | false | let _Sigma0 a x =
| (x >>>. (op0 a).c0) ^. (x >>>. (op0 a).c1) ^. (x >>>. (op0 a).c2) | false |
Spec.SHA2.fst | Spec.SHA2.k0 | val k0 (a: sha2_alg) : Tot (m: S.seq (word a) {S.length m = size_k_w a}) | val k0 (a: sha2_alg) : Tot (m: S.seq (word a) {S.length m = size_k_w a}) | let k0: a:sha2_alg -> Tot (m:S.seq (word a) {S.length m = size_k_w a}) = function
| SHA2_224 -> C.k224_256
| SHA2_256 -> C.k224_256
| SHA2_384 -> C.k384_512
| SHA2_512 -> C.k384_512 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 147,
"start_col": 0,
"start_line": 143
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg
-> m:
FStar.Seq.Base.seq (Spec.Hash.Definitions.word a)
{FStar.Seq.Base.length m = Spec.SHA2.size_k_w a} | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.Constants.k224_256",
"Spec.SHA2.Constants.k384_512",
"FStar.Seq.Base.seq",
"Spec.Hash.Definitions.word",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"Spec.SHA2.size_k_w"
] | [] | false | false | false | false | false | let k0: a: sha2_alg -> Tot (m: S.seq (word a) {S.length m = size_k_w a}) =
| function
| SHA2_224 -> C.k224_256
| SHA2_256 -> C.k224_256
| SHA2_384 -> C.k384_512
| SHA2_512 -> C.k384_512 | false |
IOWPInconsistent.fst | IOWPInconsistent.inj_injective | val inj_injective (#x: Type) (x0 x0': x)
: Lemma (requires (inj x0 == inj x0')) (ensures (x0 == x0')) | val inj_injective (#x: Type) (x0 x0': x)
: Lemma (requires (inj x0 == inj x0')) (ensures (x0 == x0')) | let inj_injective (#x:Type) (x0 x0':x)
: Lemma (requires (inj x0 == inj x0'))
(ensures (x0 == x0')) =
assert (inj x0 x0) ;
assert (inj x0' x0) | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 59,
"start_col": 0,
"start_line": 55
} | (*
Copyright 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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | x0: x -> x0': x
-> FStar.Pervasives.Lemma (requires IOWPInconsistent.inj x0 == IOWPInconsistent.inj x0')
(ensures x0 == x0') | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims._assert",
"IOWPInconsistent.inj",
"Prims.unit",
"Prims.eq2",
"IOWPInconsistent.prop",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let inj_injective (#x: Type) (x0 x0': x)
: Lemma (requires (inj x0 == inj x0')) (ensures (x0 == x0')) =
| assert (inj x0 x0);
assert (inj x0' x0) | false |
IOWPInconsistent.fst | IOWPInconsistent.inj | val inj: #x: Type -> x -> (x -> prop) | val inj: #x: Type -> x -> (x -> prop) | let inj (#x:Type) : x -> (x -> prop) = fun x0 y0 -> x0 == y0 | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 53,
"start_col": 0,
"start_line": 53
} | (*
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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | _: x -> _: x -> IOWPInconsistent.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.eq2",
"IOWPInconsistent.prop"
] | [] | false | false | false | true | false | let inj (#x: Type) : x -> (x -> prop) =
| fun x0 y0 -> x0 == y0 | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.right_unitality_lemma | val right_unitality_lemma : m: Type -> u9: m -> mult: (_: m -> _: m -> m) -> Prims.logical | let right_unitality_lemma (m:Type) (u:m) (mult:m -> m -> m) =
forall (x:m). x `mult` u == x | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 30,
"start_col": 0,
"start_line": 29
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> u9: m -> mult: (_: m -> _: m -> m) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | true | true | let right_unitality_lemma (m: Type) (u: m) (mult: (m -> m -> m)) =
| forall (x: m). x `mult` u == x | false | |
Spec.SHA2.fst | Spec.SHA2.ws0_pre_inner | val ws0_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < block_word_length a}) (ws: k_w a)
: k_w a | val ws0_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < block_word_length a}) (ws: k_w a)
: k_w a | let ws0_pre_inner (a:sha2_alg) (block:block_w a) (i:nat{i < block_word_length a}) (ws:k_w a) : k_w a =
Seq.upd ws i (Seq.index block i) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 180,
"start_col": 0,
"start_line": 179
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
block: Spec.SHA2.block_w a ->
i: Prims.nat{i < Spec.Hash.Definitions.block_word_length a} ->
ws: Spec.SHA2.k_w a
-> Spec.SHA2.k_w a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.block_w",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Spec.Hash.Definitions.block_word_length",
"Spec.SHA2.k_w",
"FStar.Seq.Base.upd",
"Spec.Hash.Definitions.word",
"FStar.Seq.Base.index"
] | [] | false | false | false | false | false | let ws0_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < block_word_length a}) (ws: k_w a)
: k_w a =
| Seq.upd ws i (Seq.index block i) | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.left_unitality_lemma | val left_unitality_lemma : m: Type -> u17: m -> mult: (_: m -> _: m -> m) -> Prims.logical | let left_unitality_lemma (m:Type) (u:m) (mult:m -> m -> m) =
forall (x:m). u `mult` x == x | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 33,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> u17: m -> mult: (_: m -> _: m -> m) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | true | true | let left_unitality_lemma (m: Type) (u: m) (mult: (m -> m -> m)) =
| forall (x: m). u `mult` x == x | false | |
Spec.SHA2.fst | Spec.SHA2.ws_pre_inner | val ws_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < size_k_w a}) (ws: k_w a) : k_w a | val ws_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < size_k_w a}) (ws: k_w a) : k_w a | let ws_pre_inner (a:sha2_alg) (block:block_w a) (i:nat{i < size_k_w a}) (ws:k_w a) : k_w a =
if i < block_word_length a then
ws0_pre_inner a block i ws
else
wsi_pre_inner a i ws | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 195,
"start_col": 0,
"start_line": 191
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
block: Spec.SHA2.block_w a ->
i: Prims.nat{i < Spec.SHA2.size_k_w a} ->
ws: Spec.SHA2.k_w a
-> Spec.SHA2.k_w a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.block_w",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Spec.SHA2.size_k_w",
"Spec.SHA2.k_w",
"Spec.Hash.Definitions.block_word_length",
"Spec.SHA2.ws0_pre_inner",
"Prims.bool",
"Spec.SHA2.wsi_pre_inner"
] | [] | false | false | false | false | false | let ws_pre_inner (a: sha2_alg) (block: block_w a) (i: nat{i < size_k_w a}) (ws: k_w a) : k_w a =
| if i < block_word_length a then ws0_pre_inner a block i ws else wsi_pre_inner a i ws | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.associativity_lemma | val associativity_lemma : m: Type -> mult: (_: m -> _: m -> m) -> Prims.logical | let associativity_lemma (m:Type) (mult:m -> m -> m) =
forall (x y z:m). x `mult` y `mult` z == x `mult` (y `mult` z) | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 36,
"start_col": 0,
"start_line": 35
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> mult: (_: m -> _: m -> m) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | true | true | let associativity_lemma (m: Type) (mult: (m -> m -> m)) =
| forall (x: m) (y: m) (z: m). (x `mult` y) `mult` z == x `mult` (y `mult` z) | false | |
Spec.SHA2.fst | Spec.SHA2._Sigma1 | val _Sigma1: a:sha2_alg -> x:(word a) -> Tot (word a) | val _Sigma1: a:sha2_alg -> x:(word a) -> Tot (word a) | let _Sigma1 a x = (x >>>. (op0 a).c3) ^. (x >>>. (op0 a).c4) ^. (x >>>. (op0 a).c5) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 83,
"end_line": 125,
"start_col": 0,
"start_line": 125
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> x: Spec.Hash.Definitions.word a -> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Greater_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__c3",
"Spec.SHA2.op0",
"Spec.SHA2.__proj__Mkops__item__c4",
"Spec.SHA2.__proj__Mkops__item__c5"
] | [] | false | false | false | false | false | let _Sigma1 a x =
| (x >>>. (op0 a).c3) ^. (x >>>. (op0 a).c4) ^. (x >>>. (op0 a).c5) | false |
IOWPInconsistent.fst | IOWPInconsistent.p0 | val p0: #a: Type -> either (out_wp a) a -> prop | val p0: #a: Type -> either (out_wp a) a -> prop | let p0 : #a:Type -> either (out_wp a) a -> prop = fun #a x ->
exists (p:either (out_wp a) a -> prop).
f #a p == x /\ ~(p x) | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 | x: FStar.Pervasives.either (IOWPInconsistent.out_wp a) a -> IOWPInconsistent.prop | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp",
"Prims.l_Exists",
"IOWPInconsistent.prop",
"Prims.l_and",
"Prims.eq2",
"IOWPInconsistent.f",
"Prims.l_not"
] | [] | false | false | false | true | false | let p0: #a: Type -> either (out_wp a) a -> prop =
| fun #a x -> exists (p: (either (out_wp a) a -> prop)). f #a p == x /\ ~(p x) | false |
IOWPInconsistent.fst | IOWPInconsistent.f_injective | val f_injective (#a: Type) (p p': (either (out_wp a) a -> prop))
: Lemma (requires (f p == f p')) (ensures (p == p')) | val f_injective (#a: Type) (p p': (either (out_wp a) a -> prop))
: Lemma (requires (f p == f p')) (ensures (p == p')) | let f_injective (#a:Type) (p p' : either (out_wp a) a -> prop)
: Lemma (requires (f p == f p'))
(ensures (p == p')) =
inj_injective p p' ;
intro_injective (inj p) (inj p') | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 68,
"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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"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 |
p: (_: FStar.Pervasives.either (IOWPInconsistent.out_wp a) a -> IOWPInconsistent.prop) ->
p': (_: FStar.Pervasives.either (IOWPInconsistent.out_wp a) a -> IOWPInconsistent.prop)
-> FStar.Pervasives.Lemma (requires IOWPInconsistent.f p == IOWPInconsistent.f p')
(ensures p == p') | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp",
"IOWPInconsistent.prop",
"IOWPInconsistent.intro_injective",
"IOWPInconsistent.inj",
"Prims.unit",
"IOWPInconsistent.inj_injective",
"Prims.eq2",
"IOWPInconsistent.f",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let f_injective (#a: Type) (p p': (either (out_wp a) a -> prop))
: Lemma (requires (f p == f p')) (ensures (p == p')) =
| inj_injective p p';
intro_injective (inj p) (inj p') | false |
Spec.SHA2.fst | Spec.SHA2.ws_pre_ | val ws_pre_ (a: sha2_alg) (block: block_w a) : k_w a | val ws_pre_ (a: sha2_alg) (block: block_w a) : k_w a | let ws_pre_ (a:sha2_alg) (block:block_w a) : k_w a =
Lib.LoopCombinators.repeati (size_k_w a) (ws_pre_inner a block) (Seq.create (size_k_w a) (to_word a 0)) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 105,
"end_line": 198,
"start_col": 0,
"start_line": 197
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> block: Spec.SHA2.block_w a -> Spec.SHA2.k_w a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.block_w",
"Lib.LoopCombinators.repeati",
"Spec.SHA2.k_w",
"Spec.SHA2.size_k_w",
"Spec.SHA2.ws_pre_inner",
"FStar.Seq.Base.create",
"Spec.Hash.Definitions.word",
"Spec.SHA2.to_word"
] | [] | false | false | false | false | false | let ws_pre_ (a: sha2_alg) (block: block_w a) : k_w a =
| Lib.LoopCombinators.repeati (size_k_w a)
(ws_pre_inner a block)
(Seq.create (size_k_w a) (to_word a 0)) | false |
IOWPInconsistent.fst | IOWPInconsistent.bad1 | val bad1 (a: Type) : Lemma (requires (p0 (x0 #a))) (ensures (~(p0 (x0 #a)))) | val bad1 (a: Type) : Lemma (requires (p0 (x0 #a))) (ensures (~(p0 (x0 #a)))) | let bad1 (a:Type)
: Lemma (requires (p0 (x0 #a)))
(ensures (~(p0 (x0 #a)))) =
let aux (p:(either (out_wp a) a -> prop){f p == (x0 #a) /\ ~(p (x0 #a))})
: GTot (squash (~(p0 (x0 #a)))) =
f_injective p p0
in
exists_elim (~(p0 (x0 #a))) (FStar.Squash.get_proof (p0 (x0 #a))) aux | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 71,
"end_line": 84,
"start_col": 0,
"start_line": 77
} | (*
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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type
-> FStar.Pervasives.Lemma (requires IOWPInconsistent.p0 IOWPInconsistent.x0)
(ensures ~(IOWPInconsistent.p0 IOWPInconsistent.x0)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Classical.exists_elim",
"Prims.l_not",
"IOWPInconsistent.p0",
"IOWPInconsistent.x0",
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp",
"IOWPInconsistent.prop",
"Prims.l_and",
"Prims.eq2",
"IOWPInconsistent.f",
"FStar.Squash.get_proof",
"Prims.squash",
"IOWPInconsistent.f_injective... | [] | false | false | true | false | false | let bad1 (a: Type) : Lemma (requires (p0 (x0 #a))) (ensures (~(p0 (x0 #a)))) =
| let aux (p: (either (out_wp a) a -> prop){f p == (x0 #a) /\ ~(p (x0 #a))})
: GTot (squash (~(p0 (x0 #a)))) =
f_injective p p0
in
exists_elim (~(p0 (x0 #a))) (FStar.Squash.get_proof (p0 (x0 #a))) aux | false |
Spec.SHA2.fst | Spec.SHA2.h0 | val h0 (a: sha2_alg) : Tot (words_state a) | val h0 (a: sha2_alg) : Tot (words_state a) | let h0: a:sha2_alg -> Tot (words_state a) = function
| SHA2_224 -> C.h224
| SHA2_256 -> C.h256
| SHA2_384 -> C.h384
| SHA2_512 -> C.h512 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 141,
"start_col": 0,
"start_line": 137
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.SHA2.Constants.h224",
"Spec.SHA2.Constants.h256",
"Spec.SHA2.Constants.h384",
"Spec.SHA2.Constants.h512",
"Spec.Hash.Definitions.words_state"
] | [] | false | false | false | false | false | let h0: a: sha2_alg -> Tot (words_state a) =
| function
| SHA2_224 -> C.h224
| SHA2_256 -> C.h256
| SHA2_384 -> C.h384
| SHA2_512 -> C.h512 | false |
IOWPInconsistent.fst | IOWPInconsistent.bad2 | val bad2 (a: Type) : Lemma (requires (~(p0 (x0 #a)))) (ensures (p0 (x0 #a))) | val bad2 (a: Type) : Lemma (requires (~(p0 (x0 #a)))) (ensures (p0 (x0 #a))) | let bad2 (a:Type)
: Lemma (requires (~(p0 (x0 #a))))
(ensures (p0 (x0 #a))) =
exists_intro (fun (p:either (out_wp a) a -> prop) ->
f p == x0 #a /\ ~(p (x0 #a))) p0 | {
"file_name": "examples/paradoxes/IOWPInconsistent.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 90,
"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.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "IOWPInconsistent.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type
-> FStar.Pervasives.Lemma (requires ~(IOWPInconsistent.p0 IOWPInconsistent.x0))
(ensures IOWPInconsistent.p0 IOWPInconsistent.x0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Classical.exists_intro",
"FStar.Pervasives.either",
"IOWPInconsistent.out_wp",
"IOWPInconsistent.prop",
"Prims.l_and",
"Prims.eq2",
"IOWPInconsistent.f",
"IOWPInconsistent.x0",
"Prims.l_not",
"IOWPInconsistent.p0",
"Prims.unit",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern... | [] | false | false | true | false | false | let bad2 (a: Type) : Lemma (requires (~(p0 (x0 #a)))) (ensures (p0 (x0 #a))) =
| exists_intro (fun (p: (either (out_wp a) a -> prop)) -> f p == x0 #a /\ ~(p (x0 #a))) p0 | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.monoid_morphism_mult_lemma | val monoid_morphism_mult_lemma : f: (_: a -> b) -> ma: FStar.Algebra.Monoid.monoid a -> mb: FStar.Algebra.Monoid.monoid b
-> Prims.logical | let monoid_morphism_mult_lemma (#a #b:Type) (f:a -> b) (ma:monoid a) (mb:monoid b) =
forall (x y:a). Monoid?.mult mb (f x) (f y) == f (Monoid?.mult ma x y) | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 150,
"start_col": 0,
"start_line": 149
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 | f: (_: a -> b) -> ma: FStar.Algebra.Monoid.monoid a -> mb: FStar.Algebra.Monoid.monoid b
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.monoid",
"Prims.l_Forall",
"Prims.eq2",
"FStar.Algebra.Monoid.__proj__Monoid__item__mult",
"Prims.logical"
] | [] | false | false | false | true | true | let monoid_morphism_mult_lemma (#a #b: Type) (f: (a -> b)) (ma: monoid a) (mb: monoid b) =
| forall (x: a) (y: a). Monoid?.mult mb (f x) (f y) == f (Monoid?.mult ma x y) | false | |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.monoid_morphism_unit_lemma | val monoid_morphism_unit_lemma : f: (_: a -> b) -> ma: FStar.Algebra.Monoid.monoid a -> mb: FStar.Algebra.Monoid.monoid b
-> Prims.logical | let monoid_morphism_unit_lemma (#a #b:Type) (f:a -> b) (ma:monoid a) (mb:monoid b) =
f (Monoid?.unit ma) == Monoid?.unit mb | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 147,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 | f: (_: a -> b) -> ma: FStar.Algebra.Monoid.monoid a -> mb: FStar.Algebra.Monoid.monoid b
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.monoid",
"Prims.eq2",
"FStar.Algebra.Monoid.__proj__Monoid__item__unit",
"Prims.logical"
] | [] | false | false | false | true | true | let monoid_morphism_unit_lemma (#a #b: Type) (f: (a -> b)) (ma: monoid a) (mb: monoid b) =
| f (Monoid?.unit ma) == Monoid?.unit mb | false | |
Spec.SHA2.fst | Spec.SHA2._sigma0 | val _sigma0: a:sha2_alg -> x:(word a) -> Tot (word a) | val _sigma0: a:sha2_alg -> x:(word a) -> Tot (word a) | let _sigma0 a x = (x >>>. (op0 a).e0) ^. (x >>>. (op0 a).e1) ^. (x >>. (op0 a).e2) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 130,
"start_col": 0,
"start_line": 130
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> x: Spec.Hash.Definitions.word a -> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Greater_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__e0",
"Spec.SHA2.op0",
"Spec.SHA2.__proj__Mkops__item__e1",
"Spec.SHA2.op_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__e2"
] | [] | false | false | false | false | false | let _sigma0 a x =
| (x >>>. (op0 a).e0) ^. (x >>>. (op0 a).e1) ^. (x >>. (op0 a).e2) | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.embed_nat_int | val embed_nat_int (n: nat) : int | val embed_nat_int (n: nat) : int | let embed_nat_int (n:nat) : int = n | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 | n: Prims.nat -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.int"
] | [] | false | false | false | true | false | let embed_nat_int (n: nat) : int =
| n | false |
Spec.SHA2.fst | Spec.SHA2._sigma1 | val _sigma1: a:sha2_alg -> x:(word a) -> Tot (word a) | val _sigma1: a:sha2_alg -> x:(word a) -> Tot (word a) | let _sigma1 a x = (x >>>. (op0 a).e3) ^. (x >>>. (op0 a).e4) ^. (x >>. (op0 a).e5) | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 135,
"start_col": 0,
"start_line": 135
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 | a: Spec.Hash.Definitions.sha2_alg -> x: Spec.Hash.Definitions.word a -> Spec.Hash.Definitions.word a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Hat_Dot",
"Spec.SHA2.op_Greater_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__e3",
"Spec.SHA2.op0",
"Spec.SHA2.__proj__Mkops__item__e4",
"Spec.SHA2.op_Greater_Greater_Dot",
"Spec.SHA2.__proj__Mkops__item__e5"
] | [] | false | false | false | false | false | let _sigma1 a x =
| (x >>>. (op0 a).e3) ^. (x >>>. (op0 a).e4) ^. (x >>. (op0 a).e5) | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.neg | val neg (p: prop) : prop | val neg (p: prop) : prop | let neg (p:prop) : prop = ~p | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 | p: Prims.prop -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"Prims.l_not"
] | [] | false | false | false | true | true | let neg (p: prop) : prop =
| ~p | false |
Spec.SHA2.fst | Spec.SHA2.wsi_pre_inner | val wsi_pre_inner (a: sha2_alg) (i: nat{i >= block_word_length a /\ i < size_k_w a}) (ws: k_w a)
: k_w a | val wsi_pre_inner (a: sha2_alg) (i: nat{i >= block_word_length a /\ i < size_k_w a}) (ws: k_w a)
: k_w a | let wsi_pre_inner (a:sha2_alg) (i:nat{i >= block_word_length a /\ i < size_k_w a}) (ws:k_w a) : k_w a =
let t16 = ws.[i - 16] in
let t15 = ws.[i - 15] in
let t7 = ws.[i - 7] in
let t2 = ws.[i - 2] in
let s1 = _sigma1 a t2 in
let s0 = _sigma0 a t15 in
Seq.upd ws i (s1 +. t7 +.... | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 189,
"start_col": 0,
"start_line": 182
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
i: Prims.nat{i >= Spec.Hash.Definitions.block_word_length a /\ i < Spec.SHA2.size_k_w a} ->
ws: Spec.SHA2.k_w a
-> Spec.SHA2.k_w a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Spec.Hash.Definitions.block_word_length",
"Prims.op_LessThan",
"Spec.SHA2.size_k_w",
"Spec.SHA2.k_w",
"FStar.Seq.Base.upd",
"Spec.Hash.Definitions.word",
"Spec.SHA2.op_Plus_Dot",
"Spec.... | [] | false | false | false | false | false | let wsi_pre_inner (a: sha2_alg) (i: nat{i >= block_word_length a /\ i < size_k_w a}) (ws: k_w a)
: k_w a =
| let t16 = ws.[ i - 16 ] in
let t15 = ws.[ i - 15 ] in
let t7 = ws.[ i - 7 ] in
let t2 = ws.[ i - 2 ] in
let s1 = _sigma1 a t2 in
let s0 = _sigma0 a t15 in
Seq.upd ws i (s1 +. t7 +. s0 +. t16) | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.mult_act_lemma | val mult_act_lemma : m: Type -> a: Type -> mult: (_: m -> _: m -> m) -> act: (_: m -> _: a -> a) -> Prims.logical | let mult_act_lemma (m a:Type) (mult:m -> m -> m) (act:m -> a -> a) =
forall (x x':m) (y:a). (x `mult` x') `act` y == x `act` (x' `act` y) | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 192,
"start_col": 0,
"start_line": 191
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> a: Type -> mult: (_: m -> _: m -> m) -> act: (_: m -> _: a -> a) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | true | true | let mult_act_lemma (m a: Type) (mult: (m -> m -> m)) (act: (m -> a -> a)) =
| forall (x: m) (x': m) (y: a). (x `mult` x') `act` y == x `act` (x' `act` y) | false | |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.int_plus_monoid | val int_plus_monoid:monoid int | val int_plus_monoid:monoid int | let int_plus_monoid : monoid int =
intro_monoid int 0 (+) | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 64,
"start_col": 0,
"start_line": 63
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.int | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.int",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let int_plus_monoid:monoid int =
| intro_monoid int 0 ( + ) | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.left_action_morphism | val left_action_morphism : f: (_: a -> b) ->
mf: (_: ma -> mb) ->
la: FStar.Algebra.Monoid.left_action mma a ->
lb: FStar.Algebra.Monoid.left_action mmb b
-> Prims.logical | let left_action_morphism
(#a #b #ma #mb:Type)
(f:a -> b)
(* mf ought to be a monoid morphism but we don't use this fact in the property *)
(mf: ma -> mb)
(#mma:monoid ma)
(#mmb:monoid mb)
(la:left_action mma a)
(lb:left_action mmb b)
= forall (g:ma) (x:a). LAct?.act lb (mf g) (f x) == f ... | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 214,
"start_col": 0,
"start_line": 205
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 |
f: (_: a -> b) ->
mf: (_: ma -> mb) ->
la: FStar.Algebra.Monoid.left_action mma a ->
lb: FStar.Algebra.Monoid.left_action mmb b
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.monoid",
"FStar.Algebra.Monoid.left_action",
"Prims.l_Forall",
"Prims.eq2",
"FStar.Algebra.Monoid.__proj__LAct__item__act",
"Prims.logical"
] | [] | false | false | false | false | true | let left_action_morphism
(#a #b #ma #mb: Type)
(f: (a -> b))
(mf: (ma -> mb))
(#mma: monoid ma)
(#mmb: monoid mb)
(la: left_action mma a)
(lb: left_action mmb b)
=
| forall (g: ma) (x: a). LAct?.act lb (mf g) (f x) == f (LAct?.act la g x) | false | |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.unit_act_lemma | val unit_act_lemma : m: Type -> a: Type -> u223: m -> act: (_: m -> _: a -> a) -> Prims.logical | let unit_act_lemma (m a:Type) (u:m) (act:m -> a -> a) =
forall (y:a). u `act` y == y | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 195,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> a: Type -> u223: m -> act: (_: m -> _: a -> a) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_Forall",
"Prims.eq2",
"Prims.logical"
] | [] | false | false | false | true | true | let unit_act_lemma (m a: Type) (u: m) (act: (m -> a -> a)) =
| forall (y: a). u `act` y == y | false | |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.intro_monoid | val intro_monoid (m: Type) (u: m) (mult: (m -> m -> m))
: Pure (monoid m)
(requires
(right_unitality_lemma m u mult /\ left_unitality_lemma m u mult /\
associativity_lemma m mult))
(ensures (fun mm -> Monoid?.unit mm == u /\ Monoid?.mult mm == mult)) | val intro_monoid (m: Type) (u: m) (mult: (m -> m -> m))
: Pure (monoid m)
(requires
(right_unitality_lemma m u mult /\ left_unitality_lemma m u mult /\
associativity_lemma m mult))
(ensures (fun mm -> Monoid?.unit mm == u /\ Monoid?.mult mm == mult)) | let intro_monoid (m:Type) (u:m) (mult:m -> m -> m)
: Pure (monoid m)
(requires (right_unitality_lemma m u mult /\ left_unitality_lemma m u mult /\ associativity_lemma m mult))
(ensures (fun mm -> Monoid?.unit mm == u /\ Monoid?.mult mm == mult))
=
Monoid u mult () () () | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 54,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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: Type -> u85: m -> mult: (_: m -> _: m -> m) -> Prims.Pure (FStar.Algebra.Monoid.monoid m) | Prims.Pure | [] | [] | [
"FStar.Algebra.Monoid.Monoid",
"FStar.Algebra.Monoid.monoid",
"Prims.l_and",
"FStar.Algebra.Monoid.right_unitality_lemma",
"FStar.Algebra.Monoid.left_unitality_lemma",
"FStar.Algebra.Monoid.associativity_lemma",
"Prims.eq2",
"FStar.Algebra.Monoid.__proj__Monoid__item__unit",
"FStar.Algebra.Monoid.__... | [] | false | false | false | false | false | let intro_monoid (m: Type) (u: m) (mult: (m -> m -> m))
: Pure (monoid m)
(requires
(right_unitality_lemma m u mult /\ left_unitality_lemma m u mult /\
associativity_lemma m mult))
(ensures (fun mm -> Monoid?.unit mm == u /\ Monoid?.mult mm == mult)) =
| Monoid u mult () () () | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.bool_and_monoid | val bool_and_monoid:monoid bool | val bool_and_monoid:monoid bool | let bool_and_monoid : monoid bool =
let and_ b1 b2 = b1 && b2 in
intro_monoid bool true and_ | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 126,
"start_col": 0,
"start_line": 124
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.bool",
"Prims.op_AmpAmp"
] | [] | false | false | false | true | false | let bool_and_monoid:monoid bool =
| let and_ b1 b2 = b1 && b2 in
intro_monoid bool true and_ | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.nat_plus_monoid | val nat_plus_monoid:monoid nat | val nat_plus_monoid:monoid nat | let nat_plus_monoid : monoid nat =
let add (x y : nat) : nat = x + y in
intro_monoid nat 0 add | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 61,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.nat | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.nat",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let nat_plus_monoid:monoid nat =
| let add (x y: nat) : nat = x + y in
intro_monoid nat 0 add | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.conjunction_monoid | val conjunction_monoid:monoid prop | val conjunction_monoid:monoid prop | let conjunction_monoid : monoid prop =
let u : prop = singleton True in
let mult (p q : prop) : prop = p /\ q in
let left_unitality_helper (p:prop) : Lemma ((u `mult` p) == p) =
assert ((u `mult` p) <==> p) ;
PropExt.apply (u `mult` p) p
in
let right_unitality_helper (p:prop) : Lemma ((p `mult` u) =... | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 94,
"start_col": 0,
"start_line": 69
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.prop | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.prop",
"Prims.unit",
"Prims._assert",
"FStar.Algebra.Monoid.associativity_lemma",
"FStar.Classical.forall_intro_3",
"Prims.eq2",
"FStar.Algebra.Monoid.left_unitality_lemma",
"FStar.Classical.forall_intro",
"FStar.Algebra.Monoid.right_unitality_lemma",
... | [] | false | false | false | true | false | let conjunction_monoid:monoid prop =
| let u:prop = singleton True in
let mult (p q: prop) : prop = p /\ q in
let left_unitality_helper (p: prop) : Lemma ((u `mult` p) == p) =
assert ((u `mult` p) <==> p);
PropExt.apply (u `mult` p) p
in
let right_unitality_helper (p: prop) : Lemma ((p `mult` u) == p) =
assert ((p `mult` u) <==> p);
PropExt.apply (p... | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.lift_monoid_option | val lift_monoid_option (#a: Type) (m: monoid a) : monoid (option a) | val lift_monoid_option (#a: Type) (m: monoid a) : monoid (option a) | let lift_monoid_option (#a:Type) (m:monoid a) : monoid (option a) =
let mult (x y:option a) =
match x, y with
| Some x0, Some y0 -> Some (m.mult x0 y0)
| _, _ -> None
in
intro_monoid (option a) (Some m.unit) mult | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 142,
"start_col": 0,
"start_line": 136
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid a -> FStar.Algebra.Monoid.monoid (FStar.Pervasives.Native.option a) | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.monoid",
"FStar.Algebra.Monoid.intro_monoid",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Some",
"FStar.Algebra.Monoid.__proj__Monoid__item__unit",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Algebra.Monoid.__proj__Monoid__item__mult",
"FStar.Pervasives.Native.None"... | [] | false | false | false | true | false | let lift_monoid_option (#a: Type) (m: monoid a) : monoid (option a) =
| let mult (x y: option a) =
match x, y with
| Some x0, Some y0 -> Some (m.mult x0 y0)
| _, _ -> None
in
intro_monoid (option a) (Some m.unit) mult | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.bool_xor_monoid | val bool_xor_monoid:monoid bool | val bool_xor_monoid:monoid bool | let bool_xor_monoid : monoid bool =
let xor b1 b2 = (b1 || b2) && not (b1 && b2) in
intro_monoid bool false xor | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 134,
"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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.bool",
"Prims.op_AmpAmp",
"Prims.op_BarBar",
"Prims.op_Negation"
] | [] | false | false | false | true | false | let bool_xor_monoid:monoid bool =
| let xor b1 b2 = (b1 || b2) && not (b1 && b2) in
intro_monoid bool false xor | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.intro_monoid_morphism | val intro_monoid_morphism (#a #b: Type) (f: (a -> b)) (ma: monoid a) (mb: monoid b)
: Pure (monoid_morphism f ma mb)
(requires (monoid_morphism_unit_lemma f ma mb /\ monoid_morphism_mult_lemma f ma mb))
(ensures (fun _ -> True)) | val intro_monoid_morphism (#a #b: Type) (f: (a -> b)) (ma: monoid a) (mb: monoid b)
: Pure (monoid_morphism f ma mb)
(requires (monoid_morphism_unit_lemma f ma mb /\ monoid_morphism_mult_lemma f ma mb))
(ensures (fun _ -> True)) | let intro_monoid_morphism (#a #b:Type) (f:a -> b) (ma:monoid a) (mb:monoid b)
: Pure (monoid_morphism f ma mb)
(requires (monoid_morphism_unit_lemma f ma mb /\ monoid_morphism_mult_lemma f ma mb))
(ensures (fun _ -> True))
=
MonoidMorphism () () | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 163,
"start_col": 0,
"start_line": 158
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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 | f: (_: a -> b) -> ma: FStar.Algebra.Monoid.monoid a -> mb: FStar.Algebra.Monoid.monoid b
-> Prims.Pure (FStar.Algebra.Monoid.monoid_morphism f ma mb) | Prims.Pure | [] | [] | [
"FStar.Algebra.Monoid.monoid",
"FStar.Algebra.Monoid.MonoidMorphism",
"FStar.Algebra.Monoid.monoid_morphism",
"Prims.l_and",
"FStar.Algebra.Monoid.monoid_morphism_unit_lemma",
"FStar.Algebra.Monoid.monoid_morphism_mult_lemma",
"Prims.l_True"
] | [] | false | false | false | false | false | let intro_monoid_morphism (#a #b: Type) (f: (a -> b)) (ma: monoid a) (mb: monoid b)
: Pure (monoid_morphism f ma mb)
(requires (monoid_morphism_unit_lemma f ma mb /\ monoid_morphism_mult_lemma f ma mb))
(ensures (fun _ -> True)) =
| MonoidMorphism () () | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.bool_or_monoid | val bool_or_monoid:monoid bool | val bool_or_monoid:monoid bool | let bool_or_monoid : monoid bool =
let or_ b1 b2 = b1 || b2 in
intro_monoid bool false or_ | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 130,
"start_col": 0,
"start_line": 128
} | (*
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.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.bool",
"Prims.op_BarBar"
] | [] | false | false | false | true | false | let bool_or_monoid:monoid bool =
| let or_ b1 b2 = b1 || b2 in
intro_monoid bool false or_ | false |
FStar.Algebra.Monoid.fst | FStar.Algebra.Monoid.disjunction_monoid | val disjunction_monoid:monoid prop | val disjunction_monoid:monoid prop | let disjunction_monoid : monoid prop =
let u : prop = singleton False in
let mult (p q : prop) : prop = p \/ q in
let left_unitality_helper (p:prop) : Lemma ((u `mult` p) == p) =
assert ((u `mult` p) <==> p) ;
PropExt.apply (u `mult` p) p
in
let right_unitality_helper (p:prop) : Lemma ((p `mult` u) ... | {
"file_name": "ulib/FStar.Algebra.Monoid.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 122,
"start_col": 0,
"start_line": 97
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Algebra.Monoid.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.PropositionalExtensionality",
"short_module": "PropExt"
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Algebra",
"short_module": null
},
{
"abbrev": 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.Algebra.Monoid.monoid Prims.prop | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.Monoid.intro_monoid",
"Prims.prop",
"Prims.unit",
"Prims._assert",
"FStar.Algebra.Monoid.associativity_lemma",
"FStar.Classical.forall_intro_3",
"Prims.eq2",
"FStar.Algebra.Monoid.left_unitality_lemma",
"FStar.Classical.forall_intro",
"FStar.Algebra.Monoid.right_unitality_lemma",
... | [] | false | false | false | true | false | let disjunction_monoid:monoid prop =
| let u:prop = singleton False in
let mult (p q: prop) : prop = p \/ q in
let left_unitality_helper (p: prop) : Lemma ((u `mult` p) == p) =
assert ((u `mult` p) <==> p);
PropExt.apply (u `mult` p) p
in
let right_unitality_helper (p: prop) : Lemma ((p `mult` u) == p) =
assert ((p `mult` u) <==> p);
PropExt.apply (... | false |
Spec.SHA2.fst | Spec.SHA2.shuffle_pre | val shuffle_pre (a: sha2_alg) (hash: words_state a) (block: block_w a) : Tot (words_state a) | val shuffle_pre (a: sha2_alg) (hash: words_state a) (block: block_w a) : Tot (words_state a) | let shuffle_pre (a:sha2_alg) (hash:words_state a) (block:block_w a): Tot (words_state a) =
let ws = ws_pre a block in
let k = k0 a in
Lib.LoopCombinators.repeati (size_k_w a)
(fun i h -> shuffle_core_pre a k.[i] ws.[i] h) hash | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 208,
"start_col": 0,
"start_line": 204
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
hash: Spec.Hash.Definitions.words_state a ->
block: Spec.SHA2.block_w a
-> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.words_state",
"Spec.SHA2.block_w",
"Lib.LoopCombinators.repeati",
"Spec.SHA2.size_k_w",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Spec.SHA2.shuffle_core_pre",
"Spec.SHA2.op_String_Access",
"Spec.Hash.Definitions.word",
"FStar.Seq.B... | [] | false | false | false | false | false | let shuffle_pre (a: sha2_alg) (hash: words_state a) (block: block_w a) : Tot (words_state a) =
| let ws = ws_pre a block in
let k = k0 a in
Lib.LoopCombinators.repeati (size_k_w a) (fun i h -> shuffle_core_pre a k.[ i ] ws.[ i ] h) hash | false |
Spec.SHA2.fst | Spec.SHA2.shuffle_core_pre_ | val shuffle_core_pre_ (a: sha2_alg) (k_t ws_t: word a) (hash: words_state a) : Tot (words_state a) | val shuffle_core_pre_ (a: sha2_alg) (k_t ws_t: word a) (hash: words_state a) : Tot (words_state a) | let shuffle_core_pre_ (a:sha2_alg) (k_t: word a) (ws_t: word a) (hash:words_state a) : Tot (words_state a) =
(**) assert(7 <= S.length hash);
let a0 = hash.[0] in
let b0 = hash.[1] in
let c0 = hash.[2] in
let d0 = hash.[3] in
let e0 = hash.[4] in
let f0 = hash.[5] in
let g0 = hash.[6] in
let h0 = hash... | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 170,
"start_col": 0,
"start_line": 153
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
k_t: Spec.Hash.Definitions.word a ->
ws_t: Spec.Hash.Definitions.word a ->
hash: Spec.Hash.Definitions.words_state a
-> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.word",
"Spec.Hash.Definitions.words_state",
"FStar.Seq.Base.seq_of_list",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot.Base.length",
"Prims.list",
"Prims.Cons",
"Spec.SHA2... | [] | false | false | false | false | false | let shuffle_core_pre_ (a: sha2_alg) (k_t ws_t: word a) (hash: words_state a) : Tot (words_state a) =
| assert (7 <= S.length hash);
let a0 = hash.[ 0 ] in
let b0 = hash.[ 1 ] in
let c0 = hash.[ 2 ] in
let d0 = hash.[ 3 ] in
let e0 = hash.[ 4 ] in
let f0 = hash.[ 5 ] in
let g0 = hash.[ 6 ] in
let h0 = hash.[ 7 ] in
assert (S.length (k0 a) = size_k_w a);
let t1 = h0 +. (_Sigma1 a e0) +. (_Ch a e0 f0 g0) +. k_t +. ws_t in
... | false |
Spec.SHA2.fst | Spec.SHA2.update_pre | val update_pre (a: sha2_alg) (hash: words_state a) (block: bytes{S.length block = block_length a})
: Tot (words_state a) | val update_pre (a: sha2_alg) (hash: words_state a) (block: bytes{S.length block = block_length a})
: Tot (words_state a) | let update_pre (a:sha2_alg) (hash:words_state a) (block:bytes{S.length block = block_length a}): Tot (words_state a) =
let block_w = words_of_bytes a #(block_word_length a) block in
let hash_1 = shuffle a hash block_w in
Spec.Loops.seq_map2 ( +. ) (hash <: Lib.Sequence.lseq (word a) (state_word_length a)) hash_1 | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 94,
"end_line": 217,
"start_col": 0,
"start_line": 214
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"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 |
a: Spec.Hash.Definitions.sha2_alg ->
hash: Spec.Hash.Definitions.words_state a ->
block:
Spec.Hash.Definitions.bytes
{FStar.Seq.Base.length block = Spec.Hash.Definitions.block_length a}
-> Spec.Hash.Definitions.words_state a | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Spec.Hash.Definitions.words_state",
"Spec.Hash.Definitions.bytes",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.l_or",
"Prims.op_GreaterThanOrEqual",
"Prims.op_disEquality",
"FStar.Seq.Base.length",
"Lib.IntTypes.uint8",
"Spec.Hash.Definitions.block_... | [] | false | false | false | false | false | let update_pre (a: sha2_alg) (hash: words_state a) (block: bytes{S.length block = block_length a})
: Tot (words_state a) =
| let block_w = words_of_bytes a #(block_word_length a) block in
let hash_1 = shuffle a hash block_w in
Spec.Loops.seq_map2 ( +. ) (hash <: Lib.Sequence.lseq (word a) (state_word_length a)) hash_1 | false |
Spec.SHA2.fst | Spec.SHA2.update | val update: a:sha2_alg -> update_t a | val update: a:sha2_alg -> update_t a | let update = update_pre | {
"file_name": "specs/Spec.SHA2.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 220,
"start_col": 0,
"start_line": 220
} | module Spec.SHA2
open Lib.IntTypes
module C = Spec.SHA2.Constants
module S = FStar.Seq
open Spec.Hash.Definitions
(* The core compression, padding and extraction functions for all SHA2
* algorithms. *)
(* Define the length of the constants. Also the number of scheduling rounds. *)
inline_for_extraction
let size_k_... | {
"checked_file": "/",
"dependencies": [
"Spec.SHA2.Constants.fst.checked",
"Spec.Loops.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.UInt32.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.SHA2.Constants",
"short_module": "C"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spe... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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: Spec.Hash.Definitions.sha2_alg -> Spec.Hash.Definitions.update_t a | Prims.Tot | [
"total"
] | [] | [
"Spec.SHA2.update_pre"
] | [] | false | false | false | false | false | let update =
| update_pre | false |
Spec.HMAC_DRBG.Test.fst | Spec.HMAC_DRBG.Test.test_vec | val test_vec : _: Spec.HMAC_DRBG.Test.Vectors.vec -> FStar.All.ALL Prims.bool | let test_vec
{a; entropy_input; entropy_input_reseed; nonce; personalization_string;
additional_input_reseed; additional_input_1; additional_input_2;
returned_bits}
=
let returned_bytes_len = String.strlen returned_bits / 2 in
let entropy_input_len = String.strlen entropy_input / 2 in
let ent... | {
"file_name": "specs/tests/Spec.HMAC_DRBG.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 95,
"end_line": 55,
"start_col": 0,
"start_line": 15
} | module Spec.HMAC_DRBG.Test
open FStar.Seq
open Lib.IntTypes
open Lib.Meta
open Spec.Agile.HMAC
open Spec.HMAC_DRBG
open Spec.HMAC_DRBG.Test.Vectors
module PS = Lib.PrintSequence
#set-options "--max_fuel 1 --max_ifuel 1 --z3rlimit 50" | {
"checked_file": "/",
"dependencies": [
"Spec.HMAC_DRBG.Test.Vectors.fst.checked",
"Spec.HMAC_DRBG.fsti.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.String.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Spec.HMAC_DRBG.Test.Vectors.vec -> FStar.All.ALL Prims.bool | FStar.All.ALL | [] | [] | [
"Spec.HMAC_DRBG.Test.Vectors.vec",
"Spec.HMAC_DRBG.Test.Vectors.supported_alg",
"Lib.Meta.hex_string",
"Prims.op_Negation",
"Prims.op_AmpAmp",
"Spec.HMAC_DRBG.Test.Vectors.is_supported_alg",
"Prims.op_LessThanOrEqual",
"Spec.HMAC_DRBG.min_length",
"Spec.HMAC_DRBG.max_length",
"Prims.op_Division",
... | [] | false | true | false | false | false | let test_vec
{ a = a ;
entropy_input = entropy_input ;
entropy_input_reseed = entropy_input_reseed ;
nonce = nonce ;
personalization_string = personalization_string ;
additional_input_reseed = additional_input_reseed ;
additional_input_1 = additional_inp... | let returned_bytes_len = String.strlen returned_bits / 2 in
let entropy_input_len = String.strlen entropy_input / 2 in
let entropy_input_reseed_len = String.strlen entropy_input_reseed / 2 in
let nonce_len = String.strlen nonce / 2 in
let personalization_string_len = String.strlen personalization_string / 2 in
let addi... | false | |
Spec.HMAC_DRBG.Test.fst | Spec.HMAC_DRBG.Test.test | val test : _: Prims.unit -> FStar.All.ALL Prims.bool | let test () =
let result = List.for_all test_vec test_vectors in
if result then
begin
IO.print_string "\n\n[HMAC-DRBG] PASS\n";
true
end
else
begin
IO.print_string "\n\n[HMAC-DRBG] FAIL\n";
false
end | {
"file_name": "specs/tests/Spec.HMAC_DRBG.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 68,
"start_col": 0,
"start_line": 57
} | module Spec.HMAC_DRBG.Test
open FStar.Seq
open Lib.IntTypes
open Lib.Meta
open Spec.Agile.HMAC
open Spec.HMAC_DRBG
open Spec.HMAC_DRBG.Test.Vectors
module PS = Lib.PrintSequence
#set-options "--max_fuel 1 --max_ifuel 1 --z3rlimit 50"
let test_vec
{a; entropy_input; entropy_input_reseed; nonce; personalization_st... | {
"checked_file": "/",
"dependencies": [
"Spec.HMAC_DRBG.Test.Vectors.fst.checked",
"Spec.HMAC_DRBG.fsti.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.String.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.All.ALL Prims.bool | FStar.All.ALL | [] | [] | [
"Prims.unit",
"Prims.bool",
"FStar.IO.print_string",
"FStar.List.for_all",
"Spec.HMAC_DRBG.Test.Vectors.vec",
"Spec.HMAC_DRBG.Test.test_vec",
"Spec.HMAC_DRBG.Test.Vectors.test_vectors"
] | [] | false | true | false | false | false | let test () =
| let result = List.for_all test_vec test_vectors in
if result
then
(IO.print_string "\n\n[HMAC-DRBG] PASS\n";
true)
else
(IO.print_string "\n\n[HMAC-DRBG] FAIL\n";
false) | false | |
Steel.MonotonicHigherReference.fst | Steel.MonotonicHigherReference.share | val share (#inames:_)
(#a:Type)
(#p:Preorder.preorder a)
(r:ref a p)
(f:perm)
(v:Ghost.erased a)
: SteelGhostT unit inames
(pts_to r f v)
(fun _ -> pts_to r (half_perm f) v `star` pts_to r (half_perm f) v) | val share (#inames:_)
(#a:Type)
(#p:Preorder.preorder a)
(r:ref a p)
(f:perm)
(v:Ghost.erased a)
: SteelGhostT unit inames
(pts_to r f v)
(fun _ -> pts_to r (half_perm f) v `star` pts_to r (half_perm f) v) | let share #o (#a:Type) (#p:Preorder.preorder a) (r:ref a p) (f:perm) (v:Ghost.erased a)
: SteelGhostT unit o
(pts_to r f v)
(fun _ -> pts_to r (half_perm f) v `star` pts_to r (half_perm f) v)
= let open Steel.Effect.Atomic in
elim_pts_to r f v;
let h : erased (history a p) = witness_exists () in
... | {
"file_name": "lib/steel/Steel.MonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 251,
"start_col": 0,
"start_line": 236
} | (*
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.Preorder.fst.checked",
"Steel.PCMReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.chec... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Ste... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: Steel.MonotonicHigherReference.ref a p ->
f: Steel.FractionalPermission.perm ->
v: FStar.Ghost.erased a
-> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.MonotonicHigherReference.ref",
"Steel.FractionalPermission.perm",
"FStar.Ghost.erased",
"Steel.MonotonicHigherReference.intro_pts_to",
"Steel.FractionalPermission.half_perm",
"Prims.unit",
"Steel.Effect.Atomic.intro_exists",
"Steel.Preorder.... | [] | false | true | false | false | false | let share #o (#a: Type) (#p: Preorder.preorder a) (r: ref a p) (f: perm) (v: Ghost.erased a)
: SteelGhostT unit
o
(pts_to r f v)
(fun _ -> (pts_to r (half_perm f) v) `star` (pts_to r (half_perm f) v)) =
| let open Steel.Effect.Atomic in
elim_pts_to r f v;
let h:erased (history a p) = witness_exists () in
elim_pure _;
let sh = split_current h in
PR.split r h sh sh;
intro_pure (history_val sh v (half_perm f));
intro_exists #(history a p) sh (pts_to_body r (half_perm f) v);
intro_pts_to r (half_perm f) v;
intro_pure (histo... | false |
OWGCounter.fst | OWGCounter.fst | val fst : x: (_ * _) -> _ | let fst = fst | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 54,
"start_col": 0,
"start_line": 54
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 | x: (_ * _) -> _ | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let fst =
| fst | false | |
OWGCounter.fst | OWGCounter.snd | val snd : x: (_ * _) -> _ | let snd = snd | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 57,
"start_col": 0,
"start_line": 57
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 | x: (_ * _) -> _ | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.snd",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let snd =
| snd | false | |
OWGCounter.fst | OWGCounter.half_perm | val half_perm : Steel.FractionalPermission.perm | let half_perm = half_perm full_perm | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 35,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 | Steel.FractionalPermission.perm | Prims.Tot | [
"total"
] | [] | [
"Steel.FractionalPermission.half_perm",
"Steel.FractionalPermission.full_perm"
] | [] | false | false | false | true | false | let half_perm =
| half_perm full_perm | false | |
OWGCounter.fst | OWGCounter.lock_inv_pred | val lock_inv_pred : r: Steel.Reference.ref Prims.int ->
r1: Steel.Reference.ghost_ref Prims.int ->
r2: Steel.Reference.ghost_ref Prims.int ->
x: (Prims.int * Prims.int)
-> Steel.Effect.Common.vprop | let lock_inv_pred (r:ref int) (r1 r2:ghost_ref int) =
fun (x:int & int) -> lock_inv_slprop r r1 r2 x | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 73,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 |
r: Steel.Reference.ref Prims.int ->
r1: Steel.Reference.ghost_ref Prims.int ->
r2: Steel.Reference.ghost_ref Prims.int ->
x: (Prims.int * Prims.int)
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ref",
"Prims.int",
"Steel.Reference.ghost_ref",
"FStar.Pervasives.Native.tuple2",
"OWGCounter.lock_inv_slprop",
"Steel.Effect.Common.vprop"
] | [] | false | false | false | true | false | let lock_inv_pred (r: ref int) (r1 r2: ghost_ref int) =
| fun (x: int & int) -> lock_inv_slprop r r1 r2 x | false | |
OWGCounter.fst | OWGCounter.lock_inv_slprop | val lock_inv_slprop : r: Steel.Reference.ref Prims.int ->
r1: Steel.Reference.ghost_ref Prims.int ->
r2: Steel.Reference.ghost_ref Prims.int ->
w: (Prims.int * Prims.int)
-> Steel.Effect.Common.vprop | let lock_inv_slprop (r:ref int) (r1 r2:ghost_ref int) (w:int & int) =
ghost_pts_to r1 half_perm (fst w) `star`
ghost_pts_to r2 half_perm (snd w) `star`
pts_to r full_perm (fst w + snd w) | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 36,
"end_line": 69,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 |
r: Steel.Reference.ref Prims.int ->
r1: Steel.Reference.ghost_ref Prims.int ->
r2: Steel.Reference.ghost_ref Prims.int ->
w: (Prims.int * Prims.int)
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ref",
"Prims.int",
"Steel.Reference.ghost_ref",
"FStar.Pervasives.Native.tuple2",
"Steel.Effect.Common.star",
"Steel.Reference.ghost_pts_to",
"OWGCounter.half_perm",
"OWGCounter.fst",
"OWGCounter.snd",
"Steel.Reference.pts_to",
"Steel.FractionalPermission.full_perm",
"Prims.op... | [] | false | false | false | true | false | let lock_inv_slprop (r: ref int) (r1 r2: ghost_ref int) (w: int & int) =
| ((ghost_pts_to r1 half_perm (fst w)) `star` (ghost_pts_to r2 half_perm (snd w)))
`star`
(pts_to r full_perm (fst w + snd w)) | false | |
OWGCounter.fst | OWGCounter.lock_inv | val lock_inv (r: ref int) (r1 r2: ghost_ref int) : vprop | val lock_inv (r: ref int) (r1 r2: ghost_ref int) : vprop | let lock_inv (r:ref int) (r1 r2:ghost_ref int) : vprop =
h_exists (lock_inv_pred r r1 r2) | {
"file_name": "share/steel/examples/steel/OWGCounter.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 78,
"start_col": 0,
"start_line": 77
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in 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.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.Effect.f... | [
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Reference",
"short_module": "R"
},
{
"abbrev": false,
"... | {
"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 |
r: Steel.Reference.ref Prims.int ->
r1: Steel.Reference.ghost_ref Prims.int ->
r2: Steel.Reference.ghost_ref Prims.int
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Reference.ref",
"Prims.int",
"Steel.Reference.ghost_ref",
"Steel.Effect.Atomic.h_exists",
"FStar.Pervasives.Native.tuple2",
"OWGCounter.lock_inv_pred",
"Steel.Effect.Common.vprop"
] | [] | false | false | false | true | false | let lock_inv (r: ref int) (r1 r2: ghost_ref int) : vprop =
| h_exists (lock_inv_pred r r1 r2) | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.shift_up_above | val shift_up_above : nat -> exp -> Tot exp | val shift_up_above : nat -> exp -> Tot exp | let shift_up_above n e = subst (sub_inc_above n) e | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | n: Prims.nat -> e: StlcStrongDbParSubst.exp -> StlcStrongDbParSubst.exp | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"StlcStrongDbParSubst.exp",
"StlcStrongDbParSubst.subst",
"StlcCbvDbParSubst.sub_inc_above"
] | [] | false | false | false | true | false | let shift_up_above n e =
| subst (sub_inc_above n) e | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.closed | val closed : exp -> Tot bool | val closed : exp -> Tot bool | let closed e = below 0 e | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 136,
"start_col": 0,
"start_line": 136
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | e: StlcStrongDbParSubst.exp -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"StlcStrongDbParSubst.exp",
"StlcCbvDbParSubst.below",
"Prims.bool"
] | [] | false | false | false | true | false | let closed e =
| below 0 e | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.step | val step : exp -> Tot (option exp) | val step : exp -> Tot (option exp) | let rec step e =
match e with
| EApp e1 e2 ->
if is_value e1 then
if is_value e2 then
match e1 with
| ELam t e' -> Some (subst (sub_beta e2) e')
| _ -> None
else
match (step e2) with
| Some e2' -> Some (EApp e1 e2')
| None ... | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 67,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | e: StlcStrongDbParSubst.exp -> FStar.Pervasives.Native.option StlcStrongDbParSubst.exp | Prims.Tot | [
"total"
] | [] | [
"StlcStrongDbParSubst.exp",
"StlcStrongDbParSubst.is_value",
"StlcStrongDbParSubst.typ",
"FStar.Pervasives.Native.Some",
"StlcStrongDbParSubst.subst",
"StlcStrongDbParSubst.sub_beta",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"Prims.bool",
"StlcCbvDbParSubst.step",
"StlcS... | [
"recursion"
] | false | false | false | true | false | let rec step e =
| match e with
| EApp e1 e2 ->
if is_value e1
then
if is_value e2
then
match e1 with
| ELam t e' -> Some (subst (sub_beta e2) e')
| _ -> None
else
match (step e2) with
| Some e2' -> Some (EApp e1 e2')
| None -> None
else
(match (step e1) with
| Some e1' -> S... | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.extend_gen | val extend_gen : var -> typ -> env -> Tot env | val extend_gen : var -> typ -> env -> Tot env | let extend_gen x t g = if x = 0 then extend t g
else (fun y -> if y < x then g y
else if y = x then Some t
else g (y-1)) | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 40,
"start_col": 0,
"start_line": 37
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | x: StlcStrongDbParSubst.var -> t: StlcStrongDbParSubst.typ -> g: StlcStrongDbParSubst.env
-> StlcStrongDbParSubst.env | Prims.Tot | [
"total"
] | [] | [
"StlcStrongDbParSubst.var",
"StlcStrongDbParSubst.typ",
"StlcStrongDbParSubst.env",
"Prims.op_Equality",
"Prims.int",
"StlcStrongDbParSubst.extend",
"Prims.bool",
"Prims.op_LessThan",
"FStar.Pervasives.Native.Some",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let extend_gen x t g =
| if x = 0 then extend t g else (fun y -> if y < x then g y else if y = x then Some t else g (y - 1)) | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.weakening | val weakening : n:nat -> #g:env -> #e:exp -> #t:typ -> t':typ ->
h:typing g e t -> Tot (typing (extend_gen n t' g) (shift_up_above n e) t)
(decreases h) | val weakening : n:nat -> #g:env -> #e:exp -> #t:typ -> t':typ ->
h:typing g e t -> Tot (typing (extend_gen n t' g) (shift_up_above n e) t)
(decreases h) | let rec weakening n #g #v #t t' h =
let hs : subst_typing (sub_inc_above n) g (extend_gen n t' g) =
fun y -> if y < n then TyVar y else TyVar (y+1)
in substitution (sub_inc_above n) h hs | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 48,
"start_col": 0,
"start_line": 45
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | n: Prims.nat -> t': StlcStrongDbParSubst.typ -> h: StlcStrongDbParSubst.typing g e t
-> Prims.Tot
(StlcStrongDbParSubst.typing (StlcCbvDbParSubst.extend_gen n t' g)
(StlcCbvDbParSubst.shift_up_above n e)
t) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.nat",
"StlcStrongDbParSubst.env",
"StlcStrongDbParSubst.exp",
"StlcStrongDbParSubst.typ",
"StlcStrongDbParSubst.typing",
"StlcStrongDbParSubst.substitution",
"StlcCbvDbParSubst.sub_inc_above",
"StlcCbvDbParSubst.extend_gen",
"StlcStrongDbParSubst.subst_typing",
"StlcStrongDbParSubst.var",
... | [
"recursion"
] | false | false | false | false | false | let rec weakening n #g #v #t t' h =
| let hs:subst_typing (sub_inc_above n) g (extend_gen n t' g) =
fun y -> if y < n then TyVar y else TyVar (y + 1)
in
substitution (sub_inc_above n) h hs | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.progress | val progress : #e:exp -> #t:typ -> h:typing empty e t ->
Lemma (ensures (is_value e \/ (Some? (step e)))) (decreases h) | val progress : #e:exp -> #t:typ -> h:typing empty e t ->
Lemma (ensures (is_value e \/ (Some? (step e)))) (decreases h) | let rec progress #e #t h =
if TyApp? h then let TyApp h1 h2 = h in progress h1; progress h2 | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 72,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | h: StlcStrongDbParSubst.typing StlcStrongDbParSubst.empty e t
-> FStar.Pervasives.Lemma
(ensures StlcStrongDbParSubst.is_value e \/ Some? (StlcCbvDbParSubst.step e)) (decreases h) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"StlcStrongDbParSubst.exp",
"StlcStrongDbParSubst.typ",
"StlcStrongDbParSubst.typing",
"StlcStrongDbParSubst.empty",
"StlcStrongDbParSubst.uu___is_TyApp",
"StlcStrongDbParSubst.env",
"StlcStrongDbParSubst.TArr",
"StlcCbvDbParSubst.progress",
"Prims.unit",
"Prims.bool"
] | [
"recursion"
] | false | false | true | false | false | let rec progress #e #t h =
| if TyApp? h
then
let TyApp h1 h2 = h in
progress h1;
progress h2 | false |
StlcCbvDbParSubst.fst | StlcCbvDbParSubst.sub_inc_above | val sub_inc_above : nat -> var -> Tot exp | val sub_inc_above : nat -> var -> Tot exp | let sub_inc_above n y = if y<n then EVar y else EVar (y+1) | {
"file_name": "examples/metatheory/StlcCbvDbParSubst.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2014 Catalin Hritcu, Nikhil Swamy, Microsoft Research and Inria
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
U... | {
"checked_file": "/",
"dependencies": [
"StlcStrongDbParSubst.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "StlcCbvDbParSubst.fst"
} | [
{
"abbrev": false,
"full_module": "StlcStrongDbParSubst",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": 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 | n: Prims.nat -> y: StlcStrongDbParSubst.var -> StlcStrongDbParSubst.exp | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"StlcStrongDbParSubst.var",
"Prims.op_LessThan",
"StlcStrongDbParSubst.EVar",
"Prims.bool",
"Prims.op_Addition",
"StlcStrongDbParSubst.exp"
] | [] | false | false | false | true | false | let sub_inc_above n y =
| if y < n then EVar y else EVar (y + 1) | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.