Re: [Haskell-cafe] Reifying case expressions [was: Re: On stream processing, and a new release of timeplot coming]

2011-12-26 Thread Eugene Kirpichov
2011/12/26 Gábor Lehel illiss...@gmail.com On Sun, Dec 25, 2011 at 9:19 PM, Eugene Kirpichov ekirpic...@gmail.com wrote: Hello Heinrich, Thanks, that's sure some food for thought! A few notes: * This is indeed analogous to Iteratees. I tried doing the same with Iteratees but

[Haskell-cafe] parListChunk problem

2011-12-26 Thread Burak Ekici
Hi there, I was not able to parallelize the below code by parListChunk strategy. Actually, code works fine without ant mistake in the result but no improvement in the performance handled. Threadscope demonstrates that parallelization happens after the sequential run of the program which is

[Haskell-cafe] Convert Double to Data.Fixed

2011-12-26 Thread Eugene Kirpichov
Hi cafe, How do I most efficiently convert a Double to a Data.Fixed? I'm asking because I want to convert fractional seconds to the seconds field of Data.Time.TimeOfDay, which is Pico = Data.Fixed.Fixed E12. For now the fastest thing I came up with was fromIntegral (round (sec*100)) /

Re: [Haskell-cafe] Reifying case expressions [was: Re: On stream processing, and a new release of timeplot coming]

2011-12-26 Thread Sebastian Fischer
On Sun, Dec 25, 2011 at 11:25 AM, Heinrich Apfelmus apfel...@quantentunnel.de wrote: Your StreamSummary type has a really nice interpretation: it's a reification of case expressions [on lists]. nice observation! For instance, consider the following simple function from lists to

Re: [Haskell-cafe] Reifying case expressions [was: Re: On stream processing, and a new release of timeplot coming]

2011-12-26 Thread Eugene Kirpichov
Whoa. Sebastian, you're my hero — I've been struggling with defining Arrow for ListTransformer for a substantial time without success, and here you got it, dramatically simpler than I thought it could be done (I was using explicit queues). I wonder if now this datatype of yours is isomorphic to

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Hans Aberg
On 26 Dec 2011, at 16:11, AUGER Cédric wrote: There is http://www.stixfonts.org/ For typesetting with Xe[La]TeX or Lua[La]TeX, use XITS (in the TeXLive package). (And then we'll have to deal with folks trying to use the letter, because everyone knows the Roman alphabet is the only one

[Haskell-cafe] Non-exhaustive pattern match warning (incorrect?)

2011-12-26 Thread Michael Orlitzky
I'm cleaning up some old projects, and hit this: src/Octet.hs:47:27: Warning: Pattern match(es) are non-exhaustive In a record-update construct: Patterns not matched: Octet.None But in the source, I've checked for that case: class Maskable a where apply_mask :: a - Maskbits -

Re: [Haskell-cafe] Non-exhaustive pattern match warning (incorrect?)

2011-12-26 Thread Antoine Latter
On Mon, Dec 26, 2011 at 1:21 PM, Michael Orlitzky mich...@orlitzky.com wrote: I'm cleaning up some old projects, and hit this:  src/Octet.hs:47:27:    Warning: Pattern match(es) are non-exhaustive    In a record-update construct: Patterns not matched: Octet.None But in the source, I've

Re: [Haskell-cafe] Non-exhaustive pattern match warning (incorrect?)

2011-12-26 Thread Michael Orlitzky
On 12/26/11 13:42, Antoine Latter wrote: Am I overlooking something, or did I already match Octet.None? What is your definition of the 'Octet' type? -- An Octet consists of eight bits. For our purposes, the most -- significant bit will come first. That is, b1 is in the 2^7 -- place while

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Hans Aberg
On 26 Dec 2011, at 19:29, AUGER Cédric wrote: Le Mon, 26 Dec 2011 18:20:55 +0100, Hans Aberg haber...@telia.com a écrit : On 26 Dec 2011, at 16:11, AUGER Cédric wrote: Under Xorg, XCompose might be your friend! I have a whole bunch of them for Coq programing. Having something like:

Re: [Haskell-cafe] Non-exhaustive pattern match warning (incorrect?)

2011-12-26 Thread Antoine Latter
On Mon, Dec 26, 2011 at 2:19 PM, Michael Orlitzky mich...@orlitzky.com wrote: On 12/26/11 13:42, Antoine Latter wrote: Am I overlooking something, or did I already match Octet.None? What is your definition of the 'Octet' type? -- An Octet consists of eight bits. For our purposes, the most

[Haskell-cafe] [ANNOUNCE] HaskellNet has a new maintainer

2011-12-26 Thread Jonathan Daugherty
Hi all, I recently took over maintenance duties for the HaskellNet library from its previous maintainer, Robert Wills: http://hackage.haskell.org/package/HaskellNet The codebase has been moved to GitHub: https://github.com/jtdaugherty/HaskellNet So far my focus on HaskellNet has been code

Re: [Haskell-cafe] Non-exhaustive pattern match warning (incorrect?)

2011-12-26 Thread Michael Orlitzky
On 12/26/2011 03:17 PM, Antoine Latter wrote: The error is warning you that the record update 'oct { b8 = bit }' can fail at run-time if 'oct' is None. Since it looks like you've checked for that you shouldn't have a problem, but the compiler doesn't know that. Thanks, that's what I thought

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Brandon Allbery
On Mon, Dec 26, 2011 at 12:20, Hans Aberg haber...@telia.com wrote: On 26 Dec 2011, at 16:11, AUGER Cédric wrote: But if you are under Windows, or Mac OS, I cannot tell (as well as I cannot tell if you are under a POSIX system not running xorg, such as the tty1..ttyn consoles) On OS X

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Hans Aberg
On 26 Dec 2011, at 23:03, Brandon Allbery wrote: But if you are under Windows, or Mac OS, I cannot tell (as well as I cannot tell if you are under a POSIX system not running xorg, such as the tty1..ttyn consoles) On OS X one can make ones owns key maps, like with the program on the link

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Donn Cave
Quoth Hans Aberg, ... For example, I set one entry so that typing x |- a becomes x ↦ a, the TeX \mapsto, in Unicode ↦ RIGHTWARDS ARROW FROM BAR U+21A6. It might be tedious to make a lot of entries, though, but something to start with. Something to finish me with, too. I wouldn't be

Re: [Haskell-cafe] How to get Cabal to spit out a .a library suitable for linking into C/Objective-C

2011-12-26 Thread Donn Cave
Sorry about the belated response, but this shouldn't be a problem since it isn't going to be very helpful anyway! I've managed to follow the process described on this page: http://www.haskell.org/haskellwiki/Using_Haskell_in_an_Xcode_Cocoa_project to link Haskell code to a non-Haskell main

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Hans Aberg
On 27 Dec 2011, at 01:02, Donn Cave wrote: Quoth Hans Aberg, ... For example, I set one entry so that typing x |- a becomes x ↦ a, the TeX \mapsto, in Unicode ↦ RIGHTWARDS ARROW FROM BAR U+21A6. It might be tedious to make a lot of entries, though, but something to start with.

Re: [Haskell-cafe] How hard is it to start a web startup using Haskell?

2011-12-26 Thread Haisheng Wu
Turns out that those guys doing start-up with Haskell are already expert at Haskell. Hence choosing Haskell is more straightforward. I'm thinking of using Haskell since it looks cool and beautiful. However I have little experience and will move slowly at certain begging period. This sounds not

Re: [Haskell-cafe] Reifying case expressions [was: Re: On stream processing, and a new release of timeplot coming]

2011-12-26 Thread Sebastian Fischer
2011/12/26 Eugene Kirpichov ekirpic...@gmail.com Whoa. Sebastian, you're my hero — I've been struggling with defining Arrow for ListTransformer for a substantial time without success, and here you got it, dramatically simpler than I thought it could be done (I was using explicit queues).

Re: [Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

2011-12-26 Thread Alexander Solla
2011/12/24 MigMit miguelim...@yandex.ru Отправлено с iPad 24.12.2011, в 18:50, Alexander Solla alex.so...@gmail.com написал(а): In the same way, denotational semantics adds features which do not apply to a theory of finite computation. And why exactly should we limit ourselves to some

Re: [Haskell-cafe] Reifying case expressions [was: Re: On stream processing, and a new release of timeplot coming]

2011-12-26 Thread Eugene Kirpichov
On Tue, Dec 27, 2011 at 7:23 AM, Sebastian Fischer fisc...@nii.ac.jpwrote: 2011/12/26 Eugene Kirpichov ekirpic...@gmail.com Whoa. Sebastian, you're my hero — I've been struggling with defining Arrow for ListTransformer for a substantial time without success, and here you got it, dramatically