1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
(**************************************************************************)
(* *)
(* The Alt-ergo theorem prover *)
(* Copyright (C) 2006-2010 *)
(* *)
(* Sylvain Conchon *)
(* Evelyne Contejean *)
(* Stephane Lescuyer *)
(* Mohamed Iguernelala *)
(* Alain Mebsout *)
(* *)
(* CNRS - INRIA - Universite Paris Sud *)
(* *)
(* This file is distributed under the terms of the CeCILL-C licence *)
(* *)
(**************************************************************************)
type t
type view = {f: Symbols.t ; xs: t list; ty: Ty.t}
type subst = t Subst.t * Ty.subst
val view : t -> view
val make : Symbols.t -> t list -> Ty.t -> t
val shorten : t -> t
val vrai : t
val faux : t
val unit : t
val int : string -> t
val rat : string -> t
val bitv : string -> Ty.t -> t
val is_int : t -> bool
val is_rat : t -> bool
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val vars_of : t -> Symbols.Set.t
val pred : t -> t
val apply_subst : subst -> t -> t
val print : Format.formatter -> t -> unit
val print_list : Format.formatter -> t list -> unit
val dummy : t
module Map : Map.S with type key = t
module Set : Set.S with type elt = t
val subterms : Set.t -> t -> Set.t
|
