--- a/src/Provers/order.ML Wed Mar 04 10:43:39 2009 +0100
+++ b/src/Provers/order.ML Wed Mar 04 10:45:52 2009 +0100
@@ -639,7 +639,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
@@ -677,7 +677,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 (op aconv) g u)
in
@@ -727,7 +727,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 (op =) g u)
in descendents end