types.mli 4.75 KB
Newer Older
1 2
open Ident

3 4 5
type const = | Integer of Intervals.v
	     | Atom of Atoms.v 
	     | Char of Chars.v
6

7 8
val compare_const: const -> const -> int
val hash_const: const -> int
9
val equal_const: const -> const -> bool
10

11 12 13 14 15 16 17 18 19 20 21 22 23 24
(** Algebra **)

type node
type descr

val make: unit -> node
val define: node -> descr -> unit

val cons: descr -> node
val internalize: node -> node

val id: node -> int
val descr: node -> descr

25 26
val equal_descr: descr -> descr -> bool
val hash_descr: descr -> int
27
val compare_descr: descr -> descr -> int
28

29
module DescrHash: Hashtbl.S with type key = descr
30
module DescrSList: SortedList.S with type 'a elem = descr
31
module DescrMap: Map.S with type key = descr
32
module DescrSet: Set.S with type elt = descr
33

34 35 36 37 38 39 40 41 42
(** Boolean connectives **)

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

43 44
val any_node : node

45 46
val non_constructed : descr

47 48
(** Constructors **)

49 50
type pair_kind = [ `Normal | `XML ]

51
val interval : Intervals.t -> descr
52
val atom     : Atoms.t -> descr
53
val times    : node -> node -> descr
54
val xml      : node -> node -> descr
55
val arrow    : node -> node -> descr
56
val record   : label -> node -> descr
57
val record'  : bool * node label_map -> descr
58
val char     : Chars.t -> descr
59 60 61 62 63 64 65 66 67 68 69 70
val constant : const -> descr

(** Positive systems and least solutions **)

module Positive :
sig
  type v
  val forward: unit -> v
  val define: v -> v -> unit
  val ty: descr -> v
  val cup: v list -> v
  val times: v -> v -> v
71
  val xml: v -> v -> v
72 73 74 75 76 77 78 79

  val solve: v -> node
end

(** Normalization **)

module Product : sig
  val any : descr
80 81 82
  val any_xml : descr
  val other : ?kind:pair_kind -> descr -> descr
  val is_product : ?kind:pair_kind -> descr -> bool
83 84 85

  (* List of non-empty rectangles *)
  type t = (descr * descr) list
86
  val is_empty: t -> bool
87
  val get: ?kind:pair_kind -> descr -> t
88 89
  val pi1: t -> descr
  val pi2: t -> descr
90
  val pi2_restricted: descr -> t -> descr
91 92 93 94 95 96 97
    
  (* 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
98
  val normal: ?kind:pair_kind -> descr -> normal
99

100 101 102 103
  val constraint_on_2: normal -> descr -> descr
    (* constraint_on_2 n t1:  maximal t2 such that (t1,t2) <= n *)
    (* Assumption: t1 <= pi1(n) *)

104 105
  val need_second: t -> bool
    (* Is there more than a single rectangle ? *)
106 107 108
end

module Record : sig
109 110 111 112 113 114 115 116 117 118 119 120 121
  val any : descr
  val or_absent: descr -> descr
  val any_or_absent: descr

  val has_absent: descr -> bool
  val has_record: descr -> bool

  val split : descr -> label -> Product.t
  val split_normal : descr -> label -> Product.normal

  val project : descr -> label -> descr
    (* Raise Not_found if label is not necessarily present *)

122 123 124 125 126 127
  val condition : descr -> label -> descr -> descr
    (* condition t1 l t2 : What must follow if field l hash type t2 *)
  val project_opt : descr -> label -> descr
  val has_empty_record: descr -> bool


128 129 130 131
  val first_label: descr -> label

  val empty_cases: descr -> bool * bool

132 133
  val merge: descr -> descr -> descr
  val remove_field: descr -> label -> descr
134

135
  val get: descr -> ((bool * descr) label_map * bool * bool) list
136 137
end

138 139
module Arrow : sig
  val any : descr
140

141 142
  val sample: descr -> descr

143 144 145 146 147 148 149 150
  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.
    *)

151 152
  val check_iface: (descr * descr) list -> descr -> bool

153
  type t
154
  val is_empty: t -> bool
155 156
  val get: descr -> t
    (* Always succeed; no check <= Arrow.any *)
157

158 159 160
  val domain: t -> descr
  val apply: t -> descr -> descr
    (* Always succeed; no check on the domain *)
161 162 163 164 165 166

  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
167 168 169
end


170
module Int : sig
171
  val has_int : descr -> Intervals.v -> bool
172
  val get: descr -> Intervals.t
173
  val any : descr
174 175
end

176
module Atom : sig
177
  val has_atom : descr -> Atoms.v -> bool
178
  val get: descr -> Atoms.t
179
  val any : descr
180 181
end

182
module Char : sig
183
  val has_char : descr -> Chars.v -> bool
184
  val is_empty : descr -> bool
185
  val get: descr -> Chars.t
186
  val any : descr
187 188
end

189
val normalize : descr -> descr
190

191
(** Subtyping  **)
192 193 194 195 196 197 198

val is_empty : descr -> bool
val non_empty: descr -> bool
val subtype  : descr -> descr -> bool

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