types.mli 4.83 KB
Newer Older
1
2
3
4
module LabelPool : Pool.T with type value = string
module AtomPool  : Pool.T with type value = string
type label = LabelPool.t
type atom  = AtomPool.t
5
type const = Integer of Big_int.big_int | Atom of atom | Char of Chars.Unichar.t
6

7
8
(** Algebra **)

9
10
type node
type descr
11

12
13
val make: unit -> node
val define: node -> descr -> unit
14

15
16
val cons: descr -> node
val internalize: node -> node
17

18
19
val id: node -> int
val descr: node -> descr
20

21
22
23
val equal_descr: descr -> descr -> bool
val hash_descr: descr -> int

24

25
module DescrHash: Hashtbl.S with type key = descr
26
27
28
29
module DescrMap: Map.S with type key = descr

(* Note: it seems that even for non-functional data, DescrMap
is more efficient than DescrHash ... *)
30

31
32
(** Boolean connectives **)

33
34
35
36
37
38
val cup    : descr -> descr -> descr
val cap    : descr -> descr -> descr
val diff   : descr -> descr -> descr
val neg    : descr -> descr
val empty  : descr
val any    : descr
39

40
41
(** Constructors **)

42
43
type pair_kind = [ `Normal | `XML ]

44
val interval : Intervals.t -> descr
45
val atom     : atom Atoms.t -> descr
46
val times    : node -> node -> descr
47
val xml      : node -> node -> descr
48
49
val arrow    : node -> node -> descr
val record   : label -> bool -> node -> descr
50
val char     : Chars.t -> descr
51
val constant : const -> descr
52

53
54
55
56
57
58
59
(** Positive systems and least solutions **)

module Positive :
sig
  type v
  val forward: unit -> v
  val define: v -> v -> unit
60
  val ty: descr -> v
61
62
63
  val cup: v list -> v
  val times: v -> v -> v

64
  val solve: v -> node
65
66
67
68
69
end

(** Normalization **)

module Product : sig
70
  val any : descr
71
72
73
  val any_xml : descr
  val other : ?kind:pair_kind -> descr -> descr
  val is_product : ?kind:pair_kind -> descr -> bool
74
75
76

  (* List of non-empty rectangles *)
  type t = (descr * descr) list
77
  val is_empty: t -> bool
78
  val get: ?kind:pair_kind -> descr -> t
79
80
81
82
83
84
85
86
87
  val pi1: t -> descr
  val pi2: t -> descr
    
  (* Intersection with (pi1,Any) *)
  val restrict_1: t -> descr -> t

  (* List of non-empty rectangles whose first projection
     are pair-wise disjunct *)
  type normal = t
88
  val normal: ?kind:pair_kind -> descr -> normal
89
90
91

  val need_second: t -> bool
    (* Is there more than a single rectangle ? *)
92
93
94
end

module Record : sig
95
  val any : descr
96

97
  (* List of maps label -> (optional, content) *)
98
  type t (* = (label, (bool * descr)) SortedMap.t list *)
99
  val get: descr -> t
100
  val descr: t -> descr
101
102
103
104
105
106
107
108
109
110
  val is_empty: t -> bool
  val restrict_label_present: t -> label -> t
  val restrict_field: t -> label -> descr -> t
  val restrict_label_absent: t -> label -> t
  val project_field: t -> label -> descr

  type normal = 
      [ `Success
      | `Fail
      | `Label of label * (descr * normal) list * normal ]
111
	   
112
113
  val normal: descr -> normal

114
115
116
  val normal': descr -> label -> (descr * descr) list * descr option
  val first_label: descr -> [ `Empty | `Any | `Label of label ]

117
  val project : descr -> label -> descr
118
    (* Raise Not_found if label is not necessarily present *)
119
120
end

121
122
module Arrow : sig
  val any : descr
123

124
125
126
127
128
129
130
131
  val check_strenghten: descr -> descr -> descr
    (* [check_strenghten t s]
       Assume that [t] is an intersection of arrow types
       representing the interface of an abstraction;
       check that this abstraction has type [s] (otherwise raise Not_found)
       and returns a refined type for this abstraction.
    *)

132
133
  val check_iface: (descr * descr) list -> descr -> bool

134
  type t
135
  val is_empty: t -> bool
136
137
  val get: descr -> t
    (* Always succeed; no check <= Arrow.any *)
138

139
140
141
  val domain: t -> descr
  val apply: t -> descr -> descr
    (* Always succeed; no check on the domain *)
142
143
144
145
146
147

  val need_arg : t -> bool
    (* True if the type of the argument is needed to obtain
       the type of the result (must use [apply]; otherwise,
       [apply_noarg] is enough *)
  val apply_noarg : t -> descr
148
149
150
end


151
module Int : sig
152
153
  val has_int : descr -> Big_int.big_int -> bool

154
155
156
157
158
159
160
  val any : descr

  val is_int : descr -> bool
  val get: descr -> Intervals.t
  val put: Intervals.t -> descr
end

161
162
163
164
module Atom : sig
  val has_atom : descr -> atom -> bool
end

165
166
module Char : sig
  val has_char : descr -> Chars.Unichar.t -> bool
167
  val any : descr
168
169
end

170
val normalize : descr -> descr
171

172
(** Subtyping and sample values **)
173

174
175
176
val is_empty : descr -> bool
val non_empty: descr -> bool
val subtype  : descr -> descr -> bool
177

178
179
180
module Sample :
sig
  type t =
181
    | Int of Big_int.big_int
182
    | Atom of atom
183
    | Char of Chars.Unichar.t
184
185
    | Pair of (t * t)
    | Xml of (t * t)
186
187
188
189
190
191
192
193
    | Record of (label * t) list
    | Fun of (node * node) list

  val get : descr -> t
	(** 
	  Extract a sample value from a non empty type;
	  raise Not_found for an empty type
	**)
194
195

  val print : Format.formatter -> t -> unit
196
197
end

198
199
module Print :
sig
200
  val register_global : string -> descr -> unit
201
  val print_const : Format.formatter -> const -> unit
202
203
  val print : Format.formatter -> node -> unit
  val print_descr: Format.formatter -> descr -> unit
204
end
205

206
val check: descr -> unit