let partial_dependent_map (a:eqtype) (b:a -> Type) =
    DM.t a (opt b)
let partial_dependent_map (a: eqtype) (b: (a -> Type)) =
DM.t a (opt b)
FStar.Monotonic.DependentMap.fsti.checked
prims.fst.checked FStar.Set.fsti.checked FStar.Preorder.fst.checked FStar.Pervasives.fsti.checked FStar.HyperStack.ST.fsti.checked FStar.HyperStack.fst.checked FStar.DependentMap.fsti.checked
FStar.Monotonic.DependentMap.fsti
Prims.eqtype FStar.DependentMap.t FStar.Monotonic.DependentMap.opt
(*
   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.Monotonic.DependentMap
(** A library for mutable partial, dependent maps,
    that grow monotonically,
    while subject to an invariant on the entire map *)
open FStar.HyperStack.ST

module HS  = FStar.HyperStack
module DM  = FStar.DependentMap
module HST = FStar.HyperStack.ST

/// The logical model of the map is given in terms of DM.t///
let opt (#a:eqtype) (b:a -> Type) = fun (x:a) -> option (b x)
val partial_dependent_map : a: Prims.eqtype -> b: (_: a -> Type) -> Type
a: Prims.eqtype -> b: (_: a -> Type) -> Type