* Eugene Kirpichov [2011-09-14 08:38:10+0400]
> Hi,
> I don't see how fallback to NFA simulation is really a failure wrt DoS
> attacks. It's not exponential in time or memory, just linear memory
> (in size of regex) instead of constant, and slower than DFA.
Hi Eugene, thanks for pointing that out
* Kazu Yamamoto [2011-09-14 15:59:05+0900]
> Hello,
>
> My friend reached the following version:
>
> chop :: String -> String
> chop = foldr go []
> where
> go x xs
> | isSpace x && null xs = []
> | otherwise= x:xs
>
> This version is faster than the reverse versio
* Chris Smith [2011-09-16 12:13:13-0600]
> Overview
>
>
> VirtuaHac is a Haskell hacathon being planned using Google+ and a Wiki.
> The rules will be that if you have a project you'd like to participate
> in, then:
>
> 1. Create a darcs or git repository.
> 2. Post a Hangout in Google+.
A natural reference would be the darcs repository
http://darcs.haskell.org/packages/base/
or its git mirror
http://darcs.haskell.org/packages/base.git
which I used because getting it is much faster.
Using 'git blame Control/Applicative.hs' I figured out that the instance
was added in this
* Anton Tayanovskyy [2011-09-17 21:46:57-0400]
> So you want to encode priorities efficiently as far as I understand
> from [1]? Could bit-packing combined with prefix elimination do the
> trick? Choice boils down to binary choice. Attach a number N to every
> execution thread that sits in a given
* Anton Tayanovskyy [2011-09-17 22:11:00-0400]
> By the way, can Haskell have a type that admits regular expression and
> only those? I mostly do ML these days, so trying to write up a regex
> types in Haskell I was unpleasantly surprised to discover that there
> are all sorts of exotic terms inha
Chris,
Thank you for an interesting overview.
However, I'm not worried directly about DoS. I just want to build a
regex library which would be convenient to use for parsing regular
languages (by providing applicative interface and Perl semantics), and
not worse than alternatives performance-wise
rt of off-by-one? Does anyone see a
> better (i.e. working) way to formulate my grammar? Any and all help
> would be greatly appreciated. Thanks.
>
> Cheers,
>
> - Ben
>
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/m
* Hideyuki Tanaka [2011-09-29 04:53:59+0900]
> Hello, all.
>
> I have released 'Peggy' a new parser generator .
> It is based on Parsing Expression Grammer (PEG) [1],
> and generates efficient packrat parsers.
How does it compare to frisby?
http://hackage.haskell.org/package/frisby
An obvious
Hi Cafe,
Does anyone currently work on Test.SmallCheck?
I see the following problems:
1. SC doesn't have a repository, issue tracker etc.
2. It is not integrated with popular test frameworks
3. API should be better documented
I'm willing to work on the above problems, but wanted to check first
* Jason Dusek [2011-11-15 20:08:48+]
> I'm having some trouble with memory usage in rebuilding a
> ByteString with some sequences escaped. I thought I'd try
> vectors. However, it seems that even a relatively simple
> function, one that places all the bytes of a ByteString in to a
> vector, us
* Johan Tibell [2011-11-17 21:09:15-0800]
> Hi all,
>
> I spent some time today documenting a library and the experience left me
> wanting a better markup language. In particular, Haddock lacks:
>
> * markup for bold text: bold text works better than italics for emphasis
> on computer monitors.
* Johan Tibell [2011-11-17 21:21:47-0800]
> Hi all,
>
> Data.Map is getting split into Data.Map.Lazy and Data.Map.Strict (with
> Data.Map re-exporting the lazy API). I want to better document the
> strictness properties of the two new modules. Right now the
> documentation for Data.Map.Strict rea
* Johan Tibell [2011-11-18 08:06:29-0800]
> On Fri, Nov 18, 2011 at 12:09 AM, Roman Cheplyaka wrote:
> > Is it mentioned anywhere that Map is spine-strict?
>
> It's not and we should probably mention it.
Hm. Perhaps I'm missing something, but
data Map k a =
* Brandon Allbery [2011-11-18 12:20:33-0500]
> On Fri, Nov 18, 2011 at 12:16, Roman Cheplyaka wrote:
>
> > * Johan Tibell [2011-11-18 08:06:29-0800]
> > > On Fri, Nov 18, 2011 at 12:09 AM, Roman Cheplyaka
> > wrote:
> > > > Is it mentioned anywhere that
Following the recent discussion on Haskell-Cafe, I've taken over maintainership
of SmallCheck.
This is to announce a new minor release, SmallCheck 0.5. It fixes build on GHC
7.2
and makes a few cosmetic changes.
http://hackage.haskell.org/package/smallcheck-0.5
In the future there will be m
* Paterson, Ross [2011-12-06 09:09:36+]
> Shakthi Kannan writes:
> > So, how would I know if there is a new package in it, other than
> > having to compare it to the previous snapshot? Does the filename
> > (00-index.tar.gz) change?
>
> The filename doesn't change. You could use the RSS feed
* Jose A. Ortega Ruiz [2011-12-11 08:43:01+0100]
> On Sun, Dec 11 2011, Brandon Allbery wrote:
>
> [...]
>
> > xmobar currently requires parsec 3.x; the above is the symptom of
> > building it against 2.x.
>
> Aha, thanks for pointing this out, guys.
>
> Peter, would using parsec 3.x be an acc
I'm pleased to announce a new release of SmallCheck.
The highlights for this release are:
* Default Generic implementation of Serial instance, contributed by Bas van Dijk
This means that you don't need to write instances by hand for your types
to generate test values for them. See [1]
* Alexander Solla [2011-12-19 19:10:32-0800]
> * Documentation that discourages thinking about bottom as a 'value'. It's
> not a value, and that is what defines it.
In denotational semantics, every well-formed term in the language must
have a value. So, what is a value of "fix id"?
--
Roman I.
401 - 420 of 420 matches
Mail list logo
