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.Stubs.Tactics.Types.fsti | FStar.Stubs.Tactics.Types.issues | val issues : Type0 | let issues = list FStar.Issue.issue | {
"file_name": "ulib/FStar.Stubs.Tactics.Types.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 71,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.TypeChecker.Core.fsti.checked",
"FStar.Stubs.Tactics.Common.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Issue.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.Stubs.TypeChecker.Core",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Tactics.Common",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.Types",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Issue.issue"
] | [] | false | false | false | true | true | let issues =
| list FStar.Issue.issue | false | |
Vale.Inline.X64.Fadd_inline.fsti | Vale.Inline.X64.Fadd_inline.u1024 | val u1024 : Type0 | let u1024 = b:B.buffer UInt64.t{B.length b == 16} | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 49,
"end_line": 15,
"start_col": 0,
"start_line": 15
} | module Vale.Inline.X64.Fadd_inline
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open Vale.Curve25519.Fast_defs
open FStar.Mul
unfold
let u256 = b:B.buffer UInt64.t{B.length b == 4}
unfold
let u512 = b:B.buffer UInt64.t{B.length b == 8} | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Curve25519.Fast_defs.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.buffer",
"FStar.UInt64.t",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preorder"
] | [] | false | false | false | true | true | let u1024 =
| b: B.buffer UInt64.t {B.length b == 16} | false | |
Vale.Inline.X64.Fadd_inline.fsti | Vale.Inline.X64.Fadd_inline.u256 | val u256 : Type0 | let u256 = b:B.buffer UInt64.t{B.length b == 4} | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 11,
"start_col": 0,
"start_line": 11
} | module Vale.Inline.X64.Fadd_inline
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open Vale.Curve25519.Fast_defs
open FStar.Mul | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Curve25519.Fast_defs.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.buffer",
"FStar.UInt64.t",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preorder"
] | [] | false | false | false | true | true | let u256 =
| b: B.buffer UInt64.t {B.length b == 4} | false | |
Vale.Inline.X64.Fadd_inline.fsti | Vale.Inline.X64.Fadd_inline.u512 | val u512 : Type0 | let u512 = b:B.buffer UInt64.t{B.length b == 8} | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Vale.Inline.X64.Fadd_inline
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open Vale.Curve25519.Fast_defs
open FStar.Mul
unfold
let u256 = b:B.buffer UInt64.t{B.length b == 4} | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Curve25519.Fast_defs.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.buffer",
"FStar.UInt64.t",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preorder"
] | [] | false | false | false | true | true | let u512 =
| b: B.buffer UInt64.t {B.length b == 8} | false | |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_st_sub | val elab_st_sub (#g: env) (#c1 #c2: comp) (d_sub: st_sub g c1 c2)
: Tot (t: R.term & RT.tot_typing (elab_env g) t (simple_arr (elab_comp c1) (elab_comp c2))) | val elab_st_sub (#g: env) (#c1 #c2: comp) (d_sub: st_sub g c1 c2)
: Tot (t: R.term & RT.tot_typing (elab_env g) t (simple_arr (elab_comp c1) (elab_comp c2))) | let elab_st_sub (#g:env) (#c1 #c2 : comp)
(d_sub : st_sub g c1 c2)
: Tot (t:R.term
& RT.tot_typing (elab_env g) t (simple_arr (elab_comp c1) (elab_comp c2)))
= RU.magic_s "elab_st_sub" | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 26,
"end_line": 161,
"start_col": 0,
"start_line": 157
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d_sub: Pulse.Typing.st_sub g c1 c2
-> Prims.dtuple2 FStar.Stubs.Reflection.Types.term
(fun t ->
FStar.Reflection.Typing.tot_typing (Pulse.Typing.elab_env g)
t
(Pulse.Elaborate.Core.simple_arr (Pulse.Elaborate.Pure.elab_comp c1)
(Pulse.Elaborate.Pure.elab_comp c2... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.st_sub",
"Pulse.RuntimeUtils.magic_s",
"Prims.dtuple2",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.Typing.tot_typing",
"Pulse.Typing.elab_env",
"Pulse.Elaborate.Core.simple_arr",
"Pulse.Elaborate.Pure.elab_comp"
] | [] | false | false | false | false | false | let elab_st_sub (#g: env) (#c1 #c2: comp) (d_sub: st_sub g c1 c2)
: Tot (t: R.term & RT.tot_typing (elab_env g) t (simple_arr (elab_comp c1) (elab_comp c2))) =
| RU.magic_s "elab_st_sub" | false |
Pulse.Checker.IntroPure.fst | Pulse.Checker.IntroPure.check_prop_validity | val check_prop_validity (g: env) (p: term) (typing: tot_typing g p tm_prop)
: T.Tac (prop_validity g p) | val check_prop_validity (g: env) (p: term) (typing: tot_typing g p tm_prop)
: T.Tac (prop_validity g p) | let check_prop_validity (g:env) (p:term) (typing:tot_typing g p tm_prop): T.Tac (prop_validity g p) =
Pulse.Checker.Pure.check_prop_validity g p typing | {
"file_name": "lib/steel/pulse/Pulse.Checker.IntroPure.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 53,
"end_line": 44,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Env.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.Checker.Pure.fsti.checked",
"Pulse.Checker.Prover.fsti.checked",
"Puls... | [
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Pulse.Checker.Prover",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
g: Pulse.Typing.Env.env ->
p: Pulse.Syntax.Base.term ->
typing: Pulse.Typing.tot_typing g p Pulse.Typing.tm_prop
-> FStar.Tactics.Effect.Tac (Pulse.Typing.prop_validity g p) | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Typing.tm_prop",
"Pulse.Checker.Pure.check_prop_validity",
"Pulse.Typing.prop_validity"
] | [] | false | true | false | false | false | let check_prop_validity (g: env) (p: term) (typing: tot_typing g p tm_prop)
: T.Tac (prop_validity g p) =
| Pulse.Checker.Pure.check_prop_validity g p typing | false |
Vale.Inline.X64.Fadd_inline.fsti | Vale.Inline.X64.Fadd_inline.as_nat | val as_nat (b: B.buffer UInt64.t {B.length b == 4}) (h: HS.mem) : GTot nat | val as_nat (b: B.buffer UInt64.t {B.length b == 4}) (h: HS.mem) : GTot nat | let as_nat (b:B.buffer UInt64.t{B.length b == 4}) (h:HS.mem) : GTot nat =
let s = B.as_seq h b in
let s0 = UInt64.v (Seq.index s 0) in
let s1 = UInt64.v (Seq.index s 1) in
let s2 = UInt64.v (Seq.index s 2) in
let s3 = UInt64.v (Seq.index s 3) in
pow2_four s0 s1 s2 s3 | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 23,
"start_col": 0,
"start_line": 17
} | module Vale.Inline.X64.Fadd_inline
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open Vale.Curve25519.Fast_defs
open FStar.Mul
unfold
let u256 = b:B.buffer UInt64.t{B.length b == 4}
unfold
let u512 = b:B.buffer UInt64.t{B.length b == 8}
unfold
let u1024 =... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Curve25519.Fast_defs.fst.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: LowStar.Buffer.buffer FStar.UInt64.t {LowStar.Monotonic.Buffer.length b == 4} ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"LowStar.Buffer.buffer",
"FStar.UInt64.t",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preorder",
"FStar.Monotonic.HyperStack.mem",
"Vale.Curve25519.Fast_defs.pow2_four",
"FStar.UInt.uint_t",
"FStar.UInt64.v",
"FStar.Seq.Base.index",
"FStar.Seq.Base.seq... | [] | false | false | false | false | false | let as_nat (b: B.buffer UInt64.t {B.length b == 4}) (h: HS.mem) : GTot nat =
| let s = B.as_seq h b in
let s0 = UInt64.v (Seq.index s 0) in
let s1 = UInt64.v (Seq.index s 1) in
let s2 = UInt64.v (Seq.index s 2) in
let s3 = UInt64.v (Seq.index s 3) in
pow2_four s0 s1 s2 s3 | false |
Vale.Stdcalls.X64.Aes.fst | Vale.Stdcalls.X64.Aes.aes128_key_expansion | val aes128_key_expansion : normal lowstar_key128_t | val aes128_key_expansion : normal lowstar_key128_t | let aes128_key_expansion //: normal lowstar_key128_t
= as_normal_t #lowstar_key128_t lowstar_key128 | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.Aes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | module Vale.Stdcalls.X64.Aes
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.AES",
"short_module": "AE"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"full_modu... | {
"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 | Vale.Interop.Base.normal Vale.Stdcalls.X64.Aes.lowstar_key128_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Stdcalls.X64.Aes.as_normal_t",
"Vale.Stdcalls.X64.Aes.lowstar_key128_t",
"Vale.Stdcalls.X64.Aes.lowstar_key128"
] | [] | false | false | false | true | false | let aes128_key_expansion =
| as_normal_t #lowstar_key128_t lowstar_key128 | false |
Vale.Stdcalls.X64.Aes.fst | Vale.Stdcalls.X64.Aes.aes256_key_expansion | val aes256_key_expansion : normal lowstar_key256_t | val aes256_key_expansion : normal lowstar_key256_t | let aes256_key_expansion //: normal lowstar_key256_t
= as_normal_t #lowstar_key256_t lowstar_key256 | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.Aes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 41,
"start_col": 0,
"start_line": 40
} | module Vale.Stdcalls.X64.Aes
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.AES",
"short_module": "AE"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"full_modu... | {
"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 | Vale.Interop.Base.normal Vale.Stdcalls.X64.Aes.lowstar_key256_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Stdcalls.X64.Aes.as_normal_t",
"Vale.Stdcalls.X64.Aes.lowstar_key256_t",
"Vale.Stdcalls.X64.Aes.lowstar_key256"
] | [] | false | false | false | true | false | let aes256_key_expansion =
| as_normal_t #lowstar_key256_t lowstar_key256 | false |
IfcRulesReify.fst | IfcRulesReify.op_Less | val op_Less : label -> label -> Tot bool | val op_Less : label -> label -> Tot bool | let op_Less l1 l2 =
match l1, l2 with
| Low,High -> true
| _, _ -> false | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 36,
"start_col": 0,
"start_line": 33
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | l1: IfcRulesReify.label -> l2: IfcRulesReify.label -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool"
] | [] | false | false | false | true | false | let ( < ) l1 l2 =
| match l1, l2 with
| Low, High -> true
| _, _ -> false | false |
IfcRulesReify.fst | IfcRulesReify.op_Less_Equals | val op_Less_Equals : label -> label -> Tot bool | val op_Less_Equals : label -> label -> Tot bool | let op_Less_Equals l1 l2 =
match l1, l2 with
| High,Low -> false
| _, _ -> true | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 42,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | l1: IfcRulesReify.label -> l2: IfcRulesReify.label -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool"
] | [] | false | false | false | true | false | let ( <= ) l1 l2 =
| match l1, l2 with
| High, Low -> false
| _, _ -> true | false |
IfcRulesReify.fst | IfcRulesReify.ni_exp | val ni_exp (env: label_fun) (e: exp) (l: label) : Tot Type0 | val ni_exp (env: label_fun) (e: exp) (l: label) : Tot Type0 | let ni_exp (env:label_fun) (e:exp) (l:label) : Tot Type0 =
forall (h: rel heap). (* {:pattern (low_equiv env h)} *)
(low_equiv env h /\ Low? l) ==>
(* interpret_exp (R?.r h) e = interpret_exp (R?.l h) e *)
begin
let vr = reify (interpret_exp_st e) (R?.r h)in
let vl = reify (interpret_exp_st... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 80,
"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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | env: IfcRulesReify.label_fun -> e: WhileReify.exp -> l: IfcRulesReify.label -> Type0 | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"IfcRulesReify.label",
"Prims.l_Forall",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_imp",
"Prims.l_and",
"IfcRulesReify.low_equiv",
"Prims.b2t",
"IfcRulesReify.uu___is_Low",
"Prims.op_Equality",
"Prims.int",
"WhileReify.interpret_... | [] | false | false | false | true | true | let ni_exp (env: label_fun) (e: exp) (l: label) : Tot Type0 =
| forall (h: rel heap).
(low_equiv env h /\ Low? l) ==>
(let vr = reify (interpret_exp_st e) (R?.r h) in
let vl = reify (interpret_exp_st e) (R?.l h) in
vr = vl) | false |
IfcRulesReify.fst | IfcRulesReify.join | val join : label -> label -> Tot label | val join : label -> label -> Tot label | let join l1 l2 =
match l1, l2 with
| Low,Low -> Low
| _, _ -> High | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 48,
"start_col": 0,
"start_line": 45
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | l1: IfcRulesReify.label -> l2: IfcRulesReify.label -> IfcRulesReify.label | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label",
"FStar.Pervasives.Native.Mktuple2",
"IfcRulesReify.Low",
"IfcRulesReify.High"
] | [] | false | false | false | true | false | let join l1 l2 =
| match l1, l2 with
| Low, Low -> Low
| _, _ -> High | false |
IfcRulesReify.fst | IfcRulesReify.meet | val meet : label -> label -> Tot label | val meet : label -> label -> Tot label | let meet l1 l2 =
match l1, l2 with
| High, High -> High
| _, _ -> Low | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 54,
"start_col": 0,
"start_line": 51
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | l1: IfcRulesReify.label -> l2: IfcRulesReify.label -> IfcRulesReify.label | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label",
"FStar.Pervasives.Native.Mktuple2",
"IfcRulesReify.High",
"IfcRulesReify.Low"
] | [] | false | false | false | true | false | let meet l1 l2 =
| match l1, l2 with
| High, High -> High
| _, _ -> Low | false |
IfcRulesReify.fst | IfcRulesReify.ni_com' | val ni_com' (env: label_fun) (c: com) (l: label) (h0: rel heap) : Tot Type0 | val ni_com' (env: label_fun) (c: com) (l: label) (h0: rel heap) : Tot Type0 | let ni_com' (env:label_fun) (c:com) (l:label) (h0:rel heap) : Tot Type0 =
let R h0l h0r = h0 in
(* KM : That's the code that we would like to write but subtyping and matching on pairs interplay badly *)
(* it generates a VC which boils down to [forall (h1l:heap). length h1l = length h0l] which is obviously false ... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 110,
"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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
c: WhileReify.com ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com",
"Prims.l_imp",
"IfcRulesReify.low_equiv",
"Rel.R",
"FStar.Pervasives.Native.option",
"Prims.l_True"
] | [] | false | false | false | true | true | let ni_com' (env: label_fun) (c: com) (l: label) (h0: rel heap) : Tot Type0 =
| let R h0l h0r = h0 in
match interpret_com h0l c with
| Some h1l ->
(match interpret_com h0r c with
| Some h1r -> low_equiv env h0 ==> low_equiv env (R h1l h1r)
| _ -> True)
| _ -> True | false |
IfcRulesReify.fst | IfcRulesReify.ni_com | val ni_com (env: label_fun) (c: com) (l: label) : Tot Type0 | val ni_com (env: label_fun) (c: com) (l: label) : Tot Type0 | let ni_com (env:label_fun) (c:com) (l:label) : Tot Type0 =
(forall (h0: rel heap). (* {:pattern (low_equiv env h0)} *) ni_com' env c l h0) /\
(forall (h0:heap). (* {:pattern (Some? (interpret_com h0 c))} *) inv_com' env c l h0) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 87,
"end_line": 114,
"start_col": 0,
"start_line": 112
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | env: IfcRulesReify.label_fun -> c: WhileReify.com -> l: IfcRulesReify.label -> Type0 | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"Prims.l_and",
"Prims.l_Forall",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcRulesReify.ni_com'",
"IfcRulesReify.inv_com'"
] | [] | false | false | false | true | true | let ni_com (env: label_fun) (c: com) (l: label) : Tot Type0 =
| (forall (h0: rel heap). ni_com' env c l h0) /\ (forall (h0: heap). inv_com' env c l h0) | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_frame | val elab_frame : c: Pulse.Syntax.Base.comp_st ->
frame: Pulse.Syntax.Base.term ->
e: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | let elab_frame (c:comp_st) (frame:term) (e:R.term) =
let u = comp_u c in
let ty = elab_term (comp_res c) in
let pre = elab_term (comp_pre c) in
let post = elab_term (comp_post c) in
if C_ST? c
then mk_frame_stt u ty pre (mk_abs ty R.Q_Explicit post) (elab_term frame) e
else if C_STAtomic? c
then let ope... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 84,
"end_line": 39,
"start_col": 0,
"start_line": 29
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: Pulse.Syntax.Base.comp_st ->
frame: Pulse.Syntax.Base.term ->
e: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.comp_st",
"Pulse.Syntax.Base.term",
"FStar.Stubs.Reflection.Types.term",
"Pulse.Syntax.Base.uu___is_C_ST",
"Pulse.Reflection.Util.mk_frame_stt",
"Pulse.Reflection.Util.mk_abs",
"FStar.Stubs.Reflection.V2.Data.Q_Explicit",
"Pulse.Elaborate.Pure.elab_term",
"Prims.bool",
"Pulse.Sy... | [] | false | false | false | true | false | let elab_frame (c: comp_st) (frame: term) (e: R.term) =
| let u = comp_u c in
let ty = elab_term (comp_res c) in
let pre = elab_term (comp_pre c) in
let post = elab_term (comp_post c) in
if C_ST? c
then mk_frame_stt u ty pre (mk_abs ty R.Q_Explicit post) (elab_term frame) e
else
if C_STAtomic? c
then
let opened = elab_term (comp_inames c) in
mk_frame_stt_atomic u ... | false | |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_bind | val elab_bind (#g #x #c1 #c2 #c: _) (bc: bind_comp g x c1 c2 c) (e1 e2: R.term) : R.term | val elab_bind (#g #x #c1 #c2 #c: _) (bc: bind_comp g x c1 c2 c) (e1 e2: R.term) : R.term | let elab_bind #g #x #c1 #c2 #c
(bc:bind_comp g x c1 c2 c)
(e1 e2:R.term)
: R.term
= let t1 = elab_term (comp_res c1) in
let t2 = elab_term (comp_res c2) in
match c1 with
| C_ST _ ->
mk_bind_stt
(comp_u c1)
(comp_u c2)
t1 t2
(elab_... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 15,
"end_line": 93,
"start_col": 0,
"start_line": 56
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
bc: Pulse.Typing.bind_comp g x c1 c2 c ->
e1: FStar.Stubs.Reflection.Types.term ->
e2: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.bind_comp",
"FStar.Stubs.Reflection.Types.term",
"Pulse.Syntax.Base.st_comp",
"Pulse.Reflection.Util.mk_bind_stt",
"Pulse.Syntax.Base.comp_u",
"Pulse.Elaborate.Pure.elab_term",
"Pulse.Syntax.Base.comp_pre",
... | [] | false | false | false | false | false | let elab_bind #g #x #c1 #c2 #c (bc: bind_comp g x c1 c2 c) (e1: R.term) (e2: R.term) : R.term =
| let t1 = elab_term (comp_res c1) in
let t2 = elab_term (comp_res c2) in
match c1 with
| C_ST _ ->
mk_bind_stt (comp_u c1)
(comp_u c2)
t1
t2
(elab_term (comp_pre c1))
(mk_abs t1 R.Q_Explicit (elab_term (comp_post c1)))
(mk_abs t2 R.Q_Explicit (elab_term (comp_post c2)))
e1
e2
| C_STGhos... | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_lift | val elab_lift (#g #c1 #c2: _) (d: lift_comp g c1 c2) (e: R.term) : Tot R.term | val elab_lift (#g #c1 #c2: _) (d: lift_comp g c1 c2) (e: R.term) : Tot R.term | let elab_lift #g #c1 #c2 (d:lift_comp g c1 c2) (e:R.term)
: Tot R.term
= match d with
| Lift_STAtomic_ST _ _ ->
let t = elab_term (comp_res c1) in
mk_lift_atomic_stt
(comp_u c1)
(elab_term (comp_res c1))
t
(mk_abs t R.Q_Explicit (elab_term (comp_post c1)))
e
... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 9,
"end_line": 136,
"start_col": 0,
"start_line": 95
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.lift_comp g c1 c2 -> e: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.lift_comp",
"FStar.Stubs.Reflection.Types.term",
"Pulse.Syntax.Base.comp_st",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_C_STAtomic",
"Pulse.Reflection.Util.mk_lift_atomic_stt",
"Pulse.Syntax.Base.comp_u",
"Pulse.Elaborate.Pure.elab_term... | [] | false | false | false | false | false | let elab_lift #g #c1 #c2 (d: lift_comp g c1 c2) (e: R.term) : Tot R.term =
| match d with
| Lift_STAtomic_ST _ _ ->
let t = elab_term (comp_res c1) in
mk_lift_atomic_stt (comp_u c1)
(elab_term (comp_res c1))
t
(mk_abs t R.Q_Explicit (elab_term (comp_post c1)))
e
| Lift_Observability _ c o2 ->
let t = elab_term (comp_res c1) in
mk_lift_observability (comp_u c1)
(elab_... | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.simple_arr | val simple_arr (t1 t2: R.term) : R.term | val simple_arr (t1 t2: R.term) : R.term | let simple_arr (t1 t2 : R.term) : R.term =
let b = R.pack_binder {
sort = t1;
ppname = Sealed.seal "x";
qual = R.Q_Explicit;
attrs = [] } in
R.pack_ln (R.Tv_Arrow b (R.pack_comp (R.C_Total t2))) | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 55,
"end_line": 155,
"start_col": 0,
"start_line": 149
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | 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.Stubs.Reflection.V2.Builtins.pack_ln",
"FStar.Stubs.Reflection.V2.Data.Tv_Arrow",
"FStar.Stubs.Reflection.V2.Builtins.pack_comp",
"FStar.Stubs.Reflection.V2.Data.C_Total",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Stubs.Reflection.V2.Builtins.pack_binder",... | [] | false | false | false | true | false | let simple_arr (t1 t2: R.term) : R.term =
| let b = R.pack_binder ({ sort = t1; ppname = Sealed.seal "x"; qual = R.Q_Explicit; attrs = [] }) in
R.pack_ln (R.Tv_Arrow b (R.pack_comp (R.C_Total t2))) | false |
Vale.Stdcalls.X64.Aes.fst | Vale.Stdcalls.X64.Aes.lowstar_key128 | val lowstar_key128:lowstar_key128_t | val lowstar_key128:lowstar_key128_t | let lowstar_key128 : lowstar_key128_t =
assert_norm (List.length dom + List.length ([]<:list arg) <= 4);
IX64.wrap_weak_stdcall
code_key128
dom
(W.mk_prediction code_key128 dom [] (key128_lemma code_key128 IA.win)) | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.Aes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 28,
"start_col": 0,
"start_line": 23
} | module Vale.Stdcalls.X64.Aes
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"full_module": "Vale.X64.State",
"short_module": "VS"
},
{
"abbrev": false,
"full_module": "Vale.X64.MemoryAdapters",
"short_module": null
},
{
"abbrev": true,
"fu... | {
"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 | Vale.Stdcalls.X64.Aes.lowstar_key128_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.X64.wrap_weak_stdcall",
"Vale.Stdcalls.X64.Aes.code_key128",
"Vale.Stdcalls.X64.Aes.dom",
"Vale.AsLowStar.Wrapper.pre_rel_generic",
"Vale.Interop.X64.max_stdcall",
"Vale.Interop.X64.arg_reg_stdcall",
"Prims.Nil",
"Vale.Interop.Base.arg",
"Vale.Stdcalls.X64.Aes.key128_pre",
"Vale.AsLo... | [] | false | false | false | true | false | let lowstar_key128:lowstar_key128_t =
| assert_norm (List.length dom + List.length ([] <: list arg) <= 4);
IX64.wrap_weak_stdcall code_key128
dom
(W.mk_prediction code_key128 dom [] (key128_lemma code_key128 IA.win)) | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_sub | val elab_sub : c1: Pulse.Syntax.Base.comp_st ->
c2: Pulse.Syntax.Base.comp_st ->
e: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | let elab_sub (c1 c2:comp_st) (e:R.term) =
let ty = elab_term (comp_res c1) in
let u = comp_u c1 in
let pre1 = elab_term (comp_pre c1) in
let pre2 = elab_term (comp_pre c2) in
let post1 = mk_abs ty R.Q_Explicit (elab_term (comp_post c1)) in
let post2 = mk_abs ty R.Q_Explicit (elab_term (comp_post c2)) in
i... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 52,
"end_line": 53,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c1: Pulse.Syntax.Base.comp_st ->
c2: Pulse.Syntax.Base.comp_st ->
e: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.comp_st",
"FStar.Stubs.Reflection.Types.term",
"Pulse.Syntax.Base.uu___is_C_ST",
"Pulse.Reflection.Util.mk_sub_stt",
"Prims.bool",
"Pulse.Syntax.Base.uu___is_C_STAtomic",
"Pulse.Reflection.Util.mk_sub_stt_atomic",
"Pulse.Elaborate.Pure.elab_term",
"Pulse.Syntax.Base.comp_inames",
... | [] | false | false | false | true | false | let elab_sub (c1 c2: comp_st) (e: R.term) =
| let ty = elab_term (comp_res c1) in
let u = comp_u c1 in
let pre1 = elab_term (comp_pre c1) in
let pre2 = elab_term (comp_pre c2) in
let post1 = mk_abs ty R.Q_Explicit (elab_term (comp_post c1)) in
let post2 = mk_abs ty R.Q_Explicit (elab_term (comp_post c2)) in
if C_ST? c1
then mk_sub_stt u ty pre1 pre2 post1 post2 e
... | false | |
IfcRulesReify.fst | IfcRulesReify.inv_com' | val inv_com' (env: label_fun) (c: com) (l: label) (h0: heap) : Tot Type0 | val inv_com' (env: label_fun) (c: com) (l: label) (h0: heap) : Tot Type0 | let inv_com' (env:label_fun) (c:com) (l:label) (h0:heap) : Tot Type0
=
match interpret_com h0 c with
| None -> True
| Some h1 ->
forall (i:id). (* {:pattern (env i < l)} *) env i < l ==> index h0 i = index h1 i | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 85,
"end_line": 94,
"start_col": 0,
"start_line": 89
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
c: WhileReify.com ->
l: IfcRulesReify.label ->
h0: FStar.DM4F.Heap.IntStoreFixed.heap
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com",
"Prims.l_True",
"Prims.l_Forall",
"FStar.DM4F.Heap.IntStoreFixed.id",
"Prims.l_imp",
"Prims.b2t",
"IfcRulesReify.op_Less",
"Prims.op_Equality",
"Prims.int",
... | [] | false | false | false | true | true | let inv_com' (env: label_fun) (c: com) (l: label) (h0: heap) : Tot Type0 =
| match interpret_com h0 c with
| None -> True
| Some h1 -> forall (i: id). env i < l ==> index h0 i = index h1 i | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.intro_pure_tm | val intro_pure_tm : p: Pulse.Syntax.Base.term -> Pulse.Syntax.Base.st_term | let intro_pure_tm (p:term) =
let open Pulse.Reflection.Util in
wtag (Some STT_Ghost)
(Tm_STApp
{ head =
tm_pureapp (tm_fvar (as_fv (mk_pulse_lib_core_lid "intro_pure")))
None
p;
arg_qual = None;
arg = tm_fstar (`()) Range.... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 47,
"end_line": 147,
"start_col": 0,
"start_line": 138
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Pulse.Syntax.Base.term -> Pulse.Syntax.Base.st_term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Typing.wtag",
"FStar.Pervasives.Native.Some",
"Pulse.Syntax.Base.ctag",
"Pulse.Syntax.Base.STT_Ghost",
"Pulse.Syntax.Base.Tm_STApp",
"Pulse.Syntax.Base.Mkst_term'__Tm_STApp__payload",
"Pulse.Syntax.Pure.tm_pureapp",
"Pulse.Syntax.Pure.tm_fvar",
"Pulse.Syntax.Base.a... | [] | false | false | false | true | false | let intro_pure_tm (p: term) =
| let open Pulse.Reflection.Util in
wtag (Some STT_Ghost)
(Tm_STApp
({
head = tm_pureapp (tm_fvar (as_fv (mk_pulse_lib_core_lid "intro_pure"))) None p;
arg_qual = None;
arg = tm_fstar (`()) Range.range_0
})) | false | |
IfcRulesReify.fst | IfcRulesReify.assign_inv_com' | val assign_inv_com' (env: label_fun) (e: exp) (r: id) (h0: heap)
: Lemma (inv_com' env (Assign r e) (env r) h0) | val assign_inv_com' (env: label_fun) (e: exp) (r: id) (h0: heap)
: Lemma (inv_com' env (Assign r e) (env r) h0) | let assign_inv_com' (env:label_fun) (e:exp) (r:id) (h0:heap)
: Lemma (inv_com' env (Assign r e) (env r) h0)
=
let v = reify (interpret_exp_st e) h0 in
match reify (interpret_com_st (Assign r e) h0) h0 with
| None, h1 -> ()
| Some (), h1 ->
assert (h1 == upd h0 r v) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 217,
"start_col": 0,
"start_line": 210
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
r: FStar.DM4F.Heap.IntStoreFixed.id ->
h0: FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (ensures IfcRulesReify.inv_com' env (WhileReify.Assign r e) (env r) h0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"FStar.DM4F.Heap.IntStoreFixed.id",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com_st",
"WhileReify.Assign",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"FStar.DM4F.Heap.IntStoreFixed.upd",
"Prims.int",
"WhileReify.interpret_exp_st"... | [] | false | false | true | false | false | let assign_inv_com' (env: label_fun) (e: exp) (r: id) (h0: heap)
: Lemma (inv_com' env (Assign r e) (env r) h0) =
| let v = reify (interpret_exp_st e) h0 in
match reify (interpret_com_st (Assign r e) h0) h0 with
| None, h1 -> ()
| Some (), h1 -> assert (h1 == upd h0 r v) | false |
IfcRulesReify.fst | IfcRulesReify.assign_com | val assign_com : env:label_fun -> e:exp -> r:id ->
Lemma (requires (ni_exp env e (env r)))
(ensures (ni_com env (Assign r e) (env r))) | val assign_com : env:label_fun -> e:exp -> r:id ->
Lemma (requires (ni_exp env e (env r)))
(ensures (ni_com env (Assign r e) (env r))) | let assign_com env e r =
forall_intro (assign_inv_com0 env e r (FStar.Squash.get_proof (ni_exp env e (env r)))) ;
forall_intro (assign_inv_com' env e r) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 224,
"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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | env: IfcRulesReify.label_fun -> e: WhileReify.exp -> r: FStar.DM4F.Heap.IntStoreFixed.id
-> FStar.Pervasives.Lemma (requires IfcRulesReify.ni_exp env e (env r))
(ensures IfcRulesReify.ni_com env (WhileReify.Assign r e) (env r)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"FStar.DM4F.Heap.IntStoreFixed.id",
"FStar.Classical.forall_intro",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcRulesReify.inv_com'",
"WhileReify.Assign",
"IfcRulesReify.assign_inv_com'",
"Prims.unit",
"Rel.rel",
"IfcRulesReify.ni_com'",
"IfcRulesReif... | [] | true | false | true | false | false | let assign_com env e r =
| forall_intro (assign_inv_com0 env e r (FStar.Squash.get_proof (ni_exp env e (env r))));
forall_intro (assign_inv_com' env e r) | false |
IfcRulesReify.fst | IfcRulesReify.assign_inv_com0 | val assign_inv_com0
(env: label_fun)
(e: exp)
(r: id)
(ne: squash (ni_exp env e (env r)))
(h0: rel heap)
: Lemma (ni_com' env (Assign r e) (env r) h0) | val assign_inv_com0
(env: label_fun)
(e: exp)
(r: id)
(ne: squash (ni_exp env e (env r)))
(h0: rel heap)
: Lemma (ni_com' env (Assign r e) (env r) h0) | let assign_inv_com0 (env:label_fun) (e:exp) (r:id) (ne:squash(ni_exp env e (env r))) (h0:rel heap)
: Lemma (ni_com' env (Assign r e) (env r) h0)
=
FStar.Squash.give_proof ne ;
let vr = reify (interpret_exp_st e) (R?.r h0) in
let vl = reify (interpret_exp_st e) (R?.l h0) in
match reify (interpret_com_st (Assig... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 208,
"start_col": 0,
"start_line": 196
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
r: FStar.DM4F.Heap.IntStoreFixed.id ->
ne: Prims.squash (IfcRulesReify.ni_exp env e (env r)) ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (ensures IfcRulesReify.ni_com' env (WhileReify.Assign r e) (env r) h0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"FStar.DM4F.Heap.IntStoreFixed.id",
"Prims.squash",
"IfcRulesReify.ni_exp",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com_st",
"WhileReify.Assign",
"Rel.__proj__R__item__l",
"Prims.unit",
"Rel.__proj__R__item__r",
"Pri... | [] | false | false | true | false | false | let assign_inv_com0
(env: label_fun)
(e: exp)
(r: id)
(ne: squash (ni_exp env e (env r)))
(h0: rel heap)
: Lemma (ni_com' env (Assign r e) (env r) h0) =
| FStar.Squash.give_proof ne;
let vr = reify (interpret_exp_st e) (R?.r h0) in
let vl = reify (interpret_exp_st e) (R?.l h0) in
match reify (interpret_com_st (Assign r e) (R?.l h0)) (R?.l h0) with
| Some (), h1l ->
(match reify (interpret_com_st (Assign r e) (R?.r h0)) (R?.r h0) with
| Some (), h1r -> assert (h1l =... | false |
Vale.Stdcalls.X64.Aes.fst | Vale.Stdcalls.X64.Aes.lowstar_key256 | val lowstar_key256:lowstar_key256_t | val lowstar_key256:lowstar_key256_t | let lowstar_key256 : lowstar_key256_t =
assert_norm (List.length dom + List.length ([]<:list arg) <= 4);
IX64.wrap_weak_stdcall
code_key256
dom
(W.mk_prediction code_key256 dom [] (key256_lemma code_key256 IA.win)) | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.Aes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 38,
"start_col": 0,
"start_line": 33
} | module Vale.Stdcalls.X64.Aes
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"full_module": "Vale.X64.State",
"short_module": "VS"
},
{
"abbrev": false,
"full_module": "Vale.X64.MemoryAdapters",
"short_module": null
},
{
"abbrev": true,
"fu... | {
"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 | Vale.Stdcalls.X64.Aes.lowstar_key256_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.X64.wrap_weak_stdcall",
"Vale.Stdcalls.X64.Aes.code_key256",
"Vale.Stdcalls.X64.Aes.dom",
"Vale.AsLowStar.Wrapper.pre_rel_generic",
"Vale.Interop.X64.max_stdcall",
"Vale.Interop.X64.arg_reg_stdcall",
"Prims.Nil",
"Vale.Interop.Base.arg",
"Vale.Stdcalls.X64.Aes.key256_pre",
"Vale.AsLo... | [] | false | false | false | true | false | let lowstar_key256:lowstar_key256_t =
| assert_norm (List.length dom + List.length ([] <: list arg) <= 4);
IX64.wrap_weak_stdcall code_key256
dom
(W.mk_prediction code_key256 dom [] (key256_lemma code_key256 IA.win)) | false |
IfcRulesReify.fst | IfcRulesReify.seq_com | val seq_com : env:label_fun -> c1:com -> c2:com -> l:label ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (ni_com env (Seq c1 c2) l)) | val seq_com : env:label_fun -> c1:com -> c2:com -> l:label ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (ni_com env (Seq c1 c2) l)) | let seq_com env c1 c2 l =
forall_intro
(fun (h0:rel heap) ->
seq_com' env c1 c2 l h0 <: Lemma (ni_com' env (Seq c1 c2) l h0)) ;
forall_intro
(fun (h0:heap) ->
seq_inv_com' env c1 c2 l h0 <: Lemma (inv_com' env (Seq c1 c2) l h0)) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 309,
"start_col": 0,
"start_line": 303
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | env: IfcRulesReify.label_fun -> c1: WhileReify.com -> c2: WhileReify.com -> l: IfcRulesReify.label
-> FStar.Pervasives.Lemma
(requires IfcRulesReify.ni_com env c1 l /\ IfcRulesReify.ni_com env c2 l)
(ensures IfcRulesReify.ni_com env (WhileReify.Seq c1 c2) l) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"FStar.Classical.forall_intro",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcRulesReify.inv_com'",
"WhileReify.Seq",
"IfcRulesReify.seq_inv_com'",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pat... | [] | false | false | true | false | false | let seq_com env c1 c2 l =
| forall_intro (fun (h0: rel heap) -> seq_com' env c1 c2 l h0 <: Lemma (ni_com' env (Seq c1 c2) l h0));
forall_intro (fun (h0: heap) -> seq_inv_com' env c1 c2 l h0 <: Lemma (inv_com' env (Seq c1 c2) l h0)
) | false |
IfcRulesReify.fst | IfcRulesReify.seq_inv_com' | val seq_inv_com' : env:label_fun -> c1:com -> c2:com -> l:label -> h0:heap ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (inv_com' env (Seq c1 c2) l h0)) | val seq_inv_com' : env:label_fun -> c1:com -> c2:com -> l:label -> h0:heap ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (inv_com' env (Seq c1 c2) l h0)) | let seq_inv_com' env c1 c2 l h0 =
match reify (interpret_com_st c1 h0) h0 with
| None, _ -> seq_nil1 c1 c2 h0
| Some (), h1 ->
match reify (interpret_com_st c2 h1) h1 with
| None, _ -> seq_nil2 c1 c2 h0 h1
| Some (), h2 -> () | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 256,
"start_col": 0,
"start_line": 250
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
c1: WhileReify.com ->
c2: WhileReify.com ->
l: IfcRulesReify.label ->
h0: FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires IfcRulesReify.ni_com env c1 l /\ IfcRulesReify.ni_com env c2 l)
(ensures IfcRulesReify.inv_com' env (WhileRe... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com_st",
"Prims.unit",
"IfcRulesReify.seq_nil1",
"IfcRulesReify.seq_nil2"
] | [] | false | false | true | false | false | let seq_inv_com' env c1 c2 l h0 =
| match reify (interpret_com_st c1 h0) h0 with
| None, _ -> seq_nil1 c1 c2 h0
| Some (), h1 ->
match reify (interpret_com_st c2 h1) h1 with
| None, _ -> seq_nil2 c1 c2 h0 h1
| Some (), h2 -> () | false |
IfcRulesReify.fst | IfcRulesReify.cond_inv_com' | val cond_inv_com' : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label -> h0:heap ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (inv_com' env (If e ct cf) l h0)) | val cond_inv_com' : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label -> h0:heap ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (inv_com' env (If e ct cf) l h0)) | let cond_inv_com' env e ct cf l h0 =
let v = reify (interpret_exp_st e) h0 in
if v = 0
then assert (inv_com' env cf l h0 ==> inv_com' env (If e ct cf) l h0)
else assert (inv_com' env ct l h0 ==> inv_com' env (If e ct cf) l h0) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 71,
"end_line": 327,
"start_col": 0,
"start_line": 323
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
ct: WhileReify.com ->
cf: WhileReify.com ->
l: IfcRulesReify.label ->
h0: FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires
IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env ct l /\
IfcRules... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"IfcRulesReify.label",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.op_Equality",
"Prims.int",
"Prims._assert",
"Prims.l_imp",
"IfcRulesReify.inv_com'",
"WhileReify.If",
"Prims.bool",
"Prims.unit",
"WhileReify.interpret_exp_st"... | [] | false | false | true | false | false | let cond_inv_com' env e ct cf l h0 =
| let v = reify (interpret_exp_st e) h0 in
if v = 0
then assert (inv_com' env cf l h0 ==> inv_com' env (If e ct cf) l h0)
else assert (inv_com' env ct l h0 ==> inv_com' env (If e ct cf) l h0) | false |
Pulse.Checker.IntroPure.fst | Pulse.Checker.IntroPure.check | val check
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(t:st_term { Tm_IntroPure? t.term })
: T.Tac (checker_result_t g pre post_hint) | val check
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(t:st_term { Tm_IntroPure? t.term })
: T.Tac (checker_result_t g pre post_hint) | let check
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(t:st_term { Tm_IntroPure? t.term })
: T.Tac (checker_result_t g pre post_hint) =
let g = Pulse.Typing.Env.push_context g "check_intro_pure" t.range in
let Tm_IntroPure { p } = t.term... | {
"file_name": "lib/steel/pulse/Pulse.Checker.IntroPure.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 125,
"end_line": 62,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Env.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.Checker.Pure.fsti.checked",
"Pulse.Checker.Prover.fsti.checked",
"Puls... | [
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Pulse.Checker.Prover",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
g: Pulse.Typing.Env.env ->
pre: Pulse.Syntax.Base.term ->
pre_typing: Pulse.Typing.tot_typing g pre Pulse.Syntax.Base.tm_vprop ->
post_hint: Pulse.Typing.post_hint_opt g ->
res_ppname: Pulse.Syntax.Base.ppname ->
t: Pulse.Syntax.Base.st_term{Tm_IntroPure? (Mkst_term?.term t)}
-> FStar.Tactics... | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.tm_vprop",
"Pulse.Typing.post_hint_opt",
"Pulse.Syntax.Base.ppname",
"Pulse.Syntax.Base.st_term",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_Tm_IntroPure",
"Pulse.Syntax.Base.__proj__Mkst_term__item__term"... | [] | false | true | false | false | false | let check
(g: env)
(pre: term)
(pre_typing: tot_typing g pre tm_vprop)
(post_hint: post_hint_opt g)
(res_ppname: ppname)
(t: st_term{Tm_IntroPure? t.term})
: T.Tac (checker_result_t g pre post_hint) =
| let g = Pulse.Typing.Env.push_context g "check_intro_pure" t.range in
let Tm_IntroPure { p = p } = t.term in
let (| p , p_typing |) = check_prop g p in
let pv = check_prop_validity g p p_typing in
let st_typing = T_IntroPure _ _ p_typing pv in
prove_post_hint (try_frame_pre pre_typing
(match_comp_res_with_post_hi... | false |
Hacl.Spec.SHA2.Lemmas.fst | Hacl.Spec.SHA2.Lemmas.transpose_state_lemma_ij | val transpose_state_lemma_ij:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> st:state_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 8 * word_length a} ->
Lemma
(let l = lanes a m in
let ind = 8 * j + i / word_length a in
(Seq.index (vec_v (transpose_state st).[ind / l])) (ind % l) ==
(Seq.in... | val transpose_state_lemma_ij:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> st:state_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 8 * word_length a} ->
Lemma
(let l = lanes a m in
let ind = 8 * j + i / word_length a in
(Seq.index (vec_v (transpose_state st).[ind / l])) (ind % l) ==
(Seq.in... | let transpose_state_lemma_ij #a #m st j i =
match lanes a m with
| 1 -> ()
| 4 -> transpose_state4_lemma #a #m st j i
| 8 -> transpose_state8_lemma #a #m st j i | {
"file_name": "code/sha2-mb/Hacl.Spec.SHA2.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 136,
"start_col": 0,
"start_line": 132
} | module Hacl.Spec.SHA2.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.IntVector
open Lib.IntVector.Transpose
open Spec.Hash.Definitions
open Hacl.Spec.SHA2.Vec
#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"
val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"FStar.Seq.fst.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector.Transpose",
"short_module": null
},
{
"abbrev": fals... | {
"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 |
st: Hacl.Spec.SHA2.Vec.state_spec a m ->
j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->
i: Prims.nat{i < 8 * Spec.Hash.Definitions.word_length a}
-> FStar.Pervasives.Lemma
(ensures
(let l = Hacl.Spec.SHA2.Vec.lanes a m in
let ind = 8 * j + i / Spec.Hash.Definitions.word_length a in
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Hacl.Spec.SHA2.Vec.is_supported",
"Hacl.Spec.SHA2.Vec.state_spec",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.SHA2.Vec.lanes",
"FStar.Mul.op_Star",
"Spec.Hash.Definitions.word_length",
"Hacl.Spec.SHA2.Lemmas.transpose... | [] | false | false | true | false | false | let transpose_state_lemma_ij #a #m st j i =
| match lanes a m with
| 1 -> ()
| 4 -> transpose_state4_lemma #a #m st j i
| 8 -> transpose_state8_lemma #a #m st j i | false |
IfcRulesReify.fst | IfcRulesReify.cond_com | val cond_com : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (ni_com env (If e ct cf) l)) | val cond_com : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (ni_com env (If e ct cf) l)) | let cond_com env e ct cf l =
forall_intro
(fun (h0:rel heap) ->
cond_ni_com' env e ct cf l h0 <: Lemma (ni_com' env (If e ct cf) l h0)) ;
forall_intro
(fun (h0:heap) ->
cond_inv_com' env e ct cf l h0 <: Lemma (inv_com' env (If e ct cf) l h0)) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 387,
"start_col": 0,
"start_line": 381
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
"abbrev": false,
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
ct: WhileReify.com ->
cf: WhileReify.com ->
l: IfcRulesReify.label
-> FStar.Pervasives.Lemma
(requires
IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env ct l /\
IfcRulesReify.ni_com env cf l) (ensures IfcRulesReify.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"IfcRulesReify.label",
"FStar.Classical.forall_intro",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcRulesReify.inv_com'",
"WhileReify.If",
"IfcRulesReify.cond_inv_com'",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"... | [] | false | false | true | false | false | let cond_com env e ct cf l =
| forall_intro (fun (h0: rel heap) ->
cond_ni_com' env e ct cf l h0 <: Lemma (ni_com' env (If e ct cf) l h0));
forall_intro (fun (h0: heap) ->
cond_inv_com' env e ct cf l h0 <: Lemma (inv_com' env (If e ct cf) l h0)) | false |
IfcRulesReify.fst | IfcRulesReify.while_com | val while_com : env:label_fun -> e:exp -> c:com -> v:metric -> l:label ->
Lemma (requires (ni_exp env e l /\ ni_com env c l))
(ensures (ni_com env (While e c v) l)) | val while_com : env:label_fun -> e:exp -> c:com -> v:metric -> l:label ->
Lemma (requires (ni_exp env e l /\ ni_com env c l))
(ensures (ni_com env (While e c v) l)) | let while_com env e c v l =
forall_intro
(fun (h:rel heap) ->
while_ni_com' env e c v l h <: Lemma (ensures (ni_com' env (While e c v) l h))) ;
forall_intro
(fun (h0:heap) ->
while_inv_com' env e c v l h0 <: Lemma (ensures (inv_com' env (While e c v) l h0))) | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 89,
"end_line": 524,
"start_col": 0,
"start_line": 518
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
"abbrev": false,
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
c: WhileReify.com ->
v: WhileReify.metric ->
l: IfcRulesReify.label
-> FStar.Pervasives.Lemma (requires IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env c l)
(ensures IfcRulesReify.ni_com env (WhileReify.While e c v) l) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"WhileReify.metric",
"IfcRulesReify.label",
"FStar.Classical.forall_intro",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcRulesReify.inv_com'",
"WhileReify.While",
"IfcRulesReify.while_inv_com'",
"Prims.unit",
"Prims.l_True",
"Prims.... | [] | false | false | true | false | false | let while_com env e c v l =
| forall_intro (fun (h: rel heap) ->
while_ni_com' env e c v l h <: Lemma (ensures (ni_com' env (While e c v) l h)));
forall_intro (fun (h0: heap) ->
while_inv_com' env e c v l h0 <: Lemma (ensures (inv_com' env (While e c v) l h0))) | false |
IfcRulesReify.fst | IfcRulesReify.cond_ni_com' | val cond_ni_com' : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label -> h0:rel heap ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (ni_com' env (If e ct cf) l h0)) | val cond_ni_com' : env:label_fun -> e:exp -> ct:com -> cf:com -> l:label -> h0:rel heap ->
Lemma (requires ((ni_exp env e l) /\ (ni_com env ct l) /\ (ni_com env cf l)))
(ensures (ni_com' env (If e ct cf) l h0)) | let cond_ni_com' env e ct cf l h0 =
if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else
let R h0l h0r = h0 in
let vl = reify (interpret_exp_st e) h0l in
let vr = reify (interpret_exp_st e) h0r in
if Low? l
then begin
assert (vl == vr) ;
let c ... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 374,
"start_col": 0,
"start_line": 346
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
"abbrev": false,
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
ct: WhileReify.com ->
cf: WhileReify.com ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires
IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env ct l /\
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.op_Negation",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"IfcRulesReify.low_equiv",
"Prims.bool",
"IfcRulesReify.uu___is_Low",
"IfcRulesReify.... | [] | false | false | true | false | false | let cond_ni_com' env e ct cf l h0 =
| if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else
let R h0l h0r = h0 in
let vl = reify (interpret_exp_st e) h0l in
let vr = reify (interpret_exp_st e) h0r in
if Low? l
then
(assert (vl == vr);
let c = if vl = 0 then cf else ct in
assert (ni_com env c l)... | false |
IfcRulesReify.fst | IfcRulesReify.seq_com' | val seq_com' : env:label_fun -> c1:com -> c2:com -> l:label -> h0: rel heap ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (ni_com' env (Seq c1 c2) l h0)) | val seq_com' : env:label_fun -> c1:com -> c2:com -> l:label -> h0: rel heap ->
Lemma (requires (ni_com env c1 l /\ ni_com env c2 l))
(ensures (ni_com' env (Seq c1 c2) l h0)) | let seq_com' env c1 c2 l h0 =
if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else begin
assert (low_equiv env h0);
let R h0l h0r = h0 in
match reify (interpret_com_st c1 h0l) h0l with
| None, _ -> seq_nil1 c1 c2 h0l
| Some (), h1l ->
match reify (in... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 298,
"start_col": 0,
"start_line": 274
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
c1: WhileReify.com ->
c2: WhileReify.com ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires IfcRulesReify.ni_com env c1 l /\ IfcRulesReify.ni_com env c2 l)
(ensures IfcRulesReify.ni_com' env (... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.com",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.op_Negation",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"IfcRulesReify.low_equiv",
"Prims.bool",
"WhileReify.interpret_com_st",
"Prims.unit",
"IfcRulesReify.se... | [] | false | false | true | false | false | let seq_com' env c1 c2 l h0 =
| if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else
(assert (low_equiv env h0);
let R h0l h0r = h0 in
match reify (interpret_com_st c1 h0l) h0l with
| None, _ -> seq_nil1 c1 c2 h0l
| Some (), h1l ->
match reify (interpret_com_st c1 h0r) h0r with
| Non... | false |
IfcRulesReify.fst | IfcRulesReify.while_ni_com' | val while_ni_com' : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l))
(ensures (ni_com' env (While e c v) l h0)) | val while_ni_com' : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l))
(ensures (ni_com' env (While e c v) l h0)) | let while_ni_com' env e c v l h0 =
if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else if Low? l
then while_ni_com'_low_equiv_low env e c v l h0
else while_ni_com'_low_equiv_high env e c v l h0 | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 511,
"start_col": 0,
"start_line": 506
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
"abbrev": false,
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
c: WhileReify.com ->
v: WhileReify.metric ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (requires IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env c l)
(ensures IfcRulesR... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"WhileReify.metric",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.op_Negation",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"IfcRulesReify.low_equiv",
"Prims.bool",
"IfcRulesReify.uu___is_... | [] | false | false | true | false | false | let while_ni_com' env e c v l h0 =
| if not (FStar.StrongExcludedMiddle.strong_excluded_middle (low_equiv env h0))
then ()
else
if Low? l
then while_ni_com'_low_equiv_low env e c v l h0
else while_ni_com'_low_equiv_high env e c v l h0 | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.and_elim' | val and_elim' (h: binding) : Tac unit | val and_elim' (h: binding) : Tac unit | let and_elim' (h: binding) : Tac unit =
and_elim (pack (Tv_Var h));
clear h | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 145,
"start_col": 0,
"start_line": 143
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Tactics.NamedView.binding -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.binding",
"FStar.Stubs.Tactics.V2.Builtins.clear",
"Prims.unit",
"FStar.Tactics.V2.Logic.and_elim",
"FStar.Tactics.NamedView.pack",
"FStar.Tactics.NamedView.Tv_Var",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv"
] | [] | false | true | false | false | false | let and_elim' (h: binding) : Tac unit =
| and_elim (pack (Tv_Var h));
clear h | false |
IfcRulesReify.fst | IfcRulesReify.while_ni_com'_low_equiv_high | val while_ni_com'_low_equiv_high : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l /\ low_equiv env h0 /\ High? l))
(ensures (ni_com' env (While e c v) l h0)) | val while_ni_com'_low_equiv_high : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l /\ low_equiv env h0 /\ High? l))
(ensures (ni_com' env (While e c v) l h0)) | let while_ni_com'_low_equiv_high env e c v l h0 =
(* h0 and h1 are low_equiv since cl and cr cannot write at low cells *)
let R h0l h0r = h0 in
match reify (interpret_com_st (While e c v) h0l) h0l with
| None, _ -> ()
| Some (), h1l ->
match reify (interpret_com_st (While e c v) h0r) h0r with
| None, ... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 467,
"start_col": 0,
"start_line": 456
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
c: WhileReify.com ->
v: WhileReify.metric ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires
IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env c l /\
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"WhileReify.metric",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"WhileReify.interpret_com_st",
"WhileReify.While",
"Prims.unit",
"Prims._assert",
"Prims.l_imp",
"IfcRulesReify.low_equiv",
"Rel.R",
... | [] | false | false | true | false | false | let while_ni_com'_low_equiv_high env e c v l h0 =
| let R h0l h0r = h0 in
match reify (interpret_com_st (While e c v) h0l) h0l with
| None, _ -> ()
| Some (), h1l ->
match reify (interpret_com_st (While e c v) h0r) h0r with
| None, _ -> ()
| Some (), h1r ->
while_inv_com' env e c v l h0l;
while_inv_com' env e c v l h0r;
assert (low_equiv env h0 ==> low... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.repeat' | val repeat' (#a: _) (f: (unit -> Tac a)) : Tac unit | val repeat' (#a: _) (f: (unit -> Tac a)) : Tac unit | let repeat' #a (f: unit -> Tac a) : Tac unit =
let _ = repeat f in () | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 141,
"start_col": 0,
"start_line": 140
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: Prims.unit -> FStar.Tactics.Effect.Tac a) -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"Prims.list",
"FStar.Tactics.V2.Derived.repeat"
] | [] | false | true | false | false | false | let repeat' #a (f: (unit -> Tac a)) : Tac unit =
| let _ = repeat f in
() | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.implies_intro' | val implies_intro': Prims.unit -> Tac unit | val implies_intro': Prims.unit -> Tac unit | let implies_intro' () : Tac unit =
let _ = implies_intro () in () | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 138,
"start_col": 0,
"start_line": 137
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | true | false | false | false | let implies_intro' () : Tac unit =
| let _ = implies_intro () in
() | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.exact_hyp' | val exact_hyp' (h: namedv) : Tac unit | val exact_hyp' (h: namedv) : Tac unit | let exact_hyp' (h: namedv): Tac unit =
exact (pack (Tv_Var h)) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 154,
"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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Tactics.NamedView.namedv -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.namedv",
"FStar.Tactics.V2.Derived.exact",
"FStar.Tactics.NamedView.pack",
"FStar.Tactics.NamedView.Tv_Var",
"Prims.unit"
] | [] | false | true | false | false | false | let exact_hyp' (h: namedv) : Tac unit =
| exact (pack (Tv_Var h)) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.return | val return (#a: _) (x: a) : match_res a | val return (#a: _) (x: a) : match_res a | let return #a (x: a) : match_res a =
Success x | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 248,
"start_col": 0,
"start_line": 247
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> FStar.Tactics.PatternMatching.match_res a | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.Success",
"FStar.Tactics.PatternMatching.match_res"
] | [] | false | false | false | true | false | let return #a (x: a) : match_res a =
| Success x | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.exact_hyp | val exact_hyp (a: Type0) (h: namedv) : Tac unit | val exact_hyp (a: Type0) (h: namedv) : Tac unit | let exact_hyp (a: Type0) (h: namedv) : Tac unit =
let hd = quote (FStar.Squash.return_squash #a) in
exact (mk_app hd [((pack (Tv_Var h)), Q_Explicit)]) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 150,
"start_col": 0,
"start_line": 148
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type0 -> h: FStar.Tactics.NamedView.namedv -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.namedv",
"FStar.Tactics.V2.Derived.exact",
"FStar.Reflection.V2.Derived.mk_app",
"Prims.Cons",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.aqualv",
"FStar.Tactics.NamedView.pa... | [] | false | true | false | false | false | let exact_hyp (a: Type0) (h: namedv) : Tac unit =
| let hd = quote (FStar.Squash.return_squash #a) in
exact (mk_app hd [((pack (Tv_Var h)), Q_Explicit)]) | false |
Hacl.Spec.SHA2.Lemmas.fst | Hacl.Spec.SHA2.Lemmas.transpose_state8_lemma | val transpose_state8_lemma:
#a:sha2_alg
-> #m:m_spec{lanes a m == 8}
-> st:state_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 8 * word_length a} ->
Lemma
(let l = lanes a m in
let ind = 8 * j + i / word_length a in
Seq.index (vec_v (transpose_state8 st).[ind / l]) (ind % l) ==
Seq.index (s... | val transpose_state8_lemma:
#a:sha2_alg
-> #m:m_spec{lanes a m == 8}
-> st:state_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 8 * word_length a} ->
Lemma
(let l = lanes a m in
let ind = 8 * j + i / word_length a in
Seq.index (vec_v (transpose_state8 st).[ind / l]) (ind % l) ==
Seq.index (s... | let transpose_state8_lemma #a #m st j i =
let l = lanes a m in
let ind = 8 * j + i / word_length a in
let r0 = transpose8x8_lseq st in
transpose8x8_lemma st | {
"file_name": "code/sha2-mb/Hacl.Spec.SHA2.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 117,
"start_col": 0,
"start_line": 113
} | module Hacl.Spec.SHA2.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.IntVector
open Lib.IntVector.Transpose
open Spec.Hash.Definitions
open Hacl.Spec.SHA2.Vec
#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"
val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"FStar.Seq.fst.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector.Transpose",
"short_module": null
},
{
"abbrev": fals... | {
"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 |
st: Hacl.Spec.SHA2.Vec.state_spec a m ->
j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->
i: Prims.nat{i < 8 * Spec.Hash.Definitions.word_length a}
-> FStar.Pervasives.Lemma
(ensures
(let l = Hacl.Spec.SHA2.Vec.lanes a m in
let ind = 8 * j + i / Spec.Hash.Definitions.word_length a in
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Prims.eq2",
"Prims.int",
"Hacl.Spec.SHA2.Vec.lanes",
"Hacl.Spec.SHA2.Vec.state_spec",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Mul.op_Star",
"Spec.Hash.Definitions.word_length",
"Lib.IntVector.Transpose.transpose8x8_l... | [] | true | false | true | false | false | let transpose_state8_lemma #a #m st j i =
| let l = lanes a m in
let ind = 8 * j + i / word_length a in
let r0 = transpose8x8_lseq st in
transpose8x8_lemma st | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.raise | val raise (#a: _) (ex: match_exception) : match_res a | val raise (#a: _) (ex: match_exception) : match_res a | let raise #a (ex: match_exception) : match_res a =
Failure ex | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 259,
"start_col": 0,
"start_line": 258
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ex: FStar.Tactics.PatternMatching.match_exception -> FStar.Tactics.PatternMatching.match_res a | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.match_exception",
"FStar.Tactics.PatternMatching.Failure",
"FStar.Tactics.PatternMatching.match_res"
] | [] | false | false | false | true | false | let raise #a (ex: match_exception) : match_res a =
| Failure ex | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.string_of_bindings | val string_of_bindings : bindings: FStar.Tactics.PatternMatching.bindings -> FStar.Tactics.Effect.Tac Prims.string | let string_of_bindings (bindings: bindings) =
String.concat "\n"
(map (fun (nm, tm) -> (">> " ^ nm ^ ": " ^ term_to_string tm))
bindings) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 287,
"start_col": 0,
"start_line": 284
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | bindings: FStar.Tactics.PatternMatching.bindings -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.bindings",
"FStar.String.concat",
"Prims.string",
"Prims.list",
"FStar.Tactics.Util.map",
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.Types.term",
"Prims.op_Hat",
"FStar.Stubs.Tactics.V2.Builtins.term_to_string"
] | [] | false | true | false | false | false | let string_of_bindings (bindings: bindings) =
| String.concat "\n" (map (fun (nm, tm) -> (">> " ^ nm ^ ": " ^ term_to_string tm)) bindings) | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.interp_pattern | val interp_pattern: pat: pattern -> term -> Tac (match_res bindings) | val interp_pattern: pat: pattern -> term -> Tac (match_res bindings) | let interp_pattern (pat: pattern) : term -> Tac (match_res bindings) =
fun (tm: term) ->
let? rev_bindings = interp_pattern_aux pat [] tm in
return (List.Tot.Base.rev rev_bindings) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 328,
"start_col": 0,
"start_line": 325
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | pat: FStar.Tactics.PatternMatching.pattern -> _: FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac
(FStar.Tactics.PatternMatching.match_res FStar.Tactics.PatternMatching.bindings) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.op_let_Question",
"FStar.Tactics.PatternMatching.bindings",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.PatternMatching.varname",
"FStar.Tactics.PatternMatching.return",
"FStar.... | [] | false | true | false | false | false | let interp_pattern (pat: pattern) : term -> Tac (match_res bindings) =
| fun (tm: term) ->
let? rev_bindings = interp_pattern_aux pat [] tm in
return (List.Tot.Base.rev rev_bindings) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.absvar | val absvar : Type0 | let absvar = binding | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 349,
"start_col": 0,
"start_line": 349
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.NamedView.binding"
] | [] | false | false | false | true | true | let absvar =
| binding | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.string_of_matching_solution | val string_of_matching_solution : ms: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac Prims.string | let string_of_matching_solution ms =
let vars =
String.concat "\n "
(map (fun (varname, tm) ->
varname ^ ": " ^ (term_to_string tm)) ms.ms_vars) in
let hyps =
String.concat "\n "
(map (fun (nm, binding) ->
nm ^ ": " ^ (binding_to_string binding)) ms.ms_hyps) in
... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 391,
"start_col": 0,
"start_line": 381
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ms: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.matching_solution",
"Prims.op_Hat",
"Prims.string",
"FStar.String.concat",
"Prims.list",
"FStar.Tactics.Util.map",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Derived.binding_to_string",
"FStar.Tactics.PatternMatching.__proj... | [] | false | true | false | false | false | let string_of_matching_solution ms =
| let vars =
String.concat "\n "
(map (fun (varname, tm) -> varname ^ ": " ^ (term_to_string tm)) ms.ms_vars)
in
let hyps =
String.concat "\n "
(map (fun (nm, binding) -> nm ^ ": " ^ (binding_to_string binding)) ms.ms_hyps)
in
"\n{ vars: " ^ vars ^ "\n" ^ " hyps: " ^ hyps ^ " }" | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.ms_locate_var | val ms_locate_var (a: Type) (solution: matching_solution) (name: varname) : Tac a | val ms_locate_var (a: Type) (solution: matching_solution) (name: varname) : Tac a | let ms_locate_var (a: Type) (solution: matching_solution)
(name: varname) : Tac a =
unquote #a (assoc_varname_fail name solution.ms_vars) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 406,
"start_col": 0,
"start_line": 404
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
solution: FStar.Tactics.PatternMatching.matching_solution ->
name: FStar.Tactics.PatternMatching.varname
-> FStar.Tactics.Effect.Tac a | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.varname",
"FStar.Stubs.Tactics.V2.Builtins.unquote",
"FStar.Stubs.Reflection.Types.term",
"FStar.Tactics.PatternMatching.assoc_varname_fail",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.__proj__Mkmatchin... | [] | false | true | false | false | false | let ms_locate_var (a: Type) (solution: matching_solution) (name: varname) : Tac a =
| unquote #a (assoc_varname_fail name solution.ms_vars) | false |
IfcRulesReify.fst | IfcRulesReify.while_ni_com'_low_equiv_low | val while_ni_com'_low_equiv_low : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l /\ low_equiv env h0 /\ Low? l))
(ensures (ni_com' env (While e c v) l h0))
(decreases (decr_while (R?.l h0) (While e c v) + decr_while (R?.r h0)... | val while_ni_com'_low_equiv_low : env:label_fun -> e:exp -> c:com -> v:metric -> l:label -> h0:rel heap ->
Lemma (requires (ni_exp env e l /\ ni_com env c l /\ low_equiv env h0 /\ Low? l))
(ensures (ni_com' env (While e c v) l h0))
(decreases (decr_while (R?.l h0) (While e c v) + decr_while (R?.r h0)... | let rec while_ni_com'_low_equiv_low env e c v l h0 =
let R h0l h0r = h0 in
let v0l = reify (interpret_exp_st e) h0l in
let v0r = reify (interpret_exp_st e) h0r in
assert (v0l == v0r) ;
if v0l = 0 then begin
assert (interpret_com h0l (While e c v) == Some h0l);
assert (interpret_com h0r (While e c v) =... | {
"file_name": "examples/rel/IfcRulesReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 500,
"start_col": 0,
"start_line": 473
} | (*
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": [
"WhileReify.fst.checked",
"Rel.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreExcFixed.fst.c... | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
env: IfcRulesReify.label_fun ->
e: WhileReify.exp ->
c: WhileReify.com ->
v: WhileReify.metric ->
l: IfcRulesReify.label ->
h0: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires
IfcRulesReify.ni_exp env e l /\ IfcRulesReify.ni_com env c l /\
... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"IfcRulesReify.label_fun",
"WhileReify.exp",
"WhileReify.com",
"WhileReify.metric",
"IfcRulesReify.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.op_Equality",
"Prims.int",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"WhileReify.interpret_com",
"WhileRe... | [
"recursion"
] | false | false | true | false | false | let rec while_ni_com'_low_equiv_low env e c v l h0 =
| let R h0l h0r = h0 in
let v0l = reify (interpret_exp_st e) h0l in
let v0r = reify (interpret_exp_st e) h0r in
assert (v0l == v0r);
if v0l = 0
then
(assert (interpret_com h0l (While e c v) == Some h0l);
assert (interpret_com h0r (While e c v) == Some h0r))
else
let m0l = interpret_exp' h0l v in
let m0r = inter... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.ms_locate_hyp | val ms_locate_hyp (a: Type) (solution: matching_solution) (name: varname) : Tac hypothesis | val ms_locate_hyp (a: Type) (solution: matching_solution) (name: varname) : Tac hypothesis | let ms_locate_hyp (a: Type) (solution: matching_solution)
(name: varname) : Tac hypothesis =
assoc_varname_fail name solution.ms_hyps | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 402,
"start_col": 0,
"start_line": 400
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Type ->
solution: FStar.Tactics.PatternMatching.matching_solution ->
name: FStar.Tactics.PatternMatching.varname
-> FStar.Tactics.Effect.Tac FStar.Tactics.PatternMatching.hypothesis | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.varname",
"FStar.Tactics.PatternMatching.assoc_varname_fail",
"FStar.Tactics.PatternMatching.hypothesis",
"FStar.Tactics.PatternMatching.__proj__Mkmatching_solution__item__ms_hyps"
] | [] | false | true | false | false | false | let ms_locate_hyp (a: Type) (solution: matching_solution) (name: varname) : Tac hypothesis =
| assoc_varname_fail name solution.ms_hyps | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.hyp_qn | val hyp_qn : Prims.string | let hyp_qn = `%hyp | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 562,
"start_col": 0,
"start_line": 562
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.string | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let hyp_qn =
| `%hyp | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.goal_qn | val goal_qn : Prims.string | let goal_qn = `%pm_goal | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 563,
"start_col": 0,
"start_line": 563
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.string | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let goal_qn =
| `%pm_goal | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.pm_goal | val pm_goal : a: Type -> Prims.eqtype | let pm_goal (a: Type) = unit | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 560,
"start_col": 0,
"start_line": 560
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Prims.eqtype"
] | [] | false | false | false | true | false | let pm_goal (a: Type) =
| unit | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.name_of_namedv | val name_of_namedv (x: namedv) : Tac string | val name_of_namedv (x: namedv) : Tac string | let name_of_namedv (x:namedv) : Tac string =
unseal (inspect_namedv x).ppname | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 504,
"start_col": 0,
"start_line": 503
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.Tactics.NamedView.namedv -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.namedv",
"FStar.Tactics.Unseal.unseal",
"Prims.string",
"FStar.Stubs.Reflection.V2.Data.__proj__Mknamedv_view__item__ppname",
"FStar.Tactics.NamedView.inspect_namedv"
] | [] | false | true | false | false | false | let name_of_namedv (x: namedv) : Tac string =
| unseal (inspect_namedv x).ppname | false |
MerkleTree.Spec.fst | MerkleTree.Spec.hashes | val hashes (#hsz:pos): Type0 | val hashes (#hsz:pos): Type0 | let hashes #hsz = S.seq (padded_hash #hsz) | {
"file_name": "src/MerkleTree.Spec.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 42,
"end_line": 46,
"start_col": 0,
"start_line": 46
} | module MerkleTree.Spec
open FStar.Classical
open FStar.Mul
open FStar.Seq
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 10"
// For SHA2_256, this is is a sequence of 32 bytes
// These are secret bytes, hence not an eqtype
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes { Seq.length b... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classica... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.Seq.Base.seq",
"MerkleTree.Spec.padded_hash"
] | [] | false | false | false | true | true | let hashes #hsz =
| S.seq (padded_hash #hsz) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.hyp | val hyp : a: Type -> Type0 | let hyp (a: Type) = binding | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 559,
"start_col": 0,
"start_line": 559
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.NamedView.binding"
] | [] | false | false | false | true | true | let hyp (a: Type) =
| binding | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.type_of_named_binder | val type_of_named_binder (nb: binder) : term | val type_of_named_binder (nb: binder) : term | let type_of_named_binder (nb : binder) : term =
nb.sort | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 585,
"start_col": 0,
"start_line": 584
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | nb: FStar.Tactics.NamedView.binder -> FStar.Tactics.NamedView.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.NamedView.binder",
"FStar.Tactics.NamedView.__proj__Mkbinder__item__sort",
"FStar.Tactics.NamedView.term"
] | [] | false | false | false | true | false | let type_of_named_binder (nb: binder) : term =
| nb.sort | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.beta_reduce | val beta_reduce (tm: term) : Tac term | val beta_reduce (tm: term) : Tac term | let beta_reduce (tm: term) : Tac term =
norm_term [] tm | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 527,
"start_col": 0,
"start_line": 526
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | tm: FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"FStar.Tactics.V2.Derived.norm_term",
"Prims.Nil",
"FStar.Pervasives.norm_step"
] | [] | false | true | false | false | false | let beta_reduce (tm: term) : Tac term =
| norm_term [] tm | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.cleanup_abspat | val cleanup_abspat (t: term) : Tac term | val cleanup_abspat (t: term) : Tac term | let cleanup_abspat (t: term) : Tac term =
norm_term [] t | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 611,
"start_col": 0,
"start_line": 610
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"FStar.Tactics.V2.Derived.norm_term",
"Prims.Nil",
"FStar.Pervasives.norm_step"
] | [] | false | true | false | false | false | let cleanup_abspat (t: term) : Tac term =
| norm_term [] t | false |
Hacl.Spec.SHA2.Lemmas.fst | Hacl.Spec.SHA2.Lemmas.transpose_ws4_lemma_ij | val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m * lanes a m = 16
-> ws:ws_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 16} ->
Lemma
(let l = lanes a m in
(vec_v (transpose_ws4 ws).[i]).[j] == (vec_v ws.[i / l * l + j]).[i % l]) | val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m * lanes a m = 16
-> ws:ws_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 16} ->
Lemma
(let l = lanes a m in
(vec_v (transpose_ws4 ws).[i]).[j] == (vec_v ws.[i / l * l + j]).[i % l]) | let transpose_ws4_lemma_ij #a #m ws j i =
let l = lanes a m in
let i_sub = i / l in
let j_sub = i % l in
assert (i_sub * l + j_sub == i);
let vs = sub ws (i_sub * l) l in
eq_intro (sub (transpose_ws4 ws) (i_sub * l) l) (transpose4x4_lseq vs);
//assert ((transpose_ws4 ws).[i] == (sub (transpose_ws4 ws) (i... | {
"file_name": "code/sha2-mb/Hacl.Spec.SHA2.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 83,
"end_line": 38,
"start_col": 0,
"start_line": 25
} | module Hacl.Spec.SHA2.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.IntVector
open Lib.IntVector.Transpose
open Spec.Hash.Definitions
open Hacl.Spec.SHA2.Vec
#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"
val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"FStar.Seq.fst.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector.Transpose",
"short_module": null
},
{
"abbrev": fals... | {
"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 |
ws: Hacl.Spec.SHA2.Vec.ws_spec a m ->
j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->
i: Prims.nat{i < 16}
-> FStar.Pervasives.Lemma
(ensures
(let l = Hacl.Spec.SHA2.Vec.lanes a m in
(Lib.IntVector.vec_v (Hacl.Spec.SHA2.Vec.transpose_ws4 ws).[ i ]).[ j ] ==
(Lib.IntVector.vec_... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Prims.eq2",
"Prims.int",
"Hacl.Spec.SHA2.Vec.lanes",
"Hacl.Spec.SHA2.Vec.ws_spec",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims._assert",
"Lib.IntTypes.uint_t",
"Spec.Hash.Definitions.word_t",
"Lib.IntTypes.SEC",
"Pri... | [] | true | false | true | false | false | let transpose_ws4_lemma_ij #a #m ws j i =
| let l = lanes a m in
let i_sub = i / l in
let j_sub = i % l in
assert (i_sub * l + j_sub == i);
let vs = sub ws (i_sub * l) l in
eq_intro (sub (transpose_ws4 ws) (i_sub * l) l) (transpose4x4_lseq vs);
assert ((vec_v (transpose_ws4 ws).[ i ]).[ j ] == (vec_v (transpose4x4_lseq vs).[ j_sub ]).[ j ]);
transpose4x4_lemma v... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.name_of_named_binder | val name_of_named_binder (nb: binder) : Tac string | val name_of_named_binder (nb: binder) : Tac string | let name_of_named_binder (nb : binder) : Tac string =
unseal nb.ppname | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 615,
"start_col": 0,
"start_line": 614
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | nb: FStar.Tactics.NamedView.binder -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.binder",
"FStar.Tactics.Unseal.unseal",
"Prims.string",
"FStar.Tactics.NamedView.__proj__Mkbinder__item__ppname"
] | [] | false | true | false | false | false | let name_of_named_binder (nb: binder) : Tac string =
| unseal nb.ppname | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.specialize_abspat_continuation' | val specialize_abspat_continuation' (continuation: abspat_continuation) (solution_term: term)
: Tac term | val specialize_abspat_continuation' (continuation: abspat_continuation) (solution_term: term)
: Tac term | let specialize_abspat_continuation' (continuation: abspat_continuation)
(solution_term:term)
: Tac term =
let mk_arg_term argspec =
abspat_arg_of_abspat_argspec solution_term argspec in
let argspecs, body = continuation in
hoist_and_apply body (map mk_arg_term argspecs)... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 733,
"start_col": 0,
"start_line": 727
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
continuation: FStar.Tactics.PatternMatching.abspat_continuation ->
solution_term: FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Tactics.NamedView.term",
"Prims.list",
"FStar.Tactics.PatternMatching.abspat_argspec",
"FStar.Tactics.PatternMatching.hoist_and_apply",
"Prims.Nil",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Tactics.Util.map",
"FStar.Tactics.PatternMatc... | [] | false | true | false | false | false | let specialize_abspat_continuation' (continuation: abspat_continuation) (solution_term: term)
: Tac term =
| let mk_arg_term argspec = abspat_arg_of_abspat_argspec solution_term argspec in
let argspecs, body = continuation in
hoist_and_apply body (map mk_arg_term argspecs) [] | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.interp_abspat_continuation | val interp_abspat_continuation (a: Type0) (continuation: abspat_continuation)
: Tac (matching_solution -> Tac a) | val interp_abspat_continuation (a: Type0) (continuation: abspat_continuation)
: Tac (matching_solution -> Tac a) | let interp_abspat_continuation (a:Type0) (continuation: abspat_continuation)
: Tac (matching_solution -> Tac a) =
let applied = specialize_abspat_continuation continuation in
unquote #(matching_solution -> Tac a) applied | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 755,
"start_col": 0,
"start_line": 752
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Type0 -> continuation: FStar.Tactics.PatternMatching.abspat_continuation
-> FStar.Tactics.Effect.Tac
(_: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac a) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Stubs.Tactics.V2.Builtins.unquote",
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.specialize_abspat_continuation"
] | [] | false | true | false | false | false | let interp_abspat_continuation (a: Type0) (continuation: abspat_continuation)
: Tac (matching_solution -> Tac a) =
| let applied = specialize_abspat_continuation continuation in
unquote #(matching_solution -> Tac a) applied | false |
MerkleTree.Spec.fst | MerkleTree.Spec.op_String_Access | val op_String_Access : s: FStar.Seq.Base.seq MerkleTree.Spec.padded_hash -> i: Prims.nat{i < FStar.Seq.Base.length s}
-> MerkleTree.Spec.padded_hash | let op_String_Access (#hsz:pos) = S.index #(padded_hash #hsz) | {
"file_name": "src/MerkleTree.Spec.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 68,
"end_line": 53,
"start_col": 7,
"start_line": 53
} | module MerkleTree.Spec
open FStar.Classical
open FStar.Mul
open FStar.Seq
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 10"
// For SHA2_256, this is is a sequence of 32 bytes
// These are secret bytes, hence not an eqtype
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes { Seq.length b... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classica... | {
"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 | s: FStar.Seq.Base.seq MerkleTree.Spec.padded_hash -> i: Prims.nat{i < FStar.Seq.Base.length s}
-> MerkleTree.Spec.padded_hash | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"FStar.Seq.Base.index",
"MerkleTree.Spec.padded_hash",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length"
] | [] | false | false | false | false | false | let ( .[] ) (#hsz: pos) =
| S.index #(padded_hash #hsz) | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.inspect_abspat_solution | val inspect_abspat_solution (#a: _) (abspat: a) : Tac matching_solution | val inspect_abspat_solution (#a: _) (abspat: a) : Tac matching_solution | let inspect_abspat_solution #a (abspat: a) : Tac matching_solution =
match_abspat abspat (fun _ -> (fun solution -> solution <: Tac _) <: Tac _) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 784,
"start_col": 0,
"start_line": 783
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | abspat: a -> FStar.Tactics.Effect.Tac FStar.Tactics.PatternMatching.matching_solution | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.match_abspat",
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.abspat_continuation"
] | [] | false | true | false | false | false | let inspect_abspat_solution #a (abspat: a) : Tac matching_solution =
| match_abspat abspat (fun _ -> (fun solution -> solution <: Tac _) <: Tac _) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.specialize_abspat_continuation | val specialize_abspat_continuation (continuation: abspat_continuation) : Tac term | val specialize_abspat_continuation (continuation: abspat_continuation) : Tac term | let specialize_abspat_continuation (continuation: abspat_continuation)
: Tac term =
let solution_binder = fresh_binder (`matching_solution) in
let solution_term = pack (Tv_Var (binder_to_namedv solution_binder)) in
let applied = specialize_abspat_continuation' continuation solution_term in
let thunked = pac... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 747,
"start_col": 0,
"start_line": 738
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | continuation: FStar.Tactics.PatternMatching.abspat_continuation
-> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Tactics.NamedView.term",
"Prims.unit",
"FStar.Tactics.PatternMatching.debug",
"Prims.string",
"Prims.op_Hat",
"FStar.Stubs.Tactics.V2.Builtins.term_to_string",
"FStar.Tactics.PatternMatching.beta_reduce",
"FStar.Tactics.NamedView.pack",
"... | [] | false | true | false | false | false | let specialize_abspat_continuation (continuation: abspat_continuation) : Tac term =
| let solution_binder = fresh_binder (`matching_solution) in
let solution_term = pack (Tv_Var (binder_to_namedv solution_binder)) in
let applied = specialize_abspat_continuation' continuation solution_term in
let thunked = pack (Tv_Abs solution_binder applied) in
debug ("Specialized into " ^ (term_to_string thunked));
le... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.desc_of_pattern | val desc_of_pattern : _: FStar.Tactics.PatternMatching.pattern -> Prims.string | let desc_of_pattern = function
| PVar _ -> "a variable"
| PQn qn -> "a constant (" ^ qn ^ ")"
| PType -> "Type"
| PApp _ _ -> "a function application" | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 176,
"start_col": 0,
"start_line": 172
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Tactics.PatternMatching.pattern -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.PatternMatching.varname",
"FStar.Tactics.PatternMatching.qn",
"Prims.op_Hat",
"Prims.string"
] | [] | false | false | false | true | false | let desc_of_pattern =
| function
| PVar _ -> "a variable"
| PQn qn -> "a constant (" ^ qn ^ ")"
| PType -> "Type"
| PApp _ _ -> "a function application" | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.inspect_abspat_problem | val inspect_abspat_problem (#a: _) (abspat: a) : Tac matching_problem | val inspect_abspat_problem (#a: _) (abspat: a) : Tac matching_problem | let inspect_abspat_problem #a (abspat: a) : Tac matching_problem =
fst (interp_abspat #a abspat) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 780,
"start_col": 0,
"start_line": 779
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | abspat: a -> FStar.Tactics.Effect.Tac FStar.Tactics.PatternMatching.matching_problem | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Pervasives.Native.fst",
"FStar.Tactics.PatternMatching.matching_problem",
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.PatternMatching.interp_abspat"
] | [] | false | true | false | false | false | let inspect_abspat_problem #a (abspat: a) : Tac matching_problem =
| fst (interp_abspat #a abspat) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.tpair | val tpair (#a #b: _) (x: a) : Tac (b -> Tac (a * b)) | val tpair (#a #b: _) (x: a) : Tac (b -> Tac (a * b)) | let tpair #a #b (x : a) : Tac (b -> Tac (a * b)) =
fun (y: b) -> (x, y) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 787,
"start_col": 0,
"start_line": 786
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> FStar.Tactics.Effect.Tac (_: b -> FStar.Tactics.Effect.Tac (a * b)) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2"
] | [] | false | true | false | false | false | let tpair #a #b (x: a) : Tac (b -> Tac (a * b)) =
| fun (y: b) -> (x, y) | false |
Pulse.Checker.IntroPure.fst | Pulse.Checker.IntroPure.check_prop | val check_prop (g: env) (p: term) : T.Tac (p: term & tot_typing g p tm_prop) | val check_prop (g: env) (p: term) : T.Tac (p: term & tot_typing g p tm_prop) | let check_prop (g:env) (p:term)
: T.Tac (p:term & tot_typing g p tm_prop) =
let p0 = p in
let (| p, p_typing |) = Pulse.Checker.Pure.check_vprop g (tm_pure p) in
match p.t with
| Tm_Pure pp ->
let prop_typing = Pulse.Typing.Metatheory.pure_typing_inversion #_ #pp p_typing in
(| pp, prop_typing |)
... | {
"file_name": "lib/steel/pulse/Pulse.Checker.IntroPure.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 30,
"end_line": 41,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Env.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.Checker.Pure.fsti.checked",
"Pulse.Checker.Prover.fsti.checked",
"Puls... | [
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Pulse.Checker.Prover",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | g: Pulse.Typing.Env.env -> p: Pulse.Syntax.Base.term
-> FStar.Tactics.Effect.Tac
(Prims.dtuple2 Pulse.Syntax.Base.term
(fun p -> Pulse.Typing.tot_typing g p Pulse.Typing.tm_prop)) | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.tm_vprop",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Prims.Mkdtuple2",
"Pulse.Typing.tm_prop",
"Pulse.Syntax.Base.tm_fstar",
"FStar.Reflection.Typing.tm_prop",
"FStar.Range.range_0",
"Pulse.Typing... | [] | false | true | false | false | false | let check_prop (g: env) (p: term) : T.Tac (p: term & tot_typing g p tm_prop) =
| let p0 = p in
let (| p , p_typing |) = Pulse.Checker.Pure.check_vprop g (tm_pure p) in
match p.t with
| Tm_Pure pp ->
let prop_typing = Pulse.Typing.Metatheory.pure_typing_inversion #_ #pp p_typing in
(| pp, prop_typing |)
| _ ->
fail g
None
(Printf.sprintf "Impossible: check_intro_pure: checking a pure v... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.interp_abspat | val interp_abspat (#a: _) (abspat: a) : Tac (matching_problem * abspat_continuation) | val interp_abspat (#a: _) (abspat: a) : Tac (matching_problem * abspat_continuation) | let interp_abspat #a (abspat: a)
: Tac (matching_problem * abspat_continuation) =
matching_problem_of_abs (quote abspat) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 765,
"start_col": 0,
"start_line": 763
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | abspat: a
-> FStar.Tactics.Effect.Tac
(FStar.Tactics.PatternMatching.matching_problem *
FStar.Tactics.PatternMatching.abspat_continuation) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.matching_problem_of_abs",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.PatternMatching.matching_problem",
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Tactics.NamedView.term",
"FStar.Stubs.Reflection.Types.term"
] | [] | false | true | false | false | false | let interp_abspat #a (abspat: a) : Tac (matching_problem * abspat_continuation) =
| matching_problem_of_abs (quote abspat) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.string_of_pattern | val string_of_pattern : _: FStar.Tactics.PatternMatching.pattern -> Prims.string | let rec string_of_pattern = function
| PVar x -> "?" ^ x
| PQn qn -> qn
| PType -> "Type"
| PApp l r -> "(" ^ string_of_pattern l ^ " "
^ string_of_pattern r ^ ")" | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 183,
"start_col": 0,
"start_line": 178
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Tactics.PatternMatching.pattern -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.PatternMatching.varname",
"Prims.op_Hat",
"FStar.Tactics.PatternMatching.qn",
"FStar.Tactics.PatternMatching.string_of_pattern",
"Prims.string"
] | [
"recursion"
] | false | false | false | true | false | let rec string_of_pattern =
| function
| PVar x -> "?" ^ x
| PQn qn -> qn
| PType -> "Type"
| PApp l r -> "(" ^ string_of_pattern l ^ " " ^ string_of_pattern r ^ ")" | false | |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_br | val elab_br
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#p: pattern)
(#e: st_term)
(d: br_typing g sc_u sc_ty sc p e c)
: Tot R.branch (decreases d) | val elab_br
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#p: pattern)
(#e: st_term)
(d: br_typing g sc_u sc_ty sc p e c)
: Tot R.branch (decreases d) | let rec elab_st_typing (#g:env)
(#t:st_term)
(#c:comp)
(d:st_typing g t c)
: Tot R.term (decreases d)
= match d with
// | T_Tot _ t _ _ -> elab_term t
| T_Abs _ x qual b _u body _c ty_typing body_typing ->
let ty = elab_term b.binde... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 356,
"start_col": 0,
"start_line": 163
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.br_typing g sc_u sc_ty sc p e c -> Prims.Tot FStar.Stubs.Reflection.V2.Data.branch | Prims.Tot | [
"total",
""
] | [
"elab_st_typing",
"elab_br",
"elab_branches"
] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp_st",
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.typ",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.pattern",
"Pulse.Syntax.Base.st_term",
"Pulse.Typing.br_typing",
"Prims.list",
"FStar.Stubs.Reflection.V2.Data.binding",
"FStar.Reflection.Typi... | [
"mutual recursion"
] | false | false | false | false | false | let rec elab_br
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#p: pattern)
(#e: st_term)
(d: br_typing g sc_u sc_ty sc p e c)
: Tot R.branch (decreases d) =
| let TBR _ _ _ _ _ _ _ _ bs _ _ _ ed = d in
let e = elab_st_typing ed in
(elab_pat p, e) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.lift_exn_tac | val lift_exn_tac (#a #b: _) (f: (a -> match_res b)) (aa: a) : Tac b | val lift_exn_tac (#a #b: _) (f: (a -> match_res b)) (aa: a) : Tac b | let lift_exn_tac #a #b (f: a -> match_res b) (aa: a) : Tac b =
match f aa with
| Success bb -> bb
| Failure ex -> Tactics.fail (string_of_match_exception ex) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 269,
"start_col": 0,
"start_line": 266
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> FStar.Tactics.PatternMatching.match_res b) -> aa: a -> FStar.Tactics.Effect.Tac b | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.match_res",
"FStar.Tactics.PatternMatching.match_exception",
"FStar.Tactics.V1.Derived.fail",
"Prims.string",
"FStar.Tactics.PatternMatching.string_of_match_exception"
] | [] | false | true | false | false | false | let lift_exn_tac #a #b (f: (a -> match_res b)) (aa: a) : Tac b =
| match f aa with
| Success bb -> bb
| Failure ex -> Tactics.fail (string_of_match_exception ex) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.match_abspat | val match_abspat
(#b #a: _)
(abspat: a)
(k: (abspat_continuation -> Tac (matching_solution -> Tac b)))
: Tac b | val match_abspat
(#b #a: _)
(abspat: a)
(k: (abspat_continuation -> Tac (matching_solution -> Tac b)))
: Tac b | let match_abspat #b #a (abspat: a)
(k: abspat_continuation -> Tac (matching_solution -> Tac b))
: Tac b =
let goal = cur_goal () in
let hypotheses = vars_of_env (cur_env ()) in
let problem, continuation = interp_abspat abspat in
solve_mp problem hypotheses goal (k continuation) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 776,
"start_col": 0,
"start_line": 770
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
abspat: a ->
k:
(_: FStar.Tactics.PatternMatching.abspat_continuation
-> FStar.Tactics.Effect.Tac
(_: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac b))
-> FStar.Tactics.Effect.Tac b | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.abspat_continuation",
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.matching_problem",
"FStar.Tactics.PatternMatching.solve_mp",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.PatternMatching.interp_abspat",
"Prims.list",
"FStar.Stub... | [] | false | true | false | false | false | let match_abspat #b #a (abspat: a) (k: (abspat_continuation -> Tac (matching_solution -> Tac b)))
: Tac b =
| let goal = cur_goal () in
let hypotheses = vars_of_env (cur_env ()) in
let problem, continuation = interp_abspat abspat in
solve_mp problem hypotheses goal (k continuation) | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.mustfail | val mustfail (#a: _) (t: (unit -> Tac a)) (message: string) : Tac unit | val mustfail (#a: _) (t: (unit -> Tac a)) (message: string) : Tac unit | let mustfail #a (t: unit -> Tac a) (message: string) : Tac unit =
match trytac t with
| Some _ -> fail message
| None -> () | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 132,
"start_col": 0,
"start_line": 129
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: (_: Prims.unit -> FStar.Tactics.Effect.Tac a) -> message: Prims.string
-> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"Prims.string",
"FStar.Tactics.V2.Derived.fail",
"FStar.Pervasives.Native.option",
"FStar.Tactics.V2.Derived.trytac"
] | [] | false | true | false | false | false | let mustfail #a (t: (unit -> Tac a)) (message: string) : Tac unit =
| match trytac t with
| Some _ -> fail message
| None -> () | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.string_of_match_exception | val string_of_match_exception : _: FStar.Tactics.PatternMatching.match_exception -> FStar.Tactics.Effect.Tac Prims.string | let string_of_match_exception = function
| NameMismatch (qn1, qn2) ->
"Match failure (name mismatch): expecting " ^
qn1 ^ ", found " ^ qn2
| SimpleMismatch (pat, tm) ->
"Match failure (sort mismatch): expecting " ^
desc_of_pattern pat ^ ", got " ^ term_to_string tm
| NonLinearMismatch (nm, t1, t2)... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 238,
"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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Tactics.PatternMatching.match_exception -> FStar.Tactics.Effect.Tac Prims.string | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.match_exception",
"FStar.Tactics.PatternMatching.qn",
"Prims.op_Hat",
"Prims.string",
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.desc_of_pattern",
"FStar.Stubs.Tactics.V2.Builtins.term_to_string",
"FStar.Tact... | [] | false | true | false | false | false | let string_of_match_exception =
| function
| NameMismatch (qn1, qn2) -> "Match failure (name mismatch): expecting " ^ qn1 ^ ", found " ^ qn2
| SimpleMismatch (pat, tm) ->
"Match failure (sort mismatch): expecting " ^ desc_of_pattern pat ^ ", got " ^ term_to_string tm
| NonLinearMismatch (nm, t1, t2) ->
"Match failure (nonlinear mismatch): variable ... | false | |
MerkleTree.Spec.fst | MerkleTree.Spec.mt_verify | val mt_verify:
#hsz:pos -> #f:hash_fun_t #hsz -> #n:nat ->
p:(path #hsz n) -> idx:nat{idx < pow2 n} -> padded_hash #hsz -> padded_hash #hsz -> GTot prop | val mt_verify:
#hsz:pos -> #f:hash_fun_t #hsz -> #n:nat ->
p:(path #hsz n) -> idx:nat{idx < pow2 n} -> padded_hash #hsz -> padded_hash #hsz -> GTot prop | let mt_verify #hsz #f #n p idx h rt =
rt == mt_verify_ #_ #f p idx h | {
"file_name": "src/MerkleTree.Spec.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 32,
"end_line": 274,
"start_col": 0,
"start_line": 273
} | module MerkleTree.Spec
open FStar.Classical
open FStar.Mul
open FStar.Seq
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 10"
// For SHA2_256, this is is a sequence of 32 bytes
// These are secret bytes, hence not an eqtype
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes { Seq.length b... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classica... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p: MerkleTree.Spec.path n ->
idx: Prims.nat{idx < Prims.pow2 n} ->
h: MerkleTree.Spec.padded_hash ->
rt: MerkleTree.Spec.padded_hash
-> Prims.GTot Prims.prop | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"Prims.nat",
"MerkleTree.Spec.path",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"MerkleTree.Spec.padded_hash",
"Prims.eq2",
"MerkleTree.Spec.mt_verify_",
"Prims.prop"
] | [] | false | false | false | false | true | let mt_verify #hsz #f #n p idx h rt =
| rt == mt_verify_ #_ #f p idx h | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.fetch_eq_side | val fetch_eq_side: Prims.unit -> Tac (term * term) | val fetch_eq_side: Prims.unit -> Tac (term * term) | let fetch_eq_side () : Tac (term * term) =
let g = cur_goal () in
match inspect g with
| Tv_App squash (g, _) ->
(match inspect squash with
| Tv_UInst squash _
| Tv_FVar squash ->
if fv_to_string squash = flatten_name squash_qn then
(match inspect g with
| Tv_App eq_type_x ... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 88,
"start_col": 0,
"start_line": 62
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Tactics.Effect.Tac (FStar.Tactics.NamedView.term * FStar.Tactics.NamedView.term) | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.NamedView.term",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.aqualv",
"FStar.Stubs.Reflection.Types.fv",
"FStar.Stubs.Reflection.V2.Data.universes",
"Prims.op_Equality",
"Prims.string",
"FStar.Reflection.V2.Derived.fv_to_string",
"FStar.Reflect... | [] | false | true | false | false | false | let fetch_eq_side () : Tac (term * term) =
| let g = cur_goal () in
match inspect g with
| Tv_App squash (g, _) ->
(match inspect squash with
| Tv_UInst squash _
| Tv_FVar squash ->
if fv_to_string squash = flatten_name squash_qn
then
(match inspect g with
| Tv_App eq_type_x (y, _) ->
(match inspect eq_type_x wi... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.string_of_matching_problem | val string_of_matching_problem : mp: FStar.Tactics.PatternMatching.matching_problem -> Prims.string | let string_of_matching_problem mp =
let vars =
String.concat ", " mp.mp_vars in
let hyps =
String.concat "\n "
(List.Tot.Base.map (fun (nm, pat) ->
nm ^ ": " ^ (string_of_pattern pat)) mp.mp_hyps) in
let goal = match mp.mp_goal with
| None -> "_"
| Some pat -... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 372,
"start_col": 0,
"start_line": 360
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mp: FStar.Tactics.PatternMatching.matching_problem -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.matching_problem",
"Prims.op_Hat",
"Prims.string",
"FStar.Tactics.PatternMatching.__proj__Mkmatching_problem__item__mp_goal",
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.PatternMatching.string_of_pattern",
"FStar.String.concat",
"FStar.List.Tot.Base.map",
"... | [] | false | false | false | true | false | let string_of_matching_problem mp =
| let vars = String.concat ", " mp.mp_vars in
let hyps =
String.concat "\n "
(List.Tot.Base.map (fun (nm, pat) -> nm ^ ": " ^ (string_of_pattern pat)) mp.mp_hyps)
in
let goal =
match mp.mp_goal with
| None -> "_"
| Some pat -> string_of_pattern pat
in
"\n{ vars: " ^ vars ^ "\n" ^ " hyps: " ^ hyps ^ "\... | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.lift_exn_tactic | val lift_exn_tactic (#a #b: _) (f: (a -> match_res b)) (aa: a) : Tac b | val lift_exn_tactic (#a #b: _) (f: (a -> match_res b)) (aa: a) : Tac b | let lift_exn_tactic #a #b (f: a -> match_res b) (aa: a) : Tac b =
match f aa with
| Success bb -> bb
| Failure ex -> Tactics.fail (string_of_match_exception ex) | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 274,
"start_col": 0,
"start_line": 271
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (_: a -> FStar.Tactics.PatternMatching.match_res b) -> aa: a -> FStar.Tactics.Effect.Tac b | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.match_res",
"FStar.Tactics.PatternMatching.match_exception",
"FStar.Tactics.V1.Derived.fail",
"Prims.string",
"FStar.Tactics.PatternMatching.string_of_match_exception"
] | [] | false | true | false | false | false | let lift_exn_tactic #a #b (f: (a -> match_res b)) (aa: a) : Tac b =
| match f aa with
| Success bb -> bb
| Failure ex -> Tactics.fail (string_of_match_exception ex) | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_st_typing | val elab_st_typing (#g: env) (#t: st_term) (#c: comp) (d: st_typing g t c)
: Tot R.term (decreases d) | val elab_st_typing (#g: env) (#t: st_term) (#c: comp) (d: st_typing g t c)
: Tot R.term (decreases d) | let rec elab_st_typing (#g:env)
(#t:st_term)
(#c:comp)
(d:st_typing g t c)
: Tot R.term (decreases d)
= match d with
// | T_Tot _ t _ _ -> elab_term t
| T_Abs _ x qual b _u body _c ty_typing body_typing ->
let ty = elab_term b.binde... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 356,
"start_col": 0,
"start_line": 163
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.st_typing g t c -> Prims.Tot FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total",
""
] | [
"elab_st_typing",
"elab_br",
"elab_branches"
] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.st_term",
"Pulse.Syntax.Base.comp",
"Pulse.Typing.st_typing",
"Pulse.Syntax.Base.var",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_None",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.lookup",
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.qualifie... | [
"mutual recursion"
] | false | false | false | false | false | let rec elab_st_typing (#g: env) (#t: st_term) (#c: comp) (d: st_typing g t c)
: Tot R.term (decreases d) =
| match d with
| T_Abs _ x qual b _u body _c ty_typing body_typing ->
let ty = elab_term b.binder_ty in
let ppname = b.binder_ppname.name in
let body = elab_st_typing body_typing in
mk_abs_with_name ppname ty (elab_qual qual) (RT.close_term body x)
| T_STApp _ head _ qual _ arg _ _
| T_STGhostApp _ head _ qual _ ... | false |
Pulse.Elaborate.Core.fst | Pulse.Elaborate.Core.elab_branches | val elab_branches
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#brs: list branch)
(d: brs_typing g sc_u sc_ty sc brs c)
: Tot (list R.branch) (decreases d) | val elab_branches
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#brs: list branch)
(d: brs_typing g sc_u sc_ty sc brs c)
: Tot (list R.branch) (decreases d) | let rec elab_st_typing (#g:env)
(#t:st_term)
(#c:comp)
(d:st_typing g t c)
: Tot R.term (decreases d)
= match d with
// | T_Tot _ t _ _ -> elab_term t
| T_Abs _ x qual b _u body _c ty_typing body_typing ->
let ty = elab_term b.binde... | {
"file_name": "lib/steel/pulse/Pulse.Elaborate.Core.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 356,
"start_col": 0,
"start_line": 163
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.fst.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"Pulse.Elaborate.Pure.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Sealed.fsti.checked... | [
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "Pulse.RuntimeUtils",
"short_module": "RU"
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.brs_typing g sc_u sc_ty sc brs c
-> Prims.Tot (Prims.list FStar.Stubs.Reflection.V2.Data.branch) | Prims.Tot | [
"total",
""
] | [
"elab_st_typing",
"elab_br",
"elab_branches"
] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp_st",
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.typ",
"Pulse.Syntax.Base.term",
"Prims.list",
"Pulse.Syntax.Base.branch",
"Pulse.Typing.brs_typing",
"Prims.Nil",
"FStar.Stubs.Reflection.V2.Data.branch",
"Pulse.Syntax.Base.pattern",
"Pulse.S... | [
"mutual recursion"
] | false | false | false | false | false | let rec elab_branches
(#g: env)
(#c: comp_st)
(#sc_u: universe)
(#sc_ty: typ)
(#sc: term)
(#brs: list branch)
(d: brs_typing g sc_u sc_ty sc brs c)
: Tot (list R.branch) (decreases d) =
| match d with
| TBRS_0 _ -> []
| TBRS_1 _ p e bd _ d' -> elab_br bd :: elab_branches d' | false |
MerkleTree.Spec.fst | MerkleTree.Spec.pad_hashes | val pad_hashes:
#hsz:pos -> #f:hash_fun_t #hsz ->
hs:hashes #hsz -> Type0 | val pad_hashes:
#hsz:pos -> #f:hash_fun_t #hsz ->
hs:hashes #hsz -> Type0 | let pad_hashes #hsz #f hs =
S.equal hs (S.create (S.length hs) HPad) | {
"file_name": "src/MerkleTree.Spec.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 42,
"end_line": 368,
"start_col": 0,
"start_line": 367
} | module MerkleTree.Spec
open FStar.Classical
open FStar.Mul
open FStar.Seq
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 10"
// For SHA2_256, this is is a sequence of 32 bytes
// These are secret bytes, hence not an eqtype
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes { Seq.length b... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classica... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | hs: MerkleTree.Spec.hashes -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"MerkleTree.Spec.hashes",
"FStar.Seq.Base.equal",
"MerkleTree.Spec.padded_hash",
"FStar.Seq.Base.create",
"FStar.Seq.Base.length",
"MerkleTree.Spec.HPad"
] | [] | false | false | false | false | true | let pad_hashes #hsz #f hs =
| S.equal hs (S.create (S.length hs) HPad) | false |
GradedMonad.fst | GradedMonad.put | val put (#s: _) (x: s) : st s monoid_nat_plus 1 unit | val put (#s: _) (x: s) : st s monoid_nat_plus 1 unit | let put #s (x:s) : st s monoid_nat_plus 1 unit = fun _ -> (), x | {
"file_name": "examples/typeclasses/GradedMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 52,
"start_col": 0,
"start_line": 52
} | module GradedMonad
(* NB: this is the old version of the graded monad that has a monoid
index parameter everywhere instead of a constraint on the type. We
keep it for CI purposes. See doc/book/code/GradedMonad.fst for better
version. *)
#set-options "--warn_error -350"
//SNIPPET_START:monoid$
class monoid (a:Type) =... | {
"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": "GradedMonad.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: s -> GradedMonad.st s GradedMonad.monoid_nat_plus 1 Prims.unit | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"GradedMonad.st",
"GradedMonad.monoid",
"Prims.nat",
"GradedMonad.monoid_nat_plus"
] | [] | false | false | false | false | false | let put #s (x: s) : st s monoid_nat_plus 1 unit =
| fun _ -> (), x | false |
GradedMonad.fst | GradedMonad.st_graded | [@@ FStar.Tactics.Typeclasses.tcinstance]
val st_graded (s: Type) : graded_monad (st s) | [@@ FStar.Tactics.Typeclasses.tcinstance]
val st_graded (s: Type) : graded_monad (st s) | instance st_graded (s:Type) : graded_monad (st s) =
{
return = (fun #a #im (x:a) s -> x, s);
bind = (fun #a #b #ia #ib #im f g s -> let x, s = f s in g x s)
} | {
"file_name": "examples/typeclasses/GradedMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 48,
"start_col": 0,
"start_line": 44
} | module GradedMonad
(* NB: this is the old version of the graded monad that has a monoid
index parameter everywhere instead of a constraint on the type. We
keep it for CI purposes. See doc/book/code/GradedMonad.fst for better
version. *)
#set-options "--warn_error -350"
//SNIPPET_START:monoid$
class monoid (a:Type) =... | {
"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": "GradedMonad.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> GradedMonad.graded_monad (GradedMonad.st s) | Prims.Tot | [
"total"
] | [] | [
"GradedMonad.Mkgraded_monad",
"Prims.nat",
"GradedMonad.monoid",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"GradedMonad.graded_monad",
"GradedMonad.st"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let st_graded (s: Type) : graded_monad (st s) =
| {
return = (fun #a #im (x: a) s -> x, s);
bind
=
(fun #a #b #ia #ib #im f g s ->
let x, s = f s in
g x s)
} | false |
GradedMonad.fst | GradedMonad.st | val st : s: Type -> monoid_nat_plus: _ -> count: Prims.nat -> a: Type -> Type | let st (s:Type) monoid_nat_plus (count:nat) (a:Type) = s -> a & s | {
"file_name": "examples/typeclasses/GradedMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 43,
"start_col": 0,
"start_line": 43
} | module GradedMonad
(* NB: this is the old version of the graded monad that has a monoid
index parameter everywhere instead of a constraint on the type. We
keep it for CI purposes. See doc/book/code/GradedMonad.fst for better
version. *)
#set-options "--warn_error -350"
//SNIPPET_START:monoid$
class monoid (a:Type) =... | {
"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": "GradedMonad.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Type -> monoid_nat_plus: _ -> count: Prims.nat -> a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | true | true | let st (s: Type) monoid_nat_plus (count: nat) (a: Type) =
| s -> a & s | false | |
GradedMonad.fst | GradedMonad.test | val test : GradedMonad.st s GradedMonad.monoid_nat_plus (GradedMonad.op 0 1) Prims.unit | let test #s =
x <-- get #s ;
put x | {
"file_name": "examples/typeclasses/GradedMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 56,
"start_col": 0,
"start_line": 54
} | module GradedMonad
(* NB: this is the old version of the graded monad that has a monoid
index parameter everywhere instead of a constraint on the type. We
keep it for CI purposes. See doc/book/code/GradedMonad.fst for better
version. *)
#set-options "--warn_error -350"
//SNIPPET_START:monoid$
class monoid (a:Type) =... | {
"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": "GradedMonad.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | GradedMonad.st s GradedMonad.monoid_nat_plus (GradedMonad.op 0 1) Prims.unit | Prims.Tot | [
"total"
] | [] | [
"GradedMonad.bind",
"Prims.nat",
"GradedMonad.st",
"GradedMonad.monoid",
"GradedMonad.st_graded",
"Prims.unit",
"GradedMonad.monoid_nat_plus",
"GradedMonad.get",
"GradedMonad.put",
"GradedMonad.op"
] | [] | false | false | false | false | false | let test #s =
| x <-- get #s ;
put x | false | |
GradedMonad.fst | GradedMonad.get | val get (#s: _) : st s monoid_nat_plus 0 s | val get (#s: _) : st s monoid_nat_plus 0 s | let get #s : st s monoid_nat_plus 0 s = fun s -> s, s | {
"file_name": "examples/typeclasses/GradedMonad.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 51,
"start_col": 0,
"start_line": 51
} | module GradedMonad
(* NB: this is the old version of the graded monad that has a monoid
index parameter everywhere instead of a constraint on the type. We
keep it for CI purposes. See doc/book/code/GradedMonad.fst for better
version. *)
#set-options "--warn_error -350"
//SNIPPET_START:monoid$
class monoid (a:Type) =... | {
"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": "GradedMonad.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | GradedMonad.st s GradedMonad.monoid_nat_plus 0 s | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"GradedMonad.st",
"GradedMonad.monoid",
"Prims.nat",
"GradedMonad.monoid_nat_plus"
] | [] | false | false | false | false | false | let get #s : st s monoid_nat_plus 0 s =
| fun s -> s, s | false |
MerkleTree.Spec.fst | MerkleTree.Spec.padded_hash_fun | val padded_hash_fun: (#hsz:pos) -> (f:hash_fun_t #hsz) -> (lh:padded_hash #hsz) -> (rh:padded_hash #hsz) -> GTot (padded_hash #hsz) | val padded_hash_fun: (#hsz:pos) -> (f:hash_fun_t #hsz) -> (lh:padded_hash #hsz) -> (rh:padded_hash #hsz) -> GTot (padded_hash #hsz) | let padded_hash_fun #hsz f lh rh =
allow_inversion (padded_hash #hsz);
match lh, rh with
| HPad , _ -> HPad
| _ , HPad -> lh
| HRaw lhr, HRaw rhr -> HRaw (f lhr rhr) | {
"file_name": "src/MerkleTree.Spec.fst",
"git_rev": "7d7bdc20f2033171e279c176b26e84f9069d23c6",
"git_url": "https://github.com/hacl-star/merkle-tree.git",
"project_name": "merkle-tree"
} | {
"end_col": 42,
"end_line": 42,
"start_col": 0,
"start_line": 37
} | module MerkleTree.Spec
open FStar.Classical
open FStar.Mul
open FStar.Seq
module S = FStar.Seq
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 10"
// For SHA2_256, this is is a sequence of 32 bytes
// These are secret bytes, hence not an eqtype
type hash (#hsz:pos) = b:Spec.Hash.Definitions.bytes { Seq.length b... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classica... | {
"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 | f: MerkleTree.Spec.hash_fun_t -> lh: MerkleTree.Spec.padded_hash -> rh: MerkleTree.Spec.padded_hash
-> Prims.GTot MerkleTree.Spec.padded_hash | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.pos",
"MerkleTree.Spec.hash_fun_t",
"MerkleTree.Spec.padded_hash",
"FStar.Pervasives.Native.Mktuple2",
"MerkleTree.Spec.HPad",
"MerkleTree.Spec.hash",
"MerkleTree.Spec.HRaw",
"Prims.unit",
"FStar.Pervasives.allow_inversion"
] | [] | false | false | false | false | false | let padded_hash_fun #hsz f lh rh =
| allow_inversion (padded_hash #hsz);
match lh, rh with
| HPad, _ -> HPad
| _, HPad -> lh
| HRaw lhr, HRaw rhr -> HRaw (f lhr rhr) | false |
Hacl.Spec.SHA2.Lemmas.fst | Hacl.Spec.SHA2.Lemmas.transpose_ws_lemma_ij | val transpose_ws_lemma_ij:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> ws:ws_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 16} ->
Lemma
(let l = lanes a m in
((ws_spec_v (transpose_ws ws)).[j]).[i] == (vec_v ws.[i / l * l + j]).[i % l]) | val transpose_ws_lemma_ij:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> ws:ws_spec a m
-> j:nat{j < lanes a m}
-> i:nat{i < 16} ->
Lemma
(let l = lanes a m in
((ws_spec_v (transpose_ws ws)).[j]).[i] == (vec_v ws.[i / l * l + j]).[i % l]) | let transpose_ws_lemma_ij #a #m ws j i =
assert (((ws_spec_v (transpose_ws ws)).[j]).[i] == (vec_v (transpose_ws ws).[i]).[j]);
match lanes a m with
| 1 -> ()
| 4 -> transpose_ws4_lemma_ij #a #m ws j i
| 8 -> transpose_ws8_lemma_ij #a #m ws j i | {
"file_name": "code/sha2-mb/Hacl.Spec.SHA2.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 79,
"start_col": 0,
"start_line": 74
} | module Hacl.Spec.SHA2.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.IntVector
open Lib.IntVector.Transpose
open Spec.Hash.Definitions
open Hacl.Spec.SHA2.Vec
#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"
val transpose_ws4_lemma_ij:
#a:sha2_alg
-> #m:m_spec{lanes a m == 4} // lanes a m ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntVector.Transpose.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.SHA2.Vec.fst.checked",
"FStar.Seq.fst.checked"... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.SHA2.Vec",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntVector.Transpose",
"short_module": null
},
{
"abbrev": fals... | {
"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 |
ws: Hacl.Spec.SHA2.Vec.ws_spec a m ->
j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->
i: Prims.nat{i < 16}
-> FStar.Pervasives.Lemma
(ensures
(let l = Hacl.Spec.SHA2.Vec.lanes a m in
(Hacl.Spec.SHA2.Vec.ws_spec_v (Hacl.Spec.SHA2.Vec.transpose_ws ws)).[ j ].[ i ] ==
(Lib.IntVec... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Hacl.Spec.SHA2.Vec.is_supported",
"Hacl.Spec.SHA2.Vec.ws_spec",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.SHA2.Vec.lanes",
"Hacl.Spec.SHA2.Lemmas.transpose_ws4_lemma_ij",
"Hacl.Spec.SHA2.Lemmas.transpose_ws8_lemma_ij",... | [] | false | false | true | false | false | let transpose_ws_lemma_ij #a #m ws j i =
| assert (((ws_spec_v (transpose_ws ws)).[ j ]).[ i ] == (vec_v (transpose_ws ws).[ i ]).[ j ]);
match lanes a m with
| 1 -> ()
| 4 -> transpose_ws4_lemma_ij #a #m ws j i
| 8 -> transpose_ws8_lemma_ij #a #m ws j i | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.solve_mp | val solve_mp
(#a: _)
(problem: matching_problem)
(hypotheses: list hypothesis)
(goal: term)
(body: (matching_solution -> Tac a))
: Tac a | val solve_mp
(#a: _)
(problem: matching_problem)
(hypotheses: list hypothesis)
(goal: term)
(body: (matching_solution -> Tac a))
: Tac a | let solve_mp #a (problem: matching_problem)
(hypotheses: list hypothesis) (goal: term)
(body: matching_solution -> Tac a)
: Tac a =
let goal_ps =
match problem.mp_goal with
| None -> { ms_vars = []; ms_hyps = [] }
| Some pat ->
match interp_pattern pat goal with
... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 485,
"start_col": 0,
"start_line": 474
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
problem: FStar.Tactics.PatternMatching.matching_problem ->
hypotheses: Prims.list FStar.Tactics.PatternMatching.hypothesis ->
goal: FStar.Tactics.NamedView.term ->
body: (_: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac a)
-> FStar.Tactics.Effect.Tac a | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.matching_problem",
"Prims.list",
"FStar.Tactics.PatternMatching.hypothesis",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.solve_mp_for_hyps",
"FStar.Tactics.PatternMatching.__proj__Mkmatching_problem__ite... | [] | false | true | false | false | false | let solve_mp
#a
(problem: matching_problem)
(hypotheses: list hypothesis)
(goal: term)
(body: (matching_solution -> Tac a))
: Tac a =
| let goal_ps =
match problem.mp_goal with
| None -> { ms_vars = []; ms_hyps = [] }
| Some pat ->
match interp_pattern pat goal with
| Failure ex -> fail ("Failed to match goal: " ^ (string_of_match_exception ex))
| Success bindings -> { ms_vars = bindings; ms_hyps = [] }
in
solve_mp_for_hyps #a problem... | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.assoc_varname_fail | val assoc_varname_fail (#b: Type) (key: varname) (ls: list (varname * b)) : Tac b | val assoc_varname_fail (#b: Type) (key: varname) (ls: list (varname * b)) : Tac b | let assoc_varname_fail (#b: Type) (key: varname) (ls: list (varname * b))
: Tac b =
match List.Tot.Base.assoc key ls with
| None -> fail ("Not found: " ^ key)
| Some x -> x | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 398,
"start_col": 0,
"start_line": 394
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
key: FStar.Tactics.PatternMatching.varname ->
ls: Prims.list (FStar.Tactics.PatternMatching.varname * b)
-> FStar.Tactics.Effect.Tac b | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.varname",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.assoc",
"FStar.Tactics.V2.Derived.fail",
"Prims.op_Hat"
] | [] | false | true | false | false | false | let assoc_varname_fail (#b: Type) (key: varname) (ls: list (varname * b)) : Tac b =
| match List.Tot.Base.assoc key ls with
| None -> fail ("Not found: " ^ key)
| Some x -> x | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.locate_fn_of_binder_kind | val locate_fn_of_binder_kind : binder_kind: FStar.Tactics.PatternMatching.abspat_binder_kind -> FStar.Stubs.Reflection.Types.term | let locate_fn_of_binder_kind binder_kind =
match binder_kind with
| ABKVar _ -> `ms_locate_var
| ABKHyp -> `ms_locate_hyp
| ABKGoal -> `ms_locate_unit | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 694,
"start_col": 0,
"start_line": 690
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | binder_kind: FStar.Tactics.PatternMatching.abspat_binder_kind -> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Tactics.PatternMatching.abspat_binder_kind",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.Types.term"
] | [] | false | false | false | true | false | let locate_fn_of_binder_kind binder_kind =
| match binder_kind with
| ABKVar _ -> `ms_locate_var
| ABKHyp -> `ms_locate_hyp
| ABKGoal -> `ms_locate_unit | false | |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.solve_mp_for_hyps | val solve_mp_for_hyps
(#a: _)
(mp_hyps: list (varname * pattern))
(hypotheses: list hypothesis)
(body: (matching_solution -> Tac a))
(partial_solution: matching_solution)
: Tac a | val solve_mp_for_hyps
(#a: _)
(mp_hyps: list (varname * pattern))
(hypotheses: list hypothesis)
(body: (matching_solution -> Tac a))
(partial_solution: matching_solution)
: Tac a | let rec solve_mp_for_hyps #a
(mp_hyps: list (varname * pattern))
(hypotheses: list hypothesis)
(body: matching_solution -> Tac a)
(partial_solution: matching_solution)
: Tac a =
match mp_hyps with
| [] -> bod... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 468,
"start_col": 0,
"start_line": 457
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mp_hyps:
Prims.list (FStar.Tactics.PatternMatching.varname * FStar.Tactics.PatternMatching.pattern) ->
hypotheses: Prims.list FStar.Tactics.PatternMatching.hypothesis ->
body: (_: FStar.Tactics.PatternMatching.matching_solution -> FStar.Tactics.Effect.Tac a) ->
partial_solution: FStar.Tactics.Pat... | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Tactics.PatternMatching.varname",
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.PatternMatching.hypothesis",
"FStar.Tactics.PatternMatching.matching_solution",
"FStar.Tactics.PatternMatching.solve_mp_for_single_hyp",
"FStar.Tactics.Patte... | [
"recursion"
] | false | true | false | false | false | let rec solve_mp_for_hyps
#a
(mp_hyps: list (varname * pattern))
(hypotheses: list hypothesis)
(body: (matching_solution -> Tac a))
(partial_solution: matching_solution)
: Tac a =
| match mp_hyps with
| [] -> body partial_solution
| (name, pat) :: pats ->
solve_mp_for_single_hyp name
pat
hypotheses
(solve_mp_for_hyps pats hypotheses body)
partial_solution | false |
FStar.Tactics.PatternMatching.fst | FStar.Tactics.PatternMatching.interp_pattern_aux | val interp_pattern_aux (pat: pattern) (cur_bindings: bindings) (tm: term) : Tac (match_res bindings) | val interp_pattern_aux (pat: pattern) (cur_bindings: bindings) (tm: term) : Tac (match_res bindings) | let rec interp_pattern_aux (pat: pattern) (cur_bindings: bindings) (tm:term)
: Tac (match_res bindings) =
let interp_var (v: varname) cur_bindings tm =
match List.Tot.Base.assoc v cur_bindings with
| Some tm' -> if term_eq tm tm' then return cur_bindings
else raise (NonLinearMismatch (v, ... | {
"file_name": "ulib/FStar.Tactics.PatternMatching.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 321,
"start_col": 0,
"start_line": 292
} | (*
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.Tactics.V2.fst.checked",
"FStar.Tactics.fst.checked",
"FStar.String.fsti.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checke... | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
pat: FStar.Tactics.PatternMatching.pattern ->
cur_bindings: FStar.Tactics.PatternMatching.bindings ->
tm: FStar.Tactics.NamedView.term
-> FStar.Tactics.Effect.Tac
(FStar.Tactics.PatternMatching.match_res FStar.Tactics.PatternMatching.bindings) | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.PatternMatching.pattern",
"FStar.Tactics.PatternMatching.bindings",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.PatternMatching.varname",
"FStar.Tactics.PatternMatching.match_res",
"FStar.Tactics.PatternMatching.qn",
"Prims.precedes",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stu... | [
"recursion"
] | false | true | false | false | false | let rec interp_pattern_aux (pat: pattern) (cur_bindings: bindings) (tm: term)
: Tac (match_res bindings) =
| let interp_var (v: varname) cur_bindings tm =
match List.Tot.Base.assoc v cur_bindings with
| Some tm' ->
if term_eq tm tm' then return cur_bindings else raise (NonLinearMismatch (v, tm, tm'))
| None -> return ((v, tm) :: cur_bindings)
in
let interp_qn (qn: qn) cur_bindings tm =
match inspect tm with
| Tv... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.