- Haskell-Cafe - Haskell.org

Type introduction illustrated for casual haskellers
by Takenobu Tani 30 Jan '16

30 Jan '16

Dear Haskellers, I'm enjoying Haskell. After FTP(Foldable/Traversable in Prelude proposal), newcomers encounter Foldable signatures in their early stage. So I drew a few simple illustrations about a type introduction for newcomers/casual haskellers. Type introduction illustrated for casual haskellers http://takenobu-hs.github.io/downloads/type_introduction_illustrated.pdf https://github.com/takenobu-hs/type-introduction-illustrated If I have misunderstood, please teach me. I'll correct them. Thank you =), Takenobu

1 0

[ANN] Aivika: Branching Discrete Event Simulation in Haskell
by David Sorokin 29 Jan '16

29 Jan '16

Hi Cafe, I’m glad to announce the release of three my simulation libraries [1, 2, 3]. I would like to tell more about the third library especially. The aivika-brances package [3] is new. It allows creating branches to run nested simulations within simulation so that the source simulation remains intact. It allows us to forecast the behavior looking into the future of the model. There is a similar method in the financial modeling, when estimating the option instrument. We build a tree of future possible changes to estimate the present value. The present depends on the future. My library allows building the same tree of nested simulations. At the same time, this is a general purpose discrete event simulation library with such things as random streams of orders (transacts), limited resources, queues, discontinuous processes, the global event queue, event-based activities and so on. I think that we can create very sophisticated simulation models with elements of prediction and forecasting. Probably, the library can be useful for financial modeling. Initially, a few years ago I created the aivika simulation package [1] trying to repeat what other simulation libraries and software vendors provided in the field. Then an year or two ago I generalized my simulation library and created package aivika-transformers [2] with wide use of monad transformers and type families. I actually had plans to use that second package for the distributed and parallel discrete event simulation, but the package was so general that I could use it for what I would call a «branching discrete event simulation». Today I finished my third package aivika-branches, which is a very small additional package that introduces a new computation and a couple of new functions, where the main function is as follows: futureEvent :: Double -> Event BrIO a -> Event BrIO a It creates a new independent branch of the current simulation and then returns the result of the specified event-based computation in the desired time point, leaving the current computation intact. All pending events will be processed in the derived branch as if it were the current simulation. The very important thing is that the futureEvent function is relatively cheap. It was possible thanks to wide using the functional programming approach in my libraries. We can clone the simulation world as many times as we need for running nested simulations within simulation and it works. Frankly speaking, I don’t know of other general purpose simulation libraries that would offer the same functionality. I’m looking forward to hearing of your comments. Especially, I would be interested to participate in the projects related to simulation and modeling. I think that Haskell allows doing fantastic things here! Best regards, David Sorokin [1] http://hackage.haskell.org/package/aivika [2] http://hackage.haskell.org/package/aivika-transformers [3] http://hackage.haskell.org/package/aivika-branches

1 0

Re: [Haskell-cafe] FICS client in Haskell
by Tilmann 29 Jan '16

29 Jan '16

Hi Tony, thank you for having a look! I haven't given putting it on hackage much thought yet. But I would certainly do it if it's helping someone. Macbeth probably runs on other platforms as well. It's just that I developed it with OSX in mind (I was using babaschess on windows before) and provide an OSX binary only. Am 29.01.16 um 03:35 schrieb Tony Morris: > Hi Tilmann, > I'll give it a crack, though I haven't used FICS in a while. > > Couple of questions: > * have you put it on hackage? > * is it specific to Mac OSX? (if so, why?) > > > On 29/01/16 02:37, Tilmann wrote: >> Hi, >> I've been working on a FICS (Free Internet Chess Server) Client for a >> bit over a year now and it is finally in a presentable state. It would >> be great if you would like to have a look at the source code and let me >> know what you think! >> >> When I started with this project I was just starting to learn Haskell >> and I would like to know if the code is accessible/readable/idiomatic, >> if the overall organization seems reasonable as well or if you might >> have any other suggestion about what I could improve. (ie: I haven't >> decided on what logging framework to use.) >> >> The code is on github: https://github.com/tgass/macbeth >> >> I thank you all very much in advance! >> Tilmann >> >> >> >> https://github.com/tgass/macbeth/blob/master/src/Macbeth/Fics/FicsConnectio… >> >> Opens a telnet connection to freechess.org. Using conduit and attoparsec >> messages from the server are parsed to FicsMessages and put into a Chan. >> >> https://github.com/tgass/macbeth/blob/master/src/Macbeth/Fics/FicsMessage.hs >> >> The domain model >> >> The UI is using wx widgets (wxHaskell). Each wx-frame gets a copy of >> Chan FicsMessage and updates the UI when new Messages are available, ie >> here: >> https://github.com/tgass/macbeth/blob/master/src/Macbeth/Wx/ToolBox.hs >> https://github.com/tgass/macbeth/blob/master/src/Macbeth/Wx/Game.hs >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe(a)haskell.org >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

1 0

Re: [Haskell-cafe] Hide the data constructor for type family instance
by David Sorokin 29 Jan '16

29 Jan '16

Hi Imants, I fogot to add that the mentioned data constructor becomes visible in the haddoc section Instances for the exported BarIO monad. I would like to see that there is such an instance but without details about data constructor. Probably, the issue is more related to that how the BarIO type is shown in the documenation. On level of the module, where the QueueStrategy instance is defined, I can regulate the export list somehow. Thanks David 29.01.2016 1:22 пользователь "Imants Cekusins" <imantc(a)gmail.com> написал: Hello David, > FCFSQueue data constructor is visible together with all its contents > I would like it would be hidden completely Did you try to export all public symbols but not the constructor? _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe

1 0

Hide the data constructor for type family instance
by David Sorokin 28 Jan '16

28 Jan '16

Hi Cafe, When instantiating a type class with type family, I see that haddock shows the data constructor for the type family as visible. This is what I would like to avoid. I would like to hide the details of the data constructor in the documentation. An example is stated below: -- | An implementation of the 'FCFS' queue strategy. instance QueueStrategy BrIO FCFS where -- | A queue used by the 'FCFS' strategy. newtype StrategyQueue BrIO FCFS a = FCFSQueue (LL.DoubleLinkedList BrIO a) newStrategyQueue s = fmap FCFSQueue LL.newList strategyQueueNull (FCFSQueue q) = LL.listNull q Here the FCFSQueue data constructor is visible together with all its contents in the documentation! I would like it would be hidden completely. At least, I would like to hide the contents. Is it possible to do? Thanks, David

2 1

How does -N allot cores?
by Hong Yang 28 Jan '16

28 Jan '16

Hi Cafe, On an 1P system, there are 8 cores. Does -N8 send one thread to each core no matter how loaded each core is? Assuming 6 cores are busy, will -N8 send threads only to the two idle cores? If -N8 sends threads to eight cores no matter what, is there any function that detects number of idle (or usage less than certain percentage) cores? Suppose a 4P system has 32 cores (4 processors with each processor having 8 cores). Assuming the whole system is idle, how will -N32 work? Thanks, Hong

2 1

FICS client in Haskell
by Tilmann 28 Jan '16

28 Jan '16

Hi, I've been working on a FICS (Free Internet Chess Server) Client for a bit over a year now and it is finally in a presentable state. It would be great if you would like to have a look at the source code and let me know what you think! When I started with this project I was just starting to learn Haskell and I would like to know if the code is accessible/readable/idiomatic, if the overall organization seems reasonable as well or if you might have any other suggestion about what I could improve. (ie: I haven't decided on what logging framework to use.) The code is on github: https://github.com/tgass/macbeth I thank you all very much in advance! Tilmann https://github.com/tgass/macbeth/blob/master/src/Macbeth/Fics/FicsConnectio… Opens a telnet connection to freechess.org. Using conduit and attoparsec messages from the server are parsed to FicsMessages and put into a Chan. https://github.com/tgass/macbeth/blob/master/src/Macbeth/Fics/FicsMessage.hs The domain model The UI is using wx widgets (wxHaskell). Each wx-frame gets a copy of Chan FicsMessage and updates the UI when new Messages are available, ie here: https://github.com/tgass/macbeth/blob/master/src/Macbeth/Wx/ToolBox.hs https://github.com/tgass/macbeth/blob/master/src/Macbeth/Wx/Game.hs

1 0

When are MVars better than STM?
by Thomas Koster 28 Jan '16

28 Jan '16

Hi friends, Using Criterion, I have been running benchmarks to measure the relative performance of STM and MVars for some simple transactions that I expect will be typical in my application. I am using GHC 7.10.2 and libraries as at Stackage LTS 3.2. I have found that STM is faster than MVars in all my benchmarks, without exception. This seems to go against accepted wisdom [1][2][3]. I have not included my source code here to save space, but if you suspect that I am using MVars incorrectly, just say so and I will post my source code separately. I have two questions: 1. When are MVars faster than STM? If the answer is "never", then when are MVars "better" than STM? (Choose your own definition of "better".) 2. When given two capabilities (+RTS -N2), MVars are suddenly an order of magnitude slower than with just one capability. Why? For those who want details: My benchmark forks four Haskell threads. Each thread repeats a transaction that increments a shared counter many, many times. These transactions must be serialized. The counter is therefore highly contended. One version uses an MVar to store the counter in the obvious way. The other version uses a TVar instead. By the way, simply using "atomic-primops" to increment the counter won't do because the increment operation is actually a mock substitute for a more complex operation. I use the counter for my benchmarks because the real operation needs much more memory and I don't want the additional, unpredictable GC cost to affect my measurements. Typical measurements are: 1 capability, using MVar: 37.30 ms 1 capability, using TVar: 24.88 ms 2 capabilities, using MVar: 1.564 s 2 capabilities, using TVar: 80.09 ms 4 capabilities, using MVar: 2.890 s 4 capabilities, using TVar: 207.8 ms Notice that the MVar version suddenly slows by an order of magnitude when run with more than one capability. Why is this so? (This is question 2.) Despite the absolute time elapsed, I realize that the CPU usage characteristics of the two versions are also quite different. I realize that the MVar version interlocks the four threads so that only one capability is ever busy at a time, irrespective of the number of capabilities available, whereas the STM version allows up to four capabilities to be busy at once. However, I believe that the additional parallel transactions in the STM version would be mostly wasted, destined to be retried. Unless I am mistaken, this assumption appears to be consistent with the observation that the STM version with -N1 is the fastest of all. Despite all this wasted work by the thundering herd, the total CPU time (i.e. my power bill) for the STM version is still less than for the MVar version, because the MVar version so dramatically slow. Paradoxically, MVars seem to be the wrong tool for this job. So when are MVars faster than STM? (This is question 1.) [1] https://stackoverflow.com/questions/15439966/when-why-use-an-mvar-over-a-tv… [2] https://www.reddit.com/r/haskell/comments/39ef3y/ioref_vs_mvar_vs_tvar_vs_t… [3] https://mail.haskell.org/pipermail/haskell-cafe/2014-January/112158.html Thanks, Thomas Koster

5 9

Hackage hoq?
by Vasili I. Galchin 27 Jan '16

27 Jan '16

Hello, I successfully built hoq. When I run th hoq executable, I get ">" prompts but am not sure what to do. I read some of the code and I tried putting .hoq on the command line, That didn't work. Has anyone tried hoq?? Vasily

1 0

[Ann] A new, fun, easy book/tute on Haskell
by Julian Leviston 27 Jan '16

27 Jan '16

[Ann] A new, fun, easy book/tute on Haskell http://www.happylearnhaskelltutorial.com Just released this two days ago, roughly. We've released 7 out of 20 sections on the site so far, and the book is up on leanpub ($8 or $4 - $20 set your own price), at about 95% done. We don't want to put it to 100% until we've had at least 20 or more technical people read it and give us feedback, and until we've done a thorough revision for corrections. We felt like there's a need for an updated education resource that's both fun and for super beginners who have never programmed before. Essentially a slightly less drawing-focussed and slightly more technically advanced version of the 1980's Usborne Computer Guides http://www.usborne.com/catalogue/feature-page/computer-and-coding-books.aspx something that appeals to people who are more visually focussed as we are. Our plan is to keep expanding it into more volumes if there's enough interest and paid support. We're also very interested in hearing critical criticism and or praise! :) Here is a rough breakdown of our take on approaching education: 1. Tackling reading first, then slowly introducing writing when enough examples have been seen to increase confidence, because reading & writing are separate skills 2. Many small, fun examples for each thing to keep interest high: fun examples helps with motivation 3. Gradual, partial introduction of topics, in context at first: graded, less to take in at once, using the writing phase to soldify understanding, will possibly add a revision phase later 4. Not so much theory introduced before the practical has been introduced (examples-first), which gives a concrete context for the theory 5. Pictures. Some of these are visual aides, which are useful as explanations: a picture tells 1000 words, so they say 6. No assumption of previous programming experience. Almost every other guide available assume some programming 7. Smaller sections because completing small things gives a real sense of achievement, which increases motivation 8. Will be tackling how to deconstruct problems using both top down and bottom up approaches: most guides don't tackle this in a simple or basics-first way 9. It's free to read and online, so able to be discussed in public - some guides are, others aren't 10. Not so math focussed including "mathy jargon". We keep away from terms like catamorphism, lambda calculus, monad, until we need them, and these are/will be only introduced when appropriate amounts of concrete practical knowledge are present through repeated exposure to examples, so that it's obvious what is meant Thanks all! Julian - (of GetContented)

1 0