val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n})
let bv2list #n s = S.seq_to_list s
val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n})
let bv2list #n s =
S.seq_to_list s
FStar.BV.fst.checked
prims.fst.checked FStar.UInt.fsti.checked FStar.Seq.fst.checked FStar.Pervasives.fsti.checked FStar.BitVector.fst.checked
FStar.BV.fst
Prims.pos FStar.BV.bv_t FStar.Seq.Properties.seq_to_list Prims.bool Prims.list Prims.b2t Prims.op_Equality Prims.int Prims.l_or Prims.op_GreaterThanOrEqual Prims.op_GreaterThan FStar.List.Tot.Base.length
(*
   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 agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*)
module FStar.BV

module U = FStar.UInt
module B = FStar.BitVector
module S = FStar.Seq

let bv_t (n : nat) = B.bv_t n

let bv_uext #n #i a =
  Seq.append (Seq.create i false) a

let int2bv = U.to_vec
let bv2int = U.from_vec

let int2bv_lemma_1 = U.to_vec_lemma_1
let int2bv_lemma_2 = U.to_vec_lemma_2
let inverse_vec_lemma = U.inverse_vec_lemma
let inverse_num_lemma = U.inverse_num_lemma
val bv2list: #n: pos -> bv_t n -> Tot (l: list bool {List.length l = n})
s: FStar.BV.bv_t n -> l: Prims.list Prims.bool {FStar.List.Tot.Base.length l = n}