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.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.mk_app | val mk_app (t: term) (args: list argv) : Tot term (decreases args) | val mk_app (t: term) (args: list argv) : Tot term (decreases args) | let rec mk_app (t : term) (args : list argv) : Tot term (decreases args) =
match args with
| [] -> t
| (x::xs) -> mk_app (pack_ln (Tv_App t x)) xs | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 75,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term -> args: Prims.list FStar.Stubs.Reflection.V1.Data.argv
-> Prims.Tot FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.argv",
"FStar.Reflection.V1.Derived.mk_app",
"FStar.Stubs.Reflection.V1.Builtins.pack_ln",
"FStar.Stubs.Reflection.V1.Data.Tv_App"
] | [
"recursion"
] | false | false | false | true | false | let rec mk_app (t: term) (args: list argv) : Tot term (decreases args) =
| match args with
| [] -> t
| x :: xs -> mk_app (pack_ln (Tv_App t x)) xs | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.un_uinst | val un_uinst (t: term) : term | val un_uinst (t: term) : term | let un_uinst (t:term) : term =
match inspect_ln t with
| Tv_UInst fv _ -> pack_ln (Tv_FVar fv)
| _ -> t | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 230,
"start_col": 0,
"start_line": 227
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term -> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Builtins.inspect_ln",
"FStar.Stubs.Reflection.Types.fv",
"FStar.Stubs.Reflection.V1.Data.universes",
"FStar.Stubs.Reflection.V1.Builtins.pack_ln",
"FStar.Stubs.Reflection.V1.Data.Tv_FVar",
"FStar.Stubs.Reflection.V1.Data.term_view"
] | [] | false | false | false | true | false | let un_uinst (t: term) : term =
| match inspect_ln t with
| Tv_UInst fv _ -> pack_ln (Tv_FVar fv)
| _ -> t | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.mk_tot_arr_ln | val mk_tot_arr_ln (bs: list binder) (cod: term) : Tot term (decreases bs) | val mk_tot_arr_ln (bs: list binder) (cod: term) : Tot term (decreases bs) | let rec mk_tot_arr_ln (bs: list binder) (cod : term) : Tot term (decreases bs) =
match bs with
| [] -> cod
| (b::bs) -> pack_ln (Tv_Arrow b (pack_comp (C_Total (mk_tot_arr_ln bs cod)))) | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 87,
"start_col": 0,
"start_line": 84
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | bs: Prims.list FStar.Stubs.Reflection.Types.binder -> cod: FStar.Stubs.Reflection.Types.term
-> Prims.Tot FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Builtins.pack_ln",
"FStar.Stubs.Reflection.V1.Data.Tv_Arrow",
"FStar.Stubs.Reflection.V1.Builtins.pack_comp",
"FStar.Stubs.Reflection.V1.Data.C_Total",
"FStar.Reflection.V1.Derived.mk_t... | [
"recursion"
] | false | false | false | true | false | let rec mk_tot_arr_ln (bs: list binder) (cod: term) : Tot term (decreases bs) =
| match bs with
| [] -> cod
| b :: bs -> pack_ln (Tv_Arrow b (pack_comp (C_Total (mk_tot_arr_ln bs cod)))) | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.unsquash_term | val unsquash_term (t: term) : option term | val unsquash_term (t: term) : option term | let unsquash_term (t : term) : option term =
match inspect_ln_unascribe t with
| Tv_App l (r, Q_Explicit) ->
if is_name_imp squash_qn l
then Some r
else None
| _ -> None | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 255,
"start_col": 0,
"start_line": 249
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term
-> FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.inspect_ln_unascribe",
"FStar.Reflection.V1.Derived.is_name_imp",
"FStar.Reflection.Const.squash_qn",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflect... | [] | false | false | false | true | false | let unsquash_term (t: term) : option term =
| match inspect_ln_unascribe t with
| Tv_App l (r, Q_Explicit) -> if is_name_imp squash_qn l then Some r else None
| _ -> None | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.collect_app_ln' | val collect_app_ln' (args: list argv) (t: term) : Tot (term * list argv) (decreases t) | val collect_app_ln' (args: list argv) (t: term) : Tot (term * list argv) (decreases t) | let rec collect_app_ln' (args : list argv) (t : term) : Tot (term * list argv) (decreases t) =
match inspect_ln_unascribe t with
| Tv_App l r ->
collect_app_ln' (r::args) l
| _ -> (t, args) | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 67,
"start_col": 0,
"start_line": 63
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | args: Prims.list FStar.Stubs.Reflection.V1.Data.argv -> t: FStar.Stubs.Reflection.Types.term
-> Prims.Tot (FStar.Stubs.Reflection.Types.term * Prims.list FStar.Stubs.Reflection.V1.Data.argv) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.argv",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.inspect_ln_unascribe",
"FStar.Reflection.V1.Derived.collect_app_ln'",
"Prims.Cons",
"FStar.Stubs.Reflection.V1.Data.term_view",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives... | [
"recursion"
] | false | false | false | true | false | let rec collect_app_ln' (args: list argv) (t: term) : Tot (term * list argv) (decreases t) =
| match inspect_ln_unascribe t with
| Tv_App l r -> collect_app_ln' (r :: args) l
| _ -> (t, args) | false |
CoreCrypto.fst | CoreCrypto.has_priv | val has_priv: key -> Type0 | val has_priv: key -> Type0 | let has_priv : key -> Type0 = function
| KeyRSA k -> Some? k.rsa_prv_exp
| KeyDSA k -> Some? k.dsa_private
| KeyECDSA k -> Some? k.ec_priv | {
"file_name": "ucontrib/CoreCrypto/fst/CoreCrypto.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 240,
"start_col": 0,
"start_line": 237
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Platform.Bytes.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "CoreCrypto.fst"
} | [
{
"abbrev": false,
"full_module": "Platform.Bytes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: CoreCrypto.key -> Type0 | Prims.Tot | [
"total"
] | [] | [
"CoreCrypto.key",
"CoreCrypto.rsa_key",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"Platform.Bytes.bytes",
"CoreCrypto.__proj__Mkrsa_key__item__rsa_prv_exp",
"CoreCrypto.dsa_key",
"CoreCrypto.__proj__Mkdsa_key__item__dsa_private",
"CoreCrypto.ec_key",
"CoreCrypto.__proj__Mkec_key__item__... | [] | false | false | false | true | true | let has_priv: key -> Type0 =
| function
| KeyRSA k -> Some? k.rsa_prv_exp
| KeyDSA k -> Some? k.dsa_private
| KeyECDSA k -> Some? k.ec_priv | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.collect_abs' | val collect_abs' (bs: list binder) (t: term) : Tot (list binder * term) (decreases t) | val collect_abs' (bs: list binder) (t: term) : Tot (list binder * term) (decreases t) | let rec collect_abs' (bs : list binder) (t : term) : Tot (list binder * term) (decreases t) =
match inspect_ln_unascribe t with
| Tv_Abs b t' ->
collect_abs' (b::bs) t'
| _ -> (bs, t) | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 115,
"start_col": 0,
"start_line": 111
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | bs: Prims.list FStar.Stubs.Reflection.Types.binder -> t: FStar.Stubs.Reflection.Types.term
-> Prims.Tot (Prims.list FStar.Stubs.Reflection.Types.binder * FStar.Stubs.Reflection.Types.term) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.inspect_ln_unascribe",
"FStar.Reflection.V1.Derived.collect_abs'",
"Prims.Cons",
"FStar.Stubs.Reflection.V1.Data.term_view",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Na... | [
"recursion"
] | false | false | false | true | false | let rec collect_abs' (bs: list binder) (t: term) : Tot (list binder * term) (decreases t) =
| match inspect_ln_unascribe t with
| Tv_Abs b t' -> collect_abs' (b :: bs) t'
| _ -> (bs, t) | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.mk_list | val mk_list (ts: list term) : term | val mk_list (ts: list term) : term | let rec mk_list (ts : list term) : term =
match ts with
| [] -> pack_ln (Tv_FVar (pack_fv nil_qn))
| t::ts -> mk_cons t (mk_list ts) | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 139,
"start_col": 0,
"start_line": 136
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | ts: Prims.list FStar.Stubs.Reflection.Types.term -> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Builtins.pack_ln",
"FStar.Stubs.Reflection.V1.Data.Tv_FVar",
"FStar.Stubs.Reflection.V1.Builtins.pack_fv",
"FStar.Reflection.Const.nil_qn",
"FStar.Reflection.V1.Derived.mk_cons",
"FStar.Reflection.V1.Derived.mk_list"
] | [
"recursion"
] | false | false | false | true | false | let rec mk_list (ts: list term) : term =
| match ts with
| [] -> pack_ln (Tv_FVar (pack_fv nil_qn))
| t :: ts -> mk_cons t (mk_list ts) | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.collect_arr' | val collect_arr' (bs: list binder) (c: comp) : Tot (list binder * comp) (decreases c) | val collect_arr' (bs: list binder) (c: comp) : Tot (list binder * comp) (decreases c) | let rec collect_arr' (bs : list binder) (c : comp) : Tot (list binder * comp) (decreases c) =
begin match inspect_comp c with
| C_Total t ->
begin match inspect_ln_unascribe t with
| Tv_Arrow b c ->
collect_arr' (b::bs) c
| _ ->
(bs, c)
end
| _ -> (bs,... | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 99,
"start_col": 0,
"start_line": 89
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | bs: Prims.list FStar.Stubs.Reflection.Types.binder -> c: FStar.Stubs.Reflection.Types.comp
-> Prims.Tot (Prims.list FStar.Stubs.Reflection.Types.binder * FStar.Stubs.Reflection.Types.comp) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Stubs.Reflection.Types.comp",
"FStar.Stubs.Reflection.V1.Builtins.inspect_comp",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Reflection.V1.Derived.inspect_ln_unascribe",
"FStar.Reflection.V1.Derived.collect_arr'",
"Prims.Cons",
"FStar.Stubs.... | [
"recursion"
] | false | false | false | true | false | let rec collect_arr' (bs: list binder) (c: comp) : Tot (list binder * comp) (decreases c) =
| match inspect_comp c with
| C_Total t ->
(match inspect_ln_unascribe t with
| Tv_Arrow b c -> collect_arr' (b :: bs) c
| _ -> (bs, c))
| _ -> (bs, c) | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.is_any_fvar | val is_any_fvar (t: term) (nms: list string) : bool | val is_any_fvar (t: term) (nms: list string) : bool | let rec is_any_fvar (t : term) (nms:list string) : bool =
match nms with
| [] -> false
| v::vs -> is_fvar t v || is_any_fvar t vs | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 208,
"start_col": 0,
"start_line": 205
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term -> nms: Prims.list Prims.string -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"Prims.string",
"Prims.op_BarBar",
"FStar.Reflection.V1.Derived.is_fvar",
"FStar.Reflection.V1.Derived.is_any_fvar",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec is_any_fvar (t: term) (nms: list string) : bool =
| match nms with
| [] -> false
| v :: vs -> is_fvar t v || is_any_fvar t vs | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.head | val head (t: term) : term | val head (t: term) : term | let rec head (t : term) : term =
match inspect_ln t with
| Tv_Match t _ _
| Tv_Let _ _ _ _ t _
| Tv_Abs _ t
| Tv_Refine _ _ t
| Tv_App t _
| Tv_AscribedT t _ _ _
| Tv_AscribedC t _ _ _ -> head t
| Tv_Unknown
| Tv_Uvar _ _
| Tv_Const _
| Tv_Type _
| Tv_Var _
| Tv_... | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 193,
"start_col": 0,
"start_line": 174
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term -> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V1.Builtins.inspect_ln",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.match_returns_ascription",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.branch",
"FStar.Reflection.V1.Derived.head",
"Prims.bool",
"FStar.Stubs.Refle... | [
"recursion"
] | false | false | false | true | false | let rec head (t: term) : term =
| match inspect_ln t with
| Tv_Match t _ _
| Tv_Let _ _ _ _ t _
| Tv_Abs _ t
| Tv_Refine _ _ t
| Tv_App t _
| Tv_AscribedT t _ _ _
| Tv_AscribedC t _ _ _ -> head t
| Tv_Unknown
| Tv_Uvar _ _
| Tv_Const _
| Tv_Type _
| Tv_Var _
| Tv_BVar _
| Tv_FVar _
| Tv_UInst _ _
| Tv_Arrow _ _
| Tv_Unsupp -> t | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.destruct_tuple | val destruct_tuple (t: term) : option (list term) | val destruct_tuple (t: term) : option (list term) | let destruct_tuple (t : term) : option (list term) =
let head, args = collect_app_ln t in
match inspect_ln head with
| Tv_FVar fv ->
if List.Tot.Base.mem
(inspect_fv fv) [mktuple2_qn; mktuple3_qn; mktuple4_qn; mktuple5_qn;
mktuple6_qn; mktuple7_qn; mk... | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 169,
"start_col": 0,
"start_line": 157
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term
-> FStar.Pervasives.Native.option (Prims.list FStar.Stubs.Reflection.Types.term) | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.Stubs.Reflection.V1.Data.argv",
"FStar.Stubs.Reflection.V1.Builtins.inspect_ln",
"FStar.Stubs.Reflection.Types.fv",
"FStar.List.Tot.Base.mem",
"Prims.string",
"FStar.Stubs.Reflection.V1.Builtins.inspect_fv",
"Prims.Cons",
"FStar.Reflection.... | [] | false | false | false | true | false | let destruct_tuple (t: term) : option (list term) =
| let head, args = collect_app_ln t in
match inspect_ln head with
| Tv_FVar fv ->
if
List.Tot.Base.mem (inspect_fv fv)
[mktuple2_qn; mktuple3_qn; mktuple4_qn; mktuple5_qn; mktuple6_qn; mktuple7_qn; mktuple8_qn]
then
Some
(List.Tot.Base.concatMap (fun (t, q) ->
match q with
| ... | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.mktuple_n | val mktuple_n (ts: list term {List.Tot.Base.length ts <= 8}) : term | val mktuple_n (ts: list term {List.Tot.Base.length ts <= 8}) : term | let mktuple_n (ts : list term{List.Tot.Base.length ts <= 8}) : term =
match List.Tot.Base.length ts with
| 0 -> pack_ln (Tv_Const C_Unit)
| 1 -> let [x] = ts in x
| n -> begin
let qn = match n with
| 2 -> mktuple2_qn
| 3 -> mktuple3_qn
... | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 155,
"start_col": 0,
"start_line": 141
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | ts: Prims.list FStar.Stubs.Reflection.Types.term {FStar.List.Tot.Base.length ts <= 8}
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Stubs.Reflection.Types.term",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"FStar.Stubs.Reflection.V1.Builtins.pack_ln",
"FStar.Stubs.Reflection.V1.Data.Tv_Const",
"FStar.Stubs.Reflection.V1.Data.C_Unit",
"Prims.int",
"FStar.Reflection.V1.Derived.mk_e... | [] | false | false | false | false | false | let mktuple_n (ts: list term {List.Tot.Base.length ts <= 8}) : term =
| match List.Tot.Base.length ts with
| 0 -> pack_ln (Tv_Const C_Unit)
| 1 ->
let [x] = ts in
x
| n ->
let qn =
match n with
| 2 -> mktuple2_qn
| 3 -> mktuple3_qn
| 4 -> mktuple4_qn
| 5 -> mktuple5_qn
| 6 -> mktuple6_qn
| 7 -> mktuple7_qn
| 8 -> mktuple8_qn
in
mk_e_app (pack_ln (T... | false |
Hacl.Spec.Curve25519.Field64.Definition.fst | Hacl.Spec.Curve25519.Field64.Definition.feval4 | val feval4 (f: felem4) : GTot P.elem | val feval4 (f: felem4) : GTot P.elem | let feval4 (f:felem4) : GTot P.elem = as_nat4 f % P.prime | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Definition.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Spec.Curve25519.Field64.Definition
open Lib.Sequence
open Lib.IntTypes
module P = Spec.Curve25519
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let felem4 = (uint64 * uint64 * uint64 * uint64)
open FStar.Mul
noextract
val as_nat4: f:felem4 -> GTot nat
let as_nat4 f =
let (s0, s1, s2, s3) = f in
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"Hacl.Impl.Curve... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.S... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: Hacl.Spec.Curve25519.Field64.Definition.felem4 -> Prims.GTot Spec.Curve25519.elem | Prims.GTot | [
"sometrivial"
] | [] | [
"Hacl.Spec.Curve25519.Field64.Definition.felem4",
"Prims.op_Modulus",
"Hacl.Spec.Curve25519.Field64.Definition.as_nat4",
"Spec.Curve25519.prime",
"Spec.Curve25519.elem"
] | [] | false | false | false | false | false | let feval4 (f: felem4) : GTot P.elem =
| as_nat4 f % P.prime | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.mkpair | val mkpair (t1 t2: term) : term | val mkpair (t1 t2: term) : term | let mkpair (t1 t2 : term) : term =
mktuple_n [t1;t2] | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 172,
"start_col": 0,
"start_line": 171
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t1: FStar.Stubs.Reflection.Types.term -> t2: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.mktuple_n",
"Prims.Cons",
"Prims.Nil"
] | [] | false | false | false | true | false | let mkpair (t1 t2: term) : term =
| mktuple_n [t1; t2] | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.is_name_imp | val is_name_imp (nm: name) (t: term) : bool | val is_name_imp (nm: name) (t: term) : bool | let rec is_name_imp (nm : name) (t : term) : bool =
begin match inspect_ln_unascribe t with
| Tv_FVar fv
| Tv_UInst fv _ ->
if inspect_fv fv = nm
then true
else false
| Tv_App l (_, Q_Implicit) ->
is_name_imp nm l
| _ -> false
end | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 245,
"start_col": 0,
"start_line": 235
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | nm: FStar.Stubs.Reflection.Types.name -> t: FStar.Stubs.Reflection.Types.term -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.name",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.inspect_ln_unascribe",
"FStar.Stubs.Reflection.Types.fv",
"Prims.op_Equality",
"FStar.Stubs.Reflection.V1.Builtins.inspect_fv",
"Prims.bool",
"FStar.Stubs.Reflection.V1.Data.universes",
"FStar.Refl... | [
"recursion"
] | false | false | false | true | false | let rec is_name_imp (nm: name) (t: term) : bool =
| match inspect_ln_unascribe t with
| Tv_FVar fv | Tv_UInst fv _ -> if inspect_fv fv = nm then true else false
| Tv_App l (_, Q_Implicit) -> is_name_imp nm l
| _ -> false | false |
FStar.Reflection.V1.Derived.fst | FStar.Reflection.V1.Derived.maybe_unsquash_term | val maybe_unsquash_term (t: term) : term | val maybe_unsquash_term (t: term) : term | let maybe_unsquash_term (t : term) : term =
match unsquash_term t with
| Some t' -> t'
| None -> t | {
"file_name": "ulib/FStar.Reflection.V1.Derived.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 262,
"start_col": 0,
"start_line": 259
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.VConfig.fsti.checked",
"FStar.Stubs.Reflection.V1.Data.fsti.checked",
"FStar.Stubs.Reflection.V1.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasiv... | [
{
"abbrev": false,
"full_module": "FStar.VConfig",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Order",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V1.Data",
"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 | t: FStar.Stubs.Reflection.Types.term -> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V1.Derived.unsquash_term"
] | [] | false | false | false | true | false | let maybe_unsquash_term (t: term) : term =
| match unsquash_term t with
| Some t' -> t'
| None -> t | false |
Hacl.Spec.Curve25519.Field64.Definition.fst | Hacl.Spec.Curve25519.Field64.Definition.as_nat4 | val as_nat4: f:felem4 -> GTot nat | val as_nat4: f:felem4 -> GTot nat | let as_nat4 f =
let (s0, s1, s2, s3) = f in
v s0 + v s1 * pow2 64 + v s2 * pow2 64 * pow2 64 +
v s3 * pow2 64 * pow2 64 * pow2 64 | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Definition.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 19,
"start_col": 0,
"start_line": 16
} | module Hacl.Spec.Curve25519.Field64.Definition
open Lib.Sequence
open Lib.IntTypes
module P = Spec.Curve25519
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let felem4 = (uint64 * uint64 * uint64 * uint64)
open FStar.Mul
noextract | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"Hacl.Impl.Curve... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.S... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: Hacl.Spec.Curve25519.Field64.Definition.felem4 -> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"Hacl.Spec.Curve25519.Field64.Definition.felem4",
"Lib.IntTypes.uint64",
"Prims.op_Addition",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.Mul.op_Star",
"Prims.pow2",
"Prims.nat"
] | [] | false | false | false | false | false | let as_nat4 f =
| let s0, s1, s2, s3 = f in
v s0 + v s1 * pow2 64 + (v s2 * pow2 64) * pow2 64 + ((v s3 * pow2 64) * pow2 64) * pow2 64 | false |
Hacl.Spec.Curve25519.Field64.Definition.fst | Hacl.Spec.Curve25519.Field64.Definition.bn_v_is_as_nat | val bn_v_is_as_nat: e:lseq uint64 4 ->
Lemma (as_nat4 (e.[0], e.[1], e.[2], e.[3]) == Hacl.Spec.Bignum.Definitions.bn_v #U64 #4 e) | val bn_v_is_as_nat: e:lseq uint64 4 ->
Lemma (as_nat4 (e.[0], e.[1], e.[2], e.[3]) == Hacl.Spec.Bignum.Definitions.bn_v #U64 #4 e) | let bn_v_is_as_nat e =
Hacl.Impl.Curve25519.Lemmas.lemma_nat_from_uints64_le_4 e;
assert (as_nat4 (e.[0], e.[1], e.[2], e.[3]) == Lib.ByteSequence.nat_from_intseq_le e);
Hacl.Spec.Bignum.Convert.bn_v_is_nat_from_intseq_le_lemma 4 e;
assert (Hacl.Spec.Bignum.Definitions.bn_v #U64 #4 e == Lib.ByteSequence.nat_fro... | {
"file_name": "code/curve25519/Hacl.Spec.Curve25519.Field64.Definition.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 95,
"end_line": 30,
"start_col": 0,
"start_line": 26
} | module Hacl.Spec.Curve25519.Field64.Definition
open Lib.Sequence
open Lib.IntTypes
module P = Spec.Curve25519
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let felem4 = (uint64 * uint64 * uint64 * uint64)
open FStar.Mul
noextract
val as_nat4: f:felem4 -> GTot nat
let as_nat4 f =
let (s0, s1, s2, s3) = f in
... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Convert.fst.checked",
"Hacl.Impl.Curve... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.S... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: Lib.Sequence.lseq Lib.IntTypes.uint64 4
-> FStar.Pervasives.Lemma
(ensures
Hacl.Spec.Curve25519.Field64.Definition.as_nat4 (e.[ 0 ], e.[ 1 ], e.[ 2 ], e.[ 3 ]) ==
Hacl.Spec.Bignum.Definitions.bn_v e) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint64",
"Prims._assert",
"Prims.eq2",
"Prims.nat",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Lib.IntTypes.U64",
"Lib.ByteSequence.nat_from_intseq_le",
"Lib.IntTypes.SEC",
"Prims.unit",
"Hacl.Spec.Bignum.Convert.bn_v_is_nat_from_intseq_le_lemma",
"Hacl.Spec.Curve... | [] | true | false | true | false | false | let bn_v_is_as_nat e =
| Hacl.Impl.Curve25519.Lemmas.lemma_nat_from_uints64_le_4 e;
assert (as_nat4 (e.[ 0 ], e.[ 1 ], e.[ 2 ], e.[ 3 ]) == Lib.ByteSequence.nat_from_intseq_le e);
Hacl.Spec.Bignum.Convert.bn_v_is_nat_from_intseq_le_lemma 4 e;
assert (Hacl.Spec.Bignum.Definitions.bn_v #U64 #4 e == Lib.ByteSequence.nat_from_intseq_le e) | false |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.proposition_to_string | val proposition_to_string : proposition -> Tac string | val proposition_to_string : proposition -> Tac string | let proposition_to_string p = term_to_string p | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 | p: FStar.InteractiveHelpers.Propositions.proposition -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Propositions.proposition",
"FStar.Stubs.Tactics.V1.Builtins.term_to_string",
"Prims.string"
] | [] | false | true | false | false | false | let proposition_to_string p =
| term_to_string p | false |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.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.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 9,
"start_col": 0,
"start_line": 9
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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.Propositions.fst | FStar.InteractiveHelpers.Propositions.is_trivial_proposition | val is_trivial_proposition : proposition -> Tac bool | val is_trivial_proposition : proposition -> Tac bool | let is_trivial_proposition p =
term_eq (`Prims.l_True) p | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 48,
"start_col": 0,
"start_line": 47
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 | p: FStar.InteractiveHelpers.Propositions.proposition -> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.InteractiveHelpers.Propositions.proposition",
"FStar.InteractiveHelpers.Propositions.term_eq",
"Prims.bool"
] | [] | false | true | false | false | false | let is_trivial_proposition p =
| term_eq (`Prims.l_True) p | false |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.simpl_norm_steps | val simpl_norm_steps : Prims.list FStar.Pervasives.norm_step | let simpl_norm_steps = [primops; simplify; iota] | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 41,
"start_col": 0,
"start_line": 41
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 | Prims.list FStar.Pervasives.norm_step | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.primops",
"FStar.Pervasives.simplify",
"FStar.Pervasives.iota",
"Prims.Nil"
] | [] | false | false | false | true | false | let simpl_norm_steps =
| [primops; simplify; iota] | false | |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.simp_filter_propositions | val simp_filter_propositions (e: env) (steps: list norm_step) (pl: list proposition)
: Tac (list proposition) | val simp_filter_propositions (e: env) (steps: list norm_step) (pl: list proposition)
: Tac (list proposition) | let simp_filter_propositions (e:env) (steps:list norm_step) (pl:list proposition) :
Tac (list proposition) =
List.flatten (map (simp_filter_proposition e steps) pl) | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 59,
"start_col": 0,
"start_line": 57
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 ->
steps: Prims.list FStar.Pervasives.norm_step ->
pl: Prims.list FStar.InteractiveHelpers.Propositions.proposition
-> FStar.Tactics.Effect.Tac (Prims.list FStar.InteractiveHelpers.Propositions.proposition) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.env",
"Prims.list",
"FStar.Pervasives.norm_step",
"FStar.InteractiveHelpers.Propositions.proposition",
"FStar.List.Tot.Base.flatten",
"FStar.Tactics.Util.map",
"FStar.InteractiveHelpers.Propositions.simp_filter_proposition"
] | [] | false | true | false | false | false | let simp_filter_propositions (e: env) (steps: list norm_step) (pl: list proposition)
: Tac (list proposition) =
| List.flatten (map (simp_filter_proposition e steps) pl) | false |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.simp_filter_proposition | val simp_filter_proposition (e: env) (steps: list norm_step) (p: proposition)
: Tac (list proposition) | val simp_filter_proposition (e: env) (steps: list norm_step) (p: proposition)
: Tac (list proposition) | let simp_filter_proposition (e:env) (steps:list norm_step) (p:proposition) :
Tac (list proposition) =
let prop1 = norm_term_env e steps p in
(* If trivial, filter *)
if term_eq (`Prims.l_True) prop1 then []
else [prop1] | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 55,
"start_col": 0,
"start_line": 50
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 ->
steps: Prims.list FStar.Pervasives.norm_step ->
p: FStar.InteractiveHelpers.Propositions.proposition
-> FStar.Tactics.Effect.Tac (Prims.list FStar.InteractiveHelpers.Propositions.proposition) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.env",
"Prims.list",
"FStar.Pervasives.norm_step",
"FStar.InteractiveHelpers.Propositions.proposition",
"Prims.Nil",
"Prims.bool",
"Prims.Cons",
"FStar.InteractiveHelpers.Propositions.term_eq",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Tactics.V1.Builtins.norm_... | [] | false | true | false | false | false | let simp_filter_proposition (e: env) (steps: list norm_step) (p: proposition)
: Tac (list proposition) =
| let prop1 = norm_term_env e steps p in
if term_eq (`Prims.l_True) prop1 then [] else [prop1] | false |
DijkstraStateMonad.fst | DijkstraStateMonad.post_t | val post_t : s: Type0 -> a: Type -> Type | let post_t (s:Type0) (a:Type) = a * s -> Type0 | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 44,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Type0 -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | true | let post_t (s: Type0) (a: Type) =
| (a * s) -> Type0 | false | |
DijkstraStateMonad.fst | DijkstraStateMonad.pre_t | val pre_t : s: Type -> Type | let pre_t (s:Type) = s -> Type0 | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Type -> Type | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | true | let pre_t (s: Type) =
| s -> Type0 | false | |
FStar.InteractiveHelpers.Propositions.fst | FStar.InteractiveHelpers.Propositions.simp_filter_assertions | val simp_filter_assertions (e: env) (steps: list norm_step) (a: assertions) : Tac assertions | val simp_filter_assertions (e: env) (steps: list norm_step) (a: assertions) : Tac assertions | let simp_filter_assertions (e:env) (steps:list norm_step) (a:assertions) :
Tac assertions =
let pres = simp_filter_propositions e steps a.pres in
let posts = simp_filter_propositions e steps a.posts in
mk_assertions pres posts | {
"file_name": "ulib/experimental/FStar.InteractiveHelpers.Propositions.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 65,
"start_col": 0,
"start_line": 61
} | module FStar.InteractiveHelpers.Propositions
open FStar.List
open FStar.Tactics
open FStar.Mul
open FStar.InteractiveHelpers.Base
open FStar.InteractiveHelpers.ExploreTerm
let term_eq = FStar.Tactics.term_eq_old
/// Propositions and assertions.
/// Assertions are propositions to be inserted in the F* code: we differ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.InteractiveHelpers.ExploreTerm.fst.checked",
"FStar.InteractiveHelpers.Base.fst.checked"
],
"interface... | [
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.ExploreTerm",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.InteractiveHelpers.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"a... | {
"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 ->
steps: Prims.list FStar.Pervasives.norm_step ->
a: FStar.InteractiveHelpers.Propositions.assertions
-> FStar.Tactics.Effect.Tac FStar.InteractiveHelpers.Propositions.assertions | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.env",
"Prims.list",
"FStar.Pervasives.norm_step",
"FStar.InteractiveHelpers.Propositions.assertions",
"FStar.InteractiveHelpers.Propositions.mk_assertions",
"FStar.InteractiveHelpers.Propositions.proposition",
"FStar.InteractiveHelpers.Propositions.simp_filter_propositions"... | [] | false | true | false | false | false | let simp_filter_assertions (e: env) (steps: list norm_step) (a: assertions) : Tac assertions =
| let pres = simp_filter_propositions e steps a.pres in
let posts = simp_filter_propositions e steps a.posts in
mk_assertions pres posts | false |
DijkstraStateMonad.fst | DijkstraStateMonad.wp_t | val wp_t : s: Type0 -> a: Type -> Type | let wp_t (s:Type0) (a:Type) = s ^-> (post_t s a -> Type0) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 62,
"start_col": 0,
"start_line": 62
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Type0 -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"FStar.FunctionalExtensionality.op_Hat_Subtraction_Greater",
"DijkstraStateMonad.post_t"
] | [] | false | false | false | true | true | let wp_t (s: Type0) (a: Type) =
| s ^-> (post_t s a -> Type0) | false | |
DijkstraStateMonad.fst | DijkstraStateMonad.wp_put | val wp_put: #s: _ -> #a: _ -> f: wp_t s a -> s -> wp_t s a | val wp_put: #s: _ -> #a: _ -> f: wp_t s a -> s -> wp_t s a | let wp_put #s #a (f: wp_t s a)
: s -> wp_t s a
= fun s -> F.on _ (fun s0 -> f s) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 68,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: DijkstraStateMonad.wp_t s a -> _: s -> DijkstraStateMonad.wp_t s a | Prims.Tot | [
"total"
] | [] | [
"DijkstraStateMonad.wp_t",
"FStar.FunctionalExtensionality.on",
"DijkstraStateMonad.post_t"
] | [] | false | false | false | true | false | let wp_put #s #a (f: wp_t s a) : s -> wp_t s a =
| fun s -> F.on _ (fun s0 -> f s) | false |
DijkstraStateMonad.fst | DijkstraStateMonad.wp_return | val wp_return (#s #a: _) (x: a) : wp_t s a | val wp_return (#s #a: _) (x: a) : wp_t s a | let wp_return #s #a (x:a)
: wp_t s a
= F.on _ (fun s0 post -> post (x, s0)) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 73,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> DijkstraStateMonad.wp_t s a | Prims.Tot | [
"total"
] | [] | [
"FStar.FunctionalExtensionality.on",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"DijkstraStateMonad.wp_t"
] | [] | false | false | false | true | false | let wp_return #s #a (x: a) : wp_t s a =
| F.on _ (fun s0 post -> post (x, s0)) | false |
Steel.ST.Array.fst | Steel.ST.Array.pts_to_range_join | val pts_to_range_join
(#opened: _)
(#elt: Type0)
(#p: P.perm)
(#s1 #s2: Seq.seq elt)
(a: array elt)
(i m j: nat)
: STGhostT unit opened
(pts_to_range a i m p s1 `star` pts_to_range a m j p s2)
(fun _ -> pts_to_range a i j p (s1 `Seq.append` s2)) | val pts_to_range_join
(#opened: _)
(#elt: Type0)
(#p: P.perm)
(#s1 #s2: Seq.seq elt)
(a: array elt)
(i m j: nat)
: STGhostT unit opened
(pts_to_range a i m p s1 `star` pts_to_range a m j p s2)
(fun _ -> pts_to_range a i j p (s1 `Seq.append` s2)) | let pts_to_range_join
#_ #_ #p #s1 #s2 a i m j
= length_fits a;
pts_to_range_prop a i m p s1;
pts_to_range_prop a m j p s2;
let a1 = pts_to_range_elim' a i m p s1 in
let a2 = pts_to_range_elim' a m j p s2 in
ghost_join a1 a2 ();
pts_to_range_intro' a i j p _ _ | {
"file_name": "lib/steel/Steel.ST.Array.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 33,
"end_line": 655,
"start_col": 0,
"start_line": 647
} | (*
Copyright 2020, 2021, 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 ... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.ST.HigherArray.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.che... | [
{
"abbrev": true,
"full_module": "Steel.ST.Reference",
"short_module": "R"
},
{
"abbrev": true,
"full_module": "Steel.ST.HigherArray",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Steel.ST.Array.array elt -> i: Prims.nat -> m: Prims.nat -> j: Prims.nat
-> Steel.ST.Effect.Ghost.STGhostT Prims.unit | Steel.ST.Effect.Ghost.STGhostT | [] | [] | [
"Steel.Memory.inames",
"Steel.FractionalPermission.perm",
"FStar.Seq.Base.seq",
"Steel.ST.Array.array",
"Prims.nat",
"Steel.ST.Array.pts_to_range_intro'",
"Steel.ST.Array.merge",
"FStar.Ghost.reveal",
"FStar.Ghost.hide",
"FStar.Seq.Base.append",
"Prims.unit",
"Steel.ST.Array.ghost_join",
"FS... | [] | false | true | false | false | false | let pts_to_range_join #_ #_ #p #s1 #s2 a i m j =
| length_fits a;
pts_to_range_prop a i m p s1;
pts_to_range_prop a m j p s2;
let a1 = pts_to_range_elim' a i m p s1 in
let a2 = pts_to_range_elim' a m j p s2 in
ghost_join a1 a2 ();
pts_to_range_intro' a i j p _ _ | false |
DijkstraStateMonad.fst | DijkstraStateMonad.bind_wp | val bind_wp (#a #b #s: _) (wp_f: wp_t s a) (wp_g: (a -> wp_t s b)) : wp_t s b | val bind_wp (#a #b #s: _) (wp_f: wp_t s a) (wp_g: (a -> wp_t s b)) : wp_t s b | let bind_wp #a #b #s (wp_f:wp_t s a) (wp_g: (a -> wp_t s b))
: wp_t s b
= F.on _ (fun s0 post -> wp_f s0 (fun (x, s1) -> wp_g x s1 post)) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 137,
"start_col": 0,
"start_line": 135
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | wp_f: DijkstraStateMonad.wp_t s a -> wp_g: (_: a -> DijkstraStateMonad.wp_t s b)
-> DijkstraStateMonad.wp_t s b | Prims.Tot | [
"total"
] | [] | [
"DijkstraStateMonad.wp_t",
"FStar.FunctionalExtensionality.on",
"DijkstraStateMonad.post_t",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | false | let bind_wp #a #b #s (wp_f: wp_t s a) (wp_g: (a -> wp_t s b)) : wp_t s b =
| F.on _ (fun s0 post -> wp_f s0 (fun (x, s1) -> wp_g x s1 post)) | false |
DijkstraStateMonad.fst | DijkstraStateMonad.irepr | val irepr : a: Type -> s: Type0 -> wp: DijkstraStateMonad.wp_t s a -> Type | let irepr a s (wp: wp_t s a) =
unit -> m:m s a { wp_of m `F.feq` wp } | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 127,
"start_col": 0,
"start_line": 126
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> s: Type0 -> wp: DijkstraStateMonad.wp_t s a -> Type | Prims.Tot | [
"total"
] | [] | [
"DijkstraStateMonad.wp_t",
"Prims.unit",
"DijkstraStateMonad.m",
"FStar.FunctionalExtensionality.feq",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of"
] | [] | false | false | false | true | true | let irepr a s (wp: wp_t s a) =
| unit -> m: m s a {(wp_of m) `F.feq` wp} | false | |
DijkstraStateMonad.fst | DijkstraStateMonad.bind_m | val bind_m (#s #a #b: _) (x: m s a) (y: (a -> m s b)) : m s b | val bind_m (#s #a #b: _) (x: m s a) (y: (a -> m s b)) : m s b | let rec bind_m #s #a #b (x:m s a) (y: (a -> m s b)) : m s b =
match x with
| Ret x -> y x
| Get k -> Get (fun s -> bind_m (k s) y)
| Put s k -> Put s (bind_m k y) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 37,
"start_col": 0,
"start_line": 33
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: DijkstraStateMonad.m s a -> y: (_: a -> DijkstraStateMonad.m s b) -> DijkstraStateMonad.m s b | Prims.Tot | [
"total"
] | [] | [
"DijkstraStateMonad.m",
"DijkstraStateMonad.Get",
"DijkstraStateMonad.bind_m",
"DijkstraStateMonad.Put"
] | [
"recursion"
] | false | false | false | true | false | let rec bind_m #s #a #b (x: m s a) (y: (a -> m s b)) : m s b =
| match x with
| Ret x -> y x
| Get k -> Get (fun s -> bind_m (k s) y)
| Put s k -> Put s (bind_m k y) | false |
DijkstraStateMonad.fst | DijkstraStateMonad.wp_of | val wp_of (#a #s: _) (x: m s a) : wp_t s a | val wp_of (#a #s: _) (x: m s a) : wp_t s a | let rec wp_of #a #s (x:m s a)
: wp_t s a
= match x with
| Ret v -> wp_return v
| Get k -> F.on _ (fun s0 -> (wp_of (k s0)) s0)
| Put s k -> wp_put (wp_of k) s | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 85,
"start_col": 0,
"start_line": 80
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: DijkstraStateMonad.m s a -> DijkstraStateMonad.wp_t s a | Prims.Tot | [
"total"
] | [] | [
"DijkstraStateMonad.m",
"DijkstraStateMonad.wp_return",
"FStar.FunctionalExtensionality.on",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.wp_put",
"DijkstraStateMonad.wp_t"
] | [
"recursion"
] | false | false | false | true | false | let rec wp_of #a #s (x: m s a) : wp_t s a =
| match x with
| Ret v -> wp_return v
| Get k -> F.on _ (fun s0 -> (wp_of (k s0)) s0)
| Put s k -> wp_put (wp_of k) s | false |
DijkstraStateMonad.fst | DijkstraStateMonad.lift_wp | val lift_wp (a: Type) (s: Type0) (wp: pure_wp a) : wp_t s a | val lift_wp (a: Type) (s: Type0) (wp: pure_wp a) : wp_t s a | let lift_wp (a:Type)
(s:Type0)
(wp:pure_wp a)
: wp_t s a
= F.on _ (fun (s0:s) (k:post_t s a) -> wp (fun a -> k (a, s0))) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 274,
"start_col": 0,
"start_line": 270
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> s: Type0 -> wp: Prims.pure_wp a -> DijkstraStateMonad.wp_t s a | Prims.Tot | [
"total"
] | [] | [
"Prims.pure_wp",
"FStar.FunctionalExtensionality.on",
"DijkstraStateMonad.post_t",
"Prims.pure_pre",
"Prims.l_True",
"FStar.Pervasives.Native.Mktuple2",
"DijkstraStateMonad.wp_t"
] | [] | false | false | false | true | false | let lift_wp (a: Type) (s: Type0) (wp: pure_wp a) : wp_t s a =
| F.on _ (fun (s0: s) (k: post_t s a) -> wp (fun a -> k (a, s0))) | false |
DijkstraStateMonad.fst | DijkstraStateMonad.run | val run (#a #s: _) (m: m s a) (s0: s) (post: post_t s a)
: Pure (a * s) (requires wp_of m s0 post) (ensures post) | val run (#a #s: _) (m: m s a) (s0: s) (post: post_t s a)
: Pure (a * s) (requires wp_of m s0 post) (ensures post) | let rec run (#a:_) (#s:_) (m:m s a) (s0:s) (post: post_t s a)
: Pure (a * s)
(requires
wp_of m s0 post)
(ensures
post)
= match m with
| Ret x -> (x, s0)
| Get k ->
run (k s0) s0 post
| Put s k ->
run k s post | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 100,
"start_col": 0,
"start_line": 89
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: DijkstraStateMonad.m s a -> s0: s -> post: DijkstraStateMonad.post_t s a -> Prims.Pure (a * s) | Prims.Pure | [] | [] | [
"DijkstraStateMonad.m",
"DijkstraStateMonad.post_t",
"FStar.Pervasives.Native.Mktuple2",
"DijkstraStateMonad.run",
"FStar.Pervasives.Native.tuple2",
"DijkstraStateMonad.wp_of"
] | [
"recursion"
] | false | false | false | false | false | let rec run (#a #s: _) (m: m s a) (s0: s) (post: post_t s a)
: Pure (a * s) (requires wp_of m s0 post) (ensures post) =
| match m with
| Ret x -> (x, s0)
| Get k -> run (k s0) s0 post
| Put s k -> run k s post | false |
DijkstraStateMonad.fst | DijkstraStateMonad.iput | val iput (s: _) (x: s) : irepr unit s (wp_of (Put x (Ret ()))) | val iput (s: _) (x: s) : irepr unit s (wp_of (Put x (Ret ()))) | let iput s (x:s) : irepr unit s (wp_of (Put x (Ret ()))) =
fun () -> Put x (Ret ()) | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 242,
"start_col": 0,
"start_line": 241
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Type0 -> x: s
-> DijkstraStateMonad.irepr Prims.unit
s
(DijkstraStateMonad.wp_of (DijkstraStateMonad.Put x (DijkstraStateMonad.Ret ()))) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"DijkstraStateMonad.Put",
"DijkstraStateMonad.Ret",
"DijkstraStateMonad.m",
"FStar.FunctionalExtensionality.feq",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.irepr"
] | [] | false | false | false | false | false | let iput s (x: s) : irepr unit s (wp_of (Put x (Ret ()))) =
| fun () -> Put x (Ret ()) | false |
DijkstraStateMonad.fst | DijkstraStateMonad.iget | val iget (s: _) : irepr s s (wp_of (Get Ret)) | val iget (s: _) : irepr s s (wp_of (Get Ret)) | let iget s : irepr s s (wp_of (Get Ret)) =
fun () -> Get Ret | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 240,
"start_col": 0,
"start_line": 239
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Type0
-> DijkstraStateMonad.irepr s
s
(DijkstraStateMonad.wp_of (DijkstraStateMonad.Get DijkstraStateMonad.Ret)) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"DijkstraStateMonad.Get",
"DijkstraStateMonad.Ret",
"DijkstraStateMonad.m",
"FStar.FunctionalExtensionality.feq",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.irepr"
] | [] | false | false | false | true | false | let iget s : irepr s s (wp_of (Get Ret)) =
| fun () -> Get Ret | false |
DijkstraStateMonad.fst | DijkstraStateMonad.ireturn | val ireturn (a: Type) (x: a) (s: Type) : irepr a s (wp_return x) | val ireturn (a: Type) (x: a) (s: Type) : irepr a s (wp_return x) | let ireturn (a:Type) (x:a) (s:Type)
: irepr a s (wp_return x)
= fun () -> Ret x | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 132,
"start_col": 0,
"start_line": 130
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> x: a -> s: Type0 -> DijkstraStateMonad.irepr a s (DijkstraStateMonad.wp_return x) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"DijkstraStateMonad.Ret",
"DijkstraStateMonad.m",
"FStar.FunctionalExtensionality.feq",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.wp_return",
"DijkstraStateMonad.irepr"
] | [] | false | false | false | false | false | let ireturn (a: Type) (x: a) (s: Type) : irepr a s (wp_return x) =
| fun () -> Ret x | false |
Vale.Arch.HeapImpl.fsti | Vale.Arch.HeapImpl.heaplet_id | val heaplet_id : Type0 | let heaplet_id = n:nat{n < 16} | {
"file_name": "vale/code/arch/Vale.Arch.HeapImpl.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 16,
"start_col": 0,
"start_line": 16
} | module Vale.Arch.HeapImpl
open FStar.Mul
open Vale.Arch.HeapTypes_s
module Map16 = Vale.Lib.Map16
(**
Define abstract (or mostly abstract) types for use by Vale.X64.Decls.fsti.
Note: the untrusted memory definitions are split among 3 modules:
- Vale.Arch.HeapImpl
- Vale.Arch.Heap
- Vale.X64.Memory
This splitting is d... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Arch.HeapImpl.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan"
] | [] | false | false | false | true | true | let heaplet_id =
| n: nat{n < 16} | false | |
Vale.Arch.HeapImpl.fsti | Vale.Arch.HeapImpl.full_heap_taint | val full_heap_taint (vfh: vale_full_heap) : memTaint_t | val full_heap_taint (vfh: vale_full_heap) : memTaint_t | let full_heap_taint (vfh:vale_full_heap) : memTaint_t =
vfh.vf_layout.vl_taint | {
"file_name": "vale/code/arch/Vale.Arch.HeapImpl.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 48,
"start_col": 7,
"start_line": 47
} | module Vale.Arch.HeapImpl
open FStar.Mul
open Vale.Arch.HeapTypes_s
module Map16 = Vale.Lib.Map16
(**
Define abstract (or mostly abstract) types for use by Vale.X64.Decls.fsti.
Note: the untrusted memory definitions are split among 3 modules:
- Vale.Arch.HeapImpl
- Vale.Arch.Heap
- Vale.X64.Memory
This splitting is d... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Arch.HeapImpl.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | vfh: Vale.Arch.HeapImpl.vale_full_heap -> Vale.Arch.HeapTypes_s.memTaint_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.Arch.HeapImpl.__proj__Mkvale_heap_layout__item__vl_taint",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_layout",
"Vale.Arch.HeapTypes_s.memTaint_t"
] | [] | false | false | false | true | false | let full_heap_taint (vfh: vale_full_heap) : memTaint_t =
| vfh.vf_layout.vl_taint | false |
Vale.Arch.HeapImpl.fsti | Vale.Arch.HeapImpl.vale_heaplets | val vale_heaplets : Type | let vale_heaplets = Map16.map16 vale_heap | {
"file_name": "vale/code/arch/Vale.Arch.HeapImpl.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 39,
"start_col": 0,
"start_line": 39
} | module Vale.Arch.HeapImpl
open FStar.Mul
open Vale.Arch.HeapTypes_s
module Map16 = Vale.Lib.Map16
(**
Define abstract (or mostly abstract) types for use by Vale.X64.Decls.fsti.
Note: the untrusted memory definitions are split among 3 modules:
- Vale.Arch.HeapImpl
- Vale.Arch.Heap
- Vale.X64.Memory
This splitting is d... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapTypes_s.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Arch.HeapImpl.fsti"
} | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapTypes_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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.Lib.Map16.map16",
"Vale.Arch.HeapImpl.vale_heap"
] | [] | false | false | false | true | true | let vale_heaplets =
| Map16.map16 vale_heap | false | |
DijkstraStateMonad.fst | DijkstraStateMonad.bind_wp_lem | val bind_wp_lem (#a #b #s: _) (f: m s a) (g: (a -> m s b))
: Lemma (wp_of (bind_m f g) == bind_wp (wp_of f) (wp_of *. g)) | val bind_wp_lem (#a #b #s: _) (f: m s a) (g: (a -> m s b))
: Lemma (wp_of (bind_m f g) == bind_wp (wp_of f) (wp_of *. g)) | let bind_wp_lem (#a:_) (#b:_) (#s:_) (f:m s a) (g: (a -> m s b))
: Lemma (wp_of (bind_m f g) == bind_wp (wp_of f) (wp_of *. g))
= bind_wp_lem' f g | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 197,
"start_col": 0,
"start_line": 195
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: DijkstraStateMonad.m s a -> g: (_: a -> DijkstraStateMonad.m s b)
-> FStar.Pervasives.Lemma
(ensures
DijkstraStateMonad.wp_of (DijkstraStateMonad.bind_m f g) ==
DijkstraStateMonad.bind_wp (DijkstraStateMonad.wp_of f) (DijkstraStateMonad.wp_of *. g)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DijkstraStateMonad.m",
"DijkstraStateMonad.bind_wp_lem'",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"DijkstraStateMonad.wp_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.bind_m",
"DijkstraStateMonad.bind_wp",
"DijkstraStateMonad.op_Star_Dot",
"Prims.Nil",
"FStar.Pervas... | [] | true | false | true | false | false | let bind_wp_lem (#a #b #s: _) (f: m s a) (g: (a -> m s b))
: Lemma (wp_of (bind_m f g) == bind_wp (wp_of f) (wp_of *. g)) =
| bind_wp_lem' f g | false |
DijkstraStateMonad.fst | DijkstraStateMonad.bind_wp_lem' | val bind_wp_lem' (#a: Type u#aa) (#b: Type u#bb) (#s: _) (f: m s a) (g: (a -> m s b))
: Lemma ((wp_of (bind_m f g)) `F.feq` (bind_wp (wp_of f) (wp_of *. g))) | val bind_wp_lem' (#a: Type u#aa) (#b: Type u#bb) (#s: _) (f: m s a) (g: (a -> m s b))
: Lemma ((wp_of (bind_m f g)) `F.feq` (bind_wp (wp_of f) (wp_of *. g))) | let rec bind_wp_lem' (#a:Type u#aa) (#b:Type u#bb) (#s:_) (f:m s a) (g: (a -> m s b))
: Lemma (wp_of (bind_m f g) `F.feq` bind_wp (wp_of f) (wp_of *. g))
= match f with
| Ret x ->
assert (bind_m f g == g x);
assert_norm (wp_of #a #s (Ret x) `F.feq` (fun s0 post -> post (x, s0)));
assert (wp_of... | {
"file_name": "examples/layeredeffects/DijkstraStateMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 192,
"start_col": 0,
"start_line": 157
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abb... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: DijkstraStateMonad.m s a -> g: (_: a -> DijkstraStateMonad.m s b)
-> FStar.Pervasives.Lemma
(ensures
FStar.FunctionalExtensionality.feq (DijkstraStateMonad.wp_of (DijkstraStateMonad.bind_m f g))
(DijkstraStateMonad.bind_wp (DijkstraStateMonad.wp_of f) (DijkstraStateMonad.wp_of *. g))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DijkstraStateMonad.m",
"FStar.Tactics.Effect.assert_by_tactic",
"FStar.FunctionalExtensionality.feq",
"DijkstraStateMonad.post_t",
"DijkstraStateMonad.wp_of",
"DijkstraStateMonad.bind_m",
"DijkstraStateMonad.Ret",
"DijkstraStateMonad.bind_wp",
"DijkstraStateMonad.op_Star_Dot",
"DijkstraStateMonad... | [
"recursion"
] | false | false | true | false | false | let rec bind_wp_lem' (#a: Type u#aa) (#b: Type u#bb) (#s: _) (f: m s a) (g: (a -> m s b))
: Lemma ((wp_of (bind_m f g)) `F.feq` (bind_wp (wp_of f) (wp_of *. g))) =
| match f with
| Ret x ->
assert (bind_m f g == g x);
assert_norm ((wp_of #a #s (Ret x)) `F.feq` (fun s0 post -> post (x, s0)));
FStar.Tactics.Effect.assert_by_tactic ((wp_of (bind_m (Ret x) g))
`F.feq`
(bind_wp (wp_of (Ret x)) (wp_of *. g)))
(fun _ ->
();
(T.norm [zeta; iota; delta]... | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.int_has_eq | [@@ FStar.Tactics.Typeclasses.tcinstance]
val int_has_eq:deq int | [@@ FStar.Tactics.Typeclasses.tcinstance]
val int_has_eq:deq int | instance int_has_eq : deq int = eq_instance_of_eqtype | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 29,
"start_col": 0,
"start_line": 29
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Class.Eq.Raw.deq Prims.int | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.eq_instance_of_eqtype",
"Prims.int"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let int_has_eq:deq int =
| eq_instance_of_eqtype | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.eq_instance_of_eqtype | val eq_instance_of_eqtype (#a: eqtype) : deq a | val eq_instance_of_eqtype (#a: eqtype) : deq a | let eq_instance_of_eqtype (#a:eqtype) : deq a = {
eq = (fun x y -> x = y)
} | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 24,
"start_col": 0,
"start_line": 22
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Class.Eq.Raw.deq a | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.Class.Eq.Raw.Mkdeq",
"Prims.op_Equality",
"Prims.bool",
"FStar.Class.Eq.Raw.deq"
] | [] | false | false | false | false | false | let eq_instance_of_eqtype (#a: eqtype) : deq a =
| { eq = (fun x y -> x = y) } | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.bool_has_eq | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bool_has_eq:deq bool | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bool_has_eq:deq bool | instance bool_has_eq : deq bool = eq_instance_of_eqtype | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Class.Eq.Raw.deq Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.eq_instance_of_eqtype",
"Prims.bool"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bool_has_eq:deq bool =
| eq_instance_of_eqtype | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.unit_has_eq | [@@ FStar.Tactics.Typeclasses.tcinstance]
val unit_has_eq:deq unit | [@@ FStar.Tactics.Typeclasses.tcinstance]
val unit_has_eq:deq unit | instance unit_has_eq : deq unit = eq_instance_of_eqtype | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Class.Eq.Raw.deq Prims.unit | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.eq_instance_of_eqtype",
"Prims.unit"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let unit_has_eq:deq unit =
| eq_instance_of_eqtype | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.string_has_eq | [@@ FStar.Tactics.Typeclasses.tcinstance]
val string_has_eq:deq string | [@@ FStar.Tactics.Typeclasses.tcinstance]
val string_has_eq:deq string | instance string_has_eq : deq string = eq_instance_of_eqtype | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Class.Eq.Raw.deq Prims.string | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.eq_instance_of_eqtype",
"Prims.string"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let string_has_eq:deq string =
| eq_instance_of_eqtype | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.eq_option | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_option: deq 'a -> deq (option 'a) | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_option: deq 'a -> deq (option 'a) | instance eq_option (_ : deq 'a) : deq (option 'a) = {
eq = (fun o1 o2 ->
match o1, o2 with
| None, None -> true
| Some x, Some y -> eq x y
| _, _ -> false);
} | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 54,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Class.Eq.Raw.deq 'a -> FStar.Class.Eq.Raw.deq (FStar.Pervasives.Native.option 'a) | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.deq",
"FStar.Class.Eq.Raw.Mkdeq",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Class.Eq.Raw.eq",
"Prims.bool"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let eq_option (_: deq 'a) : deq (option 'a) =
| {
eq
=
(fun o1 o2 ->
match o1, o2 with
| None, None -> true
| Some x, Some y -> eq x y
| _, _ -> false)
} | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.eq_list | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_list: deq 'a -> deq (list 'a) | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_list: deq 'a -> deq (list 'a) | instance eq_list (_ : deq 'a) : deq (list 'a) = {
eq = eqList eq;
} | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 42,
"start_col": 0,
"start_line": 40
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Class.Eq.Raw.deq 'a -> FStar.Class.Eq.Raw.deq (Prims.list 'a) | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.deq",
"FStar.Class.Eq.Raw.Mkdeq",
"Prims.list",
"FStar.Class.Eq.Raw.eqList",
"FStar.Class.Eq.Raw.eq"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let eq_list (_: deq 'a) : deq (list 'a) =
| { eq = eqList eq } | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.eq_pair | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_pair: deq 'a -> deq 'b -> deq ('a * 'b) | [@@ FStar.Tactics.Typeclasses.tcinstance]
val eq_pair: deq 'a -> deq 'b -> deq ('a * 'b) | instance eq_pair (_ : deq 'a) (_ : deq 'b) : deq ('a * 'b) = {
eq = (fun (a,b) (c,d) -> eq a c && eq b d)
} | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 46,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Class.Eq.Raw.deq 'a -> _: FStar.Class.Eq.Raw.deq 'b -> FStar.Class.Eq.Raw.deq ('a * 'b) | Prims.Tot | [
"total"
] | [] | [
"FStar.Class.Eq.Raw.deq",
"FStar.Class.Eq.Raw.Mkdeq",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_AmpAmp",
"FStar.Class.Eq.Raw.eq",
"Prims.bool"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let eq_pair (_: deq 'a) (_: deq 'b) : deq ('a * 'b) =
| { eq = (fun (a, b) (c, d) -> eq a c && eq b d) } | false |
Hacl.Impl.FFDHE.Constants.fst | Hacl.Impl.FFDHE.Constants.ffdhe_p8192 | val ffdhe_p8192:x: glbuffer pub_uint8 1024ul {witnessed x S.ffdhe_p8192 /\ recallable x} | val ffdhe_p8192:x: glbuffer pub_uint8 1024ul {witnessed x S.ffdhe_p8192 /\ recallable x} | let ffdhe_p8192 :x:glbuffer pub_uint8 1024ul{witnessed x S.ffdhe_p8192 /\ recallable x} =
createL_global S.list_ffdhe_p8192 | {
"file_name": "code/ffdhe/Hacl.Impl.FFDHE.Constants.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | module Hacl.Impl.FFDHE.Constants
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module S = Spec.FFDHE
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let ffdhe_g2 :x:glbuffer pub_uint8 1ul{witnessed x S.ffdhe_g2 /\ recallable x} =
c... | {
"checked_file": "/",
"dependencies": [
"Spec.FFDHE.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperS... | [
{
"abbrev": true,
"full_module": "Spec.FFDHE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": "Lib.Buffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x:
(c:
Lib.Buffer.lbuffer_t Lib.Buffer.CONST
(Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.PUB)
(1024ul <: FStar.UInt32.t) {LowStar.ConstBuffer.qual_of c == LowStar.ConstBuffer.IMMUTABLE})
{Lib.Buffer.witnessed x Spec.FFDHE.ffdhe_p8192 /\ Lib.Buffer.recallable x} | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.createL_global",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB",
"Spec.FFDHE.list_ffdhe_p8192",
"Lib.Buffer.glbuffer",
"Lib.IntTypes.size",
"FStar.Pervasives.normalize_term",
"Lib.IntTypes.size_nat",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | false | false | let ffdhe_p8192:x: glbuffer pub_uint8 1024ul {witnessed x S.ffdhe_p8192 /\ recallable x} =
| createL_global S.list_ffdhe_p8192 | false |
FStar.Class.Eq.Raw.fst | FStar.Class.Eq.Raw.eqList | val eqList (#a: _) (eq: (a -> a -> bool)) (xs ys: list a) : Tot bool | val eqList (#a: _) (eq: (a -> a -> bool)) (xs ys: list a) : Tot bool | let rec eqList #a (eq : a -> a -> bool) (xs ys : list a) : Tot bool =
match xs, ys with
| [], [] -> true
| x::xs, y::ys -> eq x y && eqList eq xs ys
| _, _ -> false | {
"file_name": "ulib/FStar.Class.Eq.Raw.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 38,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2008-2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.Class.Eq.Raw.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Class.Eq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eq: (_: a -> _: a -> Prims.bool) -> xs: Prims.list a -> ys: Prims.list a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_AmpAmp",
"FStar.Class.Eq.Raw.eqList"
] | [
"recursion"
] | false | false | false | true | false | let rec eqList #a (eq: (a -> a -> bool)) (xs: list a) (ys: list a) : Tot bool =
| match xs, ys with
| [], [] -> true
| x :: xs, y :: ys -> eq x y && eqList eq xs ys
| _, _ -> false | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.serialize_u16' | val serialize_u16':bare_serializer U16.t | val serialize_u16':bare_serializer U16.t | let serialize_u16' : bare_serializer U16.t = fun x ->
let (lo, hi) = Aux.encode_u16 x in
Seq.append (Seq.create 1 lo) (Seq.create 1 hi) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 34,
"start_col": 0,
"start_line": 32
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | MiniParse.Spec.Base.bare_serializer FStar.UInt16.t | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt16.t",
"FStar.UInt8.t",
"FStar.Seq.Base.append",
"MiniParse.Spec.Base.byte",
"FStar.Seq.Base.create",
"MiniParse.Spec.Base.bytes",
"FStar.Pervasives.Native.tuple2",
"MiniParse.Spec.Int.Aux.encode_u16"
] | [] | false | false | false | true | false | let serialize_u16':bare_serializer U16.t =
| fun x ->
let lo, hi = Aux.encode_u16 x in
Seq.append (Seq.create 1 lo) (Seq.create 1 hi) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.bounded_u16_eq | val bounded_u16_eq (b: nat) : Tot (bounded_u16 b -> bounded_u16 b -> Tot bool) | val bounded_u16_eq (b: nat) : Tot (bounded_u16 b -> bounded_u16 b -> Tot bool) | let bounded_u16_eq (b: nat) : Tot (bounded_u16 b -> bounded_u16 b -> Tot bool) =
op_Equality | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 117,
"start_col": 0,
"start_line": 116
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.nat -> _: MiniParse.Spec.Int.bounded_u16 b -> _: MiniParse.Spec.Int.bounded_u16 b
-> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Equality",
"MiniParse.Spec.Int.bounded_u16",
"Prims.bool"
] | [] | false | false | false | false | false | let bounded_u16_eq (b: nat) : Tot (bounded_u16 b -> bounded_u16 b -> Tot bool) =
| op_Equality | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.parse_u8 | val parse_u8:parser_spec U8.t | val parse_u8:parser_spec U8.t | let parse_u8 : parser_spec U8.t = make_total_constant_size_parser 1 U8.t (fun x -> Seq.index x 0) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 97,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | MiniParse.Spec.Base.parser_spec FStar.UInt8.t | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Spec.Combinators.make_total_constant_size_parser",
"FStar.UInt8.t",
"MiniParse.Spec.Base.bytes",
"Prims.eq2",
"Prims.nat",
"FStar.Seq.Base.length",
"MiniParse.Spec.Base.byte",
"FStar.Seq.Base.index"
] | [] | false | false | false | true | false | let parse_u8:parser_spec U8.t =
| make_total_constant_size_parser 1 U8.t (fun x -> Seq.index x 0) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.serialize_u8 | val serialize_u8:serializer_spec parse_u8 | val serialize_u8:serializer_spec parse_u8 | let serialize_u8 : serializer_spec parse_u8 = Serializer (fun x -> Seq.create 1 x) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | MiniParse.Spec.Base.serializer_spec MiniParse.Spec.Int.parse_u8 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Spec.Base.Serializer",
"MiniParse.Spec.Base.byte",
"MiniParse.Spec.Int.parse_u8",
"FStar.Seq.Base.create",
"MiniParse.Spec.Base.bytes"
] | [] | false | false | false | true | false | let serialize_u8:serializer_spec parse_u8 =
| Serializer (fun x -> Seq.create 1 x) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.parse_u16 | val parse_u16:parser_spec U16.t | val parse_u16:parser_spec U16.t | let parse_u16 : parser_spec U16.t = make_total_constant_size_parser 2 U16.t parse_u16_aux | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 89,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | MiniParse.Spec.Base.parser_spec FStar.UInt16.t | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Spec.Combinators.make_total_constant_size_parser",
"FStar.UInt16.t",
"MiniParse.Spec.Int.parse_u16_aux"
] | [] | false | false | false | true | false | let parse_u16:parser_spec U16.t =
| make_total_constant_size_parser 2 U16.t parse_u16_aux | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.mk_u16 | val mk_u16 (n: nat{n < 65536}) : Tot U16.t | val mk_u16 (n: nat{n < 65536}) : Tot U16.t | let mk_u16 (n: nat { n < 65536 } ) : Tot U16.t = U16.uint_to_t n | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat{n < 65536} -> FStar.UInt16.t | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt16.uint_to_t",
"FStar.UInt16.t"
] | [] | false | false | false | false | false | let mk_u16 (n: nat{n < 65536}) : Tot U16.t =
| U16.uint_to_t n | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.parse_u16_aux | val parse_u16_aux:(f:
(s: bytes{Seq.length s == 2} -> GTot U16.t){make_total_constant_size_parser_precond 2 U16.t f}) | val parse_u16_aux:(f:
(s: bytes{Seq.length s == 2} -> GTot U16.t){make_total_constant_size_parser_precond 2 U16.t f}) | let parse_u16_aux : (f: ((s: bytes { Seq.length s == 2 } ) -> GTot U16.t) { make_total_constant_size_parser_precond 2 U16.t f } ) =
fun x -> Aux.decode_u16 (Seq.index x 0, Seq.index x 1) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 28,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f:
(s: MiniParse.Spec.Base.bytes{FStar.Seq.Base.length s == 2} -> Prims.GTot FStar.UInt16.t)
{MiniParse.Spec.Combinators.make_total_constant_size_parser_precond 2 FStar.UInt16.t f} | Prims.GTot | [
"sometrivial"
] | [] | [
"MiniParse.Spec.Base.bytes",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"MiniParse.Spec.Base.byte",
"MiniParse.Spec.Int.Aux.decode_u16",
"FStar.Pervasives.Native.Mktuple2",
"FStar.UInt8.t",
"FStar.Seq.Base.index",
"FStar.UInt16.t"
] | [] | false | false | false | false | false | let parse_u16_aux:(f:
(s: bytes{Seq.length s == 2} -> GTot U16.t){make_total_constant_size_parser_precond 2 U16.t f}) =
| fun x -> Aux.decode_u16 (Seq.index x 0, Seq.index x 1) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.bounded_u16 | val bounded_u16 (b: nat) : Tot eqtype | val bounded_u16 (b: nat) : Tot eqtype | let bounded_u16 (b: nat) : Tot eqtype = (x: U16.t { U16.v x < b } ) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.nat -> Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt16.t",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt16.v",
"Prims.eqtype"
] | [] | false | false | false | true | false | let bounded_u16 (b: nat) : Tot eqtype =
| (x: U16.t{U16.v x < b}) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.pred_pre | val pred_pre
(bound: nat{bound > 0 /\ bound <= 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 | val pred_pre
(bound: nat{bound > 0 /\ bound <= 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 | let pred_pre
(bound: nat { bound > 0 /\ bound <= 65536 } )
(pred: bounded_u16 bound -> GTot Type0)
(x: bounded_u16 (bound - 1))
: GTot Type0
= pred (x `U16.add` 1us) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 75,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
bound: Prims.nat{bound > 0 /\ bound <= 65536} ->
pred: (_: MiniParse.Spec.Int.bounded_u16 bound -> Prims.GTot Type0) ->
x: MiniParse.Spec.Int.bounded_u16 (bound - 1)
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"Prims.op_LessThanOrEqual",
"MiniParse.Spec.Int.bounded_u16",
"Prims.op_Subtraction",
"FStar.UInt16.add",
"FStar.UInt16.__uint_to_t"
] | [] | false | false | false | false | true | let pred_pre
(bound: nat{bound > 0 /\ bound <= 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 =
| pred (x `U16.add` 1us) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.serialize_bounded_u16 | val serialize_bounded_u16 (b: nat) : Tot (serializer_spec (parse_bounded_u16 b)) | val serialize_bounded_u16 (b: nat) : Tot (serializer_spec (parse_bounded_u16 b)) | let serialize_bounded_u16 (b: nat) : Tot (serializer_spec (parse_bounded_u16 b)) =
serialize_synth
(serialize_filter serialize_u16 (fun x -> U16.v x < b))
(fun x -> x <: bounded_u16 b)
(fun x -> x)
() | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 130,
"start_col": 0,
"start_line": 125
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.nat -> MiniParse.Spec.Base.serializer_spec (MiniParse.Spec.Int.parse_bounded_u16 b) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"MiniParse.Spec.Combinators.serialize_synth",
"FStar.UInt16.t",
"Prims.eq2",
"Prims.bool",
"Prims.op_LessThan",
"FStar.UInt16.v",
"MiniParse.Spec.Int.bounded_u16",
"MiniParse.Spec.Combinators.parse_filter",
"MiniParse.Spec.Int.parse_u16",
"MiniParse.Spec.Combinators.serialize_filter... | [] | false | false | false | false | false | let serialize_bounded_u16 (b: nat) : Tot (serializer_spec (parse_bounded_u16 b)) =
| serialize_synth (serialize_filter serialize_u16 (fun x -> U16.v x < b))
(fun x -> x <: bounded_u16 b)
(fun x -> x)
() | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.forall_bounded_u16 | val forall_bounded_u16 (bound: nat) (pred: (bounded_u16 bound -> GTot Type0)) : GTot Type0 | val forall_bounded_u16 (bound: nat) (pred: (bounded_u16 bound -> GTot Type0)) : GTot Type0 | let rec forall_bounded_u16
(bound: nat)
(pred: (bounded_u16 bound -> GTot Type0))
: GTot Type0
= if bound = 0
then True
else if bound > 65536
then
forall_bounded_u16 (bound - 1) (pred_large_bound bound pred)
else
pred 0us /\ forall_bounded_u16 (bound - 1) (pred_pre bound pred) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 94,
"start_col": 0,
"start_line": 84
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | bound: Prims.nat -> pred: (_: MiniParse.Spec.Int.bounded_u16 bound -> Prims.GTot Type0)
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"MiniParse.Spec.Int.bounded_u16",
"Prims.op_Equality",
"Prims.int",
"Prims.l_True",
"Prims.bool",
"Prims.op_GreaterThan",
"MiniParse.Spec.Int.forall_bounded_u16",
"Prims.op_Subtraction",
"MiniParse.Spec.Int.pred_large_bound",
"Prims.l_and",
"FStar.UInt16.__uint_to_t",
"MiniParse... | [
"recursion"
] | false | false | false | false | true | let rec forall_bounded_u16 (bound: nat) (pred: (bounded_u16 bound -> GTot Type0)) : GTot Type0 =
| if bound = 0
then True
else
if bound > 65536
then forall_bounded_u16 (bound - 1) (pred_large_bound bound pred)
else pred 0us /\ forall_bounded_u16 (bound - 1) (pred_pre bound pred) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.serialize_u16 | val serialize_u16:serializer_spec parse_u16 | val serialize_u16:serializer_spec parse_u16 | let serialize_u16 : serializer_spec parse_u16 = Serializer serialize_u16' | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 38,
"start_col": 0,
"start_line": 38
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | MiniParse.Spec.Base.serializer_spec MiniParse.Spec.Int.parse_u16 | Prims.Tot | [
"total"
] | [] | [
"MiniParse.Spec.Base.Serializer",
"FStar.UInt16.t",
"MiniParse.Spec.Int.parse_u16",
"MiniParse.Spec.Int.serialize_u16'"
] | [] | false | false | false | true | false | let serialize_u16:serializer_spec parse_u16 =
| Serializer serialize_u16' | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.pred_large_bound | val pred_large_bound
(bound: nat{bound > 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 | val pred_large_bound
(bound: nat{bound > 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 | let pred_large_bound
(bound: nat { bound > 65536 } )
(pred: bounded_u16 bound -> GTot Type0)
(x: bounded_u16 (bound - 1))
: GTot Type0
= pred (x <: U16.t) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 82,
"start_col": 0,
"start_line": 77
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
bound: Prims.nat{bound > 65536} ->
pred: (_: MiniParse.Spec.Int.bounded_u16 bound -> Prims.GTot Type0) ->
x: MiniParse.Spec.Int.bounded_u16 (bound - 1)
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_GreaterThan",
"MiniParse.Spec.Int.bounded_u16",
"Prims.op_Subtraction",
"FStar.UInt16.t"
] | [] | false | false | false | false | true | let pred_large_bound
(bound: nat{bound > 65536})
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 (bound - 1))
: GTot Type0 =
| pred (x <: U16.t) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.forall_bounded_u16_elim | val forall_bounded_u16_elim
(bound: nat)
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 bound)
: Lemma (requires (forall_bounded_u16 bound pred)) (ensures (pred x)) (decreases bound) | val forall_bounded_u16_elim
(bound: nat)
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 bound)
: Lemma (requires (forall_bounded_u16 bound pred)) (ensures (pred x)) (decreases bound) | let rec forall_bounded_u16_elim
(bound: nat)
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 bound)
: Lemma
(requires (forall_bounded_u16 bound pred))
(ensures (pred x))
(decreases bound)
= if bound = 0
then ()
else if bound > 65536
then
let x' : bounded_u16 (bound - 1) = x <: U16.t in
... | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 113,
"start_col": 0,
"start_line": 96
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
bound: Prims.nat ->
pred: (_: MiniParse.Spec.Int.bounded_u16 bound -> Prims.GTot Type0) ->
x: MiniParse.Spec.Int.bounded_u16 bound
-> FStar.Pervasives.Lemma (requires MiniParse.Spec.Int.forall_bounded_u16 bound pred)
(ensures pred x)
(decreases bound) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"MiniParse.Spec.Int.bounded_u16",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Prims.op_GreaterThan",
"MiniParse.Spec.Int.forall_bounded_u16_elim",
"Prims.op_Subtraction",
"MiniParse.Spec.Int.pred_large_bound",
"FStar.UInt16.t",
"FStar.UInt16.__uint_to_t",
"MiniParse.Spec.Int.... | [
"recursion"
] | false | false | true | false | false | let rec forall_bounded_u16_elim
(bound: nat)
(pred: (bounded_u16 bound -> GTot Type0))
(x: bounded_u16 bound)
: Lemma (requires (forall_bounded_u16 bound pred)) (ensures (pred x)) (decreases bound) =
| if bound = 0
then ()
else
if bound > 65536
then
let x':bounded_u16 (bound - 1) = x <: U16.t in
forall_bounded_u16_elim (bound - 1) (pred_large_bound bound pred) x'
else
if x = 0us
then ()
else forall_bounded_u16_elim (bound - 1) (pred_pre bound pred) (x `U16.sub` 1us) | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.map_u16_to_bounded_u16 | val map_u16_to_bounded_u16
(a: Type)
(bound: nat)
(f: (a -> Tot U16.t))
(g: (x: a -> Tot (squash (U16.v (f x) < bound))))
(a': Type)
(bound': nat)
(u1: squash (a == a'))
(u2: squash (bound == bound'))
: Tot (bounded_fun a' bound') | val map_u16_to_bounded_u16
(a: Type)
(bound: nat)
(f: (a -> Tot U16.t))
(g: (x: a -> Tot (squash (U16.v (f x) < bound))))
(a': Type)
(bound': nat)
(u1: squash (a == a'))
(u2: squash (bound == bound'))
: Tot (bounded_fun a' bound') | let map_u16_to_bounded_u16
(a: Type)
(bound: nat)
(f: (a -> Tot U16.t))
(g: (x: a) -> Tot (squash (U16.v (f x) < bound)))
(a' : Type)
(bound' : nat)
(u1: squash (a == a'))
(u2: squash (bound == bound'))
: Tot (bounded_fun a' bound')
= fun x ->
[@@inline_let]
let _ = g x in
[@@inline_let]
let y' ... | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 68,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
bound: Prims.nat ->
f: (_: a -> FStar.UInt16.t) ->
g: (x: a -> Prims.squash (FStar.UInt16.v (f x) < bound)) ->
a': Type ->
bound': Prims.nat ->
u1: Prims.squash (a == a') ->
u2: Prims.squash (bound == bound')
-> MiniParse.Spec.Int.bounded_fun a' bound' | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.UInt16.t",
"Prims.squash",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt16.v",
"Prims.eq2",
"MiniParse.Spec.Int.bounded_u16",
"MiniParse.Spec.Int.bounded_fun"
] | [] | false | false | false | false | false | let map_u16_to_bounded_u16
(a: Type)
(bound: nat)
(f: (a -> Tot U16.t))
(g: (x: a -> Tot (squash (U16.v (f x) < bound))))
(a': Type)
(bound': nat)
(u1: squash (a == a'))
(u2: squash (bound == bound'))
: Tot (bounded_fun a' bound') =
| fun x ->
[@@ inline_let ]let _ = g x in
[@@ inline_let ]let y':bounded_u16 bound = f x in
y' | false |
MiniParse.Spec.Int.fst | MiniParse.Spec.Int.parse_bounded_u16 | val parse_bounded_u16 (b: nat) : Tot (parser_spec (bounded_u16 b)) | val parse_bounded_u16 (b: nat) : Tot (parser_spec (bounded_u16 b)) | let parse_bounded_u16 (b: nat) : Tot (parser_spec (bounded_u16 b)) =
parse_synth
(parse_filter parse_u16 (fun x -> U16.v x < b))
(fun x -> x <: bounded_u16 b)
(fun x -> x) | {
"file_name": "examples/miniparse/MiniParse.Spec.Int.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 123,
"start_col": 0,
"start_line": 119
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"MiniParse.Spec.Int.Aux.fst.checked",
"MiniParse.Spec.Combinators.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fst... | [
{
"abbrev": true,
"full_module": "MiniParse.Spec.Int.Aux",
"short_module": "Aux"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.nat -> MiniParse.Spec.Base.parser_spec (MiniParse.Spec.Int.bounded_u16 b) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"MiniParse.Spec.Combinators.parse_synth",
"FStar.UInt16.t",
"Prims.eq2",
"Prims.bool",
"Prims.op_LessThan",
"FStar.UInt16.v",
"MiniParse.Spec.Int.bounded_u16",
"MiniParse.Spec.Combinators.parse_filter",
"MiniParse.Spec.Int.parse_u16",
"MiniParse.Spec.Base.parser_spec"
] | [] | false | false | false | false | false | let parse_bounded_u16 (b: nat) : Tot (parser_spec (bounded_u16 b)) =
| parse_synth (parse_filter parse_u16 (fun x -> U16.v x < b))
(fun x -> x <: bounded_u16 b)
(fun x -> x) | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.product | val product : l1: Prims.list a -> l2: Prims.list b -> Prims.list (a * b) | let product #a #b (l1: list a) (l2: list b) =
List.Tot.concatMap (fun x1 -> List.Tot.map (fun x2 -> (x1, x2)) l2) l1 | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list a -> l2: Prims.list b -> Prims.list (a * b) | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.List.Tot.Base.concatMap",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.Mktuple2"
] | [] | false | false | false | true | false | let product #a #b (l1: list a) (l2: list b) =
| List.Tot.concatMap (fun x1 -> List.Tot.map (fun x2 -> (x1, x2)) l2) l1 | false | |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.bind | val bind : x: Prims.squash _ -> f: (_: _ -> Prims.GTot (Prims.squash _)) -> Prims.squash _ | let bind = FStar.Squash.bind_squash | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 97,
"start_col": 0,
"start_line": 97
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.squash _ -> f: (_: _ -> Prims.GTot (Prims.squash _)) -> Prims.squash _ | Prims.Tot | [
"total"
] | [] | [
"FStar.Squash.bind_squash",
"Prims.squash"
] | [] | false | false | true | false | false | let bind =
| FStar.Squash.bind_squash | false | |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.pairs_with_sum | val pairs_with_sum (n: nat) : list (prod_with_sum n) | val pairs_with_sum (n: nat) : list (prod_with_sum n) | let pairs_with_sum (n: nat) : list (prod_with_sum n) =
pairs_with_sum' n 0 | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 28,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> Prims.list (BinaryTreesEnumeration.prod_with_sum n) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"BinaryTreesEnumeration.pairs_with_sum'",
"Prims.list",
"BinaryTreesEnumeration.prod_with_sum"
] | [] | false | false | false | false | false | let pairs_with_sum (n: nat) : list (prod_with_sum n) =
| pairs_with_sum' n 0 | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.return | val return : x: _ -> Prims.squash _ | let return = FStar.Squash.return_squash | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 98,
"start_col": 0,
"start_line": 98
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: _ -> Prims.squash _ | Prims.Tot | [
"total"
] | [] | [
"FStar.Squash.return_squash",
"Prims.squash"
] | [] | false | false | true | true | false | let return =
| FStar.Squash.return_squash | false | |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_append | val memP_append (#a: _) (x: a) (l: list a)
: Lemma
(ensures
(List.memP x l ==> (exists (l12: (list a * list a)). l == (fst l12) @ (x :: (snd l12))))) | val memP_append (#a: _) (x: a) (l: list a)
: Lemma
(ensures
(List.memP x l ==> (exists (l12: (list a * list a)). l == (fst l12) @ (x :: (snd l12))))) | let memP_append #a (x: a) (l: list a) :
Lemma
(ensures (List.memP x l ==>
(exists (l12: (list a * list a)). l == (fst l12) @ (x :: (snd l12))))) =
FStar.Classical.move_requires (memP_append_aux x) l | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 135,
"start_col": 0,
"start_line": 131
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x l ==>
(exists (l12: (Prims.list a * Prims.list a)).
l == FStar.Pervasives.Native.fst l12 @ x :: FStar.Pervasives.Native.snd l12)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Classical.move_requires",
"FStar.List.Tot.Base.memP",
"Prims.l_Exists",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.List.Tot.Base.op_At",
"FStar.Pervasives.Native.fst",
"Prims.Cons",
"FStar.Pervasives.Native.snd",
"BinaryTreesEnumeration.memP_append_aux",
"Prims.... | [] | false | false | true | false | false | let memP_append #a (x: a) (l: list a)
: Lemma
(ensures
(List.memP x l ==> (exists (l12: (list a * list a)). l == (fst l12) @ (x :: (snd l12))))) =
| FStar.Classical.move_requires (memP_append_aux x) l | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.trees_of_size | val trees_of_size (s: nat) : list (bt_with_size s) | val trees_of_size (s: nat) : list (bt_with_size s) | let rec trees_of_size (s: nat) : list (bt_with_size s) =
if s = 0 then
[Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #((bt_with_size s1) * (bt_with_size s2))
#(bt_with_size s)
(fun (t1, t2) -> Branch (t1, t2))
(produc... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 60,
"start_col": 0,
"start_line": 50
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Prims.nat -> Prims.list (BinaryTreesEnumeration.bt_with_size s) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Prims.Cons",
"BinaryTreesEnumeration.bt_with_size",
"BinaryTreesEnumeration.Leaf",
"Prims.Nil",
"Prims.bool",
"FStar.List.Tot.Base.concatMap",
"BinaryTreesEnumeration.prod_with_sum",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.map",
"FStar.Per... | [
"recursion"
] | false | false | false | false | false | let rec trees_of_size (s: nat) : list (bt_with_size s) =
| if s = 0
then [Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #((bt_with_size s1) * (bt_with_size s2))
#(bt_with_size s)
(fun (t1, t2) -> Branch (t1, t2))
(product (trees_of_size s1) (trees_of_size s2)))
(pairs_with_sum (s - 1)) | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.concatMap_flatten_map | val concatMap_flatten_map (#a #b: _) (f: (a -> list b)) (l: _)
: Lemma (List.Tot.concatMap f l == List.Tot.flatten (List.Tot.map f l)) | val concatMap_flatten_map (#a #b: _) (f: (a -> list b)) (l: _)
: Lemma (List.Tot.concatMap f l == List.Tot.flatten (List.Tot.map f l)) | let rec concatMap_flatten_map #a #b (f:a -> list b) l :
Lemma (List.Tot.concatMap f l == List.Tot.flatten (List.Tot.map f l)) =
match l with
| [] -> ()
| h :: t -> concatMap_flatten_map f t | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 70,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> Prims.list b) -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.concatMap f l == FStar.List.Tot.Base.flatten (FStar.List.Tot.Base.map f l)
) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinaryTreesEnumeration.concatMap_flatten_map",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.concatMap",
"FStar.List.Tot.Base.flatten",
"FStar.List.Tot.Base.map",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec concatMap_flatten_map #a #b (f: (a -> list b)) l
: Lemma (List.Tot.concatMap f l == List.Tot.flatten (List.Tot.map f l)) =
| match l with
| [] -> ()
| h :: t -> concatMap_flatten_map f t | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.pure_as_squash | val pure_as_squash
(#a: Type)
(#p #q: _)
($f: (x: a -> Lemma (requires (p x)) (ensures (q x))))
(x: a{p x})
: squash (q x) | val pure_as_squash
(#a: Type)
(#p #q: _)
($f: (x: a -> Lemma (requires (p x)) (ensures (q x))))
(x: a{p x})
: squash (q x) | let pure_as_squash (#a:Type)
(#p:_)
(#q:_)
($f:(x:a -> Lemma (requires (p x)) (ensures (q x))))
(x:a{p x})
: squash (q x)
= f x | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 105,
"start_col": 0,
"start_line": 99
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | $f: (x: a -> FStar.Pervasives.Lemma (requires p x) (ensures q x)) -> x: a{p x} -> Prims.squash (q x) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let pure_as_squash
(#a: Type)
(#p #q: _)
($f: (x: a -> Lemma (requires (p x)) (ensures (q x))))
(x: a{p x})
: squash (q x) =
| f x | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.flatten_app | val flatten_app (#a: _) (l1 l2: list (list a))
: Lemma (flatten (l1 @ l2) == flatten l1 @ flatten l2) | val flatten_app (#a: _) (l1 l2: list (list a))
: Lemma (flatten (l1 @ l2) == flatten l1 @ flatten l2) | let rec flatten_app #a (l1 l2: list (list a)) :
Lemma (flatten (l1 @ l2) == flatten l1 @ flatten l2) =
match l1 with
| [] -> ()
| h :: t -> flatten_app t l2;
append_assoc h (flatten t) (flatten l2) | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 143,
"start_col": 0,
"start_line": 138
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list (Prims.list a) -> l2: Prims.list (Prims.list a)
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.flatten (l1 @ l2) ==
FStar.List.Tot.Base.flatten l1 @ FStar.List.Tot.Base.flatten l2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.List.Tot.Properties.append_assoc",
"FStar.List.Tot.Base.flatten",
"Prims.unit",
"BinaryTreesEnumeration.flatten_app",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.op_At",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec flatten_app #a (l1: list (list a)) (l2: list (list a))
: Lemma (flatten (l1 @ l2) == flatten l1 @ flatten l2) =
| match l1 with
| [] -> ()
| h :: t ->
flatten_app t l2;
append_assoc h (flatten t) (flatten l2) | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_concatMap_intro | val memP_concatMap_intro (#a #b: _) (x: a) (y: b) (f: (a -> list b)) (l: list a)
: Lemma (List.memP x l ==> List.memP y (f x) ==> List.memP y (List.Tot.concatMap f l)) | val memP_concatMap_intro (#a #b: _) (x: a) (y: b) (f: (a -> list b)) (l: list a)
: Lemma (List.memP x l ==> List.memP y (f x) ==> List.memP y (List.Tot.concatMap f l)) | let memP_concatMap_intro #a #b (x: a) (y: b) (f:a -> list b) (l: list a) :
Lemma (List.memP x l ==>
List.memP y (f x) ==>
List.memP y (List.Tot.concatMap f l)) =
concatMap_flatten_map f l;
memP_map_intro f x l;
memP_flatten_intro y (f x) (List.Tot.map f l) | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 228,
"start_col": 0,
"start_line": 222
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> y: b -> f: (_: a -> Prims.list b) -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x l ==>
FStar.List.Tot.Base.memP y (f x) ==>
FStar.List.Tot.Base.memP y (FStar.List.Tot.Base.concatMap f l)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinaryTreesEnumeration.memP_flatten_intro",
"FStar.List.Tot.Base.map",
"Prims.unit",
"FStar.List.Tot.Properties.memP_map_intro",
"BinaryTreesEnumeration.concatMap_flatten_map",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.concatMa... | [] | true | false | true | false | false | let memP_concatMap_intro #a #b (x: a) (y: b) (f: (a -> list b)) (l: list a)
: Lemma (List.memP x l ==> List.memP y (f x) ==> List.memP y (List.Tot.concatMap f l)) =
| concatMap_flatten_map f l;
memP_map_intro f x l;
memP_flatten_intro y (f x) (List.Tot.map f l) | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_append_aux | val memP_append_aux (#a: _) (x: a) (l: list a)
: Lemma (requires (List.memP x l))
(ensures (exists (l12: (list a * list a)). l == fst l12 @ x :: snd l12)) | val memP_append_aux (#a: _) (x: a) (l: list a)
: Lemma (requires (List.memP x l))
(ensures (exists (l12: (list a * list a)). l == fst l12 @ x :: snd l12)) | let rec memP_append_aux #a (x: a) (l: list a) :
Lemma
(requires (List.memP x l))
(ensures (exists (l12: (list a * list a)). l == fst l12 @ x :: snd l12))
= let goal = exists l12. l == fst l12 @ x :: snd l12 in
let x : squash goal =
match l with
| [] -> ()
| h :: t ->
... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 129,
"start_col": 0,
"start_line": 106
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.memP x l)
(ensures
exists (l12: (Prims.list a * Prims.list a)).
l == FStar.Pervasives.Native.fst l12 @ x :: FStar.Pervasives.Native.snd l12) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Squash.give_proof",
"Prims.squash",
"BinaryTreesEnumeration.bind",
"Prims.sum",
"Prims.eq2",
"FStar.List.Tot.Base.memP",
"FStar.Squash.join_squash",
"Prims._assert",
"FStar.List.Tot.Base.op_At",
"FStar.Pervasives.Native.fst",
"Prims.Cons",
"FStar.Pervasives.Native.snd",
... | [
"recursion"
] | false | false | true | false | false | let rec memP_append_aux #a (x: a) (l: list a)
: Lemma (requires (List.memP x l))
(ensures (exists (l12: (list a * list a)). l == fst l12 @ x :: snd l12)) =
| let goal = exists l12. l == fst l12 @ x :: snd l12 in
let x:squash goal =
match l with
| [] -> ()
| h :: t ->
let pf:squash (x == h \/ List.memP x t) = () in
p <-- FStar.Squash.join_squash pf ;
match p with
| Prims.Left x_eq_h ->
let l12 = [], t in
assert (l == (fst l12) @ (x :: snd l1... | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_app_intro_l | val memP_app_intro_l (#a x: _) (l1 l2: list a) : Lemma (memP x l1 ==> memP x (l1 @ l2)) | val memP_app_intro_l (#a x: _) (l1 l2: list a) : Lemma (memP x l1 ==> memP x (l1 @ l2)) | let rec memP_app_intro_l #a x (l1 l2: list a) :
Lemma (memP x l1 ==> memP x (l1 @ l2)) =
match l1 with
| [] -> ()
| h :: t -> memP_app_intro_l x t l2 | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 150,
"start_col": 0,
"start_line": 146
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.memP x l1 ==> FStar.List.Tot.Base.memP x (l1 @ l2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinaryTreesEnumeration.memP_app_intro_l",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.op_At",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec memP_app_intro_l #a x (l1: list a) (l2: list a) : Lemma (memP x l1 ==> memP x (l1 @ l2)) =
| match l1 with
| [] -> ()
| h :: t -> memP_app_intro_l x t l2 | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_app_intro_r | val memP_app_intro_r (#a x: _) (l1 l2: list a) : Lemma (memP x l2 ==> memP x (l1 @ l2)) | val memP_app_intro_r (#a x: _) (l1 l2: list a) : Lemma (memP x l2 ==> memP x (l1 @ l2)) | let rec memP_app_intro_r #a x (l1 l2: list a) :
Lemma (memP x l2 ==> memP x (l1 @ l2)) =
match l1 with
| [] -> ()
| h :: t -> memP_app_intro_r x t l2 | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 157,
"start_col": 0,
"start_line": 153
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma
(ensures FStar.List.Tot.Base.memP x l2 ==> FStar.List.Tot.Base.memP x (l1 @ l2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinaryTreesEnumeration.memP_app_intro_r",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.op_At",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec memP_app_intro_r #a x (l1: list a) (l2: list a) : Lemma (memP x l2 ==> memP x (l1 @ l2)) =
| match l1 with
| [] -> ()
| h :: t -> memP_app_intro_r x t l2 | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.product_complete | val product_complete (#a #b: Type) (l1: list a) (l2: list b) (x1 x2: _)
: Lemma (List.memP x1 l1 ==> List.memP x2 l2 ==> List.memP (x1, x2) (product #a l1 l2)) | val product_complete (#a #b: Type) (l1: list a) (l2: list b) (x1 x2: _)
: Lemma (List.memP x1 l1 ==> List.memP x2 l2 ==> List.memP (x1, x2) (product #a l1 l2)) | let product_complete (#a #b: Type) (l1: list a) (l2: list b) x1 x2 :
Lemma (List.memP x1 l1 ==>
List.memP x2 l2 ==>
List.memP (x1, x2) (product #a l1 l2)) =
let x = (x1, x2) in
let f2 x1 = fun x2 -> (x1, x2) in
let f1 = fun x1 -> List.Tot.map (f2 x1) l2 in
let l = f1 x1 in
let ls... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 258,
"start_col": 0,
"start_line": 238
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list a -> l2: Prims.list b -> x1: a -> x2: b
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x1 l1 ==>
FStar.List.Tot.Base.memP x2 l2 ==>
FStar.List.Tot.Base.memP (x1, x2) (BinaryTreesEnumeration.product l1 l2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinaryTreesEnumeration.memP_concatMap_intro",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.concatMap",
"Prims.Nil",
"FStar.Pervasives.pattern",
... | [] | false | false | true | false | false | let product_complete (#a: Type) (#b: Type) (l1: list a) (l2: list b) x1 x2
: Lemma (List.memP x1 l1 ==> List.memP x2 l2 ==> List.memP (x1, x2) (product #a l1 l2)) =
| let x = (x1, x2) in
let f2 x1 = fun x2 -> (x1, x2) in
let f1 = fun x1 -> List.Tot.map (f2 x1) l2 in
let l = f1 x1 in
let ls = List.Tot.map f1 l1 in
assert (product l1 l2 == List.Tot.concatMap f1 l1);
memP_map_intro (f2 x1) x2 l2 <: Lemma (List.memP x2 l2 ==> List.memP x l);
memP_map_intro f1 x1 l1 <: Lemma (List.memP x... | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.unfold_tos | val unfold_tos (s: nat)
: Lemma
(trees_of_size s ==
(if s = 0
then [Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #(bt_with_size s1 * bt_with_size s2)
#(bt_with_size s)
(fun (t1... | val unfold_tos (s: nat)
: Lemma
(trees_of_size s ==
(if s = 0
then [Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #(bt_with_size s1 * bt_with_size s2)
#(bt_with_size s)
(fun (t1... | let unfold_tos (s: nat) :
Lemma (trees_of_size s ==
(if s = 0 then
[Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #(bt_with_size s1 * bt_with_size s2)
#(bt_with_size s)
... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 282,
"start_col": 0,
"start_line": 260
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
BinaryTreesEnumeration.trees_of_size s ==
(match s = 0 with
| true -> [BinaryTreesEnumeration.Leaf]
| _ ->
FStar.List.Tot.Base.concatMap (fun _ ->
(let FStar.Pervasives.Native.Mktuple2 #_ #_ s1 s2 = _ in
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.list",
"BinaryTreesEnumeration.bt_with_size",
"BinaryTreesEnumeration.trees_of_size",
"Prims.op_Equality",
"Prims.int",
"Prims.Cons",
"BinaryTreesEnumeration.Leaf",
"Prims.Nil",
"Prims.bool",
"FStar.List.Tot.Base.concatMap",
... | [] | false | false | true | false | false | let unfold_tos (s: nat)
: Lemma
(trees_of_size s ==
(if s = 0
then [Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #(bt_with_size s1 * bt_with_size s2)
#(bt_with_size s)
(fun (t1... | assert_norm (trees_of_size s ==
(if s = 0
then [Leaf]
else
List.Tot.concatMap #(prod_with_sum (s - 1))
(fun (s1, s2) ->
List.Tot.map #(bt_with_size s1 * bt_with_size s2)
#(bt_with_size s)
(fun (t1, t2) -> Branch (t1, t2))
(p... | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.memP_flatten_intro | val memP_flatten_intro (#a: _) (x: a) (l: list a) (ls: list (list a))
: Lemma (List.memP x l ==> List.memP l ls ==> List.memP x (List.Tot.flatten ls)) | val memP_flatten_intro (#a: _) (x: a) (l: list a) (ls: list (list a))
: Lemma (List.memP x l ==> List.memP l ls ==> List.memP x (List.Tot.flatten ls)) | let memP_flatten_intro #a (x: a) (l: list a) (ls: list (list a)) :
Lemma (List.memP x l ==>
List.memP l ls ==>
List.memP x (List.Tot.flatten ls)) =
FStar.Classical.arrow_to_impl
#(List.memP x l)
#(List.memP l ls ==>
List.memP x (List.Tot.flatten ls))
(fun memP_x_l_proof... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 220,
"start_col": 0,
"start_line": 173
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> l: Prims.list a -> ls: Prims.list (Prims.list a)
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP x l ==>
FStar.List.Tot.Base.memP l ls ==> FStar.List.Tot.Base.memP x (FStar.List.Tot.Base.flatten ls)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Classical.arrow_to_impl",
"FStar.List.Tot.Base.memP",
"Prims.l_imp",
"FStar.List.Tot.Base.flatten",
"Prims.squash",
"FStar.Squash.bind_squash",
"Prims.l_Exists",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.List.Tot.Base.op_At",
"FStar.Pervasives.Native.fst",
"P... | [] | false | false | true | false | false | let memP_flatten_intro #a (x: a) (l: list a) (ls: list (list a))
: Lemma (List.memP x l ==> List.memP l ls ==> List.memP x (List.Tot.flatten ls)) =
| FStar.Classical.arrow_to_impl #(List.memP x l)
#(List.memP l ls ==> List.memP x (List.Tot.flatten ls))
(fun memP_x_l_proof ->
FStar.Classical.arrow_to_impl #(List.memP l ls)
#(List.memP x (List.Tot.flatten ls))
(fun memP_l_ls_proof ->
memP_append x l;
FStar.Squash.bind_... | false |
BinaryTreesEnumeration.fsti | BinaryTreesEnumeration.tos_complete | val tos_complete (bt0: bin_tree) : Lemma (List.memP bt0 (trees_of_size (size bt0))) | val tos_complete (bt0: bin_tree) : Lemma (List.memP bt0 (trees_of_size (size bt0))) | let rec tos_complete (bt0: bin_tree) :
Lemma (List.memP bt0 (trees_of_size (size bt0))) =
match bt0 with
| Leaf -> ()
| Branch(t1, t2) ->
let s = size bt0 in
let s1 = size t1 in
let s2 = size t2 in
let trees1 = trees_of_size s1 in
let trees2 = trees_of_size s2 in
tos_c... | {
"file_name": "examples/data_structures/BinaryTreesEnumeration.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 346,
"start_col": 0,
"start_line": 301
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"sou... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | bt0: BinaryTreesEnumeration.bin_tree
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.memP bt0
(BinaryTreesEnumeration.trees_of_size (BinaryTreesEnumeration.size bt0))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinaryTreesEnumeration.bin_tree",
"BinaryTreesEnumeration.unfold_tos",
"Prims.unit",
"BinaryTreesEnumeration.memP_concatMap_intro",
"BinaryTreesEnumeration.prod_with_sum",
"Prims.op_Subtraction",
"BinaryTreesEnumeration.bt_with_size",
"FStar.Pervasives.Native.Mktuple2",
"Prims.nat",
"BinaryTreesE... | [
"recursion"
] | false | false | true | false | false | let rec tos_complete (bt0: bin_tree) : Lemma (List.memP bt0 (trees_of_size (size bt0))) =
| match bt0 with
| Leaf -> ()
| Branch (t1, t2) ->
let s = size bt0 in
let s1 = size t1 in
let s2 = size t2 in
let trees1 = trees_of_size s1 in
let trees2 = trees_of_size s2 in
tos_complete t1;
tos_complete t2;
product_complete trees1 trees2 t1 t2;
memP_map_intro #(bt_with_size s1 * bt_with_size s2)
... | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_code_Move | val va_code_Move : dst:va_operand_reg_opr -> src:va_operand_reg_opr -> Tot va_code | val va_code_Move : dst:va_operand_reg_opr -> src:va_operand_reg_opr -> Tot va_code | let va_code_Move dst src =
(Ins (S.Move dst src)) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 13,
"start_col": 0,
"start_line": 12
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Decls.va_operand_reg_opr
-> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.Ins",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Semantics_s.Move",
"Vale.PPC64LE.Decls.va_code"
] | [] | false | false | false | true | false | let va_code_Move dst src =
| (Ins (S.Move dst src)) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_codegen_success_LoadImm64 | val va_codegen_success_LoadImm64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_pbool | val va_codegen_success_LoadImm64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_pbool | let va_codegen_success_LoadImm64 dst src =
(va_ttrue ()) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 46,
"start_col": 0,
"start_line": 45
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Decls.va_ttrue",
"Vale.PPC64LE.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_LoadImm64 dst src =
| (va_ttrue ()) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_code_LoadImm64 | val va_code_LoadImm64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_code | val va_code_LoadImm64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_code | let va_code_LoadImm64 dst src =
(Ins (S.LoadImm64 dst src)) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 42,
"start_col": 0,
"start_line": 41
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Machine_s.Ins",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Semantics_s.LoadImm64",
"Vale.PPC64LE.Decls.va_code"
] | [] | false | false | false | true | false | let va_code_LoadImm64 dst src =
| (Ins (S.LoadImm64 dst src)) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_codegen_success_Move | val va_codegen_success_Move : dst:va_operand_reg_opr -> src:va_operand_reg_opr -> Tot va_pbool | val va_codegen_success_Move : dst:va_operand_reg_opr -> src:va_operand_reg_opr -> Tot va_pbool | let va_codegen_success_Move dst src =
(va_ttrue ()) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 17,
"start_col": 0,
"start_line": 16
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src)) | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Decls.va_operand_reg_opr
-> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Decls.va_ttrue",
"Vale.PPC64LE.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_Move dst src =
| (va_ttrue ()) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_code_LoadImmShl64 | val va_code_LoadImmShl64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_code | val va_code_LoadImmShl64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_code | let va_code_LoadImmShl64 dst src =
(Ins (S.LoadImmShl64 dst src)) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 71,
"start_col": 0,
"start_line": 70
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Machine_s.Ins",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Semantics_s.LoadImmShl64",
"Vale.PPC64LE.Decls.va_code"
] | [] | false | false | false | true | false | let va_code_LoadImmShl64 dst src =
| (Ins (S.LoadImmShl64 dst src)) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_codegen_success_LoadImmShl64 | val va_codegen_success_LoadImmShl64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_pbool | val va_codegen_success_LoadImmShl64 : dst:va_operand_reg_opr -> src:simm16 -> Tot va_pbool | let va_codegen_success_LoadImmShl64 dst src =
(va_ttrue ()) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 75,
"start_col": 0,
"start_line": 74
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | dst: Vale.PPC64LE.Decls.va_operand_reg_opr -> src: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Decls.va_ttrue",
"Vale.PPC64LE.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_LoadImmShl64 dst src =
| (va_ttrue ()) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_code_Add | val va_code_Add : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:va_operand_reg_opr ->
Tot va_code | val va_code_Add : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:va_operand_reg_opr ->
Tot va_code | let va_code_Add dst src1 src2 =
(Ins (S.Add dst src1 src2)) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 129,
"start_col": 0,
"start_line": 128
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dst: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src1: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src2: Vale.PPC64LE.Decls.va_operand_reg_opr
-> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.Ins",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Semantics_s.Add",
"Vale.PPC64LE.Decls.va_code"
] | [] | false | false | false | true | false | let va_code_Add dst src1 src2 =
| (Ins (S.Add dst src1 src2)) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_code_AddLa | val va_code_AddLa : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:simm16 -> Tot va_code | val va_code_AddLa : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:simm16 -> Tot va_code | let va_code_AddLa dst src1 src2 =
(Ins (S.AddLa dst src1 src2)) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 100,
"start_col": 0,
"start_line": 99
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dst: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src1: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src2: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Machine_s.Ins",
"Vale.PPC64LE.Decls.ins",
"Vale.PPC64LE.Decls.ocmp",
"Vale.PPC64LE.Semantics_s.AddLa",
"Vale.PPC64LE.Decls.va_code"
] | [] | false | false | false | true | false | let va_code_AddLa dst src1 src2 =
| (Ins (S.AddLa dst src1 src2)) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_codegen_success_Add | val va_codegen_success_Add : dst:va_operand_reg_opr -> src1:va_operand_reg_opr ->
src2:va_operand_reg_opr -> Tot va_pbool | val va_codegen_success_Add : dst:va_operand_reg_opr -> src1:va_operand_reg_opr ->
src2:va_operand_reg_opr -> Tot va_pbool | let va_codegen_success_Add dst src1 src2 =
(va_ttrue ()) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 133,
"start_col": 0,
"start_line": 132
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dst: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src1: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src2: Vale.PPC64LE.Decls.va_operand_reg_opr
-> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Decls.va_ttrue",
"Vale.PPC64LE.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_Add dst src1 src2 =
| (va_ttrue ()) | false |
Vale.PPC64LE.InsBasic.fst | Vale.PPC64LE.InsBasic.va_codegen_success_AddLa | val va_codegen_success_AddLa : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:simm16 ->
Tot va_pbool | val va_codegen_success_AddLa : dst:va_operand_reg_opr -> src1:va_operand_reg_opr -> src2:simm16 ->
Tot va_pbool | let va_codegen_success_AddLa dst src1 src2 =
(va_ttrue ()) | {
"file_name": "obj/Vale.PPC64LE.InsBasic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 104,
"start_col": 0,
"start_line": 103
} | module Vale.PPC64LE.InsBasic
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.State
open Vale.PPC64LE.Decls
open Vale.PPC64LE.Memory
open Vale.PPC64LE.Stack_i
friend Vale.PPC64LE.Decls
module S = Vale.PPC64LE.Semantics_s
//-- Move
[@ "opaque_to_smt"]
let va_code_Move dst src =
(Ins (S.Move dst src))
[@ "opaque_to_smt"... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.Stack_i.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.Decls.fst.checked",
"Vale.PPC64LE.Decls.fst.che... | [
{
"abbrev": true,
"full_module": "Vale.PPC64LE.Semantics_s",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Stack_i",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.PPC64LE.Memory",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
dst: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src1: Vale.PPC64LE.Decls.va_operand_reg_opr ->
src2: Vale.PPC64LE.Machine_s.simm16
-> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.Decls.va_operand_reg_opr",
"Vale.PPC64LE.Machine_s.simm16",
"Vale.PPC64LE.Decls.va_ttrue",
"Vale.PPC64LE.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_AddLa dst src1 src2 =
| (va_ttrue ()) | false |
Hacl.Impl.Box.fst | Hacl.Impl.Box.box_open_detached_afternm | val box_open_detached_afternm:
mlen:size_t
-> m:lbuffer uint8 mlen
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 24ul
-> c:lbuffer uint8 mlen
-> tag:lbuffer uint8 16ul ->
Stack size_t
(requires fun h ->
live h c /\ live h m /\ live h k /\ live h n /\ live h tag /\
disjoint tag c /\ eq_or_disjoint... | val box_open_detached_afternm:
mlen:size_t
-> m:lbuffer uint8 mlen
-> k:lbuffer uint8 32ul
-> n:lbuffer uint8 24ul
-> c:lbuffer uint8 mlen
-> tag:lbuffer uint8 16ul ->
Stack size_t
(requires fun h ->
live h c /\ live h m /\ live h k /\ live h n /\ live h tag /\
disjoint tag c /\ eq_or_disjoint... | let box_open_detached_afternm mlen m k n c tag =
secretbox_open_detached mlen m k n c tag | {
"file_name": "code/nacl-box/Hacl.Impl.Box.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 123,
"start_col": 0,
"start_line": 122
} | module Hacl.Impl.Box
open FStar.HyperStack.All
open FStar.HyperStack
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.SecretBox
module ST = FStar.HyperStack.ST
module Spec = Spec.Box
module LSeq = Lib.Sequence
#set-options "--z3rlimit 50 --max_fuel 0 --max_ifuel 0"
val box_bef... | {
"checked_file": "/",
"dependencies": [
"Spec.Box.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteBuffer.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Salsa20.fst.checked",
"Hacl.Impl.SecretBox.fst.checked",
"Hacl.Curve2551... | [
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "Spec.Box",
"short_module": "Spec"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": false,
"full_module": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mlen: Lib.IntTypes.size_t ->
m: Lib.Buffer.lbuffer Lib.IntTypes.uint8 mlen ->
k: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
n: Lib.Buffer.lbuffer Lib.IntTypes.uint8 24ul ->
c: Lib.Buffer.lbuffer Lib.IntTypes.uint8 mlen ->
tag: Lib.Buffer.lbuffer Lib.IntTypes.uint8 16ul
-> FStar.HyperStack.... | FStar.HyperStack.ST.Stack | [] | [] | [
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.SecretBox.secretbox_open_detached"
] | [] | false | true | false | false | false | let box_open_detached_afternm mlen m k n c tag =
| secretbox_open_detached mlen m k n c tag | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.