blob: e1400fcb1a4b5c94d3df547e435b188d31c70cc2 (
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
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
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(* Certification of Imperative Programs / Jean-Christophe Filliâtre *)
(* $Id: pmonad.mli,v 1.1.16.1 2004/07/16 19:30:02 herbelin Exp $ *)
open Names
open Term
open Ptype
open Past
open Penv
(* Main part of the translation of imperative programs into functional ones
* (with mlise.ml) *)
(* Here we translate the specification into a CIC specification *)
val trad_ml_type_v : Prename.t -> local_env -> type_v -> constr
val trad_ml_type_c : Prename.t -> local_env -> type_c -> constr
val trad_imp_type : Prename.t -> local_env -> type_v -> constr
val trad_type_in_env : Prename.t -> local_env -> identifier -> constr
val binding_of_alist : Prename.t -> local_env
-> (identifier * identifier) list
-> cc_binder list
val make_abs : cc_binder list -> cc_term -> cc_term
val abs_pre : Prename.t -> local_env -> cc_term * constr ->
constr precondition list -> cc_term
(* The following functions translate the main constructions *)
val make_tuple : (cc_term * cc_type) list -> predicate option
-> Prename.t -> local_env -> string
-> cc_term
val result_tuple : Prename.t -> string -> local_env
-> (cc_term * constr) -> (Peffect.t * predicate option)
-> cc_term * constr
val let_in_pre : constr -> constr precondition -> cc_term -> cc_term
val make_let_in : Prename.t -> local_env -> cc_term
-> constr precondition list
-> ((identifier * identifier) list * predicate option)
-> identifier * constr
-> cc_term * constr -> cc_term
val make_block : Prename.t -> local_env
-> (Prename.t -> (identifier * constr) option -> cc_term * constr)
-> (cc_term * type_c, constr) block
-> cc_term
val make_app : local_env
-> Prename.t -> (cc_term * type_c) list
-> Prename.t -> cc_term * type_c
-> ((type_v binder list) * type_c)
* ((identifier*identifier) list)
* type_c
-> type_c
-> cc_term
val make_if : Prename.t -> local_env
-> cc_term * type_c
-> Prename.t
-> cc_term * type_c
-> cc_term * type_c
-> type_c
-> cc_term
val make_while : Prename.t -> local_env
-> (constr * constr * constr) (* typed variant *)
-> cc_term * type_c
-> (cc_term * type_c, constr) block
-> constr assertion option * type_c
-> cc_term
val make_letrec : Prename.t -> local_env
-> (identifier * (constr * constr * constr)) (* typed variant *)
-> identifier (* the name of the function *)
-> (cc_binder list)
-> (cc_term * type_c)
-> type_c
-> cc_term
(* Functions to translate array operations *)
val array_info :
Prename.t -> local_env -> identifier -> constr * constr * constr
val make_raw_access :
Prename.t -> local_env -> identifier * identifier -> constr -> constr
val make_raw_store :
Prename.t -> local_env -> identifier * identifier
-> constr -> constr -> constr
val make_pre_access :
Prename.t -> local_env -> identifier -> constr -> constr
|
