using fully qualified module names in Haskell source, which seems to be required by GHC 7.0.4 (also cf. 0fd9ab902b5a)
authorbulwahn
Sat, 04 Feb 2012 07:40:02 +0100
changeset 472362520cd337056
parent 47235 30e9720cc0b9
child 47237 d4754183ccce
using fully qualified module names in Haskell source, which seems to be required by GHC 7.0.4 (also cf. 0fd9ab902b5a)
src/HOL/Tools/Quickcheck/PNF_Narrowing_Engine.hs
     1.1 --- a/src/HOL/Tools/Quickcheck/PNF_Narrowing_Engine.hs	Fri Feb 03 18:00:55 2012 +0100
     1.2 +++ b/src/HOL/Tools/Quickcheck/PNF_Narrowing_Engine.hs	Sat Feb 04 07:40:02 2012 +0100
     1.3 @@ -3,11 +3,12 @@
     1.4  -}
     1.5  module Narrowing_Engine where
     1.6  
     1.7 -import Monad
     1.8 +import Control.Monad
     1.9  import Control.Exception
    1.10 +import System.IO
    1.11  import System.Exit
    1.12 -import Maybe
    1.13 -import List (partition, findIndex)
    1.14 +import Data.Maybe
    1.15 +import Data.List (partition, findIndex)
    1.16  import qualified Generated_Code
    1.17  
    1.18  
    1.19 @@ -35,7 +36,7 @@
    1.20      termListOf' i [] = []
    1.21      termListOf' i (e : es) =
    1.22        let 
    1.23 -        (ts, rs) = List.partition (\e -> head (posOf e) == i) (e : es)
    1.24 +        (ts, rs) = Data.List.partition (\e -> head (posOf e) == i) (e : es)
    1.25          t = termOf (pos ++ [i]) (map tailPosEdge ts)
    1.26        in
    1.27          (t : termListOf' (i + 1) rs)