On 2006-03-17, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
> Well, there is a way -- it's fairly easy with the right regex -- but
> is it really ambiguous? Do people find it confusing? What do other sites do?
Why not the ISO standard -MM-DD?
--
Aaron Denney
-><-
___
Well, there is a way -- it's fairly easy with the right regex -- but
is it really ambiguous? Do people find it confusing? What do other sites do?
-- Don
jupdike:
> The dates on the feed are in international (non-US) order, i.e. Mar 13
> 2006 = 13/03/2006. Is there a way to make this unambiguous
The dates on the feed are in international (non-US) order, i.e. Mar 13
2006 = 13/03/2006. Is there a way to make this unambiguous by changing
the month to a word instead of a number? Just curious...
Jared.
On 3/16/06, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
> rjmh:
> > >With a view to
rjmh:
> >With a view to this I started collecting just the announcements on a
> >`feed' here:
> > http://www.cse.unsw.edu.au/~dons/code/hwn/announce.html
> >
> >These should serve as a basis for the content, I think.
>
> Can you add an actual date? Seeing things dated a few days ago does
> cont
apply here (and remember to use GHC as a test case;-):
http://www.compilerjobs.com/jobs/sony.php
cheers,
claus
- Original Message -
From: "Mads Lindstrøm" <[EMAIL PROTECTED]>
To:
Sent: Thursday, March 16, 2006 9:22 PM
Subject: [Haskell] The Cell processor and Haskell
Hi all
It is
Hi,
> My knowledge of parallel programming is limited, but I would still like
> to know, what the wiser amongst of us, thinks of making a Haskell
> compiler for the Cell processor. It is not that I consider implementing
> one. It is just that I am curious.
http://www.haskell.org/haskellwiki/Yhc/I
Hi all
It is often claimed that Haskell's referential transparency would make
it an excellent choice for a high-level parallel language. Furthermore,
IBM, Sony, and Toshiba's Cell processor is in great need of a high-level
parallel language. Thus, they seem to be a perfect match.
See http://www.r
General question to the list:
(Q) Are there any data structures in Haskell similar to C++/STL
vectors or C# generic Lists (i.e. strongly typed ArrayLists, e.g.
List)? These data structures grow automatically as you add
elements to them (but in large chunks, not one node at a time). This
data struc
2006/3/15, Paul Johnson <[EMAIL PROTECTED]>:
> "minh thu" <[EMAIL PROTECTED]> wrote:
>
> >2006/3/15, Duncan Coutts <[EMAIL PROTECTED]>:
> >
> >
> >>On Wed, 2006-03-15 at 17:21 +0100, Sebastian Sylvan wrote:
> >>
> >>
> >>>You can also use laziness (untested!):
> >>>
> >>>data DLink a = (DLink a) a
With a view to this I started collecting just the announcements on a
`feed' here:
http://www.cse.unsw.edu.au/~dons/code/hwn/announce.html
These should serve as a basis for the content, I think.
Can you add an actual date? Seeing things dated a few days ago does
contribute to a feelin
10 matches
Mail list logo