I think the generics approach really is overkill here, but it's nice to
know the generics library.
For option processing Tomasz Ziolonka described a nice technique
in the post I refered to. You can find the post in the archives at
http://www.haskell.org//pipermail/haskell/2004-January/013412.html
FINAL CALL FOR PAPERS
--
Third International Conference on
Generative Programming and Component Engineering (GPCE'04)
Vancouver, October 24-28, 2004
Hi,
with the boilerplate style one can build terms while exploring permutations.
This can accommodated as a generic program.
An illustrative code snippet follows.
Let's define a function that builds a datum "a" while reading constructor
strings via a monad. Hence the function is of the following t
On Tue, 24 Feb 2004 07:18:58 -0800 (PST), Hal Daume III <[EMAIL PROTECTED]>
wrote:
>just as another sample point...
>
>i write 99% of my code in either haskell or perl. haskell tends to be for
>the longer programs, perl tends to be for the shorter ones, though the
>decision is primarily made fo
At 01:41 08/03/04 -0800, JP Bernardy wrote:
I propose to add a modified version of DData to the
hierachical libraries.
I support the proposal in principle, though I don't feel qualified to
comment on the specific modifications.
#g
Graham Klyne
For email:
http://www.ninebynine.org/#C
> So my question is, is there any method in GHC which allows you to
> extract the order of the constructors in a type or to parse a
> type-representation in such a way that the order of the records doesn't
> matter (I am looking for ease/simplicity of use)?
If you happen to use Parsec for parsing
I am currently trying to implement a method of allowing arbitrary record
syntax data-types to be converted to and from an XML representation of
them using the Read and Show class;
i.e. simply derive either Show and then parse the given String to
extract the name/value pairs which can then be conv
On Mon, Mar 08, 2004 at 12:32:21PM +0100, Christian Maeder wrote:
> Yes, I support this proposal.
So do I.
> Maybe the documentation to the "0rdered lists" section can be improved.
>
> Set.toAscList is not really necessary as it is the same as Set.toList.
> In order to be a proper function, the
JP Bernardy wrote:
http://users.skynet.be/jyp/DData/doc/index.html
I only looked at Set and Map
Any comment is welcome. (Including "I support this
proposal" :))
Yes, I support this proposal.
Maybe the documentation to the "0rdered lists" section can be improved.
Set.toAscList is not really neces
> At 08:09 04/03/04 +, Stenio wrote:
> >
> >
> >GHC executable file only works in MS-DOS. I would like run the executable
> >file on Windows. Can someone help me
> >Thanks
Did you write a GUI program and each time you double click your program gets
started out of a DOS window? If that is the
Dear haskellers,
I propose to add a modified version of DData to the
hierachical libraries.
DData is a concrete library of collection types, by
Daan Leijen.
My modifications intend to make DData fit better in
the hierarchical libraries.
The haddock-generated documentation can be found here:
htt
11 matches
Mail list logo
