diff options
| author | Chantal Keller <Chantal.Keller@inria.fr> | 2015-01-13 17:11:29 +0100 |
|---|---|---|
| committer | Chantal Keller <Chantal.Keller@inria.fr> | 2015-01-13 17:11:29 +0100 |
| commit | 7072c4591668d2c21211a744d3719f6b42d1e7b9 (patch) | |
| tree | 800520e1e414e10b29804a998c63764c18f2c1cd /src/verit/verit.ml | |
| parent | 469a88043ad000403cff5122e27770c130ef77e4 (diff) | |
| download | smtcoq-7072c4591668d2c21211a744d3719f6b42d1e7b9.tar.gz smtcoq-7072c4591668d2c21211a744d3719f6b42d1e7b9.zip | |
Identify ML functions that depend on native-coq
Diffstat (limited to 'src/verit/verit.ml')
| -rw-r--r-- | src/verit/verit.ml | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/verit/verit.ml b/src/verit/verit.ml index 87e74a6..0ae0bc9 100644 --- a/src/verit/verit.ml +++ b/src/verit/verit.ml @@ -157,13 +157,13 @@ let parse_certif t_i t_func t_atom t_form root used_root trace fsmt fproof = let res = Array.make (List.length roots + 1) (mkInt 0) in let i = ref 0 in List.iter (fun j -> res.(!i) <- mkInt (Form.to_lit j); incr i) roots; - Term.mkArray (Lazy.force cint, res) in + Structures.mkArray (Lazy.force cint, res) in let used_roots = let l = List.length used_roots in let res = Array.make (l + 1) (mkInt 0) in let i = ref (l-1) in List.iter (fun j -> res.(!i) <- mkInt j; decr i) used_roots; - mklApp cSome [|mklApp carray [|Lazy.force cint|]; Term.mkArray (Lazy.force cint, res)|] in + mklApp cSome [|mklApp carray [|Lazy.force cint|]; Structures.mkArray (Lazy.force cint, res)|] in let ce3 = { const_entry_body = roots; const_entry_type = None; @@ -238,12 +238,12 @@ let theorem name fsmt fproof = let res = Array.make (l + 1) (mkInt 0) in let i = ref (l-1) in List.iter (fun j -> res.(!i) <- mkInt j; decr i) used_roots; - mklApp cSome [|mklApp carray [|Lazy.force cint|]; Term.mkArray (Lazy.force cint, res)|] in + mklApp cSome [|mklApp carray [|Lazy.force cint|]; Structures.mkArray (Lazy.force cint, res)|] in let rootsCstr = let res = Array.make (List.length roots + 1) (mkInt 0) in let i = ref 0 in List.iter (fun j -> res.(!i) <- mkInt (Form.to_lit j); incr i) roots; - Term.mkArray (Lazy.force cint, res) in + Structures.mkArray (Lazy.force cint, res) in let t_atom = Atom.interp_tbl ra in let t_form = snd (Form.interp_tbl rf) in @@ -298,13 +298,13 @@ let checker fsmt fproof = let res = Array.make (l + 1) (mkInt 0) in let i = ref (l-1) in List.iter (fun j -> res.(!i) <- mkInt j; decr i) used_roots; - mklApp cSome [|mklApp carray [|Lazy.force cint|]; Term.mkArray (Lazy.force cint, res)|] in + mklApp cSome [|mklApp carray [|Lazy.force cint|]; Structures.mkArray (Lazy.force cint, res)|] in let t9 = Unix.time () in (* for debug *) let rootsCstr = let res = Array.make (List.length roots + 1) (mkInt 0) in let i = ref 0 in List.iter (fun j -> res.(!i) <- mkInt (Form.to_lit j); incr i) roots; - Term.mkArray (Lazy.force cint, res) in + Structures.mkArray (Lazy.force cint, res) in let t10 = Unix.time () in (* for debug *) let t_i = make_t_i rt in |