messages listlengths 2 2 |
|---|
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n post: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n ret_t: FStar.Stubs.Reflection.Types.term ->\n arr: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: k_seq: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> Vale.Def.Prop_s.prop0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n pre: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n arr: FStar.Stubs.Reflection.Types.term ->\n init: FStar.Stubs.Reflection.Types.term ->\n len: FStar.Stubs.Reflection.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: Vale.X64.Machine_s.reg_64 -> Prims.bool\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule D... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: qs: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> Vale.SHA.PPC64LE.SHA_helpers.block_w\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\no... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: b: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 -> Vale.SHA.PPC64LE.SHA_helpers.hash256\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u166: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.Data.var\n -> FStar.Stubs.Reflection.Types.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u90: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n e: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.AsLowStar.ValeSig.vale_post Vale.Inline.X64.Fswap_inline.cswap_dom\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.X64.arity_ok 3 Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmo... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n pre: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term ->\n init: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.ter... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit -> FStar.All.ML Prims.int\nEffect: FStar.All.ML\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule D... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n post: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n arr: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.term\nEffect: Prims.Tot\n\nContext:\n(*\n Copy... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n post: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.term\nEffect: Prims.Tot\n\nContext:\n(*\n Copyri... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.AsLowStar.ValeSig.vale_pre Vale.Inline.X64.Fswap_inline.cswap_dom\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Inline.X64.Fswap_inline.lowstar_cswap_t\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: v:\nVale.Interop.X64.arg_reg_relation' 3\n { forall (r: Vale.X64.Machine_s.reg_64). {:pattern Rel?.of_reg v r}\n Some? (Rel?.of_reg v r) ==> Rel?.of_arg v (Some?.v (Rel?.of_reg v r)) = r }\nEffect: Prims.Tot\n\nCont... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Definitions\n\nmodule LE = Lib.Exponentiation\nmodule... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: f: FStar.Seq.Properties.tot_ord a -> x: FStar.Array.array a -> FStar.ST.ST Prims.unit\nEffect: FStar.ST.ST\n\nContext:\n(*\n Copyright 2008-2014 Nikhil Swamy and Microsoft Research\n\n Licensed under the Apache Licens... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Definitions\n\nmodule LE = Lib.Exponentiation\nmodule... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n s: FStar.Seq.Base.seq a ->\n i: Prims.nat ->\n pivot: Prims.nat{i <= pivot} ->\n j: Prims.nat{pivot < j && j <= FStar.Seq.Base.length s} ->\n pv: a\n -> FStar.Pervasives.Lemma (requires pv == FStar.Seq.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Benton2004.exp Prims.bool\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compl... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.AsLowStar.ValeSig.vale_sig Vale.Inline.X64.Fswap_inline.cswap_regs_modified\n Vale.Inline.X64.Fswap_inline.cswap_xmms_modified\n Vale.Inline.X64.Fswap_inline.cswap_pre\n Vale.Inline.X64.Fswap_inline.cswap_post\nEf... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Benton2004.exp Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compli... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Benton2004.exp Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compli... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Benton2004.computation\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in complian... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Benton2004.computation\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in complian... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit -> Prims.GTot (Benton2004.RHL.gexp Prims.bool)\nEffect: Prims.GTot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you m... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Hacl.Spec.Bignum.Definitions.lbignum t len -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Definiti... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: min: Prims.nat -> max: Prims.nat{min <= max} -> k: LowParse.Spec.Base.parser_kind\n -> LowParse.Spec.Base.parser_kind\nEffect: Prims.Tot\n\nContext:\nmodule LowParse.Spec.DepLen\n\n(* LowParse specification module for pa... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n fact: Steel.Memory.property a ->\n r: Steel.GhostPCMReference.ref a pcm ->\n v: FStar.Ghost.erased a ->\n w: Steel.GhostPCMReference.witnessed r fact\n -> Steel.Effect.Atomic.SteelAtomicU (FStar.Ghost.eras... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: t: Hacl.Spec.Bignum.Definitions.limb_t -> len: Hacl.Spec.Bignum.bn_len t -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nope... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n n: Hacl.Spec.Bignum.Definitions.lbignum t len ->\n mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}\n -> Spec.Exponentiation.one_st (Hacl.Spec.Bignum.MontExponentiation.bn_m... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n n: Hacl.Spec.Bignum.Definitions.lbignum t len ->\n mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}\n -> Spec.Exponentiation.sqr_st (Hacl.Spec.Bignum.MontExponentiation.bn_m... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n n: Hacl.Spec.Bignum.Definitions.lbignum t len ->\n mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}\n -> Spec.Exponentiation.mul_st (Hacl.Spec.Bignum.MontExponentiation.bn_m... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit -> Prims.squash (2 == 1 + 1)\nEffect: Prims.Tot\n\nContext:\nmodule CalcInference\n\nlet lem () : squash (2 == 1 + 1) = ()\n\nlet test1 () : squash (2 == 1 + 1) =\n calc (==) {\n 2;\n == { lem () }\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n code: Vale.X64.Decls.va_code ->\n _win: Prims.bool ->\n bit: Vale.Inline.X64.Fswap_inline.uint64 ->\n p0: Vale.Inline.X64.Fswap_inline.b64 ->\n p1: Vale.Inline.X64.Fswap_inline.b64 ->\n va_s0: Vale.X6... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit -> Prims.squash (2 == 1 + 1)\nEffect: Prims.Tot\n\nContext:\nmodule CalcInference\n\nlet lem () : squash (2 == 1 + 1) = ()\n\nPartial implementation:\nlet test1 () : squash (2 == 1 + 1) =\n \n"
},
{
... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit -> Prims.squash (2 == 1 + 1)\nEffect: Prims.Tot\n\nContext:\nmodule CalcInference\n\nlet lem () : squash (2 == 1 + 1) = ()\n\nlet test1 () : squash (2 == 1 + 1) =\n calc (==) {\n 2;\n == { lem () }\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Defini... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Defini... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: l: Lib.IntTypes.size_pos{l < Lib.IntTypes.bits t /\\ Prims.pow2 l * len <= Lib.IntTypes.max_size_t}\n -> Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.Mo... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Defini... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Spec.Bignum.MontExponentiation\n\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Sequence\n\nopen Hacl.Spec.Bignum.Defini... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n hp: LowParse.Spec.Base.parser hk ht ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Bas... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n x: LowParse.Spec.Dep... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp\n -> Type\nEffect: Prims.To... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n hk: LowParse.Spec.Base.parser_kind ->\n pk: LowParse.Spec.Base.parser_kind\n -> LowParse.Spec.Base.parser_kind\nEffect: Prims.Tot\n\... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: t: Hacl.Bignum.Definitions.limb_t -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Impl.RSAPSS\n\nopen FStar.HyperStack\nopen FStar.HyperStack.ST\nopen FStar.Mul\n\nopen Lib.IntTypes\nopen Lib.Buffer\n\nopen Hacl.Bign... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht\n -> LowParse... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: Steel.GhostPCMReference.ref a pcm ->\n fact: Steel.Preorder.stable_property pcm ->\n v: FStar.Ghost.erased a ->\n _: Prims.squash (Steel.Preorder.fact_valid_compat fact (FStar.Ghost.reveal v))\n -> Stee... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht ->\n x: Low... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht ->\n input:... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n hs:\n LowParse.Spec.Base.serializer hp\n { Mkparser_kind'?.parser_kind_subkind hk ==\n FStar.Pervasives.Native.Some... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht ->\n x:\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n Benton2004.RHL.Derived.related Benton2004.RHL.Examples2.l\n Benton2004.RHL.Examples2.r\n (Benton2004.RHL.Examples2.phi ())\n (Benton2004... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: Prims.int -> Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compl... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht\n -> LowParse... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: steps: Prims.list FStar.Pervasives.norm_step -> x: t -> FStar.Tactics.Effect.Tac Prims.unit\nEffect: FStar.Tactics.Effect.Tac\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache Lice... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: Prims.int -> Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compl... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the L... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n hs:\n LowParse.Spec.Base.serializer hp\n { Mkparser_kind'?.parser_kind_subkind hk ==\n FStar.Pervasives.Native.Some... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: t -> t\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the L... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the L... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: f: FStar.Seq.Properties.tot_ord a -> i: Prims.nat -> j: Prims.nat{i <= j} -> x: FStar.Array.array a\n -> FStar.ST.ST Prims.unit\nEffect: FStar.ST.ST\n\nContext:\n(*\n Copyright 2008-2014 Nikhil Swamy and Microsoft Rese... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: FStar.Pervasives.norm_step\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in comp... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the L... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n t: Hacl.Bignum.Definitions.limb_t ->\n a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->\n modBits: Hacl.Impl.RSAPSS.modBits_t t\n -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Impl... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n hp: LowParse.Spec.Base.parser hk ht ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Bas... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: a\n -> Prims.Tot (FStar.WellFoundedRelation.acc_classical FStar.WellFoundedRelation.empty_relation x)\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2022 Jay Lorch and Nikhil Swamy, Microsoft Research\n\n Licensed... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n min: Prims.nat ->\n max: Prims.nat{min <= max /\\ max < 4294967296} ->\n dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->\n ps: LowParse.Spec.Base.serializer pp ->\n h: ht ->\n input:... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: a\n -> Prims.Tot\n (FStar.WellFoundedRelation.acc_classical FStar.WellFoundedRelation.default_relation x)\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2022 Jay Lorch and Nikhil Swamy, Microsoft Research\n\n L... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: a: Type\n -> wfr:\n FStar.WellFoundedRelation.wfr_t a\n {Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.default_relation}\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2022 Jay Lorch and Nikhil Swamy, Micr... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: a: Type\n -> wfr:\n FStar.WellFoundedRelation.wfr_t a\n {Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.empty_relation}\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2022 Jay Lorch and Nikhil Swamy, Micros... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: (_: a -> _: a -> Type0) ->\n f:\n FStar.WellFounded.well_founded r\n {forall (x1: a) (x2: a) (p: r x1 x2). AccIntro?.access_smaller (f x2) x1 p == f x1} ->\n x: a\n -> Prims.Tot\n (FStar.Wel... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n t: Hacl.Bignum.Definitions.limb_t ->\n a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->\n modBits: Hacl.Impl.RSAPSS.modBits_t t\n -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule Hacl.Impl... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: t -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term\nEffect: FStar.Tactics.Effect.Tac\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"Licens... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: _ -> Prims.bool\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Do... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.eqtype\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Down\nop... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: Vale.X64.Machine_s.reg_64 -> FStar.Pervasives.Native.option (Vale.Interop.X64.reg_nat 3)\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Down\nopen Vale... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: (_: a -> _: a -> Type0) -> f: FStar.WellFounded.well_founded r\n -> wfr:\n FStar.WellFoundedRelation.wfr_t a\n {Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.acc_relation r}\nEffect: Prims.Tot\n\nContext:... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: (_: a -> _: a -> Type0) ->\n wfr:\n FStar.WellFoundedRelation.wfr_t a\n {forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr x1 x2}\n -> wfr': FStar.WellFoundedRelation.wfr_t a {Mkwfr_t?.rel... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.X64.Decls.va_code\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferVie... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: (_: a -> _: a -> Type0) ->\n wfr:\n FStar.WellFoundedRelation.wfr_t a\n {forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr x1 x2} ->\n x: a\n -> Prims.Tot (FStar.WellFoundedRelation.acc... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: (_: a -> _: a -> Type0) ->\n f: (_: a -> b) ->\n wfr:\n FStar.WellFoundedRelation.wfr_t b\n {forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr (f x1) (f x2)}\n -> wfr': FStar.WellFounde... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n r: (_: a -> _: a -> Type0) ->\n f: (_: a -> b) ->\n wfr:\n FStar.WellFoundedRelation.wfr_t b\n {forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr (f x1) (f x2)} ->\n x: a\n -> Prims.Tot... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: wfr_a: FStar.WellFoundedRelation.wfr_t a -> wfr_b: FStar.WellFoundedRelation.wfr_t b\n -> wfr:\n FStar.WellFoundedRelation.wfr_t (a * b)\n {Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.lex_nondep_relation w... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: _ -> Prims.bool\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Do... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Prims.nat -> Prims.string\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.Buf... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: wfr_a: FStar.WellFoundedRelation.wfr_t a -> wfr_b: FStar.WellFoundedRelation.wfr_t b -> xy: (a * b)\n -> Prims.Tot\n (FStar.WellFoundedRelation.acc_classical (FStar.WellFoundedRelation.lex_nondep_relation wfr_a\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.list Prims.string\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferVi... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: wfr:\nFStar.WellFoundedRelation.wfr_t Prims.bool\n {Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.bool_relation}\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2022 Jay Lorch and Nikhil Swamy, Microsoft Research\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n wfr_a: FStar.WellFoundedRelation.wfr_t a ->\n a_to_wfr_b: (x: a -> FStar.WellFoundedRelation.wfr_t (b x)) ->\n xy: Prims.dtuple2 a (fun x -> b x)\n -> Prims.Tot\n (FStar.WellFoundedRelation.acc_classical (... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.AsLowStar.ValeSig.vale_post Vale.Inline.X64.Fadd_inline.fadd_dom\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fadd_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n t: Hacl.Bignum.Definitions.limb_t ->\n ke: Hacl.Bignum.Exponentiation.exp t ->\n a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->\n modBits: Hacl.Impl.RSAPSS.modBits_t t\n -> Type0\nEf... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n wfr_a: FStar.WellFoundedRelation.wfr_t a ->\n a_to_wfr_b: (x: a -> FStar.WellFoundedRelation.wfr_t (b x))\n -> wfr:\n FStar.WellFoundedRelation.wfr_t (Prims.dtuple2 a (fun x -> b x))\n {Mkwfr_t?.relation... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.