[TODO added, maybe antiunification can be implemented shorter?
martin.hofmann@uni-bamberg.de**20090629064836] hunk ./src/Syntax/Expressions.hs 208
-    subterms (TWildE _ _)                        = []
+    subterms (TWildE _ _)                       = []
hunk ./src/Syntax/Expressions.hs 424
+-- TODO: should rewrite antiunification usinf root and subterms from Terms 
+-- instead of collectSubtermsTE. need to crefully check!!!
+--    (mapM aunify) . transpose . (map subterms) l >>= return . (root . head $ l)
hunk ./src/Syntax/Expressions.hs 501
-                -- here we have to check if we there is a DummyExp in there
-                -- If so, all expressions we antiunified were sections, so put
-                -- Nothing back at place
---                let fstai' = if fstai == dummy then Nothing else Just fstai
---                let thrai' = if thrai == dummy then Nothing else Just thrai
hunk ./src/Syntax/Expressions.hs 552
-{-|
-   A dummy data type to model antiunification of InfixE (see below). This is not 
-   very nice, but I have no clue how to do it in a more elegant way.
--}
-data DummyTExp = DummyTExp  
-dummy = TConE 'DummyExp (ConT ''DummyExp)
+--{-|
+--   A dummy data type to model antiunification of InfixE (see below). This is not 
+--   very nice, but I have no clue how to do it in a more elegant way.
+---}
+--data DummyTExp = DummyTExp  
+--dummy = TConE 'DummyExp (ConT ''DummyExp)
hunk ./src/Syntax/Expressions.hs 563
-   data constructor.
+   data constructor.   
hunk ./src/Syntax/Expressions.hs 565
+-- TODO:  should rewrite antiunification using root and subterms from Terms 
+-- instead of collectSubtermsTE. need to carefully check (*)!!!
hunk ./src/Syntax/Expressions.hs 569
+  -- (*)  (allSame l) >> (return $ transpose . (map subterms) $ l )
hunk ./src/Syntax/Expressions.hs 571
+  -- (*) allSame (x:xs) = foldM_ (\a b -> checkSame a b >> return a) x xs
hunk ./src/Syntax/Expressions.hs 576
---        
+--    
+            
+ 