At 16:38 17/10/03 -0700, Brandon Michael Moore wrote:
The suggestion of a types that specialize to/unify with this type search
would be really useful.
My main interest in Haskell is as a scripting language for semantic web
applications (cf [1] et seq). Your comment suggests a possible
I'm pretty sure this is sequence.
Brandon
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
I've constructed a listProduct function that I think I've seen somewhere
else... is it a standard function? If so, where is it defined?
My code is:
[[
-- |Given a list of lists, construct a new list of lists where
-- each member of the new list is the same length as the original
-- list, and
On Wed, 15 Oct 2003 17:07:00 +0100
Graham Klyne [EMAIL PROTECTED] wrote:
[[
lp [] = [[]]
lp (as:ass) = concatMap (\a - (map (a:) (lp ass))) as
]]
I think I should also be able to eliminate the lambda-abstraction, but
I can't see how. I prefer the list comprehension, as I find that
On Wednesday 15 October 2003 11:07 am, Graham Klyne wrote:
I've constructed a listProduct function that I think I've seen somewhere
else... is it a standard function? If so, where is it defined?
Yes. It's called sequence. It's defined in the prelude.
It works with arbitrary monads, not just
