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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.OrdSet.fst | FStar.OrdSet.all_means_not_any_not | val all_means_not_any_not (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (all s c = not (any s (inv c))) | val all_means_not_any_not (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (all s c = not (any s (inv c))) | let all_means_not_any_not #a #f s c = simple_induction (fun p -> all p c = not (any p (inv c))) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 97,
"end_line": 530,
"start_col": 0,
"start_line": 530
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.all s c = Prims.op_Negation (FStar.OrdSet.any s (FStar.OrdSet.inv c))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"FStar.OrdSet.simple_induction",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.OrdSet.all",
"Prims.op_Negation",
"FStar.OrdSet.any",
"FStar.OrdSet.inv",
"Prims.unit"
] | [] | false | false | true | false | false | let all_means_not_any_not #a #f s c =
| simple_induction (fun p -> all p c = not (any p (inv c))) s | false |
FStar.OrdSet.fst | FStar.OrdSet.find_first_is_some_iff_any | val find_first_is_some_iff_any (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Lemma (Some? (find_first s c) = any s c) | val find_first_is_some_iff_any (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Lemma (Some? (find_first s c) = any s c) | let find_first_is_some_iff_any #_ #_ s c = simple_induction (fun p -> Some? (find_first p c) = any p c) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 105,
"end_line": 536,
"start_col": 0,
"start_line": 536
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma (ensures Some? (FStar.OrdSet.find_first s c) = FStar.OrdSet.any s c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"FStar.OrdSet.simple_induction",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.OrdSet.find_first",
"FStar.OrdSet.any",
"Prims.unit"
] | [] | false | false | true | false | false | let find_first_is_some_iff_any #_ #_ s c =
| simple_induction (fun p -> Some? (find_first p c) = any p c) s | false |
FStar.OrdSet.fst | FStar.OrdSet.liat_size | val liat_size (#a:eqtype) (#f:cmp a) (s:ordset a f{s<>empty})
: Lemma (size (liat s) = ((size s)-1)) | val liat_size (#a:eqtype) (#f:cmp a) (s:ordset a f{s<>empty})
: Lemma (size (liat s) = ((size s)-1)) | let liat_size #a #f (s:ordset a f{s<>[]}) : Lemma (size (liat s) = size s - 1) =
base_induction (fun p -> if p<>[] then size (liat p) = size p - 1 else true) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 80,
"end_line": 543,
"start_col": 0,
"start_line": 542
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f {s <> FStar.OrdSet.empty}
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.size (FStar.OrdSet.liat s) = FStar.OrdSet.size s - 1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.list",
"Prims.Nil",
"FStar.OrdSet.base_induction",
"Prims.op_Equality",
"Prims.int",
"FStar.OrdSet.size",
"FStar.OrdSet.liat",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit",
"Pri... | [] | false | false | true | false | false | let liat_size #a #f (s: ordset a f {s <> []}) : Lemma (size (liat s) = size s - 1) =
| base_induction (fun p -> if p <> [] then size (liat p) = size p - 1 else true) s | false |
FStar.OrdSet.fst | FStar.OrdSet.find_last | val find_last (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a) : (z:option a{ match z with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x:a{mem x s && c x}). f x v))
}) | val find_last (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a) : (z:option a{ match z with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x:a{mem x s && c x}). f x v))
}) | let find_last #a #f s c =
find_last_props s c;
find_last' s c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 572,
"start_col": 0,
"start_line": 570
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> z:
FStar.Pervasives.Native.option a
{ (match z with
| FStar.Pervasives.Native.None #_ -> Prims.op_Negation (FStar.OrdSet.any s c)
| FStar.Pervasives.Native.Some #_ v ->
FStar.OrdSet.any s c /\ (forall (x: a{FStar.Or... | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"FStar.OrdSet.find_last'",
"Prims.unit",
"FStar.OrdSet.find_last_props",
"FStar.Pervasives.Native.option",
"Prims.b2t",
"Prims.op_Negation",
"FStar.OrdSet.any",
"Prims.l_and",
"Prims.l_Forall",
"Prims.op_A... | [] | false | false | false | false | false | let find_last #a #f s c =
| find_last_props s c;
find_last' s c | false |
FStar.OrdSet.fst | FStar.OrdSet.find_last_props | val find_last_props (#a #f: _) (s: ordset a f) (c: condition a)
: Lemma
(ensures
(match find_last' s c with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x: a{mem x s && c x}). f x v)))) (decreases size s) | val find_last_props (#a #f: _) (s: ordset a f) (c: condition a)
: Lemma
(ensures
(match find_last' s c with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x: a{mem x s && c x}). f x v)))) (decreases size s) | let rec find_last_props #a #f (s:ordset a f) (c: condition a)
: Lemma (ensures (match find_last' s c with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x:a{mem x s && c x}). f x v))))
(decreases size s) =
if size s > 0 then let liat,last = unsnoc s in
liat_size s; ... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 568,
"start_col": 0,
"start_line": 560
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma
(ensures
((match FStar.OrdSet.find_last' s c with
| FStar.Pervasives.Native.None #_ -> Prims.op_Negation (FStar.OrdSet.any s c)
| FStar.Pervasives.Native.Some #_ v ->
FStar.OrdSet.an... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.op_GreaterThan",
"FStar.OrdSet.size",
"FStar.OrdSet.any_if_mem",
"Prims.bool",
"FStar.OrdSet.any_liat",
"Prims.unit",
"FStar.OrdSet.find_last_props",
"FStar.OrdSet.liat_size",
"FStar.Pervasives.Native... | [
"recursion"
] | false | false | true | false | false | let rec find_last_props #a #f (s: ordset a f) (c: condition a)
: Lemma
(ensures
(match find_last' s c with
| None -> not (any s c)
| Some v -> (any s c /\ (forall (x: a{mem x s && c x}). f x v)))) (decreases size s) =
| if size s > 0
then
let liat, last = unsnoc s in
liat_size s;
find_last_props liat c;
if c last then any_if_mem s c last else any_liat s c | false |
FStar.OrdSet.fst | FStar.OrdSet.union_mem_forall | val union_mem_forall (#a #f: _) (s1 s2: ordset a f)
: Lemma (forall x. (mem x (union s1 s2)) = (mem x s1 || mem x s2)) | val union_mem_forall (#a #f: _) (s1 s2: ordset a f)
: Lemma (forall x. (mem x (union s1 s2)) = (mem x s1 || mem x s2)) | let union_mem_forall #a #f (s1 s2: ordset a f)
: Lemma (forall x. (mem x (union s1 s2)) = (mem x s1 || mem x s2)) =
let aux x : Lemma (mem x (union s1 s2) = (mem x s1 || mem x s2)) =
mem_union s1 s2 x in Classical.forall_intro aux | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 610,
"start_col": 0,
"start_line": 607
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.OrdSet.mem x (FStar.OrdSet.union s1 s2) =
(FStar.OrdSet.mem x s1 || FStar.OrdSet.mem x s2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Classical.forall_intro",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.OrdSet.mem",
"FStar.OrdSet.union",
"Prims.op_BarBar",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
... | [] | false | false | true | false | false | let union_mem_forall #a #f (s1: ordset a f) (s2: ordset a f)
: Lemma (forall x. (mem x (union s1 s2)) = (mem x s1 || mem x s2)) =
| let aux x : Lemma (mem x (union s1 s2) = (mem x s1 || mem x s2)) = mem_union s1 s2 x in
Classical.forall_intro aux | false |
FStar.OrdSet.fst | FStar.OrdSet.find_first_precedes_any_other | val find_first_precedes_any_other (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a) (x:a{mem x s && c x})
: Lemma (Some? (find_first s c) && f (Some?.v (find_first s c)) x) | val find_first_precedes_any_other (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a) (x:a{mem x s && c x})
: Lemma (Some? (find_first s c) && f (Some?.v (find_first s c)) x) | let rec find_first_precedes_any_other #a #f s c x =
if head s<>x then find_first_precedes_any_other (tail s) c x;
set_props s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 540,
"start_col": 0,
"start_line": 538
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a -> x: a{FStar.OrdSet.mem x s && c x}
-> FStar.Pervasives.Lemma
(ensures Some? (FStar.OrdSet.find_first s c) && f (Some?.v (FStar.OrdSet.find_first s c)) x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.b2t",
"Prims.op_AmpAmp",
"FStar.OrdSet.mem",
"FStar.OrdSet.set_props",
"Prims.unit",
"Prims.op_disEquality",
"FStar.OrdSet.head",
"FStar.OrdSet.find_first_precedes_any_other",
"FStar.OrdSet.tail",
"... | [
"recursion"
] | false | false | true | false | false | let rec find_first_precedes_any_other #a #f s c x =
| if head s <> x then find_first_precedes_any_other (tail s) c x;
set_props s | false |
FStar.OrdSet.fst | FStar.OrdSet.find_last' | val find_last' (#a #f: _) (s: ordset a f) (c: condition a) : Tot (option a) (decreases size s) | val find_last' (#a #f: _) (s: ordset a f) (c: condition a) : Tot (option a) (decreases size s) | let rec find_last' #a #f (s: ordset a f) (c: condition a) : Tot (option a) (decreases size s) =
if s=empty then None
else let liat,last = unsnoc s in
liat_size s;
if c last then Some last
else find_last' liat c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 558,
"start_col": 0,
"start_line": 553
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> Prims.Tot (FStar.Pervasives.Native.option a) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.op_Equality",
"FStar.OrdSet.empty",
"FStar.Pervasives.Native.None",
"Prims.bool",
"FStar.Pervasives.Native.Some",
"FStar.OrdSet.find_last'",
"FStar.Pervasives.Native.option",
"Prims.unit",
"FStar.OrdS... | [
"recursion"
] | false | false | false | false | false | let rec find_last' #a #f (s: ordset a f) (c: condition a) : Tot (option a) (decreases size s) =
| if s = empty
then None
else
let liat, last = unsnoc s in
liat_size s;
if c last then Some last else find_last' liat c | false |
FStar.OrdSet.fst | FStar.OrdSet.find_last_is_some_iff_any | val find_last_is_some_iff_any (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Lemma (Some? (find_last s c) = any s c) | val find_last_is_some_iff_any (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Lemma (Some? (find_last s c) = any s c) | let find_last_is_some_iff_any #a #f s c = find_last_props s c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 574,
"start_col": 0,
"start_line": 574
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma (ensures Some? (FStar.OrdSet.find_last s c) = FStar.OrdSet.any s c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"FStar.OrdSet.find_last_props",
"Prims.unit"
] | [] | true | false | true | false | false | let find_last_is_some_iff_any #a #f s c =
| find_last_props s c | false |
FStar.OrdSet.fst | FStar.OrdSet.find_last_follows_any_other | val find_last_follows_any_other (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a) (x:a{mem x s && c x})
: Lemma (Some? (find_last s c) && f x (Some?.v (find_last s c))) | val find_last_follows_any_other (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a) (x:a{mem x s && c x})
: Lemma (Some? (find_last s c) && f x (Some?.v (find_last s c))) | let find_last_follows_any_other #a #f s c x =
any_if_mem s c x;
find_last_is_some_iff_any s c;
find_last_props s c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 579,
"start_col": 0,
"start_line": 576
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a -> x: a{FStar.OrdSet.mem x s && c x}
-> FStar.Pervasives.Lemma
(ensures Some? (FStar.OrdSet.find_last s c) && f x (Some?.v (FStar.OrdSet.find_last s c))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.b2t",
"Prims.op_AmpAmp",
"FStar.OrdSet.mem",
"FStar.OrdSet.find_last_props",
"Prims.unit",
"FStar.OrdSet.find_last_is_some_iff_any",
"FStar.OrdSet.any_if_mem"
] | [] | true | false | true | false | false | let find_last_follows_any_other #a #f s c x =
| any_if_mem s c x;
find_last_is_some_iff_any s c;
find_last_props s c | false |
FStar.OrdSet.fst | FStar.OrdSet.union_with_empty | val union_with_empty (#a #f: _) (s: ordset a f) : Lemma (union s empty = s) | val union_with_empty (#a #f: _) (s: ordset a f) : Lemma (union s empty = s) | let union_with_empty #a #f (s: ordset a f)
: Lemma (union s empty = s) = eq_lemma (union s empty) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 613,
"start_col": 0,
"start_line": 612
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (ensures FStar.OrdSet.union s FStar.OrdSet.empty = s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.union",
"FStar.OrdSet.empty",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Prims.op_Equality",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let union_with_empty #a #f (s: ordset a f) : Lemma (union s empty = s) =
| eq_lemma (union s empty) s | false |
FStar.OrdSet.fst | FStar.OrdSet.size_of_intersect | val size_of_intersect (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (ensures size (intersect s1 s2) = count s1 (mem_of s2) /\
size (intersect s1 s2) = count s2 (mem_of s1)) | val size_of_intersect (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (ensures size (intersect s1 s2) = count s1 (mem_of s2) /\
size (intersect s1 s2) = count s2 (mem_of s1)) | let size_of_intersect #_ #_ s1 s2 =
intersect_eq_where s1 s2;
intersect_eq_where s2 s1;
intersect_is_symmetric s1 s2;
count_is_size_of_where s1 (mem_of s2);
count_is_size_of_where s2 (mem_of s1) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 605,
"start_col": 0,
"start_line": 600
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.size (FStar.OrdSet.intersect s1 s2) =
FStar.OrdSet.count s1 (FStar.OrdSet.mem_of s2) /\
FStar.OrdSet.size (FStar.OrdSet.intersect s1 s2) =
FStar.OrdSet.count s2 (FStar.OrdSet.mem_of s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.count_is_size_of_where",
"FStar.OrdSet.mem_of",
"Prims.unit",
"FStar.OrdSet.intersect_is_symmetric",
"FStar.OrdSet.intersect_eq_where"
] | [] | true | false | true | false | false | let size_of_intersect #_ #_ s1 s2 =
| intersect_eq_where s1 s2;
intersect_eq_where s2 s1;
intersect_is_symmetric s1 s2;
count_is_size_of_where s1 (mem_of s2);
count_is_size_of_where s2 (mem_of s1) | false |
FStar.OrdSet.fst | FStar.OrdSet.intersect_eq_where | val intersect_eq_where (#a:eqtype) (#f:cmp a) (s1 s2:ordset a f)
: Lemma (intersect s1 s2 = where s1 (mem_of s2)) | val intersect_eq_where (#a:eqtype) (#f:cmp a) (s1 s2:ordset a f)
: Lemma (intersect s1 s2 = where s1 (mem_of s2)) | let intersect_eq_where #_ #_ s1 s2 =
same_members_means_eq (where s1 (mem_of s2)) (intersect s1 s2) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 592,
"start_col": 0,
"start_line": 591
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.intersect s1 s2 = FStar.OrdSet.where s1 (FStar.OrdSet.mem_of s2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.where",
"FStar.OrdSet.mem_of",
"FStar.OrdSet.intersect",
"Prims.unit"
] | [] | true | false | true | false | false | let intersect_eq_where #_ #_ s1 s2 =
| same_members_means_eq (where s1 (mem_of s2)) (intersect s1 s2) | false |
FStar.OrdSet.fst | FStar.OrdSet.count_is_size_of_where | val count_is_size_of_where (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (count s c = size (where s c)) | val count_is_size_of_where (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (count s c = size (where s c)) | let count_is_size_of_where #_ #_ s c
= simple_induction (fun p -> count p c = size (where p c)) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 598,
"start_col": 0,
"start_line": 597
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.count s c = FStar.OrdSet.size (FStar.OrdSet.where s c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"FStar.OrdSet.simple_induction",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.OrdSet.count",
"FStar.OrdSet.size",
"FStar.OrdSet.where",
"Prims.unit"
] | [] | false | false | true | false | false | let count_is_size_of_where #_ #_ s c =
| simple_induction (fun p -> count p c = size (where p c)) s | false |
FStar.OrdSet.fst | FStar.OrdSet.any_liat | val any_liat (#a:eqtype) (#f:cmp a) (s:ordset a f{s<>empty}) (c:condition a)
: Lemma (any s c = (any (liat s) c || c (last s))) | val any_liat (#a:eqtype) (#f:cmp a) (s:ordset a f{s<>empty}) (c:condition a)
: Lemma (any s c = (any (liat s) c || c (last s))) | let rec any_liat #a #f (s:ordset a f{s<>[]}) (c: condition a)
: Lemma (any s c = (any (liat s) c || c (last s))) = match s with
| [x] -> ()
| h::(t:ordset a f) -> if size t > 0 then any_liat t c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 551,
"start_col": 0,
"start_line": 548
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f {s <> FStar.OrdSet.empty} -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.any s c = (FStar.OrdSet.any (FStar.OrdSet.liat s) c || c (FStar.OrdSet.last s))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.b2t",
"Prims.op_disEquality",
"Prims.list",
"Prims.Nil",
"FStar.OrdSet.condition",
"Prims.op_GreaterThan",
"FStar.OrdSet.size",
"FStar.OrdSet.any_liat",
"Prims.bool",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.... | [
"recursion"
] | false | false | true | false | false | let rec any_liat #a #f (s: ordset a f {s <> []}) (c: condition a)
: Lemma (any s c = (any (liat s) c || c (last s))) =
| match s with
| [x] -> ()
| h :: (t: ordset a f) -> if size t > 0 then any_liat t c | false |
FStar.OrdSet.fst | FStar.OrdSet.minus_eq_where | val minus_eq_where (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (minus s1 s2 = where s1 (inv (mem_of s2))) | val minus_eq_where (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (minus s1 s2 = where s1 (inv (mem_of s2))) | let minus_eq_where #_ #_ s1 s2 =
same_members_means_eq (where s1 (inv (mem_of s2))) (minus s1 s2) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 595,
"start_col": 0,
"start_line": 594
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.minus s1 s2 = FStar.OrdSet.where s1 (FStar.OrdSet.inv (FStar.OrdSet.mem_of s2))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.where",
"FStar.OrdSet.inv",
"FStar.OrdSet.mem_of",
"FStar.OrdSet.minus",
"Prims.unit"
] | [] | true | false | true | false | false | let minus_eq_where #_ #_ s1 s2 =
| same_members_means_eq (where s1 (inv (mem_of s2))) (minus s1 s2) | false |
FStar.OrdSet.fst | FStar.OrdSet.union_sort_lemma | val union_sort_lemma (#a: eqtype) (#f: _) (h: a) (t1 t2: ordset a f)
: Lemma (requires sorted f (h :: t1) /\ sorted f (h :: t2))
(ensures sorted f (h :: (union t1 t2))) | val union_sort_lemma (#a: eqtype) (#f: _) (h: a) (t1 t2: ordset a f)
: Lemma (requires sorted f (h :: t1) /\ sorted f (h :: t2))
(ensures sorted f (h :: (union t1 t2))) | let union_sort_lemma (#a:eqtype) #f (h:a) (t1 t2: ordset a f)
: Lemma (requires sorted f (h::t1) /\ sorted f (h::t2))
(ensures sorted f (h::(union t1 t2))) =
if size t1 = 0 then union_with_empty t2
else if size t2 = 0 then union_with_empty t1
else begin
union_mem_forall t1 t2;
set_props t1;... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 642,
"start_col": 0,
"start_line": 632
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: a -> t1: FStar.OrdSet.ordset a f -> t2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires FStar.OrdSet.sorted f (h :: t1) /\ FStar.OrdSet.sorted f (h :: t2))
(ensures FStar.OrdSet.sorted f (h :: FStar.OrdSet.union t1 t2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.op_Equality",
"Prims.int",
"FStar.OrdSet.size",
"FStar.OrdSet.union_with_empty",
"Prims.bool",
"FStar.OrdSet.set_props",
"FStar.OrdSet.union",
"Prims.unit",
"FStar.OrdSet.union_mem_forall",
"Prims.l_and",
"Prims.b2t",
"FSt... | [] | false | false | true | false | false | let union_sort_lemma (#a: eqtype) #f (h: a) (t1: ordset a f) (t2: ordset a f)
: Lemma (requires sorted f (h :: t1) /\ sorted f (h :: t2))
(ensures sorted f (h :: (union t1 t2))) =
| if size t1 = 0
then union_with_empty t2
else
if size t2 = 0
then union_with_empty t1
else
(union_mem_forall t1 t2;
set_props t1;
set_props t2;
set_props (union t1 t2)) | false |
FStar.OrdSet.fst | FStar.OrdSet.union_with_prefix | val union_with_prefix (#a: eqtype) (#f: _) (h: a) (t1 t2: (z: ordset a f {sorted f (h :: z)}))
: Lemma (union #a #f (h :: t1) (h :: t2) = h :: (union t1 t2)) | val union_with_prefix (#a: eqtype) (#f: _) (h: a) (t1 t2: (z: ordset a f {sorted f (h :: z)}))
: Lemma (union #a #f (h :: t1) (h :: t2) = h :: (union t1 t2)) | let union_with_prefix (#a:eqtype) #f (h:a) (t1 t2: (z:ordset a f{sorted f (h::z)}))
: Lemma (union #a #f (h::t1) (h::t2) = h::(union t1 t2)) =
union_mem_forall t1 t2;
union_sort_lemma h t1 t2;
same_members_means_eq (union #a #f (h::t1) (h::t2)) (h::(union t1 t2)) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 648,
"start_col": 0,
"start_line": 644
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: a ->
t1: z: FStar.OrdSet.ordset a f {FStar.OrdSet.sorted f (h :: z)} ->
t2: z: FStar.OrdSet.ordset a f {FStar.OrdSet.sorted f (h :: z)}
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.union (h :: t1) (h :: t2) = h :: FStar.OrdSet.union t1 t2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.b2t",
"FStar.OrdSet.sorted",
"Prims.Cons",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.union",
"Prims.unit",
"FStar.OrdSet.union_sort_lemma",
"FStar.OrdSet.union_mem_forall",
"Prims.l_True",
"Prims.squash",
"Prims.op... | [] | true | false | true | false | false | let union_with_prefix
(#a: eqtype)
#f
(h: a)
(t1: (z: ordset a f {sorted f (h :: z)}))
(t2: (z: ordset a f {sorted f (h :: z)}))
: Lemma (union #a #f (h :: t1) (h :: t2) = h :: (union t1 t2)) =
| union_mem_forall t1 t2;
union_sort_lemma h t1 t2;
same_members_means_eq (union #a #f (h :: t1) (h :: t2)) (h :: (union t1 t2)) | false |
FStar.OrdSet.fst | FStar.OrdSet.count_dichotomy | val count_dichotomy (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (size s = count s c + count s (inv c)) | val count_dichotomy (#a:eqtype) (#f:cmp a) (s: ordset a f) (c: condition a)
: Lemma (size s = count s c + count s (inv c)) | let rec count_dichotomy #_ #_ s c = if s<>[] then count_dichotomy (tail s) c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 76,
"end_line": 691,
"start_col": 0,
"start_line": 691
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.size s = FStar.OrdSet.count s c + FStar.OrdSet.count s (FStar.OrdSet.inv c)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.op_disEquality",
"Prims.list",
"Prims.Nil",
"FStar.OrdSet.count_dichotomy",
"FStar.OrdSet.tail",
"Prims.bool",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec count_dichotomy #_ #_ s c =
| if s <> [] then count_dichotomy (tail s) c | false |
FStar.OrdSet.fst | FStar.OrdSet.union_is_symmetric | val union_is_symmetric (#a #f: _) (s1 s2: ordset a f) : Lemma (union s1 s2 = union s2 s1) | val union_is_symmetric (#a #f: _) (s1 s2: ordset a f) : Lemma (union s1 s2 = union s2 s1) | let union_is_symmetric #a #f (s1 s2: ordset a f) : Lemma (union s1 s2 = union s2 s1) =
same_members_means_eq (union s1 s2) (union s2 s1) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 660,
"start_col": 0,
"start_line": 659
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (ensures FStar.OrdSet.union s1 s2 = FStar.OrdSet.union s2 s1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.union",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Prims.op_Equality",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let union_is_symmetric #a #f (s1: ordset a f) (s2: ordset a f) : Lemma (union s1 s2 = union s2 s1) =
| same_members_means_eq (union s1 s2) (union s2 s1) | false |
FStar.OrdSet.fst | FStar.OrdSet.size_of_minus | val size_of_minus (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (size (minus s1 s2) = size s1 - size (intersect s1 s2)) | val size_of_minus (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (size (minus s1 s2) = size s1 - size (intersect s1 s2)) | let size_of_minus #_ #_ s1 s2 =
minus_eq_where s1 s2;
intersect_eq_where s1 s2;
count_dichotomy s1 (mem_of s2);
count_is_size_of_where s1 (mem_of s2);
count_is_size_of_where s1 (inv (mem_of s2)) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 698,
"start_col": 0,
"start_line": 693
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.size (FStar.OrdSet.minus s1 s2) =
FStar.OrdSet.size s1 - FStar.OrdSet.size (FStar.OrdSet.intersect s1 s2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.count_is_size_of_where",
"FStar.OrdSet.inv",
"FStar.OrdSet.mem_of",
"Prims.unit",
"FStar.OrdSet.count_dichotomy",
"FStar.OrdSet.intersect_eq_where",
"FStar.OrdSet.minus_eq_where"
] | [] | true | false | true | false | false | let size_of_minus #_ #_ s1 s2 =
| minus_eq_where s1 s2;
intersect_eq_where s1 s2;
count_dichotomy s1 (mem_of s2);
count_is_size_of_where s1 (mem_of s2);
count_is_size_of_where s1 (inv (mem_of s2)) | false |
FStar.OrdSet.fst | FStar.OrdSet.union_head_lemma | val union_head_lemma (#a #f: _) (s1 s2: ordset a f)
: Lemma
(match s1, s2 with
| [], [] -> (union s1 s2 = [])
| [], h :: t -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h :: t, [] -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h1 :: t1, h2 :: t2 ->
size (un... | val union_head_lemma (#a #f: _) (s1 s2: ordset a f)
: Lemma
(match s1, s2 with
| [], [] -> (union s1 s2 = [])
| [], h :: t -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h :: t, [] -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h1 :: t1, h2 :: t2 ->
size (un... | let union_head_lemma #a #f (s1 s2: ordset a f)
: Lemma (match s1, s2 with
| [],[] -> (union s1 s2 = [])
| [],h::t -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h::t,[] -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h1::t1, h2::t2 -> size (union s1 s2... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 630,
"start_col": 0,
"start_line": 615
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
((match s1, s2 with
| FStar.Pervasives.Native.Mktuple2 #_ #_ (Prims.Nil #_) (Prims.Nil #_) ->
FStar.OrdSet.union s1 s2 = []
| FStar.Pervasives.Native.Mktuple2 #_ #_ (Prims.Nil #_) (P... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Pervasives.Native.Mktuple2",
"Prims.list",
"FStar.OrdSet.union_with_empty",
"FStar.OrdSet.set_props",
"FStar.OrdSet.union",
"Prims.unit",
"FStar.OrdSet.union_mem_forall",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Prims.o... | [] | false | false | true | false | false | let union_head_lemma #a #f (s1: ordset a f) (s2: ordset a f)
: Lemma
(match s1, s2 with
| [], [] -> (union s1 s2 = [])
| [], h :: t -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h :: t, [] -> size (union s1 s2) > 0 && Cons?.hd (union s1 s2) = h
| h1 :: t1, h2 :: t2 ->
... | match s1, s2 with
| [], [] -> ()
| [], h :: t -> ()
| h :: t, [] -> union_with_empty s1
| h1 :: t1, h2 :: t2 ->
union_mem_forall s1 s2;
set_props s1;
set_props s2;
set_props (union s1 s2) | false |
FStar.OrdSet.fst | FStar.OrdSet.where | val where (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Pure (ordset a f)
(requires True)
(ensures fun (z:ordset a f) ->
(as_list #a z == FStar.List.Tot.Base.filter c (as_list s)) /\
(forall x. mem x z = (mem x s && c x)) /\
(if size z > 0 ... | val where (#a:eqtype) (#f:cmp a) (s:ordset a f) (c: condition a)
: Pure (ordset a f)
(requires True)
(ensures fun (z:ordset a f) ->
(as_list #a z == FStar.List.Tot.Base.filter c (as_list s)) /\
(forall x. mem x z = (mem x s && c x)) /\
(if size z > 0 ... | let rec where #a #f s c =
match s with
| [] -> []
| h::[] -> if c h then [h] else []
| h::(t:ordset a f) -> if c h then h::(where t c) else where t c | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 589,
"start_col": 0,
"start_line": 585
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> c: FStar.OrdSet.condition a -> Prims.Pure (FStar.OrdSet.ordset a f) | Prims.Pure | [] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.condition",
"Prims.Nil",
"Prims.Cons",
"Prims.bool",
"Prims.list",
"FStar.OrdSet.where"
] | [
"recursion"
] | false | false | false | false | false | let rec where #a #f s c =
| match s with
| [] -> []
| h :: [] -> if c h then [h] else []
| h :: (t: ordset a f) -> if c h then h :: (where t c) else where t c | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_strict_subset_minus_size | val lemma_strict_subset_minus_size (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f) (s:ordset a f)
: Lemma (requires (strict_subset s1 s2 /\ subset s1 s /\ subset s2 s))
(ensures (size (minus s s2) < size (minus s s1)))
[SMTPat (strict_subset s1 s2); SMTPat (subset s1 s); SMTPat (subset s2 s)] | val lemma_strict_subset_minus_size (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f) (s:ordset a f)
: Lemma (requires (strict_subset s1 s2 /\ subset s1 s /\ subset s2 s))
(ensures (size (minus s s2) < size (minus s s1)))
[SMTPat (strict_subset s1 s2); SMTPat (subset s1 s); SMTPat (subset s2 s)] | let lemma_strict_subset_minus_size #_ #_ s1 s2 s =
let size_diff : pos = size s2 - size s1 in
size_of_minus s s2;
size_of_minus s s1;
intersect_with_subset s2 s;
intersect_is_symmetric s2 s;
intersect_with_subset s1 s;
intersect_is_symmetric s1 s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 709,
"start_col": 0,
"start_line": 702
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> s: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires
FStar.OrdSet.strict_subset s1 s2 /\ FStar.OrdSet.subset s1 s /\ FStar.OrdSet.subset s2 s)
(ensures
FStar.OrdSet.size (FStar.OrdSet.minus s s2) < FStar.OrdSet.size (F... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.intersect_is_symmetric",
"Prims.unit",
"FStar.OrdSet.intersect_with_subset",
"FStar.OrdSet.size_of_minus",
"Prims.pos",
"Prims.op_Subtraction",
"FStar.OrdSet.size"
] | [] | true | false | true | false | false | let lemma_strict_subset_minus_size #_ #_ s1 s2 s =
| let size_diff:pos = size s2 - size s1 in
size_of_minus s s2;
size_of_minus s s1;
intersect_with_subset s2 s;
intersect_is_symmetric s2 s;
intersect_with_subset s1 s;
intersect_is_symmetric s1 s | false |
Steel.Channel.Simplex.fst | Steel.Channel.Simplex.gather_r | val gather_r (#p: sprot) (r: ref chan_val) (v: chan_val)
: SteelT unit
((pts_to r half v) `star` (in_state r p))
(fun _ -> (pts_to r full_perm v) `star` (in_state_slprop p v)) | val gather_r (#p: sprot) (r: ref chan_val) (v: chan_val)
: SteelT unit
((pts_to r half v) `star` (in_state r p))
(fun _ -> (pts_to r full_perm v) `star` (in_state_slprop p v)) | let gather_r (#p:sprot) (r:ref chan_val) (v:chan_val)
: SteelT unit
(pts_to r half v `star` in_state r p)
(fun _ -> pts_to r full_perm v `star` in_state_slprop p v)
= let v' = witness_exists () in
H.higher_ref_pts_to_injective_eq #_ #_ #_ #_ #v #_ r;
H.gather #_ #_ #half #half #v #v r;
rewrite_s... | {
"file_name": "lib/steel/Steel.Channel.Simplex.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 77,
"end_line": 281,
"start_col": 0,
"start_line": 273
} | (*
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.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.MonotonicHigherReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.MonotonicHigherReference",
"short_module": "MRef"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"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 | r: Steel.HigherReference.ref Steel.Channel.Simplex.chan_val -> v: Steel.Channel.Simplex.chan_val
-> Steel.Effect.SteelT Prims.unit | Steel.Effect.SteelT | [] | [] | [
"Steel.Channel.Simplex.sprot",
"Steel.HigherReference.ref",
"Steel.Channel.Simplex.chan_val",
"Steel.Effect.Atomic.rewrite_slprop",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.Channel.Simplex.in_state_slprop",
"FStar.Ghost.reveal",
"Steel.Memory.mem",
"... | [] | false | true | false | false | false | let gather_r (#p: sprot) (r: ref chan_val) (v: chan_val)
: SteelT unit
((pts_to r half v) `star` (in_state r p))
(fun _ -> (pts_to r full_perm v) `star` (in_state_slprop p v)) =
| let v' = witness_exists () in
H.higher_ref_pts_to_injective_eq #_ #_ #_ #_ #v #_ r;
H.gather #_ #_ #half #half #v #v r;
rewrite_slprop (pts_to r (sum_perm half half) v) (pts_to r full_perm v) (fun _ -> ());
rewrite_slprop (in_state_slprop p v') (in_state_slprop p v) (fun _ -> ()) | false |
FStar.OrdSet.fst | FStar.OrdSet.intersect_with_subset | val intersect_with_subset (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (requires subset s1 s2)
(ensures intersect s1 s2 = s1) | val intersect_with_subset (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (requires subset s1 s2)
(ensures intersect s1 s2 = s1) | let intersect_with_subset #_ #_ s1 s2 = same_members_means_eq (intersect s1 s2) s1 | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 700,
"start_col": 0,
"start_line": 700
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (requires FStar.OrdSet.subset s1 s2)
(ensures FStar.OrdSet.intersect s1 s2 = s1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.intersect",
"Prims.unit"
] | [] | true | false | true | false | false | let intersect_with_subset #_ #_ s1 s2 =
| same_members_means_eq (intersect s1 s2) s1 | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_intersect_symmetric | val lemma_intersect_symmetric (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires True) (ensures (intersect s1 s2 == intersect s2 s1))
[SMTPatOr [[SMTPat (intersect s1 s2)]; [SMTPat (intersect s2 s1)]]] | val lemma_intersect_symmetric (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires True) (ensures (intersect s1 s2 == intersect s2 s1))
[SMTPatOr [[SMTPat (intersect s1 s2)]; [SMTPat (intersect s2 s1)]]] | let lemma_intersect_symmetric = intersect_is_symmetric | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 717,
"start_col": 0,
"start_line": 717
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (ensures FStar.OrdSet.intersect s1 s2 == FStar.OrdSet.intersect s2 s1)
[SMTPatOr [[SMTPat (FStar.OrdSet.intersect s1 s2)]; [SMTPat (FStar.OrdSet.intersect s2 s1)]]] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.OrdSet.intersect_is_symmetric"
] | [] | true | false | true | false | false | let lemma_intersect_symmetric =
| intersect_is_symmetric | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_union_symmetric | val lemma_union_symmetric (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (union s1 s2 == union s2 s1)
[SMTPat (union s1 s2)] | val lemma_union_symmetric (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (union s1 s2 == union s2 s1)
[SMTPat (union s1 s2)] | let lemma_union_symmetric #a #f s1 s2 = eq_lemma (union s1 s2) (union s2 s1) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 76,
"end_line": 737,
"start_col": 0,
"start_line": 737
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (ensures FStar.OrdSet.union s1 s2 == FStar.OrdSet.union s2 s1)
[SMTPat (FStar.OrdSet.union s1 s2)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.union",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_union_symmetric #a #f s1 s2 =
| eq_lemma (union s1 s2) (union s2 s1) | false |
FStar.OrdSet.fst | FStar.OrdSet.union_of_tails_size | val union_of_tails_size (#a: eqtype) (#f: _) (s1 s2: ordset a f)
: Lemma
(requires
size s1 > 0 && size s2 > 0 && (Cons?.hd s1 <> Cons?.hd s2) && f (Cons?.hd s1) (Cons?.hd s2))
(ensures size (union s1 s2) = 1 + size (union #a #f (Cons?.tl s1) s2)) | val union_of_tails_size (#a: eqtype) (#f: _) (s1 s2: ordset a f)
: Lemma
(requires
size s1 > 0 && size s2 > 0 && (Cons?.hd s1 <> Cons?.hd s2) && f (Cons?.hd s1) (Cons?.hd s2))
(ensures size (union s1 s2) = 1 + size (union #a #f (Cons?.tl s1) s2)) | let union_of_tails_size (#a:eqtype) #f (s1 s2: ordset a f)
: Lemma (requires size s1 > 0 && size s2 > 0 && (Cons?.hd s1 <> Cons?.hd s2) && f (Cons?.hd s1) (Cons?.hd s2))
(ensures size (union s1 s2) = 1 + size (union #a #f (Cons?.tl s1) s2)) =
match s1 with | h1::(t1:ordset a f) -> match s2 with | h2::(t2... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 657,
"start_col": 0,
"start_line": 650
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires
FStar.OrdSet.size s1 > 0 && FStar.OrdSet.size s2 > 0 && Cons?.hd s1 <> Cons?.hd s2 &&
f (Cons?.hd s1) (Cons?.hd s2))
(ensures
FStar.OrdSet.size (FStar.OrdSet.union s1 s2) =
1 + FS... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.list",
"FStar.OrdSet.same_members_means_eq",
"Prims.Cons",
"FStar.OrdSet.union",
"Prims.unit",
"FStar.OrdSet.set_props",
"FStar.OrdSet.union_mem_forall",
"Prims.b2t",
"Prims.op_AmpAmp",
"Prims.op_GreaterThan",
"FStar.OrdSet.... | [] | false | false | true | false | false | let union_of_tails_size (#a: eqtype) #f (s1: ordset a f) (s2: ordset a f)
: Lemma
(requires
size s1 > 0 && size s2 > 0 && (Cons?.hd s1 <> Cons?.hd s2) && f (Cons?.hd s1) (Cons?.hd s2))
(ensures size (union s1 s2) = 1 + size (union #a #f (Cons?.tl s1) s2)) =
| match s1 with
| h1 :: (t1: ordset a f) ->
match s2 with
| h2 :: (t2: ordset a f) ->
union_mem_forall t1 s2;
set_props s1;
set_props s2;
same_members_means_eq (h1 :: (union t1 s2)) (union s1 s2) | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_disjoint_union_subset | val lemma_disjoint_union_subset (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires (~ (s1 == empty) /\ ~ (s2 == empty) /\ intersect s1 s2 == empty))
(ensures (strict_subset s1 (union s1 s2) /\ strict_subset s2 (union s1 s2)))
[SMTPatOr [[SMTPat (strict_subset s1 (union s1 s2))]; [... | val lemma_disjoint_union_subset (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires (~ (s1 == empty) /\ ~ (s2 == empty) /\ intersect s1 s2 == empty))
(ensures (strict_subset s1 (union s1 s2) /\ strict_subset s2 (union s1 s2)))
[SMTPatOr [[SMTPat (strict_subset s1 (union s1 s2))]; [... | let lemma_disjoint_union_subset #_ #_ s1 s2 = size_of_union s1 s2 | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 711,
"start_col": 0,
"start_line": 711
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires
~(s1 == FStar.OrdSet.empty) /\ ~(s2 == FStar.OrdSet.empty) /\
FStar.OrdSet.intersect s1 s2 == FStar.OrdSet.empty)
(ensures
FStar.OrdSet.strict_subset s1 (FStar.OrdSet.union s1 s2) /\
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.size_of_union",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_disjoint_union_subset #_ #_ s1 s2 =
| size_of_union s1 s2 | false |
FStar.OrdSet.fst | FStar.OrdSet.size_of_union_aux_2 | val size_of_union_aux_2 (#a #f: _) (s1 s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && not (f (head s1) (head s2)) &&
(size (union s1 (tail s2)) = size s1 + size (tail s2) - size (intersect s1 (tail s2))))
(ensures size (union s1 s2) = (size s1 + size s2 - s... | val size_of_union_aux_2 (#a #f: _) (s1 s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && not (f (head s1) (head s2)) &&
(size (union s1 (tail s2)) = size s1 + size (tail s2) - size (intersect s1 (tail s2))))
(ensures size (union s1 s2) = (size s1 + size s2 - s... | let size_of_union_aux_2 #a #f (s1 s2: (z:ordset a f{z<>empty}))
: Lemma (requires (head s1) <> (head s2)
&& not (f (head s1) (head s2))
&& (size (union s1 (tail s2)) = size s1 + size (tail s2) - size (intersect s1 (tail s2))))
(ensures size (union s1 s2) = (size s1 + size... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 677,
"start_col": 0,
"start_line": 670
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s1: z: FStar.OrdSet.ordset a f {z <> FStar.OrdSet.empty} ->
s2: z: FStar.OrdSet.ordset a f {z <> FStar.OrdSet.empty}
-> FStar.Pervasives.Lemma
(requires
FStar.OrdSet.head s1 <> FStar.OrdSet.head s2 &&
Prims.op_Negation (f (FStar.OrdSet.head s1) (FStar.OrdSet.head s2)) &&
FStar.O... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.b2t",
"Prims.op_disEquality",
"FStar.OrdSet.empty",
"FStar.OrdSet.size_of_union_aux_1",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.op_Equality",
"FStar.OrdSet.intersect",
"FStar.OrdSet.intersect_is_symmetric",
"FSt... | [] | false | false | true | false | false | let size_of_union_aux_2 #a #f (s1: (z: ordset a f {z <> empty})) (s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && not (f (head s1) (head s2)) &&
(size (union s1 (tail s2)) = size s1 + size (tail s2) - size (intersect s1 (tail s2))))
(ensures size (union s1 s... | Classical.forall_intro_2 (union_is_symmetric #a #f);
Classical.forall_intro_2 (intersect_is_symmetric #a #f);
size_of_union_aux_1 s2 s1 | false |
FStar.OrdSet.fst | FStar.OrdSet.as_set | val as_set : #a:eqtype -> #f:cmp a -> ordset a f -> Tot (S.set a) | val as_set : #a:eqtype -> #f:cmp a -> ordset a f -> Tot (S.set a) | let rec as_set #a #f s =
match s with
| [] -> S.empty
| hd::tl -> S.union (S.singleton hd) (as_set #a #f tl) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 750,
"start_col": 0,
"start_line": 747
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> FStar.Set.set a | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Set.empty",
"Prims.list",
"FStar.Set.union",
"FStar.Set.singleton",
"FStar.OrdSet.as_set",
"FStar.Set.set"
] | [
"recursion"
] | false | false | false | false | false | let rec as_set #a #f s =
| match s with
| [] -> S.empty
| hd :: tl -> S.union (S.singleton hd) (as_set #a #f tl) | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_intersect_union_empty | val lemma_intersect_union_empty (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f) (s3:ordset a f)
: Lemma ((intersect (union s1 s2) s3 = empty) = (intersect s1 s3 = empty && intersect s2 s3 = empty))
[SMTPat (intersect (union s1 s2) s3)] | val lemma_intersect_union_empty (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f) (s3:ordset a f)
: Lemma ((intersect (union s1 s2) s3 = empty) = (intersect s1 s3 = empty && intersect s2 s3 = empty))
[SMTPat (intersect (union s1 s2) s3)] | let lemma_intersect_union_empty #a #f (s1 s2 s3: ordset a f)
: Lemma ((intersect (union s1 s2) s3 = empty) =
(intersect s1 s3 = empty && intersect s2 s3 = empty))
[SMTPat (intersect (union s1 s2) s3)] =
Classical.move_requires_3 (lemma_intersect_union_empty_aux1 #a #f) s1 s2 s3;
Classical.move_r... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 735,
"start_col": 0,
"start_line": 730
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> s3: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.intersect (FStar.OrdSet.union s1 s2) s3 = FStar.OrdSet.empty =
(FStar.OrdSet.intersect s1 s3 = FStar.OrdSet.empty &&
FStar.OrdSet.intersect s2 s3 = FS... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Classical.move_requires_3",
"Prims.b2t",
"Prims.op_Equality",
"FStar.OrdSet.intersect",
"FStar.OrdSet.union",
"FStar.OrdSet.empty",
"Prims.l_and",
"Prims.eq2",
"FStar.OrdSet.lemma_intersect_union_empty_aux2",
"Prims.unit",
"... | [] | false | false | true | false | false | let lemma_intersect_union_empty #a #f (s1: ordset a f) (s2: ordset a f) (s3: ordset a f)
: Lemma
((intersect (union s1 s2) s3 = empty) = (intersect s1 s3 = empty && intersect s2 s3 = empty))
[SMTPat (intersect (union s1 s2) s3)] =
| Classical.move_requires_3 (lemma_intersect_union_empty_aux1 #a #f) s1 s2 s3;
Classical.move_requires_3 (lemma_intersect_union_empty_aux2 #a #f) s1 s2 s3 | false |
FStar.OrdSet.fst | FStar.OrdSet.distinct_is_idempotent | val distinct_is_idempotent (#a:eqtype) (#f: cmp a) (s: ordset a f)
: Lemma (distinct f (as_list s) = s) | val distinct_is_idempotent (#a:eqtype) (#f: cmp a) (s: ordset a f)
: Lemma (distinct f (as_list s) = s) | let distinct_is_idempotent #a #f s = eq_lemma (distinct f s) s | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 741,
"start_col": 0,
"start_line": 741
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (ensures FStar.OrdSet.distinct f (FStar.OrdSet.as_list s) = s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.distinct",
"Prims.unit"
] | [] | true | false | true | false | false | let distinct_is_idempotent #a #f s =
| eq_lemma (distinct f s) s | false |
FStar.OrdSet.fst | FStar.OrdSet.union_of_disjoint | val union_of_disjoint (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires (disjoint s1 s2))
(ensures (minus (union s1 s2) s1 == s2))
[SMTPat (union s1 s2); SMTPat (disjoint s1 s2)] | val union_of_disjoint (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f)
: Lemma (requires (disjoint s1 s2))
(ensures (minus (union s1 s2) s1 == s2))
[SMTPat (union s1 s2); SMTPat (disjoint s1 s2)] | let union_of_disjoint #a #f s1 s2 = eq_lemma (minus (union s1 s2) s1) s2 | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 739,
"start_col": 0,
"start_line": 739
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma (requires FStar.OrdSet.disjoint s1 s2)
(ensures FStar.OrdSet.minus (FStar.OrdSet.union s1 s2) s1 == s2)
[SMTPat (FStar.OrdSet.union s1 s2); SMTPat (FStar.OrdSet.disjoint s1 s2)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.minus",
"FStar.OrdSet.union",
"Prims.unit"
] | [] | true | false | true | false | false | let union_of_disjoint #a #f s1 s2 =
| eq_lemma (minus (union s1 s2) s1) s2 | false |
FStar.OrdSet.fst | FStar.OrdSet.size_of_union | val size_of_union (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (size (union s1 s2) = (size s1 + size s2 - size (intersect s1 s2))) | val size_of_union (#a:eqtype) (#f:cmp a) (s1 s2: ordset a f)
: Lemma (size (union s1 s2) = (size s1 + size s2 - size (intersect s1 s2))) | let rec size_of_union #a #f s1 s2 =
let size = size #a #f in
match s1,s2 with
| [], _ -> same_members_means_eq s2 (union s1 s2)
| _, [] -> same_members_means_eq s1 (union s1 s2)
| h1::(t1:ordset a f), h2::(t2:ordset a f)
-> size_of_union t1 s2;
size_of_union s1 t2;
if h1 = ... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 689,
"start_col": 0,
"start_line": 679
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.size (FStar.OrdSet.union s1 s2) =
FStar.OrdSet.size s1 + FStar.OrdSet.size s2 - FStar.OrdSet.size (FStar.OrdSet.intersect s1 s2)
) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Pervasives.Native.Mktuple2",
"Prims.list",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.union",
"Prims.op_Equality",
"FStar.OrdSet.union_with_prefix",
"Prims.bool",
"FStar.OrdSet.size_of_union_aux_1",
"FStar.OrdSet.size_o... | [
"recursion"
] | false | false | true | false | false | let rec size_of_union #a #f s1 s2 =
| let size = size #a #f in
match s1, s2 with
| [], _ -> same_members_means_eq s2 (union s1 s2)
| _, [] -> same_members_means_eq s1 (union s1 s2)
| h1 :: (t1: ordset a f), h2 :: (t2: ordset a f) ->
size_of_union t1 s2;
size_of_union s1 t2;
if h1 = h2
then union_with_prefix h1 t1 t2
else if f h1 h2 then size_of_u... | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_intersect_union_empty_aux2 | val lemma_intersect_union_empty_aux2 (#a #f: _) (s1 s2 s3: ordset a f)
: Lemma (requires (intersect (union s1 s2) s3 = empty))
(ensures (intersect s1 s3 == empty /\ intersect s2 s3 == empty)) | val lemma_intersect_union_empty_aux2 (#a #f: _) (s1 s2 s3: ordset a f)
: Lemma (requires (intersect (union s1 s2) s3 = empty))
(ensures (intersect s1 s3 == empty /\ intersect s2 s3 == empty)) | let lemma_intersect_union_empty_aux2 #a #f (s1 s2 s3: ordset a f)
: Lemma (requires (intersect (union s1 s2) s3 = empty))
(ensures (intersect s1 s3 == empty /\ intersect s2 s3 == empty))
= eq_lemma empty (intersect s1 s3);
eq_lemma empty (intersect s2 s3) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 728,
"start_col": 0,
"start_line": 724
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> s3: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires FStar.OrdSet.intersect (FStar.OrdSet.union s1 s2) s3 = FStar.OrdSet.empty)
(ensures
FStar.OrdSet.intersect s1 s3 == FStar.OrdSet.empty /\
FStar.OrdSet.intersect s2 ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.empty",
"FStar.OrdSet.intersect",
"Prims.unit",
"Prims.b2t",
"Prims.op_Equality",
"FStar.OrdSet.union",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let lemma_intersect_union_empty_aux2 #a #f (s1: ordset a f) (s2: ordset a f) (s3: ordset a f)
: Lemma (requires (intersect (union s1 s2) s3 = empty))
(ensures (intersect s1 s3 == empty /\ intersect s2 s3 == empty)) =
| eq_lemma empty (intersect s1 s3);
eq_lemma empty (intersect s2 s3) | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_as_set_mem | val lemma_as_set_mem (#a:eqtype) (#f:cmp a) (s:ordset a f) (x:a)
: Lemma (mem x s <==> S.mem x (as_set s))
[SMTPat (mem x s);
SMTPat (S.mem x (as_set s))] | val lemma_as_set_mem (#a:eqtype) (#f:cmp a) (s:ordset a f) (x:a)
: Lemma (mem x s <==> S.mem x (as_set s))
[SMTPat (mem x s);
SMTPat (S.mem x (as_set s))] | let rec lemma_as_set_mem #a #f s x
= match s with
| [] -> ()
| hd::tl ->
if x = hd
then ()
else lemma_as_set_mem #a #f tl x | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 758,
"start_col": 0,
"start_line": 752
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.OrdSet.ordset a f -> x: a
-> FStar.Pervasives.Lemma
(ensures FStar.OrdSet.mem x s <==> FStar.Set.mem x (FStar.OrdSet.as_set s))
[SMTPat (FStar.OrdSet.mem x s); SMTPat (FStar.Set.mem x (FStar.OrdSet.as_set s))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.list",
"Prims.op_Equality",
"Prims.bool",
"FStar.OrdSet.lemma_as_set_mem",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_as_set_mem #a #f s x =
| match s with
| [] -> ()
| hd :: tl -> if x = hd then () else lemma_as_set_mem #a #f tl x | false |
FStar.OrdSet.fst | FStar.OrdSet.size_of_union_aux_1 | val size_of_union_aux_1 (#a #f: _) (s1 s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && (f (head s1) (head s2)) &&
(size (union (tail s1) s2) = size (tail s1) + size s2 - size (intersect (tail s1) s2)))
(ensures size (union s1 s2) = (size s1 + size s2 - size ... | val size_of_union_aux_1 (#a #f: _) (s1 s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && (f (head s1) (head s2)) &&
(size (union (tail s1) s2) = size (tail s1) + size s2 - size (intersect (tail s1) s2)))
(ensures size (union s1 s2) = (size s1 + size s2 - size ... | let size_of_union_aux_1 #a #f (s1 s2: (z:ordset a f{z<>empty}))
: Lemma (requires (head s1) <> (head s2)
&& (f (head s1) (head s2))
&& (size (union (tail s1) s2) = size (tail s1) + size s2 - size (intersect (tail s1) s2)))
(ensures size (union s1 s2) = (size s1 + size s2 ... | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 668,
"start_col": 0,
"start_line": 662
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s1: z: FStar.OrdSet.ordset a f {z <> FStar.OrdSet.empty} ->
s2: z: FStar.OrdSet.ordset a f {z <> FStar.OrdSet.empty}
-> FStar.Pervasives.Lemma
(requires
FStar.OrdSet.head s1 <> FStar.OrdSet.head s2 &&
f (FStar.OrdSet.head s1) (FStar.OrdSet.head s2) &&
FStar.OrdSet.size (FStar.Or... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.b2t",
"Prims.op_disEquality",
"FStar.OrdSet.empty",
"FStar.OrdSet.same_members_means_eq",
"FStar.OrdSet.intersect",
"FStar.OrdSet.tail",
"Prims.unit",
"FStar.OrdSet.union_of_tails_size",
"Prims.op_AmpAmp",
"FStar.OrdSet.head",... | [] | true | false | true | false | false | let size_of_union_aux_1 #a #f (s1: (z: ordset a f {z <> empty})) (s2: (z: ordset a f {z <> empty}))
: Lemma
(requires
(head s1) <> (head s2) && (f (head s1) (head s2)) &&
(size (union (tail s1) s2) = size (tail s1) + size s2 - size (intersect (tail s1) s2)))
(ensures size (union s1 s2) =... | union_of_tails_size s1 s2;
same_members_means_eq (intersect (tail s1) s2) (intersect s1 s2) | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.term_eq | val term_eq : _: FStar.Stubs.Reflection.Types.term -> _: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac Prims.bool | let term_eq = FStar.Tactics.term_eq_old | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 12,
"start_col": 0,
"start_line": 12
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Stubs.Reflection.Types.term -> _: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Tactics.V1.Builtins.term_eq_old"
] | [] | false | true | false | false | false | let term_eq =
| FStar.Tactics.term_eq_old | false | |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.cast_info_to_string | val cast_info_to_string : cast_info -> Tac string | val cast_info_to_string : cast_info -> Tac string | let cast_info_to_string info =
"Mkcast_info (" ^ term_to_string info.term ^ ") (" ^
option_to_string type_info_to_string info.p_ty ^ ") (" ^
option_to_string type_info_to_string info.exp_ty ^ ")" | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 35,
"start_col": 0,
"start_line": 32
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | info: FStar.InteractiveHelpers.Effectful.cast_info -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Effectful.cast_info",
"Prims.op_Hat",
"Prims.string",
"FStar.InteractiveHelpers.Base.option_to_string",
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.InteractiveHelpers.ExploreTerm.type_info_to_string",
"FStar.InteractiveHelpers.Effectful.__proj__Mkcast_info__item__e... | [] | false | true | false | false | false | let cast_info_to_string info =
| "Mkcast_info (" ^
term_to_string info.term ^
") (" ^
option_to_string type_info_to_string info.p_ty ^
") (" ^ option_to_string type_info_to_string info.exp_ty ^ ")" | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.mk_effect_info | val mk_effect_info : ei_type: FStar.InteractiveHelpers.ExploreTerm.effect_type ->
ei_ret_type: FStar.InteractiveHelpers.ExploreTerm.type_info ->
ei_pre: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term ->
ei_post: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term
-> FStar.In... | let mk_effect_info = Mkeffect_info | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 45,
"start_col": 0,
"start_line": 45
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
ei_type: FStar.InteractiveHelpers.ExploreTerm.effect_type ->
ei_ret_type: FStar.InteractiveHelpers.ExploreTerm.type_info ->
ei_pre: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term ->
ei_post: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term
-> FStar.InteractiveHelpers... | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.Effectful.Mkeffect_info"
] | [] | false | false | false | true | false | let mk_effect_info =
| Mkeffect_info | false | |
FStar.OrdSet.fst | FStar.OrdSet.lemma_intersect_union_empty_aux1 | val lemma_intersect_union_empty_aux1 (#a #f: _) (s1 s2 s3: ordset a f)
: Lemma (requires (intersect s1 s3 == empty /\ intersect s2 s3 == empty))
(ensures (intersect (union s1 s2) s3 = empty)) | val lemma_intersect_union_empty_aux1 (#a #f: _) (s1 s2 s3: ordset a f)
: Lemma (requires (intersect s1 s3 == empty /\ intersect s2 s3 == empty))
(ensures (intersect (union s1 s2) s3 = empty)) | let lemma_intersect_union_empty_aux1 #a #f (s1 s2 s3: ordset a f)
: Lemma (requires (intersect s1 s3 == empty /\ intersect s2 s3 == empty))
(ensures (intersect (union s1 s2) s3 = empty))
= eq_lemma empty (intersect (union s1 s2) s3) | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 722,
"start_col": 0,
"start_line": 719
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> s3: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires
FStar.OrdSet.intersect s1 s3 == FStar.OrdSet.empty /\
FStar.OrdSet.intersect s2 s3 == FStar.OrdSet.empty)
(ensures FStar.OrdSet.intersect (FStar.OrdSet.union s1 s2)... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.eq_lemma",
"FStar.OrdSet.empty",
"FStar.OrdSet.intersect",
"FStar.OrdSet.union",
"Prims.unit",
"Prims.l_and",
"Prims.eq2",
"Prims.squash",
"Prims.b2t",
"Prims.op_Equality",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let lemma_intersect_union_empty_aux1 #a #f (s1: ordset a f) (s2: ordset a f) (s3: ordset a f)
: Lemma (requires (intersect s1 s3 == empty /\ intersect s2 s3 == empty))
(ensures (intersect (union s1 s2) s3 = empty)) =
| eq_lemma empty (intersect (union s1 s2) s3) | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.mk_eterm_info | val mk_eterm_info : einfo: FStar.InteractiveHelpers.Effectful.effect_info ->
head: FStar.Stubs.Reflection.Types.term ->
parameters: Prims.list FStar.InteractiveHelpers.Effectful.cast_info
-> FStar.InteractiveHelpers.Effectful.eterm_info | let mk_eterm_info = Mketerm_info | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 73,
"start_col": 0,
"start_line": 73
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
einfo: FStar.InteractiveHelpers.Effectful.effect_info ->
head: FStar.Stubs.Reflection.Types.term ->
parameters: Prims.list FStar.InteractiveHelpers.Effectful.cast_info
-> FStar.InteractiveHelpers.Effectful.eterm_info | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.Effectful.Mketerm_info"
] | [] | false | false | false | true | false | let mk_eterm_info =
| Mketerm_info | false | |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.effect_info_to_string | val effect_info_to_string : effect_info -> Tac string | val effect_info_to_string : effect_info -> Tac string | let effect_info_to_string c =
"Mkeffect_info " ^
effect_type_to_string c.ei_type ^ " (" ^
option_to_string term_to_string c.ei_pre ^ ") (" ^
type_info_to_string c.ei_ret_type ^ ") (" ^
option_to_string term_to_string c.ei_post ^ ")" | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 54,
"start_col": 0,
"start_line": 49
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | c: FStar.InteractiveHelpers.Effectful.effect_info -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Effectful.effect_info",
"Prims.op_Hat",
"Prims.string",
"FStar.InteractiveHelpers.ExploreTerm.effect_type_to_string",
"FStar.InteractiveHelpers.Effectful.__proj__Mkeffect_info__item__ei_type",
"FStar.InteractiveHelpers.Base.option_to_string",
"FStar.Stubs.Reflection.Types.term"... | [] | false | true | false | false | false | let effect_info_to_string c =
| "Mkeffect_info " ^
effect_type_to_string c.ei_type ^
" (" ^
option_to_string term_to_string c.ei_pre ^
") (" ^ type_info_to_string c.ei_ret_type ^ ") (" ^ option_to_string term_to_string c.ei_post ^ ")" | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_as_set_disjoint_left | val lemma_as_set_disjoint_left (#a #f: _) (s1 s2: ordset a f)
: Lemma (requires S.disjoint (as_set s1) (as_set s2)) (ensures intersect s1 s2 = empty) | val lemma_as_set_disjoint_left (#a #f: _) (s1 s2: ordset a f)
: Lemma (requires S.disjoint (as_set s1) (as_set s2)) (ensures intersect s1 s2 = empty) | let lemma_as_set_disjoint_left #a #f (s1 s2: ordset a f)
: Lemma (requires S.disjoint (as_set s1) (as_set s2))
(ensures intersect s1 s2 = empty) =
let mem_eq p q : Lemma (S.mem p (as_set q) <==> mem #a #f p q) = () in
Classical.forall_intro_2 mem_eq | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 768,
"start_col": 0,
"start_line": 764
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(requires FStar.Set.disjoint (FStar.OrdSet.as_set s1) (FStar.OrdSet.as_set s2))
(ensures FStar.OrdSet.intersect s1 s2 = FStar.OrdSet.empty) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Classical.forall_intro_2",
"Prims.l_iff",
"Prims.b2t",
"FStar.Set.mem",
"FStar.OrdSet.as_set",
"FStar.OrdSet.mem",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"FStar.Set.disjoint"... | [] | false | false | true | false | false | let lemma_as_set_disjoint_left #a #f (s1: ordset a f) (s2: ordset a f)
: Lemma (requires S.disjoint (as_set s1) (as_set s2)) (ensures intersect s1 s2 = empty) =
| let mem_eq p q : Lemma (S.mem p (as_set q) <==> mem #a #f p q) = () in
Classical.forall_intro_2 mem_eq | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.eterm_info_to_string | val eterm_info_to_string : eterm_info -> Tac string | val eterm_info_to_string : eterm_info -> Tac string | let eterm_info_to_string info =
let params = map (fun x -> "(" ^ cast_info_to_string x ^ "); \n") info.parameters in
let params_str = List.Tot.fold_left (fun x y -> x ^ y) "" params in
"Mketerm_info (" ^
effect_info_to_string info.einfo ^ ") (" ^
term_to_string info.head ^ ")\n[" ^
params_str ^ "]" | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 71,
"start_col": 0,
"start_line": 65
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | info: FStar.InteractiveHelpers.Effectful.eterm_info -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Effectful.eterm_info",
"Prims.op_Hat",
"Prims.string",
"FStar.Stubs.Tactics.V1.Builtins.term_to_string",
"FStar.InteractiveHelpers.Effectful.__proj__Mketerm_info__item__head",
"FStar.InteractiveHelpers.Effectful.effect_info_to_string",
"FStar.InteractiveHelpers.Effectful.__proj... | [] | false | true | false | false | false | let eterm_info_to_string info =
| let params = map (fun x -> "(" ^ cast_info_to_string x ^ "); \n") info.parameters in
let params_str = List.Tot.fold_left (fun x y -> x ^ y) "" params in
"Mketerm_info (" ^
effect_info_to_string info.einfo ^ ") (" ^ term_to_string info.head ^ ")\n[" ^ params_str ^ "]" | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.comp_to_effect_info | val comp_to_effect_info : dbg:bool -> comp -> Tac (option effect_info) | val comp_to_effect_info : dbg:bool -> comp -> Tac (option effect_info) | let comp_to_effect_info dbg c =
let cv : comp_view = inspect_comp c in
comp_view_to_effect_info dbg cv | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 148,
"start_col": 0,
"start_line": 146
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> c: FStar.Stubs.Reflection.Types.comp
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option FStar.InteractiveHelpers.Effectful.effect_info) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.comp",
"FStar.InteractiveHelpers.Effectful.comp_view_to_effect_info",
"FStar.Pervasives.Native.option",
"FStar.InteractiveHelpers.Effectful.effect_info",
"FStar.Stubs.Reflection.V1.Data.comp_view",
"FStar.Stubs.Reflection.V1.Builtins.inspect_comp"
] | [] | false | true | false | false | false | let comp_to_effect_info dbg c =
| let cv:comp_view = inspect_comp c in
comp_view_to_effect_info dbg cv | false |
FStar.OrdSet.fst | FStar.OrdSet.lemma_as_set_disjoint | val lemma_as_set_disjoint (#a:eqtype) (#f:cmp a) (s1 s2:ordset a f)
: Lemma (intersect s1 s2 = empty <==> S.disjoint (as_set s1) (as_set s2))
[SMTPat (S.disjoint (as_set s1) (as_set s2))] | val lemma_as_set_disjoint (#a:eqtype) (#f:cmp a) (s1 s2:ordset a f)
: Lemma (intersect s1 s2 = empty <==> S.disjoint (as_set s1) (as_set s2))
[SMTPat (S.disjoint (as_set s1) (as_set s2))] | let lemma_as_set_disjoint #a #f s1 s2 =
Classical.move_requires_2 (lemma_as_set_disjoint_right #a #f) s1 s2;
Classical.move_requires_2 (lemma_as_set_disjoint_left #a #f) s1 s2 | {
"file_name": "ulib/experimental/FStar.OrdSet.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 772,
"start_col": 0,
"start_line": 770
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f
-> FStar.Pervasives.Lemma
(ensures
FStar.OrdSet.intersect s1 s2 = FStar.OrdSet.empty <==>
FStar.Set.disjoint (FStar.OrdSet.as_set s1) (FStar.OrdSet.as_set s2))
[SMTPat (FStar.Set.disjoint (FStar.OrdSet.as_set s1) (FStar.OrdSet.as_s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.Classical.move_requires_2",
"FStar.Set.disjoint",
"FStar.OrdSet.as_set",
"Prims.b2t",
"Prims.op_Equality",
"FStar.OrdSet.intersect",
"FStar.OrdSet.empty",
"FStar.OrdSet.lemma_as_set_disjoint_left",
"Prims.unit",
"FStar.OrdSet.... | [] | false | false | true | false | false | let lemma_as_set_disjoint #a #f s1 s2 =
| Classical.move_requires_2 (lemma_as_set_disjoint_right #a #f) s1 s2;
Classical.move_requires_2 (lemma_as_set_disjoint_left #a #f) s1 s2 | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.tcc_no_lift | val tcc_no_lift : env -> term -> Tac comp | val tcc_no_lift : env -> term -> Tac comp | let tcc_no_lift e t =
match inspect t with
| Tv_App _ _ ->
let hd, args = collect_app t in
let c = tcc e hd in
inst_comp e c (List.Tot.map fst args)
| _ ->
(* Fall back to ``tcc`` *)
tcc e t | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 199,
"start_col": 0,
"start_line": 191
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | e: FStar.Stubs.Reflection.Types.env -> t: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.comp | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Data.argv",
"Prims.list",
"FStar.InteractiveHelpers.ExploreTerm.inst_comp",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.fst",
"FStar.Stubs.Reflection.V1.Data.aqualv",
"FStar.Stubs.Reflection.T... | [] | false | true | false | false | false | let tcc_no_lift e t =
| match inspect t with
| Tv_App _ _ ->
let hd, args = collect_app t in
let c = tcc e hd in
inst_comp e c (List.Tot.map fst args)
| _ -> tcc e t | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.has_refinement | val has_refinement (ty: type_info) : Tot bool | val has_refinement (ty: type_info) : Tot bool | let has_refinement (ty:type_info) : Tot bool =
Some? ty.refin | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 227,
"start_col": 0,
"start_line": 226
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ty: FStar.InteractiveHelpers.ExploreTerm.type_info -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.ExploreTerm.__proj__Mktype_info__item__refin",
"Prims.bool"
] | [] | false | false | false | true | false | let has_refinement (ty: type_info) : Tot bool =
| Some? ty.refin | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.get_rawest_type | val get_rawest_type (ty: type_info) : Tot typ | val get_rawest_type (ty: type_info) : Tot typ | let get_rawest_type (ty:type_info) : Tot typ =
ty.ty | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 236,
"start_col": 0,
"start_line": 235
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ty: FStar.InteractiveHelpers.ExploreTerm.type_info -> FStar.Stubs.Reflection.Types.typ | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.InteractiveHelpers.ExploreTerm.__proj__Mktype_info__item__ty",
"FStar.Stubs.Reflection.Types.typ"
] | [] | false | false | false | true | false | let get_rawest_type (ty: type_info) : Tot typ =
| ty.ty | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.get_opt_refinment | val get_opt_refinment (ty: type_info) : Tot (option term) | val get_opt_refinment (ty: type_info) : Tot (option term) | let get_opt_refinment (ty:type_info) : Tot (option term) =
ty.refin | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 233,
"start_col": 0,
"start_line": 232
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ty: FStar.InteractiveHelpers.ExploreTerm.type_info
-> FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.InteractiveHelpers.ExploreTerm.__proj__Mktype_info__item__refin",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.term"
] | [] | false | false | false | true | false | let get_opt_refinment (ty: type_info) : Tot (option term) =
| ty.refin | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.cast_info_list_to_propositions | val cast_info_list_to_propositions : bool -> genv -> list cast_info -> Tac (list proposition) | val cast_info_list_to_propositions : bool -> genv -> list cast_info -> Tac (list proposition) | let cast_info_list_to_propositions dbg ge ls =
let lsl = map (cast_info_to_propositions dbg ge) ls in
flatten lsl | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 349,
"start_col": 0,
"start_line": 347
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
ls: Prims.list FStar.InteractiveHelpers.Effectful.cast_info
-> FStar.Tactics.Effect.Tac (Prims.list FStar.InteractiveHelpers.Propositions.proposition) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"Prims.list",
"FStar.InteractiveHelpers.Effectful.cast_info",
"FStar.List.Tot.Base.flatten",
"FStar.InteractiveHelpers.Propositions.proposition",
"FStar.Tactics.Util.map",
"FStar.InteractiveHelpers.Effectful.cast_info_to_propositions"
] | [] | false | true | false | false | false | let cast_info_list_to_propositions dbg ge ls =
| let lsl = map (cast_info_to_propositions dbg ge) ls in
flatten lsl | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.mk_has_type | val mk_has_type : term -> typ -> Tac term | val mk_has_type : term -> typ -> Tac term | let mk_has_type t ty =
let params = [(ty, Q_Implicit); (t, Q_Explicit); (ty, Q_Explicit)] in
mk_app (`has_type) params | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 304,
"start_col": 0,
"start_line": 302
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | t: FStar.Stubs.Reflection.Types.term -> ty: FStar.Stubs.Reflection.Types.typ
-> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Reflection.V1.Derived.mk_app",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.argv",
"Prims.Cons",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V1.Data.aqualv",
"FStar.Stubs.Reflection.V1.Data.Q_Implicit",
... | [] | false | true | false | false | false | let mk_has_type t ty =
| let params = [(ty, Q_Implicit); (t, Q_Explicit); (ty, Q_Explicit)] in
mk_app (`has_type) params | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.opt_remove_refin | val opt_remove_refin : typ -> Tac typ | val opt_remove_refin : typ -> Tac typ | let opt_remove_refin ty =
match inspect ty with
| Tv_Refine _ sort _ -> sort
| _ -> ty | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 391,
"start_col": 0,
"start_line": 388
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ty: FStar.Stubs.Reflection.Types.typ -> FStar.Tactics.Effect.Tac FStar.Stubs.Reflection.Types.typ | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.Types.bv",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Data.term_view",
"FStar.Stubs.Tactics.V1.Builtins.inspect"
] | [] | false | true | false | false | false | let opt_remove_refin ty =
| match inspect ty with
| Tv_Refine _ sort _ -> sort
| _ -> ty | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.check_pre_post_type | val check_pre_post_type : bool -> env -> term -> term -> term -> Tac pre_post_type | val check_pre_post_type : bool -> env -> term -> term -> term -> Tac pre_post_type | let check_pre_post_type dbg e pre ret_type post =
print_dbg dbg "[> check_pre_post_type";
match compute_pre_type dbg e pre, compute_post_type dbg e ret_type post with
| PP_Pure, PP_Pure ->
print_dbg dbg "PP_Pure, PP_Pure";
PP_Pure
| PP_State ty1, PP_State ty2 ->
print_dbg dbg "PP_State, PP_State";
... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 457,
"start_col": 0,
"start_line": 446
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
e: FStar.Stubs.Reflection.Types.env ->
pre: FStar.Stubs.Reflection.Types.term ->
ret_type: FStar.Stubs.Reflection.Types.term ->
post: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Effectful.pre_post_type | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.PP_Pure",
"FStar.InteractiveHelpers.Effectful.pre_post_type",
"Prims.unit",
"FStar.InteractiveHelpers.Base.print_dbg",
"FStar.InteractiveHelpers.Effectful.PP_State",
"FStar.Inte... | [] | false | true | false | false | false | let check_pre_post_type dbg e pre ret_type post =
| print_dbg dbg "[> check_pre_post_type";
match compute_pre_type dbg e pre, compute_post_type dbg e ret_type post with
| PP_Pure, PP_Pure ->
print_dbg dbg "PP_Pure, PP_Pure";
PP_Pure
| PP_State ty1, PP_State ty2 ->
print_dbg dbg "PP_State, PP_State";
if term_eq ty1 ty2 then PP_State ty1 else PP_Unknown
| _ ->
p... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.is_let_st_get | val is_let_st_get : dbg: Prims.bool -> t: FStar.Stubs.Reflection.V1.Data.term_view
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option (FStar.Stubs.Reflection.Types.bv *
FStar.Stubs.Reflection.Types.typ)) | let is_let_st_get dbg (t : term_view) =
print_dbg dbg ("[> is_let_st_get:\n" ^ term_to_string t);
match t with
| Tv_Let recf attrs bv ty def body ->
print_dbg dbg "The term is a let expression";
if is_st_get dbg def then Some (bv, ty) else None
| _ ->
print_dbg dbg "The term is not a let expression"... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 535,
"start_col": 0,
"start_line": 527
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> t: FStar.Stubs.Reflection.V1.Data.term_view
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option (FStar.Stubs.Reflection.Types.bv *
FStar.Stubs.Reflection.Types.typ)) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.V1.Data.term_view",
"Prims.list",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.Types.bv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasive... | [] | false | true | false | false | false | let is_let_st_get dbg (t: term_view) =
| print_dbg dbg ("[> is_let_st_get:\n" ^ term_to_string t);
match t with
| Tv_Let recf attrs bv ty def body ->
print_dbg dbg "The term is a let expression";
if is_st_get dbg def then Some (bv, ty) else None
| _ ->
print_dbg dbg "The term is not a let expression";
None | false | |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compute_effect_info | val compute_effect_info : dbg:bool -> env -> term -> Tac (option effect_info) | val compute_effect_info : dbg:bool -> env -> term -> Tac (option effect_info) | let compute_effect_info dbg e tm =
match safe_tcc e tm with
| Some c -> comp_to_effect_info dbg c
| None -> None | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 155,
"start_col": 0,
"start_line": 152
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> e: FStar.Stubs.Reflection.Types.env -> tm: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option FStar.InteractiveHelpers.Effectful.effect_info) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.Types.comp",
"FStar.InteractiveHelpers.Effectful.comp_to_effect_info",
"FStar.Pervasives.Native.option",
"FStar.InteractiveHelpers.Effectful.effect_info",
"FStar.Pervasives.Native.None",
"F... | [] | false | true | false | false | false | let compute_effect_info dbg e tm =
| match safe_tcc e tm with
| Some c -> comp_to_effect_info dbg c
| None -> None | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.typ_or_comp_to_effect_info | val typ_or_comp_to_effect_info (dbg: bool) (ge: genv) (c: typ_or_comp) : Tac effect_info | val typ_or_comp_to_effect_info (dbg: bool) (ge: genv) (c: typ_or_comp) : Tac effect_info | let typ_or_comp_to_effect_info (dbg : bool) (ge : genv) (c : typ_or_comp) :
Tac effect_info =
(* match c with
| TC_Typ ty pl num_unflushed ->
let tinfo = get_type_info_from_type ty in
mk_effect_info E_Total tinfo None None
| TC_Comp cv pl num_unflushed ->
let opt_einfo = comp_to_effect_info dbg cv in... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 179,
"start_col": 0,
"start_line": 159
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
c: FStar.InteractiveHelpers.ExploreTerm.typ_or_comp
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Effectful.effect_info | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"FStar.InteractiveHelpers.ExploreTerm.typ_or_comp",
"FStar.Stubs.Reflection.Types.typ",
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"Prims.nat",
"FStar.InteractiveHelpers.Effectful.mk_effect_info",
"FStar.InteractiveHelpers.ExploreTerm.E_T... | [] | false | true | false | false | false | let typ_or_comp_to_effect_info (dbg: bool) (ge: genv) (c: typ_or_comp) : Tac effect_info =
| let c = flush_typ_or_comp dbg ge.env c in
match c with
| TC_Typ ty _ _ ->
let tinfo = get_type_info_from_type ty in
mk_effect_info E_Total tinfo None None
| TC_Comp cv _ _ ->
let opt_einfo = comp_to_effect_info dbg cv in
match opt_einfo with
| None -> mfail ("typ_or_comp_to_effect_info failed on: " ^ acomp_to... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.type_comparison_to_string | val type_comparison_to_string : c: FStar.InteractiveHelpers.Effectful.type_comparison -> Prims.string | let type_comparison_to_string c =
match c with
| Refines -> "Refines"
| Same_raw_type -> "Same_raw_type"
| Unknown -> "Unknown" | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 246,
"start_col": 0,
"start_line": 242
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | c: FStar.InteractiveHelpers.Effectful.type_comparison -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.Effectful.type_comparison",
"Prims.string"
] | [] | false | false | false | true | false | let type_comparison_to_string c =
| match c with
| Refines -> "Refines"
| Same_raw_type -> "Same_raw_type"
| Unknown -> "Unknown" | false | |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.get_refinement | val get_refinement (ty: type_info{Some? ty.refin}) : Tot term | val get_refinement (ty: type_info{Some? ty.refin}) : Tot term | let get_refinement (ty:type_info{Some? ty.refin}) : Tot term =
Some?.v ty.refin | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 230,
"start_col": 0,
"start_line": 229
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ty: FStar.InteractiveHelpers.ExploreTerm.type_info{Some? (Mktype_info?.refin ty)}
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.ExploreTerm.__proj__Mktype_info__item__refin",
"FStar.Pervasives.Native.__proj__Some__item__v"
] | [] | false | false | false | false | false | let get_refinement (ty: type_info{Some? ty.refin}) : Tot term =
| Some?.v ty.refin | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.cast_info_to_propositions | val cast_info_to_propositions : bool -> genv -> cast_info -> Tac (list proposition) | val cast_info_to_propositions : bool -> genv -> cast_info -> Tac (list proposition) | let cast_info_to_propositions dbg ge ci =
print_dbg dbg ("[> cast_info_to_propositions:\n" ^ cast_info_to_string ci);
match compare_cast_types dbg ci with
| Refines ->
print_dbg dbg ("-> Comparison result: Refines");
[]
| Same_raw_type ->
print_dbg dbg ("-> Comparison result: Same_raw_type");
l... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 341,
"start_col": 0,
"start_line": 312
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
ci: FStar.InteractiveHelpers.Effectful.cast_info
-> FStar.Tactics.Effect.Tac (Prims.list FStar.InteractiveHelpers.Propositions.proposition) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"FStar.InteractiveHelpers.Effectful.cast_info",
"Prims.Nil",
"FStar.InteractiveHelpers.Propositions.proposition",
"Prims.list",
"Prims.unit",
"FStar.InteractiveHelpers.Base.print_dbg",
"Prims.Cons",
"FStar.Stubs.Reflection.Types.term",
"FStar.I... | [] | false | true | false | false | false | let cast_info_to_propositions dbg ge ci =
| print_dbg dbg ("[> cast_info_to_propositions:\n" ^ cast_info_to_string ci);
match compare_cast_types dbg ci with
| Refines ->
print_dbg dbg ("-> Comparison result: Refines");
[]
| Same_raw_type ->
print_dbg dbg ("-> Comparison result: Same_raw_type");
let refin = get_refinement (Some?.v ci.exp_ty) in
let inst... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.comp_view_to_effect_info | val comp_view_to_effect_info : dbg:bool -> comp_view -> Tac (option effect_info) | val comp_view_to_effect_info : dbg:bool -> comp_view -> Tac (option effect_info) | let comp_view_to_effect_info dbg cv =
match cv with
| C_Total ret_ty ->
let ret_type_info = get_type_info_from_type ret_ty in
Some (mk_effect_info E_Total ret_type_info None None)
| C_GTotal ret_ty ->
let ret_type_info = get_type_info_from_type ret_ty in
Some (mk_effect_info E_Total ret_type_info ... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 142,
"start_col": 0,
"start_line": 111
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> cv: FStar.Stubs.Reflection.V1.Data.comp_view
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option FStar.InteractiveHelpers.Effectful.effect_info) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.V1.Data.comp_view",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Pervasives.Native.Some",
"FStar.InteractiveHelpers.Effectful.effect_info",
"FStar.InteractiveHelpers.Effectful.mk_effect_info",
"FStar.InteractiveHelpers.ExploreTerm.E_Total",
"FStar.Pervasives.Native.... | [] | false | true | false | false | false | let comp_view_to_effect_info dbg cv =
| match cv with
| C_Total ret_ty ->
let ret_type_info = get_type_info_from_type ret_ty in
Some (mk_effect_info E_Total ret_type_info None None)
| C_GTotal ret_ty ->
let ret_type_info = get_type_info_from_type ret_ty in
Some (mk_effect_info E_Total ret_type_info None None)
| C_Lemma pre post patterns ->
let pre ... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compute_eterm_info | val compute_eterm_info : dbg:bool -> env -> term -> Tac eterm_info | val compute_eterm_info : dbg:bool -> env -> term -> Tac eterm_info | let compute_eterm_info (dbg : bool) (e : env) (t : term) =
(* Decompose the term if it is a function application *)
let hd, parameters = decompose_application e t in
try
begin
let c : comp = tcc_no_lift e t in
let opt_einfo = comp_to_effect_info dbg c in
match opt_einfo with
| None -> mfail ("... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 220,
"start_col": 0,
"start_line": 205
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dbg: Prims.bool -> e: FStar.Stubs.Reflection.Types.env -> t: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Effectful.eterm_info | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.InteractiveHelpers.Effectful.cast_info",
"FStar.Tactics.V1.Derived.try_with",
"FStar.InteractiveHelpers.Effectful.eterm_info",
"Prims.unit",
"FStar.InteractiveHelpers.Base.mfail",
"Prims.str... | [] | false | true | false | false | false | let compute_eterm_info (dbg: bool) (e: env) (t: term) =
| let hd, parameters = decompose_application e t in
try
let c:comp = tcc_no_lift e t in
let opt_einfo = comp_to_effect_info dbg c in
match opt_einfo with
| None -> mfail ("compute_eterm_info: failed on: " ^ term_to_string t)
| Some einfo -> mk_eterm_info einfo hd parameters
with
| TacticFailure msg -> mfail ("c... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.decompose_application_aux | val decompose_application_aux (e: env) (t: term) : Tac (term & list cast_info) | val decompose_application_aux (e: env) (t: term) : Tac (term & list cast_info) | let rec decompose_application_aux (e : env) (t : term) :
Tac (term & list cast_info) =
match inspect t with
| Tv_App hd (a, qualif) ->
let hd0, params = decompose_application_aux e hd in
(* Parameter type *)
let a_type = get_type_info e a in
(* Type expected by the function *)
let hd_ty = safe... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 101,
"start_col": 0,
"start_line": 81
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | e: FStar.Stubs.Reflection.Types.env -> t: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
(FStar.Stubs.Reflection.Types.term * Prims.list FStar.InteractiveHelpers.Effectful.cast_info) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Data.aqualv",
"Prims.list",
"FStar.InteractiveHelpers.Effectful.cast_info",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Cons",
"FStar.InteractiveHelpers.Effectful.mk_cast_info",
"FStar.Pervasives.Nativ... | [
"recursion"
] | false | true | false | false | false | let rec decompose_application_aux (e: env) (t: term) : Tac (term & list cast_info) =
| match inspect t with
| Tv_App hd (a, qualif) ->
let hd0, params = decompose_application_aux e hd in
let a_type = get_type_info e a in
let hd_ty = safe_tc e hd in
let param_type =
match hd_ty with
| None -> None
| Some hd_ty' ->
match inspect hd_ty' with
| Tv_Arrow b c -> Some (get_type_i... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compute_pre_type | val compute_pre_type : bool -> env -> term -> Tac pre_post_type | val compute_pre_type : bool -> env -> term -> Tac pre_post_type | let compute_pre_type dbg e pre =
print_dbg dbg "[> compute_pre_type";
match safe_tc e pre with
| None ->
print_dbg dbg "safe_tc failed";
PP_Unknown
| Some ty ->
print_dbg dbg "safe_tc succeeded";
let brs, c = collect_arr_bs ty in
print_dbg dbg ("num binders: " ^ string_of_int (List.Tot.lengt... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 385,
"start_col": 0,
"start_line": 366
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> e: FStar.Stubs.Reflection.Types.env -> pre: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Effectful.pre_post_type | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.PP_Unknown",
"FStar.InteractiveHelpers.Effectful.pre_post_type",
"Prims.unit",
"FStar.InteractiveHelpers.Base.print_dbg",
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
... | [] | false | true | false | false | false | let compute_pre_type dbg e pre =
| print_dbg dbg "[> compute_pre_type";
match safe_tc e pre with
| None ->
print_dbg dbg "safe_tc failed";
PP_Unknown
| Some ty ->
print_dbg dbg "safe_tc succeeded";
let brs, c = collect_arr_bs ty in
print_dbg dbg ("num binders: " ^ string_of_int (List.Tot.length brs));
match brs, is_total_or_gtotal c with
|... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.effect_type_is_stateful | val effect_type_is_stateful : effect_type -> Tot bool | val effect_type_is_stateful : effect_type -> Tot bool | let effect_type_is_stateful etype =
match etype with
| E_Total | E_GTotal | E_Lemma | E_PURE | E_Pure -> false
| E_Stack | E_ST | E_Unknown -> true | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 508,
"start_col": 0,
"start_line": 505
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | etype: FStar.InteractiveHelpers.ExploreTerm.effect_type -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.InteractiveHelpers.ExploreTerm.effect_type",
"Prims.bool"
] | [] | false | false | false | true | false | let effect_type_is_stateful etype =
| match etype with
| E_Total | E_GTotal | E_Lemma | E_PURE | E_Pure -> false
| E_Stack | E_ST | E_Unknown -> true | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.find_mem_in_children | val find_mem_in_children:
dbg:bool
-> ge:genv
-> child:term
-> Tac (genv & option bv) | val find_mem_in_children:
dbg:bool
-> ge:genv
-> child:term
-> Tac (genv & option bv) | let rec find_mem_in_children dbg ge child =
(* We stop whenever we find an expression which is not a let-binding *)
match inspect child with
| Tv_Let recf attrs bv ty def body ->
if is_st_get dbg def then ge, Some bv
else if term_has_effectful_comp dbg ge.env def <> Some false then ge, None
else
... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 646,
"start_col": 0,
"start_line": 637
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
child: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
(FStar.InteractiveHelpers.Base.genv *
FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.bv) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.Stubs.Reflection.Types.bv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Nati... | [
"recursion"
] | false | true | false | false | false | let rec find_mem_in_children dbg ge child =
| match inspect child with
| Tv_Let recf attrs bv ty def body ->
if is_st_get dbg def
then ge, Some bv
else
if term_has_effectful_comp dbg ge.env def <> Some false
then ge, None
else
let ge1 = genv_push_bv ge bv ty false None in
find_mem_in_children dbg ge1 body
| _ -> ge, None | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.check_opt_pre_post_type | val check_opt_pre_post_type : bool -> env -> option term -> term -> option term -> Tac (option pre_post_type) | val check_opt_pre_post_type : bool -> env -> option term -> term -> option term -> Tac (option pre_post_type) | let check_opt_pre_post_type dbg e opt_pre ret_type opt_post =
print_dbg dbg "[> check_opt_pre_post_type";
match opt_pre, opt_post with
| Some pre, Some post ->
print_dbg dbg "Some pre, Some post";
Some (check_pre_post_type dbg e pre ret_type post)
| Some pre, None ->
print_dbg dbg "Some pre, None";
... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 474,
"start_col": 0,
"start_line": 460
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
e: FStar.Stubs.Reflection.Types.env ->
opt_pre: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term ->
ret_type: FStar.Stubs.Reflection.Types.term ->
opt_post: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
(FStar.P... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.term",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.Some",
"FStar.InteractiveHelpers.Effectful.pre_post_type",
"FStar.InteractiveHelpers.Effectful.check_pre_post_type",
"... | [] | false | true | false | false | false | let check_opt_pre_post_type dbg e opt_pre ret_type opt_post =
| print_dbg dbg "[> check_opt_pre_post_type";
match opt_pre, opt_post with
| Some pre, Some post ->
print_dbg dbg "Some pre, Some post";
Some (check_pre_post_type dbg e pre ret_type post)
| Some pre, None ->
print_dbg dbg "Some pre, None";
Some (compute_pre_type dbg e pre)
| None, Some post ->
print_dbg dbg "No... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.introduce_variables_for_opt_abs | val introduce_variables_for_opt_abs : genv -> option term -> Tac (list term & list binder & genv) | val introduce_variables_for_opt_abs : genv -> option term -> Tac (list term & list binder & genv) | let introduce_variables_for_opt_abs ge opt_tm =
match opt_tm with
| Some tm -> introduce_variables_for_abs ge tm
| None -> [], [], ge | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 501,
"start_col": 0,
"start_line": 498
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
ge: FStar.InteractiveHelpers.Base.genv ->
opt_tm: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
((Prims.list FStar.Stubs.Reflection.Types.term * Prims.list FStar.Stubs.Reflection.Types.binder) *
FStar.InteractiveHelpers.Base.genv) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Base.genv",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.introduce_variables_for_abs",
"FStar.Pervasives.Native.tuple3",
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Pervasives.Native.Mktuple3",
"P... | [] | false | true | false | false | false | let introduce_variables_for_opt_abs ge opt_tm =
| match opt_tm with
| Some tm -> introduce_variables_for_abs ge tm
| None -> [], [], ge | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compare_cast_types | val compare_cast_types (dbg: bool) (p: cast_info)
: Tac
(c:
type_comparison
{ ((c = Refines \/ c = Same_raw_type) ==> (Some? p.p_ty /\ Some? p.exp_ty)) /\
(c = Same_raw_type ==> has_refinement (Some?.v p.exp_ty)) }) | val compare_cast_types (dbg: bool) (p: cast_info)
: Tac
(c:
type_comparison
{ ((c = Refines \/ c = Same_raw_type) ==> (Some? p.p_ty /\ Some? p.exp_ty)) /\
(c = Same_raw_type ==> has_refinement (Some?.v p.exp_ty)) }) | let compare_cast_types (dbg : bool) (p:cast_info) :
Tac (c:type_comparison{
((c = Refines \/ c = Same_raw_type) ==> (Some? p.p_ty /\ Some? p.exp_ty)) /\
(c = Same_raw_type ==> has_refinement (Some?.v p.exp_ty))}) =
print_dbg dbg "[> compare_cast_types";
match p.p_ty, p.exp_ty with
| Some info1, Some inf... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 286,
"start_col": 0,
"start_line": 278
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> p: FStar.InteractiveHelpers.Effectful.cast_info
-> FStar.Tactics.Effect.Tac
(c:
FStar.InteractiveHelpers.Effectful.type_comparison
{ (c = FStar.InteractiveHelpers.Effectful.Refines \/
c = FStar.InteractiveHelpers.Effectful.Same_raw_type ==>
Some? (Mkcast_in... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Effectful.cast_info",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.option",
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.InteractiveHelpers.Effectful.__proj__Mkcast_info__item__p_ty",
"FStar.InteractiveHelpers.Effectful.__proj__Mkcast_i... | [] | false | true | false | false | false | let compare_cast_types (dbg: bool) (p: cast_info)
: Tac
(c:
type_comparison
{ ((c = Refines \/ c = Same_raw_type) ==> (Some? p.p_ty /\ Some? p.exp_ty)) /\
(c = Same_raw_type ==> has_refinement (Some?.v p.exp_ty)) }) =
| print_dbg dbg "[> compare_cast_types";
match p.p_ty, p.exp_ty with
| Some info1, Some info2 -> compare_types dbg info1 info2
| _ -> Unknown | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful._introduce_variables_for_abs | val _introduce_variables_for_abs : genv -> typ -> Tac (list term & list binder & genv) | val _introduce_variables_for_abs : genv -> typ -> Tac (list term & list binder & genv) | let rec _introduce_variables_for_abs ge ty =
match inspect ty with
| Tv_Arrow b c ->
let ge1, b1 = genv_push_fresh_binder ge ("__" ^ name_of_binder b) (type_of_binder b) in
let bv1 = bv_of_binder b1 in
let v1 = pack (Tv_Var bv1) in
begin match get_total_or_gtotal_ret_type c with
| Some ty1 ->
... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 489,
"start_col": 0,
"start_line": 477
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ge: FStar.InteractiveHelpers.Base.genv -> ty: FStar.Stubs.Reflection.Types.typ
-> FStar.Tactics.Effect.Tac
((Prims.list FStar.Stubs.Reflection.Types.term * Prims.list FStar.Stubs.Reflection.Types.binder) *
FStar.InteractiveHelpers.Base.genv) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Base.genv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Stubs.Reflection.Types.comp",
"FStar.InteractiveHelpers.ExploreTerm.get_total_or_gtotal_ret_type",
"Prims.list",
"FStar.Stubs.Reflection.Types.term",
"FStar.Pervasives.Native.Mktuple... | [
"recursion"
] | false | true | false | false | false | let rec _introduce_variables_for_abs ge ty =
| match inspect ty with
| Tv_Arrow b c ->
let ge1, b1 = genv_push_fresh_binder ge ("__" ^ name_of_binder b) (type_of_binder b) in
let bv1 = bv_of_binder b1 in
let v1 = pack (Tv_Var bv1) in
(match get_total_or_gtotal_ret_type c with
| Some ty1 ->
let vl, bl, ge2 = _introduce_variables_for_abs ge1 ty1 in
... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compare_types | val compare_types (dbg: bool) (info1 info2: type_info)
: Tac (c: type_comparison{c = Same_raw_type ==> has_refinement info2}) | val compare_types (dbg: bool) (info1 info2: type_info)
: Tac (c: type_comparison{c = Same_raw_type ==> has_refinement info2}) | let compare_types (dbg : bool) (info1 info2 : type_info) :
Tac (c:type_comparison{c = Same_raw_type ==> has_refinement info2}) =
print_dbg dbg "[> compare_types";
if term_eq info1.ty info2.ty then
let _ = print_dbg dbg "-> types are equal" in
if has_refinement info2 then
let _ = print_dbg dbg ... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 276,
"start_col": 0,
"start_line": 250
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
info1: FStar.InteractiveHelpers.ExploreTerm.type_info ->
info2: FStar.InteractiveHelpers.ExploreTerm.type_info
-> FStar.Tactics.Effect.Tac
(c:
FStar.InteractiveHelpers.Effectful.type_comparison
{ c = FStar.InteractiveHelpers.Effectful.Same_raw_type ==>
FStar... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"FStar.InteractiveHelpers.Effectful.has_refinement",
"FStar.InteractiveHelpers.Effectful.Refines",
"FStar.InteractiveHelpers.Effectful.type_comparison",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_Equality",
"FStar.InteractiveHelpers.Effectfu... | [] | false | true | false | false | false | let compare_types (dbg: bool) (info1 info2: type_info)
: Tac (c: type_comparison{c = Same_raw_type ==> has_refinement info2}) =
| print_dbg dbg "[> compare_types";
if term_eq info1.ty info2.ty
then
let _ = print_dbg dbg "-> types are equal" in
if has_refinement info2
then
let _ = print_dbg dbg "-> 2nd type has refinement" in
if has_refinement info1
then
let _ = print_dbg dbg "-> 1st type has refinement" in
if term_eq... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.term_has_effectful_comp | val term_has_effectful_comp : bool -> env -> term -> Tac (option bool) | val term_has_effectful_comp : bool -> env -> term -> Tac (option bool) | let term_has_effectful_comp dbg e tm =
print_dbg dbg "[> term_has_effectful_comp";
let einfo_opt = compute_effect_info dbg e tm in
match einfo_opt with
| Some einfo ->
print_dbg dbg ("Effect type: " ^ effect_type_to_string einfo.ei_type);
Some (not (effect_type_is_pure einfo.ei_type))
| None ->
pr... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 555,
"start_col": 0,
"start_line": 546
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | dbg: Prims.bool -> e: FStar.Stubs.Reflection.Types.env -> tm: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac (FStar.Pervasives.Native.option Prims.bool) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.effect_info",
"FStar.Pervasives.Native.Some",
"Prims.op_Negation",
"FStar.InteractiveHelpers.ExploreTerm.effect_type_is_pure",
"FStar.InteractiveHelpers.Effectful.__proj__Mkeffect... | [] | false | true | false | false | false | let term_has_effectful_comp dbg e tm =
| print_dbg dbg "[> term_has_effectful_comp";
let einfo_opt = compute_effect_info dbg e tm in
match einfo_opt with
| Some einfo ->
print_dbg dbg ("Effect type: " ^ effect_type_to_string einfo.ei_type);
Some (not (effect_type_is_pure einfo.ei_type))
| None ->
print_dbg dbg "Could not compute effect info";
None | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.introduce_variables_for_abs | val introduce_variables_for_abs : genv -> term -> Tac (list term & list binder & genv) | val introduce_variables_for_abs : genv -> term -> Tac (list term & list binder & genv) | let introduce_variables_for_abs ge tm =
match safe_tc ge.env tm with
| Some ty -> _introduce_variables_for_abs ge ty
| None -> [], [], ge | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 495,
"start_col": 0,
"start_line": 492
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 | ge: FStar.InteractiveHelpers.Base.genv -> tm: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac
((Prims.list FStar.Stubs.Reflection.Types.term * Prims.list FStar.Stubs.Reflection.Types.binder) *
FStar.InteractiveHelpers.Base.genv) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Base.genv",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful._introduce_variables_for_abs",
"FStar.Pervasives.Native.tuple3",
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Pervasives.Native.Mktuple3",
"Prims.Nil",
"FStar.Pervasives.Nati... | [] | false | true | false | false | false | let introduce_variables_for_abs ge tm =
| match safe_tc ge.env tm with
| Some ty -> _introduce_variables_for_abs ge ty
| None -> [], [], ge | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.find_mem_in_related | val find_mem_in_related:
dbg:bool
-> ge:genv
-> tms:list term_view
-> Tac (option (bv & typ)) | val find_mem_in_related:
dbg:bool
-> ge:genv
-> tms:list term_view
-> Tac (option (bv & typ)) | let rec find_mem_in_related dbg ge tms =
match tms with
| [] -> None
| tv :: tms' ->
print_dbg dbg ("[> find_mem_in_related:\n" ^ term_to_string tv);
match is_let_st_get dbg tv with
| Some bvt ->
print_dbg dbg "Term is of the form `let x = FStar.HyperStack.ST.get ()`: success";
Some bvt
... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 626,
"start_col": 0,
"start_line": 605
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
tms: Prims.list FStar.Stubs.Reflection.V1.Data.term_view
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option (FStar.Stubs.Reflection.Types.bv *
FStar.Stubs.Reflection.Types.typ)) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.term_view",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.Types.bv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Pervasives.Native.option",
"FStar.Pervasives... | [
"recursion"
] | false | true | false | false | false | let rec find_mem_in_related dbg ge tms =
| match tms with
| [] -> None
| tv :: tms' ->
print_dbg dbg ("[> find_mem_in_related:\n" ^ term_to_string tv);
match is_let_st_get dbg tv with
| Some bvt ->
print_dbg dbg "Term is of the form `let x = FStar.HyperStack.ST.get ()`: success";
Some bvt
| None ->
print_dbg dbg "Term is not of the form `let... | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.compute_post_type | val compute_post_type : bool -> env -> term -> term -> Tac pre_post_type | val compute_post_type : bool -> env -> term -> term -> Tac pre_post_type | let compute_post_type dbg e ret_type post =
print_dbg dbg "[> compute_post_type";
let get_tot_ret_type c : Tac (option term_view) =
match get_total_or_gtotal_ret_type c with
| Some ret_ty -> Some (inspect ret_ty)
| None -> None
in
match safe_tc e post with
| None ->
print_dbg dbg "safe_tc fail... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 443,
"start_col": 0,
"start_line": 394
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
e: FStar.Stubs.Reflection.Types.env ->
ret_type: FStar.Stubs.Reflection.Types.term ->
post: FStar.Stubs.Reflection.Types.term
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Effectful.pre_post_type | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.Stubs.Reflection.Types.env",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.PP_Unknown",
"FStar.InteractiveHelpers.Effectful.pre_post_type",
"Prims.unit",
"FStar.InteractiveHelpers.Base.print_dbg",
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
... | [] | false | true | false | false | false | let compute_post_type dbg e ret_type post =
| print_dbg dbg "[> compute_post_type";
let get_tot_ret_type c : Tac (option term_view) =
match get_total_or_gtotal_ret_type c with
| Some ret_ty -> Some (inspect ret_ty)
| None -> None
in
match safe_tc e post with
| None ->
print_dbg dbg "safe_tc failed";
PP_Unknown
| Some ty ->
print_dbg dbg "safe_tc succee... | false |
Steel.Channel.Simplex.fst | Steel.Channel.Simplex.update_channel | val update_channel (#p: sprot) (#q: _) (c: chan_t q) (x: msg_t p) (vs: chan_val) (r: ref chan_val)
: SteelT chan_val
((pts_to r full_perm vs) `star` (in_state_slprop p vs))
(fun vs' ->
(pts_to r full_perm vs')
`star`
((in_state_slprop (step p x) vs') `star` (chan_inv_step v... | val update_channel (#p: sprot) (#q: _) (c: chan_t q) (x: msg_t p) (vs: chan_val) (r: ref chan_val)
: SteelT chan_val
((pts_to r full_perm vs) `star` (in_state_slprop p vs))
(fun vs' ->
(pts_to r full_perm vs')
`star`
((in_state_slprop (step p x) vs') `star` (chan_inv_step v... | let update_channel (#p:sprot) #q (c:chan_t q) (x:msg_t p) (vs:chan_val) (r:ref chan_val)
: SteelT chan_val
(pts_to r full_perm vs `star` in_state_slprop p vs)
(fun vs' -> pts_to r full_perm vs' `star` (in_state_slprop (step p x) vs' `star` chan_inv_step vs vs'))
= elim_pure (in_state_prop p vs... | {
"file_name": "lib/steel/Steel.Channel.Simplex.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 268,
"start_col": 0,
"start_line": 259
} | (*
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.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.MonotonicHigherReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.MonotonicHigherReference",
"short_module": "MRef"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"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 |
c: Steel.Channel.Simplex.chan_t q ->
x: Steel.Channel.Protocol.msg_t p ->
vs: Steel.Channel.Simplex.chan_val ->
r: Steel.HigherReference.ref Steel.Channel.Simplex.chan_val
-> Steel.Effect.SteelT Steel.Channel.Simplex.chan_val | Steel.Effect.SteelT | [] | [] | [
"Steel.Channel.Simplex.sprot",
"Steel.Channel.Simplex.prot",
"Steel.Channel.Simplex.chan_t",
"Steel.Channel.Protocol.msg_t",
"Steel.Channel.Simplex.chan_val",
"Steel.HigherReference.ref",
"Steel.Effect.Atomic.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
... | [] | false | true | false | false | false | let update_channel (#p: sprot) #q (c: chan_t q) (x: msg_t p) (vs: chan_val) (r: ref chan_val)
: SteelT chan_val
((pts_to r full_perm vs) `star` (in_state_slprop p vs))
(fun vs' ->
(pts_to r full_perm vs')
`star`
((in_state_slprop (step p x) vs') `star` (chan_inv_step vs vs'... | elim_pure (in_state_prop p vs);
let vs' = next_chan_val x vs in
H.write r vs';
intro_pure (in_state_prop (step p x) vs');
intro_pure (chan_inv_step_p vs vs');
return vs' | false |
Steel.Channel.Simplex.fst | Steel.Channel.Simplex.trace | val trace (#q:prot) (cc:chan q)
: SteelT (tr:partial_trace_of q & history cc tr) emp (fun _ -> emp) | val trace (#q:prot) (cc:chan q)
: SteelT (tr:partial_trace_of q & history cc tr) emp (fun _ -> emp) | let trace #q (cc:chan q)
: SteelT (tr:partial_trace_of q & history cc tr)
emp (fun _ -> emp)
= let _ = send_receive_prelude cc in
let tr = witness_trace_until cc.chan_chan.trace in
intro_chan_inv_auxT cc.chan_chan;
Steel.SpinLock.release cc.chan_lock;
tr | {
"file_name": "lib/steel/Steel.Channel.Simplex.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 458,
"start_col": 0,
"start_line": 451
} | (*
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.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.MonotonicHigherReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.MonotonicHigherReference",
"short_module": "MRef"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"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 | cc: Steel.Channel.Simplex.chan q
-> Steel.Effect.SteelT
(Prims.dtuple2 (Steel.Channel.Protocol.partial_trace_of q)
(fun tr -> Steel.Channel.Simplex.history cc tr)) | Steel.Effect.SteelT | [] | [] | [
"Steel.Channel.Simplex.prot",
"Steel.Channel.Simplex.chan",
"Prims.dtuple2",
"Steel.Channel.Protocol.partial_trace_of",
"Steel.Channel.Simplex.history",
"Prims.unit",
"Steel.SpinLock.release",
"Steel.Channel.Simplex.chan_inv",
"Steel.Channel.Simplex.__proj__Mkchan__item__chan_chan",
"Steel.Channel... | [] | false | true | false | false | false | let trace #q (cc: chan q) : SteelT (tr: partial_trace_of q & history cc tr) emp (fun _ -> emp) =
| let _ = send_receive_prelude cc in
let tr = witness_trace_until cc.chan_chan.trace in
intro_chan_inv_auxT cc.chan_chan;
Steel.SpinLock.release cc.chan_lock;
tr | false |
Vale.Interop.Types.fst | Vale.Interop.Types.view_n | val view_n (t: base_typ) : pos | val view_n (t: base_typ) : pos | let view_n (t:base_typ) : pos = view_n_unfold t | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | t: Vale.Arch.HeapTypes_s.base_typ -> Prims.pos | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Vale.Interop.Types.view_n_unfold",
"Prims.pos"
] | [] | false | false | false | true | false | let view_n (t: base_typ) : pos =
| view_n_unfold t | false |
Vale.Interop.Types.fst | Vale.Interop.Types.disjoint_addr | val disjoint_addr : addr1: Prims.int -> length1: Prims.int -> addr2: Prims.int -> length2: Prims.int -> Prims.bool | let disjoint_addr addr1 length1 addr2 length2 =
(* The first buffer is completely before the second, or the opposite *)
addr1 + length1 < addr2 ||
addr2 + length2 < addr1 | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 61,
"start_col": 0,
"start_line": 58
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | addr1: Prims.int -> length1: Prims.int -> addr2: Prims.int -> length2: Prims.int -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_BarBar",
"Prims.op_LessThan",
"Prims.op_Addition",
"Prims.bool"
] | [] | false | false | false | true | false | let disjoint_addr addr1 length1 addr2 length2 =
| addr1 + length1 < addr2 || addr2 + length2 < addr1 | false | |
Pulse.Lib.InvList.fst | Pulse.Lib.InvList.with_invlist | val with_invlist (#a:Type0) (#pre : vprop) (#post : a -> vprop)
(is : invlist)
(f : unit -> stt_atomic a #Unobservable emp_inames (invlist_v is ** pre) (fun v -> invlist_v is ** post v))
: stt_atomic a #Unobservable (invlist_names is) pre (fun v -> post v) | val with_invlist (#a:Type0) (#pre : vprop) (#post : a -> vprop)
(is : invlist)
(f : unit -> stt_atomic a #Unobservable emp_inames (invlist_v is ** pre) (fun v -> invlist_v is ** post v))
: stt_atomic a #Unobservable (invlist_names is) pre (fun v -> post v) | let with_invlist = __with_invlist | {
"file_name": "share/steel/examples/pulse/lib/pledge/Pulse.Lib.InvList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 33,
"end_line": 68,
"start_col": 0,
"start_line": 68
} | module Pulse.Lib.InvList
open Pulse.Lib.Pervasives
module T0 = Pulse.Lib.Priv.Trade0
```pulse
unobservable
fn __shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (in... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Priv.Trade0.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Pulse.Lib.InvList.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Priv.Trade0",
"short_module": "T0"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
is: Pulse.Lib.InvList.invlist ->
f:
(_: Prims.unit
-> Pulse.Lib.Core.stt_atomic a
Pulse.Lib.Core.emp_inames
(Pulse.Lib.InvList.invlist_v is ** pre)
(fun v -> Pulse.Lib.InvList.invlist_v is ** post v))
-> Pulse.Lib.Core.stt_atomic a (Pulse.Lib.InvList.... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.InvList.__with_invlist"
] | [] | false | false | false | false | false | let with_invlist =
| __with_invlist | false |
Pulse.Lib.InvList.fst | Pulse.Lib.InvList.lift_ghost_unobservable | val lift_ghost_unobservable (#pre #post: _) (f: stt_ghost unit pre post)
: stt_atomic unit #Unobservable emp_inames pre post | val lift_ghost_unobservable (#pre #post: _) (f: stt_ghost unit pre post)
: stt_atomic unit #Unobservable emp_inames pre post | let lift_ghost_unobservable #pre #post (f:stt_ghost unit pre post)
: stt_atomic unit #Unobservable emp_inames pre post
= lift_observability #_ #_ #Unobservable (lift_ghost_neutral f unit_non_informative) | {
"file_name": "share/steel/examples/pulse/lib/pledge/Pulse.Lib.InvList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 86,
"end_line": 72,
"start_col": 0,
"start_line": 70
} | module Pulse.Lib.InvList
open Pulse.Lib.Pervasives
module T0 = Pulse.Lib.Priv.Trade0
```pulse
unobservable
fn __shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (in... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Priv.Trade0.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Pulse.Lib.InvList.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Priv.Trade0",
"short_module": "T0"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib.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 | f: Pulse.Lib.Core.stt_ghost Prims.unit pre post
-> Pulse.Lib.Core.stt_atomic Prims.unit Pulse.Lib.Core.emp_inames pre post | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.Core.vprop",
"Prims.unit",
"Pulse.Lib.Core.stt_ghost",
"Pulse.Lib.Core.lift_observability",
"PulseCore.Observability.Neutral",
"PulseCore.Observability.Unobservable",
"Pulse.Lib.Core.emp_inames",
"Pulse.Lib.Core.lift_ghost_neutral",
"Pulse.Lib.Core.unit_non_informative",
"Pulse.Lib.Core... | [] | false | false | false | false | false | let lift_ghost_unobservable #pre #post (f: stt_ghost unit pre post)
: stt_atomic unit #Unobservable emp_inames pre post =
| lift_observability #_ #_ #Unobservable (lift_ghost_neutral f unit_non_informative) | false |
Pulse.Lib.InvList.fst | Pulse.Lib.InvList.with_invlist_ghost | val with_invlist_ghost (#pre : vprop) (#post : vprop)
(is : invlist)
(f : unit -> stt_ghost unit (invlist_v is ** pre) (fun _ -> invlist_v is ** post))
: stt_atomic unit #Unobservable (invlist_names is) pre (fun _ -> post) | val with_invlist_ghost (#pre : vprop) (#post : vprop)
(is : invlist)
(f : unit -> stt_ghost unit (invlist_v is ** pre) (fun _ -> invlist_v is ** post))
: stt_atomic unit #Unobservable (invlist_names is) pre (fun _ -> post) | let with_invlist_ghost = __with_invlist_ghost | {
"file_name": "share/steel/examples/pulse/lib/pledge/Pulse.Lib.InvList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 45,
"end_line": 86,
"start_col": 0,
"start_line": 86
} | module Pulse.Lib.InvList
open Pulse.Lib.Pervasives
module T0 = Pulse.Lib.Priv.Trade0
```pulse
unobservable
fn __shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (in... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Priv.Trade0.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Pulse.Lib.InvList.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Priv.Trade0",
"short_module": "T0"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
is: Pulse.Lib.InvList.invlist ->
f:
(_: Prims.unit
-> Pulse.Lib.Core.stt_ghost Prims.unit
(Pulse.Lib.InvList.invlist_v is ** pre)
(fun _ -> Pulse.Lib.InvList.invlist_v is ** post))
-> Pulse.Lib.Core.stt_atomic Prims.unit (Pulse.Lib.InvList.invlist_names is) pre (fu... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.InvList.__with_invlist_ghost"
] | [] | false | false | false | false | false | let with_invlist_ghost =
| __with_invlist_ghost | false |
Vale.Interop.Types.fst | Vale.Interop.Types.get_downview | val get_downview : b: LowStar.Monotonic.Buffer.mbuffer (Vale.Interop.Types.base_typ_as_type src) rrel rel
-> Prims.GTot (LowStar.BufferView.Down.buffer FStar.UInt8.t) | let get_downview
(#src:base_typ)
(#rrel #rel:MB.srel (base_typ_as_type src))
(b:MB.mbuffer (base_typ_as_type src) rrel rel) =
DV.mk_buffer_view b (down_view src) | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 37,
"end_line": 67,
"start_col": 0,
"start_line": 63
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | b: LowStar.Monotonic.Buffer.mbuffer (Vale.Interop.Types.base_typ_as_type src) rrel rel
-> Prims.GTot (LowStar.BufferView.Down.buffer FStar.UInt8.t) | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"LowStar.Monotonic.Buffer.srel",
"Vale.Interop.Types.base_typ_as_type",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.BufferView.Down.mk_buffer_view",
"FStar.UInt8.t",
"Vale.Interop.Types.down_view",
"LowStar.BufferView.Down.buffer"
] | [] | false | false | false | false | false | let get_downview
(#src: base_typ)
(#rrel #rel: MB.srel (base_typ_as_type src))
(b: MB.mbuffer (base_typ_as_type src) rrel rel)
=
| DV.mk_buffer_view b (down_view src) | false | |
Vale.Interop.Types.fst | Vale.Interop.Types.addr_map_pred | val addr_map_pred : m: (_: Vale.Interop.Types.b8 -> Vale.Def.Words_s.nat64) -> Prims.logical | let addr_map_pred (m:b8 -> W.nat64) =
(forall (buf1 buf2:b8).{:pattern (m buf1); (m buf2)}
MB.disjoint buf1.bsrc buf2.bsrc ==>
disjoint_addr (m buf1) (DV.length (get_downview buf1.bsrc)) (m buf2) (DV.length (get_downview buf2.bsrc))) /\
(forall (b:b8).{:pattern (m b)} m b + DV.length (get_downview b.bsrc) <... | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 84,
"end_line": 74,
"start_col": 0,
"start_line": 70
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | m: (_: Vale.Interop.Types.b8 -> Vale.Def.Words_s.nat64) -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Types.b8",
"Vale.Def.Words_s.nat64",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_imp",
"LowStar.Monotonic.Buffer.disjoint",
"Vale.Interop.Types.base_typ_as_type",
"Vale.Interop.Types.__proj__Buffer__item__src",
"Vale.Interop.Types.b8_preorder",
"Vale.Interop.Types.__proj__Buffer__item_... | [] | false | false | false | true | true | let addr_map_pred (m: (b8 -> W.nat64)) =
| (forall (buf1: b8) (buf2: b8). {:pattern (m buf1); (m buf2)}
MB.disjoint buf1.bsrc buf2.bsrc ==>
disjoint_addr (m buf1)
(DV.length (get_downview buf1.bsrc))
(m buf2)
(DV.length (get_downview buf2.bsrc))) /\
(forall (b: b8). {:pattern (m b)} m b + DV.length (get_downview b.bsrc) < W.pow2_64) | false | |
Pulse.Lib.InvList.fst | Pulse.Lib.InvList.invlist_sub_split | val invlist_sub_split (is1 is2 : invlist) :
stt_ghost unit
(pure (invlist_sub is1 is2) ** invlist_v is2)
(fun _ -> invlist_v is1 ** Pulse.Lib.Priv.Trade0.stick (invlist_v is1) (invlist_v is2)) | val invlist_sub_split (is1 is2 : invlist) :
stt_ghost unit
(pure (invlist_sub is1 is2) ** invlist_v is2)
(fun _ -> invlist_v is1 ** Pulse.Lib.Priv.Trade0.stick (invlist_v is1) (invlist_v is2)) | let invlist_sub_split = __invlist_sub_split_wrap | {
"file_name": "share/steel/examples/pulse/lib/pledge/Pulse.Lib.InvList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 48,
"end_line": 159,
"start_col": 0,
"start_line": 159
} | module Pulse.Lib.InvList
open Pulse.Lib.Pervasives
module T0 = Pulse.Lib.Priv.Trade0
```pulse
unobservable
fn __shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (in... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Priv.Trade0.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Pulse.Lib.InvList.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Priv.Trade0",
"short_module": "T0"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | is1: Pulse.Lib.InvList.invlist -> is2: Pulse.Lib.InvList.invlist
-> Pulse.Lib.Core.stt_ghost Prims.unit
(Pulse.Lib.Core.pure (Pulse.Lib.InvList.invlist_sub is1 is2) **
Pulse.Lib.InvList.invlist_v is2)
(fun _ ->
Pulse.Lib.InvList.invlist_v is1 **
Pulse.Lib.Priv.Trade0.stick (Pul... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.InvList.__invlist_sub_split_wrap"
] | [] | false | false | false | false | false | let invlist_sub_split =
| __invlist_sub_split_wrap | false |
Steel.Channel.Simplex.fst | Steel.Channel.Simplex.witness_trace_until | val witness_trace_until (#q: _) (#vr: chan_val) (r: trace_ref q)
: SteelT (tr: partial_trace_of q & MRef.witnessed r (history_p tr))
(trace_until r vr)
(fun _ -> trace_until r vr) | val witness_trace_until (#q: _) (#vr: chan_val) (r: trace_ref q)
: SteelT (tr: partial_trace_of q & MRef.witnessed r (history_p tr))
(trace_until r vr)
(fun _ -> trace_until r vr) | let witness_trace_until #q (#vr:chan_val) (r:trace_ref q)
: SteelT (tr:partial_trace_of q & MRef.witnessed r (history_p tr))
(trace_until r vr)
(fun _ -> trace_until r vr)
= let tr = MRef.read_refine r in
let tok = MRef.witness r (history_p tr) tr () in
elim_pure (until tr == step vr.c... | {
"file_name": "lib/steel/Steel.Channel.Simplex.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 449,
"start_col": 0,
"start_line": 441
} | (*
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.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.MonotonicHigherReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.MonotonicHigherReference",
"short_module": "MRef"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"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 | r: Steel.Channel.Simplex.trace_ref q
-> Steel.Effect.SteelT
(Prims.dtuple2 (Steel.Channel.Protocol.partial_trace_of q)
(fun tr -> Steel.MonotonicHigherReference.witnessed r (Steel.Channel.Simplex.history_p tr))) | Steel.Effect.SteelT | [] | [] | [
"Steel.Channel.Simplex.prot",
"Steel.Channel.Simplex.chan_val",
"Steel.Channel.Simplex.trace_ref",
"Prims.Mkdtuple2",
"Steel.Channel.Protocol.partial_trace_of",
"Steel.MonotonicHigherReference.witnessed",
"Steel.Channel.Protocol.extended_to",
"Steel.Channel.Simplex.history_p",
"Prims.dtuple2",
"Pr... | [] | false | true | false | false | false | let witness_trace_until #q (#vr: chan_val) (r: trace_ref q)
: SteelT (tr: partial_trace_of q & MRef.witnessed r (history_p tr))
(trace_until r vr)
(fun _ -> trace_until r vr) =
| let tr = MRef.read_refine r in
let tok = MRef.witness r (history_p tr) tr () in
elim_pure (until tr == step vr.chan_prot vr.chan_msg);
intro_trace_until r tr vr;
(| tr, tok |) | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.pre_post_to_propositions | val pre_post_to_propositions :
dbg:bool
-> ge:genv
-> etype:effect_type
-> ret_value:term
-> ret_abs_binder:option binder
-> ret_type:type_info
-> opt_pre:option term
-> opt_post:option term
-> parents:list term_view (* to look for state variables for the pre *)
-> children:list term_view (* to l... | val pre_post_to_propositions :
dbg:bool
-> ge:genv
-> etype:effect_type
-> ret_value:term
-> ret_abs_binder:option binder
-> ret_type:type_info
-> opt_pre:option term
-> opt_post:option term
-> parents:list term_view (* to look for state variables for the pre *)
-> children:list term_view (* to l... | let pre_post_to_propositions dbg ge0 etype v ret_abs_binder ret_type opt_pre opt_post
parents children =
print_dbg dbg "[> pre_post_to_propositions: begin";
print_dbg dbg ("- uninstantiated pre: " ^ option_to_string term_to_string opt_pre);
print_dbg dbg ("- uninstantiated post: " ^ o... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 742,
"start_col": 0,
"start_line": 662
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
etype: FStar.InteractiveHelpers.ExploreTerm.effect_type ->
ret_value: FStar.Stubs.Reflection.Types.term ->
ret_abs_binder: FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.binder ->
ret_type: FStar.InteractiveHelpers.Explor... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"FStar.InteractiveHelpers.ExploreTerm.effect_type",
"FStar.Stubs.Reflection.Types.term",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.binder",
"FStar.InteractiveHelpers.ExploreTerm.type_info",
"Prims.list",
"FStar.Stubs.Reflectio... | [] | false | true | false | false | false | let pre_post_to_propositions
dbg
ge0
etype
v
ret_abs_binder
ret_type
opt_pre
opt_post
parents
children
=
| print_dbg dbg "[> pre_post_to_propositions: begin";
print_dbg dbg ("- uninstantiated pre: " ^ option_to_string term_to_string opt_pre);
print_dbg dbg ("- uninstantiated post: " ^ option_to_string term_to_string opt_post);
let brs =
match ret_abs_binder with
| None -> []
| Some b -> [b]
in
let ge3, (pre_values, pr... | false |
Vale.Interop.Types.fst | Vale.Interop.Types.base_typ_as_type | val base_typ_as_type (t: base_typ) : eqtype | val base_typ_as_type (t: base_typ) : eqtype | let base_typ_as_type (t:base_typ) : eqtype =
let open W in
let open Vale.Def.Types_s in
match t with
| TUInt8 -> UInt8.t
| TUInt16 -> UInt16.t
| TUInt32 -> UInt32.t
| TUInt64 -> UInt64.t
| TUInt128 -> quad32 | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 20,
"start_col": 0,
"start_line": 12
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | t: Vale.Arch.HeapTypes_s.base_typ -> Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"FStar.UInt8.t",
"FStar.UInt16.t",
"FStar.UInt32.t",
"FStar.UInt64.t",
"Vale.Def.Types_s.quad32",
"Prims.eqtype"
] | [] | false | false | false | true | false | let base_typ_as_type (t: base_typ) : eqtype =
| let open W in
let open Vale.Def.Types_s in
match t with
| TUInt8 -> UInt8.t
| TUInt16 -> UInt16.t
| TUInt32 -> UInt32.t
| TUInt64 -> UInt64.t
| TUInt128 -> quad32 | false |
Vale.Interop.Types.fst | Vale.Interop.Types.down_view | val down_view (t: base_typ) : DV.view (base_typ_as_type t) UInt8.t | val down_view (t: base_typ) : DV.view (base_typ_as_type t) UInt8.t | let down_view (t:base_typ) : DV.view (base_typ_as_type t) UInt8.t = match t with
| TUInt8 -> Vale.Interop.Views.down_view8
| TUInt16 -> Vale.Interop.Views.down_view16
| TUInt32 -> Vale.Interop.Views.down_view32
| TUInt64 -> Vale.Interop.Views.down_view64
| TUInt128 -> Vale.Interop.Views.down_view128 | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 40,
"start_col": 0,
"start_line": 35
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | t: Vale.Arch.HeapTypes_s.base_typ
-> LowStar.BufferView.Down.view (Vale.Interop.Types.base_typ_as_type t) FStar.UInt8.t | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Vale.Interop.Views.down_view8",
"Vale.Interop.Views.down_view16",
"Vale.Interop.Views.down_view32",
"Vale.Interop.Views.down_view64",
"Vale.Interop.Views.down_view128",
"LowStar.BufferView.Down.view",
"Vale.Interop.Types.base_typ_as_type",
"FStar.UInt8.t"
] | [] | false | false | false | false | false | let down_view (t: base_typ) : DV.view (base_typ_as_type t) UInt8.t =
| match t with
| TUInt8 -> Vale.Interop.Views.down_view8
| TUInt16 -> Vale.Interop.Views.down_view16
| TUInt32 -> Vale.Interop.Views.down_view32
| TUInt64 -> Vale.Interop.Views.down_view64
| TUInt128 -> Vale.Interop.Views.down_view128 | false |
Vale.Interop.Types.fst | Vale.Interop.Types.b8_preorder | val b8_preorder (writeable: bool) (a: Type0) : MB.srel a | val b8_preorder (writeable: bool) (a: Type0) : MB.srel a | let b8_preorder (writeable:bool) (a:Type0) : MB.srel a =
match writeable with
| true -> B.trivial_preorder a
| false -> IB.immutable_preorder a | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 45,
"start_col": 0,
"start_line": 42
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | writeable: Prims.bool -> a: Type0 -> LowStar.Monotonic.Buffer.srel a | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"LowStar.Buffer.trivial_preorder",
"LowStar.ImmutableBuffer.immutable_preorder",
"LowStar.Monotonic.Buffer.srel"
] | [] | false | false | false | true | false | let b8_preorder (writeable: bool) (a: Type0) : MB.srel a =
| match writeable with
| true -> B.trivial_preorder a
| false -> IB.immutable_preorder a | false |
Vale.Interop.Types.fst | Vale.Interop.Types.view_n_unfold | val view_n_unfold (t: base_typ) : pos | val view_n_unfold (t: base_typ) : pos | let view_n_unfold (t:base_typ) : pos =
match t with
| TUInt8 -> 1
| TUInt16 -> 2
| TUInt32 -> 4
| TUInt64 -> 8
| TUInt128 -> 16 | {
"file_name": "vale/specs/interop/Vale.Interop.Types.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 30,
"start_col": 0,
"start_line": 24
} | module Vale.Interop.Types
open FStar.Mul
include Vale.Arch.HeapTypes_s
module B = LowStar.Buffer
module IB = LowStar.ImmutableBuffer
module MB = LowStar.Monotonic.Buffer
module DV = LowStar.BufferView.Down
module W = Vale.Def.Words_s
module L = FStar.List.Tot
[@__reduce__]
let base_typ_as_type (t:base_typ) : eqtype =
... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Views.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"LowStar.ImmutableBuffer.fst.checked",
"LowS... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "Vale.Def.Words_s",
"short_module": "W"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_mo... | {
"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 | t: Vale.Arch.HeapTypes_s.base_typ -> Prims.pos | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapTypes_s.base_typ",
"Prims.pos"
] | [] | false | false | false | true | false | let view_n_unfold (t: base_typ) : pos =
| match t with
| TUInt8 -> 1
| TUInt16 -> 2
| TUInt32 -> 4
| TUInt64 -> 8
| TUInt128 -> 16 | false |
Pulse.Lib.InvList.fst | Pulse.Lib.InvList.shift_invlist_one | val shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (invlist_v ((| p, i |) :: is) ** pre) (fun v -> invlist_v ((| p, i |) :: is) ** post v)) :
unit -> stt_ato... | val shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (invlist_v ((| p, i |) :: is) ** pre) (fun v -> invlist_v ((| p, i |) :: is) ** post v)) :
unit -> stt_ato... | let shift_invlist_one = __shift_invlist_one | {
"file_name": "share/steel/examples/pulse/lib/pledge/Pulse.Lib.InvList.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | module Pulse.Lib.InvList
open Pulse.Lib.Pervasives
module T0 = Pulse.Lib.Priv.Trade0
```pulse
unobservable
fn __shift_invlist_one
(#a:Type0)
(p : vprop)
(i : inv p)
(is : invlist{not (mem_inv (invlist_names is) i)})
(#pre:vprop)
(#post : a -> vprop)
(f : unit -> stt_atomic a #Unobservable emp_inames (in... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Priv.Trade0.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Pulse.Lib.InvList.fst"
} | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Priv.Trade0",
"short_module": "T0"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Pulse.Lib.Core.vprop ->
i: Pulse.Lib.Core.inv p ->
is:
Pulse.Lib.InvList.invlist
{ Prims.op_Negation (FStar.Ghost.reveal (Pulse.Lib.Core.mem_inv (Pulse.Lib.InvList.invlist_names
is)
i)) } ->
f:
(_: Prims.unit
-> Pulse.Lib.Core... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.InvList.__shift_invlist_one"
] | [] | false | false | false | false | false | let shift_invlist_one =
| __shift_invlist_one | false |
FStar.InteractiveHelpers.Effectful.fst | FStar.InteractiveHelpers.Effectful.eterm_info_to_assertions | val eterm_info_to_assertions :
dbg:bool
-> with_gpre:bool
-> with_gpost:bool
-> ge:genv
-> t:term
-> is_let:bool (* the term is the bound expression in a let binding *)
-> is_assert:bool (* the term is an assert - in which case we only output the precondition *)
-> info:eterm_info
-> opt_bind_var:o... | val eterm_info_to_assertions :
dbg:bool
-> with_gpre:bool
-> with_gpost:bool
-> ge:genv
-> t:term
-> is_let:bool (* the term is the bound expression in a let binding *)
-> is_assert:bool (* the term is an assert - in which case we only output the precondition *)
-> info:eterm_info
-> opt_bind_var:o... | let eterm_info_to_assertions dbg with_gpre with_gpost ge t is_let is_assert info bind_var opt_c
parents children =
print_dbg dbg "[> eterm_info_to_assertions";
(* Introduce additional variables to instantiate the return type refinement,
* the precondition, the postcondition and the g... | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Effectful.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 962,
"start_col": 0,
"start_line": 764
} | module FStar.InteractiveHelpers.Effectful
module HS = FStar.HyperStack
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
open FStar.InteractiveHelpers.Propositions
let term_eq = FStar.Tactics.term_eq_old
/// Effectful term analysis: retrie... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.Propositions.f... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Propositions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
dbg: Prims.bool ->
with_gpre: Prims.bool ->
with_gpost: Prims.bool ->
ge: FStar.InteractiveHelpers.Base.genv ->
t: FStar.Stubs.Reflection.Types.term ->
is_let: Prims.bool ->
is_assert: Prims.bool ->
info: FStar.InteractiveHelpers.Effectful.eterm_info ->
opt_bind_var: FStar.Pervasive... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.bool",
"FStar.InteractiveHelpers.Base.genv",
"FStar.Stubs.Reflection.Types.term",
"FStar.InteractiveHelpers.Effectful.eterm_info",
"FStar.Pervasives.Native.option",
"FStar.InteractiveHelpers.ExploreTerm.typ_or_comp",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.term_view",
"FStar.Stubs.Refle... | [] | false | true | false | false | false | let eterm_info_to_assertions
dbg
with_gpre
with_gpost
ge
t
is_let
is_assert
info
bind_var
opt_c
parents
children
=
| print_dbg dbg "[> eterm_info_to_assertions";
let einfo = info.einfo in
let ge0, (v: term), (opt_b: option binder) =
match bind_var with
| Some v -> ge, v, None
| None ->
if effect_type_is_stateful einfo.ei_type
then
if is_unit_type einfo.ei_ret_type.ty
then ge, (`()), None
else
l... | false |
Vale.X64.Decls.fsti | Vale.X64.Decls.vale_heap | val vale_heap : Type | let vale_heap = M.vale_heap | {
"file_name": "vale/code/arch/x64/Vale.X64.Decls.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 20,
"start_col": 7,
"start_line": 20
} | module Vale.X64.Decls
open FStar.Mul
open Vale.Arch.HeapTypes_s
open Vale.Arch.HeapImpl
module M = Vale.X64.Memory
module S = Vale.X64.Stack_i
module Map16 = Vale.Lib.Map16
// This interface should hide all of Machine_Semantics_s.
// (It should not refer to Machine_Semantics_s, directly or indirectly.)
// It should no... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fs... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"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 | Type | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.vale_heap"
] | [] | false | false | false | true | true | let vale_heap =
| M.vale_heap | false | |
Vale.X64.Decls.fsti | Vale.X64.Decls.vale_full_heap | val vale_full_heap : Type | let vale_full_heap = M.vale_full_heap | {
"file_name": "vale/code/arch/x64/Vale.X64.Decls.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 21,
"start_col": 7,
"start_line": 21
} | module Vale.X64.Decls
open FStar.Mul
open Vale.Arch.HeapTypes_s
open Vale.Arch.HeapImpl
module M = Vale.X64.Memory
module S = Vale.X64.Stack_i
module Map16 = Vale.Lib.Map16
// This interface should hide all of Machine_Semantics_s.
// (It should not refer to Machine_Semantics_s, directly or indirectly.)
// It should no... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fs... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"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 | Type | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.vale_full_heap"
] | [] | false | false | false | true | true | let vale_full_heap =
| M.vale_full_heap | false | |
Vale.X64.Decls.fsti | Vale.X64.Decls.heaplet_id | val heaplet_id : Type0 | let heaplet_id = M.heaplet_id | {
"file_name": "vale/code/arch/x64/Vale.X64.Decls.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 22,
"start_col": 7,
"start_line": 22
} | module Vale.X64.Decls
open FStar.Mul
open Vale.Arch.HeapTypes_s
open Vale.Arch.HeapImpl
module M = Vale.X64.Memory
module S = Vale.X64.Stack_i
module Map16 = Vale.Lib.Map16
// This interface should hide all of Machine_Semantics_s.
// (It should not refer to Machine_Semantics_s, directly or indirectly.)
// It should no... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fs... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.heaplet_id"
] | [] | false | false | false | true | true | let heaplet_id =
| M.heaplet_id | false | |
Vale.X64.Decls.fsti | Vale.X64.Decls.quad32 | val quad32 : Prims.eqtype | let quad32 = quad32 | {
"file_name": "vale/code/arch/x64/Vale.X64.Decls.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 23,
"start_col": 7,
"start_line": 23
} | module Vale.X64.Decls
open FStar.Mul
open Vale.Arch.HeapTypes_s
open Vale.Arch.HeapImpl
module M = Vale.X64.Memory
module S = Vale.X64.Stack_i
module Map16 = Vale.Lib.Map16
// This interface should hide all of Machine_Semantics_s.
// (It should not refer to Machine_Semantics_s, directly or indirectly.)
// It should no... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Flags.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fs... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.State",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Machine_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"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 | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32"
] | [] | false | false | false | true | false | let quad32 =
| quad32 | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.