On Sat, Oct 2, 2010 at 10:40 PM, Christopher Done
wrote:
> On 2 October 2010 22:13, Michael Snoyman wrote:
>> I understand the advantages to splitting into multiple pages, but on
>> the other hand it *does* make it more difficult to locate information.
>
> It does? What's an example? I'll fix it.
>
> Thanks Emil ... yeah, that works...I was wondering what I could do to
> not have to mention "r1" explicitly.
> I'll check out Neil's pdf and video now - perhaps I'll find answers there.
>
I checked out the video - nice - but I think, understandably, since
its not open source yet, not much of i
On Wed, Sep 29, 2010 at 1:01 PM, Daniel Fischer
wrote:
> On Wednesday 29 September 2010 19:10:22, Ben Franksen wrote:
>> >
>> > Note the last line mentions only '}'. I would rather like to see
>> >
>> > expecting "}" or digit
>> >
>> > since the parser could very well accept another digit here.
Thanks to everyone who replied - it looks like this feature is enough
in demand that GHC HQ may want to accept it. I've created a ticket at
http://hackage.haskell.org/trac/ghc/ticket/4359
On 2 October 2010 14:23, Max Bolingbroke wrote:
> Hi Cafe,
>
> I implemented the proposed Haskell' feature la
Hello,
Check out these threads:
http://groups.google.com/group/happs/browse_thread/thread/23d92e45c99f88b1
http://groups.google.com/group/happs/browse_thread/thread/0b0d0a9158c3ad73
There is nothing inherently wrong with keeping 28GB of real data in
memory. It depends largely on what you are tr
On 10/2/10 3:13 PM, Christopher Done wrote:
There's nothing more annoying than having to introduce intermediate
bindings when you're going to immediate pattern match against it
immediately and never use it again. It's both annoying to have to
think of a variable name that makes sense and is not i
Hi, Thomas.
> Thanks Jeremy, I just wrote up my own little analysis (below) while you
> were responding. I'll look for the kd-tree work; if I see discussion
> (and am stupid enough to heap more work onto my plate) then I might get
> involved.
You can find the repository for the dynamic kd-tree i
Christopher Done wrote:
> On 1 October 2010 15:27, Henning Thielemann
> wrote:
>>
>> Given the following code, that is accepted by GHC:
>>
>>> data Exist = forall a. Exist a
>>>
>>> exist :: Exist
>>> exist = Exist undefined
>>
>> What type has the 'undefined' ?
>
> I think its type is `a'.
>>
>>
On Fri, Oct 01, 2010 at 01:18:29PM +0200, Lafras Uys wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> I can now find explicit bindings for apply and curry, however not for
> uncurry. The type signature for uncurry introduces a new type
> constructor (<=>),
>
> > uncurry :: <= a (Exp <
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 10/2/10 15:27 , Jan Christiansen wrote:
> You can use a similar approach for case expressions ; )
There are several better (that is, not using unsafePerformIO) versions at
http://haskell.org/haskellwiki/Case .
- --
brandon s. allbery [linux,s
On 2 October 2010 22:13, Michael Snoyman wrote:
> I understand the advantages to splitting into multiple pages, but on
> the other hand it *does* make it more difficult to locate information.
It does? What's an example? I'll fix it.
> My guess is a good search function on the wiki will make that
On Sat, Oct 2, 2010 at 4:13 PM, Michael Snoyman wrote:
> I understand the advantages to splitting into multiple pages, but on
> the other hand it *does* make it more difficult to locate information.
> My guess is a good search function on the wiki will make that point
> moot. Overall, looks like y
I understand the advantages to splitting into multiple pages, but on
the other hand it *does* make it more difficult to locate information.
My guess is a good search function on the wiki will make that point
moot. Overall, looks like you've done a great job, thanks! A few minor
comments:
* Should
Thanks Jeremy, I just wrote up my own little analysis (below) while you
were responding. I'll look for the kd-tree work; if I see discussion
(and am stupid enough to heap more work onto my plate) then I might get
involved.
Oops, didn't send...
Cheers,
Thomas
-
So another glance tells me th
On Sat, Oct 2, 2010 at 4:13 PM, Christopher Done
wrote:
> There's nothing more annoying than having to introduce intermediate
> bindings when you're going to immediate pattern match against it
> immediately and never use it again. It's both annoying to have to
> think of a variable name that makes
On 02.10.2010, at 20:35, Henning Thielemann wrote:
On Sat, 2 Oct 2010, Colin Paul Adams wrote:
Prelude> (if then "Haskell" else "Cafe") False
Max> "Cafe"
My reaction is to ask:
Can you write this as:
(if then else) False "Haskell" "Cafe"
?
Sure:
ifThenElse :: Bool -> a -> a ->
On 2 October 2010 19:33, Henning Thielemann
wrote:
>
> On Sat, 2 Oct 2010, Max Bolingbroke wrote:
>
> ... lambda-case/lambda-if ...
>>
>
> Nice! Concerning if-then-else I would more like to see an according
> function to go to Data.Bool, then we won't need more syntactic sugar like
> if-then-else.
I just had a look at hpaste.org, and, amusingly, the first paste has this:
down <- openLazyURI "http://list.iblocklist.com/?list=bt_level1";
case down of
Left _ -> error "Could not download file"
Right bs -> do input <- bs
...
On 2 October 2010 20:23, Max Bolingbroke wrote:
> Do you like this feature and think it would be worth incorporating
> this into GHC? Or is it too specialised to be of use? If there is
> enough support, I'll create a ticket and see what GHC HQ make of it.
Nice work! I like it and have wanted it f
In the current version of IxSet, the performance of querying on just
the Lon would be essentially the same as if you just had a "Data.Map
Lon Point". But the queries on the second index are current not so
great. There is work in progress to rewrite the internals of IxSet to
be based on a kd-tree, i
On Sat, 2 Oct 2010, Colin Paul Adams wrote:
"Max" == Max Bolingbroke writes:
Prelude> (if then "Haskell" else "Cafe") False
Max> "Cafe"
My reaction is to ask:
Can you write this as:
(if then else) False "Haskell" "Cafe"
?
Sure:
ifThenElse :: Bool -> a -> a -> a
ifThenElse True
On Sat, 2 Oct 2010, Max Bolingbroke wrote:
Hi Cafe,
I implemented the proposed Haskell' feature lambda-case/lambda-if [1]
during the Haskell Implementors Workshop yesterday for a bit of fun.
The patches are online [2, 3].
The feature is demonstrated in this GHCi session:
$ inplace/bin/ghc-st
> "Max" == Max Bolingbroke writes:
Prelude> (if then "Haskell" else "Cafe") False
Max> "Cafe"
My reaction is to ask:
Can you write this as:
(if then else) False "Haskell" "Cafe"
?
--
Colin Adams
Preston Lancashire
() ascii ribbon campaign - against html e-mail
/\ www.asciirib
Hi Cafe,
I implemented the proposed Haskell' feature lambda-case/lambda-if [1]
during the Haskell Implementors Workshop yesterday for a bit of fun.
The patches are online [2, 3].
The feature is demonstrated in this GHCi session:
$ inplace/bin/ghc-stage2 --interactive -XLambdaCase
GHCi, version 7
For another model of GUIs, see Tangible Values (
http://www.haskell.org/haskellwiki/TV), which is composable MVC.
And amen to targeting GPUs.
In addition to getting clunky, imperative GUI frameworks like wx & gtk
working robustly and easily in Haskell across platforms, I'd love to see
more powerf
Peter Verswyvelen wrote:
Regarding GUIs, I really miss a pure functional framework for doing so.
We all do, we all do. ;)
Currently I'm using Microsoft's WPF, and that is more or less declarative, a
bit like BOOPSI or MUI on the good old Amiga days. But WPF has so many
little quirks, not to m
Vo Minh Thu wrote:
Is it right that by using flattr, you end up donating the same amount
of money to every flattred person in a month?
Yes.
So you can donate more
the previous month to some project you value less than another project
the next month. This seems weird to me.
That's the price
On Oct 2, 2010, at 3:30 PM, Peter Verswyvelen wrote:
> Regarding GUIs, I really miss a pure functional framework for doing so.
>
> Currently I'm using Microsoft's WPF, and that is more or less declarative, a
> bit like BOOPSI or MUI on the good old Amiga days. But WPF has so many little
> quir
Regarding GUIs, I really miss a pure functional framework for doing so.
Currently I'm using Microsoft's WPF, and that is more or less declarative, a
bit like BOOPSI or MUI on the good old Amiga days. But WPF has so many
little quirks, not to mentioned a weakly typed XML-like language called
"XAML"
2010/10/2 Luke Palmer :
> On Sat, Oct 2, 2010 at 4:32 AM, Bulat Ziganshin
> wrote:
>> Hello Heinrich,
>>
>> Saturday, October 2, 2010, 1:36:48 PM, you wrote:
>>
>>> Would you put a flattr button [1] on the wxHaskell page? This way,
>>> people like me would be able to show their appreciation by don
On Sat, Oct 2, 2010 at 4:32 AM, Bulat Ziganshin
wrote:
> Hello Heinrich,
>
> Saturday, October 2, 2010, 1:36:48 PM, you wrote:
>
>> Would you put a flattr button [1] on the wxHaskell page? This way,
>> people like me would be able to show their appreciation by donating a
>
> this page doesn't desc
Hello Heinrich,
Saturday, October 2, 2010, 1:36:48 PM, you wrote:
> Would you put a flattr button [1] on the wxHaskell page? This way,
> people like me would be able to show their appreciation by donating a
this page doesn't describe how to pay and how to got the money
received. if Jeremy lives
Jeremy O'Donoghue wrote:
Apologies folks, rant coming up...
[...]
Bear in mind that as I have a (very) demanding day job and a young
family, I actually have no more than 3-4 hours a week (at best) to spend
maintaining wxHaskell. Bear in mind also that my interest in wxHaskell
was always to be
33 matches
Mail list logo
