blob: e4747dde88a4e9cb4a8783349d2c9be8ccbfef26 (
plain)
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
|
(**************************************************************************)
(* *)
(* SMTCoq *)
(* Copyright (C) 2011 - 2021 *)
(* *)
(* See file "AUTHORS" for the list of authors *)
(* *)
(* This file is distributed under the terms of the CeCILL-C licence *)
(* *)
(**************************************************************************)
(** Sharing of coq Int *)
let cInt_tbl = Hashtbl.create 17
let mkInt i =
try Hashtbl.find cInt_tbl i
with Not_found ->
let ci = Structures.mkInt i in
Hashtbl.add cInt_tbl i ci;
ci
(** Generic representation of shared object *)
type 'a gen_hashed = { index : int; mutable hval : 'a }
(** Functions over constr *)
let mklApp f args = Structures.mkApp (Lazy.force f, args)
let string_of_name_def d n = try Structures.string_of_name n with | _ -> d
let string_coq_constr t =
let rec fix rf x = rf (fix rf) x in
let pr = fix
Ppconstr.modular_constr_pr Pp.mt Structures.ppconstr_lsimpleconstr in
Pp.string_of_ppcmds (pr (Structures.constrextern_extern_constr t))
(** Logics *)
type logic_item =
| LUF
| LLia
| LBitvectors
| LArrays
module SL = Set.Make (struct
type t = logic_item
let compare = Pervasives.compare
end)
type logic = SL.t
(** Utils *)
let rec filter_map f = function
| [] -> []
| x::xs -> match f x with Some x -> x::(filter_map f xs) | None -> filter_map f xs
|
