On Tue, Mar 06, 2007 at 10:19:12PM +, David House wrote:
On 06/03/07, Nicolas Frisby [EMAIL PROTECTED] wrote:
Composition with (.) builds a function, but you eventually want an
Int, so we can't just use (.), but we can come pretty close.
(sum . IntMap.elems . IntMap.IntersectionWith (\x
F, FD, FC, AT, SPJ ;) WTH does it mean?
On Wed, Mar 07, 2007 at 10:12:11AM +0100, [EMAIL PROTECTED] wrote:
Claus Reinke wrote:
ps. i was somewhat shocked to read that SPJ wants FDs gone.
Why? Simon has good taste. :)
de gustibus non est disputandum ;)
FD have uses and problems
Hello,
I would like to inform you that i am currently working on a tool
that transforms a Document Type Definition to a library.
The resulting library contains combinators that assure proper nesting
of elements to some extend. I am planning to add more constraints, that
will also take care of
,
especially if the complexity of your input formats will increase.
mm
I'm guessing print forces f to be evaluated, so the file is actually
read, but I was wondering why it doesn't work without it and how to
correct that.
David.
___
Haskell-Cafe
Brian Hulley wrote:
Yet I'm sure most people who did a computer science degree some decades ago
remember the old joke about passing things by name or value for what it's
Wirth... :-)
Wikipedia says:
“Whereas Europeans generally pronounce my name the right way ('Ni-klows Wirt'),
Americans
Please note that it may be hard to make a
print out of a wikibook. You might want to
use Docbook/XML or Latex in a darcs repo-
sitory instead.
On Mon, Dec 11, 2006 at 03:23:13PM -0500, Matt Revelle wrote:
Sorry, wasn't sure I had clearly expressed that it's possible to have
an open book end up
