[clean up Main.hs, delete unused code.
John Meacham <john@repetae.net>**20060420013744] hunk ./Main.hs 295
-        --mprog <- barendregtProg mprog
-        --mprog <- transformProgram "typeAnalyze" False (dump FD.Pass) (typeAnalyze True) mprog
+        mprog <- barendregtProg mprog
hunk ./Main.hs 297
-        --mprog <- barendregtProg mprog
-        --mprog <- simplifyProgram sopt "SuperSimplify" False mprog
hunk ./Main.hs 351
-            --lc <- doopt mangle False stats "Float Inward..." (\stats x -> return (floatInward allRules x)) lc
hunk ./Main.hs 515
-        --es' <- createMethods dataTable (hoClassHierarchy ho) (programEsMap prog)
-        --let initMap = fromList [ (tvrIdent t, Just (EVar t)) | (t,_) <- programDs prog, not $ t `Set.member` tmap]
-        --    tmap = Set.fromList [ t | (t,_) <- es' ]
-        --let Identity es'' = annotateDs initMap (idann mempty (hoProps ho) ) letann lamann es'
hunk ./Main.hs 541
-    --prog <- barendregtProg prog
-
-    -- make sure properties and are attached everywhere
-    --progress "Annotate After prune"
-    --prog <- return $ runIdentity $ annotateProgram mempty (idann mempty (hoProps ho) ) letann lamann prog
hunk ./Main.hs 555
-    --ne <- mangle dataTable (return ()) True "Barendregt" (return . barendregt) (programE prog)
-
---    prog <- transformProgram "OccuranceAnalysis" True (return . SS.programPruneOccurance) prog
---    lc <- return $ programE prog
---    lc <- opt "SuperSimplify" cm lc
---    prog <- return $ programSetE lc prog
hunk ./Main.hs 568
---
---    let cm stats e = do
---        let sopt = mempty { SS.so_dataTable = dataTable }
---        let (stat, e') = SS.simplifyE sopt e
---        Stats.tickStat stats stat
---        return e'
---    prog <- transformProgram "OccuranceAnalysis" True (return . SS.programPruneOccurance) prog
---    lc <- return $ programE prog
---    lc <- opt "SuperSimplify no Rules" cm lc
---    prog <- return $ programSetE lc prog
---
---    prog <- barendregtProg prog
hunk ./Main.hs 780
-mangle ::
-    DataTable                -- ^ the datatable used for typechecking
-    -> Maybe IdSet           -- ^ acceptable free variables
-    -> String                -- ^ the name of the pass
-    -> Bool                  -- ^ whether to dump progress
-    -> Int                   -- ^ maximum number of passes to run. -1 for unlimited
-    -> Stats.Stats                 -- ^ the stats to add results to
-    -> (Stats.Stats -> E -> IO E)  -- ^ the modification routine
-    -> E                     -- ^ the input term
-    -> IO E                  -- ^ out it comes
-mangle dataTable fv name dumpProgress count stats action e = do
-    --when ((dumpProgress && dump FD.Progress) || dump FD.Pass) $ putErrLn $ "-- " ++ name
-    let opt 0 e = return e
-        opt n e = do
-            stats' <- Stats.new
-            e' <- mangle' fv dataTable (Stats.print "stats" stats') dumpProgress name (action stats') e
-            t <- Stats.getTicks stats'
-            case t of
-                0 -> return e'
-                _ -> do
-                    when ((dumpProgress && dump FD.Progress) || dump FD.Pass) $ Stats.print "Optimization" stats'
-                    Stats.combine stats stats'
-                    opt (n - 1) e'
-    opt count e
-