I'm working on a dev branch of wxHaskell [1] and one of the new
features is that you can use wxHaskell in GHCi (again), but I seem to
have broken something in the process:
Firstly: wxHaskell works in GHCi insomuch as:
You can load the hello world sample [2] in GHCi, do main, see the
window spawn,
On 30 September 2011 03:02, Claude Heiland-Allen cla...@goto10.org wrote:
On 30/09/11 02:45, DukeDave wrote:
1. Is there some reason (other than 'safety') that cabal install cleans
everything up?
As far as I've experienced and understand it, it doesn't - it's more that
GHC can detect when
Hi all, I've been trying to resolve a compile time issue[1] with
wxHaskell, and I thought I'd throw it open to see if anyone on cafe
can help.
Here's the crux of the issue:
The Setup.hs for wxcore (the major component of wxHaskell) uses
simpleUserHooks, overriding only confHook.
However there is
Is anyone maintaining the AC-Vector-Fancy package?
I haven't had a reply from the latest maintainer (Andrew Coppin) on Hackage,
so I thought I'd open it up to cafe:
I think I have found a problem with the union function:
If you look here: http://hpaste.org/49889
You will see that line 4 gives a
Is anyone maintaining the AC-Vector-Fancy package?
I haven't had a reply from the latest maintainer (Andrew Coppin) on Hackage,
so I thought I'd open it up to cafe:
I think I have found a problem with the union function:
If you look here: http://hpaste.org/49889
You will see that line 4 gives a
Hi Colin
As an alternative you may consider using Thrift:
http://incubator.apache.org/thrift/
Cheers,
Dave
On Tue, 2008-11-11 at 16:45 +, Colin Paul Adams wrote:
Is there a way to call Haskell code from other languages? I have looked on
the wiki, and as far as I can see, it only talks
Hi everyone
So I should clarify I'm not a troll and do see the Haskell light. But
one thing I can never answer when preaching to others is what does
Haskell not do well?
Usually I'll avoid then question and explain that it is a 'complete'
language and we do have more than enough libraries to
will have
no choice with time constraints :(
Dave,
On 10/03/2008, Dave Tapley [EMAIL PROTECTED] wrote:
Hi all,
I've been plugging away at this all day and some discussion in
#haskell has been fruitless. Perhaps you have the inspiration to see
what's happening!
Concerning this minimal
Hi all,
I've been plugging away at this all day and some discussion in
#haskell has been fruitless. Perhaps you have the inspiration to see
what's happening!
Concerning this minimal example:
http://hpaste.org/6268
It works as required, loading K/V pairs into a Data.Map, the concern
is the
Hi everyone,
This is regarding Thrift, a software framework for scalable
cross-language services development(1)
Present in the release tarball there is some source for Haskell but no
sign of a tutorial or any sample code. I'm just picking through but as
a long shot does anyone have examples they
If I recall correctly a rather neat way of exploiting this property of
qsort is exploited with Nested Data Parallelism and covered in this
talk:
http://www.londonhug.net/2007/05/25/video-of-spjs-talk-is-now-online/
Good food for thought :)
Dave,
On 18/09/2007, Thomas Girod [EMAIL PROTECTED]
Hi again all, I could do with some design pointers for a project I'm
working on combining Haskell with a robot.
My situation is:
I read sensor data from the robot lazily a line at a time, as soon as
a line is read in my code sends out a response down a pipe.
Implemented in this fashion:
mapM_
if this window is closed and main is evaluated again both GHCi
and hugs die thus:
GHCi: Illegal instruction (core dumped)
hugs: Unexpected signal
Any thoughts?
On 31/07/07, Dave Tapley [EMAIL PROTECTED] wrote:
Excellent, thank you Marc your advice worked perfectly.
For reference the corrected
Hopefully this is just about on topic enough..
(Oh and it's not home work, I just can't bring myself to let it go!)
Taken from Simon Thompson: Type Theory and Functional Programming
Section 1.1
Exercise 1.3
Question: Give a proof of (A = (B = C)) = ((A /\ B) = C).
Now I can easily perform
Whoops, okay after two lines (thanks to oerjan) on #haskell I realise
that yes, it is as easy as it should have been.
For completeness:
[A /\ B]1
(/\ E1) [A = (B = C)]2
A
- (= E)
Perhaps in here we should start using
\x - (unlines . (dropWhile (/= x)) . lines)
Instead :)
Dave,
On 23/06/07, Thomas Schilling [EMAIL PROTECTED] wrote:
On 22 jun 2007, at 22.17, Derek Elkins wrote:
[blah blah blah]
A less (potentially) offensive way of formulating this is:
[...]
I find it's good for the soul to remember what the do notation is doing for us.
Also I'm with Einstein on You do not really understand something
unless you can explain it to your grandmother :)
Personally I think (in this instance) your three 'Parser a' functions
read nicer as:
primary =
17 matches
Mail list logo
