--- a/src/Provers/trancl.ML Sun Mar 01 16:48:06 2009 +0100
+++ b/src/Provers/trancl.ML Sun Mar 01 23:36:12 2009 +0100
@@ -1,8 +1,6 @@
(*
- Title: Transitivity reasoner for transitive closures of relations
- Id: $Id$
- Author: Oliver Kutter
- Copyright: TU Muenchen
+ Title: Transitivity reasoner for transitive closures of relations
+ Author: Oliver Kutter, TU Muenchen
*)
(*
@@ -335,7 +333,7 @@
(* Compute, for each adjacency list, the list with reversed edges,
and concatenate these lists. *)
- val flipped = foldr (op @) nil (map flip g)
+ val flipped = List.foldr (op @) nil (map flip g)
in assemble g flipped end
@@ -359,7 +357,7 @@
let
val _ = visited := u :: !visited
val descendents =
- foldr (fn ((v,l),ds) => if been_visited v then ds
+ List.foldr (fn ((v,l),ds) => if been_visited v then ds
else v :: dfs_visit g v @ ds)
nil (adjacent eq_comp g u)
in descendents end