file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.is_false | val is_false : term -> Tac bool | val is_false : term -> Tac bool | let is_false t =
begin match term_as_formula' t with
| False_ -> true
| _ -> begin match inspect t with
| Tv_App l r ->
begin match inspect l with
| Tv_Abs b t ->
begin match term_as_formula' t with
| False_ -> true
| _ -> fa... | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 191,
"start_col": 0,
"start_line": 176
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: FStar.Tactics.NamedView.term -> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Tactics.NamedView.term",
"Prims.bool",
"FStar.Reflection.V2.Formula.formula",
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Tactics.NamedView.binder",
"FStar.Reflection.V2.Formula.term_as_formula'",
"FStar.Tactics.NamedView.named_term_view",
"FStar.Tactics.NamedView.inspect"
] | [] | false | true | false | false | false | let is_false t =
| match term_as_formula' t with
| False_ -> true
| _ ->
match inspect t with
| Tv_App l r ->
(match inspect l with
| Tv_Abs b t ->
(match term_as_formula' t with
| False_ -> true
| _ -> false)
| _ -> false)
| _ -> false | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.simplify | val simplify: Prims.unit -> Tac unit | val simplify: Prims.unit -> Tac unit | let simplify () : Tac unit =
apply_lemma (`equiv);
simplify_point () | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 309,
"start_col": 0,
"start_line": 307
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.Simplifier.simplify_point",
"FStar.Tactics.V2.Derived.apply_lemma"
] | [] | false | true | false | false | false | let simplify () : Tac unit =
| apply_lemma (`equiv);
simplify_point () | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.fa_cong | val fa_cong (#a : Type) (#p #q : a -> Type) :
(x:a -> squash (p x <==> q x)) ->
Lemma ((forall (x:a). p x) <==> (forall (x:a). q x)) | val fa_cong (#a : Type) (#p #q : a -> Type) :
(x:a -> squash (p x <==> q x)) ->
Lemma ((forall (x:a). p x) <==> (forall (x:a). q x)) | let fa_cong #a #p #q f =
assert ((forall (x:a). p x) <==> (forall (x:a). q x)) by (
split();
let do1 () : Tac unit =
let _ = l_intros () in
let t = quote f in
let x = nth_var (-1) in
let bb = pose (mk_e_app t [binding_to_term x]) in
()
in
iseq [do1; do1]
) | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 132,
"start_col": 0,
"start_line": 121
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (x: a -> Prims.squash (p x <==> q x))
-> FStar.Pervasives.Lemma (ensures (forall (x: a). p x) <==> (forall (x: a). q x)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.squash",
"Prims.l_iff",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_Forall",
"Prims.unit",
"FStar.Tactics.V2.Derived.iseq",
"Prims.Cons",
"Prims.Nil",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Derived.pose",
"FStar.Reflection.V2.Derived.mk_e_app",
"FStar.Stubs.Reflectio... | [] | false | false | true | false | false | let fa_cong #a #p #q f =
| FStar.Tactics.Effect.assert_by_tactic ((forall (x: a). p x) <==> (forall (x: a). q x))
(fun _ ->
();
(split ();
let do1 () : Tac unit =
let _ = l_intros () in
let t = quote f in
let x = nth_var (- 1) in
let bb = pose (mk_e_app t [binding_to_term x]) in
... | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.inhabit | val inhabit : unit -> Tac unit | val inhabit : unit -> Tac unit | let inhabit () =
let t = cur_goal () in
match inspect t with
| Tv_FVar fv ->
let qn = inspect_fv fv in
if qn = int_lid then exact (`42)
else if qn = bool_lid then exact (`true)
else if qn = unit_lid then exact (`())
else fail ""
| _ -> fail "" | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 203,
"start_col": 0,
"start_line": 194
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Reflection.Types.fv",
"Prims.op_Equality",
"Prims.list",
"Prims.string",
"FStar.Reflection.Const.int_lid",
"FStar.Tactics.V2.Derived.exact",
"Prims.bool",
"FStar.Reflection.Const.bool_lid",
"FStar.Reflection.Const.unit_lid",
"FStar.Tactics.V2.Derived.fail",
"FStar.St... | [] | false | true | false | false | false | let inhabit () =
| let t = cur_goal () in
match inspect t with
| Tv_FVar fv ->
let qn = inspect_fv fv in
if qn = int_lid
then exact (`42)
else if qn = bool_lid then exact (`true) else if qn = unit_lid then exact (`()) else fail ""
| _ -> fail "" | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.ex_cong | val ex_cong (#a : Type) (#p #q : a -> Type) :
(x:a -> squash (p x <==> q x)) ->
Lemma ((exists (x:a). p x) <==> (exists (x:a). q x)) | val ex_cong (#a : Type) (#p #q : a -> Type) :
(x:a -> squash (p x <==> q x)) ->
Lemma ((exists (x:a). p x) <==> (exists (x:a). q x)) | let ex_cong #a #p #q f =
assert ((exists (x:a). p x) <==> (exists (x:a). q x)) by (assume_safe (fun () ->
split();
let do1 () : Tac unit =
let [ex] = l_intros () in
let (b, pf) = elim_exists (binding_to_term ex) in
let t = quote f in
let bb = pose (mk_e_app t [binding_to_term b]) in
... | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 4,
"end_line": 148,
"start_col": 0,
"start_line": 137
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: (x: a -> Prims.squash (p x <==> q x))
-> FStar.Pervasives.Lemma (ensures (exists (x: a). p x) <==> (exists (x: a). q x)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.squash",
"Prims.l_iff",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_Exists",
"Prims.unit",
"FStar.Tactics.Effect.assume_safe",
"FStar.Tactics.V2.Derived.iseq",
"Prims.Cons",
"Prims.Nil",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Derived.pose",
"FStar.Reflection.V2.Deriv... | [] | false | false | true | false | false | let ex_cong #a #p #q f =
| FStar.Tactics.Effect.assert_by_tactic ((exists (x: a). p x) <==> (exists (x: a). q x))
(fun _ ->
();
(assume_safe (fun () ->
split ();
let do1 () : Tac unit =
let [ex] = l_intros () in
let b, pf = elim_exists (binding_to_term ex) in
... | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.recurse | val recurse : unit -> Tac unit | val recurse : unit -> Tac unit | let rec simplify_point () =
recurse ();
norm [];
let g = cur_goal () in
let f = term_as_formula g in
match f with
| Iff l r ->
begin match term_as_formula' l with
| And p q ->
if is_true p then apply_lemma (`lem_true_and_p)
else if is_true q then ap... | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 302,
"start_col": 0,
"start_line": 208
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [
"simplify_point",
"recurse"
] | [
"Prims.unit",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.V2.Derived.seq",
"FStar.Tactics.V2.Derived.apply_lemma",
"FStar.Tactics.Simplifier.simplify_point",
"FStar.Tactics.NamedView.bv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.V2.Data.binding",
"FStar.Stubs.Tactics.V2.Builtin... | [
"mutual recursion"
] | false | true | false | false | false | let rec recurse () : Tac unit =
| step ();
norm [];
let g = cur_goal () in
let f = term_as_formula g in
match f with
| Iff l r ->
(match term_as_formula' l with
| And _ _ -> seq (fun () -> apply_lemma (`and_cong)) simplify_point
| Or _ _ -> seq (fun () -> apply_lemma (`or_cong)) simplify_point
| Implies _ _ -> seq (fun () -> apply_lemma (... | false |
FStar.Tactics.Simplifier.fst | FStar.Tactics.Simplifier.simplify_point | val simplify_point : unit -> Tac unit | val simplify_point : unit -> Tac unit | let rec simplify_point () =
recurse ();
norm [];
let g = cur_goal () in
let f = term_as_formula g in
match f with
| Iff l r ->
begin match term_as_formula' l with
| And p q ->
if is_true p then apply_lemma (`lem_true_and_p)
else if is_true q then ap... | {
"file_name": "ulib/FStar.Tactics.Simplifier.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 302,
"start_col": 0,
"start_line": 208
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Reflection.V2.Formula.fst.checked",
"FStar.Reflection.Const.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file":... | [
{
"abbrev": false,
"full_module": "FStar.Reflection.Const",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2.Formula",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [
"simplify_point",
"recurse"
] | [
"Prims.unit",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.V2.Derived.apply_lemma",
"Prims.bool",
"FStar.Tactics.Simplifier.tiff",
"FStar.Tactics.Simplifier.is_false",
"FStar.Tactics.Simplifier.is_true",
"FStar.Tactics.NamedView.bv",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Tactics.V2.Derived.... | [
"mutual recursion"
] | false | true | false | false | false | let rec simplify_point () =
| recurse ();
norm [];
let g = cur_goal () in
let f = term_as_formula g in
match f with
| Iff l r ->
(match term_as_formula' l with
| And p q ->
if is_true p
then apply_lemma (`lem_true_and_p)
else
if is_true q
then apply_lemma (`lem_p_and_true)
else
if is_false p... | false |
Steel.Channel.Simplex.fst | Steel.Channel.Simplex.intro_trace_until_init | val intro_trace_until_init (#p: _) (c: chan_t p) (v: init_chan_val p)
: SteelT unit (MRef.pts_to c.trace full_perm (initial_trace p)) (fun _ -> trace_until c.trace v) | val intro_trace_until_init (#p: _) (c: chan_t p) (v: init_chan_val p)
: SteelT unit (MRef.pts_to c.trace full_perm (initial_trace p)) (fun _ -> trace_until c.trace v) | let intro_trace_until_init #p (c:chan_t p) (v:init_chan_val p)
: SteelT unit (MRef.pts_to c.trace full_perm (initial_trace p))
(fun _ -> trace_until c.trace v)
= intro_pure (until (initial_trace p) == step v.chan_prot v.chan_msg);
//TODO: Not sure why I need this rewrite
rewrite_slprop (MRe... | {
"file_name": "lib/steel/Steel.Channel.Simplex.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 63,
"end_line": 195,
"start_col": 0,
"start_line": 185
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.MonotonicHigherReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.HigherReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Steel.MonotonicHigherReference",
"short_module": "MRef"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Steel.Channel.Simplex.chan_t p -> v: Steel.Channel.Simplex.init_chan_val p
-> Steel.Effect.SteelT Prims.unit | Steel.Effect.SteelT | [] | [] | [
"Steel.Channel.Simplex.prot",
"Steel.Channel.Simplex.chan_t",
"Steel.Channel.Simplex.init_chan_val",
"Steel.Effect.Atomic.intro_exists",
"Steel.Channel.Protocol.partial_trace_of",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.Channel.Simplex.initial_trace",
... | [] | false | true | false | false | false | let intro_trace_until_init #p (c: chan_t p) (v: init_chan_val p)
: SteelT unit (MRef.pts_to c.trace full_perm (initial_trace p)) (fun _ -> trace_until c.trace v) =
| intro_pure (until (initial_trace p) == step v.chan_prot v.chan_msg);
rewrite_slprop ((MRef.pts_to c.trace full_perm (initial_trace p))
`star`
(pure (until (initial_trace p) == step v.chan_prot v.chan_msg)))
((MRef.pts_to c.trace full_perm (initial_trace p))
`star`
(pure (until (initial_trace p) == ste... | false |
Lens.fst | Lens.op_String_Access | val ( .[] ) (x: 'a) (l: lens 'a 'b) : 'b | val ( .[] ) (x: 'a) (l: lens 'a 'b) : 'b | let op_String_Access (x:'a) (l:lens 'a 'b) : 'b = x |. l | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 53,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: 'a -> l: Lens.lens 'a 'b -> 'b | Prims.Tot | [
"total"
] | [] | [
"Lens.lens",
"Lens.op_Bar_Dot"
] | [] | false | false | false | true | false | let ( .[] ) (x: 'a) (l: lens 'a 'b) : 'b =
| x |. l | false |
Lens.fst | Lens.op_String_Assignment | val ( .[]<- ) (x: 'a) (l: lens 'a 'b) (v: 'b) : 'a | val ( .[]<- ) (x: 'a) (l: lens 'a 'b) (v: 'b) : 'a | let op_String_Assignment (x:'a) (l:lens 'a 'b) (v:'b) : 'a = (x |:= l) v | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 50,
"start_col": 0,
"start_line": 50
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: 'a -> l: Lens.lens 'a 'b -> v: 'b -> 'a | Prims.Tot | [
"total"
] | [] | [
"Lens.lens",
"Lens.op_Bar_Colon_Equals"
] | [] | false | false | false | true | false | let ( .[]<- ) (x: 'a) (l: lens 'a 'b) (v: 'b) : 'a =
| (x |:= l) v | false |
Lens.fst | Lens.x | val x:lens point int | val x:lens point int | let x : lens point int = {
get = (fun p -> p.x);
put = (fun x' p -> {p with x=x'})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 68,
"start_col": 0,
"start_line": 65
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.point Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.point",
"Prims.int",
"Lens.__proj__Mkpoint__item__x",
"Lens.Mkpoint",
"Lens.__proj__Mkpoint__item__y",
"Lens.__proj__Mkpoint__item__z"
] | [] | false | false | false | true | false | let x:lens point int =
| { get = (fun p -> p.x); put = (fun x' p -> { p with x = x' }) } | false |
OWGCounter.ST.fst | OWGCounter.ST.incr_main | val incr_main (#v: G.erased int) (r: R.ref int)
: STT unit (R.pts_to r full_perm v) (fun _ -> R.pts_to r full_perm (v + 2)) | val incr_main (#v: G.erased int) (r: R.ref int)
: STT unit (R.pts_to r full_perm v) (fun _ -> R.pts_to r full_perm (v + 2)) | let incr_main (#v:G.erased int) (r:R.ref int)
: STT unit
(R.pts_to r full_perm v)
(fun _ -> R.pts_to r full_perm (v+2))
=
//
// Allocate the ghost state and share
//
let r1 = GR.alloc 0 in
let r2 = GR.alloc v in
GR.share r1;
rewrite (GR.pts_to r1 (P.half_perm full_perm)... | {
"file_name": "share/steel/examples/steel/OWGCounter.ST.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 40,
"end_line": 271,
"start_col": 0,
"start_line": 213
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.GhostReference.fsti.checked",
"Steel.ST.Effect.Atomic.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.Memory.fsti.checked",
"Ste... | [
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.ST.GhostReference",
"short_module": "GR"
},
{
"abbrev": true,
"full_module": "Steel.ST.Reference",
"short_module": "R"
},
{
"abbrev": true... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.ST.Reference.ref Prims.int -> Steel.ST.Effect.STT Prims.unit | Steel.ST.Effect.STT | [] | [] | [
"FStar.Ghost.erased",
"Prims.int",
"Steel.ST.Reference.ref",
"Steel.ST.Util.rewrite",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.Reference.pts_to",
"Steel.FractionalPermission.full_perm",
"Prims.op_Addition",
"FStar.Pervasives.Native.fst",
"FStar.... | [] | false | true | false | false | false | let incr_main (#v: G.erased int) (r: R.ref int)
: STT unit (R.pts_to r full_perm v) (fun _ -> R.pts_to r full_perm (v + 2)) =
| let r1 = GR.alloc 0 in
let r2 = GR.alloc v in
GR.share r1;
rewrite ((GR.pts_to r1 (P.half_perm full_perm) 0) `star` (GR.pts_to r1 (P.half_perm full_perm) 0))
((GR.pts_to r1 half_perm (fst (0, v))) `star` (GR.pts_to r1 half_perm 0));
GR.share r2;
rewrite ((GR.pts_to r2 (P.half_perm full_perm) v) `star` (GR.pts_to r2 (... | false |
Lens.fst | Lens.y | val y:lens point int | val y:lens point int | let y : lens point int = {
get = (fun p -> p.y);
put = (fun y' p -> {p with y=y'})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 73,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.point Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.point",
"Prims.int",
"Lens.__proj__Mkpoint__item__y",
"Lens.Mkpoint",
"Lens.__proj__Mkpoint__item__x",
"Lens.__proj__Mkpoint__item__z"
] | [] | false | false | false | true | false | let y:lens point int =
| { get = (fun p -> p.y); put = (fun y' p -> { p with y = y' }) } | false |
Lens.fst | Lens.center | val center:lens circle point | val center:lens circle point | let center : lens circle point = {
get = (fun c -> c.center);
put = (fun n c -> {c with center = n})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 90,
"start_col": 0,
"start_line": 87
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.circle Lens.point | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.circle",
"Lens.point",
"Lens.__proj__Mkcircle__item__center",
"Lens.Mkcircle",
"Lens.__proj__Mkcircle__item__radius"
] | [] | false | false | false | true | false | let center:lens circle point =
| { get = (fun c -> c.center); put = (fun n c -> { c with center = n }) } | false |
Lens.fst | Lens.z | val z:lens point int | val z:lens point int | let z : lens point int = {
get = (fun p -> p.z);
put = (fun z' p -> {p with z=z'})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 78,
"start_col": 0,
"start_line": 75
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.point Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.point",
"Prims.int",
"Lens.__proj__Mkpoint__item__z",
"Lens.Mkpoint",
"Lens.__proj__Mkpoint__item__x",
"Lens.__proj__Mkpoint__item__y"
] | [] | false | false | false | true | false | let z:lens point int =
| { get = (fun p -> p.z); put = (fun z' p -> { p with z = z' }) } | false |
Lens.fst | Lens.getY'' | val getY'' : c: Lens.circle -> Prims.int | let getY'' (c:circle) = c.center.y | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 105,
"start_col": 0,
"start_line": 105
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Lens.__proj__Mkpoint__item__y",
"Lens.__proj__Mkcircle__item__center",
"Prims.int"
] | [] | false | false | false | true | false | let getY'' (c: circle) =
| c.center.y | false | |
Lens.fst | Lens.getY | val getY : c: Lens.circle -> Prims.int | let getY (c:circle) = c |. center |. y | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 97,
"start_col": 0,
"start_line": 97
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Lens.op_Bar_Dot",
"Lens.point",
"Prims.int",
"Lens.center",
"Lens.y"
] | [] | false | false | false | true | false | let getY (c: circle) =
| c |. center |. y | false | |
Lens.fst | Lens.radius | val radius:lens circle nat | val radius:lens circle nat | let radius : lens circle nat= {
get = (fun c -> c.radius);
put = (fun n c -> {c with radius = n})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 94,
"start_col": 0,
"start_line": 91
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.circle Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.circle",
"Prims.nat",
"Lens.__proj__Mkcircle__item__radius",
"Lens.Mkcircle",
"Lens.__proj__Mkcircle__item__center"
] | [] | false | false | false | true | false | let radius:lens circle nat =
| { get = (fun c -> c.radius); put = (fun n c -> { c with radius = n }) } | false |
Lens.fst | Lens.getY' | val getY' : c: Lens.circle -> Prims.int | let getY' (c:circle) = c.[center |.. y] | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 100,
"start_col": 0,
"start_line": 100
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Lens.op_String_Access",
"Prims.int",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.center",
"Lens.y"
] | [] | false | false | false | true | false | let getY' (c: circle) =
| c.[ center |.. y ] | false | |
Lens.fst | Lens.setY | val setY : c: Lens.circle -> new_y: Prims.int -> Lens.circle | let setY (c:circle) (new_y: int) =
c.[center |.. y] <- new_y | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 109,
"start_col": 0,
"start_line": 108
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> new_y: Prims.int -> Lens.circle | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Prims.int",
"Lens.op_String_Assignment",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.center",
"Lens.y"
] | [] | false | false | false | true | false | let setY (c: circle) (new_y: int) =
| c.[ center |.. y ] <- new_y | false | |
Lens.fst | Lens.tedious_setY | val tedious_setY : c: Lens.circle -> new_y: Prims.int -> Lens.circle | let tedious_setY (c:circle) (new_y: int) =
{c with center = {c.center with y = new_y}} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 112,
"start_col": 0,
"start_line": 111
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> new_y: Prims.int -> Lens.circle | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Prims.int",
"Lens.Mkcircle",
"Lens.Mkpoint",
"Lens.__proj__Mkpoint__item__x",
"Lens.__proj__Mkpoint__item__z",
"Lens.point",
"Lens.__proj__Mkcircle__item__center",
"Lens.__proj__Mkcircle__item__radius"
] | [] | false | false | false | true | false | let tedious_setY (c: circle) (new_y: int) =
| { c with center = { c.center with y = new_y } } | false | |
Lens.fst | Lens.moveUp | val moveUp : c: Lens.circle -> offset_y: Prims.int -> Lens.circle | let moveUp (c:circle) (offset_y: int) =
c.[center |.. y] <- c.[center |.. y] + offset_y | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 116,
"start_col": 0,
"start_line": 115
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.circle -> offset_y: Prims.int -> Lens.circle | Prims.Tot | [
"total"
] | [] | [
"Lens.circle",
"Prims.int",
"Lens.op_String_Assignment",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.center",
"Lens.y",
"Prims.op_Addition",
"Lens.op_String_Access"
] | [] | false | false | false | true | false | let moveUp (c: circle) (offset_y: int) =
| c.[ center |.. y ] <- c.[ center |.. y ] + offset_y | false | |
Lens.fst | Lens.green | val green:lens rgb nat | val green:lens rgb nat | let green : lens rgb nat = {
get = (fun p -> p.green);
put = (fun z p -> {p with green=z})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 134,
"start_col": 0,
"start_line": 131
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.rgb Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.rgb",
"Prims.nat",
"Lens.__proj__Mkrgb__item__green",
"Lens.Mkrgb",
"Lens.__proj__Mkrgb__item__red",
"Lens.__proj__Mkrgb__item__blue"
] | [] | false | false | false | true | false | let green:lens rgb nat =
| { get = (fun p -> p.green); put = (fun z p -> { p with green = z }) } | false |
Lens.fst | Lens.red | val red:lens rgb nat | val red:lens rgb nat | let red : lens rgb nat = {
get = (fun p -> p.red);
put = (fun z p -> {p with red=z})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 130,
"start_col": 0,
"start_line": 127
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.rgb Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.rgb",
"Prims.nat",
"Lens.__proj__Mkrgb__item__red",
"Lens.Mkrgb",
"Lens.__proj__Mkrgb__item__green",
"Lens.__proj__Mkrgb__item__blue"
] | [] | false | false | false | true | false | let red:lens rgb nat =
| { get = (fun p -> p.red); put = (fun z p -> { p with red = z }) } | false |
Lens.fst | Lens.blue | val blue:lens rgb nat | val blue:lens rgb nat | let blue : lens rgb nat = {
get = (fun p -> p.blue);
put = (fun z p -> {p with blue=z})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 138,
"start_col": 0,
"start_line": 135
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens Lens.rgb Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.rgb",
"Prims.nat",
"Lens.__proj__Mkrgb__item__blue",
"Lens.Mkrgb",
"Lens.__proj__Mkrgb__item__red",
"Lens.__proj__Mkrgb__item__green"
] | [] | false | false | false | true | false | let blue:lens rgb nat =
| { get = (fun p -> p.blue); put = (fun z p -> { p with blue = z }) } | false |
Lens.fst | Lens.color | val color (#a: Type) : lens (colored a) rgb | val color (#a: Type) : lens (colored a) rgb | let color (#a:Type) : lens (colored a) rgb = {
get = (fun p -> p.color);
put = (fun z p -> {p with color=z})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 149,
"start_col": 0,
"start_line": 146
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens (Lens.colored a) Lens.rgb | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.colored",
"Lens.rgb",
"Lens.__proj__Mkcolored__item__color",
"Lens.Mkcolored",
"Lens.__proj__Mkcolored__item__payload",
"Lens.lens"
] | [] | false | false | false | true | false | let color (#a: Type) : lens (colored a) rgb =
| { get = (fun p -> p.color); put = (fun z p -> { p with color = z }) } | false |
Lens.fst | Lens.payload | val payload (#a: Type) : lens (colored a) a | val payload (#a: Type) : lens (colored a) a | let payload (#a:Type) : lens (colored a) a = {
get = (fun p -> p.payload);
put = (fun z p -> {p with payload=z})
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 153,
"start_col": 0,
"start_line": 150
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Lens.lens (Lens.colored a) a | Prims.Tot | [
"total"
] | [] | [
"Lens.Mklens",
"Lens.colored",
"Lens.__proj__Mkcolored__item__payload",
"Lens.Mkcolored",
"Lens.__proj__Mkcolored__item__color",
"Lens.lens"
] | [] | false | false | false | true | false | let payload (#a: Type) : lens (colored a) a =
| { get = (fun p -> p.payload); put = (fun z p -> { p with payload = z }) } | false |
Lens.fst | Lens.moveUp' | val moveUp' : c: Lens.colored Lens.circle -> offset_y: Prims.int -> Lens.colored Lens.circle | let moveUp' (c:colored circle) (offset_y: int) =
c.[payload |.. center |.. y] <- c.[payload |.. center |.. y] + offset_y | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 157,
"start_col": 0,
"start_line": 156
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.colored Lens.circle -> offset_y: Prims.int -> Lens.colored Lens.circle | Prims.Tot | [
"total"
] | [] | [
"Lens.colored",
"Lens.circle",
"Prims.int",
"Lens.op_String_Assignment",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.payload",
"Lens.center",
"Lens.y",
"Prims.op_Addition",
"Lens.op_String_Access"
] | [] | false | false | false | true | false | let moveUp' (c: colored circle) (offset_y: int) =
| c.[ payload |.. center |.. y ] <- c.[ payload |.. center |.. y ] + offset_y | false | |
Lens.fst | Lens.makeGreen | val makeGreen : c: Lens.colored Lens.circle -> Lens.colored Lens.circle | let makeGreen (c:colored circle) =
c.[color |.. (red || green || blue )] <- (0, 1), 0 | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 168,
"start_col": 0,
"start_line": 167
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Lens.colored Lens.circle -> Lens.colored Lens.circle | Prims.Tot | [
"total"
] | [] | [
"Lens.colored",
"Lens.circle",
"Lens.op_String_Assignment",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Lens.op_Bar_Dot_Dot",
"Lens.rgb",
"Lens.color",
"Lens.op_Bar_Bar",
"Lens.red",
"Lens.green",
"Lens.blue",
"FStar.Pervasives.Native.Mktuple2"
] | [] | false | false | false | true | false | let makeGreen (c: colored circle) =
| c.[ color |.. (red || green || blue) ] <- (0, 1), 0 | false | |
Lens.fst | Lens.op_Array_Assignment | val op_Array_Assignment : x: FStar.ST.ref a -> m: Lens.lens a b -> y: b -> FStar.ST.STATE Prims.unit | let op_Array_Assignment #a #b (x:ref a) (m:lens a b) (y:b)
= let _ = (x |::= (st m)) y in () | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 232,
"start_col": 0,
"start_line": 231
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.ST.ref a -> m: Lens.lens a b -> y: b -> FStar.ST.STATE Prims.unit | FStar.ST.STATE | [
"trivial_postcondition"
] | [] | [
"FStar.ST.ref",
"Lens.lens",
"Prims.unit",
"Lens.op_Bar_Colon_Colon_Equals",
"Lens.st"
] | [] | false | true | false | false | false | let ( .()<- ) #a #b (x: ref a) (m: lens a b) (y: b) =
| let _ = (x |::= (st m)) y in
() | false | |
Lens.fst | Lens.op_Array_Access | val op_Array_Access : x: FStar.ST.ref a -> m: Lens.lens a b -> FStar.ST.ST b | let op_Array_Access #a #b (x:ref a) (m:lens a b)
= x |:. (st m) | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 236,
"start_col": 0,
"start_line": 235
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.ST.ref a -> m: Lens.lens a b -> FStar.ST.ST b | FStar.ST.ST | [] | [] | [
"FStar.ST.ref",
"Lens.lens",
"Lens.op_Bar_Colon_Dot",
"Lens.st"
] | [] | false | true | false | false | false | let ( .() ) #a #b (x: ref a) (m: lens a b) =
| x |:. (st m) | false | |
Lens.fst | Lens.mutate | val mutate : c: FStar.ST.ref (Lens.colored Lens.circle) -> FStar.ST.STATE Prims.unit | let mutate (c:ref (colored circle)) =
c.(color |.. (red || green || blue)) <- (0, 1), 2 | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 240,
"start_col": 0,
"start_line": 239
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: FStar.ST.ref (Lens.colored Lens.circle) -> FStar.ST.STATE Prims.unit | FStar.ST.STATE | [
"trivial_postcondition"
] | [] | [
"FStar.ST.ref",
"Lens.colored",
"Lens.circle",
"Lens.op_Array_Assignment",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Lens.op_Bar_Dot_Dot",
"Lens.rgb",
"Lens.color",
"Lens.op_Bar_Bar",
"Lens.red",
"Lens.green",
"Lens.blue",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit"
] | [] | false | true | false | false | false | let mutate (c: ref (colored circle)) =
| c.(color |.. (red || green || blue)) <- (0, 1), 2 | false | |
FStar.ErasedLogic.fst | FStar.ErasedLogic.gex_proj1 | val gex_proj1 : #a:Type -> #p:(a->Type) -> (ex a p) -> GTot a | val gex_proj1 : #a:Type -> #p:(a->Type) -> (ex a p) -> GTot a | let gex_proj1 #a #p e = (reveal (ex_proj1 e)) | {
"file_name": "ulib/legacy/FStar.ErasedLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 44,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.ErasedLogic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: FStar.ErasedLogic.ex a p -> Prims.GTot a | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.ErasedLogic.ex",
"FStar.Ghost.reveal",
"FStar.ErasedLogic.ex_proj1"
] | [] | false | false | false | false | false | let gex_proj1 #a #p e =
| (reveal (ex_proj1 e)) | false |
Lens.fst | Lens.mutate3 | val mutate3 : c: FStar.ST.ref (Lens.colored (FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle))))
-> FStar.ST.STATE Prims.unit | let mutate3 (c:ref (colored (ref (colored (ref circle))))) =
((c.(payload)).(payload)).(center |.. x) <- 17 | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 254,
"start_col": 0,
"start_line": 253
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: FStar.ST.ref (Lens.colored (FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle))))
-> FStar.ST.STATE Prims.unit | FStar.ST.STATE | [
"trivial_postcondition"
] | [] | [
"FStar.ST.ref",
"Lens.colored",
"Lens.circle",
"Lens.op_Array_Assignment",
"Prims.int",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.center",
"Lens.x",
"Prims.unit",
"Lens.op_Array_Access",
"Lens.payload"
] | [] | false | true | false | false | false | let mutate3 (c: ref (colored (ref (colored (ref circle))))) =
| ((c.(payload)).(payload)).(center |.. x) <- 17 | false | |
Lens.fst | Lens.mutate2 | val mutate2 : c: FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle)) -> FStar.ST.STATE Prims.unit | let mutate2 (c:ref (colored (ref circle))) =
c.(color |.. (red || green || blue)) <- (0, 1), 2;
(c.(payload)).(center |.. x) <- 17 | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 246,
"start_col": 0,
"start_line": 244
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: FStar.ST.ref (Lens.colored (FStar.ST.ref Lens.circle)) -> FStar.ST.STATE Prims.unit | FStar.ST.STATE | [
"trivial_postcondition"
] | [] | [
"FStar.ST.ref",
"Lens.colored",
"Lens.circle",
"Lens.op_Array_Assignment",
"Prims.int",
"Lens.op_Bar_Dot_Dot",
"Lens.point",
"Lens.center",
"Lens.x",
"Prims.unit",
"Lens.op_Array_Access",
"Lens.payload",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Lens.rgb",
"Lens.color",
"Lens.o... | [] | false | true | false | false | false | let mutate2 (c: ref (colored (ref circle))) =
| c.(color |.. (red || green || blue)) <- (0, 1), 2;
(c.(payload)).(center |.. x) <- 17 | false | |
FStar.ErasedLogic.fst | FStar.ErasedLogic.ex_proj1 | val ex_proj1 : #a:Type -> #p:(a->Type) -> ex a p -> Tot (erased a) | val ex_proj1 : #a:Type -> #p:(a->Type) -> ex a p -> Tot (erased a) | let ex_proj1 #a #p e = (elift1 (exists_proj1 #a #p)) e | {
"file_name": "ulib/legacy/FStar.ErasedLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 40,
"start_col": 0,
"start_line": 40
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.ErasedLogic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: FStar.ErasedLogic.ex a p -> FStar.Ghost.erased a | Prims.Tot | [
"total"
] | [] | [
"FStar.ErasedLogic.ex",
"FStar.Ghost.elift1",
"Prims.l_Exists",
"FStar.ErasedLogic.exists_proj1",
"FStar.Ghost.erased"
] | [] | false | false | false | false | false | let ex_proj1 #a #p e =
| (elift1 (exists_proj1 #a #p)) e | false |
EverParse3d.Actions.Base.fst | EverParse3d.Actions.Base.validate_dep_pair_with_refinement' | val validate_dep_pair_with_refinement'
(name1: string)
(#nz1: _)
(#k1: parser_kind nz1 _)
(#t1: _)
(#p1: parser k1 t1)
(#inv1 #disj1 #l1: _)
(v1: validate_with_action_t p1 inv1 disj1 l1 true)
(r1: leaf_reader p1)
(f: (t1 -> bool))
(#nz2 #wk2: _)
(#k2: pa... | val validate_dep_pair_with_refinement'
(name1: string)
(#nz1: _)
(#k1: parser_kind nz1 _)
(#t1: _)
(#p1: parser k1 t1)
(#inv1 #disj1 #l1: _)
(v1: validate_with_action_t p1 inv1 disj1 l1 true)
(r1: leaf_reader p1)
(f: (t1 -> bool))
(#nz2 #wk2: _)
(#k2: pa... | let validate_dep_pair_with_refinement'
(name1: string)
#nz1 (#k1:parser_kind nz1 _) #t1 (#p1:parser k1 t1)
#inv1 #disj1 #l1 (v1:validate_with_action_t p1 inv1 disj1 l1 true) (r1: leaf_reader p1)
(f: t1 -> bool)
#nz2 #wk2 (#k2:parser_kind nz2 wk2) (#t2:refine _ f -> Type) (#p2:(x:refine _ f... | {
"file_name": "src/3d/prelude/EverParse3d.Actions.Base.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 11,
"end_line": 680,
"start_col": 0,
"start_line": 636
} | module EverParse3d.Actions.Base
friend EverParse3d.Kinds
friend EverParse3d.Prelude
open FStar.HyperStack.ST
open LowStar.Buffer
open LowStar.BufferOps
module B = LowStar.Buffer
module I = EverParse3d.InputStream.Base
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
module CP = EverParse3d.CopyBuffer
modul... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Comment.fsti.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.List.fsti.checked",
"LowParse.Spec.FLData.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.Combinators",
"short_module": "LPC"
},
{
"abbrev": true,
"full_module": "LowParse.Low.Base",
"short_module": "LPL"
},
{
"abbrev": true,
"full_module": "LowParse.Spec.Base",
"short_module": "LP"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
name1: Prims.string ->
v1: EverParse3d.Actions.Base.validate_with_action_t p1 inv1 disj1 l1 true ->
r1: EverParse3d.Actions.Base.leaf_reader p1 ->
f: (_: t1 -> Prims.bool) ->
v2:
(x: EverParse3d.Prelude.refine t1 f
-> EverParse3d.Actions.Base.validate_with_action_t (p2 x) inv2 disj2... | Prims.Tot | [
"total"
] | [] | [
"Prims.string",
"Prims.bool",
"EverParse3d.Kinds.parser_kind",
"EverParse3d.Kinds.WeakKindStrongPrefix",
"EverParse3d.Prelude.parser",
"EverParse3d.Actions.Base.slice_inv",
"EverParse3d.Actions.Base.disjointness_pre",
"EverParse3d.Actions.Base.eloc",
"EverParse3d.Actions.Base.validate_with_action_t"... | [] | false | false | false | false | false | let validate_dep_pair_with_refinement'
(name1: string)
#nz1
(#k1: parser_kind nz1 _)
#t1
(#p1: parser k1 t1)
#inv1
#disj1
#l1
(v1: validate_with_action_t p1 inv1 disj1 l1 true)
(r1: leaf_reader p1)
(f: (t1 -> bool))
#nz2
#wk2
(#k2: pars... | fun ctxt error_handler_fn input input_length startPosition ->
let h0 = HST.get () in
LPC.parse_dtuple2_eq' #_ #_ (p1 `LPC.parse_filter` f) #_ #t2 p2 (I.get_remaining input h0);
LPC.parse_filter_eq p1 f (I.get_remaining input h0);
[@@ (rename_let ("positionAfter" ^ name1)) ]let res =
v1 ctxt error_handler_fn... | false |
BinarySearchTree0.fst | BinarySearchTree0.search | val search : int -> tree -> bool | val search : int -> tree -> bool | let rec search x t =
match t with
| Leaf -> false
| Node n t1 t2 -> if x = n then true
else if x < n then search x t1
else search x t2 | {
"file_name": "examples/data_structures/BinarySearchTree0.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 28,
"start_col": 0,
"start_line": 23
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTree0.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinarySearchTree0.tree -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTree0.tree",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTree0.search"
] | [
"recursion"
] | false | false | false | true | false | let rec search x t =
| match t with
| Leaf -> false
| Node n t1 t2 -> if x = n then true else if x < n then search x t1 else search x t2 | false |
Lens.fst | Lens.st | val st (#a #b: _) (l: lens a b) : stlens l | val st (#a #b: _) (l: lens a b) : stlens l | let st #a #b (l:lens a b) : stlens l = {
st_get = (fun (r:ref a) -> (!r).[l]);
st_put = (fun (x:b) (r:ref a) -> r := (!r.[l] <- x); r)
} | {
"file_name": "examples/data_structures/Lens.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 1,
"end_line": 206,
"start_col": 0,
"start_line": 203
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Ref.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "Lens.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Ref",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Heap",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Lens.lens a b -> Lens.stlens l | Prims.Tot | [
"total"
] | [] | [
"Lens.lens",
"Lens.Mkstlens",
"FStar.ST.ref",
"Lens.op_String_Access",
"FStar.Ref.op_Bang",
"Prims.unit",
"FStar.Ref.op_Colon_Equals",
"Lens.op_String_Assignment",
"Lens.stlens"
] | [] | false | false | false | false | false | let st #a #b (l: lens a b) : stlens l =
| {
st_get = (fun (r: ref a) -> (!r).[ l ]);
st_put
=
(fun (x: b) (r: ref a) ->
r := (!r.[ l ] <- x);
r)
} | false |
BinarySearchTree0.fst | BinarySearchTree0.insert | val insert : int -> tree -> tree | val insert : int -> tree -> tree | let rec insert x t =
match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> if x = n then t
else if x < n then Node n (insert x t1) t2
else Node n t1 (insert x t2) | {
"file_name": "examples/data_structures/BinarySearchTree0.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 36,
"start_col": 0,
"start_line": 31
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTree0.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinarySearchTree0.tree -> BinarySearchTree0.tree | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTree0.tree",
"BinarySearchTree0.Node",
"BinarySearchTree0.Leaf",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTree0.insert"
] | [
"recursion"
] | false | false | false | true | false | let rec insert x t =
| match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 ->
if x = n then t else if x < n then Node n (insert x t1) t2 else Node n t1 (insert x t2) | false |
Hacl.Hash.MD5.fst | Hacl.Hash.MD5.update_last | val update_last: update_last_st (|MD5, ()|) | val update_last: update_last_st (|MD5, ()|) | let update_last: update_last_st (|MD5, ()|) =
Hacl.Hash.MD.mk_update_last MD5 update_multi pad | {
"file_name": "code/hash/Hacl.Hash.MD5.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 14,
"start_col": 0,
"start_line": 13
} | module Hacl.Hash.MD5
open Hacl.Hash.Definitions
open Spec.Hash.Definitions
include Hacl.Hash.Core.MD5
friend Hacl.Hash.MD
let update_multi: update_multi_st (|MD5, ()|) =
Hacl.Hash.MD.mk_update_multi MD5 update | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Hacl.Hash.MD.fst.checked",
"Hacl.Hash.Definitions.fst.checked",
"Hacl.Hash.Core.MD5.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Hash.MD... | [
{
"abbrev": false,
"full_module": "Hacl.Hash.Core.MD5",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Hash.Definitions.update_last_st (| Spec.Hash.Definitions.MD5, () |) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Hash.MD.mk_update_last",
"Spec.Hash.Definitions.MD5",
"Hacl.Hash.MD5.update_multi",
"Hacl.Hash.Core.MD5.pad",
"Hacl.Hash.Definitions.update_last_st",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec"
] | [] | false | false | false | false | false | let update_last:update_last_st (| MD5, () |) =
| Hacl.Hash.MD.mk_update_last MD5 update_multi pad | false |
Hacl.Hash.MD5.fst | Hacl.Hash.MD5.update_multi | val update_multi: update_multi_st (|MD5, ()|) | val update_multi: update_multi_st (|MD5, ()|) | let update_multi: update_multi_st (|MD5, ()|) =
Hacl.Hash.MD.mk_update_multi MD5 update | {
"file_name": "code/hash/Hacl.Hash.MD5.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 11,
"start_col": 0,
"start_line": 10
} | module Hacl.Hash.MD5
open Hacl.Hash.Definitions
open Spec.Hash.Definitions
include Hacl.Hash.Core.MD5
friend Hacl.Hash.MD | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Hacl.Hash.MD.fst.checked",
"Hacl.Hash.Definitions.fst.checked",
"Hacl.Hash.Core.MD5.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Hash.MD... | [
{
"abbrev": false,
"full_module": "Hacl.Hash.Core.MD5",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Hash.Definitions.update_multi_st (| Spec.Hash.Definitions.MD5, () |) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Hash.MD.mk_update_multi",
"Spec.Hash.Definitions.MD5",
"Hacl.Hash.Core.MD5.update",
"Hacl.Hash.Definitions.update_multi_st",
"Prims.Mkdtuple2",
"Spec.Hash.Definitions.hash_alg",
"Hacl.Hash.Definitions.m_spec"
] | [] | false | false | false | false | false | let update_multi:update_multi_st (| MD5, () |) =
| Hacl.Hash.MD.mk_update_multi MD5 update | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_round | val eval_round : state: Vale.Def.Types_s.quad32 -> round_key: Vale.Def.Types_s.quad32 -> Vale.Def.Types_s.quad32 | let eval_round (state round_key:quad32) =
let s = sub_bytes state in
let s = shift_rows s in
let s = mix_columns s in
let s = quad32_xor s round_key in
s | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 37,
"start_col": 0,
"start_line": 32
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | state: Vale.Def.Types_s.quad32 -> round_key: Vale.Def.Types_s.quad32 -> Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.quad32_xor",
"Vale.AES.AES_BE_s.mix_columns",
"Vale.AES.AES_BE_s.shift_rows",
"Vale.AES.AES_common_s.sub_bytes"
] | [] | false | false | false | true | false | let eval_round (state round_key: quad32) =
| let s = sub_bytes state in
let s = shift_rows s in
let s = mix_columns s in
let s = quad32_xor s round_key in
s | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_rounds | val eval_rounds : _: Vale.Def.Types_s.quad32 ->
_: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
_: n: Prims.nat{n < FStar.Seq.Base.length _}
-> Vale.Def.Types_s.quad32 | let eval_rounds = opaque_make eval_rounds_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 64,
"end_line": 44,
"start_col": 19,
"start_line": 44
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
_: Vale.Def.Types_s.quad32 ->
_: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
_: n: Prims.nat{n < FStar.Seq.Base.length _}
-> Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Vale.AES.AES_BE_s.eval_rounds_def"
] | [] | false | false | false | false | false | let eval_rounds =
| opaque_make eval_rounds_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.is_aes_key_word | val is_aes_key_word (alg: algorithm) (s: seq nat32) : prop0 | val is_aes_key_word (alg: algorithm) (s: seq nat32) : prop0 | let is_aes_key_word (alg:algorithm) (s:seq nat32) : prop0 = length s == nk alg | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 29,
"start_col": 0,
"start_line": 29
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | alg: Vale.AES.AES_common_s.algorithm -> s: FStar.Seq.Base.seq Vale.Def.Types_s.nat32
-> Vale.Def.Prop_s.prop0 | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Vale.AES.AES_common_s.nk",
"Vale.Def.Prop_s.prop0"
] | [] | false | false | false | true | false | let is_aes_key_word (alg: algorithm) (s: seq nat32) : prop0 =
| length s == nk alg | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_rounds_reveal | val eval_rounds_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.eval_rounds == Vale.AES.AES_BE_s.eval_rounds_def) | let eval_rounds_reveal = opaque_revealer (`%eval_rounds) eval_rounds eval_rounds_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 45,
"start_col": 12,
"start_line": 45
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.eval_rounds == Vale.AES.AES_BE_s.eval_rounds_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Vale.AES.AES_BE_s.eval_rounds",
"Vale.AES.AES_BE_s.eval_rounds_def"
] | [] | true | false | true | false | false | let eval_rounds_reveal =
| opaque_revealer (`%eval_rounds) eval_rounds eval_rounds_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_cipher_reveal | val eval_cipher_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.eval_cipher == Vale.AES.AES_BE_s.eval_cipher_def) | let eval_cipher_reveal = opaque_revealer (`%eval_cipher) eval_cipher eval_cipher_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 58,
"start_col": 12,
"start_line": 58
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.eval_cipher == Vale.AES.AES_BE_s.eval_cipher_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"Prims.l_True",
"Vale.AES.AES_BE_s.eval_cipher",
"Vale.AES.AES_BE_s.eval_... | [] | true | false | true | false | false | let eval_cipher_reveal =
| opaque_revealer (`%eval_cipher) eval_cipher eval_cipher_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_cipher | val eval_cipher : alg: Vale.AES.AES_common_s.algorithm ->
input: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | let eval_cipher = opaque_make eval_cipher_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 64,
"end_line": 57,
"start_col": 19,
"start_line": 57
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
input: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | Prims.Pure | [] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"Prims.l_True",
"Vale.AES.AES_BE_s.eval_cipher_def"
] | [] | false | false | false | false | false | let eval_cipher =
| opaque_make eval_cipher_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.expand_key | val expand_key : _: Vale.AES.AES_common_s.algorithm ->
_: Vale.AES.AES_BE_s.aes_key_word _ ->
_: size: Prims.nat{size <= Vale.AES.AES_common_s.nb * (Vale.AES.AES_common_s.nr _ + 1)}
-> ek: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 {FStar.Seq.Base.length ek == _} | let expand_key = opaque_make expand_key_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 78,
"start_col": 19,
"start_line": 78
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
_: Vale.AES.AES_common_s.algorithm ->
_: Vale.AES.AES_BE_s.aes_key_word _ ->
_: size: Prims.nat{size <= Vale.AES.AES_common_s.nb * (Vale.AES.AES_common_s.nr _ + 1)}
-> ek: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 {FStar.Seq.Base.length ek == _} | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.AES.AES_common_s.algorithm",
"Vale.AES.AES_BE_s.aes_key_word",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Vale.AES.AES_common_s.nb",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.... | [] | false | false | false | false | false | let expand_key =
| opaque_make expand_key_def | false | |
Steel.Semantics.Instantiate.fst | Steel.Semantics.Instantiate.is_unit | val is_unit: Prims.unit -> Lemma (S.is_unit emp equiv star) | val is_unit: Prims.unit -> Lemma (S.is_unit emp equiv star) | let is_unit ()
: Lemma (S.is_unit emp equiv star)
= let aux (y:slprop)
: Lemma (star emp y `equiv` y /\ star y emp `equiv` y)
= emp_unit y; star_commutative emp y
in
Classical.forall_intro aux | {
"file_name": "lib/steel/Steel.Semantics.Instantiate.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 30,
"end_line": 27,
"start_col": 0,
"start_line": 21
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Semantics.Hoare.MST.fst.checked",
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.Semantics.Instantiate.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.Semantics.Hoare.MST",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": true,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Steel.Semantics.Hoare.MST.is_unit Steel.Memory.emp Steel.Memory.equiv Steel.Memory.star
) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.forall_intro",
"Steel.Memory.slprop",
"Prims.l_and",
"Steel.Memory.equiv",
"Steel.Memory.star",
"Steel.Memory.emp",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Steel.Memory.star_commutative",
"Steel.Memory.emp_unit",
"Steel.Seman... | [] | false | false | true | false | false | let is_unit () : Lemma (S.is_unit emp equiv star) =
| let aux (y: slprop) : Lemma ((star emp y) `equiv` y /\ (star y emp) `equiv` y) =
emp_unit y;
star_commutative emp y
in
Classical.forall_intro aux | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.expand_key_reveal | val expand_key_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.expand_key == Vale.AES.AES_BE_s.expand_key_def) | let expand_key_reveal = opaque_revealer (`%expand_key) expand_key expand_key_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 92,
"end_line": 79,
"start_col": 12,
"start_line": 79
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.expand_key == Vale.AES.AES_BE_s.expand_key_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.AES.AES_common_s.algorithm",
"Vale.AES.AES_BE_s.aes_key_word",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Vale.AES.AES_common_s.nb",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"FStar.Seq.Base.seq",
"Vale.Def.Type... | [] | true | false | true | false | false | let expand_key_reveal =
| opaque_revealer (`%expand_key) expand_key expand_key_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_cipher_def | val eval_cipher_def (alg: algorithm) (input: quad32) (round_keys: seq quad32)
: Pure quad32 (requires length round_keys == nr alg + 1) (ensures fun _ -> True) | val eval_cipher_def (alg: algorithm) (input: quad32) (round_keys: seq quad32)
: Pure quad32 (requires length round_keys == nr alg + 1) (ensures fun _ -> True) | let eval_cipher_def (alg:algorithm) (input:quad32) (round_keys:seq quad32) : Pure quad32
(requires length round_keys == nr alg + 1)
(ensures fun _ -> True)
=
let state = quad32_xor input (index round_keys 0) in
let state = eval_rounds_def state round_keys (nr alg - 1) in
let state = sub_bytes state in
let... | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 56,
"start_col": 0,
"start_line": 47
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
input: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | Prims.Pure | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32_xor",
"FStar.Seq.Base.index",
"Vale.AES.AES_common_s.nr",
"Vale.AES.AES_BE_s.shift_rows",
"Vale.AES.AES_common_s.sub_bytes",
"Vale.AES.AES_BE_s.eval_rounds_def",
"Prims.op_Subtraction",
"... | [] | false | false | false | false | false | let eval_cipher_def (alg: algorithm) (input: quad32) (round_keys: seq quad32)
: Pure quad32 (requires length round_keys == nr alg + 1) (ensures fun _ -> True) =
| let state = quad32_xor input (index round_keys 0) in
let state = eval_rounds_def state round_keys (nr alg - 1) in
let state = sub_bytes state in
let state = shift_rows state in
let state = quad32_xor state (index round_keys (nr alg)) in
state | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.aes_encrypt_word_reveal | val aes_encrypt_word_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.aes_encrypt_word == Vale.AES.AES_BE_s.aes_encrypt_word_def) | let aes_encrypt_word_reveal = opaque_revealer (`%aes_encrypt_word) aes_encrypt_word aes_encrypt_word_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 116,
"end_line": 102,
"start_col": 12,
"start_line": 102
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.AES_BE_s.aes_encrypt_word == Vale.AES.AES_BE_s.aes_encrypt_word_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Prims.l_True",
"Vale.AES.AES_BE_s.aes_encrypt_word",
"Vale.AES.AES_BE_s.aes_encrypt_word_def"
] | [] | true | false | true | false | false | let aes_encrypt_word_reveal =
| opaque_revealer (`%aes_encrypt_word) aes_encrypt_word aes_encrypt_word_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.aes_encrypt_word | val aes_encrypt_word : alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 ->
input: Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | let aes_encrypt_word = opaque_make aes_encrypt_word_def | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 101,
"start_col": 19,
"start_line": 101
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 ->
input: Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | Prims.Pure | [] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Prims.l_True",
"Vale.AES.AES_BE_s.aes_encrypt_word_def"
] | [] | false | false | false | false | false | let aes_encrypt_word =
| opaque_make aes_encrypt_word_def | false | |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.eval_rounds_def | val eval_rounds_def (init: quad32) (round_keys: seq quad32) (n: nat{n < length round_keys}) : quad32 | val eval_rounds_def (init: quad32) (round_keys: seq quad32) (n: nat{n < length round_keys}) : quad32 | let rec eval_rounds_def (init:quad32) (round_keys:seq quad32) (n:nat{n < length round_keys}) : quad32 =
if n = 0 then
init
else
eval_round (eval_rounds_def init round_keys (n - 1)) (index round_keys n) | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 77,
"end_line": 43,
"start_col": 0,
"start_line": 39
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
init: Vale.Def.Types_s.quad32 ->
round_keys: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
n: Prims.nat{n < FStar.Seq.Base.length round_keys}
-> Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Vale.AES.AES_BE_s.eval_round",
"Vale.AES.AES_BE_s.eval_rounds_def",
"Prims.op_Subtraction",
"FStar.Seq.Base.index"
] | [
"recursion"
] | false | false | false | false | false | let rec eval_rounds_def (init: quad32) (round_keys: seq quad32) (n: nat{n < length round_keys})
: quad32 =
| if n = 0 then init else eval_round (eval_rounds_def init round_keys (n - 1)) (index round_keys n) | false |
Steel.Semantics.Instantiate.fst | Steel.Semantics.Instantiate.state_obeys_st_laws | val state_obeys_st_laws (uses:inames)
: Lemma (S.st_laws (state0 uses)) | val state_obeys_st_laws (uses:inames)
: Lemma (S.st_laws (state0 uses)) | let state_obeys_st_laws uses =
Classical.forall_intro_3 star_associative;
Classical.forall_intro_2 star_commutative;
is_unit ();
FStar.Classical.forall_intro_3 disjoint_join;
let aux (m0 m1:mem)
: Lemma (requires disjoint m0 m1)
(ensures join m0 m1 == join m1 m0)
[SMTPat (disjoint ... | {
"file_name": "lib/steel/Steel.Semantics.Instantiate.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 4,
"end_line": 57,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Semantics.Hoare.MST.fst.checked",
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.Semantics.Instantiate.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.Semantics.Hoare.MST",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": true,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | uses: Steel.Memory.inames
-> FStar.Pervasives.Lemma
(ensures Steel.Semantics.Hoare.MST.st_laws (Steel.Semantics.Instantiate.state0 uses)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Steel.Memory.inames",
"Steel.Memory.slprop",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_imp",
"Steel.Memory.equiv",
"Steel.Memory.star",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil",
"Steel.Memory.equiv_extensional_on_star",
"Steel.Memory.m... | [] | false | false | true | false | false | let state_obeys_st_laws uses =
| Classical.forall_intro_3 star_associative;
Classical.forall_intro_2 star_commutative;
is_unit ();
FStar.Classical.forall_intro_3 disjoint_join;
let aux (m0 m1: mem)
: Lemma (requires disjoint m0 m1) (ensures join m0 m1 == join m1 m0) [SMTPat (disjoint m0 m1)] =
join_commutative m0 m1
in
let aux (m0 m1 m2: mem)
... | false |
Steel.Semantics.Instantiate.fst | Steel.Semantics.Instantiate.state_correspondence | val state_correspondence (inames:inames)
: Lemma
(let s = state_uses inames in
s.S.hprop == slprop /\
s.S.mem == mem /\
s.S.interp == interp /\
s.S.star == star /\
s.S.locks_invariant == locks_invariant inames /\
(forall (p q frame:slprop)
(m0:mem{interp (p `star` frame `star... | val state_correspondence (inames:inames)
: Lemma
(let s = state_uses inames in
s.S.hprop == slprop /\
s.S.mem == mem /\
s.S.interp == interp /\
s.S.star == star /\
s.S.locks_invariant == locks_invariant inames /\
(forall (p q frame:slprop)
(m0:mem{interp (p `star` frame `star... | let state_correspondence inames =
let s = state_uses inames in
assert_norm (s.S.hprop == slprop) ;
assert_norm (s.S.mem == mem) ;
assert_norm (s.S.interp == interp);
assert_norm (s.S.star == star);
assert_norm (s.S.locks_invariant == locks_invariant inames) | {
"file_name": "lib/steel/Steel.Semantics.Instantiate.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 63,
"end_line": 66,
"start_col": 0,
"start_line": 60
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Semantics.Hoare.MST.fst.checked",
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.Semantics.Instantiate.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.Semantics.Hoare.MST",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": true,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | inames: Steel.Memory.inames
-> FStar.Pervasives.Lemma
(ensures
(let s = Steel.Semantics.Instantiate.state_uses inames in
Mkst0?.hprop s == Steel.Memory.slprop /\ Mkst0?.mem s == Steel.Memory.mem /\
Mkst0?.interp s == Steel.Memory.interp /\ Mkst0?.star s == Steel.Memory.star /\
Mkst0?... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Steel.Memory.inames",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"Steel.Semantics.Hoare.MST.__proj__Mkst0__item__mem",
"Steel.Memory.slprop",
"Steel.Semantics.Hoare.MST.__proj__Mkst0__item__locks_invariant",
"Steel.Memory.locks_invariant",
"Prims.unit",
"Steel.Semantics.Hoare.MST.__proj__Mkst0__i... | [] | true | false | true | false | false | let state_correspondence inames =
| let s = state_uses inames in
assert_norm (s.S.hprop == slprop);
assert_norm (s.S.mem == mem);
assert_norm (s.S.interp == interp);
assert_norm (s.S.star == star);
assert_norm (s.S.locks_invariant == locks_invariant inames) | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.expand_key_def | val expand_key_def
(alg: algorithm)
(key: aes_key_word alg)
(size: nat{size <= (nb * ((nr alg) + 1))})
: (ek: seq nat32 {length ek == size}) | val expand_key_def
(alg: algorithm)
(key: aes_key_word alg)
(size: nat{size <= (nb * ((nr alg) + 1))})
: (ek: seq nat32 {length ek == size}) | let rec expand_key_def (alg:algorithm) (key:aes_key_word alg) (size:nat{size <= (nb * ((nr alg) + 1))})
: (ek:seq nat32 {length ek == size}) =
if size = 0 then empty
else
let w = expand_key_def alg key (size - 1) in
let i = size - 1 in
if 0 <= i && i < nk alg then
append w (create 1 (index key i... | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 67,
"end_line": 77,
"start_col": 0,
"start_line": 60
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: Vale.AES.AES_BE_s.aes_key_word alg ->
size: Prims.nat{size <= Vale.AES.AES_common_s.nb * (Vale.AES.AES_common_s.nr alg + 1)}
-> ek: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 {FStar.Seq.Base.length ek == size} | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.AES.AES_BE_s.aes_key_word",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Vale.AES.AES_common_s.nb",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.empty",
"Vale.Def.Typ... | [
"recursion"
] | false | false | false | false | false | let rec expand_key_def
(alg: algorithm)
(key: aes_key_word alg)
(size: nat{size <= (nb * ((nr alg) + 1))})
: (ek: seq nat32 {length ek == size}) =
| if size = 0
then empty
else
let w = expand_key_def alg key (size - 1) in
let i = size - 1 in
if 0 <= i && i < nk alg
then append w (create 1 (index key i))
else
let temp =
if i % (nk alg) = 0
then nat32_xor (sub_word (rot_word (index w (i - 1)))) (aes_rcon ((i / (nk alg)) - 1))
else if n... | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.key_schedule_to_round_keys | val key_schedule_to_round_keys (rounds: nat) (w: seq nat32 {length w >= 4 * rounds})
: (round_keys: seq quad32 {length round_keys == rounds}) | val key_schedule_to_round_keys (rounds: nat) (w: seq nat32 {length w >= 4 * rounds})
: (round_keys: seq quad32 {length round_keys == rounds}) | let rec key_schedule_to_round_keys (rounds:nat) (w:seq nat32 {length w >= 4 * rounds})
: (round_keys:seq quad32 {length round_keys == rounds}) =
if rounds = 0 then empty
else
let round_keys = key_schedule_to_round_keys (rounds - 1) w in
let rk = Mkfour (index w (4 * rounds - 1)) (index w (4 * rounds - 2))... | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 87,
"start_col": 0,
"start_line": 81
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
rounds: Prims.nat ->
w: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 {FStar.Seq.Base.length w >= 4 * rounds}
-> round_keys:
FStar.Seq.Base.seq Vale.Def.Types_s.quad32 {FStar.Seq.Base.length round_keys == rounds} | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"FStar.Seq.Base.length",
"FStar.Mul.op_Star",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.empty",
"Vale.Def.Types_s.quad32",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Seq.Base... | [
"recursion"
] | false | false | false | false | false | let rec key_schedule_to_round_keys (rounds: nat) (w: seq nat32 {length w >= 4 * rounds})
: (round_keys: seq quad32 {length round_keys == rounds}) =
| if rounds = 0
then empty
else
let round_keys = key_schedule_to_round_keys (rounds - 1) w in
let rk =
Mkfour (index w (4 * rounds - 1))
(index w (4 * rounds - 2))
(index w (4 * rounds - 3))
(index w (4 * rounds - 4))
in
append round_keys (create 1 rk) | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.key_to_round_keys_word | val key_to_round_keys_word (alg: algorithm) (key: seq nat32)
: Pure (seq quad32)
(requires is_aes_key_word alg key)
(ensures fun round_keys -> length round_keys == nr alg + 1) | val key_to_round_keys_word (alg: algorithm) (key: seq nat32)
: Pure (seq quad32)
(requires is_aes_key_word alg key)
(ensures fun round_keys -> length round_keys == nr alg + 1) | let key_to_round_keys_word (alg:algorithm) (key:seq nat32) : Pure (seq quad32)
(requires is_aes_key_word alg key)
(ensures fun round_keys -> length round_keys == nr alg + 1)
=
key_schedule_to_round_keys (nr alg + 1) (expand_key alg key (nb * (nr alg + 1))) | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 94,
"start_col": 0,
"start_line": 90
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | alg: Vale.AES.AES_common_s.algorithm -> key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32
-> Prims.Pure (FStar.Seq.Base.seq Vale.Def.Types_s.quad32) | Prims.Pure | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.AES.AES_BE_s.key_schedule_to_round_keys",
"Prims.op_Addition",
"Vale.AES.AES_common_s.nr",
"Vale.AES.AES_BE_s.expand_key",
"FStar.Mul.op_Star",
"Vale.AES.AES_common_s.nb",
"Vale.Def.Types_s.quad32",
"Vale.AE... | [] | false | false | false | false | false | let key_to_round_keys_word (alg: algorithm) (key: seq nat32)
: Pure (seq quad32)
(requires is_aes_key_word alg key)
(ensures fun round_keys -> length round_keys == nr alg + 1) =
| key_schedule_to_round_keys (nr alg + 1) (expand_key alg key (nb * (nr alg + 1))) | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.aes_encrypt_word_def | val aes_encrypt_word_def (alg: algorithm) (key: seq nat32) (input: quad32)
: Pure quad32 (requires is_aes_key_word alg key) (ensures fun _ -> True) | val aes_encrypt_word_def (alg: algorithm) (key: seq nat32) (input: quad32)
: Pure quad32 (requires is_aes_key_word alg key) (ensures fun _ -> True) | let aes_encrypt_word_def (alg:algorithm) (key:seq nat32) (input:quad32) : Pure quad32
(requires is_aes_key_word alg key)
(ensures fun _ -> True)
=
eval_cipher_def alg input (key_to_round_keys_word alg key) | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 60,
"end_line": 100,
"start_col": 0,
"start_line": 96
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat32 ->
input: Vale.Def.Types_s.quad32
-> Prims.Pure Vale.Def.Types_s.quad32 | Prims.Pure | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.AES.AES_BE_s.eval_cipher_def",
"Vale.AES.AES_BE_s.key_to_round_keys_word",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Prims.l_True"
] | [] | false | false | false | false | false | let aes_encrypt_word_def (alg: algorithm) (key: seq nat32) (input: quad32)
: Pure quad32 (requires is_aes_key_word alg key) (ensures fun _ -> True) =
| eval_cipher_def alg input (key_to_round_keys_word alg key) | false |
Unification.fst | Unification.op_At | val op_At : x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | let op_At = append | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.list _ -> y: Prims.list _ -> Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"FStar.List.Tot.Base.append",
"Prims.list"
] | [] | false | false | false | true | false | let op_At =
| append | false | |
Hacl.Hash.MD5.fst | Hacl.Hash.MD5.hash_oneshot | val hash_oneshot: hash_st MD5 | val hash_oneshot: hash_st MD5 | let hash_oneshot: hash_st MD5 =
Hacl.Hash.MD.mk_hash MD5 alloca update_multi update_last finish | {
"file_name": "code/hash/Hacl.Hash.MD5.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 65,
"end_line": 17,
"start_col": 0,
"start_line": 16
} | module Hacl.Hash.MD5
open Hacl.Hash.Definitions
open Spec.Hash.Definitions
include Hacl.Hash.Core.MD5
friend Hacl.Hash.MD
let update_multi: update_multi_st (|MD5, ()|) =
Hacl.Hash.MD.mk_update_multi MD5 update
let update_last: update_last_st (|MD5, ()|) =
Hacl.Hash.MD.mk_update_last MD5 update_multi pad | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Hacl.Hash.MD.fst.checked",
"Hacl.Hash.Definitions.fst.checked",
"Hacl.Hash.Core.MD5.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "Hacl.Hash.MD... | [
{
"abbrev": false,
"full_module": "Hacl.Hash.Core.MD5",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Hash.Definitions.hash_st Spec.Hash.Definitions.MD5 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Hash.MD.mk_hash",
"Spec.Hash.Definitions.MD5",
"Hacl.Hash.Core.MD5.alloca",
"Hacl.Hash.MD5.update_multi",
"Hacl.Hash.MD5.update_last",
"Hacl.Hash.Core.MD5.finish",
"Hacl.Hash.Definitions.hash_st"
] | [] | false | false | false | true | false | let hash_oneshot:hash_st MD5 =
| Hacl.Hash.MD.mk_hash MD5 alloca update_multi update_last finish | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.key_to_round_keys | val key_to_round_keys (alg: algorithm) (key: aes_key alg)
: (round_keys: seq nat8 {length round_keys == 16 * (nr alg + 1)}) | val key_to_round_keys (alg: algorithm) (key: aes_key alg)
: (round_keys: seq nat8 {length round_keys == 16 * (nr alg + 1)}) | let key_to_round_keys (alg:algorithm) (key:aes_key alg)
: (round_keys:seq nat8 {length round_keys == 16 * (nr alg + 1)}) =
let key_word = seq_nat8_to_seq_nat32_BE key in
seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (key_to_round_keys_word alg key_word)) | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 108,
"start_col": 0,
"start_line": 105
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | alg: Vale.AES.AES_common_s.algorithm -> key: Vale.AES.AES_common_s.aes_key alg
-> round_keys:
FStar.Seq.Base.seq Vale.Def.Types_s.nat8
{FStar.Seq.Base.length round_keys == 16 * (Vale.AES.AES_common_s.nr alg + 1)} | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.AES.AES_common_s.aes_key",
"Vale.Def.Words.Seq_s.seq_nat32_to_seq_nat8_BE",
"Vale.Def.Words.Seq_s.seq_four_to_seq_BE",
"Vale.Def.Types_s.nat32",
"Vale.AES.AES_BE_s.key_to_round_keys_word",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Words.Seq_s.... | [] | false | false | false | false | false | let key_to_round_keys (alg: algorithm) (key: aes_key alg)
: (round_keys: seq nat8 {length round_keys == 16 * (nr alg + 1)}) =
| let key_word = seq_nat8_to_seq_nat32_BE key in
seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (key_to_round_keys_word alg key_word)) | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.aes_encrypt | val aes_encrypt (alg: algorithm) (key: aes_key alg) (input: seq16 nat8) : seq16 nat8 | val aes_encrypt (alg: algorithm) (key: aes_key alg) (input: seq16 nat8) : seq16 nat8 | let aes_encrypt (alg:algorithm) (key:aes_key alg) (input:seq16 nat8) : seq16 nat8 =
let key_word = seq_nat8_to_seq_nat32_BE key in
let input = be_bytes_to_quad32 input in
be_quad32_to_bytes (aes_encrypt_word alg key_word input) | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 114,
"start_col": 0,
"start_line": 111
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: Vale.AES.AES_common_s.aes_key alg ->
input: Vale.Def.Words.Seq_s.seq16 Vale.Def.Types_s.nat8
-> Vale.Def.Words.Seq_s.seq16 Vale.Def.Types_s.nat8 | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.AES.AES_common_s.aes_key",
"Vale.Def.Words.Seq_s.seq16",
"Vale.Def.Types_s.nat8",
"Vale.Arch.Types.be_quad32_to_bytes",
"Vale.AES.AES_BE_s.aes_encrypt_word",
"Vale.Def.Types_s.quad32",
"Vale.Def.Types_s.be_bytes_to_quad32",
"FStar.Seq.Base.seq",
"Vale.Def.W... | [] | false | false | false | false | false | let aes_encrypt (alg: algorithm) (key: aes_key alg) (input: seq16 nat8) : seq16 nat8 =
| let key_word = seq_nat8_to_seq_nat32_BE key in
let input = be_bytes_to_quad32 input in
be_quad32_to_bytes (aes_encrypt_word alg key_word input) | false |
Vale.AES.AES_BE_s.fst | Vale.AES.AES_BE_s.lemma_shl_rcon | val lemma_shl_rcon (rcon: nat8) : Lemma (ishl32 rcon 16 == ishl64 rcon 16 % pow2_32) | val lemma_shl_rcon (rcon: nat8) : Lemma (ishl32 rcon 16 == ishl64 rcon 16 % pow2_32) | let lemma_shl_rcon (rcon:nat8) : Lemma (ishl32 rcon 16 == ishl64 rcon 16 % pow2_32)
=
Vale.Def.TypesNative_s.reveal_ishl 32 rcon 16;
FStar.UInt.shift_left_value_lemma #32 rcon 16;
Vale.Def.TypesNative_s.reveal_ishl 64 rcon 16;
FStar.UInt.shift_left_value_lemma #64 rcon 16 | {
"file_name": "vale/specs/crypto/Vale.AES.AES_BE_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 121,
"start_col": 0,
"start_line": 116
} | module Vale.AES.AES_BE_s
// IMPORTANT: This specification is written assuming a big-endian mapping from bytes to quad32s
// This is explicit in key_schedule_to_round_keys when we construct the round_key rk,
// but it also applies implicitly to the input quad32
open Vale.Def.Prop_s
open Vale.Def.... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Prop_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Vale.AES.AES_common_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | rcon: Vale.Def.Types_s.nat8
-> FStar.Pervasives.Lemma
(ensures
Vale.Arch.Types.ishl32 rcon 16 == Vale.Arch.Types.ishl64 rcon 16 % Vale.Def.Words_s.pow2_32) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat8",
"FStar.UInt.shift_left_value_lemma",
"Prims.unit",
"Vale.Def.TypesNative_s.reveal_ishl",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.int",
"Vale.Arch.Types.ishl32",
"Prims.op_Modulus",
"Vale.Arch.Types.ishl64",
"Vale.Def.Words_s.pow2_32",
"Prims.Nil",
"FSta... | [] | true | false | true | false | false | let lemma_shl_rcon (rcon: nat8) : Lemma (ishl32 rcon 16 == ishl64 rcon 16 % pow2_32) =
| Vale.Def.TypesNative_s.reveal_ishl 32 rcon 16;
FStar.UInt.shift_left_value_lemma #32 rcon 16;
Vale.Def.TypesNative_s.reveal_ishl 64 rcon 16;
FStar.UInt.shift_left_value_lemma #64 rcon 16 | false |
Unification.fst | Unification.nat_order | val nat_order : OrdSet.cmp nat | val nat_order : OrdSet.cmp nat | let nat_order :(f:(nat -> nat -> bool){OrdSet.total_order nat f}) = fun x y -> x <= y | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 85,
"end_line": 48,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.OrdSet.cmp Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_LessThanOrEqual",
"Prims.bool",
"FStar.OrdSet.total_order"
] | [] | false | false | false | true | false | let nat_order:(f: (nat -> nat -> bool){OrdSet.total_order nat f}) =
| fun x y -> x <= y | false |
Unification.fst | Unification.lemma_shift_append | val lemma_shift_append: #a:eqtype -> l:list a -> x:a -> m:list a -> Lemma
(ensures ( (l@(x::m)) = ((l@[x])@m))) | val lemma_shift_append: #a:eqtype -> l:list a -> x:a -> m:list a -> Lemma
(ensures ( (l@(x::m)) = ((l@[x])@m))) | let rec lemma_shift_append #a l x m = match l with
| [] -> ()
| hd::tl -> lemma_shift_append tl x m | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 39,
"start_col": 0,
"start_line": 37
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list a -> x: a -> m: Prims.list a
-> FStar.Pervasives.Lemma (ensures l @ x :: m = (l @ [x]) @ m) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"Prims.list",
"Unification.lemma_shift_append",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_shift_append #a l x m =
| match l with
| [] -> ()
| hd :: tl -> lemma_shift_append tl x m | false |
Unification.fst | Unification.empty_vars | val empty_vars : varset | val empty_vars : varset | let empty_vars = OrdSet.empty | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 52,
"start_col": 0,
"start_line": 52
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Unification.varset | Prims.Tot | [
"total"
] | [] | [
"FStar.OrdSet.empty",
"Prims.nat",
"Unification.nat_order"
] | [] | false | false | false | true | false | let empty_vars =
| OrdSet.empty | false |
Unification.fst | Unification.vars | val vars : term -> Tot varset | val vars : term -> Tot varset | let rec vars = function
| V i -> OrdSet.singleton i
| F t1 t2 -> OrdSet.union (vars t1) (vars t2) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 58,
"start_col": 0,
"start_line": 56
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.term -> Unification.varset | Prims.Tot | [
"total"
] | [] | [
"Unification.term",
"Prims.nat",
"FStar.OrdSet.singleton",
"Unification.nat_order",
"FStar.OrdSet.union",
"Unification.vars",
"Unification.varset"
] | [
"recursion"
] | false | false | false | true | false | let rec vars =
| function
| V i -> OrdSet.singleton i
| F t1 t2 -> OrdSet.union (vars t1) (vars t2) | false |
Unification.fst | Unification.evars | val evars : eqns -> Tot varset | val evars : eqns -> Tot varset | let rec evars = function
| [] -> empty_vars
| (x, y)::tl -> OrdSet.union (OrdSet.union (vars x) (vars y)) (evars tl) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 67,
"start_col": 0,
"start_line": 65
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.eqns -> Unification.varset | Prims.Tot | [
"total"
] | [] | [
"Unification.eqns",
"Unification.empty_vars",
"Unification.term",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.OrdSet.union",
"Prims.nat",
"Unification.nat_order",
"Unification.vars",
"Unification.evars",
"Unification.varset"
] | [
"recursion"
] | false | false | false | true | false | let rec evars =
| function
| [] -> empty_vars
| (x, y) :: tl -> OrdSet.union (OrdSet.union (vars x) (vars y)) (evars tl) | false |
Unification.fst | Unification.lsubst_term | val lsubst_term : list subst -> term -> Tot term | val lsubst_term : list subst -> term -> Tot term | let lsubst_term = fold_right subst_term | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 105,
"start_col": 0,
"start_line": 105
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.list Unification.subst -> _: Unification.term -> Unification.term | Prims.Tot | [
"total"
] | [] | [
"FStar.List.Tot.Base.fold_right",
"Unification.subst",
"Unification.term",
"Unification.subst_term"
] | [] | false | false | false | true | false | let lsubst_term =
| fold_right subst_term | false |
Unification.fst | Unification.n_evars | val n_evars : eqns -> Tot nat | val n_evars : eqns -> Tot nat | let n_evars eqns = OrdSet.size (evars eqns) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 71,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eqns: Unification.eqns -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Unification.eqns",
"FStar.OrdSet.size",
"Prims.nat",
"Unification.nat_order",
"Unification.evars"
] | [] | false | false | false | true | false | let n_evars eqns =
| OrdSet.size (evars eqns) | false |
Unification.fst | Unification.efuns | val efuns : eqns -> Tot nat | val efuns : eqns -> Tot nat | let rec efuns = function
| [] -> 0
| (x,y)::tl -> funs x + funs y + efuns tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 82,
"start_col": 0,
"start_line": 80
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.eqns -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Unification.eqns",
"Unification.term",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Addition",
"Unification.funs",
"Unification.efuns",
"Prims.nat"
] | [
"recursion"
] | false | false | false | true | false | let rec efuns =
| function
| [] -> 0
| (x, y) :: tl -> funs x + funs y + efuns tl | false |
Unification.fst | Unification.funs | val funs : term -> Tot nat | val funs : term -> Tot nat | let rec funs = function
| V _ -> 0
| F t1 t2 -> 1 + funs t1 + funs t2 | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 77,
"start_col": 0,
"start_line": 75
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.term -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Unification.term",
"Prims.nat",
"Prims.op_Addition",
"Unification.funs"
] | [
"recursion"
] | false | false | false | true | false | let rec funs =
| function
| V _ -> 0
| F t1 t2 -> 1 + funs t1 + funs t2 | false |
Unification.fst | Unification.ok | val ok : s: (Prims.nat * Unification.term) -> Prims.bool | let ok s = not (occurs (fst s) (snd s)) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 108,
"start_col": 0,
"start_line": 108
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: (Prims.nat * Unification.term) -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Unification.term",
"Prims.op_Negation",
"Unification.occurs",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"Prims.bool"
] | [] | false | false | false | true | false | let ok s =
| not (occurs (fst s) (snd s)) | false | |
Unification.fst | Unification.n_flex_rhs | val n_flex_rhs : eqns -> Tot nat | val n_flex_rhs : eqns -> Tot nat | let rec n_flex_rhs = function
| [] -> 0
| (V _, V _)::tl
| (_ , V _)::tl -> 1 + n_flex_rhs tl
| _::tl -> n_flex_rhs tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 91,
"start_col": 0,
"start_line": 87
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.eqns -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Unification.eqns",
"Prims.nat",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Unification.term",
"Prims.op_Addition",
"Unification.n_flex_rhs"
] | [
"recursion"
] | false | false | false | true | false | let rec n_flex_rhs =
| function
| [] -> 0
| (V _, V _) :: tl | (_, V _) :: tl -> 1 + n_flex_rhs tl
| _ :: tl -> n_flex_rhs tl | false |
Unification.fst | Unification.subst_term | val subst_term : subst -> term -> Tot term | val subst_term : subst -> term -> Tot term | let rec subst_term s t = match t with
| V x -> if x = fst s then snd s else V x
| F t1 t2 -> F (subst_term s t1) (subst_term s t2) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 102,
"start_col": 0,
"start_line": 100
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Unification.subst -> t: Unification.term -> Unification.term | Prims.Tot | [
"total"
] | [] | [
"Unification.subst",
"Unification.term",
"Prims.nat",
"Prims.op_Equality",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"Prims.bool",
"Unification.V",
"Unification.F",
"Unification.subst_term"
] | [
"recursion"
] | false | false | false | true | false | let rec subst_term s t =
| match t with
| V x -> if x = fst s then snd s else V x
| F t1 t2 -> F (subst_term s t1) (subst_term s t2) | false |
Unification.fst | Unification.occurs | val occurs : x: Prims.nat -> t: Unification.term -> Prims.bool | let occurs x t = OrdSet.mem x (vars t) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 107,
"start_col": 0,
"start_line": 107
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> t: Unification.term -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Unification.term",
"FStar.OrdSet.mem",
"Unification.nat_order",
"Unification.vars",
"Prims.bool"
] | [] | false | false | false | true | false | let occurs x t =
| OrdSet.mem x (vars t) | false | |
Unification.fst | Unification.lsubst_eqns | val lsubst_eqns: list subst -> eqns -> Tot eqns | val lsubst_eqns: list subst -> eqns -> Tot eqns | let rec lsubst_eqns l = function
| [] -> []
| (x,y)::tl -> (lsubst_term l x, lsubst_term l y)::lsubst_eqns l tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 69,
"end_line": 113,
"start_col": 0,
"start_line": 111
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> _: Unification.eqns -> Unification.eqns | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Unification.subst",
"Unification.eqns",
"Prims.Nil",
"FStar.Pervasives.Native.tuple2",
"Unification.term",
"Prims.Cons",
"FStar.Pervasives.Native.Mktuple2",
"Unification.lsubst_term",
"Unification.lsubst_eqns"
] | [
"recursion"
] | false | false | false | true | false | let rec lsubst_eqns l =
| function
| [] -> []
| (x, y) :: tl -> (lsubst_term l x, lsubst_term l y) :: lsubst_eqns l tl | false |
Unification.fst | Unification.lemma_lsubst_eqns_nil | val lemma_lsubst_eqns_nil: e:eqns -> Lemma
(requires True)
(ensures (lsubst_eqns [] e = e))
[SMTPat (lsubst_eqns [] e)] | val lemma_lsubst_eqns_nil: e:eqns -> Lemma
(requires True)
(ensures (lsubst_eqns [] e = e))
[SMTPat (lsubst_eqns [] e)] | let rec lemma_lsubst_eqns_nil = function
| [] -> ()
| _::tl -> lemma_lsubst_eqns_nil tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 121,
"start_col": 0,
"start_line": 119
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: Unification.eqns
-> FStar.Pervasives.Lemma (ensures Unification.lsubst_eqns [] e = e)
[SMTPat (Unification.lsubst_eqns [] e)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.eqns",
"FStar.Pervasives.Native.tuple2",
"Unification.term",
"Prims.list",
"Unification.lemma_lsubst_eqns_nil",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_lsubst_eqns_nil =
| function
| [] -> ()
| _ :: tl -> lemma_lsubst_eqns_nil tl | false |
Unification.fst | Unification.evars_permute_hd | val evars_permute_hd : x:term -> y:term -> tl:eqns -> Lemma
(ensures (evars ((x, y)::tl) = evars ((y, x)::tl))) | val evars_permute_hd : x:term -> y:term -> tl:eqns -> Lemma
(ensures (evars ((x, y)::tl) = evars ((y, x)::tl))) | let evars_permute_hd x y tl = OrdSet.eq_lemma (evars ((x,y)::tl)) (evars ((y,x)::tl)) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 85,
"end_line": 128,
"start_col": 0,
"start_line": 128
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Unification.term -> y: Unification.term -> tl: Unification.eqns
-> FStar.Pervasives.Lemma
(ensures Unification.evars ((x, y) :: tl) = Unification.evars ((y, x) :: tl)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.term",
"Unification.eqns",
"FStar.OrdSet.eq_lemma",
"Prims.nat",
"Unification.nat_order",
"Unification.evars",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit"
] | [] | true | false | true | false | false | let evars_permute_hd x y tl =
| OrdSet.eq_lemma (evars ((x, y) :: tl)) (evars ((y, x) :: tl)) | false |
Unification.fst | Unification.evars_unfun | val evars_unfun : x:term -> y:term -> x':term -> y':term -> tl:eqns -> Lemma
(ensures (evars ((F x y, F x' y')::tl) = evars ((x, x')::(y, y')::tl))) | val evars_unfun : x:term -> y:term -> x':term -> y':term -> tl:eqns -> Lemma
(ensures (evars ((F x y, F x' y')::tl) = evars ((x, x')::(y, y')::tl))) | let evars_unfun x y x' y' tl = OrdSet.eq_lemma (evars ((F x y, F x' y')::tl)) (evars ((x, x')::(y, y')::tl)) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 108,
"end_line": 132,
"start_col": 0,
"start_line": 132
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: Unification.term ->
y: Unification.term ->
x': Unification.term ->
y': Unification.term ->
tl: Unification.eqns
-> FStar.Pervasives.Lemma
(ensures
Unification.evars ((Unification.F x y, Unification.F x' y') :: tl) =
Unification.evars ((x, x') :: (y, y') :: tl)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.term",
"Unification.eqns",
"FStar.OrdSet.eq_lemma",
"Prims.nat",
"Unification.nat_order",
"Unification.evars",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Unification.F",
"Prims.unit"
] | [] | true | false | true | false | false | let evars_unfun x y x' y' tl =
| OrdSet.eq_lemma (evars ((F x y, F x' y') :: tl)) (evars ((x, x') :: (y, y') :: tl)) | false |
Unification.fst | Unification.extend_subst | val extend_subst : s: _ -> l: Prims.list _ -> Prims.list _ | let extend_subst s l = s::l | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 191,
"start_col": 0,
"start_line": 191
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: _ -> l: Prims.list _ -> Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.Cons"
] | [] | false | false | false | true | false | let extend_subst s l =
| s :: l | false | |
Unification.fst | Unification.lemma_vars_decrease | val lemma_vars_decrease: s:subst -> t':term -> Lemma
(requires (ok s))
(ensures (OrdSet.subset (vars (subst_term s t'))
(OrdSet.remove (fst s) (OrdSet.union (vars (snd s)) (vars t'))))) | val lemma_vars_decrease: s:subst -> t':term -> Lemma
(requires (ok s))
(ensures (OrdSet.subset (vars (subst_term s t'))
(OrdSet.remove (fst s) (OrdSet.union (vars (snd s)) (vars t'))))) | let rec lemma_vars_decrease s t' = match t' with
| V x -> ()
| F t1 t2 ->
lemma_vars_decrease s t1;
lemma_vars_decrease s t2 | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 143,
"start_col": 0,
"start_line": 139
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Unification.subst -> t': Unification.term
-> FStar.Pervasives.Lemma (requires Unification.ok s)
(ensures
FStar.OrdSet.subset (Unification.vars (Unification.subst_term s t'))
(FStar.OrdSet.remove (FStar.Pervasives.Native.fst s)
(FStar.OrdSet.union (Unification.vars (FStar.Perva... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.subst",
"Unification.term",
"Prims.nat",
"Unification.lemma_vars_decrease",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_vars_decrease s t' =
| match t' with
| V x -> ()
| F t1 t2 ->
lemma_vars_decrease s t1;
lemma_vars_decrease s t2 | false |
Unification.fst | Unification.extend_lsubst | val extend_lsubst : l: Prims.list _ -> l': Prims.list _ -> Prims.list _ | let extend_lsubst l l' = l @ l' | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 192,
"start_col": 0,
"start_line": 192
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list _ -> l': Prims.list _ -> Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Unification.op_At"
] | [] | false | false | false | true | false | let extend_lsubst l l' =
| l @ l' | false | |
Unification.fst | Unification.unify | val unify : e:eqns -> list subst -> Tot (option (list subst))
(decreases %[n_evars e; efuns e; n_flex_rhs e]) | val unify : e:eqns -> list subst -> Tot (option (list subst))
(decreases %[n_evars e; efuns e; n_flex_rhs e]) | let rec unify e s = match e with
| [] -> Some s
| (V x, t)::tl ->
if V? t && V?.i t = x
then unify tl s //t is a flex-rhs
else if occurs x t
then None
else (vars_decrease_eqns x t tl;
unify (lsubst_eqns [x,t] tl) ((x,t)::s))
| (t, V x)::tl -> //flex-rhs
evars_permute_hd t (V x) t... | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 175,
"start_col": 0,
"start_line": 158
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: Unification.eqns -> s: Prims.list Unification.subst
-> Prims.Tot (FStar.Pervasives.Native.option (Prims.list Unification.subst)) | Prims.Tot | [
"total",
""
] | [] | [
"Unification.eqns",
"Prims.list",
"Unification.subst",
"FStar.Pervasives.Native.Some",
"Prims.nat",
"Unification.term",
"FStar.Pervasives.Native.tuple2",
"Prims.op_AmpAmp",
"Unification.uu___is_V",
"Prims.op_Equality",
"Unification.__proj__V__item__i",
"Unification.unify",
"Prims.bool",
"U... | [
"recursion"
] | false | false | false | true | false | let rec unify e s =
| match e with
| [] -> Some s
| (V x, t) :: tl ->
if V? t && V?.i t = x
then unify tl s
else
if occurs x t
then None
else
(vars_decrease_eqns x t tl;
unify (lsubst_eqns [x, t] tl) ((x, t) :: s))
| (t, V x) :: tl ->
evars_permute_hd t (V x) tl;
unify ((V x, t) :: tl) s
| (F t1 t2, F t1'... | false |
Unification.fst | Unification.vars_decrease_eqns | val vars_decrease_eqns: x:nat -> t:term -> e:eqns -> Lemma
(requires (ok (x, t)))
(ensures (OrdSet.subset (evars (lsubst_eqns [x,t] e))
(OrdSet.remove x (evars ((V x, t)::e))))) | val vars_decrease_eqns: x:nat -> t:term -> e:eqns -> Lemma
(requires (ok (x, t)))
(ensures (OrdSet.subset (evars (lsubst_eqns [x,t] e))
(OrdSet.remove x (evars ((V x, t)::e))))) | let rec vars_decrease_eqns x t e = match e with
| [] -> ()
| hd::tl -> lemma_vars_decrease (x,t) (fst hd);
lemma_vars_decrease (x,t) (snd hd);
vars_decrease_eqns x t tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 154,
"start_col": 0,
"start_line": 150
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> t: Unification.term -> e: Unification.eqns
-> FStar.Pervasives.Lemma (requires Unification.ok (x, t))
(ensures
FStar.OrdSet.subset (Unification.evars (Unification.lsubst_eqns [x, t] e))
(FStar.OrdSet.remove x (Unification.evars ((Unification.V x, t) :: e)))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Unification.term",
"Unification.eqns",
"FStar.Pervasives.Native.tuple2",
"Prims.list",
"Unification.vars_decrease_eqns",
"Prims.unit",
"Unification.lemma_vars_decrease",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.snd",
"FStar.Pervasives.Native.fst"
] | [
"recursion"
] | false | false | true | false | false | let rec vars_decrease_eqns x t e =
| match e with
| [] -> ()
| hd :: tl ->
lemma_vars_decrease (x, t) (fst hd);
lemma_vars_decrease (x, t) (snd hd);
vars_decrease_eqns x t tl | false |
Unification.fst | Unification.solved | val solved : eqns -> Tot bool | val solved : eqns -> Tot bool | let rec solved = function
| [] -> true
| (x,y)::tl -> x=y && solved tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 181,
"start_col": 0,
"start_line": 179
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Unification.eqns -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Unification.eqns",
"Unification.term",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.op_AmpAmp",
"Prims.op_Equality",
"Unification.solved",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec solved =
| function
| [] -> true
| (x, y) :: tl -> x = y && solved tl | false |
Unification.fst | Unification.lsubst_distributes_over_F | val lsubst_distributes_over_F: l:list subst -> t1:term -> t2:term -> Lemma
(requires (True))
(ensures (lsubst_term l (F t1 t2) = F (lsubst_term l t1) (lsubst_term l t2)))
[SMTPat (lsubst_term l (F t1 t2))] | val lsubst_distributes_over_F: l:list subst -> t1:term -> t2:term -> Lemma
(requires (True))
(ensures (lsubst_term l (F t1 t2) = F (lsubst_term l t1) (lsubst_term l t2)))
[SMTPat (lsubst_term l (F t1 t2))] | let rec lsubst_distributes_over_F l t1 t2 = match l with
| [] -> ()
| hd::tl -> lsubst_distributes_over_F tl t1 t2 | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 189,
"start_col": 0,
"start_line": 187
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> t1: Unification.term -> t2: Unification.term
-> FStar.Pervasives.Lemma
(ensures
Unification.lsubst_term l (Unification.F t1 t2) =
Unification.F (Unification.lsubst_term l t1) (Unification.lsubst_term l t2))
[SMTPat (Unification.lsubst_term l (Unification.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Unification.subst",
"Unification.term",
"Unification.lsubst_distributes_over_F",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lsubst_distributes_over_F l t1 t2 =
| match l with
| [] -> ()
| hd :: tl -> lsubst_distributes_over_F tl t1 t2 | false |
Unification.fst | Unification.sub | val sub : l: Prims.list Unification.subst -> e: Unification.eqns -> Unification.eqns | let sub l e = lsubst_eqns l e | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 243,
"start_col": 0,
"start_line": 243
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> e: Unification.eqns -> Unification.eqns | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Unification.subst",
"Unification.eqns",
"Unification.lsubst_eqns"
] | [] | false | false | false | true | false | let sub l e =
| lsubst_eqns l e | false | |
Unification.fst | Unification.lemma_extend_lsubst_distributes_term | val lemma_extend_lsubst_distributes_term: l:list subst -> l':list subst -> e:term -> Lemma
(requires True)
(ensures (lsubst_term (extend_lsubst l l') e = lsubst_term l (lsubst_term l' e))) | val lemma_extend_lsubst_distributes_term: l:list subst -> l':list subst -> e:term -> Lemma
(requires True)
(ensures (lsubst_term (extend_lsubst l l') e = lsubst_term l (lsubst_term l' e))) | let rec lemma_extend_lsubst_distributes_term l l' e = match l with
| [] -> ()
| hd::tl -> lemma_extend_lsubst_distributes_term tl l' e | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 199,
"start_col": 0,
"start_line": 197
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> l': Prims.list Unification.subst -> e: Unification.term
-> FStar.Pervasives.Lemma
(ensures
Unification.lsubst_term (Unification.extend_lsubst l l') e =
Unification.lsubst_term l (Unification.lsubst_term l' e)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Unification.subst",
"Unification.term",
"Unification.lemma_extend_lsubst_distributes_term",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_extend_lsubst_distributes_term l l' e =
| match l with
| [] -> ()
| hd :: tl -> lemma_extend_lsubst_distributes_term tl l' e | false |
Unification.fst | Unification.neutral | val neutral : s: Unification.subst -> _: (Prims.nat * Unification.term) -> Prims.bool | let neutral s (x, t) = subst_term s (V x) = V x && subst_term s t = t && ok (x, t) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 86,
"end_line": 219,
"start_col": 0,
"start_line": 219
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Unification.subst -> _: (Prims.nat * Unification.term) -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Unification.subst",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Unification.term",
"Prims.op_AmpAmp",
"Prims.op_Equality",
"Unification.subst_term",
"Unification.V",
"Unification.ok",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool"
] | [] | false | false | false | true | false | let neutral s (x, t) =
| subst_term s (V x) = V x && subst_term s t = t && ok (x, t) | false | |
Unification.fst | Unification.lemma_extend_lsubst_distributes_eqns | val lemma_extend_lsubst_distributes_eqns: l:list subst -> l':list subst -> e:eqns -> Lemma
(requires True)
(ensures (lsubst_eqns (extend_lsubst l l') e = lsubst_eqns l (lsubst_eqns l' e)))
[SMTPat (lsubst_eqns (extend_lsubst l l') e)] | val lemma_extend_lsubst_distributes_eqns: l:list subst -> l':list subst -> e:eqns -> Lemma
(requires True)
(ensures (lsubst_eqns (extend_lsubst l l') e = lsubst_eqns l (lsubst_eqns l' e)))
[SMTPat (lsubst_eqns (extend_lsubst l l') e)] | let rec lemma_extend_lsubst_distributes_eqns l l' e = match e with
| [] -> ()
| (t1, t2)::tl ->
lemma_extend_lsubst_distributes_term l l' t1;
lemma_extend_lsubst_distributes_term l l' t2;
lemma_extend_lsubst_distributes_eqns l l' tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 210,
"start_col": 0,
"start_line": 205
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> l': Prims.list Unification.subst -> e: Unification.eqns
-> FStar.Pervasives.Lemma
(ensures
Unification.lsubst_eqns (Unification.extend_lsubst l l') e =
Unification.lsubst_eqns l (Unification.lsubst_eqns l' e))
[SMTPat (Unification.lsubst_eqns (Unification... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Unification.subst",
"Unification.eqns",
"Unification.term",
"FStar.Pervasives.Native.tuple2",
"Unification.lemma_extend_lsubst_distributes_eqns",
"Prims.unit",
"Unification.lemma_extend_lsubst_distributes_term"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_extend_lsubst_distributes_eqns l l' e =
| match e with
| [] -> ()
| (t1, t2) :: tl ->
lemma_extend_lsubst_distributes_term l l' t1;
lemma_extend_lsubst_distributes_term l l' t2;
lemma_extend_lsubst_distributes_eqns l l' tl | false |
Unification.fst | Unification.test | val test : l1: Prims.list _ -> l2: Prims.list _ -> l3: Prims.list _ -> Prims.unit | let test l1 l2 l3 = assert (l1 ++ l2 ++ l3 == (l1 ++ l2) ++ l3) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 245,
"start_col": 0,
"start_line": 245
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list _ -> l2: Prims.list _ -> l3: Prims.list _ -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims._assert",
"Prims.eq2",
"Unification.op_Plus_Plus",
"Prims.unit"
] | [] | false | false | false | true | false | let test l1 l2 l3 =
| assert (l1 ++ l2 ++ l3 == (l1 ++ l2) ++ l3) | false | |
Unification.fst | Unification.neutral_l | val neutral_l : l: Prims.list Unification.subst -> _: (Prims.nat * Unification.term) -> Prims.bool | let neutral_l l (x, t) = lsubst_term l (V x) = V x && lsubst_term l t = t && ok (x, t) | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 86,
"end_line": 220,
"start_col": 0,
"start_line": 220
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Unification.subst -> _: (Prims.nat * Unification.term) -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Unification.subst",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Unification.term",
"Prims.op_AmpAmp",
"Prims.op_Equality",
"Unification.lsubst_term",
"Unification.V",
"Unification.ok",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool"
] | [] | false | false | false | true | false | let neutral_l l (x, t) =
| lsubst_term l (V x) = V x && lsubst_term l t = t && ok (x, t) | false | |
Unification.fst | Unification.lemma_subst_id | val lemma_subst_id: x:nat -> z:term -> y:term -> Lemma
(requires (not (occurs x y)))
(ensures (subst_term (x,z) y = y)) | val lemma_subst_id: x:nat -> z:term -> y:term -> Lemma
(requires (not (occurs x y)))
(ensures (subst_term (x,z) y = y)) | let rec lemma_subst_id x z y = match y with
| V x' -> ()
| F t1 t2 -> lemma_subst_id x z t1; lemma_subst_id x z t2 | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 217,
"start_col": 0,
"start_line": 215
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> z: Unification.term -> y: Unification.term
-> FStar.Pervasives.Lemma (requires Prims.op_Negation (Unification.occurs x y))
(ensures Unification.subst_term (x, z) y = y) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Unification.term",
"Unification.lemma_subst_id",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_subst_id x z y =
| match y with
| V x' -> ()
| F t1 t2 ->
lemma_subst_id x z t1;
lemma_subst_id x z t2 | false |
Unification.fst | Unification.lemma_lsubst_term_commutes | val lemma_lsubst_term_commutes: s:subst -> l:list subst -> e:term -> Lemma
(requires (neutral_l l s))
(ensures (lsubst_term [s] (lsubst_term l (subst_term s e)) =
lsubst_term [s] (lsubst_term l e))) | val lemma_lsubst_term_commutes: s:subst -> l:list subst -> e:term -> Lemma
(requires (neutral_l l s))
(ensures (lsubst_term [s] (lsubst_term l (subst_term s e)) =
lsubst_term [s] (lsubst_term l e))) | let rec lemma_lsubst_term_commutes s l e = match e with
| V y -> lemma_subst_id (fst s) (snd s) (snd s)
| F t1 t2 -> lemma_lsubst_term_commutes s l t1;
lemma_lsubst_term_commutes s l t2 | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 230,
"start_col": 0,
"start_line": 226
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Unification.subst -> l: Prims.list Unification.subst -> e: Unification.term
-> FStar.Pervasives.Lemma (requires Unification.neutral_l l s)
(ensures
Unification.lsubst_term [s] (Unification.lsubst_term l (Unification.subst_term s e)) =
Unification.lsubst_term [s] (Unification.lsubst_term l e)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.subst",
"Prims.list",
"Unification.term",
"Prims.nat",
"Unification.lemma_subst_id",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"Unification.lemma_lsubst_term_commutes",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_lsubst_term_commutes s l e =
| match e with
| V y -> lemma_subst_id (fst s) (snd s) (snd s)
| F t1 t2 ->
lemma_lsubst_term_commutes s l t1;
lemma_lsubst_term_commutes s l t2 | false |
Unification.fst | Unification.lemma_lsubst_eqns_commutes | val lemma_lsubst_eqns_commutes: s:subst -> l:list subst -> e:eqns -> Lemma
(requires (neutral_l l s))
(ensures (lsubst_eqns [s] (lsubst_eqns l (lsubst_eqns [s] e)) =
lsubst_eqns [s] (lsubst_eqns l e))) | val lemma_lsubst_eqns_commutes: s:subst -> l:list subst -> e:eqns -> Lemma
(requires (neutral_l l s))
(ensures (lsubst_eqns [s] (lsubst_eqns l (lsubst_eqns [s] e)) =
lsubst_eqns [s] (lsubst_eqns l e))) | let rec lemma_lsubst_eqns_commutes s l = function
| [] -> ()
| (t1,t2)::tl -> lemma_lsubst_term_commutes s l t1;
lemma_lsubst_term_commutes s l t2;
lemma_lsubst_eqns_commutes s l tl | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 240,
"start_col": 0,
"start_line": 236
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: Unification.subst -> l: Prims.list Unification.subst -> e: Unification.eqns
-> FStar.Pervasives.Lemma (requires Unification.neutral_l l s)
(ensures
Unification.lsubst_eqns [s] (Unification.lsubst_eqns l (Unification.lsubst_eqns [s] e)) =
Unification.lsubst_eqns [s] (Unification.lsubst_eqns l ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Unification.subst",
"Prims.list",
"Unification.eqns",
"Unification.term",
"FStar.Pervasives.Native.tuple2",
"Unification.lemma_lsubst_eqns_commutes",
"Prims.unit",
"Unification.lemma_lsubst_term_commutes"
] | [
"recursion"
] | false | false | true | false | false | let rec lemma_lsubst_eqns_commutes s l =
| function
| [] -> ()
| (t1, t2) :: tl ->
lemma_lsubst_term_commutes s l t1;
lemma_lsubst_term_commutes s l t2;
lemma_lsubst_eqns_commutes s l tl | false |
Unification.fst | Unification.key_lemma | val key_lemma: x:nat -> y:term -> tl:eqns -> l:list subst -> lpre:list subst -> l'':list subst -> Lemma
(requires (l'' = lpre ++ ([x,y] ++ l)
/\ not (occurs x y)
/\ l `sub` ((V x, y)::tl) = (V x, y)::tl
/\ solved (l'' `sub` ([x, y] `sub` tl))))
(ensures (solved (l'' `sub` ((V x,y)::tl)))) | val key_lemma: x:nat -> y:term -> tl:eqns -> l:list subst -> lpre:list subst -> l'':list subst -> Lemma
(requires (l'' = lpre ++ ([x,y] ++ l)
/\ not (occurs x y)
/\ l `sub` ((V x, y)::tl) = (V x, y)::tl
/\ solved (l'' `sub` ([x, y] `sub` tl))))
(ensures (solved (l'' `sub` ((V x,y)::tl)))) | let key_lemma x y tl l lpre l'' =
let xy = [x,y] in
let xyl = xy++l in
let vxy = V x, y in
assert (l'' `sub` (vxy::tl)
== lpre `sub` (xy `sub` (l `sub` (vxy::tl))));
lemma_lsubst_eqns_commutes (x,y) l (vxy :: tl);
assert (lpre `sub` (xy `sub` (l `sub` (vxy::tl)))
== lpre `sub` (xy `sub` (l... | {
"file_name": "examples/algorithms/Unification.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 265,
"start_col": 0,
"start_line": 254
} | (*
Copyright 2008-2015 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.OrdSet.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "Unification.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: Prims.nat ->
y: Unification.term ->
tl: Unification.eqns ->
l: Prims.list Unification.subst ->
lpre: Prims.list Unification.subst ->
l'': Prims.list Unification.subst
-> FStar.Pervasives.Lemma
(requires
l'' = lpre ++ ([x, y] ++ l) /\ Prims.op_Negation (Unification.occurs x y)... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Unification.term",
"Unification.eqns",
"Prims.list",
"Unification.subst",
"Unification.lemma_subst_id",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"Unification.sub",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"Unification.lemma_lsubst_eqns_commutes",
"FStar.Pervasives.N... | [] | true | false | true | false | false | let key_lemma x y tl l lpre l'' =
| let xy = [x, y] in
let xyl = xy ++ l in
let vxy = V x, y in
assert (l'' `sub` (vxy :: tl) == lpre `sub` (xy `sub` (l `sub` (vxy :: tl))));
lemma_lsubst_eqns_commutes (x, y) l (vxy :: tl);
assert (lpre
`sub`
(xy `sub` (l `sub` (vxy :: tl))) ==
lpre
`sub`
(xy `sub` (l `sub` (xy `sub` (vxy :: tl)))));
... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.