Hi Conal,
I wasn't able to make it to last Saturday's FARM track, but I think
there was a good chance that Paul would have demonstrated his Euterpea
music library, which includes a GUI interface (called MUI) written on
top of GLFW. I wrote its initial implementation (around 2009?) with a
monadic i
Here are some functional programming job opportunities that were posted
recently:
Senior Scala Developer for Green Building Software at Sefaira
http://functionaljobs.com/jobs/8649-senior-scala-developer-for-green-building-software-at-sefaira
Cheers,
Sean Murphy
FunctionalJobs.com
___
On 09/29/13 08:20, Edward Kmett wrote:
I don't know that it belongs in the "standard" libraries, but there
could definitely be a package for something similar.
ConstraintKinds are a pretty hefty extension to throw at it, and the
signature written there prevents it from being used on ByteString
Besides just partition balance, the ordering of the resulting partitions is
important. For example, the most efficient way to partition a list is by
taking an every-other-n approach, whereas the most efficient way to
partition a vector is by using a slice. (This, BTW, might be a good
alternative
On Mon, 23 Sep 2013 15:32:35 +0200 Miro Karpis
wrote:
> Thanks for that. I checked forkProcess - which is packed in POSIX
> module. I'm building under windows. Do I need to go via cygwin, is
> there some other way for creating new OS process?
Windows doesn't support fork(), you'll need to either
Thanks Edward. Good point about Brent's 'split' package. That would be a
really nice place to put the class. But it doesn't currently depend on
containers or vector so I suppose the other instances would need to go
somewhere else. (Assuming containers only exported monomorphic versions.)
Maybe
Thanks, that's interesting to know (re: Fortress).
Interestingly, in my Fortress days we looked at both using a split-like
> interface and at a more foldMap / reduce - like interface, and it seemed
> like the latter worked better – it requires a lot less boilerplate for
> controlling recursion, an
On Sun, Sep 29, 2013 at 1:40 PM, Henning Thielemann <
lemm...@henning-thielemann.de> wrote:
>
> In Richard Bird's "Functional Pearls in Algorithm Design" there is chapter
> 10 "Removing duplicates" which is about a fast and sorting variant of
> 'nub'. After reading the introduction of the chapter
On Sun, 29 Sep 2013 21:40:28 +0100, Henning Thielemann
wrote:
In Richard Bird's "Functional Pearls in Algorithm Design" there is
chapter 10 "Removing duplicates" which is about a fast and sorting
variant of 'nub'. After reading the introduction of the chapter I
answered mentally "Set.t
In Richard Bird's "Functional Pearls in Algorithm Design" there is chapter
10 "Removing duplicates" which is about a fast and sorting variant of
'nub'. After reading the introduction of the chapter I answered mentally
"Set.toAscList . Set.fromList - next chapter please". However after the
int
Noam Lewis?
https://github.com/sinelaw
On 28 September 2013 21:48, Arjun Comar wrote:
> Ahh, I misunderstood then. Who is currently maintaining the HOpenCV
> package on Hackage?
>
>
> On Sat, Sep 28, 2013 at 3:45 PM, Anthony Cowley wrote:
>
>> To be clear, I am not the maintainer of HOpenCV.
On Sat, Sep 28, 2013 at 1:09 PM, Ryan Newton wrote:
> Hi all,
>
> We all know and love Data.Foldable and are familiar with left folds and
> right folds. But what you want in a parallel program is a balanced fold
> over a tree. Fortunately, many of our datatypes (Sets, Maps) actually ARE
> balan
I don't know that it belongs in the "standard" libraries, but there could
definitely be a package for something similar.
ConstraintKinds are a pretty hefty extension to throw at it, and the
signature written there prevents it from being used on ByteString, Text,
etc.
This can be implemented with
Hi Ryan,
> -Original message-
> From: Ryan Newton
> Sent: 29 Sep 2013, 04:21
>
>
>
> *class Partitionable t where*
> * partition :: t -> Maybe (t,t)*
>
>
>
> So what I really want is for the *containers package to please get some
> kind of Partitionable instances! * Johan & others, I
On 27 September 2013 21:51, Thiago Negri wrote:
> Stop lifting, start using shinny operators like this one:
>
> (^$) :: Monad m => m a -> (a -> b -> c) -> m b -> m c
> (^$) = flip liftM2
Note that something like this is already provided by the
InfixApplicative library:
http://hackage.has
Does anyone recognise these typeclasses:
import Data.Profunctor (Profunctor)
import Data.Functor.Contravariant (Contravariant)
class Profunctor p => ProductProfunctor p where
empty :: p () ()
(***!) :: p a b -> p a' b' -> p (a, a') (b, b')
class Contravariant f =>
I'd think
partition :: t -> Either t (t, t)
might be more suited then...
Nicolas
On Sep 29, 2013 1:21 AM, "Ryan Newton" wrote:
>
>
> On Sun, Sep 29, 2013 at 3:31 AM, Mike Izbicki wrote:
>
>> I've got a Partitionable class that I've been using for this purpose:
>>
>> https://github.com/mikeiz
On Sun, Sep 29, 2013 at 3:31 AM, Mike Izbicki wrote:
> I've got a Partitionable class that I've been using for this purpose:
>
> https://github.com/mikeizbicki/ConstraintKinds/blob/master/src/Control/ConstraintKinds/Partitionable.hs
>
Mike -- Neat, that's a cool library!
Edward -- ideally, w
I've got a Partitionable class that I've been using for this purpose:
https://github.com/mikeizbicki/ConstraintKinds/blob/master/src/Control/ConstraintKinds/Partitionable.hs
The function called "parallel" in the HLearn library will automatically
parallelize any homomorphism from a Partionable to
19 matches
Mail list logo
