On Sat, Aug 13, 2011 at 09:54:13PM -0700, Joel Burget wrote:
This sounds really intriguing. Since I'm temporarily not using xmonad, and
I'm sure others would like to see as well, could we get a screenshot?
Oops, how could I forget.
http://pages.cs.wisc.edu/~travitch/taffybar.jpg
I have the
LinkedIn
I'd like to add you to my professional network on LinkedIn.
- Andrew
Andrew Smith B.Sc(Hons),MBA
Founder and CEO at VTRL - Value Technology Research Ltd
Edinburgh, United Kingdom
Confirm that you know Andrew Smith B.Sc(Hons),MBA
lol. I don't know Andrew Smith. How about y'all?
On Aug 14, 2011, at 12:32 PM, Andrew Smith B.Sc(Hons),MBA wrote:
LinkedIn
I'd like to add you to my professional network on LinkedIn.
- Andrew
Andrew Smith B.Sc(Hons),MBA
Founder and CEO at VTRL - Value Technology Research Ltd
That's a clever way to build your resume. :))
Someone looking at his numerous contacts with haskell community may think
Wow, this guys is some sort of haskell guru. Better bring him in for our
stock market division.
On Sunday, August 14, 2011 01:02:42 PM Daniel Patterson wrote:
lol. I don't
On Sun, Aug 14, 2011 at 13:09, vagif.ve...@gmail.com wrote:
That's a clever way to build your resume. :))
No, just LinkedIn being stupid; the sign-up form is designed to spam your
contacts, and you actually have to take some care to avoid it.
--
brandon s allbery
Not so sure; his company's website is under construction for more than a year
and after brief google'ing I still don't understand even what kind of business
are they supposed to be in. Seems more likely that it's actually Andrew who
does the spamming.
Отправлено с iPad
14.08.2011, в 21:18,
On Sun, Aug 14, 2011 at 13:38, Yitzchak Gale g...@sefer.org wrote:
Brandon Allbery wrote:
Umm, I think the semigroups package will break everything that creates
Monoid instances anyway.
It has never broken anything for me. What do you mean?
Anything useful has to be modified to depend on
Brandon Allbery wrote:
Anything useful has to be modified to depend on SemiGroup as well to get
mconcat or its replacement; that's why you jumped the proposal to begin
with
Not at all. Types with Monoid instances need an additional
instance, a Semgroup instance, in order to be able to use
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
program using that par combinator etc, and was a bit unhappy that it
turns out to be slower than its sequential version. But firstly, I dont
fully understand how to read the runtime report produced by GHC with -s
On Sun, 2011-08-14 at 21:05 +0300, Yitzchak Gale wrote:
Brandon Allbery wrote:
Anything useful has to be modified to depend on SemiGroup as well to get
mconcat or its replacement; that's why you jumped the proposal to begin
with
Not at all. Types with Monoid instances need an
Hello Wishnu,
That is slightly odd. What CPU and operating system are you running on?
Include Kernel versions if Linux.
Cheers,
Edward
Excerpts from Wishnu Prasetya's message of Sun Aug 14 14:11:36 -0400 2011:
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
program using that par combinator etc, and was a bit unhappy that it
turns out to be slower than its sequential version. But firstly, I
dont fully
Hello Edward,
I'm using Windows 7 on Intel i7 (4 cores with hyperthreading)...
--Wish.
Hello Wishnu,
That is slightly odd. What CPU and operating system are you running on?
Include Kernel versions if Linux.
Cheers,
Edward
Excerpts from Wishnu Prasetya's message of Sun Aug 14 14:11:36 -0400
Ah, good catch. :-)
Edward
Excerpts from Iustin Pop's message of Sun Aug 14 14:25:02 -0400 2011:
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
program using that par combinator etc, and was a
On 14-8-2011 20:25, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
program using that par combinator etc, and was a bit unhappy that it
turns out to be slower than its sequential
On Sat, Aug 13, 2011 at 3:54 PM, dokondr doko...@gmail.com wrote:
Hi,
I am trying to figure out what Haskell libraries can be used to build
publish / subscribe communication between threads running both in the same
and different address spaces on the net.
For my needs any of these models
On Sun, Aug 14, 2011 at 08:32:36PM +0200, Wishnu Prasetya wrote:
On 14-8-2011 20:25, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in parallel programming with Haskell. I made a simple test
program using that par combinator etc, and was
Andrew Smith B.Sc(Hons),MBA asmith9...@gmail.com writes:
I'd like to add you to my professional network on LinkedIn.
Since LinkedIn tends to spam even more ambitiously than the other social
network sites, I have a procmail rule sending any mail from Linkedin to
/dev/null. But it doesn't work
On Sunday 14 August 2011, 21:53:21, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:32:36PM +0200, Wishnu Prasetya wrote:
On 14-8-2011 20:25, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in parallel programming with Haskell. I made a
I originally didn't have the package exporting those things.
I would be amenable to standardization without them, but I use them in about
20 packages that are built on top of semigroups, and naturals and non-empty
lists come up when talking about semigroups a lot.
Rather than having them live
On Sun, Aug 14, 2011 at 16:15, Ketil Malde ke...@malde.org wrote:
Andrew Smith B.Sc(Hons),MBA asmith9...@gmail.com writes:
I'd like to add you to my professional network on LinkedIn.
Since LinkedIn tends to spam even more ambitiously than the other social
network sites, I have a procmail
On 14-8-2011 22:17, Daniel Fischer wrote:
On Sunday 14 August 2011, 21:53:21, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:32:36PM +0200, Wishnu Prasetya wrote:
On 14-8-2011 20:25, Iustin Pop wrote:
On Sun, Aug 14, 2011 at 08:11:36PM +0200, Wishnu Prasetya wrote:
Hi guys,
I'm new in
On Sunday 14 August 2011, 22:42:13, Wishnu Prasetya wrote:
On 14-8-2011 22:17, Daniel Fischer wrote:
We don't know the times for a non-threaded run (or an -N1 run), so it
could be anything from a slowdown to a 4× speedup (but it's likely
to be a speedup by a factor 4×).
Well, the
I just read the enlightening article by Don Stewart[1], and wanted to
test this method on one of my own programs, but it seems that there some
of the attached files are missing, namely [2], [3] and [4]. Is there
anybody who knows, where I can get those files? I don't really want to
rewrite those
I mentioned this to him on Twitter a while ago. Presumably it has to
do with the fact that he's no longer at Galois.
Another unfortunate fact is that ACOVEA is at this point unmaintained,
and that is why the official homepage for it was removed. When I
emailed the author, he said he couldn't
On 13 August 2011 08:56, Tristan Ravitch travi...@cs.wisc.edu wrote:
I've wanted a slightly fancier status bar than xmobar for a while, so
I finally made one. It uses gtk2hs and dbus extensively, so if you
hate either of those things it probably isn't for you. Being written
in gtk, though,
On Sun, Aug 14, 2011 at 02:45:24PM -0700, Alexander Dunlap wrote:
I apologize if I'm missing something obvious here, but when I try to
run taffybar I get
Launching custom binary /home/alex/.cache/taffybar/taffybar-linux-i386
taffybar-linux-i386: ConnectionError connectSession:
On 14-8-2011 23:05, Daniel Fischer wrote:
On Sunday 14 August 2011, 22:42:13, Wishnu Prasetya wrote:
On 14-8-2011 22:17, Daniel Fischer wrote:
We don't know the times for a non-threaded run (or an -N1 run), so it
could be anything from a slowdown to a 4× speedup (but it's likely
to be a
Hello Alexey,
sorry for my slow response.
On Thu, Aug 4, 2011 at 7:10 AM, Alexey Khudyakov
alexey.sklad...@gmail.comwrote:
On 02.08.2011 08:16, Sebastian Fischer wrote:
Data.Foldable also provides the monoidal fold function foldMap. It is
left unspecified whether the elements are
29 matches
Mail list logo
