val recall: p:(heap -> Type){ST.stable p} ->
  ST unit
    (requires (fun _ ->  witnessed p))
    (ensures (fun h0 _ h1 -> h0 == h1 /\ p h1))
let recall p = gst_recall p
val recall: p:(heap -> Type){ST.stable p} ->
  ST unit
    (requires (fun _ ->  witnessed p))
    (ensures (fun h0 _ h1 -> h0 == h1 /\ p h1))
let recall p =
gst_recall p
FStar.MRef.fst.checked
prims.fst.checked FStar.ST.fst.checked FStar.Preorder.fst.checked FStar.Pervasives.fsti.checked FStar.Heap.fst.checked
FStar.MRef.fst
FStar.Monotonic.Heap.heap FStar.ST.stable FStar.ST.gst_recall Prims.unit
(*
   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.MRef
open FStar.Heap
open FStar.ST

open FStar.Preorder

private let p_pred (#a:Type) (#b:preorder a) (r:mref a b) (p:(a -> Type))
  = fun h -> h `contains` r /\ p (sel h r)

let token #_ #_ r p = witnessed (p_pred r p)

let witness_token #_ #_ m p =
  gst_recall (contains_pred m);
  gst_witness (p_pred m p)

let recall_token #_ #_ m p = gst_recall (p_pred m p)

let lemma_functoriality #_ #_ r p q = lemma_functoriality (p_pred r p) (p_pred r q)
val recall: p:(heap -> Type){ST.stable p} ->
  ST unit
    (requires (fun _ ->  witnessed p))
    (ensures (fun h0 _ h1 -> h0 == h1 /\ p h1))
p: (_: FStar.Monotonic.Heap.heap -> Type0){FStar.ST.stable p} -> FStar.ST.ST Prims.unit