On Fri, Oct 8, 2010 at 8:08 AM, Christopher Done
wrote:
> On 8 October 2010 07:44, C K Kashyap wrote:
>> Does native mean "Haskell only" - without FFI?
>
> I think "not Haskell" would be piping to a separate non-Haskell
> process or calling by FFI to another language to do the interesting
> work.
On 8 October 2010 07:44, C K Kashyap wrote:
> Does native mean "Haskell only" - without FFI?
I think "not Haskell" would be piping to a separate non-Haskell
process or calling by FFI to another language to do the interesting
work. Thus "native" is not using these for the interesting work. E.g.
I
Does native mean "Haskell only" - without FFI?
--
Regards,
Kashyap
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Brent & Yeu,
I recently ran into the same question. You can see the thread[1] which
includes lots of references to papers that describe the behavior you're
seeing along with examples.
Implementations of call-by-name lambda calculus all tend to have the same
runtime behavior that you're describing
On Sep 30, 2010, at 1:39 AM, Patrick Browne wrote:
I think my original question can be rephrased as:
Can type classes preserve satisfaction under the the expansion
sentences
(signature/theory morphisms inducing a model morphism).
According to [1] expansion requires further measures (program
On Thu, Oct 07, 2010 at 02:45:58PM -0700, Nicolas Pouillard wrote:
> On Thu, 07 Oct 2010 18:03:48 +0100, Peter Wortmann wrote:
> > Might be off-topic here, but I have wondered for a while why Haskell
> > doesn't support something like follows:
> >
> > do case (<- m) of ...
> >
> > With the mor
Of related interest, there have been more recent papers by the Clean
developers on "Arrow GECS" and iData but they are about Clean where
this is no IO monad.
Maybe Haskell cannot be liberated from IO after all...
___
Haskell-Cafe mailing list
Haskell-Caf
Hi
> Digressing a little, can anyone interested in doing so merge hoogle
> and Hayoo and make them part of Hackage?
I am currently working on this in my spare time. I hope to have
something to show in the next month.
Thanks, Neil
___
Haskell-Cafe maili
On Thu, 07 Oct 2010 18:03:48 +0100, Peter Wortmann wrote:
>
> On Tue, 2010-10-05 at 17:10 -0700, Evan Laforge wrote:
> > +1 for something to solve the "dummy <- m; case dummy of" problem.
> > Here are the possibilities I can think of:
>
> Might be off-topic here, but I have wondered for a while
Yes, I don't think I've officially announced a version of TagSoup that
has had HTML 5 parsing, but it now does as standard for the last few
releases. The HTML 5 spec is still changing, so it's entirely possible
something is incorrect in a corner case, but please let me know and
I'll fix it.
Thanks
Is there a more recent paper or article than "Can GUI Programming Be
Liberated From The IO Monad"? :)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm still having challenges to get a Haskell GUI to work under Windows
7; even after various instructions on the web.
e.g. Haskell Platform 2010.2.0.0, wxWidgets-2.9.1, wxHaskell 0.12.1.6
Similar challenges with GTK+ and gtk2hs.
___
Haskell-Cafe m
Отправлено с iPhone
Oct 7, 2010, в 21:03, Peter Wortmann написал(а):
>
> On Tue, 2010-10-05 at 17:10 -0700, Evan Laforge wrote:
>> +1 for something to solve the "dummy <- m; case dummy of" problem.
>> Here are the possibilities I can think of:
>
> Might be off-topic here, but I have wondered
Could you explain to me why HXT uses arrows? I have never been able
to figure out what advantage this gives your library over monads. Since
your arrows in practice implement ArrowApply, they are really just
monads anyway, so it seems to me that using arrows instead of monads
only serves to a
On Tue, 2010-10-05 at 17:10 -0700, Evan Laforge wrote:
> +1 for something to solve the "dummy <- m; case dummy of" problem.
> Here are the possibilities I can think of:
Might be off-topic here, but I have wondered for a while why Haskell
doesn't support something like follows:
do case (<- m) o
(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)->(p:P s)*(s:S)-
>(p:P s)*
OPEN CALL FOR PAPERS
for a Special Issue of
MATHEMATICAL STRUCTURES in COMPUTER SCIENCE
in association with the workshop
Hi,
On 06.10.2010, at 22:43, 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 se
On Thu, Oct 7, 2010 at 9:33 AM, Jan-Willem Maessen
wrote:
> There's no evaluation magic here---all that's happening is GHC is
> executing the program exactly as written. It can't float the list out
> of the function, as that can lead to unexpected space leaks (if you
> didn't intend to keep the l
What people seem to be missing here is that the location of the
where-binding with respect to the lambda changes in each case. As a
result, I think the forgoing explanations were rather confusing;
there's no magic going on here.
On Thu, Oct 7, 2010 at 8:17 AM, Brent Yorgey wrote:
> - Forwar
On Thu, 07 Oct 2010 10:02:20 +0200, you wrote:
>I'm not a native English speaker and recently I was wondering about the
>two words "order" and "ordering" (the main reason why I write this to
>the Haskell mailing list, is that the type class "Ordering" does exist).
>
>My dictionaries tell me that
On Thursday 07 October 2010 14:17:18, Brent Yorgey wrote:
> Hi all,
>
> See below for this message from one of my students which has me
> stumped. Just when you think you understand Haskell... ;)
>
> I've cc'ed him on this message; please include him on any replies as I
> don't think he is subscri
On Thu, Oct 7, 2010 at 1:44 PM, Luke Palmer wrote:
> The section works because "(a %^&)" (for some operator %^&) is short
> for "(%^&) a" and "(%^& a)" is short for "flip (%^&) a". Sections
> don't expand into lambdas.
>
According to the report they do:
http://haskell.org/onlinereport/exps.html
On Thu, Oct 7, 2010 at 8:44 AM, Luke Palmer wrote:
> On Thu, Oct 7, 2010 at 6:17 AM, Brent Yorgey wrote:
>> The source code seems to be easy to read, but I don't think I understand
>> that. For me I think if I change the first line from
>> fib = ((map fib' [0 ..]) !!)
>> to
>> fib x = ((map fib'
On Thu, Oct 7, 2010 at 6:17 AM, Brent Yorgey wrote:
> The source code seems to be easy to read, but I don't think I understand
> that. For me I think if I change the first line from
> fib = ((map fib' [0 ..]) !!)
> to
> fib x = ((map fib' [0 ..]) !!) x
> It should do the same thing since I think
2010/10/7 Gregory Collins :
> "Edward Z. Yang" writes:
>
>> Excerpts from Gregory Collins's message of Wed Oct 06 19:44:44 -0400 2010:
>>> 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
Michael Snoyman writes:
> As far as I know, Neil Mitchel's tagsoup[1] parses according to the
> HTML 5 parsing rules, but it just generates a list of Tags[2], so
> you'd have to build the DOM tree up from there. I personally have had
> great experience with tagsoup. It's even the core of HTML-scr
Christian Sternagel writes:
> recently I was wondering about the two words "order" and "ordering"
I would use "ordering" to mean the relation or function that orders
(ranks) elements, and I'd use "order" to refer the actual progression.
So by applying an ordering, you get elements in a particula
Haskell XML Toolbox 9.0.0
I would like to announce a new version of the Haskell XML Toolbox.
HXT has grown over the years. Components for XPath, XSLT, validation with
RelaxNG, picklers for conversion from/to native Haskell data, lazy parsing
with tagsoup, input via curl and native Haskell HTTP
Hi all,
See below for this message from one of my students which has me
stumped. Just when you think you understand Haskell... ;)
I've cc'ed him on this message; please include him on any replies as I
don't think he is subscribed to -cafe.
-Brent
- Forwarded message from Yue Wang -
F
On Thu, Oct 07, 2010 at 12:29:51AM +0200, 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,
> > T
> which looks somewhat nicer. This example also defines runTest and a
> test function (which calls the shell command "echo" to print some
> lines) you can try in ghci by typing "runTest test"...
>
> [1] http://gist.github.com/614246
>
Thank you very much Steffen for taking the time out for the exa
On Thu, Oct 7, 2010 at 8:41 AM, Vo Minh Thu wrote:
> 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
> Have you seen Potential
> (http://intoverflow.wordpress.com/2010/05/21/announcing-potential-x86-64-assembler-as-a-haskell-edsl/)?
> Quote:
>
> "The language’s goal is to provide a solid foundation for the development of
> a useful (multi-tasked, multi-processor, etc) microkernel"
>
> Which sounds
2010/10/7 Dmitry V'yal :
> It sounds: How to make a neat Windows installer for a nice Gtk2hs program I
> wrote last week? How to solve the problem of dependency on GTK? Should I ask
> my users to install a GTK package or it would be better to package all the
> dynamic libraries needed along with my
On 07/10/2010 02:45, Jason Dagit wrote:
+ well documented workflow for lightweight changes
+ heavy weight process for major work.
+ bugs, tickets.
+ Simon Marlow "contributions are going up, and process is working well"
That's reassuring. Is their workflow
Hello, haskellers.
Recently I stumbled upon a problem. It may sound quite off-topic for
this list, but, I'm sure, almost every haskell programmer runs into it
sooner or later.
It sounds: How to make a neat Windows installer for a nice Gtk2hs
program I wrote last week? How to solve the proble
Chris,
> I'm not a native English speaker and recently I was wondering about the two
> words "order" and "ordering" (the main reason why I write this to the Haskell
> mailing list, is that the type class "Ordering" does exist).
Irrelevant to your struggle, but note that the *type class* is dubb
"Edward Z. Yang" writes:
> Excerpts from Gregory Collins's message of Wed Oct 06 19:44:44 -0400 2010:
>> 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 lis
Excerpts from Gregory Collins's message of Wed Oct 06 19:44:44 -0400 2010:
> 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 if/when I
> get it finish
On Oct 7, 2010, at 1:02 AM, Christian Sternagel wrote:
Hi all,
I'm not a native English speaker and recently I was wondering about
the two words "order" and "ordering" (the main reason why I write
this to the Haskell mailing list, is that the type class "Ordering"
does exist).
My dicti
Hi all,
I'm not a native English speaker and recently I was wondering about the
two words "order" and "ordering" (the main reason why I write this to
the Haskell mailing list, is that the type class "Ordering" does exist).
My dictionaries tell me that "order" (besides other meanings) denotes
On Wed, Oct 6, 2010 at 2:11 AM, Michael Snoyman wrote:
> 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 profi
42 matches
Mail list logo
