types.mli 5.22 KB
Newer Older
1 2
open Ident

3 4 5 6 7 8 9 10 11
type const = 
  | Integer of Intervals.V.t
  | Atom of Atoms.V.t 
  | Char of Chars.V.t
  | Pair of const * const
  | Xml of const * const
  | Record of const label_map
  | String of U.uindex * U.uindex * U.t * const

12

13
module Const: Custom.T with type t = const
14

15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

module CompUnit : sig
  include Custom.T

  val mk: U.t -> t
  val value: t -> U.t

  val enter: t -> unit
  val leave: unit -> unit
  val close_serialize: unit -> t list

  val pervasives: t

  module Tbl : Inttbl.S with type key = t
end

31 32
(** Algebra **)

33 34
include Custom.T
module Node : Custom.T
35

36
type descr = t
37

38 39
val make: unit -> Node.t
val define: Node.t -> t -> unit
40

41 42
val cons: t -> Node.t
val internalize: Node.t -> Node.t
43

44 45
val id: Node.t -> int
val descr: Node.t -> t
46

47 48
(** Boolean connectives **)

49 50 51 52 53 54
val cup    : t -> t -> t
val cap    : t -> t -> t
val diff   : t -> t -> t
val neg    : t -> t
val empty  : t
val any    : t
55

56
val any_node : Node.t
57

58
val non_constructed : t
59

60 61
(** Constructors **)

62 63
type pair_kind = [ `Normal | `XML ]

64 65 66 67 68 69
val interval : Intervals.t -> t
val atom     : Atoms.t -> t
val times    : Node.t -> Node.t -> t
val xml      : Node.t -> Node.t -> t
val arrow    : Node.t -> Node.t -> t
val record   : label -> Node.t -> t
70
  (* bool = true -> open record; bool = false -> closed record *)
71 72 73
val record'  : bool * Node.t label_map -> t
val char     : Chars.t -> t
val constant : const -> t
74

75 76 77
(** Helpers *)

  (** given a list of descrs create an OR type including all descrs *)
78
val choice_of_list: t list -> t
79 80 81

  (** do it yourself: create an Xml type from three types (tag type, attribute
  type, content type) *)
82
val xml': t -> t -> t -> t
83

84
  (** Build a record from a list of <name,t> pairs. Open defaults to true.
85
  All specified fields are required. *)
86
val rec_of_list: ?opened:bool -> (Ns.qname * t) list -> t
87 88 89

  (** Similiar to rec_of_list, the additional boolean value specify whether the
  specified field is optional (true) or not (false. *)
90
val rec_of_list': ?opened:bool -> (bool * Ns.qname * t) list -> t
91

92 93
val empty_closed_record: t
val empty_opened_record: t
94

95 96 97 98 99 100 101
(** Positive systems and least solutions **)

module Positive :
sig
  type v
  val forward: unit -> v
  val define: v -> v -> unit
102
  val ty: t -> v
103 104
  val cup: v list -> v
  val times: v -> v -> v
105
  val xml: v -> v -> v
106

107
  val solve: v -> Node.t
108 109 110 111 112
end

(** Normalization **)

module Product : sig
113 114 115 116
  val any : t
  val any_xml : t
  val other : ?kind:pair_kind -> t -> t
  val is_product : ?kind:pair_kind -> t -> bool
117 118 119

  (* List of non-empty rectangles *)
  type t = (descr * descr) list
120
  val is_empty: t -> bool
121
  val get: ?kind:pair_kind -> descr -> t
122 123
  val pi1: t -> descr
  val pi2: t -> descr
124
  val pi2_restricted: descr -> t -> descr
125 126 127 128 129 130 131
    
  (* 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
132
  val normal: ?kind:pair_kind -> descr -> normal
133

134 135 136 137
  val constraint_on_2: normal -> descr -> descr
    (* constraint_on_2 n t1:  maximal t2 such that (t1,t2) <= n *)
    (* Assumption: t1 <= pi1(n) *)

138 139
  val need_second: t -> bool
    (* Is there more than a single rectangle ? *)
140 141 142
end

module Record : sig
143 144 145
  val any : t
  val or_absent: t -> t
  val any_or_absent: t
146

147 148
  val has_absent: t -> bool
  val has_record: t -> bool
149

150 151
  val split : t -> label -> Product.t
  val split_normal : t -> label -> Product.normal
152

153
  val project : t -> label -> t
154 155
    (* Raise Not_found if label is not necessarily present *)

156
  val condition : t -> label -> t -> t
157
    (* condition t1 l t2 : What must follow if field l hash type t2 *)
158 159
  val project_opt : t -> label -> t
  val has_empty_record: t -> bool
160 161


162
  val first_label: t -> label
163

164
  val empty_cases: t -> bool * bool
165

166 167
  val merge: t -> t -> t
  val remove_field: t -> label -> t
168

169
  val get: t -> ((bool * t) label_map * bool * bool) list
170 171
end

172
module Arrow : sig
173
  val any : t
174

175
  val sample: t -> t
176

177
  val check_strenghten: t -> t -> t
178 179 180 181 182 183 184
    (* [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.
    *)

185
  val check_iface: (t * t) list -> t -> bool
186

187
  type t
188
  val is_empty: t -> bool
189 190
  val get: descr -> t
    (* Always succeed; no check <= Arrow.any *)
191

192 193 194
  val domain: t -> descr
  val apply: t -> descr -> descr
    (* Always succeed; no check on the domain *)
195 196 197 198 199 200

  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
201 202 203
end


204
module Int : sig
205
  val has_int : t -> Intervals.V.t -> bool
206 207
  val get: t -> Intervals.t
  val any : t
208 209
end

210
module Atom : sig
211
  val has_atom : t -> Atoms.V.t -> bool
212 213
  val get: t -> Atoms.t
  val any : t
214 215
end

216
module Char : sig
217
  val has_char : t -> Chars.V.t -> bool
218 219 220
  val is_empty : t -> bool
  val get: t -> Chars.t
  val any : t
221 222
end

223
val normalize : t -> t
224

225
(** Subtyping  **)
226

227 228 229
val is_empty : t -> bool
val non_empty: t -> bool
val subtype  : t -> t -> bool
230

231 232
module Print :
sig
233
  val register_global : U.t -> t -> unit
234
  val print_const : Format.formatter -> const -> unit
235
  val print: Format.formatter -> t -> unit
236
end
237