trunk/types/sequence.mli

val nil_type: Types.t
val nil_node: Types.Node.t
val nil_atom: Atoms.V.t
val nil_cst:  Types.Const.t
val any: Types.t
val seqseq: Types.t
val string: Types.t

val concat: Types.t -> Types.t -> Types.t
val flatten: Types.t -> Types.t
val map: (Types.t -> Types.t) -> Types.t -> Types.t

val map_mono: Types.t -> Types.t list * (Types.t list -> Types.t)

val map_tree: 
  (Types.t -> Types.t * Types.t) -> Types.t -> Types.t
 (* input type -> (result, residual) *)         (* sequence type *)

val star: Types.t -> Types.t
  (* For a type t, returns [t*] *)
val plus: Types.t -> Types.t
val option: Types.Node.t -> Types.t
  (* returns [t?] *)

val repet: int -> int option -> Types.t -> Types.t
  (* min, max *)

val approx: Types.t -> Types.t
  (*  For a type t <= [Any*], returns the least type s such that:
      t <= [s*]
      
      In general, for an arbitrary type, returns the least type s such that:
      t <= (X where X = (s, X) |  Any \ (Any,Any))
  *)

(* Added this interface needed in cdo2cmo -- Julien *)
val star_node : Types.Node.t -> Types.Node.t

  (** given a list of descrs create the sequence type from them *)
val seq_of_list: Types.t list -> Types.t

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