apfelmus wrote:
Janis Voigtlaender wrote:
when searching through gmane, and selecting a single message with a
hit, one gets only to see that message without its context thread. At
least I could not find out a way to switch from the found message to
the thread in which it occurred.
The
Hi
domain, source --- are the two different things? I'm sure I read
somewhere that the source \subseteq domain in mappings. The same was
said about range and target -- target \subseteq range.
Any ideas?
Thanks, Paul
___
Haskell-Cafe mailing list
Janis Voigtlaender wrote:
apfelmus wrote:
The subject line is a hyperlink that points to the context thread of
the message (which is displayed with frames).
only in the case of haskell.cafe, but not for haskell.general. (see
my response to Calvin Smith on the cafe list)
Actually, in
Stefan O'Rear wrote:
On Wed, Feb 06, 2008 at 08:57:43PM +, Andrew Butterfield wrote:
In Clean, we not only have explicit access to the world, but
we can partition it. Simplifying somewhat, we could open up
pairs of file-handle (f1.in,f1.out), (f2.in,f2,out) ... (fn.in,fn.out),
which does
http://www.anygma.com/ Anygma is a startup company focusing on generating
easy-to-use tools for creating audio-visual 2D/3D content, in the area of
entertainment, media, corporate communication and the internet.
http://www.anygma.com/ Anygma has recently raised new capital in order to
fund the
On 15 Feb 2008, [EMAIL PROTECTED] wrote:
On Thu, 14 Feb 2008, Jed Brown wrote:
Hopefully these are mature enough to be generally useful. I would
appreciate any comments regarding the interface. The FFTW API is not
particularly nice for building a pure interface on.
because FFTW stores
Yes, I suspect you are right. I didn't look into that in much detail,
although I did try exchanging (2 ^ 5000) with (1 `shiftL` 5000);
but that didn't make any difference.
Uwe
On Fri, Feb 15, 2008 at 9:21 AM, Ryan Ingram [EMAIL PROTECTED] wrote:
On Thu, Feb 14, 2008 at 8:23 PM, Uwe
On Thu, Feb 14, 2008 at 8:23 PM, Uwe Hollerbach [EMAIL PROTECTED] wrote:
Stefan's routine is, as expected, much much faster still: I tested the
first two routines on numbers with 5 million or so bits and they took
~20 seconds of CPU time, whereas I tested Stefan's routine with
numbers with
Since no one else has replied, I will take a stab. This is the
terminology I have seen/heard:
A mapping in a category is typed. It can map only from a source object
to a target object. There may be zero, one, or multiple such mappings
(functions) from a given source to a given target (but at
On Thu, 14 Feb 2008, [EMAIL PROTECTED] wrote:
As I understand the original problem had less to do with the number of
comparison but more to do with the cost of a single comparison. In an
impure language, we can use constant-time physical equality. It is
usually provided natively as pointer
On 15 Feb 2008, [EMAIL PROTECTED] wrote:
On Fri, 15 Feb 2008, Jed Brown wrote:
On 15 Feb 2008, [EMAIL PROTECTED] wrote:
On Thu, 14 Feb 2008, Jed Brown wrote:
Hopefully these are mature enough to be generally useful. I would
appreciate any comments regarding the interface. The
On Feb 15, 2008, at 1:15 PM, Tony Finch wrote:
On Thu, 14 Feb 2008, [EMAIL PROTECTED] wrote:
As I understand the original problem had less to do with the number
of
comparison but more to do with the cost of a single comparison. In an
impure language, we can use constant-time physical
On Fri, 15 Feb 2008, Jed Brown wrote:
On 15 Feb 2008, [EMAIL PROTECTED] wrote:
On Thu, 14 Feb 2008, Jed Brown wrote:
Hopefully these are mature enough to be generally useful. I would
appreciate any comments regarding the interface. The FFTW API is not
particularly nice for building a
To clarify the distinction between domain/corange as I understand common
usage:
For a total function, the domain and corange are equal. In the category
of sets, all functions are total (by definition of a function). If we
generalize to the category of CPOs by associating with every set an
[moved to haskell-cafe]
Hmm, there's a problem here. Since type functions are open, it's not
actually true that (forall ts. Cat ts () = ts), because someone could
add, for example
type instance Cat [a] () = [(a,a)]
which makes the lemma no longer true.
What you are doing in cat_nil is not
How unfortunate that I didn't see your announcement before, as I have
just accepted a job with another company.
However, I have added your company to the Haskell in Industry page on
the Haskell wiki.
http://haskell.org/haskellwiki/Haskell_in_industry
Please add a paragraph describing your
Hello,
I get an error message on the code below with GHC. I can't figure out how
to get rid of the error. I'd appreciate suggestions on how to fix this.
(BTW, the code may look overly combersome because I stripped out anything
unnecessary to demonstrate the error.)
{-# OPTIONS_GHC
(sent to the list this time)
The problem is in the type-signature for from_seq:
from_seq :: (Sequence seq) = (seq e) - (t e)
Neither the From_seq class or the type signature of the from_seq
function place any restrictions on the type of e, so the type can be
rewritten as:
from_seq :: forall e
18 matches
Mail list logo
