I agree, I think this is what we need.
Plus a decision of what names the builtin syntax refers to,
like the type of 'a'.
-- Lennart
On Mar 26, 2007, at 23:30 , Ashley Yakeley wrote:
Sebastian Sylvan wrote:
The solution is simple:
* If there is a "module M where" clause in the beginnin
Jean-Marie Gaillourdet wrote
> I am trying to do something like the following:
> > {-# OPTIONS -fglasgow-exts -fallow-undecidable-instances #-}
> > module TestCase where
> >
> > data Any root = forall pos sel . T root pos sel => ANY pos
> >
> > class T root pos sel | pos -> root, root -> sel wher
Wagner Ferenc wrote:
> David Brown <[EMAIL PROTECTED]> writes:
>
>> Does anyone know of any existing Parser parsers that don't consume
>> their entire input, or am I probably best off making my own parser.
>
> Thomas Zielonka published his Parsec combinator lazyMany on this list
> a couple of times
Jean-Philippe Bernardy wrote:
> Please look at
http://darcs.haskell.org/packages/collections/doc/html/Data-Collections.html
> for an effort to make most common operation on bulk types fit in a
> single framework.
The last time I looked at this (shortly after you started the project) I
wasn't sure
David Brown <[EMAIL PROTECTED]> writes:
> Does anyone know of any existing Parser parsers that don't consume
> their entire input, or am I probably best off making my own parser.
Thomas Zielonka published his Parsec combinator lazyMany on this list
a couple of times, Google for it. Here is my ap
I'm trying to build lambdabot 4.0 with ghc-6.4.1 (gcc (GCC) 3.4.2 (mingw-
special)) and Cabal-1.1.6.1 on WinXP SP2. I've got as far as
Plugin.Pl.Transform.hs, and I get
*** Mangler
g:\ghc\ghc-6.4.1\perl g:\ghc\ghc-6.4.1\ghc-asm
C:\DOCUME~1\IAINAL~1\LOCALS~1\Tem
p\ghc2736.raw_s C:\DOCUME~1\IAINA
Accidentally sent to haskell@haskell.org instead of the cafe:
> >Diversity is generated by mutations.
>
> This is hardly a revelation.
It was, looong ago.
>
> My point was that you need two competing components in relative balance to
> grow something meaningful.
And I'd think the Haskell comm
> -Ursprüngliche Nachricht-
> Von: "Andrzej Jaworski" <[EMAIL PROTECTED]>
> Gesendet: 26.03.07 18:34:00
> An: <[EMAIL PROTECTED]>
> Betreff: Re: [Haskell-cafe] What ever happened to Haskell 98 as a
> "stablebranch"?
> Hi,
>
> I apologize for mistakenly resending my answer to two lists.
David Brown <[EMAIL PROTECTED]> wrote:
> Does anyone know of any existing Parser parsers that don't consume
> their entire input, or am I probably best off making my own parser.
http://www.cs.york.ac.uk/fp/polyparse
In particular, the module Text.ParserCombinators.PolyLazy.
Regards,
Malcolm
> -Ursprüngliche Nachricht-
> Von: "Dmitri O.Kondratiev" <[EMAIL PROTECTED]>
> Gesendet: 26.03.07 16:44:12
> An: haskell-cafe@haskell.org
> Betreff: [Haskell-cafe] Newbie: a parser for a list of objects?
> Please see my questions inside comments {-- --} :
> Thanks!
>
> ---
> module Parser
Daniel Fischer has cared to inform me that:
>Diversity is generated by mutations.
With due respect, but this is hardly a revelation.
My point was that you need two competing components in relative balance to
grow something meaningful.
Cancer growth is based solely on mutation!
Also I was not theo
I'm trying to figure out how to write a simple parser in Parsec to
tokenize a subset of RTF.
The problem is that I haven't been able to come up with a way of
writing the parser that doesn't try consuming all of the input just
to return the first token.
The 'many' primitive's implementation uses a
I didn't understand what you meant, so I'll withdraw the Darwinian analogy.
All I mean is: if you think the Prelude is inadequate, an excellent strategy is
to write a better one. If it's better, people may start to use it, and your
good ideas will spread.
Simon
| -Original Message-
|
Please see my questions inside comments {-- --} :
Thanks!
---
module Parser where
import Data.Char
type Parse a b = [a] -> [(b, [a])]
{--
Newbie: a parser for a list of objects?
I am working with the section 17.5 "Case study: parsing expressions" of the
book "Haskell The Craft of Functional
| thanks for your quick answer. Do you have any predictions when System
| F_c in GHC will be available for usage?
Somewhere between 2 and 4 months is my guess
Simon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/l
> -Ursprüngliche Nachricht-
> Von: "Andrzej Jaworski" <[EMAIL PROTECTED]>
> Gesendet: 26.03.07 15:00:47
> An: "Simon Peyton-Jones" <[EMAIL PROTECTED]>
> CC: Haskell-Cafe@haskell.org
> Betreff: Re: [Haskell-cafe] What ever happened to Haskell 98 as a
> "stablebranch"?
> >Haskell is rathe
>Haskell is rather a Darwinian sort of place.
With whole respect. You need two components for evolution to work: the
survival of the fitness and Generator Of Diversity (GOD).
Now, Haskell attracts originality and easily accommodates changes but nobody
burns tires in testing anything so that compl
Hi,
thanks for your quick answer. Do you have any predictions when System
F_c in GHC will be available for usage?
Regards,
Jean-Marie
Simon Peyton-Jones wrote:
> What you want to do is perfectly reasonable -- but it cannot be translated
> into System F and that's why GHC rejects it.
>
> GHC
On Mon, 26 Mar 2007 09:20:59 +0100
Simon Peyton-Jones <[EMAIL PROTECTED]> wrote:
> | [Conjecture 1 (2007). Haskell Mathematical Prelude and
> Mathematicians] If | Haskell had a mathematically sound prelude then
> more mathematicians would | use Haskell.
>
> A mathematically sound Prelude would be
What you want to do is perfectly reasonable -- but it cannot be translated into
System F and that's why GHC rejects it.
GHC now has a richer intermediate language that *can* handle this; see our
paper http://research.microsoft.com/~simonpj/papers/ext-f.
Manuel and Martin and I are now working o
Hi,
I am trying to do something like the following:
> {-# OPTIONS -fglasgow-exts -fallow-undecidable-instances #-}
> module TestCase where
>
> data Any root = forall pos sel . T root pos sel => ANY pos
>
> class T root pos sel | pos -> root, root -> sel where
>f :: pos -> sel -> Bool
>
> inst
Andrew Wagner wrote:
The time has come! Calling all Haskell programmers interested in AI!
I've established a new home base at
http://www.haskell.org/haskellwiki/AI .
I have added a link to the Google Summer of Code ticket for a machine
learning library, which I hope is approriate to categorize a
| Why, then, are we so paranoid about introducing breaking changes in
| the development branch of haskell? Why are we stuck without the class
| system extension proposal? Why is Num so still so horribly mangled?
| Why can I not 'map' over a Set? Why must I use lists of characters if
| I desire s
23 matches
Mail list logo
