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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Prims.Tot | val create4 (x0 x1 x2 x3: uint64) : list uint64 | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; x3] | val create4 (x0 x1 x2 x3: uint64) : list uint64
let create4 (x0 x1 x2 x3: uint64) : list uint64 = | false | null | false | [x0; x1; x2; x3] | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Lib.IntTypes.uint64",
"Prims.Cons",
"Prims.Nil",
"Prims.list"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0" | false | true | Hacl.Spec.P256.PrecompTable.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 create4 (x0 x1 x2 x3: uint64) : list uint64 | [] | Hacl.Spec.P256.PrecompTable.create4 | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
x0: Lib.IntTypes.uint64 ->
x1: Lib.IntTypes.uint64 ->
x2: Lib.IntTypes.uint64 ->
x3: Lib.IntTypes.uint64
-> Prims.list Lib.IntTypes.uint64 | {
"end_col": 65,
"end_line": 16,
"start_col": 49,
"start_line": 16
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let felem_list = x:list uint64{FL.length x == 4} | let felem_list = | false | null | false | x: list uint64 {FL.length x == 4} | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Prims.list",
"Lib.IntTypes.uint64",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 felem_list : Type0 | [] | Hacl.Spec.P256.PrecompTable.felem_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 48,
"end_line": 19,
"start_col": 17,
"start_line": 19
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let point_list = x:list uint64{FL.length x == 12} | let point_list = | false | null | false | x: list uint64 {FL.length x == 12} | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Prims.list",
"Lib.IntTypes.uint64",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 point_list : Type0 | [] | Hacl.Spec.P256.PrecompTable.point_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | Type0 | {
"end_col": 49,
"end_line": 21,
"start_col": 17,
"start_line": 21
} | |
Prims.Tot | val proj_point_to_list (p: S.proj_point) : point_list | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let proj_point_to_list (p:S.proj_point) : point_list =
[@inline_let] let (px, py, pz) = p in
[@inline_let] let pxM = SM.to_mont px in
[@inline_let] let pyM = SM.to_mont py in
[@inline_let] let pzM = SM.to_mont pz in
FL.(felem_to_list pxM @ felem_to_list pyM @ felem_to_list pzM) | val proj_point_to_list (p: S.proj_point) : point_list
let proj_point_to_list (p: S.proj_point) : point_list = | false | null | false | [@@ inline_let ]let px, py, pz = p in
[@@ inline_let ]let pxM = SM.to_mont px in
[@@ inline_let ]let pyM = SM.to_mont py in
[@@ inline_let ]let pzM = SM.to_mont pz in
let open FL in felem_to_list pxM @ felem_to_list pyM @ felem_to_list pzM | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Spec.P256.PointOps.proj_point",
"Prims.nat",
"FStar.List.Tot.Base.op_At",
"Lib.IntTypes.uint64",
"Hacl.Spec.P256.PrecompTable.felem_to_list",
"Spec.P256.PointOps.felem",
"Hacl.Spec.P256.Montgomery.to_mont",
"Hacl.Spec.P256.PrecompTable.point_list"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 proj_point_to_list (p: S.proj_point) : point_list | [] | Hacl.Spec.P256.PrecompTable.proj_point_to_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Spec.P256.PointOps.proj_point -> Hacl.Spec.P256.PrecompTable.point_list | {
"end_col": 64,
"end_line": 39,
"start_col": 2,
"start_line": 35
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let point_inv_list (p:point_list) =
let x = Seq.seq_of_list p <: lseq uint64 12 in
point_inv_seq x | let point_inv_list (p: point_list) = | false | null | false | let x = Seq.seq_of_list p <: lseq uint64 12 in
point_inv_seq x | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Hacl.Spec.P256.PrecompTable.point_list",
"Hacl.Impl.P256.Point.point_inv_seq",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.Seq.Properties.seq_of_list",
"Lib.IntTypes.uint64",
"Prims.logical"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 point_inv_list : p: Hacl.Spec.P256.PrecompTable.point_list -> Prims.logical | [] | Hacl.Spec.P256.PrecompTable.point_inv_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Spec.P256.PrecompTable.point_list -> Prims.logical | {
"end_col": 17,
"end_line": 44,
"start_col": 35,
"start_line": 42
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let point_eval_list (p:point_list) =
let x = Seq.seq_of_list p <: lseq uint64 12 in
from_mont_point (as_point_nat_seq x) | let point_eval_list (p: point_list) = | false | null | false | let x = Seq.seq_of_list p <: lseq uint64 12 in
from_mont_point (as_point_nat_seq x) | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Hacl.Spec.P256.PrecompTable.point_list",
"Hacl.Impl.P256.Point.from_mont_point",
"Hacl.Impl.P256.Point.as_point_nat_seq",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"FStar.Seq.Properties.seq_of_list",
"Lib.IntTypes.uint64",
"Spec.P256.PointOps.proj_point"
] | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 point_eval_list : p: Hacl.Spec.P256.PrecompTable.point_list -> Spec.P256.PointOps.proj_point | [] | Hacl.Spec.P256.PrecompTable.point_eval_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Spec.P256.PrecompTable.point_list -> Spec.P256.PointOps.proj_point | {
"end_col": 38,
"end_line": 49,
"start_col": 36,
"start_line": 47
} | |
Prims.Tot | val felem_to_list (x: S.felem) : felem_list | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FL"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_modul... | false | let felem_to_list (x:S.felem) : felem_list =
[@inline_let] let x0 = x % pow2 64 in
[@inline_let] let x1 = x / pow2 64 % pow2 64 in
[@inline_let] let x2 = x / pow2 128 % pow2 64 in
[@inline_let] let x3 = x / pow2 192 % pow2 64 in
[@inline_let] let r = create4 (u64 x0) (u64 x1) (u64 x2) (u64 x3) in
assert_nor... | val felem_to_list (x: S.felem) : felem_list
let felem_to_list (x: S.felem) : felem_list = | false | null | false | [@@ inline_let ]let x0 = x % pow2 64 in
[@@ inline_let ]let x1 = x / pow2 64 % pow2 64 in
[@@ inline_let ]let x2 = x / pow2 128 % pow2 64 in
[@@ inline_let ]let x3 = x / pow2 192 % pow2 64 in
[@@ inline_let ]let r = create4 (u64 x0) (u64 x1) (u64 x2) (u64 x3) in
assert_norm (FL.length r = 4);
r | {
"checked_file": "Hacl.Spec.P256.PrecompTable.fsti.checked",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Point.fsti.checked",
"FStar.Seq.fst.checked",
... | [
"total"
] | [
"Spec.P256.PointOps.felem",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot.Base.length",
"Lib.IntTypes.uint64",
"Prims.list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Hacl.Spec.P256.PrecompTable.create4",
"... | [] | module Hacl.Spec.P256.PrecompTable
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Impl.P256.Point
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module FL = FStar.List.Tot
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
unfold
let create4 (x0 x1 x2 x3:uint64) : list uint64 = [x0; x1; x2; ... | false | true | Hacl.Spec.P256.PrecompTable.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 felem_to_list (x: S.felem) : felem_list | [] | Hacl.Spec.P256.PrecompTable.felem_to_list | {
"file_name": "code/ecdsap256/Hacl.Spec.P256.PrecompTable.fsti",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | x: Spec.P256.PointOps.felem -> Hacl.Spec.P256.PrecompTable.felem_list | {
"end_col": 3,
"end_line": 31,
"start_col": 2,
"start_line": 25
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let mem_of #a #f (s:ordset a f) x = mem x s | let mem_of #a #f (s: ordset a f) x = | false | null | false | mem x s | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.mem",
"Prims.bool"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 mem_of : s: FStar.OrdSet.ordset a f -> x: a -> Prims.bool | [] | FStar.OrdSet.mem_of | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.OrdSet.ordset a f -> x: a -> Prims.bool | {
"end_col": 50,
"end_line": 45,
"start_col": 43,
"start_line": 45
} | |
Prims.Tot | val strict_superset (#a #f: _) (s1 s2: ordset a f) : Tot bool | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let strict_superset #a #f (s1 s2: ordset a f) : Tot bool = strict_subset s2 s1 | val strict_superset (#a #f: _) (s1 s2: ordset a f) : Tot bool
let strict_superset #a #f (s1: ordset a f) (s2: ordset a f) : Tot bool = | false | null | false | strict_subset s2 s1 | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.strict_subset",
"Prims.bool"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 strict_superset (#a #f: _) (s1 s2: ordset a f) : Tot bool | [] | FStar.OrdSet.strict_superset | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> Prims.bool | {
"end_col": 78,
"end_line": 88,
"start_col": 59,
"start_line": 88
} |
Prims.Tot | val superset (#a #f: _) (s1 s2: ordset a f) : Tot bool | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let superset #a #f (s1 s2: ordset a f) : Tot bool = subset s2 s1 | val superset (#a #f: _) (s1 s2: ordset a f) : Tot bool
let superset #a #f (s1: ordset a f) (s2: ordset a f) : Tot bool = | false | null | false | subset s2 s1 | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"FStar.OrdSet.subset",
"Prims.bool"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 superset (#a #f: _) (s1 s2: ordset a f) : Tot bool | [] | FStar.OrdSet.superset | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> Prims.bool | {
"end_col": 64,
"end_line": 81,
"start_col": 52,
"start_line": 81
} |
Prims.Tot | val equal (#a: eqtype) (#f: cmp a) (s1 s2: ordset a f) : Tot prop | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let equal (#a:eqtype) (#f:cmp a) (s1:ordset a f) (s2:ordset a f) : Tot prop =
forall x. mem #_ #f x s1 = mem #_ #f x s2 | val equal (#a: eqtype) (#f: cmp a) (s1 s2: ordset a f) : Tot prop
let equal (#a: eqtype) (#f: cmp a) (s1 s2: ordset a f) : Tot prop = | false | null | false | forall x. mem #_ #f x s1 = mem #_ #f x s2 | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.l_Forall",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.OrdSet.mem",
"Prims.prop"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 equal (#a: eqtype) (#f: cmp a) (s1 s2: ordset a f) : Tot prop | [] | FStar.OrdSet.equal | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> Prims.prop | {
"end_col": 43,
"end_line": 93,
"start_col": 2,
"start_line": 93
} |
Prims.Tot | val sorted (#a: eqtype) (f: cmp a) (l: list a) : Tot bool | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let rec sorted (#a:eqtype) (f:cmp a) (l:list a) : Tot bool =
match l with
| [] -> true
| x::[] -> true
| x::y::tl -> f x y && x <> y && sorted f (y::tl) | val sorted (#a: eqtype) (f: cmp a) (l: list a) : Tot bool
let rec sorted (#a: eqtype) (f: cmp a) (l: list a) : Tot bool = | false | null | false | match l with
| [] -> true
| x :: [] -> true
| x :: y :: tl -> f x y && x <> y && sorted f (y :: tl) | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"Prims.list",
"Prims.op_AmpAmp",
"Prims.op_disEquality",
"FStar.OrdSet.sorted",
"Prims.Cons",
"Prims.bool"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 sorted (#a: eqtype) (f: cmp a) (l: list a) : Tot bool | [
"recursion"
] | FStar.OrdSet.sorted | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | f: FStar.OrdSet.cmp a -> l: Prims.list a -> Prims.bool | {
"end_col": 51,
"end_line": 29,
"start_col": 2,
"start_line": 26
} |
Prims.Tot | val disjoint (#a #f: _) (s1 s2: ordset a f) : Tot bool | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let disjoint #a #f (s1 s2 : ordset a f) : Tot bool = intersect s1 s2 = empty | val disjoint (#a #f: _) (s1 s2: ordset a f) : Tot bool
let disjoint #a #f (s1: ordset a f) (s2: ordset a f) : Tot bool = | false | null | false | intersect s1 s2 = empty | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"Prims.eqtype",
"FStar.OrdSet.cmp",
"FStar.OrdSet.ordset",
"Prims.op_Equality",
"FStar.OrdSet.intersect",
"FStar.OrdSet.empty",
"Prims.bool"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 disjoint (#a #f: _) (s1 s2: ordset a f) : Tot bool | [] | FStar.OrdSet.disjoint | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s1: FStar.OrdSet.ordset a f -> s2: FStar.OrdSet.ordset a f -> Prims.bool | {
"end_col": 76,
"end_line": 90,
"start_col": 53,
"start_line": 90
} |
Prims.Tot | val inv (#a: _) (c: condition a) : (z: condition a {forall x. c x = not (z x)}) | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | false | let inv #a (c: condition a) : (z:condition a{forall x. c x = not (z x)}) = fun x -> not (c x) | val inv (#a: _) (c: condition a) : (z: condition a {forall x. c x = not (z x)})
let inv #a (c: condition a) : (z: condition a {forall x. c x = not (z x)}) = | false | null | false | fun x -> not (c x) | {
"checked_file": "FStar.OrdSet.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fi... | [
"total"
] | [
"FStar.OrdSet.condition",
"Prims.op_Negation",
"Prims.bool",
"Prims.l_Forall",
"Prims.b2t",
"Prims.op_Equality"
] | [] | (*
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.OrdSet.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 inv (#a: _) (c: condition a) : (z: condition a {forall x. c x = not (z x)}) | [] | FStar.OrdSet.inv | {
"file_name": "ulib/experimental/FStar.OrdSet.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | c: FStar.OrdSet.condition a
-> z: FStar.OrdSet.condition a {forall (x: a). c x = Prims.op_Negation (z x)} | {
"end_col": 93,
"end_line": 205,
"start_col": 75,
"start_line": 205
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_contains_element_from_second_argument_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (y: a).{:pattern union s1 s2; mem y s2}
mem y s2 ==> mem y (union s1 s2) | let union_contains_element_from_second_argument_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (y: a). {:pattern union s1 s2; mem y s2}
mem y s2 ==> mem y (union s1 s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.union"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_contains_element_from_second_argument_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_contains_element_from_second_argument_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 36,
"end_line": 270,
"start_col": 2,
"start_line": 269
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_fact =
forall (a: eqtype) (s: set a) (x: a) (o: a).{:pattern mem o (insert x s)}
mem o (insert x s) <==> o == x \/ mem o s | let insert_fact = | false | null | false | forall (a: eqtype) (s: set a) (x: a) (o: a). {:pattern mem o (insert x s)}
mem o (insert x s) <==> o == x \/ mem o s | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.insert",
"Prims.l_or",
"Prims.eq2"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 45,
"end_line": 207,
"start_col": 2,
"start_line": 206
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let empty_set_contains_no_elements_fact =
forall (a: eqtype) (o: a).{:pattern mem o (emptyset)} not (mem o (emptyset #a)) | let empty_set_contains_no_elements_fact = | false | null | false | forall (a: eqtype) (o: a). {:pattern mem o (emptyset)} not (mem o (emptyset #a)) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"Prims.b2t",
"Prims.op_Negation",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.emptyset"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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_set_contains_no_elements_fact : Prims.logical | [] | FStar.FiniteSet.Base.empty_set_contains_no_elements_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 81,
"end_line": 166,
"start_col": 2,
"start_line": 166
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_contains_argument_fact =
forall (a: eqtype) (s: set a) (x: a).{:pattern insert x s}
mem x (insert x s) | let insert_contains_argument_fact = | false | null | false | forall (a: eqtype) (s: set a) (x: a). {:pattern insert x s} mem x (insert x s) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.insert"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_contains_argument_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_contains_argument_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 22,
"end_line": 216,
"start_col": 2,
"start_line": 215
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let singleton_contains_fact =
forall (a: eqtype) (r: a) (o: a).{:pattern mem o (singleton r)} mem o (singleton r) <==> r == o | let singleton_contains_fact = | false | null | false | forall (a: eqtype) (r: a) (o: a). {:pattern mem o (singleton r)} mem o (singleton r) <==> r == o | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"Prims.l_iff",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.singleton",
"Prims.eq2"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 singleton_contains_fact : Prims.logical | [] | FStar.FiniteSet.Base.singleton_contains_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 97,
"end_line": 191,
"start_col": 2,
"start_line": 191
} | |
Prims.Tot | val remove (#a: eqtype) (x: a) (s: set a) : set a | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let remove (#a: eqtype) (x: a) (s: set a)
: set a =
difference s (singleton x) | val remove (#a: eqtype) (x: a) (s: set a) : set a
let remove (#a: eqtype) (x: a) (s: set a) : set a = | false | null | false | difference s (singleton x) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"FStar.FiniteSet.Base.difference",
"FStar.FiniteSet.Base.singleton"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | false | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 remove (#a: eqtype) (x: a) (s: set a) : set a | [] | FStar.FiniteSet.Base.remove | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> s: FStar.FiniteSet.Base.set a -> FStar.FiniteSet.Base.set a | {
"end_col": 28,
"end_line": 146,
"start_col": 2,
"start_line": 146
} |
Prims.Tot | val notin (#a: eqtype) (x: a) (s: set a) : bool | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let notin (#a: eqtype) (x: a) (s: set a)
: bool =
not (mem x s) | val notin (#a: eqtype) (x: a) (s: set a) : bool
let notin (#a: eqtype) (x: a) (s: set a) : bool = | false | null | false | not (mem x s) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.op_Negation",
"FStar.FiniteSet.Base.mem",
"Prims.bool"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | false | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 notin (#a: eqtype) (x: a) (s: set a) : bool | [] | FStar.FiniteSet.Base.notin | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | x: a -> s: FStar.FiniteSet.Base.set a -> Prims.bool | {
"end_col": 15,
"end_line": 150,
"start_col": 2,
"start_line": 150
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let length_zero_fact =
forall (a: eqtype) (s: set a).{:pattern cardinality s}
(cardinality s = 0 <==> s == emptyset)
/\ (cardinality s <> 0 <==> (exists x. mem x s)) | let length_zero_fact = | false | null | false | forall (a: eqtype) (s: set a). {:pattern cardinality s}
(cardinality s = 0 <==> s == emptyset) /\ (cardinality s <> 0 <==> (exists x. mem x s)) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_and",
"Prims.l_iff",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteSet.Base.cardinality",
"Prims.eq2",
"FStar.FiniteSet.Base.emptyset",
"Prims.op_disEquality",
"Prims.l_Exists",
"FStar.FiniteSet.Base.mem"
... | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 length_zero_fact : Prims.logical | [] | FStar.FiniteSet.Base.length_zero_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 52,
"end_line": 177,
"start_col": 2,
"start_line": 175
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_contains_fact =
forall (a: eqtype) (s: set a) (x: a) (y: a).{:pattern insert x s; mem y s}
mem y s ==> mem y (insert x s) | let insert_contains_fact = | false | null | false | forall (a: eqtype) (s: set a) (x: a) (y: a). {:pattern insert x s; mem y s}
mem y s ==> mem y (insert x s) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.insert"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_contains_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_contains_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 34,
"end_line": 225,
"start_col": 2,
"start_line": 224
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let intersection_cardinality_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern cardinality (intersection s1 s2)}
cardinality (union s1 s2) + cardinality (intersection s1 s2) = cardinality s1 + cardinality s2 | let intersection_cardinality_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern cardinality (intersection s1 s2)}
cardinality (union s1 s2) + cardinality (intersection s1 s2) = cardinality s1 + cardinality s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Addition",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteSet.Base.union",
"FStar.FiniteSet.Base.intersection"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 intersection_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.intersection_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 98,
"end_line": 335,
"start_col": 2,
"start_line": 334
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_of_disjoint_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern union s1 s2}
disjoint s1 s2 ==> difference (union s1 s2) s1 == s2 /\ difference (union s1 s2) s2 == s1 | let union_of_disjoint_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern union s1 s2}
disjoint s1 s2 ==> difference (union s1 s2) s1 == s2 /\ difference (union s1 s2) s2 == s1 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"FStar.FiniteSet.Base.disjoint",
"Prims.l_and",
"Prims.eq2",
"FStar.FiniteSet.Base.difference",
"FStar.FiniteSet.Base.union"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_of_disjoint_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_of_disjoint_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 93,
"end_line": 281,
"start_col": 2,
"start_line": 280
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let intersection_idempotent_right_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern intersection (intersection s1 s2) s2}
intersection (intersection s1 s2) s2 == intersection s1 s2 | let intersection_idempotent_right_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern intersection (intersection s1 s2) s2}
intersection (intersection s1 s2) s2 == intersection s1 s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.eq2",
"FStar.FiniteSet.Base.intersection"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 intersection_idempotent_right_fact : Prims.logical | [] | FStar.FiniteSet.Base.intersection_idempotent_right_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 62,
"end_line": 317,
"start_col": 2,
"start_line": 316
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_nonmember_cardinality_fact =
forall (a: eqtype) (s: set a) (x: a).{:pattern cardinality (insert x s)}
not (mem x s) ==> cardinality (insert x s) = cardinality s + 1 | let insert_nonmember_cardinality_fact = | false | null | false | forall (a: eqtype) (s: set a) (x: a). {:pattern cardinality (insert x s)}
not (mem x s) ==> cardinality (insert x s) = cardinality s + 1 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_Negation",
"FStar.FiniteSet.Base.mem",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteSet.Base.insert",
"Prims.op_Addition"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_nonmember_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_nonmember_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 66,
"end_line": 243,
"start_col": 2,
"start_line": 242
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_idempotent_right_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern union (union s1 s2) s2}
union (union s1 s2) s2 == union s1 s2 | let union_idempotent_right_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern union (union s1 s2) s2}
union (union s1 s2) s2 == union s1 s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.eq2",
"FStar.FiniteSet.Base.union"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_idempotent_right_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_idempotent_right_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 41,
"end_line": 299,
"start_col": 2,
"start_line": 298
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let intersection_contains_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (o: a).{:pattern mem o (intersection s1 s2)}
mem o (intersection s1 s2) <==> mem o s1 /\ mem o s2 | let intersection_contains_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (o: a). {:pattern mem o (intersection s1 s2)}
mem o (intersection s1 s2) <==> mem o s1 /\ mem o s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.intersection",
"Prims.l_and"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 intersection_contains_fact : Prims.logical | [] | FStar.FiniteSet.Base.intersection_contains_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 56,
"end_line": 290,
"start_col": 2,
"start_line": 289
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_contains_element_from_first_argument_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (y: a).{:pattern union s1 s2; mem y s1}
mem y s1 ==> mem y (union s1 s2) | let union_contains_element_from_first_argument_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (y: a). {:pattern union s1 s2; mem y s1}
mem y s1 ==> mem y (union s1 s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.union"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_contains_element_from_first_argument_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_contains_element_from_first_argument_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 36,
"end_line": 261,
"start_col": 2,
"start_line": 260
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_contains_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (o: a).{:pattern mem o (union s1 s2)}
mem o (union s1 s2) <==> mem o s1 \/ mem o s2 | let union_contains_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (o: a). {:pattern mem o (union s1 s2)}
mem o (union s1 s2) <==> mem o s1 \/ mem o s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.union",
"Prims.l_or"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_contains_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_contains_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 49,
"end_line": 252,
"start_col": 2,
"start_line": 251
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let intersection_idempotent_left_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern intersection s1 (intersection s1 s2)}
intersection s1 (intersection s1 s2) == intersection s1 s2 | let intersection_idempotent_left_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern intersection s1 (intersection s1 s2)}
intersection s1 (intersection s1 s2) == intersection s1 s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.eq2",
"FStar.FiniteSet.Base.intersection"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 intersection_idempotent_left_fact : Prims.logical | [] | FStar.FiniteSet.Base.intersection_idempotent_left_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 62,
"end_line": 326,
"start_col": 2,
"start_line": 325
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let union_idempotent_left_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern union s1 (union s1 s2)}
union s1 (union s1 s2) == union s1 s2 | let union_idempotent_left_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern union s1 (union s1 s2)}
union s1 (union s1 s2) == union s1 s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.eq2",
"FStar.FiniteSet.Base.union"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_idempotent_left_fact : Prims.logical | [] | FStar.FiniteSet.Base.union_idempotent_left_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 41,
"end_line": 308,
"start_col": 2,
"start_line": 307
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let difference_contains_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (o: a).{:pattern mem o (difference s1 s2)}
mem o (difference s1 s2) <==> mem o s1 /\ not (mem o s2) | let difference_contains_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (o: a). {:pattern mem o (difference s1 s2)}
mem o (difference s1 s2) <==> mem o s1 /\ not (mem o s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.difference",
"Prims.l_and",
"Prims.op_Negation"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 difference_contains_fact : Prims.logical | [] | FStar.FiniteSet.Base.difference_contains_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 60,
"end_line": 344,
"start_col": 2,
"start_line": 343
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let difference_doesnt_include_fact =
forall (a: eqtype) (s1: set a) (s2: set a) (y: a).{:pattern difference s1 s2; mem y s2}
mem y s2 ==> not (mem y (difference s1 s2)) | let difference_doesnt_include_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a) (y: a). {:pattern difference s1 s2; mem y s2}
mem y s2 ==> not (mem y (difference s1 s2)) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"Prims.op_Negation",
"FStar.FiniteSet.Base.difference"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 difference_doesnt_include_fact : Prims.logical | [] | FStar.FiniteSet.Base.difference_doesnt_include_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 47,
"end_line": 353,
"start_col": 2,
"start_line": 352
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let equal_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern equal s1 s2}
equal s1 s2 <==> (forall o.{:pattern mem o s1 \/ mem o s2} mem o s1 <==> mem o s2) | let equal_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern equal s1 s2}
equal s1 s2 <==> (forall o. {:pattern mem o s1\/mem o s2} mem o s1 <==> mem o s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"FStar.FiniteSet.Base.equal",
"Prims.b2t",
"FStar.FiniteSet.Base.mem"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 equal_fact : Prims.logical | [] | FStar.FiniteSet.Base.equal_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 86,
"end_line": 385,
"start_col": 2,
"start_line": 384
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_remove_fact =
forall (a: eqtype) (x: a) (s: set a).{:pattern insert x (remove x s)}
mem x s = true ==> insert x (remove x s) == s | let insert_remove_fact = | false | null | false | forall (a: eqtype) (x: a) (s: set a). {:pattern insert x (remove x s)}
mem x s = true ==> insert x (remove x s) == s | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.FiniteSet.Base.mem",
"Prims.eq2",
"FStar.FiniteSet.Base.insert",
"FStar.FiniteSet.Base.remove"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_remove_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_remove_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 49,
"end_line": 409,
"start_col": 2,
"start_line": 408
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let disjoint_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern disjoint s1 s2}
disjoint s1 s2 <==> (forall o.{:pattern mem o s1 \/ mem o s2} not (mem o s1) \/ not (mem o s2)) | let disjoint_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern disjoint s1 s2}
disjoint s1 s2 <==> (forall o. {:pattern mem o s1\/mem o s2} not (mem o s1) \/ not (mem o s2)) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"FStar.FiniteSet.Base.disjoint",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Negation",
"FStar.FiniteSet.Base.mem"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 disjoint_fact : Prims.logical | [] | FStar.FiniteSet.Base.disjoint_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 99,
"end_line": 403,
"start_col": 2,
"start_line": 402
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let subset_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern subset s1 s2}
subset s1 s2 <==> (forall o.{:pattern mem o s1 \/ mem o s2} mem o s1 ==> mem o s2) | let subset_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern subset s1 s2}
subset s1 s2 <==> (forall o. {:pattern mem o s1\/mem o s2} mem o s1 ==> mem o s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_iff",
"FStar.FiniteSet.Base.subset",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 subset_fact : Prims.logical | [] | FStar.FiniteSet.Base.subset_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 86,
"end_line": 376,
"start_col": 2,
"start_line": 375
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let equal_extensionality_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern equal s1 s2}
equal s1 s2 ==> s1 == s2 | let equal_extensionality_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern equal s1 s2} equal s1 s2 ==> s1 == s2 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"FStar.FiniteSet.Base.equal",
"Prims.eq2"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 equal_extensionality_fact : Prims.logical | [] | FStar.FiniteSet.Base.equal_extensionality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 28,
"end_line": 394,
"start_col": 2,
"start_line": 393
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let difference_cardinality_fact =
forall (a: eqtype) (s1: set a) (s2: set a).{:pattern cardinality (difference s1 s2)}
cardinality (difference s1 s2) + cardinality (difference s2 s1) + cardinality (intersection s1 s2) = cardinality (union s1 s2)
/\ cardinality (difference s1 s2) = cardinality s1 - cardinali... | let difference_cardinality_fact = | false | null | false | forall (a: eqtype) (s1: set a) (s2: set a). {:pattern cardinality (difference s1 s2)}
cardinality (difference s1 s2) + cardinality (difference s2 s1) + cardinality (intersection s1 s2) =
cardinality (union s1 s2) /\
cardinality (difference s1 s2) = cardinality s1 - cardinality (intersection s1 s2) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Addition",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteSet.Base.difference",
"FStar.FiniteSet.Base.intersection",
"FStar.FiniteSet.Base.union",
"Prims.op... | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 difference_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.difference_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 89,
"end_line": 367,
"start_col": 2,
"start_line": 365
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let singleton_contains_argument_fact =
forall (a: eqtype) (r: a).{:pattern singleton r} mem r (singleton r) | let singleton_contains_argument_fact = | false | null | false | forall (a: eqtype) (r: a). {:pattern singleton r} mem r (singleton r) | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteSet.Base.singleton"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 singleton_contains_argument_fact : Prims.logical | [] | FStar.FiniteSet.Base.singleton_contains_argument_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 70,
"end_line": 184,
"start_col": 2,
"start_line": 184
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let remove_insert_fact =
forall (a: eqtype) (x: a) (s: set a).{:pattern remove x (insert x s)}
mem x s = false ==> remove x (insert x s) == s | let remove_insert_fact = | false | null | false | forall (a: eqtype) (x: a) (s: set a). {:pattern remove x (insert x s)}
mem x s = false ==> remove x (insert x s) == s | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_Equality",
"Prims.bool",
"FStar.FiniteSet.Base.mem",
"Prims.eq2",
"FStar.FiniteSet.Base.remove",
"FStar.FiniteSet.Base.insert"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 remove_insert_fact : Prims.logical | [] | FStar.FiniteSet.Base.remove_insert_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 50,
"end_line": 413,
"start_col": 2,
"start_line": 412
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let all_finite_set_facts =
empty_set_contains_no_elements_fact
/\ length_zero_fact
/\ singleton_contains_argument_fact
/\ singleton_contains_fact
/\ singleton_cardinality_fact
/\ insert_fact
/\ insert_contains_argument_fact
/\ insert_contains_fact
/\ insert_member_cardinality_fact
/\ insert_nonmem... | let all_finite_set_facts = | false | null | false | empty_set_contains_no_elements_fact /\ length_zero_fact /\ singleton_contains_argument_fact /\
singleton_contains_fact /\ singleton_cardinality_fact /\ insert_fact /\
insert_contains_argument_fact /\ insert_contains_fact /\ insert_member_cardinality_fact /\
insert_nonmember_cardinality_fact /\ union_contains_fact /\
un... | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_and",
"FStar.FiniteSet.Base.empty_set_contains_no_elements_fact",
"FStar.FiniteSet.Base.length_zero_fact",
"FStar.FiniteSet.Base.singleton_contains_argument_fact",
"FStar.FiniteSet.Base.singleton_contains_fact",
"FStar.FiniteSet.Base.singleton_cardinality_fact",
"FStar.FiniteSet.Base.insert_fac... | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 all_finite_set_facts : Prims.logical | [] | FStar.FiniteSet.Base.all_finite_set_facts | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 33,
"end_line": 454,
"start_col": 4,
"start_line": 425
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let singleton_cardinality_fact =
forall (a: eqtype) (r: a).{:pattern cardinality (singleton r)} cardinality (singleton r) = 1 | let singleton_cardinality_fact = | false | null | false | forall (a: eqtype) (r: a). {:pattern cardinality (singleton r)} cardinality (singleton r) = 1 | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteSet.Base.singleton"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 singleton_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.singleton_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 94,
"end_line": 198,
"start_col": 2,
"start_line": 198
} | |
Prims.Tot | val list_nonrepeating (#a: eqtype) (xs: list a) : bool | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let rec list_nonrepeating (#a: eqtype) (xs: list a) : bool =
match xs with
| [] -> true
| hd :: tl -> not (FLT.mem hd tl) && list_nonrepeating tl | val list_nonrepeating (#a: eqtype) (xs: list a) : bool
let rec list_nonrepeating (#a: eqtype) (xs: list a) : bool = | false | null | false | match xs with
| [] -> true
| hd :: tl -> not (FLT.mem hd tl) && list_nonrepeating tl | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.eqtype",
"Prims.list",
"Prims.op_AmpAmp",
"Prims.op_Negation",
"FStar.List.Tot.Base.mem",
"FStar.FiniteSet.Base.list_nonrepeating",
"Prims.bool"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | false | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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_nonrepeating (#a: eqtype) (xs: list a) : bool | [
"recursion"
] | FStar.FiniteSet.Base.list_nonrepeating | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | xs: Prims.list a -> Prims.bool | {
"end_col": 59,
"end_line": 60,
"start_col": 2,
"start_line": 58
} |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let insert_member_cardinality_fact =
forall (a: eqtype) (s: set a) (x: a).{:pattern cardinality (insert x s)}
mem x s ==> cardinality (insert x s) = cardinality s | let insert_member_cardinality_fact = | false | null | false | forall (a: eqtype) (s: set a) (x: a). {:pattern cardinality (insert x s)}
mem x s ==> cardinality (insert x s) = cardinality s | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.l_imp",
"Prims.b2t",
"FStar.FiniteSet.Base.mem",
"Prims.op_Equality",
"Prims.nat",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteSet.Base.insert"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 insert_member_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.insert_member_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 56,
"end_line": 234,
"start_col": 2,
"start_line": 233
} | |
Prims.Tot | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "FLT"
},
{
"abbrev": false,
"full_module": "FStar.FunctionalExtensionality",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet",
"short_module": null
},
{
"abbrev": false,
... | false | let set_as_list_cardinality_fact =
forall (a: eqtype) (s: set a).{:pattern FLT.length (set_as_list s)}
FLT.length (set_as_list s) = cardinality s | let set_as_list_cardinality_fact = | false | null | false | forall (a: eqtype) (s: set a). {:pattern FLT.length (set_as_list s)}
FLT.length (set_as_list s) = cardinality s | {
"checked_file": "FStar.FiniteSet.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.FiniteSet.Base.fsti"
} | [
"total"
] | [
"Prims.l_Forall",
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.List.Tot.Base.length",
"FStar.FiniteSet.Base.set_as_list",
"FStar.FiniteSet.Base.cardinality"
] | [] | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | false | true | FStar.FiniteSet.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 set_as_list_cardinality_fact : Prims.logical | [] | FStar.FiniteSet.Base.set_as_list_cardinality_fact | {
"file_name": "ulib/FStar.FiniteSet.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | Prims.logical | {
"end_col": 46,
"end_line": 417,
"start_col": 2,
"start_line": 416
} | |
Prims.Tot | val struct_field' (l: struct_typ') : Tot eqtype | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let struct_field'
(l: struct_typ')
: Tot eqtype
= (s: string { List.Tot.mem s (List.Tot.map fst l) } ) | val struct_field' (l: struct_typ') : Tot eqtype
let struct_field' (l: struct_typ') : Tot eqtype = | false | null | false | (s: string{List.Tot.mem s (List.Tot.map fst l)}) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ'",
"Prims.string",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.tuple2",
"FStar.Pointer.Base.typ",
"FStar.Pervasives.Native.fst",
"Prims.eqtype"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 struct_field' (l: struct_typ') : Tot eqtype | [] | FStar.Pointer.Base.struct_field' | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ' -> Prims.eqtype | {
"end_col": 54,
"end_line": 84,
"start_col": 2,
"start_line": 84
} |
FStar.Pervasives.Lemma | val type_of_typ_struct (l: struct_typ)
: Lemma (type_of_typ (TStruct l) == struct l) [SMTPat (type_of_typ (TStruct l))] | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_typ_struct
(l: struct_typ)
: Lemma
(type_of_typ (TStruct l) == struct l)
[SMTPat (type_of_typ (TStruct l))]
= assert_norm (type_of_typ (TStruct l) == struct l) | val type_of_typ_struct (l: struct_typ)
: Lemma (type_of_typ (TStruct l) == struct l) [SMTPat (type_of_typ (TStruct l))]
let type_of_typ_struct (l: struct_typ)
: Lemma (type_of_typ (TStruct l) == struct l) [SMTPat (type_of_typ (TStruct l))] = | false | null | true | assert_norm (type_of_typ (TStruct l) == struct l) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Pointer.Base.type_of_typ",
"FStar.Pointer.Base.TStruct",
"FStar.Pointer.Base.struct",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prim... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_typ_struct (l: struct_typ)
: Lemma (type_of_typ (TStruct l) == struct l) [SMTPat (type_of_typ (TStruct l))] | [] | FStar.Pointer.Base.type_of_typ_struct | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ
-> FStar.Pervasives.Lemma
(ensures
FStar.Pointer.Base.type_of_typ (FStar.Pointer.Base.TStruct l) == FStar.Pointer.Base.struct l
) [SMTPat (FStar.Pointer.Base.type_of_typ (FStar.Pointer.Base.TStruct l))] | {
"end_col": 51,
"end_line": 282,
"start_col": 2,
"start_line": 282
} |
Prims.Tot | val pointer (t: typ) : Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let pointer (t: typ) : Tot Type0 = (p: npointer t { g_is_null p == false } ) | val pointer (t: typ) : Tot Type0
let pointer (t: typ) : Tot Type0 = | false | null | false | (p: npointer t {g_is_null p == false}) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.npointer",
"Prims.eq2",
"Prims.bool",
"FStar.Pointer.Base.g_is_null"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 pointer (t: typ) : Tot Type0 | [] | FStar.Pointer.Base.pointer | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | t: FStar.Pointer.Base.typ -> Type0 | {
"end_col": 76,
"end_line": 184,
"start_col": 35,
"start_line": 184
} |
Prims.Tot | val struct_field (l: struct_typ) : Tot eqtype | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let struct_field
(l: struct_typ)
: Tot eqtype
= struct_field' l.fields | val struct_field (l: struct_typ) : Tot eqtype
let struct_field (l: struct_typ) : Tot eqtype = | false | null | false | struct_field' l.fields | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct_field'",
"FStar.Pointer.Base.__proj__Mkstruct_typ__item__fields",
"Prims.eqtype"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 struct_field (l: struct_typ) : Tot eqtype | [] | FStar.Pointer.Base.struct_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ -> Prims.eqtype | {
"end_col": 24,
"end_line": 89,
"start_col": 2,
"start_line": 89
} |
Prims.Tot | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let union_field = struct_field | let union_field = | false | null | false | struct_field | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_field"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 union_field : l: FStar.Pointer.Base.struct_typ -> Prims.eqtype | [] | FStar.Pointer.Base.union_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ -> Prims.eqtype | {
"end_col": 30,
"end_line": 94,
"start_col": 18,
"start_line": 94
} | |
Prims.Tot | val type_of_struct_field (l: struct_typ) : Tot (struct_field l -> Tot Type0) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_struct_field
(l: struct_typ)
: Tot (struct_field l -> Tot Type0)
= type_of_struct_field' l (fun (x:typ{x << l}) -> type_of_typ x) | val type_of_struct_field (l: struct_typ) : Tot (struct_field l -> Tot Type0)
let type_of_struct_field (l: struct_typ) : Tot (struct_field l -> Tot Type0) = | false | null | false | type_of_struct_field' l (fun (x: typ{x << l}) -> type_of_typ x) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.type_of_struct_field'",
"FStar.Pointer.Base.typ",
"Prims.precedes",
"FStar.Pointer.Base.type_of_typ",
"FStar.Pointer.Base.struct_field"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_struct_field (l: struct_typ) : Tot (struct_field l -> Tot Type0) | [] | FStar.Pointer.Base.type_of_struct_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ -> _: FStar.Pointer.Base.struct_field l -> Type0 | {
"end_col": 64,
"end_line": 275,
"start_col": 2,
"start_line": 275
} |
Prims.Tot | val dfst_struct_field (s: struct_typ) (p: (x: struct_field s & type_of_struct_field s x))
: Tot string | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let dfst_struct_field
(s: struct_typ)
(p: (x: struct_field s & type_of_struct_field s x))
: Tot string
=
let (| f, _ |) = p in
f | val dfst_struct_field (s: struct_typ) (p: (x: struct_field s & type_of_struct_field s x))
: Tot string
let dfst_struct_field (s: struct_typ) (p: (x: struct_field s & type_of_struct_field s x))
: Tot string = | false | null | false | let (| f , _ |) = p in
f | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"Prims.dtuple2",
"FStar.Pointer.Base.struct_field",
"FStar.Pointer.Base.type_of_struct_field",
"Prims.string"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 dfst_struct_field (s: struct_typ) (p: (x: struct_field s & type_of_struct_field s x))
: Tot string | [] | FStar.Pointer.Base.dfst_struct_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
s: FStar.Pointer.Base.struct_typ ->
p:
Prims.dtuple2 (FStar.Pointer.Base.struct_field s)
(fun x -> FStar.Pointer.Base.type_of_struct_field s x)
-> Prims.string | {
"end_col": 3,
"end_line": 300,
"start_col": 1,
"start_line": 298
} |
Prims.Tot | val struct_literal (s: struct_typ) : Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let struct_literal (s: struct_typ) : Tot Type0 = list (x: struct_field s & type_of_struct_field s x) | val struct_literal (s: struct_typ) : Tot Type0
let struct_literal (s: struct_typ) : Tot Type0 = | false | null | false | list (x: struct_field s & type_of_struct_field s x) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"Prims.list",
"Prims.dtuple2",
"FStar.Pointer.Base.struct_field",
"FStar.Pointer.Base.type_of_struct_field"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 struct_literal (s: struct_typ) : Tot Type0 | [] | FStar.Pointer.Base.struct_literal | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Pointer.Base.struct_typ -> Type0 | {
"end_col": 100,
"end_line": 302,
"start_col": 49,
"start_line": 302
} |
FStar.Pervasives.Lemma | val type_of_typ_union (l: union_typ)
: Lemma (type_of_typ (TUnion l) == union l) [SMTPat (type_of_typ (TUnion l))] | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_typ_union
(l: union_typ)
: Lemma
(type_of_typ (TUnion l) == union l)
[SMTPat (type_of_typ (TUnion l))]
= assert_norm (type_of_typ (TUnion l) == union l) | val type_of_typ_union (l: union_typ)
: Lemma (type_of_typ (TUnion l) == union l) [SMTPat (type_of_typ (TUnion l))]
let type_of_typ_union (l: union_typ)
: Lemma (type_of_typ (TUnion l) == union l) [SMTPat (type_of_typ (TUnion l))] = | false | null | true | assert_norm (type_of_typ (TUnion l) == union l) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma"
] | [
"FStar.Pointer.Base.union_typ",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Pointer.Base.type_of_typ",
"FStar.Pointer.Base.TUnion",
"FStar.Pointer.Base.union",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.N... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_typ_union (l: union_typ)
: Lemma (type_of_typ (TUnion l) == union l) [SMTPat (type_of_typ (TUnion l))] | [] | FStar.Pointer.Base.type_of_typ_union | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.union_typ
-> FStar.Pervasives.Lemma
(ensures
FStar.Pointer.Base.type_of_typ (FStar.Pointer.Base.TUnion l) == FStar.Pointer.Base.union l)
[SMTPat (FStar.Pointer.Base.type_of_typ (FStar.Pointer.Base.TUnion l))] | {
"end_col": 49,
"end_line": 357,
"start_col": 2,
"start_line": 357
} |
Prims.GTot | val modifies_0 (h0 h1: HS.mem) : GTot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let modifies_0 (h0 h1: HS.mem) : GTot Type0 =
modifies loc_none h0 h1 | val modifies_0 (h0 h1: HS.mem) : GTot Type0
let modifies_0 (h0 h1: HS.mem) : GTot Type0 = | false | null | false | modifies loc_none h0 h1 | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"sometrivial"
] | [
"FStar.Monotonic.HyperStack.mem",
"FStar.Pointer.Base.modifies",
"FStar.Pointer.Base.loc_none"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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_0 (h0 h1: HS.mem) : GTot Type0 | [] | FStar.Pointer.Base.modifies_0 | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0 | {
"end_col": 25,
"end_line": 2066,
"start_col": 2,
"start_line": 2066
} |
Prims.GTot | val modifies_1 (#t: typ) (p: pointer t) (h0 h1: HS.mem) : GTot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let modifies_1 (#t: typ) (p: pointer t) (h0 h1: HS.mem) : GTot Type0 =
modifies (loc_pointer p) h0 h1 | val modifies_1 (#t: typ) (p: pointer t) (h0 h1: HS.mem) : GTot Type0
let modifies_1 (#t: typ) (p: pointer t) (h0 h1: HS.mem) : GTot Type0 = | false | null | false | modifies (loc_pointer p) h0 h1 | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"sometrivial"
] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.pointer",
"FStar.Monotonic.HyperStack.mem",
"FStar.Pointer.Base.modifies",
"FStar.Pointer.Base.loc_pointer"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 (#t: typ) (p: pointer t) (h0 h1: HS.mem) : GTot Type0 | [] | FStar.Pointer.Base.modifies_1 | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
p: FStar.Pointer.Base.pointer t ->
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Type0 | {
"end_col": 32,
"end_line": 2069,
"start_col": 2,
"start_line": 2069
} |
Prims.Tot | val typ_of_union_field (l: union_typ) (f: union_field l) : Tot (t: typ{t << l}) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let typ_of_union_field
(l: union_typ)
(f: union_field l)
: Tot (t: typ {t << l})
= typ_of_struct_field l f | val typ_of_union_field (l: union_typ) (f: union_field l) : Tot (t: typ{t << l})
let typ_of_union_field (l: union_typ) (f: union_field l) : Tot (t: typ{t << l}) = | false | null | false | typ_of_struct_field l f | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.union_typ",
"FStar.Pointer.Base.union_field",
"FStar.Pointer.Base.typ_of_struct_field",
"FStar.Pointer.Base.typ",
"Prims.precedes"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 typ_of_union_field (l: union_typ) (f: union_field l) : Tot (t: typ{t << l}) | [] | FStar.Pointer.Base.typ_of_union_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.union_typ -> f: FStar.Pointer.Base.union_field l
-> t: FStar.Pointer.Base.typ{t << l} | {
"end_col": 25,
"end_line": 122,
"start_col": 2,
"start_line": 122
} |
Prims.Tot | val typ_of_struct_field' (l: struct_typ') (f: struct_field' l) : Tot (t: typ{t << l}) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let typ_of_struct_field'
(l: struct_typ')
(f: struct_field' l)
: Tot (t: typ {t << l})
= List.Tot.assoc_mem f l;
let y = Some?.v (List.Tot.assoc f l) in
List.Tot.assoc_precedes f l y;
y | val typ_of_struct_field' (l: struct_typ') (f: struct_field' l) : Tot (t: typ{t << l})
let typ_of_struct_field' (l: struct_typ') (f: struct_field' l) : Tot (t: typ{t << l}) = | false | null | false | List.Tot.assoc_mem f l;
let y = Some?.v (List.Tot.assoc f l) in
List.Tot.assoc_precedes f l y;
y | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ'",
"FStar.Pointer.Base.struct_field'",
"Prims.unit",
"FStar.List.Tot.Properties.assoc_precedes",
"Prims.string",
"FStar.Pointer.Base.typ",
"FStar.Pervasives.Native.__proj__Some__item__v",
"FStar.List.Tot.Base.assoc",
"FStar.List.Tot.Properties.assoc_mem",
"Prims.prec... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 typ_of_struct_field' (l: struct_typ') (f: struct_field' l) : Tot (t: typ{t << l}) | [] | FStar.Pointer.Base.typ_of_struct_field' | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ' -> f: FStar.Pointer.Base.struct_field' l
-> t: FStar.Pointer.Base.typ{t << l} | {
"end_col": 3,
"end_line": 107,
"start_col": 2,
"start_line": 104
} |
Prims.Tot | val typ_of_struct_field (l: struct_typ) (f: struct_field l) : Tot (t: typ{t << l}) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let typ_of_struct_field
(l: struct_typ)
(f: struct_field l)
: Tot (t: typ {t << l})
= typ_of_struct_field' l.fields f | val typ_of_struct_field (l: struct_typ) (f: struct_field l) : Tot (t: typ{t << l})
let typ_of_struct_field (l: struct_typ) (f: struct_field l) : Tot (t: typ{t << l}) = | false | null | false | typ_of_struct_field' l.fields f | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct_field",
"FStar.Pointer.Base.typ_of_struct_field'",
"FStar.Pointer.Base.__proj__Mkstruct_typ__item__fields",
"FStar.Pointer.Base.typ",
"Prims.precedes"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 typ_of_struct_field (l: struct_typ) (f: struct_field l) : Tot (t: typ{t << l}) | [] | FStar.Pointer.Base.typ_of_struct_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ -> f: FStar.Pointer.Base.struct_field l
-> t: FStar.Pointer.Base.typ{t << l} | {
"end_col": 33,
"end_line": 113,
"start_col": 2,
"start_line": 113
} |
Prims.Tot | val type_of_struct_field''
(l: struct_typ')
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field' l)
: Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_struct_field''
(l: struct_typ')
(type_of_typ: (
(t: typ { t << l } ) ->
Tot Type0
))
(f: struct_field' l)
: Tot Type0 =
List.Tot.assoc_mem f l;
let y = typ_of_struct_field' l f in
List.Tot.assoc_precedes f l y;
type_of_typ y | val type_of_struct_field''
(l: struct_typ')
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field' l)
: Tot Type0
let type_of_struct_field''
(l: struct_typ')
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field' l)
: Tot Type0 = | false | null | false | List.Tot.assoc_mem f l;
let y = typ_of_struct_field' l f in
List.Tot.assoc_precedes f l y;
type_of_typ y | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ'",
"FStar.Pointer.Base.typ",
"Prims.precedes",
"FStar.Pointer.Base.struct_field'",
"Prims.unit",
"FStar.List.Tot.Properties.assoc_precedes",
"Prims.string",
"FStar.Pointer.Base.typ_of_struct_field'",
"FStar.List.Tot.Properties.assoc_mem"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_struct_field''
(l: struct_typ')
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field' l)
: Tot Type0 | [] | FStar.Pointer.Base.type_of_struct_field'' | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
l: FStar.Pointer.Base.struct_typ' ->
type_of_typ: (t: FStar.Pointer.Base.typ{t << l} -> Type0) ->
f: FStar.Pointer.Base.struct_field' l
-> Type0 | {
"end_col": 15,
"end_line": 229,
"start_col": 2,
"start_line": 226
} |
Prims.Tot | val type_of_struct_field'
(l: struct_typ)
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field l)
: Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_struct_field'
(l: struct_typ)
(type_of_typ: (
(t: typ { t << l } ) ->
Tot Type0
))
(f: struct_field l)
: Tot Type0
= type_of_struct_field'' l.fields type_of_typ f | val type_of_struct_field'
(l: struct_typ)
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field l)
: Tot Type0
let type_of_struct_field'
(l: struct_typ)
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field l)
: Tot Type0 = | false | null | false | type_of_struct_field'' l.fields type_of_typ f | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.typ",
"Prims.precedes",
"FStar.Pointer.Base.struct_field",
"FStar.Pointer.Base.type_of_struct_field''",
"FStar.Pointer.Base.__proj__Mkstruct_typ__item__fields"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_struct_field'
(l: struct_typ)
(type_of_typ: (t: typ{t << l} -> Tot Type0))
(f: struct_field l)
: Tot Type0 | [] | FStar.Pointer.Base.type_of_struct_field' | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
l: FStar.Pointer.Base.struct_typ ->
type_of_typ: (t: FStar.Pointer.Base.typ{t << l} -> Type0) ->
f: FStar.Pointer.Base.struct_field l
-> Type0 | {
"end_col": 47,
"end_line": 240,
"start_col": 2,
"start_line": 240
} |
Prims.Tot | val type_of_base_typ (t: base_typ) : Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let type_of_base_typ
(t: base_typ)
: Tot Type0
= match t with
| TUInt -> nat
| TUInt8 -> FStar.UInt8.t
| TUInt16 -> FStar.UInt16.t
| TUInt32 -> FStar.UInt32.t
| TUInt64 -> FStar.UInt64.t
| TInt -> int
| TInt8 -> FStar.Int8.t
| TInt16 -> FStar.Int16.t
| TInt32 -> FStar.Int32.t
| TInt64 -> FStar.Int... | val type_of_base_typ (t: base_typ) : Tot Type0
let type_of_base_typ (t: base_typ) : Tot Type0 = | false | null | false | match t with
| TUInt -> nat
| TUInt8 -> FStar.UInt8.t
| TUInt16 -> FStar.UInt16.t
| TUInt32 -> FStar.UInt32.t
| TUInt64 -> FStar.UInt64.t
| TInt -> int
| TInt8 -> FStar.Int8.t
| TInt16 -> FStar.Int16.t
| TInt32 -> FStar.Int32.t
| TInt64 -> FStar.Int64.t
| TChar -> FStar.Char.char
| TBool -> bool
| TUnit -> unit | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.base_typ",
"Prims.nat",
"FStar.UInt8.t",
"FStar.UInt16.t",
"FStar.UInt32.t",
"FStar.UInt64.t",
"Prims.int",
"FStar.Int8.t",
"FStar.Int16.t",
"FStar.Int32.t",
"FStar.Int64.t",
"FStar.Char.char",
"Prims.bool",
"Prims.unit"
] | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_base_typ (t: base_typ) : Tot Type0 | [] | FStar.Pointer.Base.type_of_base_typ | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | t: FStar.Pointer.Base.base_typ -> Type0 | {
"end_col": 17,
"end_line": 213,
"start_col": 2,
"start_line": 200
} |
Prims.Tot | val struct_literal_wf (s: struct_typ) (l: struct_literal s) : Tot bool | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let struct_literal_wf (s: struct_typ) (l: struct_literal s) : Tot bool =
List.Tot.sortWith FStar.String.compare (List.Tot.map fst s.fields) =
List.Tot.sortWith FStar.String.compare
(List.Tot.map (dfst_struct_field s) l) | val struct_literal_wf (s: struct_typ) (l: struct_literal s) : Tot bool
let struct_literal_wf (s: struct_typ) (l: struct_literal s) : Tot bool = | false | null | false | List.Tot.sortWith FStar.String.compare (List.Tot.map fst s.fields) =
List.Tot.sortWith FStar.String.compare (List.Tot.map (dfst_struct_field s) l) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct_literal",
"Prims.op_Equality",
"Prims.list",
"Prims.string",
"FStar.List.Tot.Base.sortWith",
"FStar.String.compare",
"FStar.List.Tot.Base.map",
"FStar.Pervasives.Native.tuple2",
"FStar.Pointer.Base.typ",
"FStar.Pervasives.Native.fst",
... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 struct_literal_wf (s: struct_typ) (l: struct_literal s) : Tot bool | [] | FStar.Pointer.Base.struct_literal_wf | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Pointer.Base.struct_typ -> l: FStar.Pointer.Base.struct_literal s -> Prims.bool | {
"end_col": 42,
"end_line": 307,
"start_col": 2,
"start_line": 305
} |
Prims.Tot | val type_of_typ (t: typ) : Tot Type0 | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let rec type_of_typ
(t: typ)
: Tot Type0
= match t with
| TBase b -> type_of_base_typ b
| TStruct l ->
struct l
| TUnion l ->
union l
| TArray length t ->
array length (type_of_typ t)
| TPointer t ->
pointer t
| TNPointer t ->
npointer t
| TBuffer t ->
buffer t | val type_of_typ (t: typ) : Tot Type0
let rec type_of_typ (t: typ) : Tot Type0 = | false | null | false | match t with
| TBase b -> type_of_base_typ b
| TStruct l -> struct l
| TUnion l -> union l
| TArray length t -> array length (type_of_typ t)
| TPointer t -> pointer t
| TNPointer t -> npointer t
| TBuffer t -> buffer t | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"total"
] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.base_typ",
"FStar.Pointer.Base.type_of_base_typ",
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct",
"FStar.Pointer.Base.union",
"FStar.Pointer.Base.array_length_t",
"FStar.Pointer.Base.array",
"FStar.Pointer.Base.type_of_typ",
"FStar.Pointe... | [] | (*
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 | true | FStar.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 type_of_typ (t: typ) : Tot Type0 | [
"recursion"
] | FStar.Pointer.Base.type_of_typ | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | t: FStar.Pointer.Base.typ -> Type0 | {
"end_col": 12,
"end_line": 262,
"start_col": 2,
"start_line": 249
} |
Prims.Pure | val struct_create (s: struct_typ) (l: struct_literal s)
: Pure (struct s)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True)) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let struct_create
(s: struct_typ)
(l: struct_literal s)
: Pure (struct s)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True))
= struct_create_fun s (fun_of_list s l) | val struct_create (s: struct_typ) (l: struct_literal s)
: Pure (struct s)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True))
let struct_create (s: struct_typ) (l: struct_literal s)
: Pure (struct s)
(requires (normalize_term (struct_literal_wf s l) == true))
... | false | null | false | struct_create_fun s (fun_of_list s l) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct_literal",
"FStar.Pointer.Base.struct_create_fun",
"FStar.Pointer.Base.fun_of_list",
"FStar.Pointer.Base.struct",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.normalize_term",
"FStar.Pointer.Base.struct_literal_wf",
"Prims.l_True"
] | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 struct_create (s: struct_typ) (l: struct_literal s)
: Pure (struct s)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True)) | [] | FStar.Pointer.Base.struct_create | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | s: FStar.Pointer.Base.struct_typ -> l: FStar.Pointer.Base.struct_literal s
-> Prims.Pure (FStar.Pointer.Base.struct s) | {
"end_col": 39,
"end_line": 342,
"start_col": 2,
"start_line": 342
} |
FStar.Pervasives.Lemma | val typ_depth_typ_of_struct_field (l: struct_typ') (f: struct_field' l)
: Lemma (ensures (typ_depth (typ_of_struct_field' l f) <= struct_typ_depth l)) (decreases l) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let rec typ_depth_typ_of_struct_field
(l: struct_typ')
(f: struct_field' l)
: Lemma
(ensures (typ_depth (typ_of_struct_field' l f) <= struct_typ_depth l))
(decreases l)
= let ((f', _) :: l') = l in
if f = f'
then ()
else begin
let f: string = f in
assert (List.Tot.mem f (List.Tot.map fst l'));
... | val typ_depth_typ_of_struct_field (l: struct_typ') (f: struct_field' l)
: Lemma (ensures (typ_depth (typ_of_struct_field' l f) <= struct_typ_depth l)) (decreases l)
let rec typ_depth_typ_of_struct_field (l: struct_typ') (f: struct_field' l)
: Lemma (ensures (typ_depth (typ_of_struct_field' l f) <= struct_typ_de... | false | null | true | let (f', _) :: l' = l in
if f = f'
then ()
else
let f:string = f in
assert (List.Tot.mem f (List.Tot.map fst l'));
List.Tot.assoc_mem f l';
typ_depth_typ_of_struct_field l' f | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma",
""
] | [
"FStar.Pointer.Base.struct_typ'",
"FStar.Pointer.Base.struct_field'",
"Prims.string",
"FStar.Pointer.Base.typ",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Equality",
"Prims.bool",
"FStar.Pointer.Base.typ_depth_typ_of_struct_field",
"Prims.unit",
"FStar.List.Tot.Properties.assoc_me... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 typ_depth_typ_of_struct_field (l: struct_typ') (f: struct_field' l)
: Lemma (ensures (typ_depth (typ_of_struct_field' l f) <= struct_typ_depth l)) (decreases l) | [
"recursion"
] | FStar.Pointer.Base.typ_depth_typ_of_struct_field | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.struct_typ' -> f: FStar.Pointer.Base.struct_field' l
-> FStar.Pervasives.Lemma
(ensures
FStar.Pointer.Base.typ_depth (FStar.Pointer.Base.typ_of_struct_field' l f) <=
FStar.Pointer.Base.struct_typ_depth l) (decreases l) | {
"end_col": 5,
"end_line": 157,
"start_col": 1,
"start_line": 149
} |
Prims.Pure | val fun_of_list (s: struct_typ) (l: struct_literal s) (f: struct_field s)
: Pure (type_of_struct_field s f)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True)) | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let fun_of_list
(s: struct_typ)
(l: struct_literal s)
(f: struct_field s)
: Pure (type_of_struct_field s f)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True))
=
let f' : string = f in
let phi (p: (x: struct_field s & type_of_struct_field s x)) : Tot bool =
dfst_struc... | val fun_of_list (s: struct_typ) (l: struct_literal s) (f: struct_field s)
: Pure (type_of_struct_field s f)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True))
let fun_of_list (s: struct_typ) (l: struct_literal s) (f: struct_field s)
: Pure (type_of_struct_field s f... | false | null | false | let f':string = f in
let phi (p: (x: struct_field s & type_of_struct_field s x)) : Tot bool =
dfst_struct_field s p = f'
in
match List.Tot.find phi l with
| Some p ->
let (| _ , v |) = p in
v
| _ ->
List.Tot.sortWith_permutation FStar.String.compare (List.Tot.map fst s.fields);
List.Tot.sortWith_permutation F... | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [] | [
"FStar.Pointer.Base.struct_typ",
"FStar.Pointer.Base.struct_literal",
"FStar.Pointer.Base.struct_field",
"FStar.List.Tot.Base.find",
"Prims.dtuple2",
"FStar.Pointer.Base.type_of_struct_field",
"Prims.b2t",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.false_elim",
"Prims.unit",
"FStar.Clas... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 fun_of_list (s: struct_typ) (l: struct_literal s) (f: struct_field s)
: Pure (type_of_struct_field s f)
(requires (normalize_term (struct_literal_wf s l) == true))
(ensures (fun _ -> True)) | [] | FStar.Pointer.Base.fun_of_list | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} |
s: FStar.Pointer.Base.struct_typ ->
l: FStar.Pointer.Base.struct_literal s ->
f: FStar.Pointer.Base.struct_field s
-> Prims.Pure (FStar.Pointer.Base.type_of_struct_field s f) | {
"end_col": 17,
"end_line": 332,
"start_col": 1,
"start_line": 316
} |
FStar.Pervasives.Lemma | val loc_disjoint_gpointer_of_buffer_cell_r (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint l (loc_buffer b)))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint l (loc_pointer (gpointer_of_buffer_cell b ... | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let loc_disjoint_gpointer_of_buffer_cell_r
(l: loc)
(#t: typ)
(b: buffer t)
(i: UInt32.t)
: Lemma
(requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint l (loc_buffer b)))
(ensures (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint l (loc_pointer (gpointer_of_buffer_cell b i))))
[SMTPat ... | val loc_disjoint_gpointer_of_buffer_cell_r (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint l (loc_buffer b)))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint l (loc_pointer (gpointer_of_buffer_cell b ... | false | null | true | loc_disjoint_includes l (loc_buffer b) l (loc_pointer (gpointer_of_buffer_cell b i)) | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma"
] | [
"FStar.Pointer.Base.loc",
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.buffer",
"FStar.UInt32.t",
"FStar.Pointer.Base.loc_disjoint_includes",
"FStar.Pointer.Base.loc_buffer",
"FStar.Pointer.Base.loc_pointer",
"FStar.Pointer.Base.gpointer_of_buffer_cell",
"Prims.unit",
"Prims.l_and",
"Prims.b2t"... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 loc_disjoint_gpointer_of_buffer_cell_r (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint l (loc_buffer b)))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint l (loc_pointer (gpointer_of_buffer_cell b ... | [] | FStar.Pointer.Base.loc_disjoint_gpointer_of_buffer_cell_r | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.loc -> b: FStar.Pointer.Base.buffer t -> i: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires
FStar.UInt32.v i < FStar.UInt32.v (FStar.Pointer.Base.buffer_length b) /\
FStar.Pointer.Base.loc_disjoint l (FStar.Pointer.Base.loc_buffer b))
(ensures
FStar.UInt32.... | {
"end_col": 86,
"end_line": 1905,
"start_col": 2,
"start_line": 1905
} |
FStar.Pervasives.Lemma | val loc_disjoint_gpointer_of_buffer_cell_l (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint (loc_buffer b) l))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint (loc_pointer (gpointer_of_buffer_cell b i)... | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let loc_disjoint_gpointer_of_buffer_cell_l
(l: loc)
(#t: typ)
(b: buffer t)
(i: UInt32.t)
: Lemma
(requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint (loc_buffer b) l))
(ensures (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint (loc_pointer (gpointer_of_buffer_cell b i)) l))
[SMTPat ... | val loc_disjoint_gpointer_of_buffer_cell_l (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint (loc_buffer b) l))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint (loc_pointer (gpointer_of_buffer_cell b i)... | false | null | true | loc_disjoint_includes (loc_buffer b) l (loc_pointer (gpointer_of_buffer_cell b i)) l | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma"
] | [
"FStar.Pointer.Base.loc",
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.buffer",
"FStar.UInt32.t",
"FStar.Pointer.Base.loc_disjoint_includes",
"FStar.Pointer.Base.loc_buffer",
"FStar.Pointer.Base.loc_pointer",
"FStar.Pointer.Base.gpointer_of_buffer_cell",
"Prims.unit",
"Prims.l_and",
"Prims.b2t"... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 loc_disjoint_gpointer_of_buffer_cell_l (l: loc) (#t: typ) (b: buffer t) (i: UInt32.t)
: Lemma (requires (UInt32.v i < UInt32.v (buffer_length b) /\ loc_disjoint (loc_buffer b) l))
(ensures
(UInt32.v i < UInt32.v (buffer_length b) /\
loc_disjoint (loc_pointer (gpointer_of_buffer_cell b i)... | [] | FStar.Pointer.Base.loc_disjoint_gpointer_of_buffer_cell_l | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | l: FStar.Pointer.Base.loc -> b: FStar.Pointer.Base.buffer t -> i: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires
FStar.UInt32.v i < FStar.UInt32.v (FStar.Pointer.Base.buffer_length b) /\
FStar.Pointer.Base.loc_disjoint (FStar.Pointer.Base.loc_buffer b) l)
(ensures
FStar.UInt32.... | {
"end_col": 86,
"end_line": 1916,
"start_col": 2,
"start_line": 1916
} |
FStar.Pervasives.Lemma | val gpointer_of_buffer_cell_gsub_buffer' (#t: typ) (b: buffer t) (i1 len i2: UInt32.t)
: Lemma
(requires
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v len))
(ensures
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v ... | [
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST // for := , !",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbr... | false | let gpointer_of_buffer_cell_gsub_buffer'
(#t: typ)
(b: buffer t)
(i1: UInt32.t)
(len: UInt32.t)
(i2: UInt32.t)
: Lemma
(requires (
UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\
UInt32.v i2 < UInt32.v len
))
(ensures (
UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\
... | val gpointer_of_buffer_cell_gsub_buffer' (#t: typ) (b: buffer t) (i1 len i2: UInt32.t)
: Lemma
(requires
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v len))
(ensures
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v ... | false | null | true | gpointer_of_buffer_cell_gsub_buffer b i1 len i2 | {
"checked_file": "FStar.Pointer.Base.fsti.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked... | [
"lemma"
] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.buffer",
"FStar.UInt32.t",
"FStar.Pointer.Base.gpointer_of_buffer_cell_gsub_buffer",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"FStar.UInt32.v",
"FStar.Pointer.Base.buffer_length",
"Prims.op_LessThan... | [] | (*
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.Pointer.Base.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 gpointer_of_buffer_cell_gsub_buffer' (#t: typ) (b: buffer t) (i1 len i2: UInt32.t)
: Lemma
(requires
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v len))
(ensures
(UInt32.v i1 + UInt32.v len <= UInt32.v (buffer_length b) /\ UInt32.v i2 < UInt32.v ... | [] | FStar.Pointer.Base.gpointer_of_buffer_cell_gsub_buffer' | {
"file_name": "ulib/legacy/FStar.Pointer.Base.fsti",
"git_rev": "f4cbb7a38d67eeb13fbdb2f4fb8a44a65cbcdc1f",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | b: FStar.Pointer.Base.buffer t -> i1: FStar.UInt32.t -> len: FStar.UInt32.t -> i2: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires
FStar.UInt32.v i1 + FStar.UInt32.v len <=
FStar.UInt32.v (FStar.Pointer.Base.buffer_length b) /\
FStar.UInt32.v i2 < FStar.UInt32.v len)
(ensures
... | {
"end_col": 49,
"end_line": 1329,
"start_col": 2,
"start_line": 1329
} |
FStar.HyperStack.ST.Stack | val test_string (t: test_t) (testname inputstring: string)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "FStar.Printf",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.IO",
"short_module": null
},
{
"abbrev": false,
"full_module... | false | let test_string (t:test_t) (testname:string) (inputstring:string): Stack unit (fun _ -> true) (fun _ _ _ -> true) =
push_frame();
let input = bytes_of_hex inputstring in
test_bytes t testname input;
pop_frame() | val test_string (t: test_t) (testname inputstring: string)
: Stack unit (fun _ -> true) (fun _ _ _ -> true)
let test_string (t: test_t) (testname inputstring: string)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) = | true | null | false | push_frame ();
let input = bytes_of_hex inputstring in
test_bytes t testname input;
pop_frame () | {
"checked_file": "LowParse.TestLib.SLow.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Printf.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.IO.fst.checked",
"FStar.Bytes.fsti.checked"
],
... | [] | [
"LowParse.TestLib.SLow.test_t",
"Prims.string",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"LowParse.TestLib.SLow.test_bytes",
"FStar.Bytes.bytes",
"FStar.Bytes.bytes_of_hex",
"FStar.HyperStack.ST.push_frame",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t"
] | [] | module LowParse.TestLib.SLow
open FStar.HyperStack.ST
open FStar.Bytes
open FStar.HyperStack.IO
open FStar.Printf
module U32 = FStar.UInt32
#reset-options "--using_facts_from '* -LowParse'"
#reset-options "--z3cliopt smt.arith.nl=false"
(** The type of a unit test. It takes an input Bytes, parses it,
and retur... | false | false | LowParse.TestLib.SLow.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 test_string (t: test_t) (testname inputstring: string)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) | [] | LowParse.TestLib.SLow.test_string | {
"file_name": "src/lowparse/LowParse.TestLib.SLow.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | t: LowParse.TestLib.SLow.test_t -> testname: Prims.string -> inputstring: Prims.string
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 13,
"end_line": 48,
"start_col": 2,
"start_line": 45
} |
FStar.HyperStack.ST.Stack | val test_file (t: test_t) (filename: string) : Stack unit (fun _ -> true) (fun _ _ _ -> true) | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "FStar.Printf",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.IO",
"short_module": null
},
{
"abbrev": false,
"full_module... | false | let test_file (t:test_t) (filename:string): Stack unit (fun _ -> true) (fun _ _ _ -> true) =
push_frame();
let input = load_file filename in
test_bytes t filename input;
pop_frame() | val test_file (t: test_t) (filename: string) : Stack unit (fun _ -> true) (fun _ _ _ -> true)
let test_file (t: test_t) (filename: string) : Stack unit (fun _ -> true) (fun _ _ _ -> true) = | true | null | false | push_frame ();
let input = load_file filename in
test_bytes t filename input;
pop_frame () | {
"checked_file": "LowParse.TestLib.SLow.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Printf.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.IO.fst.checked",
"FStar.Bytes.fsti.checked"
],
... | [] | [
"LowParse.TestLib.SLow.test_t",
"Prims.string",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"LowParse.TestLib.SLow.test_bytes",
"FStar.Bytes.bytes",
"LowParse.TestLib.SLow.load_file",
"FStar.HyperStack.ST.push_frame",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t"
] | [] | module LowParse.TestLib.SLow
open FStar.HyperStack.ST
open FStar.Bytes
open FStar.HyperStack.IO
open FStar.Printf
module U32 = FStar.UInt32
#reset-options "--using_facts_from '* -LowParse'"
#reset-options "--z3cliopt smt.arith.nl=false"
(** The type of a unit test. It takes an input Bytes, parses it,
and retur... | false | false | LowParse.TestLib.SLow.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 test_file (t: test_t) (filename: string) : Stack unit (fun _ -> true) (fun _ _ _ -> true) | [] | LowParse.TestLib.SLow.test_file | {
"file_name": "src/lowparse/LowParse.TestLib.SLow.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | t: LowParse.TestLib.SLow.test_t -> filename: Prims.string -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 13,
"end_line": 55,
"start_col": 2,
"start_line": 52
} |
FStar.HyperStack.ST.Stack | val test_bytes (t: test_t) (testname: string) (input: FStar.Bytes.bytes)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) | [
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "FStar.Printf",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.IO",
"short_module": null
},
{
"abbrev": false,
"full_module... | false | let test_bytes (t:test_t) (testname:string) (input:FStar.Bytes.bytes): Stack unit (fun _ -> true) (fun _ _ _ -> true) =
push_frame();
print_string (sprintf "==== Testing Bytes %s ====\n" testname);
let result = t input in
(match result with
| Some (formattedresult, offset) -> (
if U32.gt offset (len input... | val test_bytes (t: test_t) (testname: string) (input: FStar.Bytes.bytes)
: Stack unit (fun _ -> true) (fun _ _ _ -> true)
let test_bytes (t: test_t) (testname: string) (input: FStar.Bytes.bytes)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) = | true | null | false | push_frame ();
print_string (sprintf "==== Testing Bytes %s ====\n" testname);
let result = t input in
(match result with
| Some (formattedresult, offset) ->
(if U32.gt offset (len input)
then (print_string "Invalid length return - it is longer than the input buffer!")
else
(let inputslice = F... | {
"checked_file": "LowParse.TestLib.SLow.fst.checked",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Printf.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.IO.fst.checked",
"FStar.Bytes.fsti.checked"
],
... | [] | [
"LowParse.TestLib.SLow.test_t",
"Prims.string",
"FStar.Bytes.bytes",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"FStar.HyperStack.IO.print_string",
"FStar.Printf.sprintf",
"FStar.UInt32.t",
"FStar.UInt32.gt",
"FStar.Bytes.len",
"Prims.bool",
"Prims.op_Equality",
"Prims.eq2",
"FStar.Seq... | [] | module LowParse.TestLib.SLow
open FStar.HyperStack.ST
open FStar.Bytes
open FStar.HyperStack.IO
open FStar.Printf
module U32 = FStar.UInt32
#reset-options "--using_facts_from '* -LowParse'"
#reset-options "--z3cliopt smt.arith.nl=false"
(** The type of a unit test. It takes an input Bytes, parses it,
and retur... | false | false | LowParse.TestLib.SLow.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 test_bytes (t: test_t) (testname: string) (input: FStar.Bytes.bytes)
: Stack unit (fun _ -> true) (fun _ _ _ -> true) | [] | LowParse.TestLib.SLow.test_bytes | {
"file_name": "src/lowparse/LowParse.TestLib.SLow.fst",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | t: LowParse.TestLib.SLow.test_t -> testname: Prims.string -> input: FStar.Bytes.bytes
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 13,
"end_line": 41,
"start_col": 2,
"start_line": 22
} |
Prims.Tot | val parse_u64_kind:parser_kind | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let parse_u64_kind : parser_kind =
total_constant_size_parser_kind 8 | val parse_u64_kind:parser_kind
let parse_u64_kind:parser_kind = | false | null | false | total_constant_size_parser_kind 8 | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"total"
] | [
"LowParse.Spec.Base.total_constant_size_parser_kind"
] | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64
inline_for_extraction
let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1
val tot_parse_u8: tot... | false | true | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 parse_u64_kind:parser_kind | [] | LowParse.Spec.Int.parse_u64_kind | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser_kind | {
"end_col": 35,
"end_line": 95,
"start_col": 2,
"start_line": 95
} |
Prims.Tot | val parse_u32_kind:parser_kind | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let parse_u32_kind : parser_kind =
total_constant_size_parser_kind 4 | val parse_u32_kind:parser_kind
let parse_u32_kind:parser_kind = | false | null | false | total_constant_size_parser_kind 4 | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"total"
] | [
"LowParse.Spec.Base.total_constant_size_parser_kind"
] | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64
inline_for_extraction
let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1
val tot_parse_u8: tot... | false | true | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 parse_u32_kind:parser_kind | [] | LowParse.Spec.Int.parse_u32_kind | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser_kind | {
"end_col": 35,
"end_line": 76,
"start_col": 2,
"start_line": 76
} |
Prims.Tot | val parse_u8:parser parse_u8_kind U8.t | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let parse_u8: parser parse_u8_kind U8.t = tot_parse_u8 | val parse_u8:parser parse_u8_kind U8.t
let parse_u8:parser parse_u8_kind U8.t = | false | null | false | tot_parse_u8 | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"total"
] | [
"LowParse.Spec.Int.tot_parse_u8"
] | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64
inline_for_extraction
let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1
val tot_parse_u8: tot... | false | true | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 parse_u8:parser parse_u8_kind U8.t | [] | LowParse.Spec.Int.parse_u8 | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser LowParse.Spec.Int.parse_u8_kind FStar.UInt8.t | {
"end_col": 54,
"end_line": 16,
"start_col": 42,
"start_line": 16
} |
Prims.Tot | val parse_u16_kind:parser_kind | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let parse_u16_kind : parser_kind =
total_constant_size_parser_kind 2 | val parse_u16_kind:parser_kind
let parse_u16_kind:parser_kind = | false | null | false | total_constant_size_parser_kind 2 | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"total"
] | [
"LowParse.Spec.Base.total_constant_size_parser_kind"
] | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64
inline_for_extraction
let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1
val tot_parse_u8: tot... | false | true | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 parse_u16_kind:parser_kind | [] | LowParse.Spec.Int.parse_u16_kind | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser_kind | {
"end_col": 35,
"end_line": 57,
"start_col": 2,
"start_line": 57
} |
Prims.Tot | val parse_u8_kind:parser_kind | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1 | val parse_u8_kind:parser_kind
let parse_u8_kind:parser_kind = | false | null | false | total_constant_size_parser_kind 1 | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"total"
] | [
"LowParse.Spec.Base.total_constant_size_parser_kind"
] | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64 | false | true | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 parse_u8_kind:parser_kind | [] | LowParse.Spec.Int.parse_u8_kind | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | LowParse.Spec.Base.parser_kind | {
"end_col": 67,
"end_line": 12,
"start_col": 34,
"start_line": 12
} |
FStar.Pervasives.Lemma | val serialize_u8_spec' (x: U8.t)
: Lemma
(let s = serialize serialize_u8 x in
Seq.length s == 1 /\ Seq.index s 0 == x) | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "FSta... | false | let serialize_u8_spec'
(x: U8.t)
: Lemma
(let s = serialize serialize_u8 x in
Seq.length s == 1 /\
Seq.index s 0 == x)
= serialize_u8_spec x | val serialize_u8_spec' (x: U8.t)
: Lemma
(let s = serialize serialize_u8 x in
Seq.length s == 1 /\ Seq.index s 0 == x)
let serialize_u8_spec' (x: U8.t)
: Lemma
(let s = serialize serialize_u8 x in
Seq.length s == 1 /\ Seq.index s 0 == x) = | false | null | true | serialize_u8_spec x | {
"checked_file": "LowParse.Spec.Int.fsti.checked",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.... | [
"lemma"
] | [
"FStar.UInt8.t",
"LowParse.Spec.Int.serialize_u8_spec",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"FStar.Seq.Base.index",
"LowParse.Bytes.bytes",
"LowParse.Spec.Base.serialize",
"LowParse.Spec.Int.... | [] | module LowParse.Spec.Int
include LowParse.Spec.Base
module Seq = FStar.Seq
module E = FStar.Endianness
module U8 = FStar.UInt8
module U16 = FStar.UInt16
module U32 = FStar.UInt32
module U64 = FStar.UInt64
inline_for_extraction
let parse_u8_kind : parser_kind = total_constant_size_parser_kind 1
val tot_parse_u8: tot... | false | false | LowParse.Spec.Int.fsti | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": 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 serialize_u8_spec' (x: U8.t)
: Lemma
(let s = serialize serialize_u8 x in
Seq.length s == 1 /\ Seq.index s 0 == x) | [] | LowParse.Spec.Int.serialize_u8_spec' | {
"file_name": "src/lowparse/LowParse.Spec.Int.fsti",
"git_rev": "446a08ce38df905547cf20f28c43776b22b8087a",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | x: FStar.UInt8.t
-> FStar.Pervasives.Lemma
(ensures
(let s = LowParse.Spec.Base.serialize LowParse.Spec.Int.serialize_u8 x in
FStar.Seq.Base.length s == 1 /\ FStar.Seq.Base.index s 0 == x)) | {
"end_col": 21,
"end_line": 53,
"start_col": 2,
"start_line": 53
} |
FStar.Tactics.Effect.Tac | val terms_to_string (t: list term) : T.Tac string | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.FV",
"short_module": "FV"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"abbrev": true... | false | let terms_to_string (t:list term)
: T.Tac string
= String.concat "\n" (T.map Pulse.Syntax.Printer.term_to_string t) | val terms_to_string (t: list term) : T.Tac string
let terms_to_string (t: list term) : T.Tac string = | true | null | false | String.concat "\n" (T.map Pulse.Syntax.Printer.term_to_string t) | {
"checked_file": "Pulse.Checker.Exists.fst.checked",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.FV.fsti.checked",
"Pulse.Typing.Env.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Puls... | [] | [
"Prims.list",
"Pulse.Syntax.Base.term",
"FStar.String.concat",
"Prims.string",
"FStar.Tactics.Util.map",
"Pulse.Syntax.Printer.term_to_string"
] | [] | module Pulse.Checker.Exists
open Pulse.Syntax
open Pulse.Typing
open Pulse.Typing.Combinators
open Pulse.Checker.Pure
open Pulse.Checker.Base
open Pulse.Checker.Prover
module T = FStar.Tactics.V2
module P = Pulse.Syntax.Printer
module FV = Pulse.Typing.FV
module Metatheory = Pulse.Typing.Metatheory
let vprop_as_li... | false | false | Pulse.Checker.Exists.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 terms_to_string (t: list term) : T.Tac string | [] | Pulse.Checker.Exists.terms_to_string | {
"file_name": "lib/steel/pulse/Pulse.Checker.Exists.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | t: Prims.list Pulse.Syntax.Base.term -> FStar.Tactics.Effect.Tac Prims.string | {
"end_col": 68,
"end_line": 25,
"start_col": 4,
"start_line": 25
} |
FStar.Tactics.Effect.Tac | val check_intro_exists
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(st:st_term { intro_exists_witness_singleton st })
(vprop_typing: option (tot_typing g (intro_exists_vprop st) tm_vprop))
: T.Tac (checker_result_t g pre post_hint) | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.FV",
"short_module": "FV"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"abbrev": true... | false | let check_intro_exists
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(st:st_term { intro_exists_witness_singleton st })
(vprop_typing: option (tot_typing g (intro_exists_vprop st) tm_vprop))
: T.Tac (checker_result_t g pre post_hint) =
let g... | val check_intro_exists
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(st:st_term { intro_exists_witness_singleton st })
(vprop_typing: option (tot_typing g (intro_exists_vprop st) tm_vprop))
: T.Tac (checker_result_t g pre post_hint)
let check_... | true | null | false | let g = Pulse.Typing.Env.push_context g "check_intro_exists_non_erased" st.range in
let Tm_IntroExists { p = t ; witnesses = [witness] } = st.term in
let (| t , t_typing |) =
match vprop_typing with
| Some typing -> (| t, typing |)
| _ -> check_vprop g t
in
if not (Tm_ExistsSL? (t <: term).t)
then
fail g
(S... | {
"checked_file": "Pulse.Checker.Exists.fst.checked",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.FV.fsti.checked",
"Pulse.Typing.Env.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Puls... | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"Pulse.Typing.tot_typing",
"Pulse.Syntax.Base.tm_vprop",
"Pulse.Typing.post_hint_opt",
"Pulse.Syntax.Base.ppname",
"Pulse.Syntax.Base.st_term",
"Prims.b2t",
"Pulse.Checker.Exists.intro_exists_witness_singleton",
"FStar.Pervasives.Native.option",
... | [] | module Pulse.Checker.Exists
open Pulse.Syntax
open Pulse.Typing
open Pulse.Typing.Combinators
open Pulse.Checker.Pure
open Pulse.Checker.Base
open Pulse.Checker.Prover
module T = FStar.Tactics.V2
module P = Pulse.Syntax.Printer
module FV = Pulse.Typing.FV
module Metatheory = Pulse.Typing.Metatheory
let vprop_as_li... | false | false | Pulse.Checker.Exists.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 check_intro_exists
(g:env)
(pre:term)
(pre_typing:tot_typing g pre tm_vprop)
(post_hint:post_hint_opt g)
(res_ppname:ppname)
(st:st_term { intro_exists_witness_singleton st })
(vprop_typing: option (tot_typing g (intro_exists_vprop st) tm_vprop))
: T.Tac (checker_result_t g pre post_hint) | [] | Pulse.Checker.Exists.check_intro_exists | {
"file_name": "lib/steel/pulse/Pulse.Checker.Exists.fst",
"git_rev": "7fbb54e94dd4f48ff7cb867d3bae6889a635541e",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} |
g: Pulse.Typing.Env.env ->
pre: Pulse.Syntax.Base.term ->
pre_typing: Pulse.Typing.tot_typing g pre Pulse.Syntax.Base.tm_vprop ->
post_hint: Pulse.Typing.post_hint_opt g ->
res_ppname: Pulse.Syntax.Base.ppname ->
st: Pulse.Syntax.Base.st_term{Pulse.Checker.Exists.intro_exists_witness_singleton ... | {
"end_col": 127,
"end_line": 107,
"start_col": 46,
"start_line": 83
} |
FStar.HyperStack.ST.Stack | val mk_felem_one: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.one) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let mk_felem_one b =
Hacl.Bignum25519.make_one b | val mk_felem_one: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.one)
let mk_felem_one b = | true | null | false | Hacl.Bignum25519.make_one b | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.make_one",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 mk_felem_one: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.one) | [] | Hacl.EC.Ed25519.mk_felem_one | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | b: Hacl.Impl.Ed25519.Field51.felem -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 29,
"end_line": 51,
"start_col": 2,
"start_line": 51
} |
FStar.HyperStack.ST.Stack | val mk_felem_zero: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.zero) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let mk_felem_zero b =
Hacl.Bignum25519.make_zero b | val mk_felem_zero: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.zero)
let mk_felem_zero b = | true | null | false | Hacl.Bignum25519.make_zero b | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.make_zero",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 mk_felem_zero: b:F51.felem ->
Stack unit
(requires fun h -> live h b)
(ensures fun h0 _ h1 -> modifies (loc b) h0 h1 /\
F51.mul_inv_t h1 b /\
F51.fevalh h1 b == SC.zero) | [] | Hacl.EC.Ed25519.mk_felem_zero | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | b: Hacl.Impl.Ed25519.Field51.felem -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 30,
"end_line": 37,
"start_col": 2,
"start_line": 37
} |
FStar.HyperStack.ST.Stack | val mk_point_at_inf: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_point_at_infinity) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let mk_point_at_inf p =
Hacl.Impl.Ed25519.PointConstants.make_point_inf p | val mk_point_at_inf: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_point_at_infinity)
let mk_point_at_inf p = | true | null | false | Hacl.Impl.Ed25519.PointConstants.make_point_inf p | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.PointConstants.make_point_inf",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 mk_point_at_inf: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_point_at_infinity) | [] | Hacl.EC.Ed25519.mk_point_at_inf | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Impl.Ed25519.Field51.point -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 51,
"end_line": 236,
"start_col": 2,
"start_line": 236
} |
FStar.HyperStack.ST.Stack | val mk_base_point: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_g) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let mk_base_point p =
Spec.Ed25519.Lemmas.g_is_on_curve ();
Hacl.Impl.Ed25519.PointConstants.make_g p | val mk_base_point: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_g)
let mk_base_point p = | true | null | false | Spec.Ed25519.Lemmas.g_is_on_curve ();
Hacl.Impl.Ed25519.PointConstants.make_g p | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.PointConstants.make_g",
"Prims.unit",
"Spec.Ed25519.Lemmas.g_is_on_curve"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 mk_base_point: p:F51.point ->
Stack unit
(requires fun h -> live h p)
(ensures fun h0 _ h1 -> modifies (loc p) h0 h1 /\
F51.point_inv_t h1 p /\ F51.inv_ext_point (as_seq h1 p) /\
SE.to_aff_point (F51.point_eval h1 p) == SE.aff_g) | [] | Hacl.EC.Ed25519.mk_base_point | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Impl.Ed25519.Field51.point -> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 43,
"end_line": 251,
"start_col": 2,
"start_line": 250
} |
FStar.HyperStack.ST.Stack | val point_eq: p:F51.point -> q:F51.point ->
Stack bool
(requires fun h ->
live h p /\ live h q /\ eq_or_disjoint p q /\
F51.point_inv_t h p /\ F51.point_inv_t h q)
(ensures fun h0 z h1 -> modifies0 h0 h1 /\
(z <==> SE.point_equal (F51.point_eval h0 p) (F51.point_eval h0 q))) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let point_eq p q =
Hacl.Impl.Ed25519.PointEqual.point_equal p q | val point_eq: p:F51.point -> q:F51.point ->
Stack bool
(requires fun h ->
live h p /\ live h q /\ eq_or_disjoint p q /\
F51.point_inv_t h p /\ F51.point_inv_t h q)
(ensures fun h0 z h1 -> modifies0 h0 h1 /\
(z <==> SE.point_equal (F51.point_eval h0 p) (F51.point_eval h0 q)))
let point_eq p q = | true | null | false | Hacl.Impl.Ed25519.PointEqual.point_equal p q | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.PointEqual.point_equal",
"Prims.bool"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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_eq: p:F51.point -> q:F51.point ->
Stack bool
(requires fun h ->
live h p /\ live h q /\ eq_or_disjoint p q /\
F51.point_inv_t h p /\ F51.point_inv_t h q)
(ensures fun h0 z h1 -> modifies0 h0 h1 /\
(z <==> SE.point_equal (F51.point_eval h0 p) (F51.point_eval h0 q))) | [] | Hacl.EC.Ed25519.point_eq | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Impl.Ed25519.Field51.point -> q: Hacl.Impl.Ed25519.Field51.point
-> FStar.HyperStack.ST.Stack Prims.bool | {
"end_col": 46,
"end_line": 372,
"start_col": 2,
"start_line": 372
} |
FStar.HyperStack.ST.Stack | val felem_load: b:lbuffer uint8 32ul -> out:F51.felem ->
Stack unit
(requires fun h -> live h b /\ live h out)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.as_nat h1 out == Lib.ByteSequence.nat_from_bytes_le (as_seq h0 b) % pow2 255) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_load b out =
Hacl.Bignum25519.load_51 out b | val felem_load: b:lbuffer uint8 32ul -> out:F51.felem ->
Stack unit
(requires fun h -> live h b /\ live h out)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.as_nat h1 out == Lib.ByteSequence.nat_from_bytes_le (as_seq h0 b) % pow2 255)
let felem_load b out = | true | null | false | Hacl.Bignum25519.load_51 out b | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.load_51",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_load: b:lbuffer uint8 32ul -> out:F51.felem ->
Stack unit
(requires fun h -> live h b /\ live h out)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.as_nat h1 out == Lib.ByteSequence.nat_from_bytes_le (as_seq h0 b) % pow2 255) | [] | Hacl.EC.Ed25519.felem_load | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | b: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul -> out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 32,
"end_line": 192,
"start_col": 2,
"start_line": 192
} |
FStar.HyperStack.ST.Stack | val point_compress: p:F51.point -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h out /\ live h p /\ disjoint p out /\
F51.point_inv_t h p)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == SE.point_compress (F51.point_eval h0 p)) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let point_compress p out =
Hacl.Impl.Ed25519.PointCompress.point_compress out p | val point_compress: p:F51.point -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h out /\ live h p /\ disjoint p out /\
F51.point_inv_t h p)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == SE.point_compress (F51.point_eval h0 p))
let point_compress p out = | true | null | false | Hacl.Impl.Ed25519.PointCompress.point_compress out p | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.point",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Ed25519.PointCompress.point_compress",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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_compress: p:F51.point -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h out /\ live h p /\ disjoint p out /\
F51.point_inv_t h p)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == SE.point_compress (F51.point_eval h0 p)) | [] | Hacl.EC.Ed25519.point_compress | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Impl.Ed25519.Field51.point -> out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 54,
"end_line": 395,
"start_col": 2,
"start_line": 395
} |
FStar.HyperStack.ST.Stack | val point_decompress: s:lbuffer uint8 32ul -> out:F51.point ->
Stack bool
(requires fun h ->
live h out /\ live h s /\ disjoint s out)
(ensures fun h0 b h1 -> modifies (loc out) h0 h1 /\
(b ==> F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out)) /\
(b <==> Some? (SE.point_decompress (as_seq ... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let point_decompress s out =
let h0 = ST.get () in
Spec.Ed25519.Lemmas.point_decompress_lemma (as_seq h0 s);
Hacl.Impl.Ed25519.PointDecompress.point_decompress out s | val point_decompress: s:lbuffer uint8 32ul -> out:F51.point ->
Stack bool
(requires fun h ->
live h out /\ live h s /\ disjoint s out)
(ensures fun h0 b h1 -> modifies (loc out) h0 h1 /\
(b ==> F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out)) /\
(b <==> Some? (SE.point_decompress (as_seq ... | true | null | false | let h0 = ST.get () in
Spec.Ed25519.Lemmas.point_decompress_lemma (as_seq h0 s);
Hacl.Impl.Ed25519.PointDecompress.point_decompress out s | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.PointDecompress.point_decompress",
"Prims.bool",
"Prims.unit",
"Spec.Ed25519.Lemmas.point_decompress_lemma",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"FStar.Monotonic.Hyper... | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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_decompress: s:lbuffer uint8 32ul -> out:F51.point ->
Stack bool
(requires fun h ->
live h out /\ live h s /\ disjoint s out)
(ensures fun h0 b h1 -> modifies (loc out) h0 h1 /\
(b ==> F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out)) /\
(b <==> Some? (SE.point_decompress (as_seq ... | [] | Hacl.EC.Ed25519.point_decompress | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | s: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul -> out: Hacl.Impl.Ed25519.Field51.point
-> FStar.HyperStack.ST.Stack Prims.bool | {
"end_col": 58,
"end_line": 421,
"start_col": 28,
"start_line": 418
} |
FStar.HyperStack.ST.Stack | val felem_sub: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_sub a b out =
Hacl.Impl.Curve25519.Field51.fsub out a b;
Hacl.Bignum25519.reduce_513 out | val felem_sub: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | true | null | false | Hacl.Impl.Curve25519.Field51.fsub out a b;
Hacl.Bignum25519.reduce_513 out | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.reduce_513",
"Prims.unit",
"Hacl.Impl.Curve25519.Field51.fsub"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_sub: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | [] | Hacl.EC.Ed25519.felem_sub | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
a: Hacl.Impl.Ed25519.Field51.felem ->
b: Hacl.Impl.Ed25519.Field51.felem ->
out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 33,
"end_line": 101,
"start_col": 2,
"start_line": 100
} |
FStar.HyperStack.ST.Stack | val felem_inv: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\ disjoint a out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fpow (F51.fevalh h0 a) (SC.prime - 2)) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_inv a out =
Hacl.Bignum25519.inverse out a;
Hacl.Bignum25519.reduce_513 out | val felem_inv: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\ disjoint a out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fpow (F51.fevalh h0 a) (SC.prime - 2))
let felem_inv a ou... | true | null | false | Hacl.Bignum25519.inverse out a;
Hacl.Bignum25519.reduce_513 out | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.reduce_513",
"Prims.unit",
"Hacl.Bignum25519.inverse"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_inv: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\ disjoint a out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fpow (F51.fevalh h0 a) (SC.prime - 2)) | [] | Hacl.EC.Ed25519.felem_inv | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Hacl.Impl.Ed25519.Field51.felem -> out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 33,
"end_line": 171,
"start_col": 2,
"start_line": 170
} |
FStar.HyperStack.ST.Stack | val felem_add: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_add a b out =
Hacl.Impl.Curve25519.Field51.fadd out a b;
Hacl.Bignum25519.reduce_513 out | val felem_add: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | true | null | false | Hacl.Impl.Curve25519.Field51.fadd out a b;
Hacl.Bignum25519.reduce_513 out | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Hacl.Bignum25519.reduce_513",
"Prims.unit",
"Hacl.Impl.Curve25519.Field51.fadd"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_add: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
(disjoint out a \/ out == a) /\
(disjoint out b \/ out == b) /\
(disjoint a b \/ a == b) /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> mod... | [] | Hacl.EC.Ed25519.felem_add | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
a: Hacl.Impl.Ed25519.Field51.felem ->
b: Hacl.Impl.Ed25519.Field51.felem ->
out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 33,
"end_line": 76,
"start_col": 2,
"start_line": 75
} |
FStar.HyperStack.ST.Stack | val felem_store: a:F51.felem -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == Lib.ByteSequence.nat_to_bytes_le 32 (F51.fevalh h0 a)) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_store a out =
Hacl.Bignum25519.store_51 out a | val felem_store: a:F51.felem -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == Lib.ByteSequence.nat_to_bytes_le 32 (F51.fevalh h0 a))
let felem_store a out = | true | null | false | Hacl.Bignum25519.store_51 out a | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Bignum25519.store_51",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_store: a:F51.felem -> out:lbuffer uint8 32ul ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
as_seq h1 out == Lib.ByteSequence.nat_to_bytes_le 32 (F51.fevalh h0 a)) | [] | Hacl.EC.Ed25519.felem_store | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Hacl.Impl.Ed25519.Field51.felem -> out: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 33,
"end_line": 212,
"start_col": 2,
"start_line": 212
} |
FStar.HyperStack.ST.Stack | val felem_sqr: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) (F51.fevalh h0 a)) | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_sqr a out =
push_frame();
let tmp = create 5ul (u128 0) in
Hacl.Impl.Curve25519.Field51.fsqr out a tmp;
pop_frame() | val felem_sqr: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) (F51.fevalh h0 a))
let felem_sqr a out = | true | null | false | push_frame ();
let tmp = create 5ul (u128 0) in
Hacl.Impl.Curve25519.Field51.fsqr out a tmp;
pop_frame () | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Curve25519.Field51.fsqr",
"Lib.Buffer.lbuffer_t",
"Lib.Buffer.MUT",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U128",
"Lib.IntTypes.SEC",
"FStar.UInt32.uint_to_t",
"FStar.UInt32.t",
"Lib.Buffer.create",
"Ha... | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_sqr: a:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h out /\
F51.mul_inv_t h a)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) (F51.fevalh h0 a)) | [] | Hacl.EC.Ed25519.felem_sqr | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | a: Hacl.Impl.Ed25519.Field51.felem -> out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 13,
"end_line": 148,
"start_col": 2,
"start_line": 145
} |
FStar.HyperStack.ST.Stack | val point_mul: scalar:lbuffer uint8 32ul -> p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h scalar /\ live h p /\ live h out /\
disjoint out p /\ disjoint out scalar /\
disjoint p scalar /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifie... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let point_mul scalar p out =
Hacl.Impl.Ed25519.Ladder.point_mul out scalar p | val point_mul: scalar:lbuffer uint8 32ul -> p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h scalar /\ live h p /\ live h out /\
disjoint out p /\ disjoint out scalar /\
disjoint p scalar /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifie... | true | null | false | Hacl.Impl.Ed25519.Ladder.point_mul out scalar p | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"FStar.UInt32.__uint_to_t",
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.Ladder.point_mul",
"Prims.unit"
] | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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: scalar:lbuffer uint8 32ul -> p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h scalar /\ live h p /\ live h out /\
disjoint out p /\ disjoint out scalar /\
disjoint p scalar /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifie... | [] | Hacl.EC.Ed25519.point_mul | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
scalar: Lib.Buffer.lbuffer Lib.IntTypes.uint8 32ul ->
p: Hacl.Impl.Ed25519.Field51.point ->
out: Hacl.Impl.Ed25519.Field51.point
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 49,
"end_line": 351,
"start_col": 2,
"start_line": 351
} |
FStar.HyperStack.ST.Stack | val felem_mul: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) ... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let felem_mul a b out =
push_frame();
let tmp = create 10ul (u128 0) in
Hacl.Impl.Curve25519.Field51.fmul out a b tmp;
pop_frame() | val felem_mul: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) ... | true | null | false | push_frame ();
let tmp = create 10ul (u128 0) in
Hacl.Impl.Curve25519.Field51.fmul out a b tmp;
pop_frame () | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.felem",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Curve25519.Field51.fmul",
"Lib.Buffer.lbuffer_t",
"Lib.Buffer.MUT",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U128",
"Lib.IntTypes.SEC",
"FStar.UInt32.uint_to_t",
"FStar.UInt32.t",
"Lib.Buffer.create",
"Ha... | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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 felem_mul: a:F51.felem -> b:F51.felem -> out:F51.felem ->
Stack unit
(requires fun h ->
live h a /\ live h b /\ live h out /\
F51.mul_inv_t h a /\
F51.mul_inv_t h b)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.mul_inv_t h1 out /\
F51.fevalh h1 out == SC.fmul (F51.fevalh h0 a) ... | [] | Hacl.EC.Ed25519.felem_mul | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} |
a: Hacl.Impl.Ed25519.Field51.felem ->
b: Hacl.Impl.Ed25519.Field51.felem ->
out: Hacl.Impl.Ed25519.Field51.felem
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 13,
"end_line": 125,
"start_col": 2,
"start_line": 122
} |
FStar.HyperStack.ST.Stack | val point_double: p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h out /\ live h p /\
eq_or_disjoint p out /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out) ... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Ladder",
"short_module": "ML"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "SC"
},
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "SE"
},
{
"abbrev": true,
"full_mo... | false | let point_double p out =
let h0 = ST.get () in
Spec.Ed25519.Lemmas.to_aff_point_double_lemma (F51.refl_ext_point (as_seq h0 p));
Hacl.Impl.Ed25519.PointDouble.point_double out p | val point_double: p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h out /\ live h p /\
eq_or_disjoint p out /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out) ... | true | null | false | let h0 = ST.get () in
Spec.Ed25519.Lemmas.to_aff_point_double_lemma (F51.refl_ext_point (as_seq h0 p));
Hacl.Impl.Ed25519.PointDouble.point_double out p | {
"checked_file": "Hacl.EC.Ed25519.fst.checked",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.E... | [] | [
"Hacl.Impl.Ed25519.Field51.point",
"Hacl.Impl.Ed25519.PointDouble.point_double",
"Prims.unit",
"Spec.Ed25519.Lemmas.to_aff_point_double_lemma",
"Hacl.Impl.Ed25519.Field51.refl_ext_point",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"FStar.UInt32.__uint_to_t",
"FStar.Monotonic.Hyp... | [] | module Hacl.EC.Ed25519
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module F51 = Hacl.Impl.Ed25519.Field51
module SE = Spec.Ed25519
module SC = Spec.Curve25519
module ML = Hacl.Impl.Ed25519.Ladder
#set-options "--z3rlimit 50 --fuel 0... | false | false | Hacl.EC.Ed25519.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_double: p:F51.point -> out:F51.point ->
Stack unit
(requires fun h ->
live h out /\ live h p /\
eq_or_disjoint p out /\
F51.point_inv_t h p /\ F51.inv_ext_point (as_seq h p))
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
F51.point_inv_t h1 out /\ F51.inv_ext_point (as_seq h1 out) ... | [] | Hacl.EC.Ed25519.point_double | {
"file_name": "code/ed25519/Hacl.EC.Ed25519.fst",
"git_rev": "12c5e9539c7e3c366c26409d3b86493548c4483e",
"git_url": "https://github.com/hacl-star/hacl-star.git",
"project_name": "hacl-star"
} | p: Hacl.Impl.Ed25519.Field51.point -> out: Hacl.Impl.Ed25519.Field51.point
-> FStar.HyperStack.ST.Stack Prims.unit | {
"end_col": 50,
"end_line": 324,
"start_col": 24,
"start_line": 321
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.