package rocq-runtime
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
The Rocq Prover -- Core Binaries and Tools
Install
dune-project
Dependency
Authors
Maintainers
Sources
rocq-9.2.0.tar.gz
sha256=a45280ab4fbaac7540b136a6b073b4a6db15739ec1e149bded43fa6f4fc25f20
doc/src/rocq-runtime.library/summary.ml.html
Source file summary.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285(************************************************************************) (* * The Rocq Prover / The Rocq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************) module Dyn = Dyn.Make () module Stage = struct type t = Synterp | Interp let equal x y = match x, y with | Synterp, Synterp -> true | Synterp, Interp -> false | Interp, Interp -> true | Interp, Synterp -> false end type 'a summary_declaration = { stage : Stage.t; freeze_function : unit -> 'a; unfreeze_function : 'a -> unit; init_function : unit -> unit } module Decl = struct type 'a t = 'a summary_declaration end module DynMap = Dyn.Map(Decl) module MarshMap = Dyn.Map(struct type 'a t = 'a -> 'a end) type ml_modules = string list let sum_mod : ml_modules summary_declaration option ref = ref None let sum_map_synterp = ref DynMap.empty let sum_map_interp = ref DynMap.empty let sum_marsh_synterp = ref MarshMap.empty let sum_marsh_interp = ref MarshMap.empty let mangle id = id ^ "-SUMMARY" let declare_ml_modules_summary decl = sum_mod := Some decl let check_name sumname = match Dyn.name sumname with | None -> () | Some (Dyn.Any t) -> CErrors.anomaly ~label:"Summary.declare_summary" Pp.(str "Colliding summary names: " ++ str sumname ++ str " vs. " ++ str (Dyn.repr t) ++ str ".") let declare_summary_tag sumname ?make_marshallable decl = let () = check_name (mangle sumname) in let tag = Dyn.create (mangle sumname) in let sum_map, marsh_map = match decl.stage with | Synterp -> sum_map_synterp, sum_marsh_synterp | Interp -> sum_map_interp, sum_marsh_interp in let () = sum_map := DynMap.add tag decl !sum_map in let () = make_marshallable |> Option.iter (fun f -> marsh_map := MarshMap.add tag f !marsh_map) in tag let declare_summary sumname ?make_marshallable decl = ignore(declare_summary_tag sumname ?make_marshallable decl) module ID = struct type 'a t = 'a end module Frozen = Dyn.Map(ID) module HMap = Dyn.HMap(Decl)(ID) module type FrozenStage = sig (** The type [frozen] is a snapshot of the states of all the registered tables of the system. *) type frozen val empty_frozen : frozen val freeze_summaries : unit -> frozen val make_marshallable : frozen -> frozen val unfreeze_summaries : ?partial:bool -> frozen -> unit val init_summaries : unit -> unit val project_from_summary : frozen -> 'a Dyn.tag -> 'a end let freeze_summaries sum_map = let map = { HMap.map = fun tag decl -> decl.freeze_function () } in HMap.map map sum_map let make_marshallable marsh_map summaries = let map = { Frozen.map = fun tag v -> match MarshMap.find tag marsh_map with | exception Not_found -> v | f -> f v } in Frozen.map map summaries let warn_summary_out_of_scope = CWarnings.create ~name:"summary-out-of-scope" ~default:Disabled Pp.(fun name -> str "A Rocq plugin was loaded inside a local scope (such as a Section)." ++ spc() ++ str "It is recommended to load plugins at the start of the file." ++ spc() ++ str "Summary entry: " ++ str name) let unfreeze_summaries ?(partial=false) sum_map summaries = (* We must be independent on the order of the map! *) let ufz (DynMap.Any (name, decl)) = try decl.unfreeze_function Frozen.(find name summaries) with Not_found -> if not partial then begin warn_summary_out_of_scope (Dyn.repr name); decl.init_function () end in DynMap.iter ufz sum_map let init_summaries sum_map = DynMap.iter (fun (DynMap.Any (_, decl)) -> decl.init_function ()) sum_map module Synterp = struct type frozen = { summaries : Frozen.t; (** Ordered list w.r.t. the first component. *) ml_module : ml_modules option; (** Special handling of the ml_module summary. *) } let empty_frozen = { summaries = Frozen.empty; ml_module = None } let freeze_summaries () = let summaries = freeze_summaries !sum_map_synterp in { summaries; ml_module = Option.map (fun decl -> decl.freeze_function ()) !sum_mod } let make_marshallable { summaries; ml_module } = { summaries = make_marshallable !sum_marsh_synterp summaries; ml_module } let unfreeze_summaries ?(partial=false) { summaries; ml_module } = (* The unfreezing of [ml_modules_summary] has to be anticipated since it * may modify the content of [summaries] by loading new ML modules *) begin match !sum_mod with | None -> CErrors.anomaly Pp.(str "Undeclared ML-MODULES summary.") | Some decl -> Option.iter decl.unfreeze_function ml_module end; unfreeze_summaries ~partial !sum_map_synterp summaries let init_summaries () = init_summaries !sum_map_synterp (** Summary projection *) let project_from_summary { summaries; _ } tag = Frozen.find tag summaries end module Interp = struct type frozen = Frozen.t let empty_frozen = Frozen.empty let freeze_summaries () = freeze_summaries !sum_map_interp let make_marshallable summaries = make_marshallable !sum_marsh_interp summaries let unfreeze_summaries ?(partial=false) summaries = unfreeze_summaries ~partial !sum_map_interp summaries let init_summaries () = init_summaries !sum_map_interp (** Summary projection *) let project_from_summary summaries tag = Frozen.find tag summaries let modify_summary summaries tag v = let () = assert (Frozen.mem tag summaries) in Frozen.add tag v summaries let remove_from_summary summaries tag = let () = assert (Frozen.mem tag summaries) in Frozen.remove tag summaries end (** For global tables registered statically before the end of rocq repl launch, the following empty [init_function] could be used. *) let nop () = () (** All-in-one reference declaration + registration *) let ref_tag ?(stage=Stage.Interp) ~name x = let r = ref x in let tag = declare_summary_tag name { stage; freeze_function = (fun () -> !r); unfreeze_function = ((:=) r); init_function = (fun () -> r := x) } in r, tag let ref ?(stage=Stage.Interp) ?(local=false) ~name x = if not local then fst @@ ref_tag ~stage ~name x else let r = ref x in let () = declare_summary name ~make_marshallable:(fun _ -> None) { stage; freeze_function = (fun () -> Some !r); unfreeze_function = (function Some v -> r := v | None -> r := x); init_function = (fun () -> r := x); } in r (** Observables *) module type OBSERVABLE = sig type token type value val register : name:string -> ?override:bool -> value -> token val activate : token -> unit val deactivate : token -> unit val is_active : token -> bool end module type OBSERVABLE_USER = sig include OBSERVABLE val all_active : unit -> (string * value) list end module MakeObservable (Obs : sig type value val stage : Stage.t val local : bool val name : string end) : OBSERVABLE_USER with type value = Obs.value = struct type token = string type value = Obs.value let observers = Stdlib.ref CString.Map.empty let active_observers : token list ref = ref ~stage:Obs.stage ~local:Obs.local ~name:Obs.name [] let register ~name ?(override=false) value : token = if not override && CString.Map.mem name !observers then CErrors.anomaly Pp.(str Obs.name ++ str " observer " ++ str name ++ str " already exists") else observers := CString.Map.add name value !observers ; name let remove name = Util.List.remove String.equal name !active_observers let activate name : unit = assert (CString.Map.mem name !observers); active_observers := name :: remove name; () let deactivate name : unit = active_observers := remove name; () let is_active tkn = List.mem tkn !active_observers let all_active () : (token * value) list = List.map (fun k -> k, CString.Map.get k !observers) !active_observers end let dump = Dyn.dump
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>