| 1 |
val nil_type: Types.t
|
| 2 |
val nil_node: Types.Node.t
|
| 3 |
val nil_atom: Atoms.V.t
|
| 4 |
val nil_cst: Types.Const.t
|
| 5 |
val any: Types.t
|
| 6 |
val int: Types.t
|
| 7 |
val seqseq: Types.t
|
| 8 |
val string: Types.t
|
| 9 |
|
| 10 |
val concat: Types.t -> Types.t -> Types.t
|
| 11 |
val flatten: Types.t -> Types.t
|
| 12 |
val map: (Types.t -> Types.t) -> Types.t -> Types.t
|
| 13 |
|
| 14 |
val map_tree:
|
| 15 |
(Types.t -> Types.t * Types.t) -> Types.t -> Types.t
|
| 16 |
(* input type -> (result, residual) *) (* sequence type *)
|
| 17 |
|
| 18 |
val star: Types.t -> Types.t
|
| 19 |
(* For a type t, returns [t*] *)
|
| 20 |
val plus: Types.t -> Types.t
|
| 21 |
|
| 22 |
val approx: Types.t -> Types.t
|
| 23 |
(* For a type t <= [Any*], returns the least type s such that:
|
| 24 |
t <= [s*]
|
| 25 |
|
| 26 |
In general, for an arbitrary type, returns the least type s such that:
|
| 27 |
t <= (X where X = (s, X) | Any \ (Any,Any))
|
| 28 |
*)
|
| 29 |
|
| 30 |
(* Added this interface needed in cdo2cmo -- Julien *)
|
| 31 |
val star_node : Types.Node.t -> Types.Node.t
|
| 32 |
|
| 33 |
(** given a list of descrs create the sequence type from them *)
|
| 34 |
val seq_of_list: Types.t list -> Types.t
|
| 35 |
|