Move inccounter function to basic module

sucl/basic.dcl

@@ -82,6 +82,9 @@ indent :: .String -> .([.String] -> .[String])
 // `Identifiers' is the list of all identifiers
 identifiers :: [String]
 
+// `Inccounter m f' increments counting function f by one at point m.
+inccounter :: a (a->b) a -> b | == a & +,one b
+
 // `Intersect xs ys' is the intersection of list `ys' with list `xs'.
 intersect :: ![elem] [elem] -> .[elem] | == elem
 

sucl/basic.icl

@@ -109,6 +109,9 @@ forget :: val -> .(![.(val,res)] -> .[(val,res)]) | == val
 forget x = filter (neq x o fst)
 neq x y = x <> y
 
+inccounter :: a (a->b) a -> b | == a & +,one b
+inccounter m f n = if (n==m) (f n+one) (f n)
+
 indent :: .String -> .([.String] -> .[String])
 indent first = map2 (+++) [first:repeat (createArray (size first) ' ')]
 

sucl/graph.icl

@@ -178,8 +178,6 @@ refcount graph roots
           where count` = inccounter var count
                 (def,(_,args)) = varcontents graph var
 
-inccounter m f n = if (n==m) (f n+1) (f n)
-
 /*
 
 Compilegraph compiles a graph from parts.