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
StatefulLens.fst
StatefulLens.hlens_ref
val hlens_ref (#a: Type) : hlens (ref a) a
val hlens_ref (#a: Type) : hlens (ref a) a
let hlens_ref (#a:Type) : hlens (ref a) a = { get = (fun (h, x) -> sel h x); put = (fun y (h, x) -> (upd h x y, x)) }
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 1, "end_line": 88, "start_col": 0, "start_line": 85 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
StatefulLens.hlens (FStar.ST.ref a) a
Prims.Tot
[ "total" ]
[]
[ "StatefulLens.Mkhlens", "FStar.ST.ref", "FStar.Pervasives.Native.tuple2", "FStar.Monotonic.Heap.heap", "FStar.Ref.sel", "FStar.Pervasives.Native.Mktuple2", "FStar.Ref.upd", "StatefulLens.hlens" ]
[]
false
false
false
true
false
let hlens_ref (#a: Type) : hlens (ref a) a =
{ get = (fun (h, x) -> sel h x); put = (fun y (h, x) -> (upd h x y, x)) }
false
SealedModel.fst
SealedModel.seal
val seal (#a : Type u#aa) (x:a) : Tot (sealed a)
val seal (#a : Type u#aa) (x:a) : Tot (sealed a)
let seal (#a : Type u#aa) (x:a) : Tot (sealed a) = Seal (fun () -> x)
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 20, "end_line": 43, "start_col": 0, "start_line": 42 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: a -> SealedModel.sealed a
Prims.Tot
[ "total" ]
[]
[ "SealedModel.Seal", "Prims.unit", "SealedModel.sealed" ]
[]
false
false
false
true
false
let seal (#a: Type u#aa) (x: a) : Tot (sealed a) =
Seal (fun () -> x)
false
SealedModel.fst
SealedModel.sealed_singl
val sealed_singl (#a:Type) (x y : sealed a) : Lemma (x == y)
val sealed_singl (#a:Type) (x y : sealed a) : Lemma (x == y)
let sealed_singl (#a:Type) (x y : sealed a) : Lemma (x == y) = let Seal f = x in let Seal g = y in unobs_axiom f g
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 17, "end_line": 40, "start_col": 0, "start_line": 37 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: SealedModel.sealed a -> y: SealedModel.sealed a -> FStar.Pervasives.Lemma (ensures x == y)
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "SealedModel.sealed", "Prims.unit", "SealedModel.unobs_axiom", "Prims.l_True", "Prims.squash", "Prims.eq2", "Prims.Nil", "FStar.Pervasives.pattern" ]
[]
false
false
true
false
false
let sealed_singl (#a: Type) (x y: sealed a) : Lemma (x == y) =
let Seal f = x in let Seal g = y in unobs_axiom f g
false
SealedModel.fst
SealedModel.prec_no_x
val prec_no_x: x: t -> squash (x << seal x) -> Lemma (x == Y)
val prec_no_x: x: t -> squash (x << seal x) -> Lemma (x == Y)
let prec_no_x (x : t) (_ : squash (x << seal x)) : Lemma (x == Y) = if X? x then ( let X s = x in assert (s << x); sealed_singl s (seal x); (* At this point we have s << x << seal x, but s == seal x, so s << s *) assert False )
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 89, "start_col": 0, "start_line": 82 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: SealedModel.t -> _: Prims.squash (x << SealedModel.seal x) -> FStar.Pervasives.Lemma (ensures x == SealedModel.Y)
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "SealedModel.t", "Prims.squash", "Prims.precedes", "SealedModel.sealed", "SealedModel.seal", "SealedModel.uu___is_X", "Prims._assert", "Prims.l_False", "Prims.unit", "SealedModel.sealed_singl", "Prims.bool", "Prims.l_True", "Prims.eq2", "SealedModel.Y", "Prims.Nil", "FStar.Pervasives.p...
[]
false
false
true
false
false
let prec_no_x (x: t) (_: squash (x << seal x)) : Lemma (x == Y) =
if X? x then (let X s = x in assert (s << x); sealed_singl s (seal x); assert False)
false
SealedModel.fst
SealedModel.unseal
val unseal (#a : Type u#aa) (s : sealed a) : TacS a
val unseal (#a : Type u#aa) (s : sealed a) : TacS a
let unseal (#a : Type u#aa) (s : sealed a) : TacS a = let Seal f = s in f ()
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 6, "end_line": 47, "start_col": 0, "start_line": 45 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
s: SealedModel.sealed a -> FStar.Tactics.Effect.TacS a
FStar.Tactics.Effect.TacS
[]
[]
[ "SealedModel.sealed", "Prims.unit" ]
[]
false
true
false
false
false
let unseal (#a: Type u#aa) (s: sealed a) : TacS a =
let Seal f = s in f ()
false
SealedModel.fst
SealedModel.contra_map_seal_precedes
val contra_map_seal_precedes (map_seal: (#a: Type0 -> #b: Type0 -> s: sealed a -> (f: (x: a{x << s}) -> TacS b) -> Tot (sealed b)) ) : sealed int
val contra_map_seal_precedes (map_seal: (#a: Type0 -> #b: Type0 -> s: sealed a -> (f: (x: a{x << s}) -> TacS b) -> Tot (sealed b)) ) : sealed int
let contra_map_seal_precedes (map_seal : ( (#a : Type0) -> (#b : Type0) -> (s : sealed a) -> (f : (x:a{x << s}) -> TacS b) -> Tot (sealed b))) : sealed int = let s : sealed t = seal (X (seal Y)) in let f (x:t{x << s}) : TacS int = match x with | X s' -> ...
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 14, "end_line": 124, "start_col": 0, "start_line": 106 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
map_seal: (s: SealedModel.sealed a -> _: (f: x: a{x << s} -> FStar.Tactics.Effect.TacS b) -> SealedModel.sealed b) -> SealedModel.sealed Prims.int
Prims.Tot
[ "total" ]
[]
[ "SealedModel.sealed", "Prims.precedes", "SealedModel.t", "Prims.int", "FStar.Pervasives.false_elim", "Prims.unit", "SealedModel.prec_no_x", "SealedModel.sealed_singl", "SealedModel.seal", "SealedModel.X", "SealedModel.Y" ]
[]
false
false
false
false
false
let contra_map_seal_precedes (map_seal: (#a: Type0 -> #b: Type0 -> s: sealed a -> (f: (x: a{x << s}) -> TacS b) -> Tot (sealed b)) ) : sealed int =
let s:sealed t = seal (X (seal Y)) in let f (x: t{x << s}) : TacS int = match x with | X s' -> sealed_singl s (seal x); prec_no_x x (); false_elim () | Y -> 123 in map_seal s f
false
Huffman.fst
Huffman.cancelation_one
val cancelation_one (t' t: trie) (s: symbol) : Lemma (requires (b2t (Node? t'))) (ensures (Node? t' ==> (match encode_one t s with | Some e -> (match decode_aux t' t e with | Some d -> d = [s] | None -> False) | None -> Tr...
val cancelation_one (t' t: trie) (s: symbol) : Lemma (requires (b2t (Node? t'))) (ensures (Node? t' ==> (match encode_one t s with | Some e -> (match decode_aux t' t e with | Some d -> d = [s] | None -> False) | None -> Tr...
let rec cancelation_one (t':trie) (t:trie) (s:symbol) : Lemma (requires (b2t (Node? t'))) (ensures (Node? t' ==> (match encode_one t s with | Some e -> (match decode_aux t' t e with | Some d -> d = [s] | None -> False) | None -> Tru...
{ "file_name": "examples/algorithms/Huffman.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 42, "end_line": 184, "start_col": 0, "start_line": 171 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Char.fsti.checked" ], "interface_file": false, "source_file": "Huffman.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Char", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t': Huffman.trie -> t: Huffman.trie -> s: Huffman.symbol -> FStar.Pervasives.Lemma (requires Node? t') (ensures Node? t' ==> (match Huffman.encode_one t s with | FStar.Pervasives.Native.Some #_ e -> (match Huffman.decode_aux t' t e with | FStar.Pervasives.Nati...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "Huffman.trie", "Huffman.symbol", "Prims.pos", "Huffman.encode_one", "Prims.list", "Prims.bool", "Huffman.cancelation_one", "Prims.unit", "Prims.b2t", "Huffman.uu___is_Node", "Prims.squash", "Prims.l_imp", "Huffman.decode_aux", "Prims.op_Equality", "Prims.Cons", "Prims.Nil", "Prims.l...
[ "recursion" ]
false
false
true
false
false
let rec cancelation_one (t' t: trie) (s: symbol) : Lemma (requires (b2t (Node? t'))) (ensures (Node? t' ==> (match encode_one t s with | Some e -> (match decode_aux t' t e with | Some d -> d = [s] | None -> False) | None -...
match t with | Leaf _ s' -> () | Node _ t1 t2 -> (match encode_one t1 s with | Some e -> cancelation_one t' t1 s | None -> cancelation_one t' t2 s)
false
Hacl.Spec.K256.MathLemmas.fst
Hacl.Spec.K256.MathLemmas.lemma_as_nat_horner
val lemma_as_nat_horner (r0 r1 r2 r3 r4:int) : Lemma (r0 + r1 * pow2 52 + r2 * pow2 104 + r3 * pow2 156 + r4 * pow2 208 == (((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 52 + r1) * pow2 52 + r0)
val lemma_as_nat_horner (r0 r1 r2 r3 r4:int) : Lemma (r0 + r1 * pow2 52 + r2 * pow2 104 + r3 * pow2 156 + r4 * pow2 208 == (((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 52 + r1) * pow2 52 + r0)
let lemma_as_nat_horner r0 r1 r2 r3 r4 = calc (==) { (((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 52 + r1) * pow2 52 + r0; (==) { lemma_distr_pow r1 ((r4 * pow2 52 + r3) * pow2 52 + r2) 52 52 } ((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 104 + r1 * pow2 52 + r0; (==) { lemma_distr_pow r2 (r4 * pow2 52...
{ "file_name": "code/k256/Hacl.Spec.K256.MathLemmas.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 3, "end_line": 166, "start_col": 0, "start_line": 157 }
module Hacl.Spec.K256.MathLemmas open FStar.Mul #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" val lemma_swap_mul3 (a b c:int) : Lemma (a * b * c == a * c * b) let lemma_swap_mul3 a b c = calc (==) { a * b * c; (==) { Math.Lemmas.paren_mul_right a b c } a * (b * c); (==) { Math.Lemmas.swap_mul b c...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "Hacl.Spec.K256.MathLemmas.fst" }
[ { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "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
r0: Prims.int -> r1: Prims.int -> r2: Prims.int -> r3: Prims.int -> r4: Prims.int -> FStar.Pervasives.Lemma (ensures r0 + r1 * Prims.pow2 52 + r2 * Prims.pow2 104 + r3 * Prims.pow2 156 + r4 * Prims.pow2 208 == (((r4 * Prims.pow2 52 + r3) * Prims.pow2 52 + r2) * Prims.pow2 52 + r1) * Prims.pow2 52 + r0...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.int", "FStar.Calc.calc_finish", "Prims.eq2", "Prims.op_Addition", "FStar.Mul.op_Star", "Prims.pow2", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Hacl.Spec.K256.MathLemmas.lemma_distr_pow...
[]
false
false
true
false
false
let lemma_as_nat_horner r0 r1 r2 r3 r4 =
calc ( == ) { (((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 52 + r1) * pow2 52 + r0; ( == ) { lemma_distr_pow r1 ((r4 * pow2 52 + r3) * pow2 52 + r2) 52 52 } ((r4 * pow2 52 + r3) * pow2 52 + r2) * pow2 104 + r1 * pow2 52 + r0; ( == ) { lemma_distr_pow r2 (r4 * pow2 52 + r3) 52 104 } (r4 * pow2 52 + r3) * pow2 ...
false
Huffman.fst
Huffman.cancelation_aux
val cancelation_aux (t: trie{Node? t}) (ss: list symbol) : Lemma (requires (True)) (ensures (match encode t ss with | Some e -> (match decode t e with | Some d -> d = ss | None -> False) | None -> True)) (decreases ss)
val cancelation_aux (t: trie{Node? t}) (ss: list symbol) : Lemma (requires (True)) (ensures (match encode t ss with | Some e -> (match decode t e with | Some d -> d = ss | None -> False) | None -> True)) (decreases ss)
let rec cancelation_aux (t:trie{Node? t}) (ss:list symbol) : Lemma (requires (True)) (ensures (match encode t ss with | Some e -> (match decode t e with | Some d -> d = ss | None -> False) | None -> True)) (decreases ss) = match ss with | [...
{ "file_name": "examples/algorithms/Huffman.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 17, "end_line": 223, "start_col": 0, "start_line": 208 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Char.fsti.checked" ], "interface_file": false, "source_file": "Huffman.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Char", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t: Huffman.trie{Node? t} -> ss: Prims.list Huffman.symbol -> FStar.Pervasives.Lemma (ensures ((match Huffman.encode t ss with | FStar.Pervasives.Native.Some #_ e -> (match Huffman.decode t e with | FStar.Pervasives.Native.Some #_ d -> d = ss | FS...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "Huffman.trie", "Prims.b2t", "Huffman.uu___is_Node", "Prims.list", "Huffman.symbol", "Huffman.cancelation_one", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.option", "Prims.bool", "Huffman.encode_one", "Huffman.encode", "Huffman.decode_prefix", "Prims.unit", "Huffman.cancel...
[ "recursion" ]
false
false
true
false
false
let rec cancelation_aux (t: trie{Node? t}) (ss: list symbol) : Lemma (requires (True)) (ensures (match encode t ss with | Some e -> (match decode t e with | Some d -> d = ss | None -> False) | None -> True)) (decreases ss) =
match ss with | [] -> () | [s] -> cancelation_one t t s | s :: ss' -> cancelation_one t t s; cancelation_aux t ss'; (match encode_one t s, encode t ss' with | Some bs, Some bs' -> decode_prefix t bs bs' s | _, _ -> ())
false
StatefulLens.fst
StatefulLens.v
val v : StatefulLens.stlens StatefulLens.hlens_ref
let v #a = stlens_ref #a
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 24, "end_line": 141, "start_col": 0, "start_line": 141 }
(* 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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
StatefulLens.stlens StatefulLens.hlens_ref
Prims.Tot
[ "total" ]
[]
[ "StatefulLens.stlens_ref", "StatefulLens.stlens", "FStar.ST.ref", "StatefulLens.hlens_ref" ]
[]
false
false
false
true
false
let v #a =
stlens_ref #a
false
Huffman.fst
Huffman.cancelation
val cancelation (sws: list (symbol * pos)) (ss: list symbol) : Lemma (requires (b2t (List.Tot.length sws > 1))) (ensures (List.Tot.length sws > 1 ==> (let t = huffman sws in (match encode t ss with | Some e -> (match decode t e with ...
val cancelation (sws: list (symbol * pos)) (ss: list symbol) : Lemma (requires (b2t (List.Tot.length sws > 1))) (ensures (List.Tot.length sws > 1 ==> (let t = huffman sws in (match encode t ss with | Some e -> (match decode t e with ...
let rec cancelation (sws:list (symbol*pos)) (ss:list symbol) : Lemma (requires (b2t (List.Tot.length sws > 1))) (ensures (List.Tot.length sws > 1 ==> (let t = huffman sws in (match encode t ss with | Some e -> (match decode t e with | Some d -> d = ss ...
{ "file_name": "examples/algorithms/Huffman.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 34, "end_line": 234, "start_col": 0, "start_line": 225 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Char.fsti.checked" ], "interface_file": false, "source_file": "Huffman.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Char", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
sws: Prims.list (Huffman.symbol * Prims.pos) -> ss: Prims.list Huffman.symbol -> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.length sws > 1) (ensures FStar.List.Tot.Base.length sws > 1 ==> (let t = Huffman.huffman sws in (match Huffman.encode t ss with | FStar.Perv...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.list", "FStar.Pervasives.Native.tuple2", "Huffman.symbol", "Prims.pos", "Huffman.cancelation_aux", "Huffman.huffman", "Prims.unit", "Prims.b2t", "Prims.op_GreaterThan", "FStar.List.Tot.Base.length", "Prims.squash", "Prims.l_imp", "Huffman.encode", "Prims.bool", "Huffman.decode", ...
[ "recursion" ]
false
false
true
false
false
let rec cancelation (sws: list (symbol * pos)) (ss: list symbol) : Lemma (requires (b2t (List.Tot.length sws > 1))) (ensures (List.Tot.length sws > 1 ==> (let t = huffman sws in (match encode t ss with | Some e -> (match decode t e with ...
cancelation_aux (huffman sws) ss
false
Huffman.fst
Huffman.decode_prefix
val decode_prefix (t: trie{Node? t}) (bs: list bool) (bs': list bool {Cons? bs'}) (s: symbol) : Lemma (requires (decode t bs = Some [s])) (ensures (decode t (bs @ bs') = (match decode t bs' with | Some ss -> Some (s :: ss) | None -> None)))
val decode_prefix (t: trie{Node? t}) (bs: list bool) (bs': list bool {Cons? bs'}) (s: symbol) : Lemma (requires (decode t bs = Some [s])) (ensures (decode t (bs @ bs') = (match decode t bs' with | Some ss -> Some (s :: ss) | None -> None)))
let rec decode_prefix (t:trie{Node? t}) (bs:list bool) (bs':list bool{Cons? bs'}) (s:symbol) : Lemma (requires (decode t bs = Some [s])) (ensures (decode t (bs @ bs') = (match decode t bs' with | Some ss -> Some (s :: ss) | None -> None))) = ...
{ "file_name": "examples/algorithms/Huffman.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 32, "end_line": 206, "start_col": 0, "start_line": 200 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Char.fsti.checked" ], "interface_file": false, "source_file": "Huffman.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Char", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t: Huffman.trie{Node? t} -> bs: Prims.list Prims.bool -> bs': Prims.list Prims.bool {Cons? bs'} -> s: Huffman.symbol -> FStar.Pervasives.Lemma (requires Huffman.decode t bs = FStar.Pervasives.Native.Some [s]) (ensures Huffman.decode t (bs @ bs') = (match Huffman.decode t bs' wit...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Huffman.trie", "Prims.b2t", "Huffman.uu___is_Node", "Prims.list", "Prims.bool", "Prims.uu___is_Cons", "Huffman.symbol", "Huffman.decode_prefix_aux", "Prims.unit", "Prims.op_Equality", "FStar.Pervasives.Native.option", "Huffman.decode", "FStar.Pervasives.Native.Some", "Prims.Cons", "Prim...
[ "recursion" ]
false
false
true
false
false
let rec decode_prefix (t: trie{Node? t}) (bs: list bool) (bs': list bool {Cons? bs'}) (s: symbol) : Lemma (requires (decode t bs = Some [s])) (ensures (decode t (bs @ bs') = (match decode t bs' with | Some ss -> Some (s :: ss) | None -> None))) =
decode_prefix_aux t t bs bs' s
false
StatefulLens.fst
StatefulLens.deref
val deref : StatefulLens.stlens StatefulLens.hlens_ref
let deref = v
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 13, "end_line": 142, "start_col": 0, "start_line": 142 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
StatefulLens.stlens StatefulLens.hlens_ref
Prims.Tot
[ "total" ]
[]
[ "StatefulLens.v", "StatefulLens.stlens", "FStar.ST.ref", "StatefulLens.hlens_ref" ]
[]
false
false
false
true
false
let deref =
v
false
StatefulLens.fst
StatefulLens.compose_stlens
val compose_stlens (#a #b #c: _) (#l: hlens a b) (#m: hlens b c) (sl: stlens l) (sm: stlens m) : stlens (compose_hlens l m)
val compose_stlens (#a #b #c: _) (#l: hlens a b) (#m: hlens b c) (sl: stlens l) (sm: stlens m) : stlens (compose_hlens l m)
let compose_stlens #a #b #c (#l:hlens a b) (#m:hlens b c) (sl:stlens l) (sm:stlens m) : stlens (compose_hlens l m) = { st_get = (fun (x:a) -> sm.st_get (sl.st_get x)); st_put = (fun (z:c) (x:a) -> sl.st_put (sm.st_put z (sl.st_get x)) x) }
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 1, "end_line": 74, "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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
sl: StatefulLens.stlens l -> sm: StatefulLens.stlens m -> StatefulLens.stlens (StatefulLens.compose_hlens l m)
Prims.Tot
[ "total" ]
[]
[ "StatefulLens.hlens", "StatefulLens.stlens", "StatefulLens.Mkstlens", "StatefulLens.compose_hlens", "StatefulLens.__proj__Mkstlens__item__st_get", "StatefulLens.__proj__Mkstlens__item__st_put" ]
[]
false
false
false
false
false
let compose_stlens #a #b #c (#l: hlens a b) (#m: hlens b c) (sl: stlens l) (sm: stlens m) : stlens (compose_hlens l m) =
{ st_get = (fun (x: a) -> sm.st_get (sl.st_get x)); st_put = (fun (z: c) (x: a) -> sl.st_put (sm.st_put z (sl.st_get x)) x) }
false
SealedModel.fst
SealedModel.map_seal
val map_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS b) : Tot (sealed b)
val map_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS b) : Tot (sealed b)
let map_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS b) : Tot (sealed b) = Seal (fun () -> f (unseal s))
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 31, "end_line": 58, "start_col": 0, "start_line": 52 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
b: Type -> s: SealedModel.sealed a -> f: (_: a -> FStar.Tactics.Effect.TacS b) -> SealedModel.sealed b
Prims.Tot
[ "total" ]
[]
[ "SealedModel.sealed", "SealedModel.Seal", "Prims.unit", "SealedModel.unseal" ]
[]
false
false
false
false
false
let map_seal (#a: Type u#aa) (b: Type u#bb) (s: sealed a) (f: (a -> TacS b)) : Tot (sealed b) =
Seal (fun () -> f (unseal s))
false
StatefulLens.fst
StatefulLens.test3
val test3 : c: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST Prims.int
let test3 (c:ref (ref int)) = c.[v |.. v]
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 41, "end_line": 145, "start_col": 0, "start_line": 145 }
(* 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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST Prims.int
FStar.ST.ST
[]
[]
[ "FStar.ST.ref", "Prims.int", "StatefulLens.op_String_Access", "StatefulLens.compose_hlens", "StatefulLens.hlens_ref", "StatefulLens.op_Bar_Dot_Dot", "StatefulLens.v" ]
[]
false
true
false
false
false
let test3 (c: ref (ref int)) =
c.[ v |.. v ]
false
Huffman.fst
Huffman.decode_prefix_aux
val decode_prefix_aux (t': trie{Node? t'}) (t: trie) (bs bs': list bool) (s: symbol) : Lemma (requires (decode_aux t' t bs = Some [s])) (ensures (Cons? bs' ==> decode_aux t' t (bs @ bs') = (match decode_aux t' t' bs' with | Some ss -> Some (s :: ss) | None -...
val decode_prefix_aux (t': trie{Node? t'}) (t: trie) (bs bs': list bool) (s: symbol) : Lemma (requires (decode_aux t' t bs = Some [s])) (ensures (Cons? bs' ==> decode_aux t' t (bs @ bs') = (match decode_aux t' t' bs' with | Some ss -> Some (s :: ss) | None -...
let rec decode_prefix_aux (t':trie{Node? t'}) (t:trie) (bs:list bool) (bs':list bool) (s:symbol) : Lemma (requires (decode_aux t' t bs = Some [s])) (ensures (Cons? bs' ==> decode_aux t' t (bs @ bs') = (match decode_aux t' t' bs' with ...
{ "file_name": "examples/algorithms/Huffman.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 60, "end_line": 198, "start_col": 0, "start_line": 186 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Char.fsti.checked" ], "interface_file": false, "source_file": "Huffman.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Char", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t': Huffman.trie{Node? t'} -> t: Huffman.trie -> bs: Prims.list Prims.bool -> bs': Prims.list Prims.bool -> s: Huffman.symbol -> FStar.Pervasives.Lemma (requires Huffman.decode_aux t' t bs = FStar.Pervasives.Native.Some [s]) (ensures Cons? bs' ==> Huffman.decode_aux t' t (bs...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "Huffman.trie", "Prims.b2t", "Huffman.uu___is_Node", "Prims.list", "Prims.bool", "Huffman.symbol", "FStar.Pervasives.Native.Mktuple2", "Prims.pos", "Huffman.decode_prefix_aux", "Prims.unit", "Prims.op_Equality", "FStar.Pervasives.Native.option", "Huffman.decode_aux", "FStar.Pervasives.Nati...
[ "recursion" ]
false
false
true
false
false
let rec decode_prefix_aux (t': trie{Node? t'}) (t: trie) (bs bs': list bool) (s: symbol) : Lemma (requires (decode_aux t' t bs = Some [s])) (ensures (Cons? bs' ==> decode_aux t' t (bs @ bs') = (match decode_aux t' t' bs' with | Some ss -> Some (s :: ss) | No...
match t, bs with | Leaf _ _, [] -> () | Leaf _ _, _ :: _ -> decode_prefix_aux t' t' bs bs' s | Node _ t1 t2, b :: bs'' -> decode_prefix_aux t' (if b then t2 else t1) bs'' bs' s
false
StatefulLens.fst
StatefulLens.as_stlens
val as_stlens (l: lens 'a 'b) : stlens (as_hlens l)
val as_stlens (l: lens 'a 'b) : stlens (as_hlens l)
let as_stlens (l:lens 'a 'b) : stlens (as_hlens l) = { st_get = (fun (x:'a) -> x.[l]); st_put = (fun (y:'b) (x:'a) -> x.[l] <- y) }
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 1, "end_line": 82, "start_col": 0, "start_line": 79 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: Lens.lens 'a 'b -> StatefulLens.stlens (StatefulLens.as_hlens l)
Prims.Tot
[ "total" ]
[]
[ "Lens.lens", "StatefulLens.Mkstlens", "StatefulLens.as_hlens", "Lens.op_String_Access", "Lens.op_String_Assignment", "StatefulLens.stlens" ]
[]
false
false
false
false
false
let as_stlens (l: lens 'a 'b) : stlens (as_hlens l) =
{ st_get = (fun (x: 'a) -> x.[ l ]); st_put = (fun (y: 'b) (x: 'a) -> x.[ l ] <- y) }
false
StatefulLens.fst
StatefulLens.center
val center:lens circle (ref point)
val center:lens circle (ref point)
let center : lens circle (ref point) = { Lens.get = (fun c -> c.center); Lens.put = (fun p c -> {c with center = p}) }
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 1, "end_line": 176, "start_col": 0, "start_line": 173 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Lens.lens StatefulLens.circle (FStar.ST.ref StatefulLens.point)
Prims.Tot
[ "total" ]
[]
[ "Lens.Mklens", "StatefulLens.circle", "FStar.ST.ref", "StatefulLens.point", "StatefulLens.__proj__Mkcircle__item__center", "StatefulLens.Mkcircle", "StatefulLens.__proj__Mkcircle__item__radius" ]
[]
false
false
false
true
false
let center:lens circle (ref point) =
{ Lens.get = (fun c -> c.center); Lens.put = (fun p c -> { c with center = p }) }
false
StatefulLens.fst
StatefulLens.x
val x:lens point (ref int)
val x:lens point (ref int)
let x : lens point (ref int) = { Lens.get = (fun p -> p.x); Lens.put = (fun x p -> {p with x = x}) }
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 1, "end_line": 180, "start_col": 0, "start_line": 177 }
(* 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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Lens.lens StatefulLens.point (FStar.ST.ref Prims.int)
Prims.Tot
[ "total" ]
[]
[ "Lens.Mklens", "StatefulLens.point", "FStar.ST.ref", "Prims.int", "StatefulLens.__proj__Mkpoint__item__x", "StatefulLens.Mkpoint", "StatefulLens.__proj__Mkpoint__item__y" ]
[]
false
false
false
true
false
let x:lens point (ref int) =
{ Lens.get = (fun p -> p.x); Lens.put = (fun x p -> { p with x = x }) }
false
SealedModel.fst
SealedModel.bind_seal
val bind_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS (sealed b)) : Tot (sealed b)
val bind_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS (sealed b)) : Tot (sealed b)
let bind_seal (#a : Type u#aa) (b : Type u#bb) (s : sealed a) (f : a -> TacS (sealed b)) : Tot (sealed b) = Seal (fun () -> unseal (f (unseal s)))
{ "file_name": "examples/tactics/SealedModel.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 40, "end_line": 66, "start_col": 0, "start_line": 60 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "prims.fst.checked", "FStar.Tactics.Effect.fsti.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "SealedModel.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Tactics.Effect", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
b: Type -> s: SealedModel.sealed a -> f: (_: a -> FStar.Tactics.Effect.TacS (SealedModel.sealed b)) -> SealedModel.sealed b
Prims.Tot
[ "total" ]
[]
[ "SealedModel.sealed", "SealedModel.Seal", "Prims.unit", "SealedModel.unseal" ]
[]
false
false
false
false
false
let bind_seal (#a: Type u#aa) (b: Type u#bb) (s: sealed a) (f: (a -> TacS (sealed b))) : Tot (sealed b) =
Seal (fun () -> unseal (f (unseal s)))
false
StatefulLens.fst
StatefulLens.test5
val test5 : c: FStar.ST.ref (Lens.colored (FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle)))) -> FStar.ST.STATE Prims.unit
let test5 (c:ref (colored (ref (colored (ref circle))))) = c.[v |... payload |.. v |... payload |.. v |... center |... x] <- 17
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 72, "end_line": 156, "start_col": 0, "start_line": 155 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (Lens.colored (FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle)))) -> FStar.ST.STATE Prims.unit
FStar.ST.STATE
[ "trivial_postcondition" ]
[]
[ "FStar.ST.ref", "Lens.colored", "Lens.circle", "StatefulLens.op_String_Assignment", "Prims.int", "StatefulLens.compose_hlens", "Lens.point", "StatefulLens.hlens_ref", "StatefulLens.as_hlens", "Lens.payload", "Lens.center", "Lens.x", "StatefulLens.op_Bar_Dot_Dot_Dot", "StatefulLens.op_Bar_D...
[]
false
true
false
false
false
let test5 (c: ref (colored (ref (colored (ref circle))))) =
c.[ v |... payload |.. v |... payload |.. v |... center |... x ] <- 17
false
StatefulLens.fst
StatefulLens.test0
val test0 (c: ref (ref int)) : ST int (requires (fun h -> True)) (ensures (fun h0 i h1 -> h0 == h1 /\ i == sel h1 (sel h1 c)))
val test0 (c: ref (ref int)) : ST int (requires (fun h -> True)) (ensures (fun h0 i h1 -> h0 == h1 /\ i == sel h1 (sel h1 c)))
let test0 (c:ref (ref int)) : ST int (requires (fun h -> True)) (ensures (fun h0 i h1 -> h0 == h1 /\ i == sel h1 (sel h1 c))) = (compose_stlens stlens_ref stlens_ref).st_get c
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 51, "end_line": 105, "start_col": 0, "start_line": 102 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST Prims.int
FStar.ST.ST
[]
[]
[ "FStar.ST.ref", "Prims.int", "StatefulLens.__proj__Mkstlens__item__st_get", "StatefulLens.compose_hlens", "StatefulLens.hlens_ref", "StatefulLens.compose_stlens", "StatefulLens.stlens_ref", "FStar.Monotonic.Heap.heap", "Prims.l_True", "Prims.l_and", "Prims.eq2", "FStar.Ref.sel" ]
[]
false
true
false
false
false
let test0 (c: ref (ref int)) : ST int (requires (fun h -> True)) (ensures (fun h0 i h1 -> h0 == h1 /\ i == sel h1 (sel h1 c))) =
(compose_stlens stlens_ref stlens_ref).st_get c
false
Hacl.Spec.K256.MathLemmas.fst
Hacl.Spec.K256.MathLemmas.lemma_distr5_pow52_mul_pow
val lemma_distr5_pow52_mul_pow (a b0 b1 b2 b3 b4: int) (p:nat) : Lemma (a * pow2 p * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) = a * b0 * pow2 p + a * b1 * pow2 (52 + p) + a * b2 * pow2 (104 + p) + a * b3 * pow2 (156 + p) + a * b4 * pow2 (208 + p))
val lemma_distr5_pow52_mul_pow (a b0 b1 b2 b3 b4: int) (p:nat) : Lemma (a * pow2 p * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) = a * b0 * pow2 p + a * b1 * pow2 (52 + p) + a * b2 * pow2 (104 + p) + a * b3 * pow2 (156 + p) + a * b4 * pow2 (208 + p))
let lemma_distr5_pow52_mul_pow a b0 b1 b2 b3 b4 p = let b_sum = b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208 in calc (==) { a * pow2 p * b_sum; (==) { lemma_swap_mul3 a (pow2 p) b_sum } a * b_sum * pow2 p; (==) { lemma_distr5_pow52 a b0 b1 b2 b3 b4 } (a * b0 + a * b1 * pow2 ...
{ "file_name": "code/k256/Hacl.Spec.K256.MathLemmas.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 3, "end_line": 223, "start_col": 0, "start_line": 207 }
module Hacl.Spec.K256.MathLemmas open FStar.Mul #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" val lemma_swap_mul3 (a b c:int) : Lemma (a * b * c == a * c * b) let lemma_swap_mul3 a b c = calc (==) { a * b * c; (==) { Math.Lemmas.paren_mul_right a b c } a * (b * c); (==) { Math.Lemmas.swap_mul b c...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "Hacl.Spec.K256.MathLemmas.fst" }
[ { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "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: Prims.int -> b0: Prims.int -> b1: Prims.int -> b2: Prims.int -> b3: Prims.int -> b4: Prims.int -> p: Prims.nat -> FStar.Pervasives.Lemma (ensures (a * Prims.pow2 p) * (b0 + b1 * Prims.pow2 52 + b2 * Prims.pow2 104 + b3 * Prims.pow2 156 + b4 * Prims.pow2 208) = (a ...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.int", "Prims.nat", "FStar.Calc.calc_finish", "Prims.eq2", "FStar.Mul.op_Star", "Prims.pow2", "Prims.op_Addition", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Hacl.Spec.K256.MathLemmas....
[]
false
false
true
false
false
let lemma_distr5_pow52_mul_pow a b0 b1 b2 b3 b4 p =
let b_sum = b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208 in calc ( == ) { (a * pow2 p) * b_sum; ( == ) { lemma_swap_mul3 a (pow2 p) b_sum } (a * b_sum) * pow2 p; ( == ) { lemma_distr5_pow52 a b0 b1 b2 b3 b4 } (a * b0 + (a * b1) * pow2 52 + (a * b2) * pow2 104 + (a * b3) * pow2 156 + (a * ...
false
StatefulLens.fst
StatefulLens.test1
val test1 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ (h1, d) == (compose_hlens hlens_ref hlens_ref).put 0 (h0, c) /\ h1 == upd (upd h0 (sel h0 c) 0) c (sel h0 c) /\ sel h0 c == sel h1 c /...
val test1 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ (h1, d) == (compose_hlens hlens_ref hlens_ref).put 0 (h0, c) /\ h1 == upd (upd h0 (sel h0 c) 0) c (sel h0 c) /\ sel h0 c == sel h1 c /...
let test1 (c:ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ (h1, d) == (compose_hlens hlens_ref hlens_ref).put 0 (h0, c) /\ h1 == upd (upd h0 (sel h0 c) 0) c...
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 54, "end_line": 116, "start_col": 0, "start_line": 109 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST (FStar.ST.ref (FStar.ST.ref Prims.int))
FStar.ST.ST
[]
[]
[ "FStar.ST.ref", "Prims.int", "StatefulLens.__proj__Mkstlens__item__st_put", "StatefulLens.compose_hlens", "StatefulLens.hlens_ref", "StatefulLens.compose_stlens", "StatefulLens.stlens_ref", "FStar.Monotonic.Heap.heap", "Prims.b2t", "Prims.op_disEquality", "Prims.nat", "FStar.Ref.addr_of", "F...
[]
false
true
false
false
false
let test1 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ (h1, d) == (compose_hlens hlens_ref hlens_ref).put 0 (h0, c) /\ h1 == upd (upd h0 (sel h0 c) 0) c (sel h0 c) /\ sel h0 c == sel h1 c /...
(compose_stlens stlens_ref stlens_ref).st_put 0 c
false
StatefulLens.fst
StatefulLens.test4
val test4 (c: ref (ref int)) : ST unit (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> sel h1 (sel h1 c) = sel h0 (sel h0 c)))
val test4 (c: ref (ref int)) : ST unit (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> sel h1 (sel h1 c) = sel h0 (sel h0 c)))
let test4 (c:ref (ref int)) : ST unit (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> sel h1 (sel h1 c) = sel h0 (sel h0 c))) = c.[v |.. v] <- c.[v |.. v]
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 31, "end_line": 151, "start_col": 0, "start_line": 148 }
(* 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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST Prims.unit
FStar.ST.ST
[]
[]
[ "FStar.ST.ref", "Prims.int", "StatefulLens.op_String_Assignment", "StatefulLens.compose_hlens", "StatefulLens.hlens_ref", "StatefulLens.op_Bar_Dot_Dot", "StatefulLens.v", "Prims.unit", "StatefulLens.op_String_Access", "FStar.Monotonic.Heap.heap", "Prims.b2t", "Prims.op_disEquality", "Prims.n...
[]
false
true
false
false
false
let test4 (c: ref (ref int)) : ST unit (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> sel h1 (sel h1 c) = sel h0 (sel h0 c))) =
c.[ v |.. v ] <- c.[ v |.. v ]
false
StatefulLens.fst
StatefulLens.test2
val test2 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ sel h1 (sel h1 c) = sel h0 (sel h0 c)))
val test2 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ sel h1 (sel h1 c) = sel h0 (sel h0 c)))
let test2 (c:ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ sel h1 (sel h1 c) = sel h0 (sel h0 c))) = let i = (compose_stlens stlens_ref stlens_ref).st_get c in (compose_stlens stlens_ref stlens_ref).st_put i c
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 54, "end_line": 124, "start_col": 0, "start_line": 120 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: FStar.ST.ref (FStar.ST.ref Prims.int) -> FStar.ST.ST (FStar.ST.ref (FStar.ST.ref Prims.int))
FStar.ST.ST
[]
[]
[ "FStar.ST.ref", "Prims.int", "StatefulLens.__proj__Mkstlens__item__st_put", "StatefulLens.compose_hlens", "StatefulLens.hlens_ref", "StatefulLens.compose_stlens", "StatefulLens.stlens_ref", "StatefulLens.__proj__Mkstlens__item__st_get", "FStar.Monotonic.Heap.heap", "Prims.b2t", "Prims.op_disEqua...
[]
false
true
false
false
false
let test2 (c: ref (ref int)) : ST (ref (ref int)) (requires (fun h -> addr_of (sel h c) <> addr_of c)) (ensures (fun h0 d h1 -> c == d /\ sel h1 (sel h1 c) = sel h0 (sel h0 c))) =
let i = (compose_stlens stlens_ref stlens_ref).st_get c in (compose_stlens stlens_ref stlens_ref).st_put i c
false
StatefulLens.fst
StatefulLens.move_x2
val move_x2 (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h' -> let rp = c.center in let p = sel h0 rp in let rx = p.x in let h1 = upd h0 rx (sel h0 rx + delta) in let p = sel h1 rp in let ...
val move_x2 (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h' -> let rp = c.center in let p = sel h0 rp in let rx = p.x in let h1 = upd h0 rx (sel h0 rx + delta) in let p = sel h1 rp in let ...
let move_x2 (delta:int) (c:circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h' -> let rp = c.center in let p = sel h0 rp in let rx = p.x in let h1 = upd h0 rx (sel h0 rx + delta) in let p = sel h1 rp in let h2 = upd h1 rp ...
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 75, "end_line": 208, "start_col": 0, "start_line": 198 }
(* 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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
delta: Prims.int -> c: StatefulLens.circle -> FStar.ST.ST Prims.unit
FStar.ST.ST
[]
[]
[ "Prims.int", "StatefulLens.circle", "StatefulLens.op_String_Assignment", "StatefulLens.compose_hlens", "FStar.ST.ref", "StatefulLens.point", "StatefulLens.as_hlens", "StatefulLens.center", "StatefulLens.hlens_ref", "StatefulLens.x", "StatefulLens.op_Bar_Dot_Dot", "StatefulLens.op_Bar_Dot_Hat",...
[]
false
true
false
false
false
let move_x2 (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h' -> let rp = c.center in let p = sel h0 rp in let rx = p.x in let h1 = upd h0 rx (sel h0 rx + delta) in let p = sel h1 rp in let ...
c.[ center |^. v |.^ x |.. v ] <- (c.[ center |^. v |.^ x |.. v ] + delta)
false
StatefulLens.fst
StatefulLens.move_x
val move_x (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h1 -> let l = center |^. v |.^ x |.. v in (h1, c) == (c.(h0, l) <- c.(h0, l) + delta)))
val move_x (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h1 -> let l = center |^. v |.^ x |.. v in (h1, c) == (c.(h0, l) <- c.(h0, l) + delta)))
let move_x (delta:int) (c:circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h1 -> let l = center |^. v |.^ x |.. v in (h1, c) == (c.(h0, l) <- c.(h0, l) + delta))) = c.[center |^. v |.^ x |.. v] <- c.[center |^. v |.^ x |.. v] + delta
{ "file_name": "examples/data_structures/StatefulLens.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 73, "end_line": 196, "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", "Lens.fst.checked", "FStar.Ref.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Heap.fst.checked" ], "interface_file": false, "source_file": "StatefulLens.fst" }
[ { "abbrev": false, "full_module": "Lens // Pure lenses", "short_module": null }, { "abbrev": false, "full_module": "FStar.Ref", "short_module": null }, { "abbrev": false, "full_module": "FStar.Heap", "short_module": null }, { "abbrev": false, "full_module": "L...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
delta: Prims.int -> c: StatefulLens.circle -> FStar.ST.ST Prims.unit
FStar.ST.ST
[]
[]
[ "Prims.int", "StatefulLens.circle", "StatefulLens.op_String_Assignment", "StatefulLens.compose_hlens", "FStar.ST.ref", "StatefulLens.point", "StatefulLens.as_hlens", "StatefulLens.center", "StatefulLens.hlens_ref", "StatefulLens.x", "StatefulLens.op_Bar_Dot_Dot", "StatefulLens.op_Bar_Dot_Hat",...
[]
false
true
false
false
false
let move_x (delta: int) (c: circle) : ST unit (requires (fun _ -> True)) (ensures (fun h0 _ h1 -> let l = center |^. v |.^ x |.. v in (h1, c) == (c.(h0, l) <- c.(h0, l) + delta))) =
c.[ center |^. v |.^ x |.. v ] <- c.[ center |^. v |.^ x |.. v ] + delta
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.commutative
val commutative : f: (_: a -> _: a -> a) -> Prims.logical
let commutative #a (f: a -> a -> a) = forall x y. f x y == f y x
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 28, "end_line": 42, "start_col": 0, "start_line": 41 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> _: a -> a) -> Prims.logical
Prims.Tot
[ "total" ]
[]
[ "Prims.l_Forall", "Prims.eq2", "Prims.logical" ]
[]
false
false
false
true
true
let commutative #a (f: (a -> a -> a)) =
forall x y. f x y == f y x
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.associative
val associative : f: (_: a -> _: a -> a) -> Prims.logical
let associative #a (f: a -> a -> a) = forall x y z. f x (f y z) == f (f x y) z
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 42, "end_line": 39, "start_col": 0, "start_line": 38 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> _: a -> a) -> Prims.logical
Prims.Tot
[ "total" ]
[]
[ "Prims.l_Forall", "Prims.eq2", "Prims.logical" ]
[]
false
false
false
true
true
let associative #a (f: (a -> a -> a)) =
forall x y z. f x (f y z) == f (f x y) z
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.is_unit
val is_unit : x: a -> f: (_: a -> _: a -> a) -> Prims.logical
let is_unit #a (x:a) (f:a -> a -> a) = forall y. f x y == y /\ f y x == y
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 36, "end_line": 45, "start_col": 0, "start_line": 44 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: a -> f: (_: a -> _: a -> a) -> Prims.logical
Prims.Tot
[ "total" ]
[]
[ "Prims.l_Forall", "Prims.l_and", "Prims.eq2", "Prims.logical" ]
[]
false
false
false
true
true
let is_unit #a (x: a) (f: (a -> a -> a)) =
forall y. f x y == y /\ f y x == y
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.post
val post : a: Type -> c: OPLSS2021.ParNDSDiv.comm_monoid s -> Type
let post #s a (c:comm_monoid s) = a -> c.r
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 42, "end_line": 63, "start_col": 0, "start_line": 63 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> c: OPLSS2021.ParNDSDiv.comm_monoid s -> Type
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r" ]
[]
false
false
false
true
true
let post #s a (c: comm_monoid s) =
a -> c.r
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.return
val return (#s: _) (#c: comm_monoid s) (#a: _) (x: a) (post: (a -> c.r)) : m a (post x) post
val return (#s: _) (#c: comm_monoid s) (#a: _) (x: a) (post: (a -> c.r)) : m a (post x) post
let return #s (#c:comm_monoid s) #a (x:a) (post:a -> c.r) : m a (post x) post = Ret x
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 9, "end_line": 202, "start_col": 0, "start_line": 200 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: a -> post: (_: a -> Mkcomm_monoid?.r c) -> OPLSS2021.ParNDSDiv.m a (post x) post
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.Ret", "OPLSS2021.ParNDSDiv.m" ]
[]
false
false
false
false
false
let return #s (#c: comm_monoid s) #a (x: a) (post: (a -> c.r)) : m a (post x) post =
Ret x
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.run
val run (#s #c: _) (i: nat) (#pre #a #post: _) (f: m a pre post) (state: s) : Div (a & s) (requires c.interp pre state) (ensures fun (x, state') -> c.interp (post x) state')
val run (#s #c: _) (i: nat) (#pre #a #post: _) (f: m a pre post) (state: s) : Div (a & s) (requires c.interp pre state) (ensures fun (x, state') -> c.interp (post x) state')
let rec run #s #c (i:nat) #pre #a #post (f:m a pre post) (state:s) : Div (a & s) (requires c.interp pre state) (ensures fun (x, state') -> c.interp (post x) state') = match f with | Ret x -> x, state | _ -> let Step pre' f' state' j = step i f c.emp state in run j f' state'
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 21, "end_line": 194, "start_col": 0, "start_line": 184 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Prims.nat -> f: OPLSS2021.ParNDSDiv.m a pre post -> state: s -> FStar.Pervasives.Div (a * s)
FStar.Pervasives.Div
[]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "Prims.nat", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.post", "OPLSS2021.ParNDSDiv.m", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.tuple2", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__interp", "OPLSS2021.ParND...
[ "recursion" ]
false
true
false
false
false
let rec run #s #c (i: nat) #pre #a #post (f: m a pre post) (state: s) : Div (a & s) (requires c.interp pre state) (ensures fun (x, state') -> c.interp (post x) state') =
match f with | Ret x -> x, state | _ -> let Step pre' f' state' j = step i f c.emp state in run j f' state'
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.step
val step (#s #c: _) (i: nat) (#pre #a #post: _) (f: m a pre post) (frame: c.r) (state: s) : Div (step_result a post frame) (requires c.interp (pre `c.star` frame) state) (ensures fun _ -> True)
val step (#s #c: _) (i: nat) (#pre #a #post: _) (f: m a pre post) (frame: c.r) (state: s) : Div (step_result a post frame) (requires c.interp (pre `c.star` frame) state) (ensures fun _ -> True)
let rec step #s #c (i:nat) #pre #a #post (f:m a pre post) (frame:c.r) (state:s) : Div (step_result a post frame) (requires c.interp (pre `c.star` frame) state) (ensures fun _ -> True) = match f with | Ret x -> //Nothing to do, just return Step (post x) (Ret x) state i ...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 86, "end_line": 174, "start_col": 0, "start_line": 138 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Prims.nat -> f: OPLSS2021.ParNDSDiv.m a pre post -> frame: Mkcomm_monoid?.r c -> state: s -> FStar.Pervasives.Div (OPLSS2021.ParNDSDiv.step_result a post frame)
FStar.Pervasives.Div
[]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "Prims.nat", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.post", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.Step", "OPLSS2021.ParNDSDiv.Ret", "OPLSS2021.ParNDSDiv.step_result", "OPLSS2021.ParNDSDiv.action", "OPLSS2021.ParNDSDiv.__...
[ "recursion" ]
false
true
false
false
false
let rec step #s #c (i: nat) #pre #a #post (f: m a pre post) (frame: c.r) (state: s) : Div (step_result a post frame) (requires c.interp (pre `c.star` frame) state) (ensures fun _ -> True) =
match f with | Ret x -> Step (post x) (Ret x) state i | Act act1 k -> let (| b , state' |) = act1.sem frame state in Step (act1.post b) (k b) state' i | Par pre0 post0 (Ret x0) pre1 post1 (Ret x1) k -> Step (post0 `c.star` post1) k state i | Par pre0 post0 m0 pre1 post1 m1 k -> if bools i then let Step pre0...
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.bind
val bind (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#b: Type u#b) (#p: c.r) (#q: (a -> c.r)) (#r: (b -> c.r)) (f: m a p q) (g: (x: a -> Dv (m b (q x) r))) : Dv (m b p r)
val bind (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#b: Type u#b) (#p: c.r) (#q: (a -> c.r)) (#r: (b -> c.r)) (f: m a p q) (g: (x: a -> Dv (m b (q x) r))) : Dv (m b p r)
let rec bind (#s:Type u#s) (#c:comm_monoid s) (#a:Type u#a) (#b:Type u#b) (#p:c.r) (#q:a -> c.r) (#r:b -> c.r) (f:m a p q) (g: (x:a -> Dv (m b (q x) r))) : Dv (m b p r) = match f with | Ret x -> g x | Act...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 23, "end_line": 234, "start_col": 0, "start_line": 208 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: OPLSS2021.ParNDSDiv.m a p q -> g: (x: a -> FStar.Pervasives.Dv (OPLSS2021.ParNDSDiv.m b (q x) r)) -> FStar.Pervasives.Dv (OPLSS2021.ParNDSDiv.m b p r)
FStar.Pervasives.Dv
[]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.action", "OPLSS2021.ParNDSDiv.__proj__Mkaction__item__post", "OPLSS2021.ParNDSDiv.Act", "OPLSS2021.ParNDSDiv.bind", "FStar.Universe.raise_t", "Prims.unit", "OPLSS2...
[ "recursion" ]
false
true
false
false
false
let rec bind (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#b: Type u#b) (#p: c.r) (#q: (a -> c.r)) (#r: (b -> c.r)) (f: m a p q) (g: (x: a -> Dv (m b (q x) r))) : Dv (m b p r) =
match f with | Ret x -> g x | Act act k -> Act act (fun x -> bind (k x) g) | Par pre0 post0 ml pre1 post1 mr k -> let k:m b (post0 `c.star` post1) r = bind k g in let ml':m (U.raise_t u#0 u#b unit) pre0 (fun _ -> post0) = bind ml (fun _ -> Ret (U.raise_val u#0 u#b ())) in let mr':m (U.raise_t u#0 u#b unit) ...
false
Hacl.Bignum25519.fsti
Hacl.Bignum25519.gety
val gety (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 5ul 5ul /\ h0 == h1)
val gety (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 5ul 5ul /\ h0 == h1)
let gety (p:point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 5ul 5ul /\ h0 == h1) = sub p 5ul 5ul
{ "file_name": "code/ed25519/Hacl.Bignum25519.fsti", "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": 32 }
module Hacl.Bignum25519 module ST = FStar.HyperStack.ST open FStar.HyperStack.All open Lib.IntTypes open Lib.Buffer module BSeq = Lib.ByteSequence module S51 = Hacl.Spec.Curve25519.Field51.Definition module F51 = Hacl.Impl.Ed25519.Field51 module SC = Spec.Curve25519 #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" ...
{ "checked_file": "/", "dependencies": [ "Spec.Ed25519.fst.checked", "Spec.Curve25519.fst.checked", "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Finv.fst.checked", "Hacl.Spec.Curve25519.Field51.Def...
[ { "abbrev": true, "full_module": "Spec.Curve25519", "short_module": "SC" }, { "abbrev": true, "full_module": "Hacl.Impl.Ed25519.Field51", "short_module": "F51" }, { "abbrev": true, "full_module": "Hacl.Spec.Curve25519.Field51.Definition", "short_module": "S51" }, { ...
{ "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
p: Hacl.Bignum25519.point -> FStar.HyperStack.ST.Stack Hacl.Bignum25519.felem
FStar.HyperStack.ST.Stack
[]
[]
[ "Hacl.Bignum25519.point", "Lib.Buffer.sub", "Lib.Buffer.MUT", "Lib.IntTypes.uint64", "FStar.UInt32.__uint_to_t", "Lib.Buffer.lbuffer_t", "Hacl.Bignum25519.felem", "FStar.Monotonic.HyperStack.mem", "Lib.Buffer.live", "Prims.l_and", "Prims.eq2", "Lib.Buffer.gsub" ]
[]
false
true
false
false
false
let gety (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 5ul 5ul /\ h0 == h1) =
sub p 5ul 5ul
false
Vale.AES.PPC64LE.AES128.fst
Vale.AES.PPC64LE.AES128.va_lemma_AES128EncryptBlock_6way
val va_lemma_AES128EncryptBlock_6way : va_b0:va_code -> va_s0:va_state -> in1:quad32 -> in2:quad32 -> in3:quad32 -> in4:quad32 -> in5:quad32 -> in6:quad32 -> key:(seq nat32) -> round_keys:(seq quad32) -> keys_buffer:buffer128 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_AES128Encrypt...
val va_lemma_AES128EncryptBlock_6way : va_b0:va_code -> va_s0:va_state -> in1:quad32 -> in2:quad32 -> in3:quad32 -> in4:quad32 -> in5:quad32 -> in6:quad32 -> key:(seq nat32) -> round_keys:(seq quad32) -> keys_buffer:buffer128 -> Ghost (va_state & va_fuel) (requires (va_require_total va_b0 (va_code_AES128Encrypt...
let va_lemma_AES128EncryptBlock_6way va_b0 va_s0 in1 in2 in3 in4 in5 in6 key round_keys keys_buffer = let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok] in let va_qc = va_qcode_AES128EncryptBlock_6way va_mods i...
{ "file_name": "obj/Vale.AES.PPC64LE.AES128.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 16, "end_line": 1065, "start_col": 0, "start_line": 1040 }
module Vale.AES.PPC64LE.AES128 open Vale.Def.Opaque_s open Vale.Def.Types_s open FStar.Seq open Vale.AES.AES_BE_s open Vale.PPC64LE.Machine_s open Vale.PPC64LE.Memory open Vale.PPC64LE.State open Vale.PPC64LE.Decls open Vale.PPC64LE.InsBasic open Vale.PPC64LE.InsMem open Vale.PPC64LE.InsVector open Vale.PPC64LE.QuickCo...
{ "checked_file": "/", "dependencies": [ "Vale.PPC64LE.State.fsti.checked", "Vale.PPC64LE.QuickCodes.fsti.checked", "Vale.PPC64LE.QuickCode.fst.checked", "Vale.PPC64LE.Memory.fsti.checked", "Vale.PPC64LE.Machine_s.fst.checked", "Vale.PPC64LE.InsVector.fsti.checked", "Vale.PPC64LE.InsMem....
[ { "abbrev": false, "full_module": "Vale.AES.AES_helpers_BE", "short_module": null }, { "abbrev": false, "full_module": "Vale.Arch.Types", "short_module": null }, { "abbrev": false, "full_module": "Vale.PPC64LE.QuickCodes", "short_module": null }, { "abbrev": false...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
va_b0: Vale.PPC64LE.Decls.va_code -> va_s0: Vale.PPC64LE.Decls.va_state -> in1: Vale.PPC64LE.Memory.quad32 -> in2: Vale.PPC64LE.Memory.quad32 -> in3: Vale.PPC64LE.Memory.quad32 -> in4: Vale.PPC64LE.Memory.quad32 -> in5: Vale.PPC64LE.Memory.quad32 -> in6: Vale.PPC64LE.Memory.quad32 -> ...
Prims.Ghost
[]
[]
[ "Vale.PPC64LE.Decls.va_code", "Vale.PPC64LE.Decls.va_state", "Vale.PPC64LE.Memory.quad32", "FStar.Seq.Base.seq", "Vale.PPC64LE.Memory.nat32", "Vale.PPC64LE.Memory.buffer128", "Vale.PPC64LE.QuickCodes.fuel", "Prims.unit", "FStar.Pervasives.Native.Mktuple2", "Vale.PPC64LE.Decls.va_fuel", "Vale.PPC...
[]
false
false
false
false
false
let va_lemma_AES128EncryptBlock_6way va_b0 va_s0 in1 in2 in3 in4 in5 in6 key round_keys keys_buffer =
let va_mods:va_mods_t = [ va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_ok ] in let va_qc = va_qcode_AES128EncryptBlock_6way va_mods in1 in2 in3 in4 in5 in6 key round_keys keys_buffer in let va_sM, va_fM,...
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.par
val par (#s: _) (#c: comm_monoid s) (#p0 #q0: _) (m0: m unit p0 (fun _ -> q0)) (#p1 #q1: _) (m1: m unit p1 (fun _ -> q1)) : Dv (m unit (p0 `c.star` p1) (fun _ -> q0 `c.star` q1))
val par (#s: _) (#c: comm_monoid s) (#p0 #q0: _) (m0: m unit p0 (fun _ -> q0)) (#p1 #q1: _) (m1: m unit p1 (fun _ -> q1)) : Dv (m unit (p0 `c.star` p1) (fun _ -> q0 `c.star` q1))
let par #s (#c:comm_monoid s) #p0 #q0 (m0:m unit p0 (fun _ -> q0)) #p1 #q1 (m1:m unit p1 (fun _ -> q1)) : Dv (m unit (p0 `c.star` p1) (fun _ -> q0 `c.star` q1)) = let m0' : m (U.raise_t unit) p0 (fun _ -> q0) = bind m0 (fun _ -> Ret (U.raise_val u#0 u#0 ())) in let m1' : m (U.raise_t unit...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 15, "end_line": 293, "start_col": 0, "start_line": 281 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
m0: OPLSS2021.ParNDSDiv.m Prims.unit p0 (fun _ -> q0) -> m1: OPLSS2021.ParNDSDiv.m Prims.unit p1 (fun _ -> q1) -> FStar.Pervasives.Dv (OPLSS2021.ParNDSDiv.m Prims.unit (Mkcomm_monoid?.star c p0 p1) (fun _ -> Mkcomm_monoid?.star c q0 q1))
FStar.Pervasives.Dv
[]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.m", "Prims.unit", "OPLSS2021.ParNDSDiv.Par", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__star", "OPLSS2021.ParNDSDiv.Ret", "FStar.Universe.raise_t", "OPLSS2021.ParNDSDiv.bind", "FSta...
[]
false
true
false
false
false
let par #s (#c: comm_monoid s) #p0 #q0 (m0: m unit p0 (fun _ -> q0)) #p1 #q1 (m1: m unit p1 (fun _ -> q1)) : Dv (m unit (p0 `c.star` p1) (fun _ -> q0 `c.star` q1)) =
let m0':m (U.raise_t unit) p0 (fun _ -> q0) = bind m0 (fun _ -> Ret (U.raise_val u#0 u#0 ())) in let m1':m (U.raise_t unit) p1 (fun _ -> q1) = bind m1 (fun _ -> Ret (U.raise_val u#0 u#0 ())) in Par p0 q0 m0' p1 q1 m1' (Ret ())
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.ret
val ret (a: Type u#a) (x: a) (p: (a -> hm.r)) : comp a (p x) p
val ret (a: Type u#a) (x: a) (p: (a -> hm.r)) : comp a (p x) p
let ret (a:Type u#a) (x:a) (p: a -> hm.r) : comp a (p x) p = fun _ -> return x p
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 23, "end_line": 327, "start_col": 0, "start_line": 325 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> x: a -> p: (_: a -> Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm) -> OPLSS2021.ParNDSDiv.comp a (p x) p
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "Prims.unit", "OPLSS2021.ParNDSDiv.return", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.comp" ]
[]
false
false
false
false
false
let ret (a: Type u#a) (x: a) (p: (a -> hm.r)) : comp a (p x) p =
fun _ -> return x p
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.comp
val comp : a: Type -> p: Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm -> q: (_: a -> Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm) -> Type0
let comp (a:Type u#a) (p:hm.r) (q:a -> hm.r) = unit -> Dv (m a p q)
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 24, "end_line": 323, "start_col": 0, "start_line": 322 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> p: Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm -> q: (_: a -> Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm) -> Type0
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "Prims.unit", "OPLSS2021.ParNDSDiv.m" ]
[]
false
false
false
true
true
let comp (a: Type u#a) (p: hm.r) (q: (a -> hm.r)) =
unit -> Dv (m a p q)
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.bnd
val bnd (a: Type u#a) (b: Type u#b) (p: hm.r) (q: (a -> hm.r)) (r: (b -> hm.r)) (f: comp a p q) (g: (x: a -> comp b (q x) r)) : comp b p r
val bnd (a: Type u#a) (b: Type u#b) (p: hm.r) (q: (a -> hm.r)) (r: (b -> hm.r)) (f: comp a p q) (g: (x: a -> comp b (q x) r)) : comp b p r
let bnd (a:Type u#a) (b:Type u#b) (p:hm.r) (q: a -> hm.r) (r: b -> hm.r) (f:comp a p q) (g: (x:a -> comp b (q x) r)) : comp b p r = fun _ -> bind (f()) (fun x -> g x ())
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 41, "end_line": 332, "start_col": 0, "start_line": 329 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> p: Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm -> q: (_: a -> Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm) -> r: (_: b -> Mkcomm_monoid?.r OPLSS2021.ParNDSDiv.hm) -> f: OPLSS2021.ParNDSDiv.comp a p q -> g: (x: a -> OPLSS2021.ParNDSDiv.comp b (q x) r) -> OPLSS2021.ParNDSDiv.c...
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "OPLSS2021.ParNDSDiv.comp", "Prims.unit", "OPLSS2021.ParNDSDiv.bind", "OPLSS2021.ParNDSDiv.m" ]
[]
false
false
false
false
false
let bnd (a: Type u#a) (b: Type u#b) (p: hm.r) (q: (a -> hm.r)) (r: (b -> hm.r)) (f: comp a p q) (g: (x: a -> comp b (q x) r)) : comp b p r =
fun _ -> bind (f ()) (fun x -> g x ())
false
Hacl.Bignum25519.fsti
Hacl.Bignum25519.getx
val getx (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 0ul 5ul /\ h0 == h1)
val getx (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 0ul 5ul /\ h0 == h1)
let getx (p:point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 0ul 5ul /\ h0 == h1) = sub p 0ul 5ul
{ "file_name": "code/ed25519/Hacl.Bignum25519.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 17, "end_line": 29, "start_col": 0, "start_line": 26 }
module Hacl.Bignum25519 module ST = FStar.HyperStack.ST open FStar.HyperStack.All open Lib.IntTypes open Lib.Buffer module BSeq = Lib.ByteSequence module S51 = Hacl.Spec.Curve25519.Field51.Definition module F51 = Hacl.Impl.Ed25519.Field51 module SC = Spec.Curve25519 #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" ...
{ "checked_file": "/", "dependencies": [ "Spec.Ed25519.fst.checked", "Spec.Curve25519.fst.checked", "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Finv.fst.checked", "Hacl.Spec.Curve25519.Field51.Def...
[ { "abbrev": true, "full_module": "Spec.Curve25519", "short_module": "SC" }, { "abbrev": true, "full_module": "Hacl.Impl.Ed25519.Field51", "short_module": "F51" }, { "abbrev": true, "full_module": "Hacl.Spec.Curve25519.Field51.Definition", "short_module": "S51" }, { ...
{ "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
p: Hacl.Bignum25519.point -> FStar.HyperStack.ST.Stack Hacl.Bignum25519.felem
FStar.HyperStack.ST.Stack
[]
[]
[ "Hacl.Bignum25519.point", "Lib.Buffer.sub", "Lib.Buffer.MUT", "Lib.IntTypes.uint64", "FStar.UInt32.__uint_to_t", "Lib.Buffer.lbuffer_t", "Hacl.Bignum25519.felem", "FStar.Monotonic.HyperStack.mem", "Lib.Buffer.live", "Prims.l_and", "Prims.eq2", "Lib.Buffer.gsub" ]
[]
false
true
false
false
false
let getx (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 0ul 5ul /\ h0 == h1) =
sub p 0ul 5ul
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.frame_action
val frame_action (#s: Type) (#c: comm_monoid s) (#a: Type) (f: action c a) (fr: c.r) : g: action c a {g.post == (fun x -> (f.post x) `c.star` fr) /\ g.pre == f.pre `c.star` fr}
val frame_action (#s: Type) (#c: comm_monoid s) (#a: Type) (f: action c a) (fr: c.r) : g: action c a {g.post == (fun x -> (f.post x) `c.star` fr) /\ g.pre == f.pre `c.star` fr}
let frame_action (#s:Type) (#c:comm_monoid s) (#a:Type) (f:action c a) (fr:c.r) : g:action c a { g.post == (fun x -> f.post x `c.star` fr) /\ g.pre == f.pre `c.star` fr } = let pre = f.pre `c.star` fr in let post x = f.post x `c.star` fr in let sem (frame:c.r) (s0:s{c.interp (c.star pre f...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 17, "end_line": 255, "start_col": 0, "start_line": 243 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: OPLSS2021.ParNDSDiv.action c a -> fr: Mkcomm_monoid?.r c -> g: OPLSS2021.ParNDSDiv.action c a { Mkaction?.post g == (fun x -> Mkcomm_monoid?.star c (Mkaction?.post f x) fr) /\ Mkaction?.pre g == Mkcomm_monoid?.star c (Mkaction?.pre f) fr }
Prims.Tot
[ "total" ]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.action", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.Mkaction", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__interp", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__star", "Prims.dtuple2", "OPLSS2021.ParNDSD...
[]
false
false
false
false
false
let frame_action (#s: Type) (#c: comm_monoid s) (#a: Type) (f: action c a) (fr: c.r) : g: action c a {g.post == (fun x -> (f.post x) `c.star` fr) /\ g.pre == f.pre `c.star` fr} =
let pre = f.pre `c.star` fr in let post x = (f.post x) `c.star` fr in let sem (frame: c.r) (s0: s{c.interp (c.star pre frame) s0}) : (x: a & s1: s{c.interp ((post x) `c.star` frame) s1}) = let (| x , s1 |) = f.sem (fr `c.star` frame) s0 in (| x, s1 |) in { pre = pre; post = post; sem = sem }
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.is_value
val is_value : exp -> Tot bool
val is_value : exp -> Tot bool
let is_value = EAbs?
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 20, "end_line": 30, "start_col": 0, "start_line": 30 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
_: StlcCbvDbPntSubstNoLists.exp -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "StlcCbvDbPntSubstNoLists.uu___is_EAbs" ]
[]
false
false
false
true
false
let is_value =
EAbs?
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.frame_r
val frame_r (#a: Type u#a) (#p: hm.r) (#q: (a -> hm.r)) (#fr: hm.r) (f: (unit -> C a p q)) : C a (p `star` fr) (fun x -> (q x) `star` fr)
val frame_r (#a: Type u#a) (#p: hm.r) (#q: (a -> hm.r)) (#fr: hm.r) (f: (unit -> C a p q)) : C a (p `star` fr) (fun x -> (q x) `star` fr)
let frame_r (#a:Type u#a) (#p:hm.r) (#q: a -> hm.r) (#fr:hm.r) (f: unit -> C a p q) : C a (p `star` fr) (fun x -> q x `star` fr) = let ff : m a p q = (reify (f())) () in C?.reflect (fun () -> frame fr ff)
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 40, "end_line": 466, "start_col": 0, "start_line": 462 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": false, "full_module": "FStar.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS20...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: (_: Prims.unit -> OPLSS2021.ParNDSDiv.C a) -> OPLSS2021.ParNDSDiv.C a
OPLSS2021.ParNDSDiv.C
[]
[]
[ "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "Prims.unit", "OPLSS2021.ParNDSDiv.frame", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__star", "OPLSS2021.ParNDSDiv.comp", "OPLSS2021.ParNDSDiv.star" ]
[]
false
true
false
false
false
let frame_r (#a: Type u#a) (#p: hm.r) (#q: (a -> hm.r)) (#fr: hm.r) (f: (unit -> C a p q)) : C a (p `star` fr) (fun x -> (q x) `star` fr) =
let ff:m a p q = (reify (f ())) () in C?.reflect (fun () -> frame fr ff)
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.incr
val incr (#v0: erased int) (x: ref int) : C unit (pts_to x v0) (fun u -> pts_to x (v0 + 1))
val incr (#v0: erased int) (x: ref int) : C unit (pts_to x v0) (fun u -> pts_to x (v0 + 1))
let incr (#v0:erased int) (x:ref int) : C unit (pts_to x v0) (fun u -> pts_to x (v0 + 1)) = let v = !x in frame_r (fun _ -> x := v + 1); rewrite (fun y -> pts_to x (y + 1)) v0 v
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 44, "end_line": 481, "start_col": 0, "start_line": 477 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": false, "full_module": "FStar.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS20...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: OPLSS2021.ParNDSDiv.ref Prims.int -> OPLSS2021.ParNDSDiv.C Prims.unit
OPLSS2021.ParNDSDiv.C
[]
[]
[ "FStar.Ghost.erased", "Prims.int", "OPLSS2021.ParNDSDiv.ref", "OPLSS2021.ParNDSDiv.rewrite", "OPLSS2021.ParNDSDiv.pts_to", "Prims.op_Addition", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "Prims.unit", "OPLSS2021.ParNDSDiv.frame_r",...
[]
false
true
false
false
false
let incr (#v0: erased int) (x: ref int) : C unit (pts_to x v0) (fun u -> pts_to x (v0 + 1)) =
let v = !x in frame_r (fun _ -> x := v + 1); rewrite (fun y -> pts_to x (y + 1)) v0 v
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.par_c
val par_c (#p0 #q0 #p1 #q1: hm.r) ($f0: (unit -> C unit p0 (fun _ -> q0))) ($f1: (unit -> C unit p1 (fun _ -> q1))) : C unit (p0 `star` p1) (fun _ -> q0 `star` q1)
val par_c (#p0 #q0 #p1 #q1: hm.r) ($f0: (unit -> C unit p0 (fun _ -> q0))) ($f1: (unit -> C unit p1 (fun _ -> q1))) : C unit (p0 `star` p1) (fun _ -> q0 `star` q1)
let par_c (#p0:hm.r) (#q0: hm.r) (#p1:hm.r) (#q1: hm.r) ($f0: unit -> C unit p0 (fun _ -> q0)) ($f1: unit -> C unit p1 (fun _ -> q1)) : C unit (p0 `star` p1) (fun _ -> q0 `star` q1) = let ff0 : m unit p0 (fun _ -> q0) = reify (f0()) () in let ff1 : m unit p1 (fun _ -> q1) = r...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 40, "end_line": 475, "start_col": 0, "start_line": 468 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": false, "full_module": "FStar.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS20...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
$f0: (_: Prims.unit -> OPLSS2021.ParNDSDiv.C Prims.unit) -> $f1: (_: Prims.unit -> OPLSS2021.ParNDSDiv.C Prims.unit) -> OPLSS2021.ParNDSDiv.C Prims.unit
OPLSS2021.ParNDSDiv.C
[]
[]
[ "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.heap", "OPLSS2021.ParNDSDiv.hm", "Prims.unit", "OPLSS2021.ParNDSDiv.par", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__star", "OPLSS2021.ParNDSDiv.comp", "OPLSS2021.ParNDSDiv.star" ]
[]
false
true
false
false
false
let par_c (#p0 #q0 #p1 #q1: hm.r) ($f0: (unit -> C unit p0 (fun _ -> q0))) ($f1: (unit -> C unit p1 (fun _ -> q1))) : C unit (p0 `star` p1) (fun _ -> q0 `star` q1) =
let ff0:m unit p0 (fun _ -> q0) = reify (f0 ()) () in let ff1:m unit p1 (fun _ -> q1) = reify (f1 ()) () in C?.reflect (fun () -> par ff0 ff1)
false
Vale.AES.PPC64LE.AES128.fst
Vale.AES.PPC64LE.AES128.va_qcode_AES128EncryptBlock_6way
val va_qcode_AES128EncryptBlock_6way (va_mods: va_mods_t) (in1 in2 in3 in4 in5 in6: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_buffer: buffer128) : (va_quickCode unit (va_code_AES128EncryptBlock_6way ()))
val va_qcode_AES128EncryptBlock_6way (va_mods: va_mods_t) (in1 in2 in3 in4 in5 in6: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_buffer: buffer128) : (va_quickCode unit (va_code_AES128EncryptBlock_6way ()))
let va_qcode_AES128EncryptBlock_6way (va_mods:va_mods_t) (in1:quad32) (in2:quad32) (in3:quad32) (in4:quad32) (in5:quad32) (in6:quad32) (key:(seq nat32)) (round_keys:(seq quad32)) (keys_buffer:buffer128) : (va_quickCode unit (va_code_AES128EncryptBlock_6way ())) = (qblock va_mods (fun (va_s:va_state) -> let (va_ol...
{ "file_name": "obj/Vale.AES.PPC64LE.AES128.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 43, "end_line": 1037, "start_col": 0, "start_line": 918 }
module Vale.AES.PPC64LE.AES128 open Vale.Def.Opaque_s open Vale.Def.Types_s open FStar.Seq open Vale.AES.AES_BE_s open Vale.PPC64LE.Machine_s open Vale.PPC64LE.Memory open Vale.PPC64LE.State open Vale.PPC64LE.Decls open Vale.PPC64LE.InsBasic open Vale.PPC64LE.InsMem open Vale.PPC64LE.InsVector open Vale.PPC64LE.QuickCo...
{ "checked_file": "/", "dependencies": [ "Vale.PPC64LE.State.fsti.checked", "Vale.PPC64LE.QuickCodes.fsti.checked", "Vale.PPC64LE.QuickCode.fst.checked", "Vale.PPC64LE.Memory.fsti.checked", "Vale.PPC64LE.Machine_s.fst.checked", "Vale.PPC64LE.InsVector.fsti.checked", "Vale.PPC64LE.InsMem....
[ { "abbrev": false, "full_module": "Vale.AES.AES_helpers_BE", "short_module": null }, { "abbrev": false, "full_module": "Vale.Arch.Types", "short_module": null }, { "abbrev": false, "full_module": "Vale.PPC64LE.QuickCodes", "short_module": null }, { "abbrev": false...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> in1: Vale.PPC64LE.Memory.quad32 -> in2: Vale.PPC64LE.Memory.quad32 -> in3: Vale.PPC64LE.Memory.quad32 -> in4: Vale.PPC64LE.Memory.quad32 -> in5: Vale.PPC64LE.Memory.quad32 -> in6: Vale.PPC64LE.Memory.quad32 -> key: FStar.Seq.Base.seq Vale.PPC...
Prims.Tot
[ "total" ]
[]
[ "Vale.PPC64LE.QuickCode.va_mods_t", "Vale.PPC64LE.Memory.quad32", "FStar.Seq.Base.seq", "Vale.PPC64LE.Memory.nat32", "Vale.PPC64LE.Memory.buffer128", "Vale.PPC64LE.QuickCodes.qblock", "Prims.unit", "Prims.Cons", "Vale.PPC64LE.Decls.va_code", "Vale.PPC64LE.Machine_s.Block", "Vale.PPC64LE.Decls.in...
[]
false
false
false
false
false
let va_qcode_AES128EncryptBlock_6way (va_mods: va_mods_t) (in1 in2 in3 in4 in5 in6: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_buffer: buffer128) : (va_quickCode unit (va_code_AES128EncryptBlock_6way ())) =
(qblock va_mods (fun (va_s: va_state) -> let va_old_s:va_state = va_s in va_qAssertSquash va_range1 "***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 307 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.AES128.vaf *****" ...
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.empty
val empty : env
val empty : env
let empty _ = None
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 18, "end_line": 68, "start_col": 0, "start_line": 68 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
StlcCbvDbPntSubstNoLists.env
Prims.Tot
[ "total" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "FStar.Pervasives.Native.None", "StlcCbvDbPntSubstNoLists.ty", "FStar.Pervasives.Native.option" ]
[]
false
false
false
true
false
let empty _ =
None
false
Hacl.Bignum25519.fsti
Hacl.Bignum25519.gett
val gett (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 15ul 5ul /\ h0 == h1)
val gett (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 15ul 5ul /\ h0 == h1)
let gett (p:point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 15ul 5ul /\ h0 == h1) = sub p 15ul 5ul
{ "file_name": "code/ed25519/Hacl.Bignum25519.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 18, "end_line": 47, "start_col": 0, "start_line": 44 }
module Hacl.Bignum25519 module ST = FStar.HyperStack.ST open FStar.HyperStack.All open Lib.IntTypes open Lib.Buffer module BSeq = Lib.ByteSequence module S51 = Hacl.Spec.Curve25519.Field51.Definition module F51 = Hacl.Impl.Ed25519.Field51 module SC = Spec.Curve25519 #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" ...
{ "checked_file": "/", "dependencies": [ "Spec.Ed25519.fst.checked", "Spec.Curve25519.fst.checked", "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Finv.fst.checked", "Hacl.Spec.Curve25519.Field51.Def...
[ { "abbrev": true, "full_module": "Spec.Curve25519", "short_module": "SC" }, { "abbrev": true, "full_module": "Hacl.Impl.Ed25519.Field51", "short_module": "F51" }, { "abbrev": true, "full_module": "Hacl.Spec.Curve25519.Field51.Definition", "short_module": "S51" }, { ...
{ "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
p: Hacl.Bignum25519.point -> FStar.HyperStack.ST.Stack Hacl.Bignum25519.felem
FStar.HyperStack.ST.Stack
[]
[]
[ "Hacl.Bignum25519.point", "Lib.Buffer.sub", "Lib.Buffer.MUT", "Lib.IntTypes.uint64", "FStar.UInt32.__uint_to_t", "Lib.Buffer.lbuffer_t", "Hacl.Bignum25519.felem", "FStar.Monotonic.HyperStack.mem", "Lib.Buffer.live", "Prims.l_and", "Prims.eq2", "Lib.Buffer.gsub" ]
[]
false
true
false
false
false
let gett (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 15ul 5ul /\ h0 == h1) =
sub p 15ul 5ul
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.par_incr
val par_incr (#v0 #v1: erased int) (x0 x1: ref int) : C unit ((pts_to x0 v0) `star` (pts_to x1 v1)) (fun _ -> (pts_to x0 (v0 + 1)) `star` (pts_to x1 (v1 + 1)))
val par_incr (#v0 #v1: erased int) (x0 x1: ref int) : C unit ((pts_to x0 v0) `star` (pts_to x1 v1)) (fun _ -> (pts_to x0 (v0 + 1)) `star` (pts_to x1 (v1 + 1)))
let par_incr (#v0 #v1:erased int) (x0 x1: ref int) : C unit (pts_to x0 v0 `star` pts_to x1 v1) (fun _ -> pts_to x0 (v0 + 1) `star` pts_to x1 (v1 + 1)) = par_c (fun _ -> incr x0) (fun _ -> incr x1)
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 28, "end_line": 488, "start_col": 0, "start_line": 483 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": false, "full_module": "FStar.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS20...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: OPLSS2021.ParNDSDiv.ref Prims.int -> x1: OPLSS2021.ParNDSDiv.ref Prims.int -> OPLSS2021.ParNDSDiv.C Prims.unit
OPLSS2021.ParNDSDiv.C
[]
[]
[ "FStar.Ghost.erased", "Prims.int", "OPLSS2021.ParNDSDiv.ref", "OPLSS2021.ParNDSDiv.par_c", "OPLSS2021.ParNDSDiv.pts_to", "FStar.Ghost.reveal", "Prims.op_Addition", "Prims.unit", "OPLSS2021.ParNDSDiv.incr", "OPLSS2021.ParNDSDiv.star", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS...
[]
false
true
false
false
false
let par_incr (#v0 #v1: erased int) (x0 x1: ref int) : C unit ((pts_to x0 v0) `star` (pts_to x1 v1)) (fun _ -> (pts_to x0 (v0 + 1)) `star` (pts_to x1 (v1 + 1))) =
par_c (fun _ -> incr x0) (fun _ -> incr x1)
false
Steel.Primitive.ForkJoin.Unix.fst
Steel.Primitive.ForkJoin.Unix.example4
val example4: Prims.unit -> SteelK (ref int) emp (fun r -> pts_to r full_perm 2)
val example4: Prims.unit -> SteelK (ref int) emp (fun r -> pts_to r full_perm 2)
let example4 () : SteelK (ref int) emp (fun r -> pts_to r full_perm 2) = let x = alloc_pt 0 in let y = alloc_pt 1 in let p1:thread (pts_to x full_perm 1) = kfork (fun _ -> write_pt #_ #0 x 1) in let p2:thread emp = kfork (fun _ -> free_pt #_ #1 y) in kjoin p1; write_pt #_ #1 x 2; kjoin p2; x
{ "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": 3, "end_line": 275, "start_col": 0, "start_line": 267 }
(* 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.FractionalPermission", "short_module": null }, { "abbrev": false, "full_module": "Steel.Primitive.ForkJoin", "short_module": null }, { "abbrev": false, "full_module": "Steel.Reference", "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
_: Prims.unit -> Steel.Primitive.ForkJoin.Unix.SteelK (Steel.Reference.ref Prims.int)
Steel.Primitive.ForkJoin.Unix.SteelK
[]
[]
[ "Prims.unit", "Steel.Reference.ref", "Prims.int", "Steel.Primitive.ForkJoin.Unix.kjoin", "Steel.Effect.Common.emp", "Steel.Reference.write_pt", "FStar.Ghost.hide", "Steel.Reference.pts_to", "Steel.FractionalPermission.full_perm", "Steel.Primitive.ForkJoin.thread", "Steel.Primitive.ForkJoin.Unix....
[]
false
true
false
false
false
let example4 () : SteelK (ref int) emp (fun r -> pts_to r full_perm 2) =
let x = alloc_pt 0 in let y = alloc_pt 1 in let p1:thread (pts_to x full_perm 1) = kfork (fun _ -> write_pt #_ #0 x 1) in let p2:thread emp = kfork (fun _ -> free_pt #_ #1 y) in kjoin p1; write_pt #_ #1 x 2; kjoin p2; x
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.subst_beta
val subst_beta : x:var -> v:exp -> e:exp -> Tot exp (decreases e)
val subst_beta : x:var -> v:exp -> e:exp -> Tot exp (decreases e)
let rec subst_beta x v e = match e with | EVar y -> if y = x then v else if y < x then EVar y else EVar (y-1) | EAbs t e1 -> EAbs t (subst_beta (x+1) v e1) | EApp e1 e2 -> EApp (subst_beta x v e1) (subst_beta x v e2)
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 62, "end_line": 44, "start_col": 0, "start_line": 38 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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: StlcCbvDbPntSubstNoLists.var -> v: StlcCbvDbPntSubstNoLists.exp -> e: StlcCbvDbPntSubstNoLists.exp -> Prims.Tot StlcCbvDbPntSubstNoLists.exp
Prims.Tot
[ "total", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.exp", "Prims.op_Equality", "Prims.bool", "Prims.op_LessThan", "StlcCbvDbPntSubstNoLists.EVar", "Prims.op_Subtraction", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.EAbs", "StlcCbvDbPntSubstNoLists.subst_beta", "Prims.op_Additi...
[ "recursion" ]
false
false
false
true
false
let rec subst_beta x v e =
match e with | EVar y -> if y = x then v else if y < x then EVar y else EVar (y - 1) | EAbs t e1 -> EAbs t (subst_beta (x + 1) v e1) | EApp e1 e2 -> EApp (subst_beta x v e1) (subst_beta x v e2)
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.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 | EAbs t e' -> Some (subst_beta 0 e2 e') | _ -> None else match (step e2) with | Some e2' -> Some (EApp e1 e2') | None -> ...
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 13, "end_line": 63, "start_col": 0, "start_line": 47 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
e: StlcCbvDbPntSubstNoLists.exp -> FStar.Pervasives.Native.option StlcCbvDbPntSubstNoLists.exp
Prims.Tot
[ "total" ]
[]
[ "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.is_value", "StlcCbvDbPntSubstNoLists.ty", "FStar.Pervasives.Native.Some", "StlcCbvDbPntSubstNoLists.subst_beta", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.option", "Prims.bool", "StlcCbvDbPntSubstNoLists.step", "StlcCbvDbPntS...
[ "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 | EAbs t e' -> Some (subst_beta 0 e2 e') | _ -> None else match (step e2) with | Some e2' -> Some (EApp e1 e2') | None -> None else (match (step e1) with | Some e1' -> Some ...
false
OPLSS2021.ParNDSDiv.fst
OPLSS2021.ParNDSDiv.frame
val frame (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#p: c.r) (#q: (a -> c.r)) (fr: c.r) (f: m a p q) : Dv (m a (p `c.star` fr) (fun x -> (q x) `c.star` fr))
val frame (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#p: c.r) (#q: (a -> c.r)) (fr: c.r) (f: m a p q) : Dv (m a (p `c.star` fr) (fun x -> (q x) `c.star` fr))
let rec frame (#s:Type u#s) (#c:comm_monoid s) (#a:Type u#a) (#p:c.r) (#q:a -> c.r) (fr:c.r) (f:m a p q) : Dv (m a (p `c.star` fr) (fun x -> q x `c.star` fr)) = match f with | Ret x -> Ret x | Act f k -> Act (fram...
{ "file_name": "examples/oplss2021/OPLSS2021.ParNDSDiv.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 23, "end_line": 275, "start_col": 0, "start_line": 260 }
(* Copyright 2019-2021 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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.Universe.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Ghost.fsti.checked" ], "interface_file": false, "source_file": "OPLSS2021.ParNDSDiv.fst" }
[ { "abbrev": true, "full_module": "FStar.Universe", "short_module": "U" }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "OPLSS2021", "short_module": null }, { "abbrev": false, "full_module": "FStar.Per...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
fr: Mkcomm_monoid?.r c -> f: OPLSS2021.ParNDSDiv.m a p q -> FStar.Pervasives.Dv (OPLSS2021.ParNDSDiv.m a (Mkcomm_monoid?.star c p fr) (fun x -> Mkcomm_monoid?.star c (q x) fr))
FStar.Pervasives.Dv
[]
[]
[ "OPLSS2021.ParNDSDiv.comm_monoid", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__r", "OPLSS2021.ParNDSDiv.m", "OPLSS2021.ParNDSDiv.Ret", "OPLSS2021.ParNDSDiv.__proj__Mkcomm_monoid__item__star", "OPLSS2021.ParNDSDiv.action", "OPLSS2021.ParNDSDiv.__proj__Mkaction__item__post", "OPLSS2021.ParNDSDiv.A...
[ "recursion" ]
false
true
false
false
false
let rec frame (#s: Type u#s) (#c: comm_monoid s) (#a: Type u#a) (#p: c.r) (#q: (a -> c.r)) (fr: c.r) (f: m a p q) : Dv (m a (p `c.star` fr) (fun x -> (q x) `c.star` fr)) =
match f with | Ret x -> Ret x | Act f k -> Act (frame_action f fr) (fun x -> frame fr (k x)) | Par pre0 post0 m0 pre1 post1 m1 k -> Par (pre0 `c.star` fr) (post0 `c.star` fr) (frame fr m0) pre1 post1 m1 (frame fr k)
false
Hacl.Spec.K256.MathLemmas.fst
Hacl.Spec.K256.MathLemmas.lemma_distr5_pow52
val lemma_distr5_pow52 (a b0 b1 b2 b3 b4:int) : Lemma (a * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) = a * b0 + a * b1 * pow2 52 + a * b2 * pow2 104 + a * b3 * pow2 156 + a * b4 * pow2 208)
val lemma_distr5_pow52 (a b0 b1 b2 b3 b4:int) : Lemma (a * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) = a * b0 + a * b1 * pow2 52 + a * b2 * pow2 104 + a * b3 * pow2 156 + a * b4 * pow2 208)
let lemma_distr5_pow52 a b0 b1 b2 b3 b4 = calc (==) { a * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208); (==) { lemma_distr5 b0 (b1 * pow2 52) (b2 * pow2 104) (b3 * pow2 156) (b4 * pow2 208) a } b0 * a + b1 * pow2 52 * a + b2 * pow2 104 * a + b3 * pow2 156 * a + b4 * pow2 208 * a; ...
{ "file_name": "code/k256/Hacl.Spec.K256.MathLemmas.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 3, "end_line": 199, "start_col": 0, "start_line": 190 }
module Hacl.Spec.K256.MathLemmas open FStar.Mul #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" val lemma_swap_mul3 (a b c:int) : Lemma (a * b * c == a * c * b) let lemma_swap_mul3 a b c = calc (==) { a * b * c; (==) { Math.Lemmas.paren_mul_right a b c } a * (b * c); (==) { Math.Lemmas.swap_mul b c...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "Hacl.Spec.K256.MathLemmas.fst" }
[ { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "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: Prims.int -> b0: Prims.int -> b1: Prims.int -> b2: Prims.int -> b3: Prims.int -> b4: Prims.int -> FStar.Pervasives.Lemma (ensures a * (b0 + b1 * Prims.pow2 52 + b2 * Prims.pow2 104 + b3 * Prims.pow2 156 + b4 * Prims.pow2 208) = a * b0 + (a * b1) * Prims.pow2 52 + (a * b2) * Prims.pow2 104 + (...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.int", "FStar.Calc.calc_finish", "Prims.eq2", "FStar.Mul.op_Star", "Prims.op_Addition", "Prims.pow2", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Hacl.Spec.K256.MathLemmas.lemma_distr5", ...
[]
false
false
true
false
false
let lemma_distr5_pow52 a b0 b1 b2 b3 b4 =
calc ( == ) { a * (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208); ( == ) { lemma_distr5 b0 (b1 * pow2 52) (b2 * pow2 104) (b3 * pow2 156) (b4 * pow2 208) a } b0 * a + (b1 * pow2 52) * a + (b2 * pow2 104) * a + (b3 * pow2 156) * a + (b4 * pow2 208) * a; ( == ) { (lemma_swap_mul3 b1 (pow2 52)...
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.typable_empty_closed
val typable_empty_closed : x:var -> #e:exp -> #t:ty -> rtyping empty e t -> Lemma (ensures (not(appears_free_in x e)))
val typable_empty_closed : x:var -> #e:exp -> #t:ty -> rtyping empty e t -> Lemma (ensures (not(appears_free_in x e)))
let typable_empty_closed x #e #t h = free_in_context x h
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 56, "end_line": 120, "start_col": 0, "start_line": 120 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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: StlcCbvDbPntSubstNoLists.var -> h: StlcCbvDbPntSubstNoLists.rtyping StlcCbvDbPntSubstNoLists.empty e t -> FStar.Pervasives.Lemma (ensures Prims.op_Negation (StlcCbvDbPntSubstNoLists.appears_free_in x e))
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.empty", "StlcCbvDbPntSubstNoLists.free_in_context", "Prims.unit" ]
[]
true
false
true
false
false
let typable_empty_closed x #e #t h =
free_in_context x h
false
Hacl.Bignum25519.fsti
Hacl.Bignum25519.getz
val getz (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 10ul 5ul /\ h0 == h1)
val getz (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 10ul 5ul /\ h0 == h1)
let getz (p:point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 10ul 5ul /\ h0 == h1) = sub p 10ul 5ul
{ "file_name": "code/ed25519/Hacl.Bignum25519.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 18, "end_line": 41, "start_col": 0, "start_line": 38 }
module Hacl.Bignum25519 module ST = FStar.HyperStack.ST open FStar.HyperStack.All open Lib.IntTypes open Lib.Buffer module BSeq = Lib.ByteSequence module S51 = Hacl.Spec.Curve25519.Field51.Definition module F51 = Hacl.Impl.Ed25519.Field51 module SC = Spec.Curve25519 #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" ...
{ "checked_file": "/", "dependencies": [ "Spec.Ed25519.fst.checked", "Spec.Curve25519.fst.checked", "prims.fst.checked", "Lib.IntTypes.fsti.checked", "Lib.ByteSequence.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Finv.fst.checked", "Hacl.Spec.Curve25519.Field51.Def...
[ { "abbrev": true, "full_module": "Spec.Curve25519", "short_module": "SC" }, { "abbrev": true, "full_module": "Hacl.Impl.Ed25519.Field51", "short_module": "F51" }, { "abbrev": true, "full_module": "Hacl.Spec.Curve25519.Field51.Definition", "short_module": "S51" }, { ...
{ "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
p: Hacl.Bignum25519.point -> FStar.HyperStack.ST.Stack Hacl.Bignum25519.felem
FStar.HyperStack.ST.Stack
[]
[]
[ "Hacl.Bignum25519.point", "Lib.Buffer.sub", "Lib.Buffer.MUT", "Lib.IntTypes.uint64", "FStar.UInt32.__uint_to_t", "Lib.Buffer.lbuffer_t", "Hacl.Bignum25519.felem", "FStar.Monotonic.HyperStack.mem", "Lib.Buffer.live", "Prims.l_and", "Prims.eq2", "Lib.Buffer.gsub" ]
[]
false
true
false
false
false
let getz (p: point) : Stack felem (requires fun h -> live h p) (ensures fun h0 f h1 -> f == gsub p 10ul 5ul /\ h0 == h1) =
sub p 10ul 5ul
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.free_in_context
val free_in_context : x:var -> #e:exp -> #g:env -> #t:ty -> h:rtyping g e t -> Lemma (requires True) (ensures (appears_free_in x e ==> Some? (g x))) (decreases h)
val free_in_context : x:var -> #e:exp -> #g:env -> #t:ty -> h:rtyping g e t -> Lemma (requires True) (ensures (appears_free_in x e ==> Some? (g x))) (decreases h)
let rec free_in_context x #e #g #t h = match h with | TyVar x -> () | TyAbs t h1 -> free_in_context (x+1) h1 | TyApp h1 h2 -> free_in_context x h1; free_in_context x h2
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 61, "end_line": 115, "start_col": 0, "start_line": 111 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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: StlcCbvDbPntSubstNoLists.var -> h: StlcCbvDbPntSubstNoLists.rtyping g e t -> FStar.Pervasives.Lemma (ensures StlcCbvDbPntSubstNoLists.appears_free_in x e ==> Some? (g x)) (decreases h)
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "StlcCbvDbPntSubstNoLists.extend", "StlcCbvDbPntSubstNoLists.free_in_context", "Pr...
[ "recursion" ]
false
false
true
false
false
let rec free_in_context x #e #g #t h =
match h with | TyVar x -> () | TyAbs t h1 -> free_in_context (x + 1) h1 | TyApp h1 h2 -> free_in_context x h1; free_in_context x h2
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.appears_free_in
val appears_free_in : x:var -> e:exp -> Tot bool (decreases e)
val appears_free_in : x:var -> e:exp -> Tot bool (decreases e)
let rec appears_free_in x e = match e with | EVar y -> x = y | EApp e1 e2 -> appears_free_in x e1 || appears_free_in x e2 | EAbs _ e1 -> appears_free_in (x+1) e1
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 41, "end_line": 107, "start_col": 0, "start_line": 103 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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: StlcCbvDbPntSubstNoLists.var -> e: StlcCbvDbPntSubstNoLists.exp -> Prims.Tot Prims.bool
Prims.Tot
[ "total", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.exp", "Prims.op_Equality", "Prims.op_BarBar", "StlcCbvDbPntSubstNoLists.appears_free_in", "StlcCbvDbPntSubstNoLists.ty", "Prims.op_Addition", "Prims.bool" ]
[ "recursion" ]
false
false
false
true
false
let rec appears_free_in x e =
match e with | EVar y -> x = y | EApp e1 e2 -> appears_free_in x e1 || appears_free_in x e2 | EAbs _ e1 -> appears_free_in (x + 1) e1
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.typing_extensional
val typing_extensional : #e:exp -> #g:env -> #t:ty -> h:(rtyping g e t) -> g':env{equal g g'} -> Tot (rtyping g' e t)
val typing_extensional : #e:exp -> #g:env -> #t:ty -> h:(rtyping g e t) -> g':env{equal g g'} -> Tot (rtyping g' e t)
let typing_extensional #e #g #t h g' = context_invariance h g'
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 62, "end_line": 144, "start_col": 0, "start_line": 144 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
h: StlcCbvDbPntSubstNoLists.rtyping g e t -> g': StlcCbvDbPntSubstNoLists.env{StlcCbvDbPntSubstNoLists.equal g g'} -> StlcCbvDbPntSubstNoLists.rtyping g' e t
Prims.Tot
[ "total" ]
[]
[ "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.equal", "StlcCbvDbPntSubstNoLists.context_invariance" ]
[]
false
false
false
false
false
let typing_extensional #e #g #t h g' =
context_invariance h g'
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.extend
val extend : env -> var -> ty -> Tot env
val extend : env -> var -> ty -> Tot env
let extend g x t y = if y < x then g y else if y = x then Some t else g (y-1)
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 33, "end_line": 73, "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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
g: StlcCbvDbPntSubstNoLists.env -> x: StlcCbvDbPntSubstNoLists.var -> t: StlcCbvDbPntSubstNoLists.ty -> StlcCbvDbPntSubstNoLists.env
Prims.Tot
[ "total" ]
[]
[ "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.ty", "Prims.op_LessThan", "Prims.bool", "Prims.op_Equality", "FStar.Pervasives.Native.Some", "Prims.op_Subtraction", "FStar.Pervasives.Native.option" ]
[]
false
false
false
true
false
let extend g x t y =
if y < x then g y else if y = x then Some t else g (y - 1)
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.progress
val progress : #e:exp -> #t:ty -> h:rtyping empty e t -> Lemma (requires True) (ensures (is_value e \/ (Some? (step e)))) (decreases h)
val progress : #e:exp -> #t:ty -> h:rtyping empty e t -> Lemma (requires True) (ensures (is_value e \/ (Some? (step e)))) (decreases h)
let rec progress #e #t h = match h with | TyVar _ -> () | TyAbs _ _ -> () | TyApp h1 h2 -> progress h1; progress h2
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 43, "end_line": 100, "start_col": 0, "start_line": 96 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
h: StlcCbvDbPntSubstNoLists.rtyping StlcCbvDbPntSubstNoLists.empty e t -> FStar.Pervasives.Lemma (ensures StlcCbvDbPntSubstNoLists.is_value e \/ Some? (StlcCbvDbPntSubstNoLists.step e)) (decreases h)
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.empty", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.var", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "StlcCbvDbPntSubstNoLists.extend", "StlcCbvDbPnt...
[ "recursion" ]
false
false
true
false
false
let rec progress #e #t h =
match h with | TyVar _ -> () | TyAbs _ _ -> () | TyApp h1 h2 -> progress h1; progress h2
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.context_invariance
val context_invariance : #e:exp -> #g:env -> #t:ty -> h:(rtyping g e t) -> g':env{equalE e g g'} -> Tot (rtyping g' e t) (decreases h)
val context_invariance : #e:exp -> #g:env -> #t:ty -> h:(rtyping g e t) -> g':env{equalE e g g'} -> Tot (rtyping g' e t) (decreases h)
let rec context_invariance #e #g #t h g' = match h with | TyVar x -> TyVar x | TyAbs t_y h1 -> TyAbs t_y (context_invariance h1 (extend g' 0 t_y)) | TyApp h1 h2 -> TyApp (context_invariance h1 g') (context_invariance h2 g')
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 63, "end_line": 139, "start_col": 0, "start_line": 133 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
h: StlcCbvDbPntSubstNoLists.rtyping g e t -> g': StlcCbvDbPntSubstNoLists.env{StlcCbvDbPntSubstNoLists.equalE e g g'} -> Prims.Tot (StlcCbvDbPntSubstNoLists.rtyping g' e t)
Prims.Tot
[ "total", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.equalE", "StlcCbvDbPntSubstNoLists.var", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "StlcCbvDbPntSubstNoLists.TyVar", "StlcCbvDbPnt...
[ "recursion" ]
false
false
false
false
false
let rec context_invariance #e #g #t h g' =
match h with | TyVar x -> TyVar x | TyAbs t_y h1 -> TyAbs t_y (context_invariance h1 (extend g' 0 t_y)) | TyApp h1 h2 -> TyApp (context_invariance h1 g') (context_invariance h2 g')
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.preservation
val preservation : #e:exp -> #t:ty -> h:rtyping empty e t{Some? (step e)} -> Tot (rtyping empty (Some?.v (step e)) t) (decreases e)
val preservation : #e:exp -> #t:ty -> h:rtyping empty e t{Some? (step e)} -> Tot (rtyping empty (Some?.v (step e)) t) (decreases e)
let rec preservation #e #t h = let TyApp #g #e1 #e2 #t11 #t12 h1 h2 = h in if is_value e1 then (if is_value e2 then let TyAbs t_x hbody = h1 in substitution_preserves_typing 0 h2 hbody else TyApp h1 (preservation h2)) //^^^^^^^^^^^^^^^^^ ...
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 36, "end_line": 177, "start_col": 0, "start_line": 169 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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
h: StlcCbvDbPntSubstNoLists.rtyping StlcCbvDbPntSubstNoLists.empty e t {Some? (StlcCbvDbPntSubstNoLists.step e)} -> Prims.Tot (StlcCbvDbPntSubstNoLists.rtyping StlcCbvDbPntSubstNoLists.empty (Some?.v (StlcCbvDbPntSubstNoLists.step e)) t)
Prims.Tot
[ "total", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.empty", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "StlcCbvDbPntSubstNoLists.step", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.TArrow", "StlcCbvDbPn...
[ "recursion" ]
false
false
false
false
false
let rec preservation #e #t h =
let TyApp #g #e1 #e2 #t11 #t12 h1 h2 = h in if is_value e1 then (if is_value e2 then let TyAbs t_x hbody = h1 in substitution_preserves_typing 0 h2 hbody else TyApp h1 (preservation h2)) else TyApp (preservation h1) h2
false
StlcCbvDbPntSubstNoLists.fst
StlcCbvDbPntSubstNoLists.substitution_preserves_typing
val substitution_preserves_typing : x:var -> #e:exp -> #v:exp -> #t_x:ty -> #t:ty -> #g:env -> h1:rtyping empty v t_x -> h2:rtyping (extend g x t_x) e t -> Tot (rtyping g (subst_beta x v e) t) (decreases e)
val substitution_preserves_typing : x:var -> #e:exp -> #v:exp -> #t_x:ty -> #t:ty -> #g:env -> h1:rtyping empty v t_x -> h2:rtyping (extend g x t_x) e t -> Tot (rtyping g (subst_beta x v e) t) (decreases e)
let rec substitution_preserves_typing x #e #v #t_x #t #g h1 h2 = match h2 with | TyVar y -> if x=y then (typable_empty_closed' h1; context_invariance h1 g) else if y<x then context_invariance h2 g else TyVar (y-1) | TyAbs #g' t_y #e' #t' h21 -> (let h21' = typing_extensional h...
{ "file_name": "examples/metatheory/StlcCbvDbPntSubstNoLists.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 48, "end_line": 165, "start_col": 0, "start_line": 151 }
(* 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": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "StlcCbvDbPntSubstNoLists.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: StlcCbvDbPntSubstNoLists.var -> h1: StlcCbvDbPntSubstNoLists.rtyping StlcCbvDbPntSubstNoLists.empty v t_x -> h2: StlcCbvDbPntSubstNoLists.rtyping (StlcCbvDbPntSubstNoLists.extend g x t_x) e t -> Prims.Tot (StlcCbvDbPntSubstNoLists.rtyping g (StlcCbvDbPntSubstNoLists.subst_beta x v e) t)
Prims.Tot
[ "total", "" ]
[]
[ "StlcCbvDbPntSubstNoLists.var", "StlcCbvDbPntSubstNoLists.exp", "StlcCbvDbPntSubstNoLists.ty", "StlcCbvDbPntSubstNoLists.env", "StlcCbvDbPntSubstNoLists.rtyping", "StlcCbvDbPntSubstNoLists.empty", "StlcCbvDbPntSubstNoLists.extend", "Prims.b2t", "FStar.Pervasives.Native.uu___is_Some", "Prims.op_Equ...
[ "recursion" ]
false
false
false
false
false
let rec substitution_preserves_typing x #e #v #t_x #t #g h1 h2 =
match h2 with | TyVar y -> if x = y then (typable_empty_closed' h1; context_invariance h1 g) else if y < x then context_invariance h2 g else TyVar (y - 1) | TyAbs #g' t_y #e' #t' h21 -> (let h21' = typing_extensional h21 (extend (extend g 0 t_y) (x + 1) t_x) in TyAbs t_y (substitution_preserves_ty...
false
Lib.LoopCombinators.fsti
Lib.LoopCombinators.fixed_i
val fixed_i : f: _ -> i: Prims.nat -> _
let fixed_i f (i:nat) = f
{ "file_name": "lib/Lib.LoopCombinators.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 25, "end_line": 156, "start_col": 0, "start_line": 156 }
module Lib.LoopCombinators (** * fold_left-like loop combinator: * [ repeat_left lo hi a f acc == f (hi - 1) .. ... (f (lo + 1) (f lo acc)) ] * * e.g. [ repeat_left 0 3 (fun _ -> list int) Cons [] == [2;1;0] ] * * It satisfies * [ repeat_left lo hi (fun _ -> a) f acc == fold_left (flip f) acc [lo..hi-1] ] * * A simple...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.All.fst.checked" ], "interface_file": false, "source_file": "Lib.LoopCombinators.fsti" }
[ { "abbrev": false, "full_module": "Lib", "short_module": null }, { "abbrev": false, "full_module": "Lib", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "shor...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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: _ -> i: Prims.nat -> _
Prims.Tot
[ "total" ]
[]
[ "Prims.nat" ]
[]
false
false
false
true
false
let fixed_i f (i: nat) =
f
false
Lib.LoopCombinators.fsti
Lib.LoopCombinators.fixed_a
val fixed_a : a: Type -> i: Prims.nat -> Type
let fixed_a (a:Type) (i:nat) = a
{ "file_name": "lib/Lib.LoopCombinators.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 32, "end_line": 154, "start_col": 0, "start_line": 154 }
module Lib.LoopCombinators (** * fold_left-like loop combinator: * [ repeat_left lo hi a f acc == f (hi - 1) .. ... (f (lo + 1) (f lo acc)) ] * * e.g. [ repeat_left 0 3 (fun _ -> list int) Cons [] == [2;1;0] ] * * It satisfies * [ repeat_left lo hi (fun _ -> a) f acc == fold_left (flip f) acc [lo..hi-1] ] * * A simple...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.All.fst.checked" ], "interface_file": false, "source_file": "Lib.LoopCombinators.fsti" }
[ { "abbrev": false, "full_module": "Lib", "short_module": null }, { "abbrev": false, "full_module": "Lib", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "shor...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "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 -> i: Prims.nat -> Type
Prims.Tot
[ "total" ]
[]
[ "Prims.nat" ]
[]
false
false
false
true
true
let fixed_a (a: Type) (i: nat) =
a
false
HandleSmtGoal.fst
HandleSmtGoal.tac
val tac: Prims.unit -> Tac unit
val tac: Prims.unit -> Tac unit
let tac () : Tac unit = dump "now"
{ "file_name": "examples/tactics/HandleSmtGoal.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 12, "end_line": 7, "start_col": 0, "start_line": 6 }
module HandleSmtGoal open FStar.Tactics.V2
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "HandleSmtGoal.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit
FStar.Tactics.Effect.Tac
[]
[]
[ "Prims.unit", "FStar.Stubs.Tactics.V2.Builtins.dump" ]
[]
false
true
false
false
false
let tac () : Tac unit =
dump "now"
false
HandleSmtGoal.fst
HandleSmtGoal.tac2
val tac2: Prims.unit -> Tac unit
val tac2: Prims.unit -> Tac unit
let tac2 () : Tac unit = apply_lemma (`test_lemma)
{ "file_name": "examples/tactics/HandleSmtGoal.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 27, "end_line": 21, "start_col": 0, "start_line": 20 }
module HandleSmtGoal open FStar.Tactics.V2 [@@ handle_smt_goals] let tac () : Tac unit = dump "now" let f (x:int) : Pure unit (requires x == 2) (ensures fun _ -> True) = assert (x == 2); () (* A bogus lemma, used only to obtain a simple goal that will not be solvable if handle_smt_goal does not trigger. It...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "HandleSmtGoal.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit
FStar.Tactics.Effect.Tac
[]
[]
[ "Prims.unit", "FStar.Tactics.V2.Derived.apply_lemma" ]
[]
false
true
false
false
false
let tac2 () : Tac unit =
apply_lemma (`test_lemma)
false
HandleSmtGoal.fst
HandleSmtGoal.f
val f (x: int) : Pure unit (requires x == 2) (ensures fun _ -> True)
val f (x: int) : Pure unit (requires x == 2) (ensures fun _ -> True)
let f (x:int) : Pure unit (requires x == 2) (ensures fun _ -> True) = assert (x == 2); ()
{ "file_name": "examples/tactics/HandleSmtGoal.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 4, "end_line": 11, "start_col": 0, "start_line": 9 }
module HandleSmtGoal open FStar.Tactics.V2 [@@ handle_smt_goals] let tac () : Tac unit = dump "now"
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "HandleSmtGoal.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: Prims.int -> Prims.Pure Prims.unit
Prims.Pure
[]
[]
[ "Prims.int", "Prims.unit", "Prims._assert", "Prims.eq2", "Prims.l_True" ]
[]
false
false
false
false
false
let f (x: int) : Pure unit (requires x == 2) (ensures fun _ -> True) =
assert (x == 2); ()
false
HandleSmtGoal.fst
HandleSmtGoal.g
val g: Prims.unit -> Tot unit
val g: Prims.unit -> Tot unit
let g () : Tot unit = assert (False)
{ "file_name": "examples/tactics/HandleSmtGoal.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 16, "end_line": 24, "start_col": 0, "start_line": 23 }
module HandleSmtGoal open FStar.Tactics.V2 [@@ handle_smt_goals] let tac () : Tac unit = dump "now" let f (x:int) : Pure unit (requires x == 2) (ensures fun _ -> True) = assert (x == 2); () (* A bogus lemma, used only to obtain a simple goal that will not be solvable if handle_smt_goal does not trigger. It...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": false, "source_file": "HandleSmtGoal.fst" }
[ { "abbrev": false, "full_module": "FStar.Tactics.V2", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> Prims.unit
Prims.Tot
[ "total" ]
[]
[ "Prims.unit", "Prims._assert", "Prims.l_False" ]
[]
false
false
false
true
false
let g () : Tot unit =
assert (False)
false
TaskPool.fst
TaskPool.extract
val extract (#p:pool) (#a:Type0) (#post : a -> vprop) (th : task_handle p a post) : stt a (handle_solved th) (fun x -> post x)
val extract (#p:pool) (#a:Type0) (#post : a -> vprop) (th : task_handle p a post) : stt a (handle_solved th) (fun x -> post x)
let extract = __extract
{ "file_name": "share/steel/examples/pulse/parix/TaskPool.fst", "git_rev": "f984200f79bdc452374ae994a5ca837496476c41", "git_url": "https://github.com/FStarLang/steel.git", "project_name": "steel" }
{ "end_col": 23, "end_line": 65, "start_col": 0, "start_line": 65 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "Pulse.Lib.SpinLock.fsti.checked", "Pulse.Lib.Pervasives.fst.checked", "Pulse.Lib.Par.Pledge.fsti.checked", "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "TaskPool....
[ { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "Pulse.Lib.Par.Pledge", "short_module": null }, { "abbrev": false, "full_module": "Pulse.Lib.SpinLock", "short_module": null }, { "abbrev": false, "fu...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
th: TaskPool.task_handle p a post -> Pulse.Lib.Core.stt a (TaskPool.handle_solved th) (fun x -> post x)
Prims.Tot
[ "total" ]
[]
[ "TaskPool.__extract" ]
[]
false
false
false
false
false
let extract =
__extract
false
TaskPool.fst
TaskPool.join
val join (#p:pool) (#a:Type0) (#post : a -> vprop) (th : task_handle p a post) : stt a (joinable th) (fun x -> post x)
val join (#p:pool) (#a:Type0) (#post : a -> vprop) (th : task_handle p a post) : stt a (joinable th) (fun x -> post x)
let join = __join
{ "file_name": "share/steel/examples/pulse/parix/TaskPool.fst", "git_rev": "f984200f79bdc452374ae994a5ca837496476c41", "git_url": "https://github.com/FStarLang/steel.git", "project_name": "steel" }
{ "end_col": 17, "end_line": 84, "start_col": 0, "start_line": 84 }
(* Copyright 2023 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the 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": [ "Pulse.Lib.SpinLock.fsti.checked", "Pulse.Lib.Pervasives.fst.checked", "Pulse.Lib.Par.Pledge.fsti.checked", "prims.fst.checked", "FStar.Tactics.V2.fst.checked", "FStar.Pervasives.fsti.checked" ], "interface_file": true, "source_file": "TaskPool....
[ { "abbrev": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "Pulse.Lib.Par.Pledge", "short_module": null }, { "abbrev": false, "full_module": "Pulse.Lib.SpinLock", "short_module": null }, { "abbrev": false, "fu...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
th: TaskPool.task_handle p a post -> Pulse.Lib.Core.stt a (TaskPool.joinable th) (fun x -> post x)
Prims.Tot
[ "total" ]
[]
[ "TaskPool.__join" ]
[]
false
false
false
false
false
let join =
__join
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint8_t
val uint8_t : Prims.eqtype
let uint8_t = UInt8.t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 21, "end_line": 18, "start_col": 0, "start_line": 18 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.eqtype
Prims.Tot
[ "total" ]
[]
[ "FStar.UInt8.t" ]
[]
false
false
false
true
false
let uint8_t =
UInt8.t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint32_t
val uint32_t : Prims.eqtype
let uint32_t = UInt32.t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 23, "end_line": 22, "start_col": 0, "start_line": 22 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.eqtype
Prims.Tot
[ "total" ]
[]
[ "FStar.UInt32.t" ]
[]
false
false
false
true
false
let uint32_t =
UInt32.t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint16_t
val uint16_t : Prims.eqtype
let uint16_t = UInt16.t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 23, "end_line": 20, "start_col": 0, "start_line": 20 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.eqtype
Prims.Tot
[ "total" ]
[]
[ "FStar.UInt16.t" ]
[]
false
false
false
true
false
let uint16_t =
UInt16.t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint64_t
val uint64_t : Prims.eqtype
let uint64_t = UInt64.t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 23, "end_line": 24, "start_col": 0, "start_line": 24 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.eqtype
Prims.Tot
[ "total" ]
[]
[ "FStar.UInt64.t" ]
[]
false
false
false
true
false
let uint64_t =
UInt64.t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint8_p
val uint8_p : Type0
let uint8_p = B.buffer uint8_t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 30, "end_line": 27, "start_col": 0, "start_line": 27 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "LowStar.Buffer.buffer", "EverCrypt.Helpers.uint8_t" ]
[]
false
false
false
true
true
let uint8_p =
B.buffer uint8_t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint64_p
val uint64_p : Type0
let uint64_p = B.buffer uint64_t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 32, "end_line": 33, "start_col": 0, "start_line": 33 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "LowStar.Buffer.buffer", "EverCrypt.Helpers.uint64_t" ]
[]
false
false
false
true
true
let uint64_p =
B.buffer uint64_t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint16_p
val uint16_p : Type0
let uint16_p = B.buffer uint16_t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 32, "end_line": 29, "start_col": 0, "start_line": 29 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "LowStar.Buffer.buffer", "EverCrypt.Helpers.uint16_t" ]
[]
false
false
false
true
true
let uint16_p =
B.buffer uint16_t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint32_p
val uint32_p : Type0
let uint32_p = B.buffer uint32_t
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 32, "end_line": 31, "start_col": 0, "start_line": 31 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "LowStar.Buffer.buffer", "EverCrypt.Helpers.uint32_t" ]
[]
false
false
false
true
true
let uint32_p =
B.buffer uint32_t
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint8_l
val uint8_l : p: EverCrypt.Helpers.uint8_p -> Type0
let uint8_l (p:uint8_p) = l:UInt32.t {B.length p = UInt32.v l}
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 62, "end_line": 38, "start_col": 0, "start_line": 38 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: EverCrypt.Helpers.uint8_p -> Type0
Prims.Tot
[ "total" ]
[]
[ "EverCrypt.Helpers.uint8_p", "FStar.UInt32.t", "Prims.b2t", "Prims.op_Equality", "Prims.int", "Prims.l_or", "Prims.op_GreaterThanOrEqual", "FStar.UInt.size", "FStar.UInt32.n", "LowStar.Monotonic.Buffer.length", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.v" ...
[]
false
false
false
true
true
let uint8_l (p: uint8_p) =
l: UInt32.t{B.length p = UInt32.v l}
false
EverCrypt.Helpers.fsti
EverCrypt.Helpers.uint8_pl
val uint8_pl : l: Prims.nat -> Type0
let uint8_pl (l:nat) = p:uint8_p {B.length p = l}
{ "file_name": "providers/evercrypt/EverCrypt.Helpers.fsti", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 49, "end_line": 36, "start_col": 0, "start_line": 36 }
module EverCrypt.Helpers module B = LowStar.Buffer open FStar.HyperStack.ST /// Small helpers inline_for_extraction noextract let (!$) = C.String.((!$)) /// For the time being, we do not write any specifications and just try to reach /// agreement on calling conventions. A series of convenient type abbreviations //...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt8.fsti.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.UInt16.fsti.checked", "FStar.Pervasives.fsti.checked", "FStar.HyperStack.ST.fsti.checked", "C.S...
[ { "abbrev": false, "full_module": "FStar.HyperStack.ST", "short_module": null }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": false, "full_module": "EverCrypt", "short_module": null }, { "abbrev": false, "full_module": ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
l: Prims.nat -> Type0
Prims.Tot
[ "total" ]
[]
[ "Prims.nat", "EverCrypt.Helpers.uint8_p", "Prims.b2t", "Prims.op_Equality", "LowStar.Monotonic.Buffer.length", "EverCrypt.Helpers.uint8_t", "LowStar.Buffer.trivial_preorder" ]
[]
false
false
false
true
true
let uint8_pl (l: nat) =
p: uint8_p{B.length p = l}
false
Problem01.fst
Problem01.remove_elem_from_list
val remove_elem_from_list: p:list nat -> i:nat{i < length p} -> Tot (list nat)
val remove_elem_from_list: p:list nat -> i:nat{i < length p} -> Tot (list nat)
let rec remove_elem_from_list p i = match p with | a::q -> if i = 0 then q else a::remove_elem_from_list q (i-1)
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 65, "end_line": 30, "start_col": 0, "start_line": 28 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> i: Prims.nat{i < FStar.List.Tot.Base.length p} -> Prims.list Prims.nat
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "Prims.op_Equality", "Prims.int", "Prims.bool", "Prims.Cons", "Problem01.remove_elem_from_list", "Prims.op_Subtraction" ]
[ "recursion" ]
false
false
false
false
false
let rec remove_elem_from_list p i =
match p with | a :: q -> if i = 0 then q else a :: remove_elem_from_list q (i - 1)
false
Problem01.fst
Problem01.prefix
val prefix: p:list nat -> str:list nat -> Tot (b:bool{ b <==> (exists l. append p l = str)})
val prefix: p:list nat -> str:list nat -> Tot (b:bool{ b <==> (exists l. append p l = str)})
let rec prefix p str = match p, str with | [], _ -> true | a::q, [] -> false | a::q, a'::q' -> if a = a' then prefix q q' else false
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 57, "end_line": 25, "start_col": 0, "start_line": 21 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> str: Prims.list Prims.nat -> b: Prims.bool{b <==> (exists (l: Prims.list Prims.nat). p @ l = str)}
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Prims.nat", "FStar.Pervasives.Native.Mktuple2", "Prims.op_Equality", "Problem01.prefix", "Prims.bool", "Prims.l_iff", "Prims.b2t", "Prims.l_Exists", "FStar.List.Tot.Base.append" ]
[ "recursion" ]
false
false
false
false
false
let rec prefix p str =
match p, str with | [], _ -> true | a :: q, [] -> false | a :: q, a' :: q' -> if a = a' then prefix q q' else false
false
Hacl.Spec.K256.MathLemmas.fst
Hacl.Spec.K256.MathLemmas.lemma_distr5_pow52_sub
val lemma_distr5_pow52_sub (a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 c:int) : Lemma ((b0 * c - a0) + (b1 * c - a1) * pow2 52 + (b2 * c - a2) * pow2 104 + (b3 * c - a3) * pow2 156 + (b4 * c - a4) * pow2 208 == (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) * c - (a0 + a1 * pow2 52 + a2 * pow2 104 + ...
val lemma_distr5_pow52_sub (a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 c:int) : Lemma ((b0 * c - a0) + (b1 * c - a1) * pow2 52 + (b2 * c - a2) * pow2 104 + (b3 * c - a3) * pow2 156 + (b4 * c - a4) * pow2 208 == (b0 + b1 * pow2 52 + b2 * pow2 104 + b3 * pow2 156 + b4 * pow2 208) * c - (a0 + a1 * pow2 52 + a2 * pow2 104 + ...
let lemma_distr5_pow52_sub a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 c = calc (==) { (b0 * c - a0) + (b1 * c - a1) * pow2 52 + (b2 * c - a2) * pow2 104 + (b3 * c - a3) * pow2 156 + (b4 * c - a4) * pow2 208; (==) { Math.Lemmas.distributivity_sub_left (b1 * c) a1 (pow2 52) } c * b0 - a0 + c * b1 * pow2 52 - a1 * po...
{ "file_name": "code/k256/Hacl.Spec.K256.MathLemmas.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 3, "end_line": 251, "start_col": 0, "start_line": 232 }
module Hacl.Spec.K256.MathLemmas open FStar.Mul #set-options "--z3rlimit 50 --fuel 0 --ifuel 0" val lemma_swap_mul3 (a b c:int) : Lemma (a * b * c == a * c * b) let lemma_swap_mul3 a b c = calc (==) { a * b * c; (==) { Math.Lemmas.paren_mul_right a b c } a * (b * c); (==) { Math.Lemmas.swap_mul b c...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Math.Lemmas.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "Hacl.Spec.K256.MathLemmas.fst" }
[ { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "Hacl.Spec.K256", "short_module": null }, { "abbrev": false, "full_module": "FS...
{ "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
a0: Prims.int -> a1: Prims.int -> a2: Prims.int -> a3: Prims.int -> a4: Prims.int -> b0: Prims.int -> b1: Prims.int -> b2: Prims.int -> b3: Prims.int -> b4: Prims.int -> c: Prims.int -> FStar.Pervasives.Lemma (ensures b0 * c - a0 + (b1 * c - a1) * Prims.pow2 52 +...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.int", "FStar.Calc.calc_finish", "Prims.eq2", "Prims.op_Addition", "Prims.op_Subtraction", "FStar.Mul.op_Star", "Prims.pow2", "Prims.Cons", "FStar.Preorder.relation", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "FStar.Math.Lemm...
[]
false
false
true
false
false
let lemma_distr5_pow52_sub a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 c =
calc ( == ) { (b0 * c - a0) + (b1 * c - a1) * pow2 52 + (b2 * c - a2) * pow2 104 + (b3 * c - a3) * pow2 156 + (b4 * c - a4) * pow2 208; ( == ) { Math.Lemmas.distributivity_sub_left (b1 * c) a1 (pow2 52) } c * b0 - a0 + (c * b1) * pow2 52 - a1 * pow2 52 + (b2 * c - a2) * pow2 104 + (b3 * c - a3) * pow2 156 + ...
false
CQueue.LList.fst
CQueue.LList.elim_cllist
val elim_cllist (#opened: _) (#a: Type0) (c: cllist_ptrvalue a) : SteelAtomic (cllist_lvalue a) opened (cllist c) (fun c' -> vptr (cllist_head c') `star` vptr (cllist_tail c')) (fun _ -> True) (fun h c' h' -> cllist_ptrvalue_is_null c == false /\ (c' <: cllist_ptrvalue a) == c /\ ...
val elim_cllist (#opened: _) (#a: Type0) (c: cllist_ptrvalue a) : SteelAtomic (cllist_lvalue a) opened (cllist c) (fun c' -> vptr (cllist_head c') `star` vptr (cllist_tail c')) (fun _ -> True) (fun h c' h' -> cllist_ptrvalue_is_null c == false /\ (c' <: cllist_ptrvalue a) == c /\ ...
let elim_cllist #opened #a c = let c2 = elim_cllist_ghost c in let c : cllist_lvalue a = c in change_equal_slprop (vptr (cllist_head c2)) (vptr (cllist_head c)); change_equal_slprop (vptr (cllist_tail c2)) (vptr (cllist_tail c)); return 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": 10, "end_line": 125, "start_col": 0, "start_line": 118 }
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.SteelAtomic (CQueue.LList.cllist_lvalue a)
Steel.Effect.Atomic.SteelAtomic
[]
[]
[ "Steel.Memory.inames", "CQueue.LList.cllist_ptrvalue", "Steel.Effect.Atomic.return", "CQueue.LList.cllist_lvalue", "Steel.Effect.Common.VStar", "Steel.Reference.vptrp", "CQueue.Cell.ccell_ptrvalue", "CQueue.LList.cllist_head", "Steel.FractionalPermission.full_perm", "Steel.Reference.ref", "CQueu...
[]
false
true
false
false
false
let elim_cllist #opened #a c =
let c2 = elim_cllist_ghost c in let c:cllist_lvalue a = c in change_equal_slprop (vptr (cllist_head c2)) (vptr (cllist_head c)); change_equal_slprop (vptr (cllist_tail c2)) (vptr (cllist_tail c)); return c
false
Problem01.fst
Problem01.test_relaxed_prefix
val test_relaxed_prefix: p:list nat -> str:list nat -> Tot (b:bool{b <==> (b2t (prefix p str) \/ (exists (i:nat). i < length p && prefix (remove_elem_from_list p i) str))})
val test_relaxed_prefix: p:list nat -> str:list nat -> Tot (b:bool{b <==> (b2t (prefix p str) \/ (exists (i:nat). i < length p && prefix (remove_elem_from_list p i) str))})
let test_relaxed_prefix p str = prefix p str || (if length p > 0 then test_prefix p (length p - 1) str else false)
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 84, "end_line": 57, "start_col": 0, "start_line": 56 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> str: Prims.list Prims.nat -> b: Prims.bool { b <==> Problem01.prefix p str \/ (exists (i: Prims.nat). i < FStar.List.Tot.Base.length p && Problem01.prefix (Problem01.remove_elem_from_list p i) str) }
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Prims.nat", "Prims.op_BarBar", "Problem01.prefix", "Prims.op_GreaterThan", "FStar.List.Tot.Base.length", "Problem01.test_prefix", "Prims.op_Subtraction", "Prims.bool", "Prims.l_iff", "Prims.b2t", "Prims.l_or", "Prims.l_Exists", "Prims.op_AmpAmp", "Prims.op_LessThan", "Pr...
[]
false
false
false
false
false
let test_relaxed_prefix p str =
prefix p str || (if length p > 0 then test_prefix p (length p - 1) str else false)
false
Problem01.fst
Problem01.test_prefix_iff
val test_prefix_iff (p: list nat) (n: nat{n < length p}) (str: list nat) : Lemma (test_prefix p n str <==> (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) [SMTPat (test_prefix p n str)]
val test_prefix_iff (p: list nat) (n: nat{n < length p}) (str: list nat) : Lemma (test_prefix p n str <==> (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) [SMTPat (test_prefix p n str)]
let test_prefix_iff (p:list nat) (n:nat{n < length p}) (str:list nat) : Lemma (test_prefix p n str <==> (exists (i:nat). i <= n && prefix (remove_elem_from_list p i) str)) [SMTPat (test_prefix p n str)] = Classical.impl_intro (test_prefix_exists_to_b p n str)
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 58, "end_line": 51, "start_col": 0, "start_line": 48 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> n: Prims.nat{n < FStar.List.Tot.Base.length p} -> str: Prims.list Prims.nat -> FStar.Pervasives.Lemma (ensures Problem01.test_prefix p n str <==> (exists (i: Prims.nat). i <= n && Problem01.prefix (Problem01.remove_elem_from_list p i) str )) [SMTPa...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "FStar.Classical.impl_intro", "Prims.squash", "Prims.l_Exists", "Prims.op_AmpAmp", "Prims.op_LessThanOrEqual", "Problem01.prefix", "Problem01.remove_elem_from_list", "Problem01.test_prefix", "Problem...
[]
false
false
true
false
false
let test_prefix_iff (p: list nat) (n: nat{n < length p}) (str: list nat) : Lemma (test_prefix p n str <==> (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) [SMTPat (test_prefix p n str)] =
Classical.impl_intro (test_prefix_exists_to_b p n str)
false
Problem01.fst
Problem01.test_prefix_exists_to_b
val test_prefix_exists_to_b (p: list nat) (n: nat{n < length p}) (str: list nat) (h: squash (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) : Lemma (test_prefix p n str)
val test_prefix_exists_to_b (p: list nat) (n: nat{n < length p}) (str: list nat) (h: squash (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) : Lemma (test_prefix p n str)
let test_prefix_exists_to_b (p:list nat) (n:nat{n < length p}) (str:list nat) (h:squash (exists (i:nat). i <= n && prefix (remove_elem_from_list p i) str)) : Lemma (test_prefix p n str) = let goal n = test_prefix p n str in let rec aux (n:nat{n < length p}) (i:nat{i <= n /\ prefix (remove_elem_from_list p i) ...
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 44, "end_line": 46, "start_col": 0, "start_line": 39 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> n: Prims.nat{n < FStar.List.Tot.Base.length p} -> str: Prims.list Prims.nat -> h: Prims.squash (exists (i: Prims.nat). i <= n && Problem01.prefix (Problem01.remove_elem_from_list p i) str) -> FStar.Pervasives.Lemma (ensures Problem01.test_prefix p n str)
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "Prims.squash", "Prims.l_Exists", "Prims.op_AmpAmp", "Prims.op_LessThanOrEqual", "Problem01.prefix", "Problem01.remove_elem_from_list", "FStar.Classical.exists_elim", "Prims.l_and", "Prims.op_Greater...
[]
false
false
true
false
false
let test_prefix_exists_to_b (p: list nat) (n: nat{n < length p}) (str: list nat) (h: squash (exists (i: nat). i <= n && prefix (remove_elem_from_list p i) str)) : Lemma (test_prefix p n str) =
let goal n = test_prefix p n str in let rec aux (n: nat{n < length p}) (i: nat{i <= n /\ prefix (remove_elem_from_list p i) str}) : GTot (squash (goal n)) = if n > i then aux (n - 1) i in Classical.exists_elim (goal n) h (aux n)
false
Vale.AES.PPC64LE.GCTR.fst
Vale.AES.PPC64LE.GCTR.va_qcode_Gctr_blocks128_6way_body
val va_qcode_Gctr_blocks128_6way_body (va_mods: va_mods_t) (alg: algorithm) (in_b out_b: buffer128) (old_icb: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_b: buffer128) (plain_quads: (seq quad32)) : (va_quickCode unit (va_code_Gctr_blocks128_6way_body a...
val va_qcode_Gctr_blocks128_6way_body (va_mods: va_mods_t) (alg: algorithm) (in_b out_b: buffer128) (old_icb: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_b: buffer128) (plain_quads: (seq quad32)) : (va_quickCode unit (va_code_Gctr_blocks128_6way_body a...
let va_qcode_Gctr_blocks128_6way_body (va_mods:va_mods_t) (alg:algorithm) (in_b:buffer128) (out_b:buffer128) (old_icb:quad32) (key:(seq nat32)) (round_keys:(seq quad32)) (keys_b:buffer128) (plain_quads:(seq quad32)) : (va_quickCode unit (va_code_Gctr_blocks128_6way_body alg)) = (qblock va_mods (fun (va_s:va_state...
{ "file_name": "obj/Vale.AES.PPC64LE.GCTR.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 59, "end_line": 1591, "start_col": 0, "start_line": 1424 }
module Vale.AES.PPC64LE.GCTR open Vale.Def.Prop_s open Vale.Def.Opaque_s open Vale.Def.Words_s open Vale.Def.Types_s open Vale.Arch.Types open Vale.Arch.HeapImpl open FStar.Seq open Vale.AES.AES_BE_s open Vale.AES.PPC64LE.AES open Vale.AES.GCTR_BE_s open Vale.AES.GCTR_BE open Vale.AES.GCM_helpers_BE open Vale.Poly1305....
{ "checked_file": "/", "dependencies": [ "Vale.PPC64LE.State.fsti.checked", "Vale.PPC64LE.QuickCodes.fsti.checked", "Vale.PPC64LE.QuickCode.fst.checked", "Vale.PPC64LE.Memory.fsti.checked", "Vale.PPC64LE.Machine_s.fst.checked", "Vale.PPC64LE.InsVector.fsti.checked", "Vale.PPC64LE.InsStac...
[ { "abbrev": false, "full_module": "Vale.Lib.Basic", "short_module": null }, { "abbrev": false, "full_module": "Vale.AES.Types_helpers", "short_module": null }, { "abbrev": false, "full_module": "Vale.PPC64LE.QuickCodes", "short_module": null }, { "abbrev": false, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> alg: Vale.AES.AES_common_s.algorithm -> in_b: Vale.PPC64LE.Memory.buffer128 -> out_b: Vale.PPC64LE.Memory.buffer128 -> old_icb: Vale.PPC64LE.Memory.quad32 -> key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 -> round_keys: FStar.Seq.Base.seq Vale...
Prims.Tot
[ "total" ]
[]
[ "Vale.PPC64LE.QuickCode.va_mods_t", "Vale.AES.AES_common_s.algorithm", "Vale.PPC64LE.Memory.buffer128", "Vale.PPC64LE.Memory.quad32", "FStar.Seq.Base.seq", "Vale.PPC64LE.Memory.nat32", "Vale.PPC64LE.QuickCodes.qblock", "Prims.unit", "Prims.Cons", "Vale.PPC64LE.Decls.va_code", "Vale.PPC64LE.Machi...
[]
false
false
false
false
false
let va_qcode_Gctr_blocks128_6way_body (va_mods: va_mods_t) (alg: algorithm) (in_b out_b: buffer128) (old_icb: quad32) (key: (seq nat32)) (round_keys: (seq quad32)) (keys_b: buffer128) (plain_quads: (seq quad32)) : (va_quickCode unit (va_code_Gctr_blocks128_6way_body a...
(qblock va_mods (fun (va_s: va_state) -> let va_old_s:va_state = va_s in va_qAssertSquash va_range1 "***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 383 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GCTR.vaf *****" ...
false
Problem01.fst
Problem01.test_prefix
val test_prefix: p:list nat -> n:nat{n < length p} -> str:list nat -> Tot (b:bool{b ==> (exists (i:nat). i <= n /\ prefix (remove_elem_from_list p i) str)})
val test_prefix: p:list nat -> n:nat{n < length p} -> str:list nat -> Tot (b:bool{b ==> (exists (i:nat). i <= n /\ prefix (remove_elem_from_list p i) str)})
let rec test_prefix p n str = match n with | 0 -> prefix (remove_elem_from_list p n) str | n -> prefix (remove_elem_from_list p n) str || test_prefix p (n - 1) str
{ "file_name": "examples/verifythis/2015/Problem01.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 76, "end_line": 37, "start_col": 0, "start_line": 34 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.fst.checked", "FStar.Classical.fsti.checked" ], "interface_file": false, "source_file": "Problem01.fst" }
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FSta...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Prims.list Prims.nat -> n: Prims.nat{n < FStar.List.Tot.Base.length p} -> str: Prims.list Prims.nat -> b: Prims.bool { b ==> (exists (i: Prims.nat). i <= n /\ Problem01.prefix (Problem01.remove_elem_from_list p i) str ) }
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Prims.nat", "Prims.b2t", "Prims.op_LessThan", "FStar.List.Tot.Base.length", "Problem01.prefix", "Problem01.remove_elem_from_list", "Prims.int", "Prims.op_BarBar", "Problem01.test_prefix", "Prims.op_Subtraction", "Prims.bool", "Prims.l_imp", "Prims.l_Exists", "Prims.l_and",...
[ "recursion" ]
false
false
false
false
false
let rec test_prefix p n str =
match n with | 0 -> prefix (remove_elem_from_list p n) str | n -> prefix (remove_elem_from_list p n) str || test_prefix p (n - 1) str
false
FStar.OrdMapProps.fst
FStar.OrdMapProps.fold
val fold: #k:eqtype -> #v:Type -> #a:Type -> #f:cmp k -> (k -> v -> a -> Tot a) -> m:ordmap k v f -> a -> Tot a (decreases (size m))
val fold: #k:eqtype -> #v:Type -> #a:Type -> #f:cmp k -> (k -> v -> a -> Tot a) -> m:ordmap k v f -> a -> Tot a (decreases (size m))
let rec fold #k #v #t #f g m a = if size m = 0 then a else let Some (k, v) = choose m in fold g (remove k m) (g k v a)
{ "file_name": "ulib/experimental/FStar.OrdMapProps.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 33, "end_line": 26, "start_col": 0, "start_line": 22 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.OrdMap.fsti.checked" ], "interface_file": false, "source_file": "FStar.OrdMapProps.fst" }
[ { "abbrev": false, "full_module": "FStar.OrdMap", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null }, { "abbrev": false, "full_module": "FStar", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives"...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
g: (_: k -> _: v -> _: a -> a) -> m: FStar.OrdMap.ordmap k v f -> a: a -> Prims.Tot a
Prims.Tot
[ "total", "" ]
[]
[ "Prims.eqtype", "FStar.OrdMap.cmp", "FStar.OrdMap.ordmap", "Prims.op_Equality", "Prims.int", "FStar.OrdMap.size", "Prims.bool", "FStar.OrdMapProps.fold", "FStar.OrdMap.remove", "FStar.Pervasives.Native.option", "FStar.Pervasives.Native.tuple2", "FStar.OrdMap.choose" ]
[ "recursion" ]
false
false
false
false
false
let rec fold #k #v #t #f g m a =
if size m = 0 then a else let Some (k, v) = choose m in fold g (remove k m) (g k v a)
false
LowParse.Low.DepLen.fst
LowParse.Low.DepLen.valid_deplen_decomp
val valid_deplen_decomp : min: Prims.nat -> max: Prims.nat{min <= max /\ max < 4294967296} -> hp: LowParse.Spec.Base.parser hk ht -> dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) -> pp: LowParse.Spec.Base.parser pk pt -> input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32....
let valid_deplen_decomp (min: nat) (max: nat { min <= max /\ max < 4294967296 } ) (#hk: parser_kind) (#ht: Type) (hp: parser hk ht) (dlf: ht -> Tot (bounded_int32 min max) ) (#pk: parser_kind) (#pt: Type) (pp: parser pk pt) #rrel #rel (input: slice rrel rel) (pos: U32.t) (h: HS.mem) = valid hp...
{ "file_name": "src/lowparse/LowParse.Low.DepLen.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 67, "end_line": 60, "start_col": 0, "start_line": 42 }
module LowParse.Low.DepLen include LowParse.Spec.DepLen include LowParse.Low.Base include LowParse.Low.Combinators module B = LowStar.Monotonic.Buffer module U32 = FStar.UInt32 module HS = FStar.HyperStack module HST = FStar.HyperStack.ST module Cast = FStar.Int.Cast module U64 = FStar.UInt64 let valid_exact_valid_p...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Monotonic.Buffer.fsti.checked", "LowParse.Spec.DepLen.fst.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervas...
[ { "abbrev": true, "full_module": "FStar.UInt64", "short_module": "U64" }, { "abbrev": true, "full_module": "FStar.Int.Cast", "short_module": "Cast" }, { "abbrev": true, "full_module": "FStar.HyperStack.ST", "short_module": "HST" }, { "abbrev": true, "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
min: Prims.nat -> max: Prims.nat{min <= max /\ max < 4294967296} -> hp: LowParse.Spec.Base.parser hk ht -> dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) -> pp: LowParse.Spec.Base.parser pk pt -> input: LowParse.Slice.slice rrel rel -> pos: FStar.UInt32.t -> h: FStar.Mon...
Prims.GTot
[ "sometrivial" ]
[]
[ "Prims.nat", "Prims.l_and", "Prims.b2t", "Prims.op_LessThanOrEqual", "Prims.op_LessThan", "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "LowParse.Spec.BoundedInt.bounded_int32", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "FStar.Mo...
[]
false
false
false
false
true
let valid_deplen_decomp (min: nat) (max: nat{min <= max /\ max < 4294967296}) (#hk: parser_kind) (#ht: Type) (hp: parser hk ht) (dlf: (ht -> Tot (bounded_int32 min max))) (#pk: parser_kind) (#pt: Type) (pp: parser pk pt) #rrel #rel (input: slice rr...
valid hp h input pos /\ (let pos_payload = get_valid_pos hp h input pos in let len = dlf (contents hp h input pos) in U32.v pos_payload + U32.v len <= U32.v input.len /\ valid_exact pp h input pos_payload (pos_payload `U32.add` len))
false
LowParse.Low.DepLen.fst
LowParse.Low.DepLen.valid_exact_valid_pos_equiv
val valid_exact_valid_pos_equiv (#k: parser_kind) (#t: Type) (p: parser k t) (h: HS.mem) (#rrel #rel: _) (input: slice rrel rel) (pos_begin pos_end: U32.t) : Lemma (requires live_slice h input) (ensures ((valid_exact p h input pos_begin pos_end) <==> ...
val valid_exact_valid_pos_equiv (#k: parser_kind) (#t: Type) (p: parser k t) (h: HS.mem) (#rrel #rel: _) (input: slice rrel rel) (pos_begin pos_end: U32.t) : Lemma (requires live_slice h input) (ensures ((valid_exact p h input pos_begin pos_end) <==> ...
let valid_exact_valid_pos_equiv (#k: parser_kind) (#t: Type) (p: parser k t) (h: HS.mem) #rrel #rel (input: slice rrel rel) (pos_begin: U32.t) (pos_end: U32.t) : Lemma (requires live_slice h input) (ensures ((valid_exact p h input pos_begin pos_end) <==> (U32.v pos_begin <= U32.v pos_end...
{ "file_name": "src/lowparse/LowParse.Low.DepLen.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 5, "end_line": 37, "start_col": 0, "start_line": 14 }
module LowParse.Low.DepLen include LowParse.Spec.DepLen include LowParse.Low.Base include LowParse.Low.Combinators module B = LowStar.Monotonic.Buffer module U32 = FStar.UInt32 module HS = FStar.HyperStack module HST = FStar.HyperStack.ST module Cast = FStar.Int.Cast module U64 = FStar.UInt64
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Monotonic.Buffer.fsti.checked", "LowParse.Spec.DepLen.fst.checked", "LowParse.Low.Combinators.fsti.checked", "LowParse.Low.Base.fst.checked", "FStar.UInt64.fsti.checked", "FStar.UInt32.fsti.checked", "FStar.Pervas...
[ { "abbrev": true, "full_module": "FStar.UInt64", "short_module": "U64" }, { "abbrev": true, "full_module": "FStar.Int.Cast", "short_module": "Cast" }, { "abbrev": true, "full_module": "FStar.HyperStack.ST", "short_module": "HST" }, { "abbrev": true, "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
p: LowParse.Spec.Base.parser k t -> h: FStar.Monotonic.HyperStack.mem -> input: LowParse.Slice.slice rrel rel -> pos_begin: FStar.UInt32.t -> pos_end: FStar.UInt32.t -> FStar.Pervasives.Lemma (requires LowParse.Slice.live_slice h input) (ensures LowParse.Low.Base.Spec.valid_exact p ...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "LowParse.Spec.Base.parser_kind", "LowParse.Spec.Base.parser", "FStar.Monotonic.HyperStack.mem", "LowParse.Slice.srel", "LowParse.Bytes.byte", "LowParse.Slice.slice", "FStar.UInt32.t", "Prims.op_AmpAmp", "Prims.op_LessThanOrEqual", "FStar.UInt32.v", "LowParse.Slice.__proj__Mkslice__item__len", ...
[]
false
false
true
false
false
let valid_exact_valid_pos_equiv (#k: parser_kind) (#t: Type) (p: parser k t) (h: HS.mem) #rrel #rel (input: slice rrel rel) (pos_begin: U32.t) (pos_end: U32.t) : Lemma (requires live_slice h input) (ensures ((valid_exact p h input pos_begin pos_end...
valid_exact_equiv p h input pos_begin pos_end; if U32.v pos_begin <= U32.v pos_end && U32.v pos_end <= U32.v input.len then let input' = { base = input.base; len = pos_end } in valid_facts p h input' pos_begin
false
Steel.Effect.Common.fsti
Steel.Effect.Common.true_p
val true_p:prop
val true_p:prop
let true_p : prop = True
{ "file_name": "lib/steel/Steel.Effect.Common.fsti", "git_rev": "f984200f79bdc452374ae994a5ca837496476c41", "git_url": "https://github.com/FStarLang/steel.git", "project_name": "steel" }
{ "end_col": 24, "end_line": 42, "start_col": 0, "start_line": 42 }
(* 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.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.FunctionalExtensionality", "short_module": "FExt" }, { "abbrev": true, "full_module": "Steel.Memory", "short_module": "Mem" }, { "abbrev": false, "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.prop
Prims.Tot
[ "total" ]
[]
[ "Prims.l_True" ]
[]
false
false
false
true
true
let true_p:prop =
True
false
Steel.Effect.Common.fsti
Steel.Effect.Common.selector'
val selector' : a: Type0 -> hp: Steel.Memory.slprop -> Type
let selector' (a:Type0) (hp:slprop) = hmem hp -> GTot a
{ "file_name": "lib/steel/Steel.Effect.Common.fsti", "git_rev": "f984200f79bdc452374ae994a5ca837496476c41", "git_url": "https://github.com/FStarLang/steel.git", "project_name": "steel" }
{ "end_col": 55, "end_line": 61, "start_col": 0, "start_line": 61 }
(* 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": true, "full_module": "FStar.Tactics.V2", "short_module": "T" }, { "abbrev": false, "full_module": "FStar.Ghost", "short_module": null }, { "abbrev": true, "full_module": "FStar.FunctionalExtensionality", "short_module": "FExt" }, { "abbrev": true, ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Type0 -> hp: Steel.Memory.slprop -> Type
Prims.Tot
[ "total" ]
[]
[ "Steel.Memory.slprop", "Steel.Memory.hmem" ]
[]
false
false
false
true
true
let selector' (a: Type0) (hp: slprop) =
hmem hp -> GTot a
false