minor fix in comments

Makefile

@@ -44,7 +44,7 @@ JAVA     = java -Dfrege.javac=internal
 CP       = cp -pf
 RM       = rm -rf
 MKDIR    = mkdir -p
-TIME     = time -f "%E %Mk"       
+TIME     = time
 TIMEPROG = `which gtime || which time || false`
 FREGE    = $(TIME) $(JAVA) -Xss4m -Xmx2222m -cp $(BUILD)
 

examples/RefExample.fr

@@ -26,7 +26,7 @@ workVar n = do
     incVar ref
     incVar ref
     inc3 <- getVar ref              -- get the final value
-    ST.return (inc1, inc3)   -- make ST s (Int, Int)
+    ST.return (inc1, inc3)          -- make ST s (Int, Int)
 
 foo = workVar 42
 bar = ST.run foo -- (workVar 42)
@@ -38,4 +38,3 @@ main _ = println (ST.run foo)
 -- nogo1 = ST.run standaloneVal
 
 -- nogo2 = ST.run (incVar (newVar 0))
-

examples/Sort.fr

@@ -11,7 +11,7 @@ merge comp xss yss = case xss of
         [] -> xss                           -- wenn eine der Listen leer ist
     [] -> yss                               -- ist die andere Liste das Ergebnis
 
---- Sortiere eine Liste _xs_ gemäß Vergleichfunktion _comp_
+--- Sortiere eine Liste _xs_ gemäß Vergleichsfunktion _comp_
 
 sortBy ∷ (a→a→Ordering) → [a] → [a]    -- optionale Typdeklaration
 sortBy comp []    = []      -- eine leere Liste ist schon sortiert

examples/YearNumbers.fr

@@ -252,7 +252,7 @@ cacheCheck cache i = do
 data KI = Ende 
         | Liste {!top :: Int, !rest :: KI} -- (k-1) indexes in decreasing order, the first being the
                         -- one that is varied most often.
-                        -- Invaraint: The indexes further down in the list
+                        -- Invariant: The indexes further down in the list
                         -- are smaller than all previous ones.
 
 type KP = [Zahl]   -- can be obtained from KI by replacing indexes with primes                                                  
@@ -460,7 +460,7 @@ findhitLT !cache !k !p !q !ln ki   !fc
     with the requested size rounded up to the next multiple of 1000, 
     to keep frequent cache recomputations in check.
     
-     OTOH, we want the cache to be as samll as possible, so that it'll fit in the
+     OTOH, we want the cache to be as small as possible, so that it'll fit in the
      CPU cache. 
     -}
 data Cache = Cache {
@@ -556,4 +556,4 @@ findK k = go (Cache.new 1024) k k
                         down cache k p' q (nextR cache q t) 
             where
                 t0 = normR cache q     ((start k).rest)
-                min = kproduct cache.primes q (start k)
+                min = kproduct cache.primes q (start k)