30 lines
1.6 KiB
OCaml
30 lines
1.6 KiB
OCaml
(***********************************************************************)
|
|
(* *)
|
|
(* Objective Caml *)
|
|
(* *)
|
|
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
|
|
(* *)
|
|
(* Copyright 1996 Institut National de Recherche en Informatique et *)
|
|
(* en Automatique. All rights reserved. This file is distributed *)
|
|
(* under the terms of the Q Public License version 1.0. *)
|
|
(* *)
|
|
(***********************************************************************)
|
|
|
|
(* $Id$ *)
|
|
|
|
open Terms
|
|
open Equations
|
|
|
|
val super: term -> term -> (int list * (int * term) list) list
|
|
val super_strict: term -> term -> (int list * (int * term) list) list
|
|
val critical_pairs: term * term -> term * term -> (term * term) list
|
|
val strict_critical_pairs: term * term -> term * term -> (term * term) list
|
|
val mutual_critical_pairs: term * term -> term * term -> (term * term) list
|
|
val rename: int -> term * term -> term * term
|
|
val deletion_message: rule -> unit
|
|
val non_orientable: term * term -> unit
|
|
val partition: ('a -> bool) -> 'a list -> 'a list * 'a list
|
|
val get_rule: int -> rule list -> rule
|
|
val kb_completion: (term * term -> bool) -> int -> rule list -> (term * term) list -> int * int -> (term * term) list -> rule list
|
|
val kb_complete: (term * term -> bool) -> rule list -> rule list -> unit
|