val length: #a:Type -> seq a -> Tot nat
let length #_ s = List.length (MkSeq?.l s)
val length: #a:Type -> seq a -> Tot nat
let length #_ s =
List.length (MkSeq?.l s)
FStar.Seq.Base.fst.checked
prims.fst.checked FStar.Pervasives.fsti.checked FStar.List.Tot.fst.checked
FStar.Seq.Base.fst
FStar.Seq.Base.seq FStar.List.Tot.Base.length FStar.Seq.Base.__proj__MkSeq__item__l Prims.nat
(*
   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 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.
*)

(* A logical theory of sequences indexed by natural numbers in [0, n) *)
module FStar.Seq.Base
//#set-options "--initial_fuel 0 --max_fuel 0 --initial_ifuel 1 --max_ifuel 1"

module List = FStar.List.Tot

type seq (a:Type u#a) :Type u#a =
  | MkSeq: l:list a -> seq a
val length: #a:Type -> seq a -> Tot nat
s: FStar.Seq.Base.seq a -> Prims.nat