- Haskell-Cafe - Haskell.org

ANN: Netwire 2.0.0
by Ertugrul Soeylemez 14 Nov '11

14 Nov '11

Hello everybody, it's finally done. I have just released Netwire 2.0.0, which is a complete rewrite from scratch. It has been generalized to arbitrary automata with inhibition, so FRP is now just a special use case. First of all the top module is now: import Control.Wire Wire is now an arrow transformer instead of an arrow-to-monad transformer and the inhibition type is polymorphic instead of the hard-coded SomeException type: Wire e (>~) a b Wire represents the following underlying type: a >~ (Either e b, Wire e (>~) a b) Inhibition uses any monoid 'e'. To get the old behaviour, you can use Last SomeException as 'e'. One significant change is that all features which were builtin in Netwire 1 are now addons, including even time and random number generation. These addons are available in the form of type classes (Control.Wire.Classes) for the underlying arrow, including for example: * ArrowIO, * ArrowRandom, * ArrowTime. Also there are no explicit sessions anymore. The current state of a wire is simply the wire itself. Everything else is captured by the underlying arrow (>~), which you can construct the way you like. There is no hard-coded WireState anymore. To get going really fast, just use the following type: type SimpleWire = Wire () (Kleisli IO) with the testWire function. You can find a small demo here: <http://hpaste.org/54025> There are instances for all addon classes for Kleisli IO, so you can write your first application very quickly. For more serious applications, you would usually write or compose your own underlying arrow or even leave it polymorphic. Please don't hesitate to give me feedback. Greets, Ertugrul -- nightmare = unsafePerformIO (getWrongWife >>= sex) http://ertes.de/

2 3

Do type classes have a partial order?
by Patrick Browne 14 Nov '11

14 Nov '11

2 1

Re: [Haskell-cafe] German names for kinds and sorts
by John Lato 14 Nov '11

14 Nov '11

> From: Jerzy Karczmarczuk <jerzy.karczmarczuk(a)unicaen.fr> > > So, even more seriously, I propose to use more often Latin and Greek. Jerzy's arguments make a lot of sense to me, but why not use an index-based notation? T0 = Type T1 = Kind T2 = Sort etc. this seems easier to me than an arbitrary hierarchy, particularly as you go higher up the structure. John Lato

1 0

Identifying thunks from GHC heap profiles
by Tristan Ravitch 14 Nov '11

14 Nov '11

I am trying to debug a stack overflow that seems to be caused by a large chain of thunks being evaluated all at once. I have some profiles generated using +RTS -hd -RTS that show some promising candidates, but they have generated names like Module.sat_s9et, Module.sat_s9jk, etc Is there any convenient way to map these generated names back to something recognizable in the source? I tried using +RTS -hc -hdsat_s9et -RTS to filter SCCs as suggested in http://hackage.haskell.org/trac/ghc/ticket/1639, but the resulting profile is always empty. I also tried to use -fext-core and -ddump-simpl to dump some intermediate representations but none of the thunk names seem to appear in those outputs.

2 1

German names for kinds and sorts
by Robert Clausecker 14 Nov '11

14 Nov '11

Hi all! I want to write my Facharbeit (kind of an essay you have to write on a specific topic you can choose yourself for highschool graduation) about the type-system of Haskell. It is required in our school to write this document in German language. Most time, it is not really difficult to find an appropriate term for concepts of Haskell, like types (Typen) or type classes (Typklassen). But I really don't know how to call kinds and sorts in German. Any ideas? Yours, Robert Clausecker

10 10

ANNOUNCE: iteratee-compress 0.3.0.0
by Maciej Marcin Piechotka 14 Nov '11

14 Nov '11

Iteratee-compress provides compressing and decompressing enumerators including flushing (using John Lato's implementation). Currently only gzip and bzip is provided but LZMA is planned. Changes from previous version: - Move API from enumerator to enumeratee Next goals: - LZMA support - Generic interface for flushing To think about: - Should inner iteratee be able to request flushing Regards

1 0

Getting started on Mac OSX
by hstenstrom 12 Nov '11

12 Nov '11

I have a book on Haskell, and I've downloaded and installed Haskell Platform for Mac OS X. What do I do now? XCode is a requirement, and I have it, but I don't know how to run it. To begin with, I want to test small examples from the book, using ghc or ghci. I have read file:///Library/Haskell/doc/start.html. - Where is the software I've just installed? - How is ghci started? Or the "platform", whatever that is? Many thanks if you can help me! Helge -- View this message in context: http://haskell.1045720.n5.nabble.com/Getting-started-on-Mac-OSX-tp4983597p4… Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

3 4

Strange GC timings
by Artyom Kazak 12 Nov '11

12 Nov '11

Hello! The following program executes 1.5 seconds on my computer: -----------------------CODE BEGIN------------------------- module Main where import Data.Array.IArray main = print (answers ! 1000000) nextAns :: (Int, Int, Float) -> (Int, Int, Float) nextAns (a, n, r) = if r2 > 1 then (a+1, n+2, r2) else (a+1, n+3, r3) where a' = fromIntegral a n' = fromIntegral n r2 = r * (a'/(a'+1))**n' * (n'+1)*(n'+2)/(a'+1)^2 r3 = r2 * (n'+3) / (a'+1) answers :: Array Int Int answers = listArray (1, 1000000) (map snd3 $ iterate nextAns (1, 2, 2)) where snd3 (a, b, c) = b ------------------------CODE END-------------------------- From these 1.5 seconds, 1 second is spent on doing GC. If I run it with "-A200M", it executes for only 0.5 seconds (total). Which is more interesting, when I use UArray instead of Array, it spends only 0.02 seconds in GC, but total running time is still 1.5 seconds. Why are... these things?

2 1

Label macro expansion bug In HList.
by aditya siram 12 Nov '11

12 Nov '11

Hi all, I am exploring OOHaskell and ran into some compilation issues with some of the samples. I hope this is the right place to report it. For example "OCamlTutorial.hs" generates the following error: ../samples/OCamlTutorial.hs:98:3: Multiple declarations of `foo' Declared at: ../samples/OCamlTutorial.hs:54:1 ../samples/OCamlTutorial.hs:98:3 Failed, modules loaded: OOHaskell, Dynamic, Print, DeepNarrow, Nominal, New. This is happening because the "label" macro on line 98: $(label "varX") doesn't expand correctly and clashes with the "foo" function on line 54: foo f = f # field1 The "label" function is found in the Data.HList.MakeLabels module and should work this way according to the docs: > runQ (label "test") >>= putStrLn . pprint data Test deriving (Data.Typeable.Internal.Typeable) test = Data.HList.FakePrelude.proxy :: Data.HList.FakePrelude.Proxy Test But I get: data Foo_0 deriving (Data.Typeable.Internal.Typeable) foo_1 = Data.HList.FakePrelude.proxy :: Data.HList.FakePrelude.Proxy Foo_0 This still doesn't cleanly explain why "OCamlTutorial.hs" is failing since it seems to be generating unique datatypes and functions by suffixing them with a number, but it seems to point to the problem. I'm hoping someone who knows HList better might understand it better. Thanks, -deech

2 8

Data.Vector.Unboxed
by kaffeepause73 11 Nov '11

11 Nov '11

Hello, quick question about unboxed Vectors : Is it possible to create an unboxed vector of unboxed vector ? : > import qualified Data.Vector.Unboxed as V > type UnboxedNestedVextor = V.Vector (V.Vector Int) Alternatively I would have to use: > import qualified Data.Vector.Unboxed as V > import qualified Data.Vector as VB type UnboxedNestedVextor = VB.Vector (V.Vector Int) Is there a rule of thumb how much quicker Unboxed Vectors are ? Cheers Phil -- View this message in context: http://haskell.1045720.n5.nabble.com/Data-Vector-Unboxed-tp4977289p4977289.… Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

7 8