Version 2.7.0 was uploaded to hackage.
From the CHANGELOG:
Version 2.7.0
Improvement: change of error correction at end of amb (which deals with
ambiguous parsers) combinator; available lookahead is better taken into account
Relatively large change:
• Change to Data.ListLike inputs,
On Sun, May 31, 2009 at 7:21 PM, Ross Paterson r...@soi.city.ac.uk wrote:
Perhaps we should make some and many methods of Alternative, * and *
methods of Applicative and $ a method of Functor, all with the current
definitions as defaults. (John Meacham was also asking for the first
of
On Mon, Jun 01, 2009 at 08:27:05PM +0200, S. Doaitse Swierstra wrote:
And rename empty to fail? You managed to confuse me since I always
use pSucceed to recognise the empty string.
That would clash with the existing and widely used fail. One could
view empty as the parser for the empty
And rename empty to fail? You managed to confuse me since I always
use pSucceed to recognise the empty string.
Doaitse
On 1 jun 2009, at 01:21, Ross Paterson wrote:
On Sun, May 31, 2009 at 09:40:38PM +0200, S. Doaitse Swierstra wrote:
A new version of the uu-parsinglib has been uploaded
A new version of the uu-parsinglib has been uploaded to hackage. It is
now based on Control.Applicative where possible.
Be warned that functions like some and many will be redefined in the
future.
Doaitse Swierstra
___
Haskell-Cafe mailing list
On 31 May 2009, at 20:40, S. Doaitse Swierstra wrote:
A new version of the uu-parsinglib has been uploaded to hackage. It
is now based on Control.Applicative where possible.
It's mutual.
Cheers
Conor
___
Haskell-Cafe mailing list
On Sun, May 31, 2009 at 09:40:38PM +0200, S. Doaitse Swierstra wrote:
A new version of the uu-parsinglib has been uploaded to hackage. It is
now based on Control.Applicative where possible.
Be warned that functions like some and many will be redefined in the
future.
Perhaps we should
