val mk_mem (rid_ctr:int) (h:hmap) (tip:rid) :mem'
let mk_mem rid_ctr h tip = HS rid_ctr h tip
val mk_mem (rid_ctr:int) (h:hmap) (tip:rid) :mem'
let mk_mem rid_ctr h tip =
HS rid_ctr h tip
FStar.Monotonic.HyperStack.fst.checked
prims.fst.checked FStar.Set.fsti.checked FStar.Preorder.fst.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.Monotonic.Heap.fsti.checked FStar.Map.fsti.checked FStar.Classical.fsti.checked
FStar.Monotonic.HyperStack.fst
Prims.int FStar.Monotonic.HyperHeap.hmap FStar.Monotonic.HyperHeap.rid FStar.Monotonic.HyperStack.HS FStar.Monotonic.HyperStack.mem'
(*
   Copyright 2008-2014 Aseem Rastogi, 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.
*)
module FStar.Monotonic.HyperStack

open FStar.Preorder
module Map = FStar.Map

let map_invariant = map_invariant_predicate

let downward_closed = downward_closed_predicate

let tip_top = tip_top_predicate

let rid_ctr_pred = rid_ctr_pred_predicate

noeq type mem' =
  | HS :rid_ctr:int -> h:hmap -> tip:rid -> mem'
val mk_mem (rid_ctr:int) (h:hmap) (tip:rid) :mem'
rid_ctr: Prims.int -> h: FStar.Monotonic.HyperHeap.hmap -> tip: FStar.Monotonic.HyperHeap.rid
  -> FStar.Monotonic.HyperStack.mem'