effect stringclasses 48
values | original_source_type stringlengths 0 23k | opens_and_abbrevs listlengths 2 92 | isa_cross_project_example bool 1
class | source_definition stringlengths 9 57.9k | partial_definition stringlengths 7 23.3k | is_div bool 2
classes | is_type null | is_proof bool 2
classes | completed_definiton stringlengths 1 250k | dependencies dict | effect_flags listlengths 0 2 | ideal_premises listlengths 0 236 | mutual_with listlengths 0 11 | file_context stringlengths 0 407k | interleaved bool 1
class | is_simply_typed bool 2
classes | file_name stringlengths 5 48 | vconfig dict | is_simple_lemma null | source_type stringlengths 10 23k | proof_features listlengths 0 1 | name stringlengths 8 95 | source dict | verbose_type stringlengths 1 7.42k | source_range dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.Pervasives.Lemma | val modifies_1_modifies
(#a: Type)
(b: B.buffer a)
(h1 h2: HS.mem)
: Lemma
(requires (B.modifies_1 b h1 h2))
(ensures (modifies (loc_buffer b) h1 h2))
[SMTPat (B.modifies_1 b h1 h2)] | [
{
"abbrev": true,
"full_module": "FStar.ModifiesGen",
"short_module": "MG"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FS... | false | let modifies_1_modifies #a b h1 h2 =
B.lemma_reveal_modifies_1 b h1 h2;
MG.modifies_intro (loc_buffer b) h1 h2
(fun _ -> ())
(fun t' pre' b' ->
MG.loc_disjoint_sym (loc_mreference b') (loc_buffer b);
MG.loc_disjoint_aloc_addresses_elim #_ #cls #(B.frameOf b) #(B.as_addr b) (LocBuffer b) true (HS... | val modifies_1_modifies
(#a: Type)
(b: B.buffer a)
(h1 h2: HS.mem)
: Lemma
(requires (B.modifies_1 b h1 h2))
(ensures (modifies (loc_buffer b) h1 h2))
[SMTPat (B.modifies_1 b h1 h2)]
let modifies_1_modifies #a b h1 h2 = | false | null | true | B.lemma_reveal_modifies_1 b h1 h2;
MG.modifies_intro (loc_buffer b)
h1
h2
(fun _ -> ())
(fun t' pre' b' ->
MG.loc_disjoint_sym (loc_mreference b') (loc_buffer b);
MG.loc_disjoint_aloc_addresses_elim #_
#cls
#(B.frameOf b)
#(B.as_addr b)
(LocBuffer b)
true
... | {
"checked_file": "FStar.Modifies.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.ModifiesGen.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.... | [
"lemma"
] | [
"FStar.Buffer.buffer",
"FStar.Monotonic.HyperStack.mem",
"FStar.ModifiesGen.modifies_intro",
"FStar.Modifies.aloc",
"FStar.Modifies.cls",
"FStar.Modifies.loc_buffer",
"FStar.Monotonic.HyperHeap.rid",
"Prims.unit",
"FStar.Preorder.preorder",
"FStar.Monotonic.HyperStack.mreference",
"FStar.Modifie... | [] | (*
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... | false | false | FStar.Modifies.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val modifies_1_modifies
(#a: Type)
(b: B.buffer a)
(h1 h2: HS.mem)
: Lemma
(requires (B.modifies_1 b h1 h2))
(ensures (modifies (loc_buffer b) h1 h2))
[SMTPat (B.modifies_1 b h1 h2)] | [] | FStar.Modifies.modifies_1_modifies | {
"file_name": "ulib/FStar.Modifies.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: FStar.Buffer.buffer a -> h1: FStar.Monotonic.HyperStack.mem -> h2: FStar.Monotonic.HyperStack.mem
-> FStar.Pervasives.Lemma (requires FStar.Buffer.modifies_1 b h1 h2)
(ensures FStar.Modifies.modifies (FStar.Modifies.loc_buffer b) h1 h2)
[SMTPat (FStar.Buffer.modifies_1 b h1 h2)] | {
"end_col": 5,
"end_line": 353,
"start_col": 2,
"start_line": 342
} |
FStar.Pervasives.Lemma | val free_does_not_contain_addr
(#a: Type0)
(#rel: Preorder.preorder a)
(r: HS.mreference a rel)
(m: HS.mem)
(x: HS.rid * nat)
: Lemma
(requires (
HS.is_mm r /\
m `HS.contains` r /\
fst x == HS.frameOf r /\
snd x == HS.as_addr r
))
(ensures (
HS.free r m `does_not_contain_addr` x
))... | [
{
"abbrev": true,
"full_module": "FStar.ModifiesGen",
"short_module": "MG"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FS... | false | let free_does_not_contain_addr = MG.free_does_not_contain_addr | val free_does_not_contain_addr
(#a: Type0)
(#rel: Preorder.preorder a)
(r: HS.mreference a rel)
(m: HS.mem)
(x: HS.rid * nat)
: Lemma
(requires (
HS.is_mm r /\
m `HS.contains` r /\
fst x == HS.frameOf r /\
snd x == HS.as_addr r
))
(ensures (
HS.free r m `does_not_contain_addr` x
))... | false | null | true | MG.free_does_not_contain_addr | {
"checked_file": "FStar.Modifies.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.ModifiesGen.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.... | [
"lemma"
] | [
"FStar.ModifiesGen.free_does_not_contain_addr"
] | [] | (*
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... | false | false | FStar.Modifies.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val free_does_not_contain_addr
(#a: Type0)
(#rel: Preorder.preorder a)
(r: HS.mreference a rel)
(m: HS.mem)
(x: HS.rid * nat)
: Lemma
(requires (
HS.is_mm r /\
m `HS.contains` r /\
fst x == HS.frameOf r /\
snd x == HS.as_addr r
))
(ensures (
HS.free r m `does_not_contain_addr` x
))... | [] | FStar.Modifies.free_does_not_contain_addr | {
"file_name": "ulib/FStar.Modifies.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r: FStar.Monotonic.HyperStack.mreference a rel ->
m: FStar.Monotonic.HyperStack.mem ->
x: (FStar.Monotonic.HyperHeap.rid * Prims.nat)
-> FStar.Pervasives.Lemma
(requires
FStar.Monotonic.HyperStack.is_mm r /\ FStar.Monotonic.HyperStack.contains m r /\
FStar.Pervasives.Native.fst x ==... | {
"end_col": 62,
"end_line": 426,
"start_col": 33,
"start_line": 426
} |
FStar.Pervasives.Lemma | val lemma_to_of (s:machine_state) : Lemma
(ensures state_to_S (state_of_S s) == {s with Ms.ms_trace = []}) | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_to_of s =
let open Ms in
let s' = state_of_S s in
let s'' = state_to_S s' in
assert (feq s.ms_regs s''.ms_regs);
assert (feq s.ms_flags s''.ms_flags);
VSS.lemma_stack_to_from s.ms_stack;
() | val lemma_to_of (s:machine_state) : Lemma
(ensures state_to_S (state_of_S s) == {s with Ms.ms_trace = []})
let lemma_to_of s = | false | null | true | let open Ms in
let s' = state_of_S s in
let s'' = state_to_S s' in
assert (feq s.ms_regs s''.ms_regs);
assert (feq s.ms_flags s''.ms_flags);
VSS.lemma_stack_to_from s.ms_stack;
() | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.X64.StateLemmas.machine_state",
"Prims.unit",
"Vale.X64.Stack_Sems.lemma_stack_to_from",
"Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__item__ms_stack",
"Prims._assert",
"FStar.FunctionalExtensionality.feq",
"Vale.X64.Machine_s.flag",
"Vale.X64.Machine_Semantics_s.flag_val_t",
"Vale.X6... | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 2,
"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... | null | val lemma_to_of (s:machine_state) : Lemma
(ensures state_to_S (state_of_S s) == {s with Ms.ms_trace = []}) | [] | Vale.X64.StateLemmas.lemma_to_of | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: Vale.X64.StateLemmas.machine_state
-> FStar.Pervasives.Lemma
(ensures
Vale.X64.StateLemmas.state_to_S (Vale.X64.StateLemmas.state_of_S s) ==
Vale.X64.Machine_Semantics_s.Mkmachine_state (Mkmachine_state?.ms_ok s)
(Mkmachine_state?.ms_regs s)
(Mkmachine_state?.ms_flags s)
(Mk... | {
"end_col": 4,
"end_line": 80,
"start_col": 2,
"start_line": 74
} |
FStar.Pervasives.Lemma | val lemma_load_mem_get64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures load_mem64 ptr (get_vale_heap h) == get_heap_val64 ptr (heap_get (coerce h)))
[SMTPat (load_mem64 ptr (get_vale_heap h))] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_load_mem_get64 h ptr =
MS.equiv_load_mem64 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | val lemma_load_mem_get64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures load_mem64 ptr (get_vale_heap h) == get_heap_val64 ptr (heap_get (coerce h)))
[SMTPat (load_mem64 ptr (get_vale_heap h))]
let lemma_load_mem_get64 h ptr = | false | null | true | MS.equiv_load_mem64 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Prims.int",
"Prims.unit",
"Vale.X64.Memory_Sems.lemma_heap_get_heap",
"Vale.X64.Memory_Sems.equiv_load_mem64",
"Vale.X64.Memory.get_vale_heap"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_load_mem_get64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures load_mem64 ptr (get_vale_heap h) == get_heap_val64 ptr (heap_get (coerce h)))
[SMTPat (load_mem64 ptr (get_vale_heap h))] | [] | Vale.X64.StateLemmas.lemma_load_mem_get64 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_full_heap -> ptr: Prims.int
-> FStar.Pervasives.Lemma
(requires Vale.X64.Memory.valid_mem64 ptr (Vale.X64.Memory.get_vale_heap h))
(ensures
Vale.X64.Memory.load_mem64 ptr (Vale.X64.Memory.get_vale_heap h) ==
Vale.Arch.MachineHeap_s.get_heap_val64 ptr
(V... | {
"end_col": 4,
"end_line": 32,
"start_col": 2,
"start_line": 30
} |
FStar.Pervasives.Lemma | val lemma_valid_mem_addr64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures valid_addr64 ptr (heap_get (coerce h)))
[SMTPat (valid_mem64 ptr (get_vale_heap h))] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_valid_mem_addr64 h ptr =
MS.bytes_valid64 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | val lemma_valid_mem_addr64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures valid_addr64 ptr (heap_get (coerce h)))
[SMTPat (valid_mem64 ptr (get_vale_heap h))]
let lemma_valid_mem_addr64 h ptr = | false | null | true | MS.bytes_valid64 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Prims.int",
"Prims.unit",
"Vale.X64.Memory_Sems.lemma_heap_get_heap",
"Vale.X64.Memory_Sems.bytes_valid64",
"Vale.X64.Memory.get_vale_heap"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_valid_mem_addr64 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem64 ptr (get_vale_heap h))
(ensures valid_addr64 ptr (heap_get (coerce h)))
[SMTPat (valid_mem64 ptr (get_vale_heap h))] | [] | Vale.X64.StateLemmas.lemma_valid_mem_addr64 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_full_heap -> ptr: Prims.int
-> FStar.Pervasives.Lemma
(requires Vale.X64.Memory.valid_mem64 ptr (Vale.X64.Memory.get_vale_heap h))
(ensures
Vale.Arch.MachineHeap_s.valid_addr64 ptr
(Vale.Arch.Heap.heap_get (Vale.X64.StateLemmas.coerce h)))
[SMTPat (Vale.X... | {
"end_col": 4,
"end_line": 22,
"start_col": 2,
"start_line": 20
} |
FStar.Pervasives.Lemma | val lemma_valid_mem_addr128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures valid_addr128 ptr (heap_get (coerce h)))
[SMTPat (valid_mem128 ptr (get_vale_heap h))] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_valid_mem_addr128 h ptr =
MS.bytes_valid128 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | val lemma_valid_mem_addr128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures valid_addr128 ptr (heap_get (coerce h)))
[SMTPat (valid_mem128 ptr (get_vale_heap h))]
let lemma_valid_mem_addr128 h ptr = | false | null | true | MS.bytes_valid128 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Prims.int",
"Prims.unit",
"Vale.X64.Memory_Sems.lemma_heap_get_heap",
"Vale.X64.Memory_Sems.bytes_valid128",
"Vale.X64.Memory.get_vale_heap"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_valid_mem_addr128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures valid_addr128 ptr (heap_get (coerce h)))
[SMTPat (valid_mem128 ptr (get_vale_heap h))] | [] | Vale.X64.StateLemmas.lemma_valid_mem_addr128 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_full_heap -> ptr: Prims.int
-> FStar.Pervasives.Lemma
(requires Vale.X64.Memory.valid_mem128 ptr (Vale.X64.Memory.get_vale_heap h))
(ensures
Vale.Arch.MachineHeap_s.valid_addr128 ptr
(Vale.Arch.Heap.heap_get (Vale.X64.StateLemmas.coerce h)))
[SMTPat (Vale... | {
"end_col": 4,
"end_line": 27,
"start_col": 2,
"start_line": 25
} |
FStar.Pervasives.Lemma | val lemma_load_mem_get128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures load_mem128 ptr (get_vale_heap h) == get_heap_val128 ptr (heap_get (coerce h)))
[SMTPat (load_mem128 ptr (get_vale_heap h))] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_load_mem_get128 h ptr =
MS.equiv_load_mem128 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | val lemma_load_mem_get128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures load_mem128 ptr (get_vale_heap h) == get_heap_val128 ptr (heap_get (coerce h)))
[SMTPat (load_mem128 ptr (get_vale_heap h))]
let lemma_load_mem_get128 h ptr = | false | null | true | MS.equiv_load_mem128 ptr (get_vale_heap h);
MS.lemma_heap_get_heap h;
() | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Prims.int",
"Prims.unit",
"Vale.X64.Memory_Sems.lemma_heap_get_heap",
"Vale.X64.Memory_Sems.equiv_load_mem128",
"Vale.X64.Memory.get_vale_heap"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_load_mem_get128 (h:vale_full_heap) (ptr:int) : Lemma
(requires valid_mem128 ptr (get_vale_heap h))
(ensures load_mem128 ptr (get_vale_heap h) == get_heap_val128 ptr (heap_get (coerce h)))
[SMTPat (load_mem128 ptr (get_vale_heap h))] | [] | Vale.X64.StateLemmas.lemma_load_mem_get128 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_full_heap -> ptr: Prims.int
-> FStar.Pervasives.Lemma
(requires Vale.X64.Memory.valid_mem128 ptr (Vale.X64.Memory.get_vale_heap h))
(ensures
Vale.X64.Memory.load_mem128 ptr (Vale.X64.Memory.get_vale_heap h) ==
Vale.Arch.MachineHeap_s.get_heap_val128 ptr
... | {
"end_col": 4,
"end_line": 37,
"start_col": 2,
"start_line": 35
} |
FStar.Pervasives.Lemma | val lemma_load_buffer_read128 (h:vale_heap) (b:buffer128) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem128 (buffer_addr b h + 16 * i) h)
[SMTPat (buffer_read b i h)] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_load_buffer_read128 h b i =
lemma_load_mem128 b i h | val lemma_load_buffer_read128 (h:vale_heap) (b:buffer128) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem128 (buffer_addr b h + 16 * i) h)
[SMTPat (buffer_read b i h)]
let lemma_load_buffer_read128 h b i = | false | null | true | lemma_load_mem128 b i h | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_heap",
"Vale.X64.Memory.buffer128",
"Prims.int",
"Vale.X64.Memory.lemma_load_mem128",
"Prims.unit"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_load_buffer_read128 (h:vale_heap) (b:buffer128) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem128 (buffer_addr b h + 16 * i) h)
[SMTPat (buffer_read b i h)] | [] | Vale.X64.StateLemmas.lemma_load_buffer_read128 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_heap -> b: Vale.X64.Memory.buffer128 -> i: Prims.int
-> FStar.Pervasives.Lemma (requires Vale.X64.Memory.valid_buffer_read h b i)
(ensures
Vale.X64.Memory.buffer_read b i h ==
Vale.X64.Memory.load_mem128 (Vale.X64.Memory.buffer_addr b h + 16 * i) h)
[SMTPat (Vale... | {
"end_col": 25,
"end_line": 49,
"start_col": 2,
"start_line": 49
} |
FStar.Pervasives.Lemma | val lemma_to_eval_operand (s:vale_state) (o:operand64) : Lemma
(requires valid_src_operand o s)
(ensures eval_operand o s == Ms.eval_operand o (state_to_S s))
[SMTPat (eval_operand o s)] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_to_eval_operand s o =
allow_inversion tmaddr;
allow_inversion maddr | val lemma_to_eval_operand (s:vale_state) (o:operand64) : Lemma
(requires valid_src_operand o s)
(ensures eval_operand o s == Ms.eval_operand o (state_to_S s))
[SMTPat (eval_operand o s)]
let lemma_to_eval_operand s o = | false | null | true | allow_inversion tmaddr;
allow_inversion maddr | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.X64.State.vale_state",
"Vale.X64.Machine_s.operand64",
"FStar.Pervasives.allow_inversion",
"Vale.X64.Machine_s.maddr",
"Prims.unit",
"Vale.X64.Machine_s.tmaddr"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"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... | null | val lemma_to_eval_operand (s:vale_state) (o:operand64) : Lemma
(requires valid_src_operand o s)
(ensures eval_operand o s == Ms.eval_operand o (state_to_S s))
[SMTPat (eval_operand o s)] | [] | Vale.X64.StateLemmas.lemma_to_eval_operand | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: Vale.X64.State.vale_state -> o: Vale.X64.Machine_s.operand64
-> FStar.Pervasives.Lemma (requires Vale.X64.State.valid_src_operand o s)
(ensures
Vale.X64.State.eval_operand o s ==
Vale.X64.Machine_Semantics_s.eval_operand o (Vale.X64.StateLemmas.state_to_S s))
[SMTPat (Vale.X64.State.eva... | {
"end_col": 23,
"end_line": 55,
"start_col": 2,
"start_line": 54
} |
FStar.Pervasives.Lemma | val lemma_load_buffer_read64 (h:vale_heap) (b:buffer64) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem64 (buffer_addr b h + 8 * i) h)
[SMTPat (buffer_read b i h)] | [
{
"abbrev": true,
"full_module": "FStar.FunctionalExtensionality",
"short_module": "F"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_Sems",
"short_module": "VSS"
},
{
"abbrev": true,
"full_module": "Vale.X64.Stack_i",
"short_module": "VST"
},
{
"abbrev": tru... | false | let lemma_load_buffer_read64 h b i =
lemma_load_mem64 b i h | val lemma_load_buffer_read64 (h:vale_heap) (b:buffer64) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem64 (buffer_addr b h + 8 * i) h)
[SMTPat (buffer_read b i h)]
let lemma_load_buffer_read64 h b i = | false | null | true | lemma_load_mem64 b i h | {
"checked_file": "Vale.X64.StateLemmas.fst.checked",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_Sems.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Memory_Sems.fsti.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Memory.fst.checked",
"Vale.X64.Machine... | [
"lemma"
] | [
"Vale.Arch.HeapImpl.vale_heap",
"Vale.X64.Memory.buffer64",
"Prims.int",
"Vale.X64.Memory.lemma_load_mem64",
"Prims.unit"
] | [] | module Vale.X64.StateLemmas
open FStar.Mul
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.State
module BS = Vale.X64.Machine_Semantics_s
module MS = Vale.X64.Memory_Sems
module ME = Vale.X64.Memory
module VST = Vale.X64.Stack_i
module VSS = Vale.X64.Stack_Sems
module F = FStar.FunctionalExtensionality
fr... | false | false | Vale.X64.StateLemmas.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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... | null | val lemma_load_buffer_read64 (h:vale_heap) (b:buffer64) (i:int) : Lemma
(requires valid_buffer_read h b i)
(ensures buffer_read b i h == load_mem64 (buffer_addr b h + 8 * i) h)
[SMTPat (buffer_read b i h)] | [] | Vale.X64.StateLemmas.lemma_load_buffer_read64 | {
"file_name": "vale/code/arch/x64/Vale.X64.StateLemmas.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | h: Vale.Arch.HeapImpl.vale_heap -> b: Vale.X64.Memory.buffer64 -> i: Prims.int
-> FStar.Pervasives.Lemma (requires Vale.X64.Memory.valid_buffer_read h b i)
(ensures
Vale.X64.Memory.buffer_read b i h ==
Vale.X64.Memory.load_mem64 (Vale.X64.Memory.buffer_addr b h + 8 * i) h)
[SMTPat (Vale.X6... | {
"end_col": 24,
"end_line": 46,
"start_col": 2,
"start_line": 46
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "FStar.Math.Euclid",
"short_module": "Euclid"
},
{
"abbrev": false,... | false | let bn_mont_nat (#t:limb_t) (k:bn_mont_ctx t) =
x:lbignum t k.len{bn_v x < bn_v k.n} | let bn_mont_nat (#t: limb_t) (k: bn_mont_ctx t) = | false | null | false | x: lbignum t k.len {bn_v x < bn_v k.n} | {
"checked_file": "Hacl.Spec.Bignum.MontArithmetic.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.... | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.MontArithmetic.__proj__Mkbn_mont_ctx__item__len",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Hacl.Spec.Bignum.MontArithmetic.__pr... | [] | module Hacl.Spec.Bignum.MontArithmetic
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module Euclid = FStar.Math.Euclid
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_mont_ctx_pre (#t:limb_t) (#len:BN... | false | false | Hacl.Spec.Bignum.MontArithmetic.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bn_mont_nat : k: Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t -> Type0 | [] | Hacl.Spec.Bignum.MontArithmetic.bn_mont_nat | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontArithmetic.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t -> Type0 | {
"end_col": 38,
"end_line": 37,
"start_col": 2,
"start_line": 37
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "FStar.Math.Euclid",
"short_module": "Euclid"
},
{
"abbrev": false,... | false | let bn_mont_ctx_pre (#t:limb_t) (#len:BN.bn_len t) (n:lbignum t len) =
1 < bn_v n /\ bn_v n % 2 = 1 | let bn_mont_ctx_pre (#t: limb_t) (#len: BN.bn_len t) (n: lbignum t len) = | false | null | false | 1 < bn_v n /\ bn_v n % 2 = 1 | {
"checked_file": "Hacl.Spec.Bignum.MontArithmetic.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.... | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.logical"
] | [] | module Hacl.Spec.Bignum.MontArithmetic
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module Euclid = FStar.Math.Euclid
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0" | false | false | Hacl.Spec.Bignum.MontArithmetic.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bn_mont_ctx_pre : n: Hacl.Spec.Bignum.Definitions.lbignum t len -> Prims.logical | [] | Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx_pre | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontArithmetic.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | n: Hacl.Spec.Bignum.Definitions.lbignum t len -> Prims.logical | {
"end_col": 30,
"end_line": 17,
"start_col": 2,
"start_line": 17
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "FStar.Math.Euclid",
"short_module": "Euclid"
},
{
"abbrev": false,... | false | let bn_mont_ctx_inv (#t:limb_t) (k:bn_mont_ctx t) =
bn_v k.n < pow2 (bits t * k.len) /\
bn_mont_ctx_pre k.n /\
(1 + bn_v k.n * v k.mu) % pow2 (bits t) == 0 /\
bn_v k.r2 == pow2 (2 * bits t * k.len) % bn_v k.n | let bn_mont_ctx_inv (#t: limb_t) (k: bn_mont_ctx t) = | false | null | false | bn_v k.n < pow2 (bits t * k.len) /\ bn_mont_ctx_pre k.n /\
(1 + bn_v k.n * v k.mu) % pow2 (bits t) == 0 /\ bn_v k.r2 == pow2 ((2 * bits t) * k.len) % bn_v k.n | {
"checked_file": "Hacl.Spec.Bignum.MontArithmetic.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.... | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Hacl.Spec.Bignum.MontArithmetic.__proj__Mkbn_mont_ctx__item__len",
"Hacl.Spec.Bignum.MontArithmetic.__proj__Mkbn_mont_ctx__item__... | [] | module Hacl.Spec.Bignum.MontArithmetic
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module Euclid = FStar.Math.Euclid
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_mont_ctx_pre (#t:limb_t) (#len:BN... | false | false | Hacl.Spec.Bignum.MontArithmetic.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bn_mont_ctx_inv : k: Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t -> Prims.logical | [] | Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx_inv | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontArithmetic.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | k: Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t -> Prims.logical | {
"end_col": 51,
"end_line": 33,
"start_col": 2,
"start_line": 30
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "FStar.Math.Euclid",
"short_module": "Euclid"
},
{
"abbrev": false,... | false | let bn_field_exp_st (t:limb_t) (k:bn_mont_ctx t{bn_mont_ctx_inv k}) =
aM:bn_mont_nat k
-> bBits:size_nat
-> b:lbignum t (blocks0 bBits (bits t)) ->
Pure (bn_mont_nat k)
(requires bn_v b < pow2 bBits)
(ensures fun cM ->
bn_v (bn_from_field k cM) == Lib.NatMod.pow_mod #(bn_v k.n) (bn_v (bn_from_field k... | let bn_field_exp_st (t: limb_t) (k: bn_mont_ctx t {bn_mont_ctx_inv k}) = | false | null | false | aM: bn_mont_nat k -> bBits: size_nat -> b: lbignum t (blocks0 bBits (bits t))
-> Pure (bn_mont_nat k)
(requires bn_v b < pow2 bBits)
(ensures
fun cM ->
bn_v (bn_from_field k cM) ==
Lib.NatMod.pow_mod #(bn_v k.n) (bn_v (bn_from_field k aM)) (bn_v b)) | {
"checked_file": "Hacl.Spec.Bignum.MontArithmetic.fsti.checked",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.... | [
"total"
] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx",
"Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx_inv",
"Hacl.Spec.Bignum.MontArithmetic.bn_mont_nat",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.blocks0",
"Lib.IntTypes... | [] | module Hacl.Spec.Bignum.MontArithmetic
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module Euclid = FStar.Math.Euclid
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
let bn_mont_ctx_pre (#t:limb_t) (#len:BN... | false | false | Hacl.Spec.Bignum.MontArithmetic.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bn_field_exp_st : t: Hacl.Spec.Bignum.Definitions.limb_t ->
k:
Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t
{Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx_inv k}
-> Type0 | [] | Hacl.Spec.Bignum.MontArithmetic.bn_field_exp_st | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontArithmetic.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
t: Hacl.Spec.Bignum.Definitions.limb_t ->
k:
Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx t
{Hacl.Spec.Bignum.MontArithmetic.bn_mont_ctx_inv k}
-> Type0 | {
"end_col": 101,
"end_line": 115,
"start_col": 4,
"start_line": 109
} | |
Prims.Tot | val table_inv_w5:BE.table_inv_t U64 15ul 32ul | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let table_inv_w5 : BE.table_inv_t U64 15ul 32ul =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 5ul in
[@inline_let] let table_len = 32ul in
assert_norm (pow2 (v l) == v table_len);
BE.table_inv_precomp len ctx_len k ... | val table_inv_w5:BE.table_inv_t U64 15ul 32ul
let table_inv_w5:BE.table_inv_t U64 15ul 32ul = | false | null | false | [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 5ul in
[@@ inline_let ]let table_len = 32ul in
assert_norm (pow2 (v l) == v table_len);
BE.table_inv_precomp len ctx_len k l table_len | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [
"total"
] | [
"Hacl.Impl.Exponentiation.table_inv_precomp",
"Lib.IntTypes.U64",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Prims.b2t",
"Prims.op_GreaterThan",
"Lib.IntTypes.range",
"Lib.IntTypes.U32",
"Prims.pow2",
"Lib.IntTypes.v",
"Lib.IntTypes.PUB",
"FSta... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val table_inv_w5:BE.table_inv_t U64 15ul 32ul | [] | Hacl.Impl.K256.PointMul.table_inv_w5 | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Exponentiation.table_inv_t Lib.IntTypes.U64
(FStar.UInt32.uint_to_t 15 <: FStar.UInt32.t)
(FStar.UInt32.uint_to_t 32 <: FStar.UInt32.t) | {
"end_col": 48,
"end_line": 48,
"start_col": 2,
"start_line": 42
} |
Prims.Tot | val table_inv_w4:BE.table_inv_t U64 15ul 16ul | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let table_inv_w4 : BE.table_inv_t U64 15ul 16ul =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 4ul in
[@inline_let] let table_len = 16ul in
BE.table_inv_precomp len ctx_len k l table_len | val table_inv_w4:BE.table_inv_t U64 15ul 16ul
let table_inv_w4:BE.table_inv_t U64 15ul 16ul = | false | null | false | [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 4ul in
[@@ inline_let ]let table_len = 16ul in
BE.table_inv_precomp len ctx_len k l table_len | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [
"total"
] | [
"Hacl.Impl.Exponentiation.table_inv_precomp",
"Lib.IntTypes.U64",
"FStar.UInt32.t",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Exponentiation.Definitions.concrete_ops",
"FStar.UInt32.uint_to_t",
"Hacl.Impl.K256.Group.mk_k256_concrete_ops"
] | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val table_inv_w4:BE.table_inv_t U64 15ul 16ul | [] | Hacl.Impl.K256.PointMul.table_inv_w4 | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Exponentiation.table_inv_t Lib.IntTypes.U64
(FStar.UInt32.uint_to_t 15 <: FStar.UInt32.t)
(FStar.UInt32.uint_to_t 16 <: FStar.UInt32.t) | {
"end_col": 48,
"end_line": 37,
"start_col": 2,
"start_line": 32
} |
FStar.Pervasives.Lemma | val lemma_exp_four_fw_local: b:BD.lbignum U64 4{BD.bn_v b < S.q} ->
Lemma (let (b0, b1, b2, b3) = SPT256.decompose_nat256_as_four_u64 (BD.bn_v b) in
LE.exp_four_fw S.mk_k256_comm_monoid g_aff 64 b0 g_pow2_64 b1 g_pow2_128 b2 g_pow2_192 b3 4 ==
S.to_aff_point (S.point_mul_g (BD.bn_v b))) | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let lemma_exp_four_fw_local b =
let cm = S.mk_k256_comm_monoid in
let (b0, b1, b2, b3) = SPT256.decompose_nat256_as_four_u64 (BD.bn_v b) in
let res = LE.exp_four_fw cm g_aff 64 b0 g_pow2_64 b1 g_pow2_128 b2 g_pow2_192 b3 4 in
assert (res == SPT256.exp_as_exp_four_nat256_precomp cm g_aff (BD.bn_v b));
SPT256.le... | val lemma_exp_four_fw_local: b:BD.lbignum U64 4{BD.bn_v b < S.q} ->
Lemma (let (b0, b1, b2, b3) = SPT256.decompose_nat256_as_four_u64 (BD.bn_v b) in
LE.exp_four_fw S.mk_k256_comm_monoid g_aff 64 b0 g_pow2_64 b1 g_pow2_128 b2 g_pow2_192 b3 4 ==
S.to_aff_point (S.point_mul_g (BD.bn_v b)))
let lemma_exp_four_fw_... | false | null | true | let cm = S.mk_k256_comm_monoid in
let b0, b1, b2, b3 = SPT256.decompose_nat256_as_four_u64 (BD.bn_v b) in
let res = LE.exp_four_fw cm g_aff 64 b0 g_pow2_64 b1 g_pow2_128 b2 g_pow2_192 b3 4 in
assert (res == SPT256.exp_as_exp_four_nat256_precomp cm g_aff (BD.bn_v b));
SPT256.lemma_point_mul_base_precomp4 cm g_aff (BD.bn... | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [
"lemma"
] | [
"Hacl.Spec.Bignum.Definitions.lbignum",
"Lib.IntTypes.U64",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Spec.K256.PointOps.q",
"Prims.int",
"Prims._assert",
"Prims.eq2",
"Spec.K256.PointOps.aff_point",
"Spec.K256.PointOps.to_aff_point",
"Spec.K256.point_mul_g",
"L... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lemma_exp_four_fw_local: b:BD.lbignum U64 4{BD.bn_v b < S.q} ->
Lemma (let (b0, b1, b2, b3) = SPT256.decompose_nat256_as_four_u64 (BD.bn_v b) in
LE.exp_four_fw S.mk_k256_comm_monoid g_aff 64 b0 g_pow2_64 b1 g_pow2_128 b2 g_pow2_192 b3 4 ==
S.to_aff_point (S.point_mul_g (BD.bn_v b))) | [] | Hacl.Impl.K256.PointMul.lemma_exp_four_fw_local | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b:
Hacl.Spec.Bignum.Definitions.lbignum Lib.IntTypes.U64 4
{Hacl.Spec.Bignum.Definitions.bn_v b < Spec.K256.PointOps.q}
-> FStar.Pervasives.Lemma
(ensures
(let _ =
Hacl.Spec.PrecompBaseTable256.decompose_nat256_as_four_u64 (Hacl.Spec.Bignum.Definitions.bn_v
b)
... | {
"end_col": 84,
"end_line": 159,
"start_col": 31,
"start_line": 150
} |
FStar.HyperStack.ST.Stack | val point_mul: out:point -> scalar:qelem -> q:point -> Stack unit
(requires fun h ->
live h out /\ live h scalar /\ live h q /\
disjoint out q /\ disjoint out scalar /\ disjoint q scalar /\
point_inv h q /\ qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
... | false | let point_mul out scalar q =
let h0 = ST.get () in
SE.exp_fw_lemma S.mk_k256_concrete_ops (point_eval h0 q) 256 (qas_nat h0 scalar) 4;
BE.lexp_fw_consttime 15ul 0ul mk_k256_concrete_ops 4ul (null uint64) q 4ul 256ul scalar out | val point_mul: out:point -> scalar:qelem -> q:point -> Stack unit
(requires fun h ->
live h out /\ live h scalar /\ live h q /\
disjoint out q /\ disjoint out scalar /\ disjoint q scalar /\
point_inv h q /\ qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out... | true | null | false | let h0 = ST.get () in
SE.exp_fw_lemma S.mk_k256_concrete_ops (point_eval h0 q) 256 (qas_nat h0 scalar) 4;
BE.lexp_fw_consttime 15ul 0ul mk_k256_concrete_ops 4ul (null uint64) q 4ul 256ul scalar out | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"Hacl.Impl.Exponentiation.lexp_fw_consttime",
"Lib.IntTypes.U64",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.K256.Group.mk_k256_concrete_ops",
"Lib.Buffer.null",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"Prims.unit",
"Spec.Exponentiation.exp_fw... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val point_mul: out:point -> scalar:qelem -> q:point -> Stack unit
(requires fun h ->
live h out /\ live h scalar /\ live h q /\
disjoint out q /\ disjoint out scalar /\ disjoint q scalar /\
point_inv h q /\ qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out... | [] | Hacl.Impl.K256.PointMul.point_mul | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | out: Hacl.Impl.K256.Point.point -> scalar: Hacl.K256.Scalar.qelem -> q: Hacl.Impl.K256.Point.point
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 93,
"end_line": 54,
"start_col": 28,
"start_line": 51
} |
Prims.Tot | val precomp_get_consttime: BE.pow_a_to_small_b_st U64 15ul 0ul mk_k256_concrete_ops 4ul 16ul
(BE.table_inv_precomp 15ul 0ul mk_k256_concrete_ops 4ul 16ul) | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let precomp_get_consttime ctx a table bits_l tmp =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 4ul in
[@inline_let] let table_len = 16ul in
BE.lprecomp_get_consttime len ctx_len k l table_len ctx a table bits_l tmp | val precomp_get_consttime: BE.pow_a_to_small_b_st U64 15ul 0ul mk_k256_concrete_ops 4ul 16ul
(BE.table_inv_precomp 15ul 0ul mk_k256_concrete_ops 4ul 16ul)
let precomp_get_consttime ctx a table bits_l tmp = | false | null | false | [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 4ul in
[@@ inline_let ]let table_len = 16ul in
BE.lprecomp_get_consttime len ctx_len k l table_len ctx a table bits_l tmp | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [
"total"
] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.UInt32.__uint_to_t",
"FStar.Ghost.erased",
"Lib.Sequence.lseq",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.Buffer.clbuffer",
"Lib.IntTypes.op_Star_Bang",
"Prims.b2t",
"Prims.op_L... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val precomp_get_consttime: BE.pow_a_to_small_b_st U64 15ul 0ul mk_k256_concrete_ops 4ul 16ul
(BE.table_inv_precomp 15ul 0ul mk_k256_concrete_ops 4ul 16ul) | [] | Hacl.Impl.K256.PointMul.precomp_get_consttime | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Hacl.Impl.Exponentiation.pow_a_to_small_b_st Lib.IntTypes.U64
15ul
0ul
Hacl.Impl.K256.Group.mk_k256_concrete_ops
4ul
16ul
(Hacl.Impl.Exponentiation.table_inv_precomp 15ul
0ul
Hacl.Impl.K256.Group.mk_k256_concrete_ops
4ul
16ul) | {
"end_col": 76,
"end_line": 67,
"start_col": 2,
"start_line": 61
} |
FStar.HyperStack.ST.Stack | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:qelem -> q1:point
-> scalar2:qelem -> q2:point
-> table2:lbuffer uint64 (32ul *! 15ul) ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
eq_or_disjoint q1 q... | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let point_mul_g_double_vartime_noalloc out scalar1 q1 scalar2 q2 table2 =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 5ul in
[@inline_let] let table_len = 32ul in
[@inline_let] let bLen = 4ul in
[@inline_let] let bB... | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:qelem -> q1:point
-> scalar2:qelem -> q2:point
-> table2:lbuffer uint64 (32ul *! 15ul) ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
eq_or_disjoint q1 q... | true | null | false | [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 5ul in
[@@ inline_let ]let table_len = 32ul in
[@@ inline_let ]let bLen = 4ul in
[@@ inline_let ]let bBits = 256ul in
assert_norm (pow2 (v l) == v table_len);
let h0 = ST.get ()... | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint64",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"FStar.UInt32.__uint_to_t",
"Spec.Exponentiation.exp_double_fw_lemma",
"Spec.K256.PointOps.proj_point",
"Spec.K256.mk_k256_con... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:qelem -> q1:point
-> scalar2:qelem -> q2:point
-> table2:lbuffer uint64 (32ul *! 15ul) ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
eq_or_disjoint q1 q... | [] | Hacl.Impl.K256.PointMul.point_mul_g_double_vartime_noalloc | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
out: Hacl.Impl.K256.Point.point ->
scalar1: Hacl.K256.Scalar.qelem ->
q1: Hacl.Impl.K256.Point.point ->
scalar2: Hacl.K256.Scalar.qelem ->
q2: Hacl.Impl.K256.Point.point ->
table2: Lib.Buffer.lbuffer Lib.IntTypes.uint64 (32ul *! 15ul)
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 45,
"end_line": 230,
"start_col": 2,
"start_line": 205
} |
FStar.HyperStack.ST.Stack | val point_mul_g_noalloc: out:point -> scalar:qelem
-> q1:point -> q2:point
-> q3:point -> q4:point ->
Stack unit
(requires fun h ->
live h scalar /\ live h out /\ live h q1 /\
live h q2 /\ live h q3 /\ live h q4 /\
disjoint out scalar /\ disjoint out q1 /\ disjoint out q2 /\
disjoint out q3 /\ d... | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | false | let point_mul_g_noalloc out scalar q1 q2 q3 q4 =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 4ul in
[@inline_let] let table_len = 16ul in
[@inline_let] let bLen = 1ul in
[@inline_let] let bBits = 64ul in
let h0 =... | val point_mul_g_noalloc: out:point -> scalar:qelem
-> q1:point -> q2:point
-> q3:point -> q4:point ->
Stack unit
(requires fun h ->
live h scalar /\ live h out /\ live h q1 /\
live h q2 /\ live h q3 /\ live h q4 /\
disjoint out scalar /\ disjoint out q1 /\ disjoint out q2 /\
disjoint out q3 /\ d... | true | null | false | [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 4ul in
[@@ inline_let ]let table_len = 16ul in
[@@ inline_let ]let bLen = 1ul in
[@@ inline_let ]let bBits = 64ul in
let h0 = ST.get () in
recall_contents precomp_basepoint_tabl... | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"Hacl.Impl.MultiExponentiation.mk_lexp_four_fw_tables",
"Lib.IntTypes.U64",
"Hacl.Impl.K256.PointMul.table_inv_w4",
"Hacl.Impl.K256.PointMul.precomp_get_consttime",
"Lib.Buffer.null",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"Lib.Buffer.to_co... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val point_mul_g_noalloc: out:point -> scalar:qelem
-> q1:point -> q2:point
-> q3:point -> q4:point ->
Stack unit
(requires fun h ->
live h scalar /\ live h out /\ live h q1 /\
live h q2 /\ live h q3 /\ live h q4 /\
disjoint out scalar /\ disjoint out q1 /\ disjoint out q2 /\
disjoint out q3 /\ d... | [] | Hacl.Impl.K256.PointMul.point_mul_g_noalloc | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
out: Hacl.Impl.K256.Point.point ->
scalar: Hacl.K256.Scalar.qelem ->
q1: Hacl.Impl.K256.Point.point ->
q2: Hacl.Impl.K256.Point.point ->
q3: Hacl.Impl.K256.Point.point ->
q4: Hacl.Impl.K256.Point.point
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 7,
"end_line": 142,
"start_col": 2,
"start_line": 96
} |
FStar.HyperStack.ST.Stack | val point_mul_g: out:point -> scalar:qelem -> Stack unit
(requires fun h ->
live h scalar /\ live h out /\ disjoint out scalar /\
qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out /\
S.to_aff_point (point_eval h1 out) ==
S.to_aff_point (S.point_mul_g (... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
... | false | let point_mul_g out scalar =
push_frame ();
let h0 = ST.get () in
let q1 = create 15ul (u64 0) in
make_g q1;
let q2 = mk_proj_g_pow2_64 () in
let q3 = mk_proj_g_pow2_128 () in
let q4 = mk_proj_g_pow2_192 () in
proj_g_pow2_64_lseq_lemma ();
proj_g_pow2_128_lseq_lemma ();
proj_g_pow2_192_lseq_lemma ()... | val point_mul_g: out:point -> scalar:qelem -> Stack unit
(requires fun h ->
live h scalar /\ live h out /\ disjoint out scalar /\
qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out /\
S.to_aff_point (point_eval h1 out) ==
S.to_aff_point (S.point_mul_g (... | true | null | false | push_frame ();
let h0 = ST.get () in
let q1 = create 15ul (u64 0) in
make_g q1;
let q2 = mk_proj_g_pow2_64 () in
let q3 = mk_proj_g_pow2_128 () in
let q4 = mk_proj_g_pow2_192 () in
proj_g_pow2_64_lseq_lemma ();
proj_g_pow2_128_lseq_lemma ();
proj_g_pow2_192_lseq_lemma ();
point_mul_g_noalloc out scalar q1 q2 q3 q4;
lem... | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.K256.PointMul.lemma_exp_four_fw_local",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"Hacl.K256.Scalar.qnlimb",
"Hacl.Impl.K256.PointMul.point_mul_g_noalloc",
"Hacl.... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val point_mul_g: out:point -> scalar:qelem -> Stack unit
(requires fun h ->
live h scalar /\ live h out /\ disjoint out scalar /\
qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out /\
S.to_aff_point (point_eval h1 out) ==
S.to_aff_point (S.point_mul_g (... | [] | Hacl.Impl.K256.PointMul.point_mul_g | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | out: Hacl.Impl.K256.Point.point -> scalar: Hacl.K256.Scalar.qelem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 14,
"end_line": 176,
"start_col": 2,
"start_line": 164
} |
FStar.HyperStack.ST.Stack | val point_mul_g_double_vartime: out:point -> scalar1:qelem -> scalar2:qelem -> q2:point ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h scalar2 /\ live h q2 /\
disjoint q2 out /\ disjoint out scalar1 /\ disjoint out scalar2 /\
point_inv h q2 /\ qas_nat h scalar1 < S.q /\ qas_nat ... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "BD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.PrecompBaseTable256",
"short_module": "SPT256"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.PrecompTable",
"short_module": "PT"
},
{
... | false | let point_mul_g_double_vartime out scalar1 scalar2 q2 =
push_frame ();
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let table_len = 32ul in
assert_norm (pow2 5 == v table_len);
let q1 = create 15ul (u64 0) in
make_g q1;
... | val point_mul_g_double_vartime: out:point -> scalar1:qelem -> scalar2:qelem -> q2:point ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h scalar2 /\ live h q2 /\
disjoint q2 out /\ disjoint out scalar1 /\ disjoint out scalar2 /\
point_inv h q2 /\ qas_nat h scalar1 < S.q /\ qas_nat ... | true | null | false | push_frame ();
[@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let table_len = 32ul in
assert_norm (pow2 5 == v table_len);
let q1 = create 15ul (u64 0) in
make_g q1;
let table2 = create (table_len *! len) (u64 0) in
PT.lprecomp_tabl... | {
"checked_file": "Hacl.Impl.K256.PointMul.fst.checked",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.S... | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.K256.PointMul.point_mul_g_double_vartime_noalloc",
"Prims._assert",
"Hacl.Impl.K256.PointMul.table_inv_w5",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"FStar.UInt3... | [] | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | false | false | Hacl.Impl.K256.PointMul.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val point_mul_g_double_vartime: out:point -> scalar1:qelem -> scalar2:qelem -> q2:point ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h scalar2 /\ live h q2 /\
disjoint q2 out /\ disjoint out scalar1 /\ disjoint out scalar2 /\
point_inv h q2 /\ qas_nat h scalar1 < S.q /\ qas_nat ... | [] | Hacl.Impl.K256.PointMul.point_mul_g_double_vartime | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
out: Hacl.Impl.K256.Point.point ->
scalar1: Hacl.K256.Scalar.qelem ->
scalar2: Hacl.K256.Scalar.qelem ->
q2: Hacl.Impl.K256.Point.point
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 14,
"end_line": 250,
"start_col": 2,
"start_line": 235
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let defined r = ~(Unknown? r) | let defined r = | false | null | false | ~(Unknown? r) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.l_not",
"Prims.b2t",
"FStar.Reflection.V2.TermEq.uu___is_Unknown",
"Prims.logical"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val defined : r: FStar.Reflection.V2.TermEq._cmpres -> Prims.logical | [] | FStar.Reflection.V2.TermEq.defined | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | r: FStar.Reflection.V2.TermEq._cmpres -> Prims.logical | {
"end_col": 29,
"end_line": 381,
"start_col": 16,
"start_line": 381
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let def2 f l1 l2 =(forall x y. L.memP x l1 /\ L.memP y l2 ==> defined (f x y)) | let def2 f l1 l2 = | false | null | false | (forall x y. L.memP x l1 /\ L.memP y l2 ==> defined (f x y)) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.list",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"FStar.Reflection.V2.TermEq.defined",
"Prims.logical"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val def2 : f: (_: _ -> _: _ -> FStar.Reflection.V2.TermEq._cmpres) -> l1: Prims.list _ -> l2: Prims.list _
-> Prims.logical | [] | FStar.Reflection.V2.TermEq.def2 | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: (_: _ -> _: _ -> FStar.Reflection.V2.TermEq._cmpres) -> l1: Prims.list _ -> l2: Prims.list _
-> Prims.logical | {
"end_col": 78,
"end_line": 383,
"start_col": 18,
"start_line": 383
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let faithful_universe = t:universe{faithful_univ t} | let faithful_universe = | false | null | false | t: universe{faithful_univ t} | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.universe",
"FStar.Reflection.V2.TermEq.faithful_univ"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_universe : Type0 | [] | FStar.Reflection.V2.TermEq.faithful_universe | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Type0 | {
"end_col": 51,
"end_line": 828,
"start_col": 24,
"start_line": 828
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let faithful_term = t:term{faithful t} | let faithful_term = | false | null | false | t: term{faithful t} | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.TermEq.faithful"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_term : Type0 | [] | FStar.Reflection.V2.TermEq.faithful_term | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Type0 | {
"end_col": 38,
"end_line": 815,
"start_col": 20,
"start_line": 815
} | |
FStar.Pervasives.Lemma | val memP_dec (#a: _) (x: a) (l: list a)
: Lemma (requires L.memP x l) (ensures x << l) [SMTPat (L.memP x l)] | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec memP_dec #a (x : a) (l : list a)
: Lemma (requires L.memP x l)
(ensures x << l)
[SMTPat (L.memP x l)]
= match l with
| [] -> ()
| y::ys ->
if StrongExcludedMiddle.strong_excluded_middle (x == y) then () else memP_dec x ys | val memP_dec (#a: _) (x: a) (l: list a)
: Lemma (requires L.memP x l) (ensures x << l) [SMTPat (L.memP x l)]
let rec memP_dec #a (x: a) (l: list a)
: Lemma (requires L.memP x l) (ensures x << l) [SMTPat (L.memP x l)] = | false | null | true | match l with
| [] -> ()
| y :: ys -> if StrongExcludedMiddle.strong_excluded_middle (x == y) then () else memP_dec x ys | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"Prims.list",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"FStar.Reflection.V2.TermEq.memP_dec",
"Prims.unit",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Prims.precedes",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val memP_dec (#a: _) (x: a) (l: list a)
: Lemma (requires L.memP x l) (ensures x << l) [SMTPat (L.memP x l)] | [
"recursion"
] | FStar.Reflection.V2.TermEq.memP_dec | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.memP x l)
(ensures x << l)
[SMTPat (FStar.List.Tot.Base.memP x l)] | {
"end_col": 88,
"end_line": 65,
"start_col": 4,
"start_line": 62
} |
Prims.Tot | val opt_cmp : #a:Type -> comparator_for a -> comparator_for (option a) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let opt_cmp cmp o1 o2 =
match o1, o2 with
| None, None -> Eq
| Some x, Some y -> cmp x y
| _ -> Neq | val opt_cmp : #a:Type -> comparator_for a -> comparator_for (option a)
let opt_cmp cmp o1 o2 = | false | null | false | match o1, o2 with
| None, None -> Eq
| Some x, Some y -> cmp x y
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val opt_cmp : #a:Type -> comparator_for a -> comparator_for (option a) | [] | FStar.Reflection.V2.TermEq.opt_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | cmp: FStar.Reflection.V2.TermEq.comparator_for a
-> FStar.Reflection.V2.TermEq.comparator_for (FStar.Pervasives.Native.option a) | {
"end_col": 12,
"end_line": 129,
"start_col": 2,
"start_line": 126
} |
Prims.Tot | val allP0 (#a: _) (pred: (a -> Type0)) (l: list a) : Type0 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec allP0 #a (pred : a -> Type0) (l : list a) : Type0 =
match l with
| [] -> True
| x::xs -> pred x /\ allP0 pred xs | val allP0 (#a: _) (pred: (a -> Type0)) (l: list a) : Type0
let rec allP0 #a (pred: (a -> Type0)) (l: list a) : Type0 = | false | null | false | match l with
| [] -> True
| x :: xs -> pred x /\ allP0 pred xs | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.list",
"Prims.l_True",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.allP0"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val allP0 (#a: _) (pred: (a -> Type0)) (l: list a) : Type0 | [
"recursion"
] | FStar.Reflection.V2.TermEq.allP0 | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | pred: (_: a -> Type0) -> l: Prims.list a -> Type0 | {
"end_col": 36,
"end_line": 23,
"start_col": 2,
"start_line": 21
} |
Prims.Tot | val ctxu_cmp : comparator_for ctx_uvar_and_subst | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let ctxu_cmp _ _ = Unknown | val ctxu_cmp : comparator_for ctx_uvar_and_subst
let ctxu_cmp _ _ = | false | null | false | Unknown | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.ctx_uvar_and_subst",
"FStar.Reflection.V2.TermEq.Unknown",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val ctxu_cmp : comparator_for ctx_uvar_and_subst | [] | FStar.Reflection.V2.TermEq.ctxu_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.ctx_uvar_and_subst | {
"end_col": 26,
"end_line": 230,
"start_col": 19,
"start_line": 230
} |
Prims.Tot | val fv_cmp : comparator_for fv | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let fv_cmp f1 f2 =
pack_inspect_fv f1;
pack_inspect_fv f2;
let n1 = inspect_fv f1 in
let n2 = inspect_fv f2 in
if n1 = n2 then Eq else Neq | val fv_cmp : comparator_for fv
let fv_cmp f1 f2 = | false | null | false | pack_inspect_fv f1;
pack_inspect_fv f2;
let n1 = inspect_fv f1 in
let n2 = inspect_fv f2 in
if n1 = n2 then Eq else Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.fv",
"Prims.op_Equality",
"FStar.Reflection.Types.name",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.bool",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres",
"FStar.Reflection.V2.Builtins.inspect_fv",
"Prims.unit",
"FStar.Reflection.V2.Builtins.pack_inspect... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val fv_cmp : comparator_for fv | [] | FStar.Reflection.V2.TermEq.fv_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.fv | {
"end_col": 31,
"end_line": 122,
"start_col": 4,
"start_line": 118
} |
Prims.Tot | val pair_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (a & b) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let pair_cmp cmpa cmpb (a1, b1) (a2, b2) =
cmpa a1 a2 &&& cmpb b1 b2 | val pair_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (a & b)
let pair_cmp cmpa cmpb (a1, b1) (a2, b2) = | false | null | false | cmpa a1 a2 &&& cmpb b1 b2 | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val pair_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (a & b) | [] | FStar.Reflection.V2.TermEq.pair_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
cmpa: FStar.Reflection.V2.TermEq.comparator_for a ->
cmpb: FStar.Reflection.V2.TermEq.comparator_for b
-> FStar.Reflection.V2.TermEq.comparator_for (a * b) | {
"end_col": 27,
"end_line": 140,
"start_col": 2,
"start_line": 140
} |
FStar.Pervasives.Lemma | val memP_allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type)) (x: a) (l: list a {l << top})
: Lemma (requires allP top pred l /\ L.memP x l)
(ensures x << top /\ pred x)
[SMTPat (allP top pred l); SMTPat (L.memP x l)] | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec memP_allP #a #b (top:b) (pred : (x:a{x << top}) -> Type) (x : a) (l : list a{l << top})
: Lemma (requires allP top pred l /\ L.memP x l)
(ensures x << top /\ pred x)
[SMTPat (allP top pred l); SMTPat (L.memP x l)]
= match l with
| [] -> ()
| y::ys ->
if StrongExcludedMiddle... | val memP_allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type)) (x: a) (l: list a {l << top})
: Lemma (requires allP top pred l /\ L.memP x l)
(ensures x << top /\ pred x)
[SMTPat (allP top pred l); SMTPat (L.memP x l)]
let rec memP_allP #a #b (top: b) (pred: (x: a{x << top} -> Type)) (x: a) (l: list... | false | null | true | match l with
| [] -> ()
| y :: ys ->
if StrongExcludedMiddle.strong_excluded_middle (x == y) then () else memP_allP top pred x ys | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"Prims.precedes",
"Prims.list",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"FStar.Reflection.V2.TermEq.memP_allP",
"Prims.unit",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.allP",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val memP_allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type)) (x: a) (l: list a {l << top})
: Lemma (requires allP top pred l /\ L.memP x l)
(ensures x << top /\ pred x)
[SMTPat (allP top pred l); SMTPat (L.memP x l)] | [
"recursion"
] | FStar.Reflection.V2.TermEq.memP_allP | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | top: b -> pred: (x: a{x << top} -> Type0) -> x: a -> l: Prims.list a {l << top}
-> FStar.Pervasives.Lemma
(requires FStar.Reflection.V2.TermEq.allP top pred l /\ FStar.List.Tot.Base.memP x l)
(ensures x << top /\ pred x)
[SMTPat (FStar.Reflection.V2.TermEq.allP top pred l); SMTPat (FStar.List.Tot.Ba... | {
"end_col": 98,
"end_line": 47,
"start_col": 4,
"start_line": 44
} |
Prims.Tot | val bv_cmp : comparator_for bv | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let bv_cmp x1 x2 =
let v1 = inspect_bv x1 in
let v2 = inspect_bv x2 in
pack_inspect_bv x1;
pack_inspect_bv x2;
sealed_singl v1.sort v2.sort;
if v1.index = v2.index then Eq else Neq | val bv_cmp : comparator_for bv
let bv_cmp x1 x2 = | false | null | false | let v1 = inspect_bv x1 in
let v2 = inspect_bv x2 in
pack_inspect_bv x1;
pack_inspect_bv x2;
sealed_singl v1.sort v2.sort;
if v1.index = v2.index then Eq else Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.bv",
"Prims.op_Equality",
"Prims.nat",
"FStar.Reflection.V2.Data.__proj__Mkbv_view__item__index",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.bool",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres",
"Prims.unit",
"FStar.Sealed.sealed_singl",
"FStar.Reflec... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val bv_cmp : comparator_for bv | [] | FStar.Reflection.V2.TermEq.bv_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.bv | {
"end_col": 41,
"end_line": 105,
"start_col": 18,
"start_line": 99
} |
Prims.Tot | val allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (l: list a {l << top \/ l === top})
: Type0 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec allP #a #b (top:b) (pred : (x:a{x << top}) -> Type0) (l : list a{l << top \/ l === top}) : Type0 =
match l with
| [] -> True
| x::xs -> pred x /\ allP top pred xs | val allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (l: list a {l << top \/ l === top})
: Type0
let rec allP #a #b (top: b) (pred: (x: a{x << top} -> Type0)) (l: list a {l << top \/ l === top})
: Type0 = | false | null | false | match l with
| [] -> True
| x :: xs -> pred x /\ allP top pred xs | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.precedes",
"Prims.list",
"Prims.l_or",
"Prims.op_Equals_Equals_Equals",
"Prims.l_True",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.allP"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val allP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (l: list a {l << top \/ l === top})
: Type0 | [
"recursion"
] | FStar.Reflection.V2.TermEq.allP | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | top: b -> pred: (x: a{x << top} -> Type0) -> l: Prims.list a {l << top \/ l === top} -> Type0 | {
"end_col": 39,
"end_line": 28,
"start_col": 2,
"start_line": 26
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let valid #t (c:_cmpres) (x y : t) =
match c with
| Eq -> x == y
| Neq -> x =!= y
| Unknown -> True | let valid #t (c: _cmpres) (x: t) (y: t) = | false | null | false | match c with
| Eq -> x == y
| Neq -> x =!= y
| Unknown -> True | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.eq2",
"Prims.l_not",
"Prims.l_True",
"Prims.logical"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val valid : c: FStar.Reflection.V2.TermEq._cmpres -> x: t -> y: t -> Prims.logical | [] | FStar.Reflection.V2.TermEq.valid | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | c: FStar.Reflection.V2.TermEq._cmpres -> x: t -> y: t -> Prims.logical | {
"end_col": 19,
"end_line": 82,
"start_col": 2,
"start_line": 79
} | |
Prims.Tot | val eq_cmp : #a:eqtype -> comparator_for a | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let eq_cmp x y = if x = y then Eq else Neq | val eq_cmp : #a:eqtype -> comparator_for a
let eq_cmp x y = | false | null | false | if x = y then Eq else Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.eqtype",
"Prims.op_Equality",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.bool",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val eq_cmp : #a:eqtype -> comparator_for a | [] | FStar.Reflection.V2.TermEq.eq_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for a | {
"end_col": 42,
"end_line": 183,
"start_col": 17,
"start_line": 183
} |
Prims.Tot | val univ_eq (u1 u2: universe) : (b: bool{b ==> u1 == u2}) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let univ_eq (u1 u2 : universe) : (b:bool{b ==> u1 == u2}) =
Eq? (univ_cmp u1 u2) | val univ_eq (u1 u2: universe) : (b: bool{b ==> u1 == u2})
let univ_eq (u1 u2: universe) : (b: bool{b ==> u1 == u2}) = | false | null | false | Eq? (univ_cmp u1 u2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.universe",
"FStar.Reflection.V2.TermEq.uu___is_Eq",
"FStar.Reflection.V2.TermEq.univ_cmp",
"Prims.bool",
"Prims.l_imp",
"Prims.b2t",
"Prims.eq2"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val univ_eq (u1 u2: universe) : (b: bool{b ==> u1 == u2}) | [] | FStar.Reflection.V2.TermEq.univ_eq | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | u1: FStar.Reflection.Types.universe -> u2: FStar.Reflection.Types.universe
-> b: Prims.bool{b ==> u1 == u2} | {
"end_col": 22,
"end_line": 830,
"start_col": 2,
"start_line": 830
} |
Prims.Tot | val ident_cmp : comparator_for ident | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let ident_cmp i1 i2 =
let iv1 = inspect_ident i1 in
let iv2 = inspect_ident i2 in
pack_inspect_ident i1;
pack_inspect_ident i2;
Sealed.sealed_singl (snd iv1) (snd iv2);
eq_cmp (fst iv1) (fst iv2) | val ident_cmp : comparator_for ident
let ident_cmp i1 i2 = | false | null | false | let iv1 = inspect_ident i1 in
let iv2 = inspect_ident i2 in
pack_inspect_ident i1;
pack_inspect_ident i2;
Sealed.sealed_singl (snd iv1) (snd iv2);
eq_cmp (fst iv1) (fst iv2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.ident",
"FStar.Reflection.V2.TermEq.eq_cmp",
"Prims.string",
"FStar.Pervasives.Native.fst",
"FStar.Range.range",
"Prims.unit",
"FStar.Sealed.sealed_singl",
"FStar.Range.__range",
"FStar.Pervasives.Native.snd",
"FStar.Reflection.V2.Builtins.pack_inspect_ident",
"FStar.Refl... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val ident_cmp : comparator_for ident | [] | FStar.Reflection.V2.TermEq.ident_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.ident | {
"end_col": 28,
"end_line": 197,
"start_col": 21,
"start_line": 191
} |
Prims.Tot | val list_cmp : #a:Type u#aa -> comparator_for a -> comparator_for (list a) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec list_cmp #a cmp l1 l2 =
match l1, l2 with
| [], [] -> Eq
| x::xs, y::ys -> cmp x y &&& list_cmp cmp xs ys
| _ -> Neq | val list_cmp : #a:Type u#aa -> comparator_for a -> comparator_for (list a)
let rec list_cmp #a cmp l1 l2 = | false | null | false | match l1, l2 with
| [], [] -> Eq
| x :: xs, y :: ys -> cmp x y &&& list_cmp cmp xs ys
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Reflection.V2.TermEq.list_cmp",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val list_cmp : #a:Type u#aa -> comparator_for a -> comparator_for (list a) | [
"recursion"
] | FStar.Reflection.V2.TermEq.list_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | cmp: FStar.Reflection.V2.TermEq.comparator_for a
-> FStar.Reflection.V2.TermEq.comparator_for (Prims.list a) | {
"end_col": 12,
"end_line": 147,
"start_col": 2,
"start_line": 144
} |
Prims.Tot | val univ_eq_dec (u1 u2: faithful_universe) : (b: bool{b <==> u1 == u2}) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let univ_eq_dec (u1 u2 : faithful_universe) : (b:bool{b <==> u1 == u2}) =
univ_faithful_lemma u1 u2;
Eq? (univ_cmp u1 u2) | val univ_eq_dec (u1 u2: faithful_universe) : (b: bool{b <==> u1 == u2})
let univ_eq_dec (u1 u2: faithful_universe) : (b: bool{b <==> u1 == u2}) = | false | null | false | univ_faithful_lemma u1 u2;
Eq? (univ_cmp u1 u2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.faithful_universe",
"FStar.Reflection.V2.TermEq.uu___is_Eq",
"FStar.Reflection.V2.TermEq.univ_cmp",
"Prims.unit",
"FStar.Reflection.V2.TermEq.univ_faithful_lemma",
"Prims.bool",
"Prims.l_iff",
"Prims.b2t",
"Prims.eq2"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val univ_eq_dec (u1 u2: faithful_universe) : (b: bool{b <==> u1 == u2}) | [] | FStar.Reflection.V2.TermEq.univ_eq_dec | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | u1: FStar.Reflection.V2.TermEq.faithful_universe -> u2: FStar.Reflection.V2.TermEq.faithful_universe
-> b: Prims.bool{b <==> u1 == u2} | {
"end_col": 22,
"end_line": 833,
"start_col": 2,
"start_line": 832
} |
Prims.Tot | val univ_cmp : comparator_for universe | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec univ_cmp (u1 u2 : universe) =
pack_inspect_universe u1;
pack_inspect_universe u2;
let uv1 = inspect_universe u1 in
let uv2 = inspect_universe u2 in
match uv1, uv2 with
| Uv_Zero, Uv_Zero -> Eq
| Uv_Succ u1, Uv_Succ u2 -> univ_cmp u1 u2
| Uv_Max us1, Uv_Max us2 -> list_dec_cmp u1 u2 univ_cmp us1 ... | val univ_cmp : comparator_for universe
let rec univ_cmp (u1 u2: universe) = | false | null | false | pack_inspect_universe u1;
pack_inspect_universe u2;
let uv1 = inspect_universe u1 in
let uv2 = inspect_universe u2 in
match uv1, uv2 with
| Uv_Zero, Uv_Zero -> Eq
| Uv_Succ u1, Uv_Succ u2 -> univ_cmp u1 u2
| Uv_Max us1, Uv_Max us2 -> list_dec_cmp u1 u2 univ_cmp us1 us2
| Uv_BVar v1, Uv_BVar v2 -> eq_cmp v1 v2
| Uv_Name... | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.universe",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.Data.universe_view",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Reflection.V2.TermEq.univ_cmp",
"FStar.Reflection.V2.Data.universes",
"FStar.Reflection.V2.TermEq.list_dec_cmp",
"Prims.nat",
"FStar.Reflection.V2.... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val univ_cmp : comparator_for universe | [
"recursion"
] | FStar.Reflection.V2.TermEq.univ_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.universe | {
"end_col": 12,
"end_line": 213,
"start_col": 2,
"start_line": 201
} |
Prims.Tot | val term_eq (t1 t2: term) : (b: bool{b ==> t1 == t2}) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let term_eq (t1 t2 : term) : (b:bool{b ==> t1 == t2}) =
Eq? (term_cmp t1 t2) | val term_eq (t1 t2: term) : (b: bool{b ==> t1 == t2})
let term_eq (t1 t2: term) : (b: bool{b ==> t1 == t2}) = | false | null | false | Eq? (term_cmp t1 t2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.term",
"FStar.Reflection.V2.TermEq.uu___is_Eq",
"FStar.Reflection.V2.TermEq.term_cmp",
"Prims.bool",
"Prims.l_imp",
"Prims.b2t",
"Prims.eq2"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val term_eq (t1 t2: term) : (b: bool{b ==> t1 == t2}) | [] | FStar.Reflection.V2.TermEq.term_eq | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | t1: FStar.Reflection.Types.term -> t2: FStar.Reflection.Types.term -> b: Prims.bool{b ==> t1 == t2} | {
"end_col": 22,
"end_line": 820,
"start_col": 2,
"start_line": 820
} |
Prims.Tot | val faithful_univ : universe -> Type0 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec faithful_univ (u : universe) =
match inspect_universe u with
| Uv_Unif _ -> False (* We just forbid this *)
| Uv_Unk
| Uv_Zero
| Uv_BVar _
| Uv_Name _ -> True
| Uv_Succ u -> faithful_univ u
| Uv_Max us -> allP u faithful_univ us | val faithful_univ : universe -> Type0
let rec faithful_univ (u: universe) = | false | null | false | match inspect_universe u with
| Uv_Unif _ -> False
| Uv_Unk | Uv_Zero | Uv_BVar _ | Uv_Name _ -> True
| Uv_Succ u -> faithful_univ u
| Uv_Max us -> allP u faithful_univ us | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.universe",
"FStar.Reflection.V2.Builtins.inspect_universe",
"FStar.Reflection.Types.universe_uvar",
"Prims.l_False",
"Prims.l_True",
"Prims.nat",
"FStar.Reflection.Types.univ_name",
"FStar.Reflection.V2.TermEq.faithful_univ",
"FStar.Reflection.V2.Data.universes",
"FStar.Ref... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_univ : universe -> Type0 | [
"recursion"
] | FStar.Reflection.V2.TermEq.faithful_univ | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | u102: FStar.Reflection.Types.universe -> Type0 | {
"end_col": 40,
"end_line": 412,
"start_col": 2,
"start_line": 403
} |
FStar.Pervasives.Lemma | val faithful_Tv_Match (t sc: term) (o: option match_returns_ascription) (brs: list branch)
: Lemma (requires inspect_ln t == Tv_Match sc o brs /\ faithful t)
(ensures allP t faithful_branch brs) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let faithful_Tv_Match (t : term) (sc : term) (o : option match_returns_ascription) (brs : list branch)
: Lemma (requires inspect_ln t == Tv_Match sc o brs /\ faithful t)
(ensures allP t faithful_branch brs)
= assert_norm (faithful t ==> allP t faithful_branch brs) | val faithful_Tv_Match (t sc: term) (o: option match_returns_ascription) (brs: list branch)
: Lemma (requires inspect_ln t == Tv_Match sc o brs /\ faithful t)
(ensures allP t faithful_branch brs)
let faithful_Tv_Match (t sc: term) (o: option match_returns_ascription) (brs: list branch)
: Lemma (requires in... | false | null | true | assert_norm (faithful t ==> allP t faithful_branch brs) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.Types.term",
"FStar.Pervasives.Native.option",
"FStar.Reflection.Types.match_returns_ascription",
"Prims.list",
"FStar.Reflection.V2.Data.branch",
"FStar.Pervasives.assert_norm",
"Prims.l_imp",
"FStar.Reflection.V2.TermEq.faithful",
"FStar.Reflection.V2.TermEq.allP",
"FStar.Refle... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_Tv_Match (t sc: term) (o: option match_returns_ascription) (brs: list branch)
: Lemma (requires inspect_ln t == Tv_Match sc o brs /\ faithful t)
(ensures allP t faithful_branch brs) | [] | FStar.Reflection.V2.TermEq.faithful_Tv_Match | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
t: FStar.Reflection.Types.term ->
sc: FStar.Reflection.Types.term ->
o: FStar.Pervasives.Native.option FStar.Reflection.Types.match_returns_ascription ->
brs: Prims.list FStar.Reflection.V2.Data.branch
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.Builtins.inspect_ln t == FSta... | {
"end_col": 59,
"end_line": 574,
"start_col": 4,
"start_line": 574
} |
FStar.Pervasives.Lemma | val faithful_univ_UvMax (u: universe) (us: list universe)
: Lemma (requires inspect_universe u == Uv_Max us /\ faithful_univ u)
(ensures allP u faithful_univ us) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let faithful_univ_UvMax (u : universe) (us : list universe)
: Lemma (requires inspect_universe u == Uv_Max us /\ faithful_univ u)
(ensures allP u faithful_univ us)
= assert_norm (faithful_univ u <==> allP u faithful_univ us) | val faithful_univ_UvMax (u: universe) (us: list universe)
: Lemma (requires inspect_universe u == Uv_Max us /\ faithful_univ u)
(ensures allP u faithful_univ us)
let faithful_univ_UvMax (u: universe) (us: list universe)
: Lemma (requires inspect_universe u == Uv_Max us /\ faithful_univ u)
(ensures a... | false | null | true | assert_norm (faithful_univ u <==> allP u faithful_univ us) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.Types.universe",
"Prims.list",
"FStar.Pervasives.assert_norm",
"Prims.l_iff",
"FStar.Reflection.V2.TermEq.faithful_univ",
"FStar.Reflection.V2.TermEq.allP",
"Prims.unit",
"Prims.l_and",
"Prims.eq2",
"FStar.Reflection.V2.Data.universe_view",
"FStar.Reflection.V2.Builtins.inspect... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_univ_UvMax (u: universe) (us: list universe)
: Lemma (requires inspect_universe u == Uv_Max us /\ faithful_univ u)
(ensures allP u faithful_univ us) | [] | FStar.Reflection.V2.TermEq.faithful_univ_UvMax | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | u104: FStar.Reflection.Types.universe -> us: Prims.list FStar.Reflection.Types.universe
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.Builtins.inspect_universe u104 == FStar.Reflection.V2.Data.Uv_Max us /\
FStar.Reflection.V2.TermEq.faithful_univ u104)
(ensures FStar.Reflection.V... | {
"end_col": 62,
"end_line": 417,
"start_col": 4,
"start_line": 417
} |
Prims.Tot | val optP0 (#a: _) (pred: (a -> Type0)) (o: option a) : Type0 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let optP0 #a (pred : a -> Type0) (o : option a) : Type0 =
match o with
| None -> True
| Some x -> pred x | val optP0 (#a: _) (pred: (a -> Type0)) (o: option a) : Type0
let optP0 #a (pred: (a -> Type0)) (o: option a) : Type0 = | false | null | false | match o with
| None -> True
| Some x -> pred x | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Pervasives.Native.option",
"Prims.l_True"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val optP0 (#a: _) (pred: (a -> Type0)) (o: option a) : Type0 | [] | FStar.Reflection.V2.TermEq.optP0 | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | pred: (_: a -> Type0) -> o: FStar.Pervasives.Native.option a -> Type0 | {
"end_col": 20,
"end_line": 33,
"start_col": 2,
"start_line": 31
} |
FStar.Pervasives.Lemma | val defined_list (#a: _) (f: comparator_for a) (l1 l2: list a)
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_cmp f l1 l2)) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec defined_list #a (f : comparator_for a) (l1 l2 : list a)
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_cmp f l1 l2))
= match l1, l2 with
| [], [] -> ()
| x::xs, y::ys -> defined_list f xs ys
| _ -> () | val defined_list (#a: _) (f: comparator_for a) (l1 l2: list a)
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_cmp f l1 l2))
let rec defined_list #a (f: comparator_for a) (l1: list a) (l2: list a)
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_cmp f l1 l2)) = | false | null | true | match l1, l2 with
| [], [] -> ()
| x :: xs, y :: ys -> defined_list f xs ys
| _ -> () | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.defined_list",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"FStar.Reflection.V2.TermEq.def2",
"Prims.squash",
"FStar.Reflection.V2.TermEq.defined",
"FStar.Reflection.V2.Te... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val defined_list (#a: _) (f: comparator_for a) (l1 l2: list a)
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_cmp f l1 l2)) | [
"recursion"
] | FStar.Reflection.V2.TermEq.defined_list | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: FStar.Reflection.V2.TermEq.comparator_for a -> l1: Prims.list a -> l2: Prims.list a
-> FStar.Pervasives.Lemma (requires FStar.Reflection.V2.TermEq.def2 f l1 l2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.list_cmp f l1 l2)) | {
"end_col": 13,
"end_line": 390,
"start_col": 4,
"start_line": 387
} |
Prims.Tot | val op_Amp_Amp_Amp
(#s: Type u#ss)
(#t: Type u#tt)
(#x #y: s)
(#w #z: t)
($c1: cmpres x y)
($c2: cmpres w z)
: cmpres (x, w) (y, z) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let (&&&) (#s : Type u#ss) (#t : Type u#tt) (#x #y : s) (#w #z : t)
($c1 : cmpres x y)
($c2 : cmpres w z)
: cmpres (x,w) (y,z) =
match c1, c2 with
| Eq, Eq -> Eq
| Neq, _
| _, Neq -> Neq
| _ -> Unknown | val op_Amp_Amp_Amp
(#s: Type u#ss)
(#t: Type u#tt)
(#x #y: s)
(#w #z: t)
($c1: cmpres x y)
($c2: cmpres w z)
: cmpres (x, w) (y, z)
let op_Amp_Amp_Amp
(#s: Type u#ss)
(#t: Type u#tt)
(#x #y: s)
(#w #z: t)
($c1: cmpres x y)
($c2: cmpres w z)
... | false | null | false | match c1, c2 with
| Eq, Eq -> Eq
| Neq, _ | _, Neq -> Neq
| _ -> Unknown | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.cmpres",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq._cmpres",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Unknown"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val op_Amp_Amp_Amp
(#s: Type u#ss)
(#t: Type u#tt)
(#x #y: s)
(#w #z: t)
($c1: cmpres x y)
($c2: cmpres w z)
: cmpres (x, w) (y, z) | [] | FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | $c1: FStar.Reflection.V2.TermEq.cmpres x y -> $c2: FStar.Reflection.V2.TermEq.cmpres w z
-> FStar.Reflection.V2.TermEq.cmpres (x, w) (y, z) | {
"end_col": 16,
"end_line": 96,
"start_col": 2,
"start_line": 92
} |
FStar.Pervasives.Lemma | val univ_eq_UvMax (u1 u2: universe) (us1 us2: list universe)
: Lemma (requires inspect_universe u1 == Uv_Max us1 /\ inspect_universe u2 == Uv_Max us2)
(ensures univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let univ_eq_UvMax (u1 u2 : universe) (us1 us2 : list universe)
: Lemma (requires inspect_universe u1 == Uv_Max us1 /\
inspect_universe u2 == Uv_Max us2)
(ensures univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2)
= assert_norm (univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2) | val univ_eq_UvMax (u1 u2: universe) (us1 us2: list universe)
: Lemma (requires inspect_universe u1 == Uv_Max us1 /\ inspect_universe u2 == Uv_Max us2)
(ensures univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2)
let univ_eq_UvMax (u1 u2: universe) (us1 us2: list universe)
: Lemma (requires inspect_univ... | false | null | true | assert_norm (univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.Types.universe",
"Prims.list",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.l_or",
"FStar.Reflection.V2.TermEq.valid",
"FStar.Reflection.V2.TermEq.univ_cmp",
"FStar.Reflection.V2.TermEq.list_dec_cmp",
"Prims.unit",
"Prims.l_and",
"... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val univ_eq_UvMax (u1 u2: universe) (us1 us2: list universe)
: Lemma (requires inspect_universe u1 == Uv_Max us1 /\ inspect_universe u2 == Uv_Max us2)
(ensures univ_cmp u1 u2 == list_dec_cmp u1 u2 univ_cmp us1 us2) | [] | FStar.Reflection.V2.TermEq.univ_eq_UvMax | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
u1: FStar.Reflection.Types.universe ->
u2: FStar.Reflection.Types.universe ->
us1: Prims.list FStar.Reflection.Types.universe ->
us2: Prims.list FStar.Reflection.Types.universe
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.Builtins.inspect_universe u1 == FStar.Reflection.V2.Da... | {
"end_col": 71,
"end_line": 423,
"start_col": 4,
"start_line": 423
} |
FStar.Pervasives.Lemma | val memP_allP0 (#a: _) (pred: (a -> Type)) (x: a) (l: list a)
: Lemma (requires allP0 pred l /\ L.memP x l)
(ensures pred x)
[SMTPat (allP0 pred l); SMTPat (L.memP x l)] | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec memP_allP0 #a (pred : a -> Type) (x : a) (l : list a)
: Lemma (requires allP0 pred l /\ L.memP x l)
(ensures pred x)
[SMTPat (allP0 pred l); SMTPat (L.memP x l)]
= match l with
| [] -> ()
| y::ys ->
if StrongExcludedMiddle.strong_excluded_middle (x == y) then () else memP_a... | val memP_allP0 (#a: _) (pred: (a -> Type)) (x: a) (l: list a)
: Lemma (requires allP0 pred l /\ L.memP x l)
(ensures pred x)
[SMTPat (allP0 pred l); SMTPat (L.memP x l)]
let rec memP_allP0 #a (pred: (a -> Type)) (x: a) (l: list a)
: Lemma (requires allP0 pred l /\ L.memP x l)
(ensures pred x)
... | false | null | true | match l with
| [] -> ()
| y :: ys ->
if StrongExcludedMiddle.strong_excluded_middle (x == y) then () else memP_allP0 pred x ys | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"Prims.list",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Prims.bool",
"FStar.Reflection.V2.TermEq.memP_allP0",
"Prims.unit",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.allP0",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val memP_allP0 (#a: _) (pred: (a -> Type)) (x: a) (l: list a)
: Lemma (requires allP0 pred l /\ L.memP x l)
(ensures pred x)
[SMTPat (allP0 pred l); SMTPat (L.memP x l)] | [
"recursion"
] | FStar.Reflection.V2.TermEq.memP_allP0 | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | pred: (_: a -> Type0) -> x: a -> l: Prims.list a
-> FStar.Pervasives.Lemma
(requires FStar.Reflection.V2.TermEq.allP0 pred l /\ FStar.List.Tot.Base.memP x l)
(ensures pred x)
[SMTPat (FStar.Reflection.V2.TermEq.allP0 pred l); SMTPat (FStar.List.Tot.Base.memP x l)] | {
"end_col": 95,
"end_line": 56,
"start_col": 4,
"start_line": 53
} |
Prims.Tot | val optP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (o: option a {o << top}) : Type0 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let optP #a #b (top:b) (pred : (x:a{x << top}) -> Type0) (o : option a{o << top}) : Type0 =
match o with
| None -> True
| Some x -> pred x | val optP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (o: option a {o << top}) : Type0
let optP #a #b (top: b) (pred: (x: a{x << top} -> Type0)) (o: option a {o << top}) : Type0 = | false | null | false | match o with
| None -> True
| Some x -> pred x | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.precedes",
"FStar.Pervasives.Native.option",
"Prims.l_True"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val optP (#a #b: _) (top: b) (pred: (x: a{x << top} -> Type0)) (o: option a {o << top}) : Type0 | [] | FStar.Reflection.V2.TermEq.optP | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | top: b -> pred: (x: a{x << top} -> Type0) -> o: FStar.Pervasives.Native.option a {o << top} -> Type0 | {
"end_col": 20,
"end_line": 38,
"start_col": 2,
"start_line": 36
} |
Prims.Tot | val namedv_cmp : comparator_for namedv | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let namedv_cmp x1 x2 =
let v1 = inspect_namedv x1 in
let v2 = inspect_namedv x2 in
pack_inspect_namedv x1;
pack_inspect_namedv x2;
sealed_singl v1.sort v2.sort;
if v1.uniq = v2.uniq then Eq else Neq | val namedv_cmp : comparator_for namedv
let namedv_cmp x1 x2 = | false | null | false | let v1 = inspect_namedv x1 in
let v2 = inspect_namedv x2 in
pack_inspect_namedv x1;
pack_inspect_namedv x2;
sealed_singl v1.sort v2.sort;
if v1.uniq = v2.uniq then Eq else Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.Types.namedv",
"Prims.op_Equality",
"Prims.nat",
"FStar.Reflection.V2.Data.__proj__Mknamedv_view__item__uniq",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.bool",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres",
"Prims.unit",
"FStar.Sealed.sealed_singl",
"FStar... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val namedv_cmp : comparator_for namedv | [] | FStar.Reflection.V2.TermEq.namedv_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.Types.namedv | {
"end_col": 39,
"end_line": 114,
"start_col": 22,
"start_line": 108
} |
Prims.Tot | val either_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (either a b) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let either_cmp cmpa cmpb e1 e2 =
match e1, e2 with
| Inl x, Inl y -> cmpa x y
| Inr x, Inr y -> cmpb x y
| _ -> Neq | val either_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (either a b)
let either_cmp cmpa cmpb e1 e2 = | false | null | false | match e1, e2 with
| Inl x, Inl y -> cmpa x y
| Inr x, Inr y -> cmpb x y
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"FStar.Pervasives.either",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Neq",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val either_cmp : #a:Type -> #b:Type -> comparator_for a -> comparator_for b -> comparator_for (either a b) | [] | FStar.Reflection.V2.TermEq.either_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
cmpa: FStar.Reflection.V2.TermEq.comparator_for a ->
cmpb: FStar.Reflection.V2.TermEq.comparator_for b
-> FStar.Reflection.V2.TermEq.comparator_for (FStar.Pervasives.either a b) | {
"end_col": 12,
"end_line": 136,
"start_col": 2,
"start_line": 133
} |
Prims.Tot | val list_dec_cmp :
#a:Type u#aa -> #b:Type u#bb -> top1:b -> top2:b ->
f:(x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y) ->
l1:(list a) -> l2:(list a){l1 << top1 /\ l2 << top2} ->
cmpres l1 l2 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec list_dec_cmp #a top1 top2 cmp l1 l2 =
match l1, l2 with
| [], [] -> Eq
| x::xs, y::ys -> cmp x y &&& list_dec_cmp top1 top2 cmp xs ys
| _ -> Neq | val list_dec_cmp :
#a:Type u#aa -> #b:Type u#bb -> top1:b -> top2:b ->
f:(x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y) ->
l1:(list a) -> l2:(list a){l1 << top1 /\ l2 << top2} ->
cmpres l1 l2
let rec list_dec_cmp #a top1 top2 cmp l1 l2 = | false | null | false | match l1, l2 with
| [], [] -> Eq
| x :: xs, y :: ys -> cmp x y &&& list_dec_cmp top1 top2 cmp xs ys
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.l_and",
"Prims.precedes",
"FStar.Reflection.V2.TermEq.cmpres",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Reflection.V2.TermEq.list_dec_cmp",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.Te... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val list_dec_cmp :
#a:Type u#aa -> #b:Type u#bb -> top1:b -> top2:b ->
f:(x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y) ->
l1:(list a) -> l2:(list a){l1 << top1 /\ l2 << top2} ->
cmpres l1 l2 | [
"recursion"
] | FStar.Reflection.V2.TermEq.list_dec_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
top1: b ->
top2: b ->
f: (x: a -> y: a{x << top1 /\ y << top2} -> FStar.Reflection.V2.TermEq.cmpres x y) ->
l1: Prims.list a ->
l2: Prims.list a {l1 << top1 /\ l2 << top2}
-> FStar.Reflection.V2.TermEq.cmpres l1 l2 | {
"end_col": 12,
"end_line": 158,
"start_col": 2,
"start_line": 155
} |
Prims.Tot | val either_dec_cmp : #a:Type -> #b:Type -> #c:Type -> top1:c -> top2:c ->
(x:a -> y:a{x<<top1 /\ y<<top2} -> cmpres x y) ->
(x:b -> y:b{x<<top1 /\ y<<top2} -> cmpres x y) ->
e1 :(either a b){e1 << top1} ->
e2 :(either a b){e2 << top2} ->
cmpres e1 e2 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let either_dec_cmp top1 top2 cmpa cmpb e1 e2 =
match e1, e2 with
| Inl x, Inl y -> cmpa x y
| Inr x, Inr y -> cmpb x y
| _ -> Neq | val either_dec_cmp : #a:Type -> #b:Type -> #c:Type -> top1:c -> top2:c ->
(x:a -> y:a{x<<top1 /\ y<<top2} -> cmpres x y) ->
(x:b -> y:b{x<<top1 /\ y<<top2} -> cmpres x y) ->
e1 :(either a b){e1 << top1} ->
e2 :(either a b){e2 << top2} ->
cmpres e1 e2
let either_dec_cmp top1 top2 cmpa cmpb e1 e2 = | false | null | false | match e1, e2 with
| Inl x, Inl y -> cmpa x y
| Inr x, Inr y -> cmpb x y
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.l_and",
"Prims.precedes",
"FStar.Reflection.V2.TermEq.cmpres",
"FStar.Pervasives.either",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Neq",
"Prims.l_or"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val either_dec_cmp : #a:Type -> #b:Type -> #c:Type -> top1:c -> top2:c ->
(x:a -> y:a{x<<top1 /\ y<<top2} -> cmpres x y) ->
(x:b -> y:b{x<<top1 /\ y<<top2} -> cmpres x y) ->
e1 :(either a b){e1 << top1} ->
e2 :(either a b){e2 << top2} ->
cmpres e1 e2 | [] | FStar.Reflection.V2.TermEq.either_dec_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
top1: c ->
top2: c ->
cmpa: (x: a -> y: a{x << top1 /\ y << top2} -> FStar.Reflection.V2.TermEq.cmpres x y) ->
cmpb: (x: b -> y: b{x << top1 /\ y << top2} -> FStar.Reflection.V2.TermEq.cmpres x y) ->
e1: FStar.Pervasives.either a b {e1 << top1} ->
e2: FStar.Pervasives.either a b {e2 << top2}
... | {
"end_col": 12,
"end_line": 180,
"start_col": 2,
"start_line": 177
} |
Prims.Tot | val range_cmp : comparator_for range | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let range_cmp r1 r2 =
Sealed.sealed_singl r1 r2;
Eq | val range_cmp : comparator_for range
let range_cmp r1 r2 = | false | null | false | Sealed.sealed_singl r1 r2;
Eq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Range.range",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.unit",
"FStar.Sealed.sealed_singl",
"FStar.Range.__range",
"FStar.Reflection.V2.TermEq.cmpres"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val range_cmp : comparator_for range | [] | FStar.Reflection.V2.TermEq.range_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Range.range | {
"end_col": 4,
"end_line": 188,
"start_col": 2,
"start_line": 187
} |
Prims.Tot | val opt_dec_cmp : #a:Type -> #b:Type -> top1:b -> top2:b ->
(f : (x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y)) ->
o1:(option a){o1 << top1} -> o2:(option a){o2 << top2} ->
cmpres o1 o2 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let opt_dec_cmp top1 top2 cmp o1 o2 =
match o1, o2 with
| None, None -> Eq
| Some x, Some y -> cmp x y
| _ -> Neq | val opt_dec_cmp : #a:Type -> #b:Type -> top1:b -> top2:b ->
(f : (x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y)) ->
o1:(option a){o1 << top1} -> o2:(option a){o2 << top2} ->
cmpres o1 o2
let opt_dec_cmp top1 top2 cmp o1 o2 = | false | null | false | match o1, o2 with
| None, None -> Eq
| Some x, Some y -> cmp x y
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"Prims.l_and",
"Prims.precedes",
"FStar.Reflection.V2.TermEq.cmpres",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.Eq",
"FStar.Pervasives.Native.tuple2",
"FStar.Reflection.V2.TermEq.Neq",
"Prims.l_or"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val opt_dec_cmp : #a:Type -> #b:Type -> top1:b -> top2:b ->
(f : (x:a -> y:a{x << top1 /\ y << top2} -> cmpres x y)) ->
o1:(option a){o1 << top1} -> o2:(option a){o2 << top2} ->
cmpres o1 o2 | [] | FStar.Reflection.V2.TermEq.opt_dec_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
top1: b ->
top2: b ->
f: (x: a -> y: a{x << top1 /\ y << top2} -> FStar.Reflection.V2.TermEq.cmpres x y) ->
o1: FStar.Pervasives.Native.option a {o1 << top1} ->
o2: FStar.Pervasives.Native.option a {o2 << top2}
-> FStar.Reflection.V2.TermEq.cmpres o1 o2 | {
"end_col": 12,
"end_line": 168,
"start_col": 2,
"start_line": 165
} |
Prims.Tot | val const_cmp : comparator_for vconst | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let const_cmp c1 c2 =
match c1, c2 with
| C_Unit, C_Unit -> Eq
| C_Int i1, C_Int i2 -> eq_cmp i1 i2
| C_True, C_True -> Eq
| C_False, C_False -> Eq
| C_String s1, C_String s2 -> eq_cmp s1 s2
| C_Range r1, C_Range r2 -> range_cmp r1 r2
| C_Reify, C_Reify -> Eq
| C_Reflect n1, C_Reflect n2 -> eq_cmp n1 ... | val const_cmp : comparator_for vconst
let const_cmp c1 c2 = | false | null | false | match c1, c2 with
| C_Unit, C_Unit -> Eq
| C_Int i1, C_Int i2 -> eq_cmp i1 i2
| C_True, C_True -> Eq
| C_False, C_False -> Eq
| C_String s1, C_String s2 -> eq_cmp s1 s2
| C_Range r1, C_Range r2 -> range_cmp r1 r2
| C_Reify, C_Reify -> Eq
| C_Reflect n1, C_Reflect n2 -> eq_cmp n1 n2
| _ -> Neq | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.Data.vconst",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.int",
"FStar.Reflection.V2.TermEq.eq_cmp",
"Prims.string",
"FStar.Range.range",
"FStar.Reflection.V2.TermEq.range_cmp",
"FStar.Reflection.Types.name",
"FStar.Pervasives.Native.tuple2",
... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | true | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val const_cmp : comparator_for vconst | [] | FStar.Reflection.V2.TermEq.const_cmp | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | FStar.Reflection.V2.TermEq.comparator_for FStar.Reflection.V2.Data.vconst | {
"end_col": 12,
"end_line": 226,
"start_col": 2,
"start_line": 217
} |
FStar.Pervasives.Lemma | val faithful_Pat_Cons (p: pattern) (f: fv) (ous: option universes) (subpats: list (pattern & bool))
: Lemma (requires p == Pat_Cons f ous subpats /\ faithful_pattern p)
(ensures allP p faithful_pattern_arg subpats) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let faithful_Pat_Cons (p : pattern) (f:fv) (ous : option universes) (subpats : list (pattern & bool))
: Lemma (requires p == Pat_Cons f ous subpats /\ faithful_pattern p)
(ensures allP p faithful_pattern_arg subpats)
= assert_norm (faithful_pattern p ==> allP p faithful_pattern_arg subpats) | val faithful_Pat_Cons (p: pattern) (f: fv) (ous: option universes) (subpats: list (pattern & bool))
: Lemma (requires p == Pat_Cons f ous subpats /\ faithful_pattern p)
(ensures allP p faithful_pattern_arg subpats)
let faithful_Pat_Cons (p: pattern) (f: fv) (ous: option universes) (subpats: list (pattern & bo... | false | null | true | assert_norm (faithful_pattern p ==> allP p faithful_pattern_arg subpats) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.V2.Data.pattern",
"FStar.Reflection.Types.fv",
"FStar.Pervasives.Native.option",
"FStar.Reflection.V2.Data.universes",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"FStar.Pervasives.assert_norm",
"Prims.l_imp",
"FStar.Reflection.V2.TermEq.faithful_pattern",
"FS... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val faithful_Pat_Cons (p: pattern) (f: fv) (ous: option universes) (subpats: list (pattern & bool))
: Lemma (requires p == Pat_Cons f ous subpats /\ faithful_pattern p)
(ensures allP p faithful_pattern_arg subpats) | [] | FStar.Reflection.V2.TermEq.faithful_Pat_Cons | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
p: FStar.Reflection.V2.Data.pattern ->
f: FStar.Reflection.Types.fv ->
ous: FStar.Pervasives.Native.option FStar.Reflection.V2.Data.universes ->
subpats: Prims.list (FStar.Reflection.V2.Data.pattern * Prims.bool)
-> FStar.Pervasives.Lemma
(requires
p == FStar.Reflection.V2.Data.Pat_Cons... | {
"end_col": 76,
"end_line": 589,
"start_col": 4,
"start_line": 589
} |
FStar.Pervasives.Lemma | val defined_list_dec
(#a #b: _)
(t1 t2: b)
(f: comparator_for a)
(l1: list a {l1 << t1})
(l2: list a {l2 << t2})
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_dec_cmp t1 t2 f l1 l2)) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let rec defined_list_dec #a #b (t1 t2 : b) (f : comparator_for a)
(l1 : list a{l1 << t1})
(l2 : list a{l2 << t2})
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_dec_cmp t1 t2 f l1 l2))
= match l1, l2 with
| [], [] -> ()
| x::xs, y::ys -> defined_list_dec t1 t2 f xs ys
| _ -> () | val defined_list_dec
(#a #b: _)
(t1 t2: b)
(f: comparator_for a)
(l1: list a {l1 << t1})
(l2: list a {l2 << t2})
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_dec_cmp t1 t2 f l1 l2))
let rec defined_list_dec
#a
#b
(t1: b)
(t2: b)
(f: comparator_... | false | null | true | match l1, l2 with
| [], [] -> ()
| x :: xs, y :: ys -> defined_list_dec t1 t2 f xs ys
| _ -> () | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.V2.TermEq.comparator_for",
"Prims.list",
"Prims.precedes",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.defined_list_dec",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"FStar.Reflection.V2.TermEq.def2",
"Prims.squash",
"FStar.Reflection.V2.TermEq.defined",
... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val defined_list_dec
(#a #b: _)
(t1 t2: b)
(f: comparator_for a)
(l1: list a {l1 << t1})
(l2: list a {l2 << t2})
: Lemma (requires (def2 f l1 l2)) (ensures defined (list_dec_cmp t1 t2 f l1 l2)) | [
"recursion"
] | FStar.Reflection.V2.TermEq.defined_list_dec | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
t1: b ->
t2: b ->
f: FStar.Reflection.V2.TermEq.comparator_for a ->
l1: Prims.list a {l1 << t1} ->
l2: Prims.list a {l2 << t2}
-> FStar.Pervasives.Lemma (requires FStar.Reflection.V2.TermEq.def2 f l1 l2)
(ensures
FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.list_de... | {
"end_col": 13,
"end_line": 399,
"start_col": 4,
"start_line": 396
} |
Prims.Tot | val term_eq_dec (t1 t2: faithful_term) : (b: bool{b <==> t1 == t2}) | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let term_eq_dec (t1 t2 : faithful_term) : (b:bool{b <==> t1 == t2}) =
faithful_lemma t1 t2;
Eq? (term_cmp t1 t2) | val term_eq_dec (t1 t2: faithful_term) : (b: bool{b <==> t1 == t2})
let term_eq_dec (t1 t2: faithful_term) : (b: bool{b <==> t1 == t2}) = | false | null | false | faithful_lemma t1 t2;
Eq? (term_cmp t1 t2) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"total"
] | [
"FStar.Reflection.V2.TermEq.faithful_term",
"FStar.Reflection.V2.TermEq.uu___is_Eq",
"FStar.Reflection.V2.TermEq.term_cmp",
"Prims.unit",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"Prims.bool",
"Prims.l_iff",
"Prims.b2t",
"Prims.eq2"
] | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val term_eq_dec (t1 t2: faithful_term) : (b: bool{b <==> t1 == t2}) | [] | FStar.Reflection.V2.TermEq.term_eq_dec | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | t1: FStar.Reflection.V2.TermEq.faithful_term -> t2: FStar.Reflection.V2.TermEq.faithful_term
-> b: Prims.bool{b <==> t1 == t2} | {
"end_col": 22,
"end_line": 825,
"start_col": 2,
"start_line": 824
} |
FStar.Pervasives.Lemma | val pat_eq_Pat_Cons
(p1 p2: pattern)
(f1 f2: fv)
(ous1 ous2: option universes)
(args1 args2: list (pattern & bool))
: Lemma (requires p1 == Pat_Cons f1 ous1 args1 /\ p2 == Pat_Cons f2 ous2 args2)
(ensures
pat_cmp p1 p2 ==
(fv_cmp f1 f2 &&& opt_dec_cmp p1 p2 (list_dec_cm... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Data",
"short_module": null
},
{
"abbrev": fa... | false | let pat_eq_Pat_Cons (p1 p2 : pattern) (f1 f2 : fv) (ous1 ous2 : option universes) (args1 args2 : list (pattern & bool))
: Lemma (requires p1 == Pat_Cons f1 ous1 args1 /\ p2 == Pat_Cons f2 ous2 args2)
(ensures pat_cmp p1 p2 == (fv_cmp f1 f2
&&& opt_dec_cmp p1 p2 (list_dec_... | val pat_eq_Pat_Cons
(p1 p2: pattern)
(f1 f2: fv)
(ous1 ous2: option universes)
(args1 args2: list (pattern & bool))
: Lemma (requires p1 == Pat_Cons f1 ous1 args1 /\ p2 == Pat_Cons f2 ous2 args2)
(ensures
pat_cmp p1 p2 ==
(fv_cmp f1 f2 &&& opt_dec_cmp p1 p2 (list_dec_cm... | false | null | true | assert_norm (pat_cmp p1 p2 ==
(fv_cmp f1 f2 &&& opt_dec_cmp p1 p2 (list_dec_cmp p1 p2 univ_cmp) ous1 ous2 &&&
list_dec_cmp p1 p2 pat_arg_cmp args1 args2)) | {
"checked_file": "FStar.Reflection.V2.TermEq.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Reflection.V2.Data.fsti.checked",
"FStar.Reflection.V2.Builtins.fsti.checked",
"FStar.Reflection.Types.fsti.checked... | [
"lemma"
] | [
"FStar.Reflection.V2.Data.pattern",
"FStar.Reflection.Types.fv",
"FStar.Pervasives.Native.option",
"FStar.Reflection.V2.Data.universes",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.l_or",
... | [] | module FStar.Reflection.V2.TermEq
open FStar.Reflection.Types
open FStar.Reflection.V2.Data
open FStar.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options "--warn_error -29... | false | false | FStar.Reflection.V2.TermEq.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val pat_eq_Pat_Cons
(p1 p2: pattern)
(f1 f2: fv)
(ous1 ous2: option universes)
(args1 args2: list (pattern & bool))
: Lemma (requires p1 == Pat_Cons f1 ous1 args1 /\ p2 == Pat_Cons f2 ous2 args2)
(ensures
pat_cmp p1 p2 ==
(fv_cmp f1 f2 &&& opt_dec_cmp p1 p2 (list_dec_cm... | [] | FStar.Reflection.V2.TermEq.pat_eq_Pat_Cons | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
p1: FStar.Reflection.V2.Data.pattern ->
p2: FStar.Reflection.V2.Data.pattern ->
f1: FStar.Reflection.Types.fv ->
f2: FStar.Reflection.Types.fv ->
ous1: FStar.Pervasives.Native.option FStar.Reflection.V2.Data.universes ->
ous2: FStar.Pervasives.Native.option FStar.Reflection.V2.Data.universes ->... | {
"end_col": 84,
"end_line": 598,
"start_col": 4,
"start_line": 596
} |
FStar.Pervasives.Lemma | val closure_transitive (#a: Type u#a) (#r_a: binrel u#a u#ra a) (x y z: a)
: Lemma (requires closure r_a x y /\ squash (r_a y z))
(ensures closure r_a x z)
[SMTPat (closure r_a x y); SMTPat (r_a y z)] | [
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": ... | false | let closure_transitive (#a:Type u#a) (#r_a:binrel u#a u#ra a) (x y z:a)
: Lemma
(requires closure r_a x y /\
squash (r_a y z))
(ensures closure r_a x z)
[SMTPat (closure r_a x y);
SMTPat (r_a y z)]
= assert (closure r_a y z) | val closure_transitive (#a: Type u#a) (#r_a: binrel u#a u#ra a) (x y z: a)
: Lemma (requires closure r_a x y /\ squash (r_a y z))
(ensures closure r_a x z)
[SMTPat (closure r_a x y); SMTPat (r_a y z)]
let closure_transitive (#a: Type u#a) (#r_a: binrel u#a u#ra a) (x y z: a)
: Lemma (requires closur... | false | null | true | assert (closure r_a y z) | {
"checked_file": "FStar.LexicographicOrdering.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FSta... | [
"lemma"
] | [
"FStar.WellFounded.binrel",
"Prims._assert",
"FStar.ReflexiveTransitiveClosure.closure",
"Prims.unit",
"Prims.l_and",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | FStar.LexicographicOrdering.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val closure_transitive (#a: Type u#a) (#r_a: binrel u#a u#ra a) (x y z: a)
: Lemma (requires closure r_a x y /\ squash (r_a y z))
(ensures closure r_a x z)
[SMTPat (closure r_a x y); SMTPat (r_a y z)] | [] | FStar.LexicographicOrdering.closure_transitive | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> y: a -> z: a
-> FStar.Pervasives.Lemma
(requires FStar.ReflexiveTransitiveClosure.closure r_a x y /\ Prims.squash (r_a y z))
(ensures FStar.ReflexiveTransitiveClosure.closure r_a x z)
[SMTPat (FStar.ReflexiveTransitiveClosure.closure r_a x y); SMTPat (r_a y z)] | {
"end_col": 28,
"end_line": 33,
"start_col": 4,
"start_line": 33
} |
Prims.Tot | val lex_t_wf (#a:Type u#a) (#b:a -> Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:(x:a -> binrel u#b u#rb (b x)))
(wf_a:well_founded r_a)
(wf_b:(x:a -> well_founded (r_b x)))
: well_founded (lex_t r_a r_b) | [
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": ... | false | let lex_t_wf #_ #_ #_ #_ wf_a wf_b =
fun (| x, y |) -> AccIntro (lex_t_wf_aux x (wf_a x) wf_b y (wf_b x y)) | val lex_t_wf (#a:Type u#a) (#b:a -> Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:(x:a -> binrel u#b u#rb (b x)))
(wf_a:well_founded r_a)
(wf_b:(x:a -> well_founded (r_b x)))
: well_founded (lex_t r_a r_b)
let lex_t_wf #_ #_ #_ #_ wf_a wf_b = | false | null | false | fun (| x , y |) -> AccIntro (lex_t_wf_aux x (wf_a x) wf_b y (wf_b x y)) | {
"checked_file": "FStar.LexicographicOrdering.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FSta... | [
"total"
] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"Prims.dtuple2",
"FStar.WellFounded.AccIntro",
"FStar.LexicographicOrdering.lex_t",
"Prims.Mkdtuple2",
"FStar.LexicographicOrdering.lex_t_wf_aux",
"FStar.WellFounded.acc"
] | [] | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | FStar.LexicographicOrdering.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lex_t_wf (#a:Type u#a) (#b:a -> Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:(x:a -> binrel u#b u#rb (b x)))
(wf_a:well_founded r_a)
(wf_b:(x:a -> well_founded (r_b x)))
: well_founded (lex_t r_a r_b) | [] | FStar.LexicographicOrdering.lex_t_wf | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | wf_a: FStar.WellFounded.well_founded r_a -> wf_b: (x: a -> FStar.WellFounded.well_founded (r_b x))
-> FStar.WellFounded.well_founded (FStar.LexicographicOrdering.lex_t r_a r_b) | {
"end_col": 72,
"end_line": 96,
"start_col": 2,
"start_line": 96
} |
Prims.Tot | val lex_t_non_dep_wf (#a:Type u#a)
(#b:Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:binrel u#b u#rb b)
(wf_a:well_founded r_a)
(wf_b:well_founded r_b)
: well_founded (lex_t_non_dep r_a r_b) | [
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false... | false | let lex_t_non_dep_wf #a #b #r_a #r_b wf_a wf_b =
let rec get_acc (t:a & b) (p:acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t))
: Tot (acc (lex_t_non_dep r_a r_b) t)
(decreases p)
= let get_acc_aux (t1:a & b) (p_dep:lex_t_non_dep r_a r_b t1 t)
: (p1:acc (lex_t r_a (fun _ -> r_b)) (tuple... | val lex_t_non_dep_wf (#a:Type u#a)
(#b:Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:binrel u#b u#rb b)
(wf_a:well_founded r_a)
(wf_b:well_founded r_b)
: well_founded (lex_t_non_dep r_a r_b)
let lex_t_non_dep_wf #a #b ... | false | null | false | let rec get_acc (t: a & b) (p: acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t))
: Tot (acc (lex_t_non_dep r_a r_b) t) (decreases p) =
let get_acc_aux (t1: a & b) (p_dep: lex_t_non_dep r_a r_b t1 t)
: (p1: acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t1) {p1 << p}) =
match p with | AccIntro f... | {
"checked_file": "FStar.LexicographicOrdering.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FSta... | [
"total"
] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.Pervasives.Native.tuple2",
"FStar.LexicographicOrdering.lex_t_wf",
"FStar.LexicographicOrdering.tuple_to_dep_tuple",
"FStar.WellFounded.acc",
"FStar.LexicographicOrdering.lex_t_non_dep",
"Prims.dtuple2",
"FStar.LexicographicOrderin... | [] | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | FStar.LexicographicOrdering.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lex_t_non_dep_wf (#a:Type u#a)
(#b:Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:binrel u#b u#rb b)
(wf_a:well_founded r_a)
(wf_b:well_founded r_b)
: well_founded (lex_t_non_dep r_a r_b) | [] | FStar.LexicographicOrdering.lex_t_non_dep_wf | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | wf_a: FStar.WellFounded.well_founded r_a -> wf_b: FStar.WellFounded.well_founded r_b
-> FStar.WellFounded.well_founded (FStar.LexicographicOrdering.lex_t_non_dep r_a r_b) | {
"end_col": 75,
"end_line": 132,
"start_col": 48,
"start_line": 123
} |
Prims.Tot | val lex_to_lex_t (#a:Type u#a) (#b:a -> Type u#b)
(r_a:binrel u#a u#ra a)
(r_b:(x:a -> binrel u#b u#rb (b x)))
(t1 t2:(x:a & b x))
(p:lex_aux r_a r_b t1 t2)
: squash (lex_t r_a r_b t1 t2) | [
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false... | false | let lex_to_lex_t #a #b r_a r_b t1 t2 p =
let left (p:squash (r_a (dfst t1) (dfst t2)))
: squash (lex_t r_a r_b t1 t2)
= bind_squash p (fun p ->
return_squash (Left_lex #a #b #r_a #r_b (dfst t1) (dfst t2) (dsnd t1) (dsnd t2) p)) in
let right (p:(dfst t1 == dfst t2 /\ (squash (r_b (dfst t1) (dsnd t1)... | val lex_to_lex_t (#a:Type u#a) (#b:a -> Type u#b)
(r_a:binrel u#a u#ra a)
(r_b:(x:a -> binrel u#b u#rb (b x)))
(t1 t2:(x:a & b x))
(p:lex_aux r_a r_b t1 t2)
: squash (lex_t r_a r_b t1 t2)
let lex_to_lex_t #a #b r_a r_b t1 t2 p = | false | null | true | let left (p: squash (r_a (dfst t1) (dfst t2))) : squash (lex_t r_a r_b t1 t2) =
bind_squash p
(fun p -> return_squash (Left_lex #a #b #r_a #r_b (dfst t1) (dfst t2) (dsnd t1) (dsnd t2) p))
in
let right (p: (dfst t1 == dfst t2 /\ (squash (r_b (dfst t1) (dsnd t1) (dsnd t2)))))
: squash (lex_t r_a r_b t1 t2) =
... | {
"checked_file": "FStar.LexicographicOrdering.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FSta... | [
"total"
] | [
"FStar.WellFounded.binrel",
"Prims.dtuple2",
"FStar.LexicographicOrdering.lex_aux",
"FStar.Squash.bind_squash",
"Prims.sum",
"Prims.squash",
"FStar.Pervasives.dfst",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.dsnd",
"FStar.LexicographicOrdering.lex_t",
"Prims.pair",
"Prims.Mkdtuple2",
"... | [] | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | FStar.LexicographicOrdering.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lex_to_lex_t (#a:Type u#a) (#b:a -> Type u#b)
(r_a:binrel u#a u#ra a)
(r_b:(x:a -> binrel u#b u#rb (b x)))
(t1 t2:(x:a & b x))
(p:lex_aux r_a r_b t1 t2)
: squash (lex_t r_a r_b t1 t2) | [] | FStar.LexicographicOrdering.lex_to_lex_t | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
r_a: FStar.WellFounded.binrel a ->
r_b: (x: a -> FStar.WellFounded.binrel (b x)) ->
t1: Prims.dtuple2 a (fun x -> b x) ->
t2: Prims.dtuple2 a (fun x -> b x) ->
p: FStar.LexicographicOrdering.lex_aux r_a r_b t1 t2
-> Prims.squash (FStar.LexicographicOrdering.lex_t r_a r_b t1 t2) | {
"end_col": 33,
"end_line": 120,
"start_col": 40,
"start_line": 103
} |
Prims.Tot | val lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | [
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": ... | false | let rec lex_t_wf_aux (#a:Type u#a)
(#b:a -> Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:(x:a -> binrel u#b u#rb (b x)))
(x:a)
(acc_x:acc r_a x) //x and accessibility of x
(wf_b:(x0:a{closure r_a x... | val lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | false | null | false | match p_t with
| Left_lex x_t _ y_t _ p_a ->
AccIntro (lex_t_wf_aux x_t (match acc_x with | AccIntro f -> f x_t p_a) wf_b y_t (wf_b x_t y_t))
| Right_lex _ _ _ _ ->
let rec lex_t_wf_aux_y
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
(p_t: lex_t r_a r_b t (| x, y |))
: Tot ... | {
"checked_file": "FStar.LexicographicOrdering.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FSta... | [
"total",
""
] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc",
"FStar.ReflexiveTransitiveClosure.closure",
"FStar.WellFounded.well_founded",
"Prims.dtuple2",
"FStar.LexicographicOrdering.lex_t",
"Prims.Mkdtuple2",
"FStar.WellFounded.AccIntro",
"FStar.LexicographicOrdering.lex_t_wf_aux"
] | [] | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | false | FStar.LexicographicOrdering.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | [
"recursion"
] | FStar.LexicographicOrdering.lex_t_wf_aux | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
x: a ->
acc_x: FStar.WellFounded.acc r_a x ->
wf_b:
(x0: a{FStar.ReflexiveTransitiveClosure.closure r_a x0 x}
-> FStar.WellFounded.well_founded (r_b x0)) ->
y: b x ->
acc_y: FStar.WellFounded.acc (r_b x) y ->
t: Prims.dtuple2 a (fun x -> b x) ->
p_t: FStar.LexicographicOrder... | {
"end_col": 34,
"end_line": 92,
"start_col": 4,
"start_line": 64
} |
FStar.Pervasives.Lemma | val lemma_label_bool (r:range) (msg:string) (b:bool) : Lemma
(requires label r msg b)
(ensures b)
[SMTPat (label r msg b)] | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_modu... | false | let lemma_label_bool r msg b = lemma_label_Type0 r msg b | val lemma_label_bool (r:range) (msg:string) (b:bool) : Lemma
(requires label r msg b)
(ensures b)
[SMTPat (label r msg b)]
let lemma_label_bool r msg b = | false | null | true | lemma_label_Type0 r msg b | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"FStar.Range.range",
"Prims.string",
"Prims.bool",
"Vale.X64.QuickCodes.lemma_label_Type0",
"Prims.b2t",
"Prims.unit"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= () | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val lemma_label_bool (r:range) (msg:string) (b:bool) : Lemma
(requires label r msg b)
(ensures b)
[SMTPat (label r msg b)] | [] | Vale.X64.QuickCodes.lemma_label_bool | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r: FStar.Range.range -> msg: Prims.string -> b: Prims.bool
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.label r msg b)
(ensures b)
[SMTPat (Vale.X64.QuickCodes.label r msg b)] | {
"end_col": 56,
"end_line": 13,
"start_col": 31,
"start_line": 13
} |
FStar.Pervasives.Lemma | val empty_list_is_small (#a:Type) (x:list a) : Lemma
([] #a == x \/ [] #a << x) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec empty_list_is_small #a x =
match x with
| [] -> ()
| h::t -> empty_list_is_small t | val empty_list_is_small (#a:Type) (x:list a) : Lemma
([] #a == x \/ [] #a << x)
let rec empty_list_is_small #a x = | false | null | true | match x with
| [] -> ()
| h :: t -> empty_list_is_small t | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Prims.list",
"Vale.X64.QuickCodes.empty_list_is_small",
"Prims.unit"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val empty_list_is_small (#a:Type) (x:list a) : Lemma
([] #a == x \/ [] #a << x) | [
"recursion"
] | Vale.X64.QuickCodes.empty_list_is_small | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Prims.list a -> FStar.Pervasives.Lemma (ensures [] == x \/ [] << x) | {
"end_col": 33,
"end_line": 18,
"start_col": 2,
"start_line": 16
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let state_mod_eq (m:mod_t) (s1 s2:vale_state) =
match m with
| Mod_None -> True
| Mod_ok -> s1.vs_ok == s2.vs_ok
| Mod_reg r -> eval_reg r s1 == eval_reg r s2
| Mod_flags -> s1.vs_flags == s2.vs_flags
| Mod_mem -> s1.vs_heap.vf_heap == s2.vs_heap.vf_heap
| Mod_mem_layout -> s1.vs_heap.vf_layout == s2.vs_h... | let state_mod_eq (m: mod_t) (s1 s2: vale_state) = | false | null | false | match m with
| Mod_None -> True
| Mod_ok -> s1.vs_ok == s2.vs_ok
| Mod_reg r -> eval_reg r s1 == eval_reg r s2
| Mod_flags -> s1.vs_flags == s2.vs_flags
| Mod_mem -> s1.vs_heap.vf_heap == s2.vs_heap.vf_heap
| Mod_mem_layout -> s1.vs_heap.vf_layout == s2.vs_heap.vf_layout
| Mod_mem_heaplet n -> Map16.sel s1.vs_heap.vf_h... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"total"
] | [
"Vale.X64.QuickCode.mod_t",
"Vale.X64.State.vale_state",
"Prims.l_True",
"Prims.eq2",
"Prims.bool",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.Machine_s.reg",
"Vale.X64.Machine_s.t_reg",
"Vale.X64.State.eval_reg",
"Vale.X64.Flags.t",
"Vale.X64.State.__proj__Mkvale_state__item_... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | true | Vale.X64.QuickCodes.fst | {
"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... | null | val state_mod_eq : m: Vale.X64.QuickCode.mod_t -> s1: Vale.X64.State.vale_state -> s2: Vale.X64.State.vale_state
-> Prims.logical | [] | Vale.X64.QuickCodes.state_mod_eq | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | m: Vale.X64.QuickCode.mod_t -> s1: Vale.X64.State.vale_state -> s2: Vale.X64.State.vale_state
-> Prims.logical | {
"end_col": 58,
"end_line": 30,
"start_col": 2,
"start_line": 21
} | |
FStar.Pervasives.Lemma | val update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s') | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let update_state_mods_from1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s')
=
if not (mods_contains1 mods m0) then update_state_mods_not1 mods s' s m0 | val update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s')
let update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0... | false | null | true | if not (mods_contains1 mods m0) then update_state_mods_not1 mods s' s m0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.op_Negation",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.update_state_mods_not1",
"Prims.bool",
"Prims.unit",
"Vale.X64.QuickCodes.state_mod_eq",
"Vale.X64.QuickCode.update_state_mods",
"... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s') | [] | Vale.X64.QuickCodes.update_state_mods_from1 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCodes.state_mod_eq m0 s' (Vale.X64.QuickCode.update_state_mods mods s' s))
(ensures
Vale.X64.Q... | {
"end_col": 74,
"end_line": 51,
"start_col": 2,
"start_line": 51
} |
Prims.Ghost | val qblock_proof (#a:Type) (#cs:codes) (qcs:va_state -> GTot (quickCodes a cs)) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_block qcs mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (block cs) s0 f0 sM /\ update_state_mods mods sM s0 ==... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qblock_proof #a #cs qcs mods s0 k =
wp_sound cs (qcs s0) mods k s0 | val qblock_proof (#a:Type) (#cs:codes) (qcs:va_state -> GTot (quickCodes a cs)) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_block qcs mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (block cs) s0 f0 sM /\ update_state_mods mods sM s0 ==... | false | null | false | wp_sound cs (qcs s0) mods k s0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.codes",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.QuickCodes.wp_sound",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.Decls.va_fuel"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qblock_proof (#a:Type) (#cs:codes) (qcs:va_state -> GTot (quickCodes a cs)) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_block qcs mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (block cs) s0 f0 sM /\ update_state_mods mods sM s0 ==... | [] | Vale.X64.QuickCodes.qblock_proof | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
qcs: (_: Vale.X64.Decls.va_state -> Prims.GTot (Vale.X64.QuickCodes.quickCodes a cs)) ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | {
"end_col": 32,
"end_line": 224,
"start_col": 2,
"start_line": 224
} |
FStar.Pervasives.Lemma | val update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let update_state_mods_trans (mods:mods_t) (s0 s1 s2:vale_state) : Lemma
(requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2)
=
update_state_mods_from mods s1 s0;
update_state_mods_from mods s2 s1;
update_state_mods_to mods s2 s0 | val update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2)
let update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods m... | false | null | true | update_state_mods_from mods s1 s0;
update_state_mods_from mods s2 s1;
update_state_mods_to mods s2 s0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.update_state_mods_to",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_from",
"Prims.l_and",
"Prims.eq2",
"Vale.X64.QuickCode.update_state_mods",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2) | [] | Vale.X64.QuickCodes.update_state_mods_trans | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.State.vale_state ->
s1: Vale.X64.State.vale_state ->
s2: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCode.update_state_mods mods s1 s0 == s1 /\
Vale.X64.QuickCode.update_state_mods mods s2 s1 == s2)
... | {
"end_col": 33,
"end_line": 115,
"start_col": 2,
"start_line": 113
} |
Prims.Ghost | val qInlineIf_proof (#a:Type) (#c1:code) (#c2:code) (b:bool) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_InlineIf b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (if_code b c1 c2) s0 f... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qInlineIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
if b then
(
let (sM, f0, g) = QProc?.proof qc1 s0 k in
update_state_mods_weaken qc1.mods mods sM s0;
(sM, f0, g)
)
else
(
let (sM, f0, g) = QProc?.proof qc2 s0 k in
update_state_mods_weaken qc2.mods mods sM s0;
(sM, f0, g)
) | val qInlineIf_proof (#a:Type) (#c1:code) (#c2:code) (b:bool) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_InlineIf b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (if_code b c1 c2) s0 f... | false | null | false | if b
then
(let sM, f0, g = QProc?.proof qc1 s0 k in
update_state_mods_weaken qc1.mods mods sM s0;
(sM, f0, g))
else
(let sM, f0, g = QProc?.proof qc2 s0 k in
update_state_mods_weaken qc2.mods mods sM s0;
(sM, f0, g)) | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Prims.bool",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_weaken",
"Vale.X64.Qui... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qInlineIf_proof (#a:Type) (#c1:code) (#c2:code) (b:bool) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_InlineIf b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (if_code b c1 c2) s0 f... | [] | Vale.X64.QuickCodes.qInlineIf_proof | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b: Prims.bool ->
qc1: Vale.X64.QuickCode.quickCode a c1 ->
qc2: Vale.X64.QuickCode.quickCode a c2 ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | {
"end_col": 3,
"end_line": 238,
"start_col": 2,
"start_line": 227
} |
FStar.Pervasives.Lemma | val update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s')) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let update_state_mods_from (mods:mods_t) (s' s:vale_state) : Lemma
(requires update_state_mods mods s' s == s')
(ensures (
forall (m0:mod_t).{:pattern mods_contains1 mods m0 \/ state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'
))
=
let f1 (m0:mod_t) : Lemma (mods_contains1 mods m0... | val update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
let update_state_mods_from (mods: mods_t)... | false | null | true | let f1 (m0: mod_t) : Lemma (mods_contains1 mods m0 \/ state_mod_eq m0 s s') =
update_state_mods_from1 mods s' s m0
in
FStar.Classical.forall_intro f1 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"FStar.Classical.forall_intro",
"Vale.X64.QuickCode.mod_t",
"Prims.l_or",
"Prims.b2t",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.state_mod_eq",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasi... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s')) | [] | Vale.X64.QuickCodes.update_state_mods_from | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | mods: Vale.X64.QuickCode.mods_t -> s': Vale.X64.State.vale_state -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCode.update_state_mods mods s' s == s')
(ensures
forall (m0: Vale.X64.QuickCode.mod_t).
{:pattern
Vale.X64.QuickCodes.mods_contains1 mods... | {
"end_col": 33,
"end_line": 76,
"start_col": 3,
"start_line": 72
} |
FStar.Pervasives.Lemma | val update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s')) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec update_state_mods_weaken1 (mods mods':mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s'))
=
match mods with
| [] -> ()
| _::mods ->
if mods_contains mods... | val update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s'))
let rec update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state... | false | null | true | match mods with
| [] -> ()
| _ :: mods ->
if mods_contains mods' mods && mods_contains1 mods m0
then update_state_mods_weaken1 mods mods' s' s m0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Prims.op_AmpAmp",
"Vale.X64.QuickCodes.mods_contains",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.update_state_mods_weaken1",
"Prims.bool",
"Prims.unit",
"Prims.l_and",
"Prims.l... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s')) | [
"recursion"
] | Vale.X64.QuickCodes.update_state_mods_weaken1 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
mods': Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
(Vale.X64.QuickCodes.mods_contains1 mods m0 \/ Vale.X64.QuickCodes.state_mod_eq m0... | {
"end_col": 52,
"end_line": 125,
"start_col": 2,
"start_line": 121
} |
FStar.Pervasives.Lemma | val update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec update_state_mods_refl (mods:mods_t) (s:vale_state) : Lemma
(ensures state_eq (update_state_mods mods s s) s)
=
match mods with
| [] -> ()
| _::mods -> update_state_mods_refl mods s | val update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s)
let rec update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) = | false | null | true | match mods with
| [] -> ()
| _ :: mods -> update_state_mods_refl mods s | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Vale.X64.QuickCodes.update_state_mods_refl",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.X64.State.state_eq",
"Vale.X64.QuickCode.update_state_mods",
"Prims.Nil",
"FStar.Pervasives.patt... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) | [
"recursion"
] | Vale.X64.QuickCodes.update_state_mods_refl | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | mods: Vale.X64.QuickCode.mods_t -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(ensures Vale.X64.State.state_eq (Vale.X64.QuickCode.update_state_mods mods s s) s) | {
"end_col": 44,
"end_line": 37,
"start_col": 2,
"start_line": 35
} |
FStar.Pervasives.Lemma | val update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s') | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let update_state_mods_weaken (mods mods':mods_t) (s' s:vale_state) : Lemma
(requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s')
=
update_state_mods_from mods s' s;
let f1 (m0:mod_t) : Lemma (mods_contains1 mods' m0 \/ state_mod_eq m0 s s') =
... | val update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s')
let update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s... | false | null | true | update_state_mods_from mods s' s;
let f1 (m0: mod_t) : Lemma (mods_contains1 mods' m0 \/ state_mod_eq m0 s s') =
update_state_mods_weaken1 mods mods' s' s m0
in
FStar.Classical.forall_intro f1;
update_state_mods_to mods' s' s | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.update_state_mods_to",
"Prims.unit",
"FStar.Classical.forall_intro",
"Vale.X64.QuickCode.mod_t",
"Prims.l_or",
"Prims.b2t",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.state_mod_eq",
"Prims.l_True",
"... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s') | [] | Vale.X64.QuickCodes.update_state_mods_weaken | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
mods': Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCode.update_state_mods mods s' s == s' /\
Vale.X64.QuickCodes.mods_contains mods' mods)
(e... | {
"end_col": 33,
"end_line": 136,
"start_col": 2,
"start_line": 131
} |
Prims.Ghost | val wp_sound_code (#a:Type0) (c:code) (qc:quickCode a c) (k:va_state -> a -> Type0) (s0:va_state) :
Ghost (va_state & fuel & a)
(requires t_require s0 /\ QProc?.wp qc s0 k)
(ensures fun (sN, fN, gN) -> eval_code c s0 fN sN /\ update_state_mods qc.mods sN s0 == sN /\ state_inv sN /\ k sN gN) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let wp_sound_code #a c qc k s0 =
let QProc c _ wp proof = qc in
proof s0 k | val wp_sound_code (#a:Type0) (c:code) (qc:quickCode a c) (k:va_state -> a -> Type0) (s0:va_state) :
Ghost (va_state & fuel & a)
(requires t_require s0 /\ QProc?.wp qc s0 k)
(ensures fun (sN, fN, gN) -> eval_code c s0 fN sN /\ update_state_mods qc.mods sN s0 == sN /\ state_inv sN /\ k sN gN)
let wp_sound_code #a c... | false | null | false | let QProc c _ wp proof = qc in
proof s0 k | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_code",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.QuickCode.quickProc_wp",
"Vale.X64.QuickCode.t_proof",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val wp_sound_code (#a:Type0) (c:code) (qc:quickCode a c) (k:va_state -> a -> Type0) (s0:va_state) :
Ghost (va_state & fuel & a)
(requires t_require s0 /\ QProc?.wp qc s0 k)
(ensures fun (sN, fN, gN) -> eval_code c s0 fN sN /\ update_state_mods qc.mods sN s0 == sN /\ state_inv sN /\ k sN gN) | [] | Vale.X64.QuickCodes.wp_sound_code | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
s0: Vale.X64.Decls.va_state
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.QuickCodes.fuel) * a) | {
"end_col": 12,
"end_line": 319,
"start_col": 32,
"start_line": 317
} |
Prims.Tot | val qAssertLemma (p:Type0) : tAssertLemma p | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qAssertLemma p = fun () -> () | val qAssertLemma (p:Type0) : tAssertLemma p
let qAssertLemma p = | false | null | false | fun () -> () | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"total"
] | [
"Prims.unit"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qAssertLemma (p:Type0) : tAssertLemma p | [] | Vale.X64.QuickCodes.qAssertLemma | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Type0 -> Vale.X64.QuickCodes.tAssertLemma p | {
"end_col": 33,
"end_line": 310,
"start_col": 21,
"start_line": 310
} |
FStar.Pervasives.Lemma | val update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s)) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec update_state_mods_not1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s))
=
match mods with
| [] -> ()
| _::mods -> update_state_mods_not1 mods s' s m0 | val update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s))
let rec update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
... | false | null | true | match mods with
| [] -> ()
| _ :: mods -> update_state_mods_not1 mods s' s m0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Vale.X64.QuickCodes.update_state_mods_not1",
"Prims.unit",
"Prims.b2t",
"Prims.op_Negation",
"Vale.X64.QuickCodes.mods_contains1",
"Prims.squash",
"Vale.X64.QuickCodes.state_mod_eq",
"Vale.X64.... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s)) | [
"recursion"
] | Vale.X64.QuickCodes.update_state_mods_not1 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires Prims.op_Negation (Vale.X64.QuickCodes.mods_contains1 mods m0))
(ensures
Vale.X64.QuickCodes.state_mod_eq m0 s (Vale... | {
"end_col": 50,
"end_line": 45,
"start_col": 2,
"start_line": 43
} |
Prims.Tot | val qAssertSquashLemma (p:Type0) : tAssertSquashLemma p | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qAssertSquashLemma p = fun () -> () | val qAssertSquashLemma (p:Type0) : tAssertSquashLemma p
let qAssertSquashLemma p = | false | null | false | fun () -> () | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"total"
] | [
"Prims.unit",
"Prims.squash"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qAssertSquashLemma (p:Type0) : tAssertSquashLemma p | [] | Vale.X64.QuickCodes.qAssertSquashLemma | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Type0 -> Vale.X64.QuickCodes.tAssertSquashLemma p | {
"end_col": 39,
"end_line": 312,
"start_col": 27,
"start_line": 312
} |
FStar.Pervasives.Lemma | val lemma_state_match (s0:va_state) (s1:va_state) : Lemma
(requires state_match s0 s1)
(ensures state_eq s0 s1) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let lemma_state_match s0 s1 =
lemma_regs_match s0.vs_regs s1.vs_regs n_reg_files;
assert (Regs.equal s0.vs_regs s1.vs_regs) | val lemma_state_match (s0:va_state) (s1:va_state) : Lemma
(requires state_match s0 s1)
(ensures state_eq s0 s1)
let lemma_state_match s0 s1 = | false | null | true | lemma_regs_match s0.vs_regs s1.vs_regs n_reg_files;
assert (Regs.equal s0.vs_regs s1.vs_regs) | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.Decls.va_state",
"Prims._assert",
"Vale.X64.Regs.equal",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Prims.unit",
"Vale.X64.QuickCodes.lemma_regs_match",
"Vale.X64.Machine_s.n_reg_files"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val lemma_state_match (s0:va_state) (s1:va_state) : Lemma
(requires state_match s0 s1)
(ensures state_eq s0 s1) | [] | Vale.X64.QuickCodes.lemma_state_match | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s0: Vale.X64.Decls.va_state -> s1: Vale.X64.Decls.va_state
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.state_match s0 s1)
(ensures Vale.X64.State.state_eq s0 s1) | {
"end_col": 43,
"end_line": 337,
"start_col": 2,
"start_line": 336
} |
Prims.Ghost | val wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let wp_sound_code_wrap (#a:Type0) (c:code) (qc:quickCode a c) (s0:vale_state) (k:(s0':vale_state{s0 == s0'}) -> vale_state -> a -> Type0) :
Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k)
=
wp_sound_code c qc (k s0) s0 | val wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k)
let wp_sound_code_wrap
... | false | null | false | wp_sound_code c qc (k s0) s0 | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.State.vale_state",
"Prims.eq2",
"Vale.X64.QuickCodes.wp_sound_code",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel",
"Prims.l_and",
"Vale.X64.QuickCode.t_require",
"Vale.X64.QuickCodes.wp_sound_code_pre",
"Vale.X... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k) | [] | Vale.X64.QuickCodes.wp_sound_code_wrap | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
s0: Vale.X64.State.vale_state ->
k: (s0': Vale.X64.State.vale_state{s0 == s0'} -> _: Vale.X64.State.vale_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.State.vale_state * Vale.X64.QuickCodes.fuel) * a) | {
"end_col": 30,
"end_line": 344,
"start_col": 2,
"start_line": 344
} |
FStar.Pervasives.Lemma | val update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s)) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let update_state_mods_to (mods:mods_t) (s' s:vale_state) : Lemma
(requires (
forall (m0:mod_t).{:pattern mods_contains1 mods m0 \/ state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'
))
(ensures state_eq s' (update_state_mods mods s' s))
=
let s'' = update_state_mods mods s' s in
... | val update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s))
let update_state_mods_to (mod... | false | null | true | let s'' = update_state_mods mods s' s in
let f1 (m0: mod_t) : Lemma (state_mod_eq m0 s' s'') = update_state_mods_to1 mods s' s m0 in
f1 Mod_ok;
f1 Mod_flags;
f1 Mod_mem;
f1 Mod_mem_layout;
f1 Mod_stack;
f1 Mod_stackTaint;
let f1_reg (r: reg)
: Lemma (ensures Regs.sel r s'.vs_regs == Regs.sel r s''.vs_regs)
[S... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.Arch.HeapImpl.heaplet_id",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Lib.Map16.sel",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_heaplets",
"Vale.X64.State.__proj__Mk... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s)) | [] | Vale.X64.QuickCodes.update_state_mods_to | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | mods: Vale.X64.QuickCode.mods_t -> s': Vale.X64.State.vale_state -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
forall (m0: Vale.X64.QuickCode.mod_t).
{:pattern
Vale.X64.QuickCodes.mods_contains1 mods m0\/Vale.X64.QuickCodes.state_mod_eq m0 s s'}
Vale.X... | {
"end_col": 4,
"end_line": 107,
"start_col": 3,
"start_line": 84
} |
Prims.Ghost | val qWhile_proof
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:va_state -> a -> Type0)
(dec:va_state -> a -> d) (g0:a) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_While b qc mods inv dec g0 s0 k)
(ensures fun (sM, f0, g... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qWhile_proof #a #d #c b qc mods inv dec g0 s0 k =
let ob = cmp_to_ocmp b in
let (s1, f1) = va_lemma_while_total ob c s0 in
update_state_mods_refl mods s0;
qWhile_proof_rec b qc mods inv dec s0 s1 g0 f1 k | val qWhile_proof
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:va_state -> a -> Type0)
(dec:va_state -> a -> d) (g0:a) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_While b qc mods inv dec g0 s0 k)
(ensures fun (sM, f0, g... | false | null | false | let ob = cmp_to_ocmp b in
let s1, f1 = va_lemma_while_total ob c s0 in
update_state_mods_refl mods s0;
qWhile_proof_rec b qc mods inv dec s0 s1 g0 f1 k | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCodes.qWhile_proof_rec",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_refl",
"FStar.Pervasives.Native.tupl... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qWhile_proof
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:va_state -> a -> Type0)
(dec:va_state -> a -> d) (g0:a) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_While b qc mods inv dec g0 s0 k)
(ensures fun (sM, f0, g... | [] | Vale.X64.QuickCodes.qWhile_proof | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b: Vale.X64.QuickCodes.cmp ->
qc: (_: a -> Vale.X64.QuickCode.quickCode a c) ->
mods: Vale.X64.QuickCode.mods_t ->
inv: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
dec: (_: Vale.X64.Decls.va_state -> _: a -> d) ->
g0: a ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_sta... | {
"end_col": 50,
"end_line": 308,
"start_col": 53,
"start_line": 304
} |
FStar.Pervasives.Lemma | val call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let call_QPURE
(#a:Type0) (#cs:codes) (r:range) (msg:string) (pre:((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l:unit -> PURE unit (as_pure_wp pre)) (qcs:quickCodes a cs) (mods:mods_t) (k:vale_state -> a -> Type0) (s0:vale_state)
: Lemma
(requires
(forall (p:unit -> GTot Type0).{:pattern pre... | val call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | false | null | true | l () | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCodes.codes",
"FStar.Range.range",
"Prims.string",
"Prims.unit",
"FStar.Monotonic.Pure.is_monotonic",
"FStar.Monotonic.Pure.as_pure_wp",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Prims.l_Forall",
"Prims.l_imp",
"Vale.X64.QuickCo... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | [] | Vale.X64.QuickCodes.call_QPURE | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
r: FStar.Range.range ->
msg: Prims.string ->
pre:
(_: (_: Prims.unit -> Prims.GTot Type0) -> Prims.GTot Type0)
{FStar.Monotonic.Pure.is_monotonic pre} ->
l: (_: Prims.unit -> Prims.PURE Prims.unit) ->
qcs: Vale.X64.QuickCodes.quickCodes a cs ->
mods: Vale.X64.QuickCode.mods_t ->
... | {
"end_col": 6,
"end_line": 147,
"start_col": 2,
"start_line": 147
} |
FStar.Pervasives.Lemma | val update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s)) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec update_state_mods_to1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s))
=
match mods with
| [] -> ()
| r::mods' ->
let b = r =!= m0 \/ state_mod_eq m0 s s' in
let goal (_... | val update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s))
let rec update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 ... | false | null | true | match mods with
| [] -> ()
| r :: mods' ->
let b = r =!= m0 \/ state_mod_eq m0 s s' in
let goal (_: squash (b \/ ~b)) : Type0 = state_mod_eq m0 s' (update_state_mods mods s' s) in
let l1 (_: squash b) : Lemma (goal ()) = update_state_mods_to1 mods' s' s m0 in
let l2 (_: squash (~b)) : Lemma (goal ()) = () in
... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.l_not",
"Prims.squash",
"Prims.unit",
"Prims.l_True",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Vale.X64.QuickCodes.update_state_mods_to1",
"Prims.l_or",
"V... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s)) | [
"recursion"
] | Vale.X64.QuickCodes.update_state_mods_to1 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCodes.mods_contains1 mods m0 \/ Vale.X64.QuickCodes.state_mod_eq m0 s s')
(ensures
Vale.X64.Qu... | {
"end_col": 50,
"end_line": 64,
"start_col": 2,
"start_line": 57
} |
Prims.Ghost | val wp_sound (#a:Type0) (cs:codes) (qcs:quickCodes a cs) (mods:mods_t) (k:va_state -> a -> Type0) (s0:va_state)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp cs qcs mods k s0)
(ensures fun (sN, fN, gN) ->
eval (Block cs) s0 fN sN /\ update_state_mods mods sN s0 == sN /\ state_inv sN /\ k sN gN... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec wp_sound #a cs qcs mods k s0 =
let qcs0 = qcs in
match qcs with
| QEmpty g ->
update_state_mods_refl mods s0;
let (sN, fN) = va_lemma_empty_total s0 [] in (sN, fN, g)
| QSeq _ _ qc qcs ->
let QProc _ _ wp1' proof = qc in
let c::cs = cs in
let k' = wp_Seq cs qcs mods k in
... | val wp_sound (#a:Type0) (cs:codes) (qcs:quickCodes a cs) (mods:mods_t) (k:va_state -> a -> Type0) (s0:va_state)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp cs qcs mods k s0)
(ensures fun (sN, fN, gN) ->
eval (Block cs) s0 fN sN /\ update_state_mods mods sN s0 == sN /\ state_inv sN /\ k sN gN... | false | null | false | let qcs0 = qcs in
match qcs with
| QEmpty g ->
update_state_mods_refl mods s0;
let sN, fN = va_lemma_empty_total s0 [] in
(sN, fN, g)
| QSeq _ _ qc qcs ->
let QProc _ _ wp1' proof = qc in
let c :: cs = cs in
let k' = wp_Seq cs qcs mods k in
let sM, fM, gM = proof s0 k' in
let sN, fN, gN = wp_sound cs qc... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.codes",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_l... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val wp_sound (#a:Type0) (cs:codes) (qcs:quickCodes a cs) (mods:mods_t) (k:va_state -> a -> Type0) (s0:va_state)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp cs qcs mods k s0)
(ensures fun (sN, fN, gN) ->
eval (Block cs) s0 fN sN /\ update_state_mods mods sN s0 == sN /\ state_inv sN /\ k sN gN... | [
"recursion"
] | Vale.X64.QuickCodes.wp_sound | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
cs: Vale.X64.QuickCodes.codes ->
qcs: Vale.X64.QuickCodes.quickCodes a cs ->
mods: Vale.X64.QuickCode.mods_t ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
s0: Vale.X64.Decls.va_state
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | {
"end_col": 31,
"end_line": 221,
"start_col": 38,
"start_line": 164
} |
Prims.Ghost | val va_wp_sound_code_norm (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:(s0':va_state{s0 == s0'}) -> va_state -> a -> Type0) :
Ghost (va_state & fuel & a)
(t_require s0 /\ normal (wp_sound_code_pre qc s0 k))
(wp_sound_code_post qc s0 k) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let va_wp_sound_code_norm #a c qc s0 k =
assert_normal (wp_sound_code_pre qc s0 k);
wp_sound_code_wrap c qc s0 k | val va_wp_sound_code_norm (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:(s0':va_state{s0 == s0'}) -> va_state -> a -> Type0) :
Ghost (va_state & fuel & a)
(t_require s0 /\ normal (wp_sound_code_pre qc s0 k))
(wp_sound_code_post qc s0 k)
let va_wp_sound_code_norm #a c qc s0 k = | false | null | false | assert_normal (wp_sound_code_pre qc s0 k);
wp_sound_code_wrap c qc s0 k | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Prims.eq2",
"Vale.X64.QuickCodes.wp_sound_code_wrap",
"Prims.unit",
"Vale.X64.QuickCodes.assert_normal",
"Vale.X64.QuickCodes.wp_sound_code_pre",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel"
] | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val va_wp_sound_code_norm (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:(s0':va_state{s0 == s0'}) -> va_state -> a -> Type0) :
Ghost (va_state & fuel & a)
(t_require s0 /\ normal (wp_sound_code_pre qc s0 k))
(wp_sound_code_post qc s0 k) | [] | Vale.X64.QuickCodes.va_wp_sound_code_norm | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
s0: Vale.X64.Decls.va_state ->
k: (s0': Vale.X64.Decls.va_state{s0 == s0'} -> _: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.QuickCodes.fuel) * a) | {
"end_col": 30,
"end_line": 354,
"start_col": 2,
"start_line": 353
} |
Prims.Ghost | val qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_stat... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec qWhile_proof_rec
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:vale_state -> a -> Type0)
(dec:vale_state -> a -> d) (s0 s1:vale_state) (g1:a) (f1:fuel) (k:vale_state -> a -> Type0)
: Ghost (vale_state & va_fuel & a)
(requires
state_inv s1 /\
wp_While b qc mods inv... | val qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_stat... | false | null | false | let ob = cmp_to_ocmp b in
let s1' = { s1 with vs_flags = havoc_flags } in
update_state_mods_to mods s1' s1;
update_state_mods_trans mods s0 s1 s1';
if eval_cmp s1 b
then
(let inv2 = wp_While_inv qc mods inv dec s1 g1 in
let wp = QProc?.wp (qc g1) in
let s2, f2 = va_lemma_whileTrue_total ob c s0 s1 f1 in
l... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
""
] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.fuel",
"Vale.X64.QuickCodes.eval_cmp",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCodes.qWhile_proof_rec",
... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_stat... | [
"recursion"
] | Vale.X64.QuickCodes.qWhile_proof_rec | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b: Vale.X64.QuickCodes.cmp ->
qc: (_: a -> Vale.X64.QuickCode.quickCode a c) ->
mods: Vale.X64.QuickCode.mods_t ->
inv: (_: Vale.X64.State.vale_state -> _: a -> Type0) ->
dec: (_: Vale.X64.State.vale_state -> _: a -> d) ->
s0: Vale.X64.State.vale_state ->
s1: Vale.X64.State.vale_state ->
... | {
"end_col": 3,
"end_line": 302,
"start_col": 3,
"start_line": 282
} |
Prims.Ghost | val qIf_proof (#a:Type) (#c1:code) (#c2:code) (b:cmp) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_If b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (IfElse (cmp_to_ocmp b) c1 c2) s0 f... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let qIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
( match b with
| Cmp_eq o1 o2 -> lemma_valid_cmp_eq s0 o1 o2; lemma_cmp_eq s0 o1 o2
| Cmp_ne o1 o2 -> lemma_valid_cmp_ne s0 o1 o2; lemma_cmp_ne s0 o1 o2
| Cmp_le o1 o2 -> lemma_valid_cmp_le s0 o1 o2; lemma_cmp_le s0 o1 o2
| Cmp_ge o1 o2 -> lemma_valid_cmp... | val qIf_proof (#a:Type) (#c1:code) (#c2:code) (b:cmp) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_If b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (IfElse (cmp_to_ocmp b) c1 c2) s0 f... | false | null | false | (match b with
| Cmp_eq o1 o2 ->
lemma_valid_cmp_eq s0 o1 o2;
lemma_cmp_eq s0 o1 o2
| Cmp_ne o1 o2 ->
lemma_valid_cmp_ne s0 o1 o2;
lemma_cmp_ne s0 o1 o2
| Cmp_le o1 o2 ->
lemma_valid_cmp_le s0 o1 o2;
lemma_cmp_le s0 o1 o2
| Cmp_ge o1 o2 ->
lemma_valid_cmp_ge s0 o1 o2;
lemma_cmp_ge... | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.eval_cmp",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickC... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val qIf_proof (#a:Type) (#c1:code) (#c2:code) (b:cmp) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_If b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (IfElse (cmp_to_ocmp b) c1 c2) s0 f... | [] | Vale.X64.QuickCodes.qIf_proof | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
b: Vale.X64.QuickCodes.cmp ->
qc1: Vale.X64.QuickCode.quickCode a c1 ->
qc2: Vale.X64.QuickCode.quickCode a c2 ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fue... | {
"end_col": 3,
"end_line": 266,
"start_col": 2,
"start_line": 241
} |
FStar.Pervasives.Lemma | val lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1))) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec lemma_regs_match_file (r0:Regs.t) (r1:Regs.t) (rf:reg_file_id) (k:nat{k <= n_regs rf}) : Lemma
(requires regs_match_file r0 r1 rf k)
(ensures (forall (i:nat).{:pattern (Reg rf i)} i < k ==>
(let r = Reg rf i in Regs.sel r r0 == Regs.sel r r1)))
=
if k > 0 then lemma_regs_match_file r0 r1 rf (k - 1) | val lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1)))
let rec lemma_regs_... | false | null | true | if k > 0 then lemma_regs_match_file r0 r1 rf (k - 1) | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.Regs.t",
"Vale.X64.Machine_s.reg_file_id",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Vale.X64.Machine_s.n_regs",
"Prims.op_GreaterThan",
"Vale.X64.QuickCodes.lemma_regs_match_file",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit",
"Vale.X64.QuickCodes.regs_match_file"... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1))) | [
"recursion"
] | Vale.X64.QuickCodes.lemma_regs_match_file | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
r0: Vale.X64.Regs.t ->
r1: Vale.X64.Regs.t ->
rf: Vale.X64.Machine_s.reg_file_id ->
k: Prims.nat{k <= Vale.X64.Machine_s.n_regs rf}
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.regs_match_file r0 r1 rf k)
(ensures
forall (i: Prims.nat). {:pattern Vale.X64.Machine_s.Reg rf i}
... | {
"end_col": 54,
"end_line": 326,
"start_col": 2,
"start_line": 326
} |
FStar.Pervasives.Lemma | val lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1))) | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | false | let rec lemma_regs_match (r0:Regs.t) (r1:Regs.t) (k:nat{k <= n_reg_files}) : Lemma
(requires regs_match r0 r1 k)
(ensures (forall (i j:nat).{:pattern (Reg i j)} i < k /\ j < n_regs i ==>
(let r = Reg i j in Regs.sel r r0 == Regs.sel r r1)))
=
if k > 0 then (lemma_regs_match_file r0 r1 (k - 1) (n_regs (k - 1... | val lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1)))
let rec lemma_regs_match ... | false | null | true | if k > 0
then
(lemma_regs_match_file r0 r1 (k - 1) (n_regs (k - 1));
lemma_regs_match r0 r1 (k - 1)) | {
"checked_file": "Vale.X64.QuickCodes.fst.checked",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
"lemma"
] | [
"Vale.X64.Regs.t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Vale.X64.Machine_s.n_reg_files",
"Prims.op_GreaterThan",
"Vale.X64.QuickCodes.lemma_regs_match",
"Prims.op_Subtraction",
"Prims.unit",
"Vale.X64.QuickCodes.lemma_regs_match_file",
"Vale.X64.Machine_s.n_regs",
"Prims.bool... | [] | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | false | false | Vale.X64.QuickCodes.fst | {
"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... | null | val lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1))) | [
"recursion"
] | Vale.X64.QuickCodes.lemma_regs_match | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | r0: Vale.X64.Regs.t -> r1: Vale.X64.Regs.t -> k: Prims.nat{k <= Vale.X64.Machine_s.n_reg_files}
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.regs_match r0 r1 k)
(ensures
forall (i: Prims.nat) (j: Prims.nat). {:pattern Vale.X64.Machine_s.Reg i j}
i < k /\ j < Vale.X64.Machine_s.n_reg... | {
"end_col": 102,
"end_line": 333,
"start_col": 2,
"start_line": 333
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test",
"short_module": null
},
{
"abbrev": false,
"full_m... | false | let supported_alg = a:hash_alg{ is_supported_alg a } | let supported_alg = | false | null | false | a: hash_alg{is_supported_alg a} | {
"checked_file": "Spec.HMAC_DRBG.Test.Vectors.fst.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.HMAC_DRBG.Test.Vectors.fst"
} | [
"total"
] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.HMAC_DRBG.Test.Vectors.is_supported_alg"
] | [] | module Spec.HMAC_DRBG.Test.Vectors
open Lib.Meta
open Spec.Hash.Definitions
#set-options "--fuel 0 --ifuel 0"
///
/// HMAC-DRBG test vectors from NIST CAVP
/// https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/random-number-generators#DRBG
///
let is_supported_alg = function
| SHA1 | SHA2_... | false | true | Spec.HMAC_DRBG.Test.Vectors.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val supported_alg : Type0 | [] | Spec.HMAC_DRBG.Test.Vectors.supported_alg | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.Test.Vectors.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 52,
"end_line": 17,
"start_col": 20,
"start_line": 17
} | |
Prims.Tot | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test",
"short_module": null
},
{
"abbrev": false,
"full_m... | false | let is_supported_alg = function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | let is_supported_alg = | false | null | false | function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | {
"checked_file": "Spec.HMAC_DRBG.Test.Vectors.fst.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.HMAC_DRBG.Test.Vectors.fst"
} | [
"total"
] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.bool"
] | [] | module Spec.HMAC_DRBG.Test.Vectors
open Lib.Meta
open Spec.Hash.Definitions
#set-options "--fuel 0 --ifuel 0"
///
/// HMAC-DRBG test vectors from NIST CAVP
/// https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/random-number-generators#DRBG
/// | false | true | Spec.HMAC_DRBG.Test.Vectors.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val is_supported_alg : _: Spec.Hash.Definitions.hash_alg -> Prims.bool | [] | Spec.HMAC_DRBG.Test.Vectors.is_supported_alg | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.Test.Vectors.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | _: Spec.Hash.Definitions.hash_alg -> Prims.bool | {
"end_col": 14,
"end_line": 15,
"start_col": 23,
"start_line": 13
} | |
Prims.Tot | val test_vectors:list vec | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test",
"short_module": null
},
{
"abbrev": false,
"full_m... | false | let test_vectors : list vec = [
{ a = SHA1;
entropy_input = "7cad65e5cc2888ae4e960f5d143c1425";
nonce = "fc0785db471cc55e";
personalization_string = "";
entropy_input_reseed = "66451d29cf65d899a281905ff9b29e87";
additional_input_reseed = "800d583b2560d2a2300132ee2d13f19f";
additional_input_1 =... | val test_vectors:list vec
let test_vectors:list vec = | false | null | false | [
{
a = SHA1;
entropy_input = "7cad65e5cc2888ae4e960f5d143c1425";
nonce = "fc0785db471cc55e";
personalization_string = "";
entropy_input_reseed = "66451d29cf65d899a281905ff9b29e87";
additional_input_reseed = "800d583b2560d2a2300132ee2d13f19f";
additional_input_1 = "42eae705c2225d212fa0554a... | {
"checked_file": "Spec.HMAC_DRBG.Test.Vectors.fst.checked",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.HMAC_DRBG.Test.Vectors.fst"
} | [
"total"
] | [
"Prims.Cons",
"Spec.HMAC_DRBG.Test.Vectors.vec",
"Spec.HMAC_DRBG.Test.Vectors.Mkvec",
"Spec.Hash.Definitions.SHA1",
"Spec.Hash.Definitions.SHA2_256",
"Spec.Hash.Definitions.SHA2_384",
"Spec.Hash.Definitions.SHA2_512",
"Prims.Nil"
] | [] | module Spec.HMAC_DRBG.Test.Vectors
open Lib.Meta
open Spec.Hash.Definitions
#set-options "--fuel 0 --ifuel 0"
///
/// HMAC-DRBG test vectors from NIST CAVP
/// https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/random-number-generators#DRBG
///
let is_supported_alg = function
| SHA1 | SHA2_... | false | true | Spec.HMAC_DRBG.Test.Vectors.fst | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val test_vectors:list vec | [] | Spec.HMAC_DRBG.Test.Vectors.test_vectors | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.Test.Vectors.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Prims.list Spec.HMAC_DRBG.Test.Vectors.vec | {
"end_col": 1,
"end_line": 312,
"start_col": 30,
"start_line": 31
} |
Prims.Tot | val ___UINT32BE:eqtype | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSta... | false | let ___UINT32BE : eqtype = U32.t | val ___UINT32BE:eqtype
let ___UINT32BE:eqtype = | false | null | false | U32.t | {
"checked_file": "EverParse3d.Prelude.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fst... | [
"total"
] | [
"FStar.UInt32.t"
] | [] | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | false | true | EverParse3d.Prelude.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | null | val ___UINT32BE:eqtype | [] | EverParse3d.Prelude.___UINT32BE | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | Prims.eqtype | {
"end_col": 32,
"end_line": 209,
"start_col": 27,
"start_line": 209
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.