April 2010 - Haskell-Cafe

IORef memory leak
by Jim Snow 15 Oct '10

15 Oct '10

I'm having some trouble with excessive memory use in a program that uses a lot of IORefs. I was able to write a much simpler program which exhibits the same sort of behavior. It appears that "modifyIORef" and "writeIORef" leak memory; perhaps they keep a reference to the old value. I tried both ghc-6.8.3 and ghc-6.10.1. Is this a known limitation, or is this a ghc bug, or am I using IORefs in the wrong way? -jim module Main where import Data.IORef import Control.Monad -- Leaks memory leakcheck1 ior = do go 1000000000 where go 0 = return () go n = do modifyIORef ior (+1) go (n-1) -- Leaks memory leakcheck2 ior = do go 1000000000 where go 0 = return () go n = do x <- readIORef ior writeIORef ior (x+1) go (n-1) -- Runs in constant memory leakcheck3 ior = do go 1000000000 where go 0 = return () go n = do x <- readIORef ior go (n-1) main :: IO () main = do ior <- newIORef 0 leakcheck2 ior compiled with: ghc -O2 --make Leak.hs -o Leak

10 17

Re: [Haskell-cafe] iPhone/Android and Haskell [Was: Embedded funcional programming?]
by Liam O'Connor 10 Aug '10

10 Aug '10

Our best bet is to compile to ARM native code and then use the NDK to talk to the Java APIs. Cheers. ~Liam

8 15

ANN: scan-0.1.0.3, a Haskell style scanner
by Christian Maeder 03 Aug '10

03 Aug '10

Dear Haskell friends, I like to announce a Haskell style scanner at http://hackage.haskell.org/package/scan documented under http://projects.haskell.org/style-scanner/ It's best used in conjunction with hlint http://community.haskell.org/~ndm/hlint/ and gives many suggestions regarding the file format. Feedback is welcome. Thanks Christian (Discussions should only be posted to either haskell-cafe@ or beginners@)

5 10

Fwd: [Haskell-cafe] Bytestrings and [Char]
by Alberto G. Corona 18 Jul '10

18 Jul '10

The question can be generalized via type classes: Is there any common set of primitives encapsulated into a single type class that has instances for Strings (Data.List) ByteStrings, Data.Text, Lazy bytestrings, Arrays, vectors and wathever container that can store an boxed, unboxed, packed unpacked sequence of wathever including chars? All of them have folds, heads, tails and a lot of common functions with the same name, but since there is not a single type class, the library programmer can not abstract his code when it is possible, so the library user can chose the particular instance for his particular problem. 2010/3/23 Johann Höchtl <johann.hoechtl(a)gmail.com> On 22.03.2010 14:15, Ivan Miljenovic wrote: > >> On 23 March 2010 00:10, Johan Tibell<johan.tibell(a)gmail.com> wrote: >> >> >>> A sequence of bytes is not the same thing as a sequence of Unicode >>> code points. If you want to replace String by something more efficient >>> have a look at Data.Text. >>> >>> >> Though Data.Text still has the disadvantage of not being as nice to >> deal with as String, since you can't pattern match on it, etc. >> >> Whilst it may degrade performance, treating String as a list of >> characters rather than an array provides you with greater flexibility >> of how to deal with it. >> >> >> > But doesn't this basically mean sacrifice performance / applicability for > algorithmic beauty? Sure, pattern match comes in handy, but in the case of > strings at a high price > > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

3 3

haskell platform questions
by Warren Harris 12 Jul '10

12 Jul '10

I installed haskell platform some time ago, and now I'm wondering what version I have. How do I find out? Also, when the new one comes along on the 21st, is there a way to upgrade? Or if I must first uninstall the one I have now, how do I uninstall it? Is it recommended to periodically upgrade packages that came with the platform (cabal upgrade), or is it recommended that they be left alone to avoid dependency incompatibilities. Similar question for ghc itself -- can/should it be upgraded in the context of haskell platform? (I was hoping to try Leksah, but it dies without ghc 6.12.1. I seem to have 6.10.4.) Apologies in advance if this is all documented somewhere, but I couldn't find it on the haskell platform site/trac. BTW, I'm on Mac/ Leopard -- love the fact that it didn't take hours to build everything! Warren

9 22

ANN: ForSyDe DSL v3.1
by Seyed Hosein Attarzadeh Niaki 25 Jun '10

25 Jun '10

Dear All, A new version of the ForSyDe DSL is uploaded to the Hackage database. "The ForSyDe (Formal System Design) methodology has been developed with the objective to move system design to a higher level of abstraction and to bridge the abstraction gap by transformational design refinement. This library provides ForSyDe's implementation as a Haskell-embedded Domain Specific Language (DSL). For more information, please see ForSyDe's website: http://www.ict.kth.se/forsyde/." In addition to compatibility with base 4 and GHC 6.10.x, the new version provides more freedom for declaration of process functions (e.g., support for when and let blocks). BR/ Hosein Attarzadeh

1 1

ANN: parameterized-data library v0.1.4
by Seyed Hosein Attarzadeh Niaki 25 Jun '10

25 Jun '10

Dear Haskell developers, A new version of the parameterized-data library providing fixed-sized vectors (based on the type-level library) is pushed into the repository and uploaded to the Hackage database. This is only a minor update to fix the compatibility issues with base 4, GHC>=6.10 and cabal-install (not backward compatible). Bests, Hosein Attarzadeh

1 1

Haskell Weekly News?
by aditya siram 23 Jun '10

23 Jun '10

Hi all, I haven't seen a "Haskell Weekly News" in a while. Is there anything I can do to help? -deech

9 16

Help with Bird problem 3.3.3
by Peter Hilal 11 Jun '10

11 Jun '10

I'm working my way through Bird's _Introduction to Functional Programming Using Haskell_. I'd appreciate any help with problem 3.3.3, which is: "Division of natural numbers can be specified by the condition (n * m) / n = m for all positive n and all m. Construct a program for division and prove that it meets the specification." The required construction relies on the following definitions: data Nat = Zero| Succ Nat (+) :: Nat -> Nat m + Zero = m m + Succ n = Succ (m + n) (*) :: Nat -> Nat m * Zero = Zero m * Succ n = m * n + m Proceeding as Bird does in Sec. 3.2.2, where he derives the definition of "-" from the specification "(m + n) - n = m", I've so far gotten the first case, in which m matches the pattern "Zero", simply by (i) substituting Zero for m in the specification, (ii) substituting Succ n for n in the specification (solely because n is constrained to be positive), and (iii) reducing by applying the first equation of "*": Case Zero: (Succ n * Zero) / Succ n = Zero ≡ {first equation of "*"} Zero / Succ n = Zero Easy enough, and completely intuitive, since we expect Zero divided by any non-Zero finite number to be Zero. The next case, in which m matches the pattern "Succ m", is where I get stuck, and I really have no intuition about what the definition is supposed to be. My first step is to substitute "Succ m" for "m" in the given specification, and to substitute Succ n for n in the specification (for the same reason, as above, that n is constrained to be positive), and then to use the definition of "*" to reduce the equation: Case Succ m: Succ n * Succ m / Succ n = Succ m ≡ {second equation of "*"} (Succ n * m + Succ n) / Succ n = Succ m Where do I go from here? Thank you so much.

5 4

RE: [Haskell-cafe] GHC Api typechecking
by Phyx 07 Jun '10

07 Jun '10

Hi, I checked out how Hint is doing it, but unfortunately they're calling a function in the GHC api's interactive part to typecheck a single statement, much like :t in ghci, So I can't use it to typecheck whole modules. I've tried working around not being able to construct a TargetId but ran into another wall. I can't find anyway to do dependency analysis on the in-memory target, so the dependency graph would be empty which is ofcourse a big problem. Does anyone know if Leksah uses the GHC api for typechecking? And if it only gives type errors after you save a file? The code I've been trying is typeCheckStringOnly :: String -> IO (ApiResults Bool) typeCheckStringOnly contents = handleSourceError processErrors $ runGhc (Just libdir) $ do buffer <- liftIO $ stringToStringBuffer contents clock <- liftIO getClockTime dflags <- getSessionDynFlags setSessionDynFlags dflags let srcLoc = mkSrcLoc (mkFastString "internal:string") 1 1 dynFlag = defaultDynFlags state = mkPState buffer srcLoc dynFlag parsed = unP Parser.parseModule state pkgId = stringToPackageId "internal" name = mkModuleName "Unknown" mod' = mkModule pkgId name location = ModLocation Nothing "" "" summary = ModSummary mod' HsSrcFile location clock Nothing [] [] "" dynFlag Nothing (\a->setSession $ a { hsc_mod_graph = [summary] }) =<< getSession case parsed of PFailed _ _ -> return $ ApiOk False POk newstate mdata -> do let module' = ParsedModule summary mdata check <- typecheckModule module' return $ ApiOk True this fails with a ghc panic : panic! (the 'impossible' happened) (GHC version 6.12.1 for i386-unknown-mingw32): no package state yet: call GHC.setSessionDynFlags Please report this as a GHC bug: http://www.haskell.org/ghc/reportabug :( Cheers, Phyx -----Original Message----- From: Gwern Branwen [mailto:gwern0@gmail.com] Sent: Saturday, April 17, 2010 20:59 To: Phyx Subject: Re: [Haskell-cafe] GHC Api typechecking On Sat, Apr 17, 2010 at 1:49 PM, Phyx <lonetiger(a)gmail.com> wrote: > Hi all, I was wondering if someone knows how to do the following: > > > > I’m looking to typecheck a string using the GHC Api, where I run into > problems is that I need to construct a Target, but the TargetId only seem to > reference physical files. > > > > Ofcourse I can write the string to a file and typecheck that file, but I > would like to do it all in memory and avoid IO if possible. > > > > Does anyone know if this is possible? > > > > For the record I’m trying to create the target as follows > > > > createTarget :: String -> IO Target > > createTarget content = > > do clock <- getClockTime > > buffer <- stringToStringBuffer content > > return $ Target { targetId = TargetModule (mkModuleName > "string:internal") ß problem > > , targetAllowObjCode = True > > , targetContents = Just (buffer,clock) > > } > > > > typeCheckStringOnly :: String -> IO (ApiResults Bool) > > typeCheckStringOnly contents = handleSourceError processErrors $ > > runGhc (Just libdir) $ do > > dflags <- getSessionDynFlags > > setSessionDynFlags dflags > > target <- liftIO $ createTarget contents > > addTarget target > > load LoadAllTargets > > let modName = mkModuleName "string:internal" ß problem again, don’t know > how to create the dependency graph then. > > graph <- depanal [modName] True > > (\a->setSession $ a { hsc_mod_graph = graph }) =<< getSession > > value <- fmap typecheckedSource (typeCheck modName) > > return $ ApiOk True > > > > Cheers, > > Phyx Have you looked at how the Hint package does things? -- gwern

2 3