6 files changed, 0 insertions, 36 deletions
diff --git a/lib/concepts/Cardinality.ml b/lib/concepts/Cardinality.ml
index a87f9c8..d878aa9 100644
--- a/lib/concepts/Cardinality.ml
+++ b/lib/concepts/Cardinality.ml
@@ -10,16 +10,7 @@ let compare a b =
 
 let equal a b = compare a b = Utilities.Ordering.Equal
 let leq a b = compare a b <> Utilities.Ordering.Greater
-let join a b = if leq a b then b else a
 let meet a b = if leq a b then a else b
-
-let product a b =
-  match a, b with
-  | Empty, _ | _, Empty -> Empty
-  | Countable, _ | _, Countable -> Countable
-  | Finite, _ | _, Finite -> Finite
-  | Bounded n, Bounded m -> if n > max_int / m then Finite else bounded (n * m)
-
 let exhaustible = function Countable -> false | Empty | Bounded _ | Finite -> true
 
 let to_string = function
diff --git a/lib/concepts/Cardinality.mli b/lib/concepts/Cardinality.mli
index c9a5d6d..d345bce 100644
--- a/lib/concepts/Cardinality.mli
+++ b/lib/concepts/Cardinality.mli
@@ -4,12 +4,6 @@ val bounded : int -> t
 val compare : t -> t -> Utilities.Ordering.t
 val equal : t -> t -> bool
 val leq : t -> t -> bool
-val join : t -> t -> t
 val meet : t -> t -> t
-
-(** the class of a generator run under every binding produced by
-    another, which is how the classes of the generators chosen by an
-    analysis combine. *)
-val product : t -> t -> t
 val exhaustible : t -> bool
 val to_string : t -> string
diff --git a/lib/concepts/Mode.ml b/lib/concepts/Mode.ml
index fc3ef84..b7aa814 100644
--- a/lib/concepts/Mode.ml
+++ b/lib/concepts/Mode.ml
@@ -7,15 +7,8 @@ type t = mode list
 let attributes_of_list = BatSet.String.of_list
 let attributes_of_map map = BatMap.String.keys map |> BatSet.String.of_enum
 let decides_when bound = {bound= attributes_of_list bound; affords= Decides}
-
-let generates_when bound cardinality =
-  {bound= attributes_of_list bound; affords= Generates cardinality}
-
 let enumerable cardinality = {bound= BatSet.String.empty; affords= Generates cardinality}
-let empty = []
-let declare mode declaration = mode :: declaration
 let of_list modes = modes
-let to_list declaration = declaration
 
 let generation declaration bound =
   List.fold_left
diff --git a/lib/concepts/Mode.mli b/lib/concepts/Mode.mli
index 018eeb2..6a906d1 100644
--- a/lib/concepts/Mode.mli
+++ b/lib/concepts/Mode.mli
@@ -13,12 +13,8 @@ type t
 val attributes_of_list : attribute list -> attributes
 val attributes_of_map : 'a BatMap.String.t -> attributes
 val decides_when : attribute list -> mode
-val generates_when : attribute list -> Cardinality.t -> mode
 val enumerable : Cardinality.t -> mode
-val empty : t
-val declare : mode -> t -> t
 val of_list : mode list -> t
-val to_list : t -> mode list
 
 (** the tightest class declared for generating under [bound]. A mode
     declared for fewer bound attributes applies to more, since the
diff --git a/lib/kernel/SubstantialRelation.ml b/lib/kernel/SubstantialRelation.ml
index b94e2f8..090568f 100644
--- a/lib/kernel/SubstantialRelation.ml
+++ b/lib/kernel/SubstantialRelation.ml
@@ -147,8 +147,6 @@ module Make (S : Abstract.Storage.STORAGE) = struct
       [ Concepts.Mode.enumerable Concepts.Cardinality.Finite;
         {Concepts.Mode.bound= Concepts.Mode.attributes_of_map description; affords= Decides} ]
 
-  let modes tx relation = schema_of tx relation |> Result.map modes_of
-
   class relation storage value description =
     object (self)
       inherit Lifecycle.null
diff --git a/lib/kernel/SubstantialRelation.mli b/lib/kernel/SubstantialRelation.mli
index 73a06c7..a36c802 100644
--- a/lib/kernel/SubstantialRelation.mli
+++ b/lib/kernel/SubstantialRelation.mli
@@ -53,12 +53,4 @@ module Make (S : Abstract.Storage.STORAGE) : sig
     (Protocols.Schematics.relation_description, Concepts.Condition.condition) result
 
   val enumerate : S.connection -> t -> (Protocols.Handle.t, Concepts.Condition.condition) result
-
-  val generate :
-    S.connection ->
-    t ->
-    Protocols.Generative.binding ->
-    (Protocols.Handle.t, Concepts.Condition.condition) result
-
-  val modes : S.transaction -> t -> (Concepts.Mode.t, Concepts.Condition.condition) result
 end