types.mli 3.39 KB
Newer Older
1 2
type label = int
type atom  = int
3
type const = Integer of Big_int.big_int | Atom of atom | Char of Chars.Unichar.t
4

5 6
(** Algebra **)

7 8
type node
type descr
9

10 11
val make: unit -> node
val define: node -> descr -> unit
12

13 14
val cons: descr -> node
val internalize: node -> node
15

16 17
val id: node -> int
val descr: node -> descr
18

19 20 21
val equal_descr: descr -> descr -> bool
val hash_descr: descr -> int

22

23 24
(** Boolean connectives **)

25 26 27 28 29 30
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
31

32 33
(** Constructors **)

34
val interval : Big_int.big_int -> Big_int.big_int -> descr
35 36 37 38
val atom     : atom -> descr
val times    : node -> node -> descr
val arrow    : node -> node -> descr
val record   : label -> bool -> node -> descr
39 40
val char     : Chars.Unichar.t -> descr
val char_class : Chars.Unichar.t -> Chars.Unichar.t -> descr
41
val constant : const -> descr
42

43 44 45 46 47 48 49
(** Positive systems and least solutions **)

module Positive :
sig
  type v
  val forward: unit -> v
  val define: v -> v -> unit
50
  val ty: descr -> v
51 52 53
  val cup: v list -> v
  val times: v -> v -> v

54
  val solve: v -> node
55 56
end

57 58 59 60 61 62 63 64
(** Labels and atom names **)

val mk_atom  : string -> atom
val atom_name : atom -> string

val label : string -> label
val label_name : label -> string

65 66 67
(** Normalization **)

module Product : sig
68
  val any : descr
69 70 71

  (* List of non-empty rectangles *)
  type t = (descr * descr) list
72
  val get: descr -> t
73 74 75 76 77 78 79 80 81
  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
82
  val normal: descr -> t
83 84 85
end

module Record : sig
86
  val any : descr
87

88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
  (* List of maps label -> (optional, content) *)
  type t = (label, (bool * descr)) SortedMap.t list
  val get: descr -> t
  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 ]
  val normal: descr -> normal

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

107 108
module Arrow : sig
  val any : descr
109

110 111 112
  type t
  val get: descr -> t
    (* Always succeed; no check <= Arrow.any *)
113

114 115 116 117 118 119
  val domain: t -> descr
  val apply: t -> descr -> descr
    (* Always succeed; no check on the domain *)
end


120 121 122 123 124 125 126 127
module Int : sig
  val any : descr

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

128
val normalize : node -> node
129

130
(** Subtyping and sample values **)
131

132 133 134
val is_empty : descr -> bool
val non_empty: descr -> bool
val subtype  : descr -> descr -> bool
135

136 137 138
module Sample :
sig
  type t =
139
    | Int of Big_int.big_int
140
    | Atom of atom
141
    | Char of Chars.Unichar.t
142 143 144 145 146 147 148 149 150
    | Pair of t * t
    | 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
	**)
151 152
end

153 154
module Print :
sig
155 156
  val register_global : string -> descr -> unit

157 158
  val print : Format.formatter -> node -> unit
  val print_descr: Format.formatter -> descr -> unit
159
  val print_sample : Format.formatter -> Sample.t -> unit
160
end
161

162
val check: descr -> unit