Hi Atze. I'm glad to hear that some work is going into wxHaskell. Do you
know about the issue that arose roughly 7-8 years ago that prevented
opening more than one top-level window per process? It had to do with a
change to initialization techniques, and made wxHaskell no longer useful
with GHCi.
Hi Paul. Is there a way to use GLFW with GUI elements other than OpenGL
display windows, e.g., text boxes and sliders? -- Conal
On Tue, Oct 1, 2013 at 11:23 PM, Paul Liu nine...@gmail.com wrote:
Thanks. I've just built GHC HEAD on Mac OS X Lion, and tested by
installing libraries with
On Wed, Oct 2, 2013 at 4:17 PM, Tom Ellis
tom-lists-haskell-cafe-2...@jaguarpaw.co.uk wrote:
What's the benefit of this requirement, as opposed to, for example
False = _ = True
I was trying to cover for void types, where the only sensible definitions
are
instance Eq Void where
On Wed, Oct 2, 2013 at 6:57 PM, Stijn van Drongelen rhym...@gmail.comwrote:
On Wed, Oct 2, 2013 at 5:36 PM, Roman Cheplyaka r...@ro-che.info wrote:
* Stijn van Drongelen rhym...@gmail.com [2013-10-02 15:46:42+0200]
I do think something has to be done to have an Eq and Ord with more
strict
Ryan Newton rrnew...@gmail.com writes:
Hi all,
I'm pleased to announce the release of our new parallel-programming
library, LVish:
hackage.haskell.org/package/lvish
It provides a Par monad similar to the monad-par package, but generalizes
the model to include data-structures other
On Wed, Oct 2, 2013 at 5:18 AM, Tom Ellis
tom-lists-haskell-cafe-2...@jaguarpaw.co.uk wrote:
Are there examples where application programmers would like there so be
some
f, a and b such that a == b but f a /= f b (efficiency concerns aside)? I
can't think of any obvious ones.
Yes, and we
So i think we can conclude the following
1) things are not perfect currently. But it requires some huge type class
changes to have a better story
2) certain types of data types will need to be newtyped to have instances
that play nice with Ryans concurrency work. Thats ok. Theres often good
Great to hear that we're getting some payoff for the switch to dynamic
linking in GHCi. Thanks for testing!
Cheers
Simon
On 02/10/2013 07:23, Paul Liu wrote:
Thanks. I've just built GHC HEAD on Mac OS X Lion, and tested by
installing libraries with --enable-shared and loading a GLFW program
that may or may not be a bug on the hackage server side,
just brought it to duncan's attention and put a ticket for it on trac
https://github.com/haskell/hackage-server/issues/119
On Wed, Oct 2, 2013 at 1:05 PM, Ben Gamari bgamari.f...@gmail.com wrote:
Ryan Newton rrnew...@gmail.com writes:
i mean github
On Wed, Oct 2, 2013 at 3:53 PM, Carter Schonwald carter.schonw...@gmail.com
wrote:
that may or may not be a bug on the hackage server side,
just brought it to duncan's attention and put a ticket for it on trac
https://github.com/haskell/hackage-server/issues/119
On Wed,
No. GLFW does not give you any UI elements, just basic windowing and
input handling.
Euterpea has a UI layer on top of GLFW that provides text boxes and
sliders, etc, entirely written in Haskell.
On Wed, Oct 2, 2013 at 8:40 AM, Conal Elliott co...@conal.net wrote:
Hi Paul. Is there a way to use
Newclasses are not a new vision of classes!
Not at all!
Newclasses could elegant solve several instance problems!
1) we want to have partly applied instances, like Parent2Child: Parent a
= Child a
like
instance Applicative m = Monad m where
return = pure
Hi!
Your first two cases will be fixed in 7.10, as Applicative finally becomes
a superclass of Monad. I haven't really looked at your third case, so I
can't comment on that. Your fourth case is something I'd really like to see
solved properly (*together* with a better record system), but as you
Interesting. How are the aesthetics? Can you point me to screen shots?
It'd be a lot of work, but one cool project would be to create *beautiful*
GUI elements using OpenGL programmable shaders. Given the speed of GPUs, we
could afford to put a lot into visual details.
A complementary project is
Hello everybody!
I released the third beta of Nomyx http://www.nomyx.net, the only game
where You can change the rules!
The second beta was a success.
Great players (byorgey, nomeata, Toxaris...) proposed amazing rules,
effectively building a nice universe. For example, a banking system in ecu
was
I'm pleased to make the first public announcement of the availability of
Penny, a double-entry command-line accounting system.
Penny is inspired by Ledger, an excellent program in its own right.
Ledger's websites and sales pitches are much better developed than those
for Penny, so first take a
I only managed to find some screenshots from Harley Trung's class
projects a few years ago:
https://github.com/harleyttd/keyboard-fretboard/blob/master/demo2.png
https://github.com/harleyttd/InstrVislizr/blob/master/stereo.png
It was nothing fancy, only basic widgets, single font, not
I'm wondering if anyone's run into this problem before, and if there's a
common solution.
In Yesod, we have applicative forms (based originally on formlets). These
forms are instances of Applicative, but not of Monad. Let's consider a
situation where we want to get some user input to fill out a
It's not a solution per se, but it seems to me that there's no need for the
Monad superclass constraint on MonadIO. If that were removed, we could
just have
class LiftIO t where
liftIO :: IO a - t a
and it would Just Work.
On Tue, Oct 1, 2013 at 1:58 AM, Michael Snoyman
Maybe this is needed new typeclass ApplicativeTrans?
2013/10/1 Michael Snoyman mich...@snoyman.com
I'm wondering if anyone's run into this problem before, and if there's a
common solution.
In Yesod, we have applicative forms (based originally on formlets). These
forms are instances of
What about (Compose Form IO) Blog type? Form is Applicative, IO — the same,
their composition should be Applicative as well (one good thing about
Applicatives — they really compose). Take a look at Control.Compose module.
Отправлено с iPad
01 окт. 2013 г., в 10:58, Michael Snoyman
On Tue, 1 Oct 2013 02:21:13 -0500, John Lato jwl...@gmail.com wrote:
It's not a solution per se, but it seems to me that there's no need for the
Monad superclass constraint on MonadIO. If that were removed, we could
just have
class LiftIO t where
liftIO :: IO a - t a
and it would
On Tue, Oct 01, 2013 at 09:29:00AM +0200, Niklas Haas wrote:
On Tue, 1 Oct 2013 02:21:13 -0500, John Lato jwl...@gmail.com wrote:
It's not a solution per se, but it seems to me that there's no need for the
Monad superclass constraint on MonadIO. If that were removed, we could
just have
On 10/01/2013 07:58 AM, Michael Snoyman wrote:
I'm wondering if anyone's run into this problem before, and if there's a
common solution.
In Yesod, we have applicative forms (based originally on formlets).
These forms are instances of Applicative, but not of Monad. Let's
consider a situation
On Tue, Oct 01, 2013 at 09:29:00AM +0200, Niklas Haas wrote:
On Tue, 1 Oct 2013 02:21:13 -0500, John Lato jwl...@gmail.com wrote:
It's not a solution per se, but it seems to me that there's no need for the
Monad superclass constraint on MonadIO. If that were removed, we could
just have
* Tom Ellis tom-lists-haskell-cafe-2...@jaguarpaw.co.uk [2013-10-01
09:20:23+0100]
On Tue, Oct 01, 2013 at 09:29:00AM +0200, Niklas Haas wrote:
On Tue, 1 Oct 2013 02:21:13 -0500, John Lato jwl...@gmail.com wrote:
It's not a solution per se, but it seems to me that there's no need for
From what you've said, it sounds like you can already write:
serverSide :: IO a - Form a
This seems elegant enough to me for your needs. Just encourage it as an
idiom specific to Forms.
myBlogForm = Blog $ titleForm * serverSide getCurrentTime *
contentsForm
Could you abstract
On Tue, Oct 01, 2013 at 12:11:23PM +0300, Roman Cheplyaka wrote:
Shouldn't it be an *Applicative* constraint?
class Applicative t = ApplicativeIO t where
liftIO :: IO a - t a
and require that
liftIO (pure x) = pure x
liftIO (f * x) = liftIO f * liftIO x
There is now a big white stripe in the Haskell.org's header (see the
screenshot).
Roman
attachment: haskellorg.png
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Tom Ellis wrote:
Shouldn't it be an *Applicative* constraint?
class Applicative t = ApplicativeIO t where
liftIO :: IO a - t a
and require that
liftIO (pure x) = pure x
liftIO (f * x) = liftIO f * liftIO x
Seems like ApplicativeIO makes more sense than MonadIO, which
Dan Burton wrote:
From what you've said, it sounds like you can already write:
serverSide :: IO a - Form a
This seems elegant enough to me for your needs. Just encourage it as an
idiom specific to Forms.
myBlogForm = Blog $ titleForm * serverSide getCurrentTime *
contentsForm
On Tue, Oct 01, 2013 at 03:17:40PM +0300, Yitzchak Gale wrote:
Tom Ellis wrote:
Shouldn't it be an *Applicative* constraint?
class Applicative t = ApplicativeIO t where
liftIO :: IO a - t a
and require that
liftIO (pure x) = pure x
liftIO (f * x) = liftIO f *
Hello everyone,
I’m excited to announce a brand new major version of fclabels. This library
provides first class labels that can act as bidirectional record fields.
The labels are implemented as lenses.
This new version contains some interesting new features like support for
polymorphic updates
Threepenny is now ready for public consumption, FIW.
On 23 May 2013 08:34, Vlatko Basic vlatko.ba...@gmail.com wrote:
Hi Heinrich,
Looks simple and interesting. I browsed the git, but not much docs yet.
Just examples, or have I looked at wrong places?
I see that API is still under heavy
The offending HTML is on line 93:
pbr//p
When I delete this paragraph element from the DOM, the ugly white bar goes
away.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Apparently that element is generated by the wiki software, since most pages
want the view source / history buttons above the rest of the content.
jQuery('#mw-content-text p:first').hide()
-- Dan Burton
On Tue, Oct 1, 2013 at 8:17 AM, Dan Burton danburton.em...@gmail.comwrote:
The offending
On Tue, Oct 1, 2013 at 12:15 PM, Dan Burton danburton.em...@gmail.comwrote:
From what you've said, it sounds like you can already write:
serverSide :: IO a - Form a
This seems elegant enough to me for your needs. Just encourage it as an
idiom specific to Forms.
myBlogForm = Blog $
On Tue, Oct 1, 2013 at 10:24 AM, Alexey Uimanov s9gf4...@gmail.com wrote:
Maybe this is needed new typeclass ApplicativeTrans?
There's actually no problem with defining a MonadTrans instance for
non-monads. Obviously this can't follow the laws directly (since they're
defined in terms of
In MFow there is a Monad instance for formlets that make a lot of sense.
Apart from using liftIO inside an applicative formlets
it can do it that way also:
myBlogForm = do
t - liftIO getTime
Blog $ titleForm * return t * contentsForm
Which may look contrived, but instead of using
On Mon, Sep 30, 2013 at 11:58 PM, Michael Snoyman mich...@snoyman.comwrote:
I'm wondering if anyone's run into this problem before, and if there's a
common solution.
I ran into it, asked about it on SO, and followed your advice. :)
___
Haskell-Cafe
Hi everyone,
I put together a Haskell logo decal designed to fit over the Apple logo on
a MacBook, and had a few made by macdecals.com. They came out great!
They're available here: http://www.macdecals.com/macbook-haskell . My
share of the proceeds will go to haskell.org, and macdecals.com has
Yitzchak Gale g...@sefer.org writes:
In fact, it even makes sense to define it as FunctorIO, with the only laws
being that liftIO commutes with fmap and preserves id, i.e., that it is a
natural transformation. (Those laws are also needed for ApplicativeIO and
MonadIO.)
Given that we are
Interesting. It's similar in spirit to basically a safe Coerce typeclass,
but for * - * types.
class Coerce a b where
coerce :: a - b
class Coerce1 f g where
coerce1 :: f a - g a
-- Dan Burton
On Tue, Oct 1, 2013 at 11:00 AM, John Wiegley jo...@fpcomplete.com wrote:
Hello all,
Normally, we don't worry *too* much about incorrect instances of standard
classes (Num, Eq, Ord) etc. They make the user's program wrong, but they
don't compromise the type system.
Unfortunately, with the LVish parallel programming library we do have a
situation where incorrect
Here are some examples:
-
data Foo = Bar | Baz
instance Eq Foo where
_ == _ = True
instance Ord Foo where
compare Bar Bar = EQ
compare Bar Baz = LT
compare _ _ = error I'm partial!
-
These would
I ordered mine!
Does anyone know if there is any place where I could order pre-made Haskell
t-shirt that benefits haskell.org too?
--
Kyle
On Tue, Oct 1, 2013 at 10:23 AM, Ryan Trinkle ryan.trin...@gmail.comwrote:
Hi everyone,
I put together a Haskell logo decal designed to fit over the
Bought the white one.
On Tue, Oct 1, 2013 at 5:50 PM, Kyle Hanson hanoo...@gmail.com wrote:
I ordered mine!
Does anyone know if there is any place where I could order pre-made
Haskell t-shirt that benefits haskell.org too?
--
Kyle
On Tue, Oct 1, 2013 at 10:23 AM, Ryan Trinkle
On Tue, Oct 1, 2013 at 3:50 PM, Kyle Hanson hanoo...@gmail.com wrote:
I ordered mine!
Does anyone know if there is any place where I could order pre-made
Haskell t-shirt that benefits haskell.org too?
I don't know where, but I just wanted to say thank you to both you and Ryan
and everyone
Hi all,
I'm pleased to announce the release of our new parallel-programming
library, LVish:
hackage.haskell.org/package/lvish
It provides a Par monad similar to the monad-par package, but generalizes
the model to include data-structures other than single-assignment variables
(IVars). For
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
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
Upon consideration from a package management perspective this is probably
easiest done by building a new small package to provide the functionality
you want. That way we don't haphazardly change the transitive dependencies
of a big chunk of the ecosystem and it can rest atop the various containers
On Sun, Sep 29, 2013 at 9:13 PM, Ryan Newton rrnew...@gmail.com wrote:
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
so the simple O(1) split would produce three submaps, the middle one
having only one element. This operation would not be very
parallelization-friendly.
Actually, I'm perfectly happy with that in this case!
- A decent work-stealing system can tolerate a fairly large number of
Assistant Professor Software Technology Utrecht University (1,0 fte)Job descriptionThe division Software Systems of the Department of Information and Computing Sciences is looking for an Assistant Professor for the bachelor programmes Computing Science and Information Science and the master
Oops, this email got stuck in the pipe (flaky internet):
foldMap _ Tip = mempty foldMap f (Bin _ _ v l r) = Foldable.foldMap f l
`mappend` f v `mappend` Foldable.foldMap f r
Btw, from my perspective, one problem with relying on foldMap is that it
treats the whole structure uniformly,
Edward,
The problem is that I need *something* more from the containers library to
be able to construct this as a separate library. I don't think I can use
foldMap to implement a Splittable/Partitionable instance for Data.Set,
namely because I specifically want to do O(1) work instead of any
Hi Conrad,
Great. The challenge is not specific to Pan, Vertigo, etc. If we can get
some low-level GUI platform working with the characteristics I listed, I
can resurrect and my high-level libraries accordingly. Any GUI program
containing at least one OpenGL window would probably get us most of
Hi all,
I found an interesting case where the rtsopts -qm flag makes a
significant difference in runtime (~50x). This is using GHC 7.6.3, llvm 3.4,
program
compiled with -threaded -O2 -fllvm and a couple of language extension.
Source is at
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 a
subject change
On Sun, Sep 29, 2013 at 3:31 AM, Mike Izbicki m...@izbicki.me 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
I'd think
partition :: t - Either t (t, t)
might be more suited then...
Nicolas
On Sep 29, 2013 1:21 AM, Ryan Newton rrnew...@gmail.com wrote:
subject change
On Sun, Sep 29, 2013 at 3:31 AM, Mike Izbicki m...@izbicki.me wrote:
I've got a Partitionable class that I've been using for this
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 =
On 27 September 2013 21:51, Thiago Negri evoh...@gmail.com 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:
Hi Ryan,
-Original message-
From: Ryan Newton rrnew...@gmail.com
Sent: 29 Sep 2013, 04:21
snip
*class Partitionable t where*
* partition :: t - Maybe (t,t)*
snip
So what I really want is for the *containers package to please get some
kind of Partitionable instances! * Johan
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
On Sat, Sep 28, 2013 at 1:09 PM, Ryan Newton rrnew...@gmail.com 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)
Noam Lewis?
https://github.com/sinelaw
On 28 September 2013 21:48, Arjun Comar nru...@gmail.com 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 acow...@seas.upenn.eduwrote:
To be clear, I am
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
On Sun, 29 Sep 2013 21:40:28 +0100, 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 I
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 I
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, and
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.)
On Mon, 23 Sep 2013 15:32:35 +0200 Miro Karpis
miroslav.kar...@gmail.com 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
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 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,
On Fri, Sep 27, 2013 at 9:02 AM, Conal Elliott co...@conal.net wrote:
I'm polling to see whether there are will and expertise to reboot graphics
and GUIs work in Haskell. I miss working on functional graphics and GUIs in
Haskell, as I've been blocked for several years (eight?) due to the
Cool. Thanks a lot for uploading this.
I have a question (and I confess that I haven't checked the link). How is
this related to or overlaps with cv-combinators?
Cheers
Ivan
On 28 September 2013 06:18, Arjun Comar nru...@gmail.com wrote:
After receiving feedback, I went ahead and split out
Hi Conal, hi café,
I'm currently devoting most of my time to this and plan to continue doing
so (in the form of a PhD and work via my company).
I've been working on a thorough review of the current status and a
comparative analysis (using a fairly demanding, well-known algorithm to
compare
No, these are unrelated. Cv-combinators hasn't really worked since OpenCV
2.0 waa released I believe.
On Sep 28, 2013 8:54 AM, Ivan Perez ivanperezdoming...@gmail.com wrote:
Cool. Thanks a lot for uploading this.
I have a question (and I confess that I haven't checked the link). How is
this
Dear all,
I am pleased to announce that our monthly Haskell meeting is scheduled
on Monday, 30th of September, 19h30 at Cafe Puck. If you plan to join,
please click the button at:
http://www.haskell-munich.de/dates
Our monthly meetings started on Thu, 29 Sept 2011, so this will be over
I think they do work. cv-combinators depends on HOpenCV, which depends on
OpenCV 2.0.
On 28 September 2013 16:03, Arjun Comar nru...@gmail.com wrote:
No, these are unrelated. Cv-combinators hasn't really worked since OpenCV
2.0 waa released I believe.
On Sep 28, 2013 8:54 AM, Ivan Perez
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
balanced trees. Hmm, but how do we expose that?
It seems like it
Fair enough, it's been two or three years since I tried to play with them.
Most of my work is in the raw bindings currently, which provide the C++ API
in Haskell, so much lower level that cv-combinators. If HOpenCV were to
incorporate parts of these bindings then cv-combinators would be able to
The people working on HOpenCV are very open to incorporating other's
programmer's patches. Maybe you can incorporate your changes to
cv-combinators? (Project's been halted since 2010, I'm sure they'll be very
happy to see that sb is contributing).
On 28 September 2013 19:13, Arjun Comar
I've been talking to Anthony Cowley who I think is the current maintainer
of HOpenCV and Ville Tirronen who has been developing the CV bindings.
Basically the consensus is that these raw bindings provide a new base to
work from, and it's worthwhile to rethink the API we provide with a fresh
start.
Jan Bracker wrote:
Hello everybody,
I am sorry to send this a second time. Someone hinted out that I would not
reach everybody on the mailing list through the Google Groups address. I
should have looked a bit more thoroughly.
The Google Summer of Code 2013 is over! My project to port the
To be clear, I am not the maintainer of HOpenCV. I have used a fork of that
library for experimenting with OpenCV interfaces over the past few years, and
written quite a few kloc using it in several robotics oriented projects with
computer vision needs. None of my experiments with HOpenCV are
Ahh, I misunderstood then. Who is currently maintaining the HOpenCV package
on Hackage?
On Sat, Sep 28, 2013 at 3:45 PM, Anthony Cowley acow...@seas.upenn.eduwrote:
To be clear, I am not the maintainer of HOpenCV. I have used a fork of
that library for experimenting with OpenCV interfaces
Is it possible to change fonts? I have found that fonts (and shadows) have
a huge impact on the wow-factor of a plot. In fact, I could not help but
ask a speaker during a talk what font he used for a particular plot... it
just looked great!
I think all charts support setting a custom font
this is a funny trick, and it looks saner than the more general $ *
combinators.
i see many situations where i could use that to lift my own combinators,
or to replace the backticks (``) to lift the infix function.
thx
- marc
Gesendet: Freitag, 27. September 2013 um 21:51 Uhr
Von: Thiago Negri
On Sat, Sep 28, 2013 at 1:09 PM, Ryan Newton rrnew...@gmail.com 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)
Hi Conal,
If there is a system like you describe, I'm not aware of it. Part of the
problem is the state of the underlying C libraries:
gtk+ - possible, but suffers from the drawbacks you mention on OSX and is
reportedly difficult to install on windows
wx - somehow I've never been able to build
i know nothing on the gui tooling front, but i do know this: the ffi
linking issues with GHCI *should* be fixed with ghc HEAD / 7.8.
If you have linking problems with GHCi HEAD, please report it ASAP. All
linking related issues that have historically plagued ghci should be
resolved, at least on
John Lato jwl...@gmail.com writes:
QT - never tried this, but my impression is the Haskell-QT bindings
are a bit stale
Yes, QtHaskell [1] has been inactive for three years, as far as I can tell.
However, there are newish bindings [2] for the Qt Quick declarative UI
stuff that's appeared in
Conal Elliott wrote:
I'm polling to see whether there are will and expertise to reboot graphics
and GUIs work in Haskell. I miss working on functional graphics and GUIs in
Haskell, as I've been blocked for several years (eight?) due to the absence
of low-level foundation libraries having the
Could threepenny work with webGL, or is that too far out of the scope of
the project? I guess the overhead of having a server--even locally--and
using a web browser might just be too much for many use cases.
On Sep 27, 2013 1:51 AM, Heinrich Apfelmus apfel...@quantentunnel.de
wrote:
Conal
However, I would prefer to have two different types of libraries in haskell:
For graphics, something like SFML or SDL, no GUI implicit. but with
good/modern OpenGL. Maybe we won't need a direct binding, but rethinking
who should be done a SDL-like library in Haskell. Yep, FRP is cool, but
need
Tikhon Jelvis wrote:
Could threepenny work with webGL, or is that too far out of the scope of
the project? I guess the overhead of having a server--even locally--and
using a web browser might just be too much for many use cases.
Actually, I'm reading about WebGL right now, and it appears to me
On 09/27/2013 04:32 AM, Conal Elliott wrote:
I'm polling to see whether there are will and expertise to reboot
graphics and GUIs work in Haskell. I miss working on functional graphics
and GUIs in Haskell, as I've been blocked for several years (eight?) due
to the absence of low-level
201 - 300 of 102226 matches
Mail list logo
