On Thu, Oct 7, 2010 at 12:42 AM, Bas van Dijk wrote:
> Feature suggestion: Allow users to provide their location and show it
> (and the aggregate of all Haskellers) in a (Google) map.
>
> (I Just uploaded my initial profile)
>
> Bas
>
I like it, I'll get on it soon. Maybe I can use some of them
2010/10/7 Michael Snoyman :
> On Wed, Oct 6, 2010 at 8:14 PM, Brent Yorgey wrote:
>>
>> One (slightly off-topic) question: at the top of the site it says "the
>> meeting place for professional Haskell programmers". Is this supposed
>> to be geared towards Haskell programmers who get paid (or want
On Wed, Oct 6, 2010 at 8:14 PM, Brent Yorgey wrote:
>
> One (slightly off-topic) question: at the top of the site it says "the
> meeting place for professional Haskell programmers". Is this supposed
> to be geared towards Haskell programmers who get paid (or want to get
> paid) to write Haskell?
On Thu, Oct 7, 2010 at 12:29 AM, Christopher Done
wrote:
> On 6 October 2010 23:26, Vincent Hanquez wrote:
>> I'ld like to announce the tls package [1][2], which is a native
>> implementation
>> of the TLS protocol, client and server. It's currently mostly supporting
>> SSL3,
>> TLS1.0 and TLS
On Wed, Oct 6, 2010 at 7:42 PM, Conrad Parker wrote:
> (subject changed for easy filtering of flamebait, removed libraries@)
>
> On 7 October 2010 10:45, Jason Dagit wrote:
>> At the risk of starting a darcs vs. git discussion I have some
>> thoughts about the tension.
>>
>> On Wed, Oct 6, 2010 a
(subject changed for easy filtering of flamebait, removed libraries@)
On 7 October 2010 10:45, Jason Dagit wrote:
> At the risk of starting a darcs vs. git discussion I have some
> thoughts about the tension.
>
> On Wed, Oct 6, 2010 at 12:10 PM, Don Stewart wrote:
> [snip]
>> == GHC ==
>>
>> *
At the risk of starting a darcs vs. git discussion I have some
thoughts about the tension.
On Wed, Oct 6, 2010 at 12:10 PM, Don Stewart wrote:
[snip]
> == GHC ==
>
> * ghc status
> + 50% split in room on moving ghc from darcs to git.
I don't see that tension resolving itself easily. VCS
On Wed, Oct 6, 2010 at 12:10 PM, Don Stewart wrote:
> Here are the notes transcribed from the Future of Haskell BoF held
> after the Haskell Symposium last week.
>
Thanks for sending out the notes, Don! It was a very helpful and
constructive session for me, to let me see some interesting opport
> I would also very much like to have multi-argument pattern matching, but in
>
> \case a b -> ...
> ...
>
> it sure suggests to me that `a` should be applied to `b` before casing.
I feel like sugar is designed to make a couple of specific uses nicer.
Being as general and orthogonal a
> Complete side note: it's kind of funny that OpenID let's you specify
> some completely arbitrary string to appear in the resulting
> webpage[2].
Any server with that behavior is out of spec. Operating securely
requires checking the return_to value against the trust_root, and
checking that the r
At 4:43 PM -0400 10/6/10, Sterling Clover wrote:
On Oct 6, 2010, at 5:39 AM, Simon Marlow wrote:
A slightly different suggestion from Simon PJ and myself (we
agreed on something syntax-related :-) is the following:
\case 1 -> f
2 -> g
where the two-token sequence '\ case' introdu
Günther Schmidt writes:
> Hi all,
>
> is there an HTML parsing library that creates a DOM from a page?
I've got the month of October off, and one of the things I've been
planning on working on is a compliant HTML5 parser for Haskell --
something which is sorely needed! I will ping the list back
A big thank you, by the way, to you, Simon Marlow, Malcom Wallace and
everyone who helped getting the videos online and those that gave
talks at the Haskell Implementors' Workshop 2010. It was exciting to
watch all the videos! There was a lot of interesting and fertile
discussion.
On 6 October 201
Feature suggestion: Allow users to provide their location and show it
(and the aggregate of all Haskellers) in a (Google) map.
(I Just uploaded my initial profile)
Bas
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailma
The Reader monad just establishes an environment, so you can use "ask"
to retrieve a value from the environment.
Let's say you have the following types representing you Make-
Environment:
data MakeInfo = MakeInfo
{ target_ :: String
, sources_ :: [String]
}
then insid
On 6 October 2010 23:26, Vincent Hanquez wrote:
> I'ld like to announce the tls package [1][2], which is a native implementation
> of the TLS protocol, client and server. It's currently mostly supporting
> SSL3,
> TLS1.0 and TLS1.1. It's got *lots* of rough edges, and a bunch of unsupported
> f
> is there an HTML parsing library that creates a DOM from a page?
tagsoup produces trees ( http://hackage.haskell.org/package/tagsoup )
I use it with hxt ( http://hackage.haskell.org/package/hxt )
to tree-walk HTML pages.
J.W.
___
Haskell-Cafe maili
It's not entirely clear what you mean:
Do you want to describe grammars or parsers functionally:
In the first case, parser combinators are what you want (or some
encoding of them). There are many variations on these: LL(k),
context-free, dependent. Cyclicity (of what kind?) or empty productions
a
Hi all,
is there an HTML parsing library that creates a DOM from a page?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi haskellers,
I'ld like to announce the tls package [1][2], which is a native implementation
of the TLS protocol, client and server. It's currently mostly supporting SSL3,
TLS1.0 and TLS1.1. It's got *lots* of rough edges, and a bunch of unsupported
features, but it's humming along, and at each
On Oct 6, 2010, at 5:39 AM, Simon Marlow wrote:
> A slightly different suggestion from Simon PJ and myself (we agreed on
> something syntax-related :-) is the following:
>
> \case 1 -> f
> 2 -> g
>
> where the two-token sequence '\ case' introduces a new optional layout
> context, the
On 10/06/10 13:32, steffen wrote:
A slightly different suggestion from Simon PJ and myself (we agreed on
something syntax-related :-) is the following:
\case 1 -> f
2 -> g
...
\case { 1 -> f; 2 -> g }
+1
I like this because it has exactly the same properties of Max's
case-of, b
Mauricio,
2010/10/6 Maurício CA :
> I've been working in a tool that reads a grammar with associated
> actions and act on input based on that grammar. I would like to
> rewrite it in a functional style, but I've not been able to find a
> theory that would handle any possible grammar with cyclicit
> > A slightly different suggestion from Simon PJ and myself (we agreed on
> > something syntax-related :-) is the following:
>
> > \case 1 -> f
> > 2 -> g
> > ...
> > \case { 1 -> f; 2 -> g }
>
> +1
>
> I like this because it has exactly the same properties of Max's
> case-of, but is shor
Here's how I say it (literally):
http://hubrisarts.com/curry.wav
On Wed, Oct 6, 2010 at 1:21 PM, Petr Pudlak wrote:
> Hi all,
>
> I have a question for native English speakers: What is the correct
> pronunciation of the name "Curry" (in "Haskell Curry") and the derived verb
> "currying"? I found
Quoth Petr Pudlak ,
> I have a question for native English speakers: What is the correct
> pronunciation of the name "Curry" (in "Haskell Curry") and the derived
> verb "currying"? I found on Wikitonary the name is (probably) of Irish
> orgin, so I suppose that the pronunciation may by nonstand
Hi all,
I have a question for native English speakers: What is the correct
pronunciation of the name "Curry" (in "Haskell Curry") and the derived
verb "currying"? I found on Wikitonary the name is (probably) of Irish
orgin, so I suppose that the pronunciation may by nonstandard.
Probably the
Here are the notes transcribed from the Future of Haskell BoF held
after the Haskell Symposium last week.
-- Don
= Future of Haskell BoF Notes =
A "birds of a feather" meeting was held at ICFP, organized by Bryan and
Johan. We had 30 (?) people in a room, for 2 hours, discussing how to
ensur
One (slightly off-topic) question: at the top of the site it says "the
meeting place for professional Haskell programmers". Is this supposed
to be geared towards Haskell programmers who get paid (or want to get
paid) to write Haskell? If so, fine; if not, in my opinion the word
"professional" oug
On Wed, Oct 6, 2010 at 11:28 AM, Ivan Lazar Miljenovic
wrote:
> On 6 October 2010 20:11, Michael Snoyman wrote:
>> Hi all,
>>
>> After finally getting OpenID 2 support worked out, I've now put up the
>> Haskellers.com website[1].
>
> For me at least, when I try to use my wordpress.com OpenID, I g
John Lato schrieb:
> Thanks for these, and also Stephen's extensive list. I think it's fair
> to say that I'm just exploring the space and don't know what I'm doing
> yet. As such, I'm pretty open to exploring ideas. I'm only familiar
> with a small fraction of these, so I've got some reading to
Maybe Peter Ljunglöf's thesis will be useful?
http://www.ling.gu.se/~peb/pubs.html
http://www.ling.gu.se/~peb/pubs/Ljunglof-2002a.pdf
It covers chart, GLR and CYK parsing - isn't Earley's parsing method
related to either chart or CYK?
___
Haskell-Cafe m
Hi Stephen,
> From: Stephen Tetley
>
> Hi John
>
> For the user level stuff, I don't think CSound really has "functions"
> - either for the score or orchestra. The score I think is just a list
> of /notes/ with many, many parameters and the orchestra is a graph
> description saying how the UGens
Excellent! Thanks for putting this together. It's nice to have.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hopefully Joe can upload the Html version to
http://sequence.complete.org/hwn later today. If that is not the
case, maybe someone with upload powers can lend me a hand.
Daniel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
On 6 October 2010 11:39, Simon Marlow wrote:
> Certainly some existing code would fail to parse, e.g.
> (case e of [] -> \x -> x+1; (x:xs) -> \x -> x+2)
That's definitely a problem. The multi-pattern lambda is nice as I
think it follows naturally from function definitions (indeed, I think
man
Welcome to issue 153 of the HWN, a newsletter covering developments in
the [1]Haskell community.
It sure has been a while since we last saw one of these. Hopefully the
dry spell for the newsletter is now a thing of the past. I sure hope
you enjoy it, and give plenty of feedback.
On Wed, 6 Oct 2010, Christopher Done wrote:
I hadn't heard of httpd-shed. Will you add it to Servers? I think a
page about HWS would also be good that shows the history of it and
derived projects, if you feel like writing it!
It's everything there:
http://www.haskell.org/haskellwiki/Haskell
On 10/2/10, Christopher Done wrote:
> 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.
Hi, all,
I've been working in a tool that reads a grammar with associated
actions and act on input based on that grammar. I would like to
rewrite it in a functional style, but I've not been able to find a
theory that would handle any possible grammar with cyclicity and
empty productions, and flex
On 6 October 2010 16:33, Henning Thielemann
wrote:
> How about mailing to the package maintainers in order to inform they, that
> the Web application list on the Wiki has changed? I'm afraid not all authors
> follow haskell-cafe or haskell-web.
I could send out a bulk mail requesting authors to h
On 06/10/10 11:00, C K Kashyap wrote:
My ultimate aim it to
write an EDSL for x86 - as in, describe a micro-kernel in haskell,
compiling and running which would generate C code ( not sure if it's
even possible - but I am really hopeful).
Have you seen Potential
(http://intoverflow.wordpress.
On Wed, 6 Oct 2010, Christopher Done wrote:
On 6 October 2010 14:16, Henning Thielemann
If you think the re-structuring is necessary, then at least ask the
maintainers, whether they still maintain their packages, or just sort
the packages according to the degree of activity you assume, but
On Wed, Oct 6, 2010 at 11:49 AM, Serguey Zefirov wrote:
> 2010/10/6 Michael Snoyman :
>> Hi all,
>>
>> After finally getting OpenID 2 support worked out, I've now put up the
>> Haskellers.com website[1]. Not all features are implemented yet, but
>> the basics are in.
>
> Would it be possible to be
On Wed, Oct 6, 2010 at 2:16 PM, Henning Thielemann
wrote:
>
> On Wed, 6 Oct 2010, Christopher Done wrote:
>
>> On 6 October 2010 12:47, Henning Thielemann
>> wrote:
>>>
>>> I for instance use http-shed and mohws all the time. They do what they
>>> shall
>>> do for me. I maintain mohws
>>
>> Pleas
On 6 October 2010 14:16, Henning Thielemann
wrote:
> I'm generally not glad that some people rearrange existing structure and
> expect that all of the affected authors follow. It's already tedious to
> catch up with the yearly changes in GHC's package and other base packages
> (e.g. transformers
On Wed, 6 Oct 2010, Christopher Done wrote:
On 6 October 2010 12:47, Henning Thielemann
wrote:
I for instance use http-shed and mohws all the time. They do what they shall
do for me. I maintain mohws
Please move the ones you use and maintain to the active list!
I'm generally not glad tha
On 6 October 2010 12:47, Henning Thielemann
wrote:
> I for instance use http-shed and mohws all the time. They do what they shall
> do for me. I maintain mohws
Please move the ones you use and maintain to the active list!
___
Haskell-Cafe mailing list
H
2010/10/6 Michael Snoyman :
>>> * How granular should we get? For web programming, for instance,
>>> should we ask about Yesod, Happstack, Snap, etc?
>>
>> I think that "skill cloud" would be nice so I can add my new skills
>> (packages, programs, domain specific knowledge) as I acquire them (or
>>
On Wed, Oct 6, 2010 at 11:49 AM, Serguey Zefirov wrote:
> 2010/10/6 Michael Snoyman :
>> Hi all,
>>
>> After finally getting OpenID 2 support worked out, I've now put up the
>> Haskellers.com website[1]. Not all features are implemented yet, but
>> the basics are in.
>
> Would it be possible to be
On Tue, Oct 5, 2010 at 9:19 PM, steffen wrote:
> Don't be to disappointed. One can always kinda fake lazy evaluation
> using mutable cells.
> But not that elegantly. In the example given above, all being used is
> iterators as streams... this can also be expressed using lazy lists,
> true. But one
On Wed, Oct 6, 2010 at 11:28 AM, Ivan Lazar Miljenovic
wrote:
> On 6 October 2010 20:11, Michael Snoyman wrote:
>> Hi all,
>>
>> After finally getting OpenID 2 support worked out, I've now put up the
>> Haskellers.com website[1].
>
> For me at least, when I try to use my wordpress.com OpenID, I g
2010/10/6 Michael Snoyman :
> Hi all,
>
> After finally getting OpenID 2 support worked out, I've now put up the
> Haskellers.com website[1]. Not all features are implemented yet, but
> the basics are in.
Would it be possible to be able to login or consolidate two (or more)
different OpenID?
For
On 06/10/2010 00:04, Max Bolingbroke wrote:
On 5 October 2010 17:38, Henning Thielemann
wrote:
Richard O'Keefe schrieb:
I'd prefer to see something like
\ 1 -> f
| 2 -> g
but I'm sure something could be worked out.
In order to be consistent with current case, maybe in layou
Thanks for the response.
That sounds sequence comparison seems very impressive
On Wed, Oct 6, 2010 at 2:23 PM, Ketil Malde wrote:
> Hemanth Kapila writes:
>
> > Let us say, we are using a bit-array of size 2^43 (that is, a byte array
> of
> > size 2^40) to store a bloom filter. And let us furt
On 6 October 2010 20:11, Michael Snoyman wrote:
> Hi all,
>
> After finally getting OpenID 2 support worked out, I've now put up the
> Haskellers.com website[1].
For me at least, when I try to use my wordpress.com OpenID, I get this message:
"Do you want to pass your http://ivanmiljenovic.wordpr
Hi all,
After finally getting OpenID 2 support worked out, I've now put up the
Haskellers.com website[1]. Not all features are implemented yet, but
the basics are in. One of the most important features is going to be
the user profiles, and I wanted some community input on the kind of
stuff they'd
Hemanth Kapila writes:
> Let us say, we are using a bit-array of size 2^43 (that is, a byte array of
> size 2^40) to store a bloom filter. And let us further assume that we are
> interested in a false-positive probability of 0.01
Since we are just making up numbers, let us instead say we are usi
Hi,
Daniel Fischer wrote:
> On Tuesday 05 October 2010 23:34:56, Johannes Waldmann wrote:
> > main = writeFile "check.out" "ü"
> >
> > that's u-umlaut, and the source file is utf-8-encoded
> > and ghc-6.12.3 compiles it without problems but when running, I get
> >
> > hClose: invalid argument (In
59 matches
Mail list logo
