On 2010-05-27, aditya siram aditya.si...@gmail.com wrote:
Monstro
I'm going to call it that from now on. Stay out of the IO Monstro.
Monstro is Show (think demonstrate), not Monad.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe
locale to choose encoding.
Then clearly curl should not return Strings, but byte arrays. Of
course, curl can very well look at the headers which in this case do
specify UTF-8, and so perhaps it should do the translation itself.
--
Aaron Denney
Simon's phrase. And again, not entirely bad.
I despair that a better Numeric hierarchy will never make it into
Haskell.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, that may not be the case. But for accepted physics models,
time really is continous.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
concept is a bad idea for complex
projects (it bit my group of 4 developers time after time).
There are far far more vile version control systems than CVS out there.
I'll say to beware of InterCapped product names, and leave it at that.
--
Aaron Denney
support the proper
abstractions we want them to support, we need to define the algebraic
structures as well. So the rework goes together...
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
(CComplex CDouble) with this scheme. I think
having direct access at this level requires modifying the compiler. The
FFI spec really does need to be updated to C99.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
, for binding to FFTW:
-
-- |
-- Module : CComplex
-- Copyright : (c) Aaron Denney 2004
-- License : BSD, 2-clause
--
-- Maintainer : wnoise-hask...@ofb.net
-- Stability : experimental
-- Portability : FFI
behaviour once floating point enters the room.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that that's essentially what
Prolog is too, it shouldn't be surprising that you can express quite
a lot with the type system.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not strictly
necessary. OTOH, a decimal separator is necessary. As the comma's not
usable, that leaves us with the decimal point, and no thousands separator.
Lo and behold, that's exactly what Haskell uses.
--
Aaron Denney
--
___
Haskell-Cafe mailing
,
which can explicitly use shared memory when that makes sense.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-09-17, Jonathan Cast [EMAIL PROTECTED] wrote:
On Wed, 2008-09-17 at 18:40 +, Aaron Denney wrote:
On 2008-09-17, Arnar Birgisson [EMAIL PROTECTED] wrote:
Hi Manlio and others,
On Wed, Sep 17, 2008 at 14:58, Manlio Perillo [EMAIL PROTECTED] wrote:
http://www.heise-online.co.uk
Haskell, but abandoned it when I left for
grad school.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
point? This is a standard idiom,
and I don't remember having any trouble with it, but I haven't used
anything earlier than 9. The manpages for 11 only document being a
mount point as cause for EBUSY.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
On 2008-09-17, Arnar Birgisson [EMAIL PROTECTED] wrote:
Hi Aaron,
On Wed, Sep 17, 2008 at 23:20, Aaron Denney [EMAIL PROTECTED] wrote:
I entered the discussion as which model is a workaround for the other
-- someone said processes were a workaround for the lack of good
threading in e.g
On 2008-09-17, Jonathan Cast [EMAIL PROTECTED] wrote:
On Wed, 2008-09-17 at 21:20 +, Aaron Denney wrote:
On 2008-09-17, Jonathan Cast [EMAIL PROTECTED] wrote:
In my mind pooling vs new-creation is only relevant to process vs
thread in the performance aspects.
Say what
, okay. I think that's a real edge case, and probably not how most
use MPI. I've used both threads and MPI; MPI, while cumbersome, never
gave me any hard-to-debug deadlock problems.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe
On 2008-08-30, Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
On 2008 Aug 30, at 4:22, Aaron Denney wrote:
On 2008-08-27, Henrik Nilsson [EMAIL PROTECTED] wrote:
And there are also potential issues with not every legal module name
being a legal file name across all possible file systems
of care in making the source work with multiple revisions of
the standard C implementation.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, what fills its shoes as a great research language with great tools?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with it. If we don't have a real solution, perhaps in this
case we haven't worn the hair shirt long enough?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-08-27, Henrik Nilsson [EMAIL PROTECTED] wrote:
And there are also potential issues with not every legal module name
being a legal file name across all possible file systems.
I find this unconvincing. Broken file systems need to be fixed.
--
Aaron Denney
for Haskell,
because you need the fixities of the operators
(so, another language design error :-)
Yes, but you can partially parse into a list, which later gets
completely parsed. It's not like C with its textual inclusion, and
constructs changing what counts as a type.
--
Aaron Denney
, you're probably doing.)
This is only true if the interface can be tracked separately from the
implementation. Which, despite the flaws, C's header files can be
coaxed into doing.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe
be using the multiply and magnitude functions!
Well, he should continue to use a custom magnitude squared function,
to save the square-rooting.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
fairly interesting history-altering tasks, but as soon as they're used
to construct a new history, they're discarded. (Yes, git uses deltas,
but this is merely an optimization.)
The two models are dual to each other in many ways.
--
Aaron Denney
% there, and then cleanup and record.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This is drifting off-topic, but...
On 2008-06-03, Peter Hercek [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
On 2008-06-03, Peter Hercek [EMAIL PROTECTED] wrote:
Loup Vaillant wrote:
2008/6/3 Darrin Thompson [EMAIL PROTECTED]:
--cut--
What's the appeal of this? I personally love git, but I
positive arises when the filter claims that an
element is present, but in fact it is not.)
/me squints.
Please tell me that this isn't reversible.
Tell me what you mean by reversible. You can't, for instance,
extract the items in the set.
--
Aaron Denney
/dp/0131103628/
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-05-18, Achim Schneider [EMAIL PROTECTED] wrote:
Aaron Denney [EMAIL PROTECTED] wrote:
Go read KR[1]. It shouldn't take more than a week's worth of spare
time.
HELL NO!
There's a reason why my lecturer always refered to it as Knall Rauch
C (Bang and Smoke C).
Get the Harbison
number n should
have value 2^n, byte number n should have value 256^n, and so forth.
Yes, in human to human communication there is value in having the most
significant bit first. Not really true for computer-to-computer
communication.
--
Aaron Denney
for square matrices -- n
gets mapped onto I_d for any dimension d.
fromInteger (n*m) == fromInteger n * fromInteger m
fromInteger (n+m) == fromInteger n + fromInteger m
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
that
nattify = map const ()
(+) xs ys = (++) (nattify xs) (nattify ys)
would be good universal definitions.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
' type (when the
underlying hardware does). so this still isn't quite right.
Well, the whole numeric hierarchy needs to be redone to support proper
mathematical structures like groups, rings, and fields. Once that's
done, this might end up being clarified a bit.
--
Aaron Denney
On 2008-03-15, Conor McBride [EMAIL PROTECTED] wrote:
Hi
On 14 Mar 2008, at 21:39, Aaron Denney wrote:
On 2008-03-14, Conor McBride [EMAIL PROTECTED] wrote:
Hi
On 13 Mar 2008, at 23:33, Aaron Denney wrote:
On 2008-03-13, Conor McBride [EMAIL PROTECTED] wrote:
For a suitable notion
On 2008-03-14, Conor McBride [EMAIL PROTECTED] wrote:
Hi
On 13 Mar 2008, at 23:33, Aaron Denney wrote:
On 2008-03-13, Conor McBride [EMAIL PROTECTED] wrote:
For a suitable notion of = on quotients, and with a
suitable abstraction barrier at least morally in place,
is that really too much
to me to be a case of Well, it's arbitrary,
so we don't guarantee anything but that we did something consistent.
Which seems perfectly reasonable, and not a problem at all.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
of Ord. That's less than useful.
Certainly, for the domain of /just the ordering comparisons/, yes, equal
elements are equal, and cannot be distinguished, but that just means
cannot be distinguished by the provided binary relations.
--
Aaron Denney
of (==) on Ints. But f is specialized to work on Ints, isn't
it, so it's reasonable to know what semantics (==) has for Ints, and
depend on them?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
members thought hard about the code so that Eq a would usually work for
any equivalence class, and others took it to mean observational equality
and wrote prose with this understanding.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe
On 2008-03-13, Adrian Hey [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
so do you really seriously consider the possibility that
this might not hold in your Int related code?
if (x==y) then f x else g x y
might not mean the same as..
if (x==y) then f y else g x y
In Int code, of course
On 2008-03-13, Ketil Malde [EMAIL PROTECTED] wrote:
Aaron Denney [EMAIL PROTECTED] writes:
Well, the way the report specifies that max's default definition
is. I'd actually favor making that not an instance function at
all, and instead have max and min be external functions.
If you permit
have a total ordering, then it's possible two
elements are incomparable -- what should a sort algorithm do in such a
situation?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-03-13, David Menendez [EMAIL PROTECTED] wrote:
On Wed, Mar 12, 2008 at 4:29 PM, Aaron Denney [EMAIL PROTECTED] wrote:
When defining max, yes, you must take care to make sure it useable for
cases when Eq is an equivalence relation, rather than equality.
If you're writing library
only means that the Eq and Ord instances agree, not that
x == y = f x == f y.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-03-12, Adrian Hey [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
On 2008-03-11, Adrian Hey [EMAIL PROTECTED] wrote:
Having tried this approach myself too (with the clone) I can confirm
that *this way lies madness*, so in future I will not be making
any effort to define or respect sane
in Hoogle :-)
How's about modifying hoogle to put up a message asking them before the
normal response?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
usable hardware sets flags on overflow.
Testing on those is pretty cheap. Much cheaper than calling a GMP
routine to compare with 2^32, for instance.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
On 2008-02-05, Alfonso Acosta [EMAIL PROTECTED] wrote:
On Feb 5, 2008 4:10 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Fri, 1 Feb 2008, Aaron Denney wrote:
On 2008-02-01, Bjorn Buckwalter [EMAIL PROTECTED] wrote:
If Naturals had been sufficient for me I wouldn't have done my own
mean there won't be any problems,
but I'd expect the ones that crop up won't *strictly* be because of
the compilers being different, but because of the C libraries being
different. DLL vs object files shouldn't change things all that much.
--
Aaron Denney
.
I did a balanced-base-three (digits are 0, and +- 1) representation to
get negative decimals. Again, for a proof-of-concept dimensional
analysis arithmetic. No problem with the stack, but the error messages
are still less than clear.
--
Aaron Denney
://the.earth.li/~sgtatham/putty/0.60/htmldoc/Chapter8.html#pubkey-gettingready
IIRC, it should look something like
ssh-dss B3NzaCXw== comment-string
So joining the lines into one might be sufficient.
--
Aaron Denney
--
___
Haskell-Cafe mailing
in DNS (Sometimes called an
ICBM record). I think 'xt(raceroute)' uses this.
LOC RR. TXT is freeform.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
you tried comparing Prolog to GHC's multiparameter type-classes?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
language. It does not specify anything about the
implementation's internals.
Neither do most languages.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-12-06, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
list comprehensions deal with specific operations (map, filter, etc.)
of a specific type ([]).
Ah, so we should bring back monad comprehensions?
--
Aaron Denney
--
___
Haskell-Cafe mailing
?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, that windows is unfriendly towards open and working
common standards.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, there are /lots/ of suggestions. Perhaps too many. But this is
one area that could really be improved by the use of ATs or MPTCs with
fundeps, and that's stalled some of the concrete proposals, as what
exactly is happening for Haskell' isn't too clear.
--
Aaron Denney
:: (Word8, Word8, Word8, Word8) - Word32
unpack16into8 :: Word16 - (Word8, Word8)
unpack32into8 :: Word32 - (Word8, Word8, Word8, Word8)
curry the above to taste.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
that exposes the underlying calls, can set them up
easily enough.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to interactively apply bits of code, whether
compiled or not, and I like being able to compile them and get it to go
faster. This would be a step back, for me.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
behavior, either. Linux's mmap() used to support a
DENY_WRITE flag, but it enabled DoS attacks, so it's gone.
It may be that by opening it in write mode you could ensure that noone else
modifies it (although I don't think this would work e.g. on nfs),
It doesn't even work locally.
--
Aaron Denney
instead of IntDiff 0 x. I'd rather one
of the two above, though I think I'd prefer explicity PosInt and NegInt
branches over an inscrutable boolean flag.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
identity is pseudonymous. Pseudonym can be used
as a noun, but it refers strictly to the name itself, and never the
bearer.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. only at
the beginning of a word, not after a =),
This likely the problem, but a reasonable shell (i.e. zsh) will expand in
this circumstance:
% echo --foo=~
--foo=/home/wnoise
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 2007-10-12, Dan Weston [EMAIL PROTECTED] wrote:
applyNtimes f n | n 0 = f . applyNtimes f (n-1)
| otherwise = id
Why not some variant of:
applyNtimes f n = foldl' (.) id (replicate n f)
--
Aaron Denney
--
___
Haskell-Cafe
implementations.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, are
constants of the typeclass Integral a = a,
and 0.0, 1.348, 2.579, 3.7, etc. are in Floating a = a.
So why not pi?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, not the
simultaneously overloaded pi and trig functions.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-10-10, Andrew Coppin [EMAIL PROTECTED] wrote:
(Indeed, the number of times my Haskell programs have locked up due to
me accidentally writing let x = foo x...)
For me, that's small. I have seen useful program not lock up
that depend on let x = foo x though.
--
Aaron Denney
On 2007-10-05, Aaron Denney [EMAIL PROTECTED] wrote:
On 2007-10-05, Peter Verswyvelen [EMAIL PROTECTED] wrote:
But where is the great IDE Haskell deserves??? :-) Seriously, 99% of the
programmers I know don't want to look at it because when they see Emacs
or VIM, they say what the f*ck
feeling cheap, most
people want to trade time for space, not the other way around.
Caches are still limited sizes, and that can make a huge difference for
time.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
on these structures:
Prelude last [1..10^6]
100
(0.06 secs, 40895096 bytes)
Prelude last [1..10^7]
1000
(0.50 secs, 402118492 bytes)
Prelude last [1..10^8]
1
(4.74 secs, 4016449660 bytes)
--
Aaron Denney
--
___
Haskell-Cafe mailing list
of the input list.
Well, any /computable/ total predicate. This distinction isn't
that relevant when we're talking about predicates we might want to
implement and run, but there is a mathematical distinction.
--
Aaron Denney
--
___
Haskell-Cafe mailing
On 2007-09-27, Deborah Goldsmith [EMAIL PROTECTED] wrote:
On Sep 26, 2007, at 11:06 AM, Aaron Denney wrote:
UTF-16 has no advantage over UTF-8 in this respect, because of
surrogate
pairs and combining characters.
Good point.
Well, not so much. As Duncan mentioned, it's a matter of what
to figure out how much screen space a sequence will take? It _is_
an issue.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-09-27, Ross Paterson [EMAIL PROTECTED] wrote:
On Thu, Sep 27, 2007 at 07:26:07AM +, Aaron Denney wrote:
On 2007-09-27, Ross Paterson [EMAIL PROTECTED] wrote:
Combining characters are not an issue here, just the surrogate pairs,
because we're discussing representations
On 2007-09-27, Aaron Denney [EMAIL PROTECTED] wrote:
On 2007-09-27, Deborah Goldsmith [EMAIL PROTECTED] wrote:
On Sep 26, 2007, at 11:06 AM, Aaron Denney wrote:
UTF-16 has no advantage over UTF-8 in this respect, because of
surrogate
pairs and combining characters.
Good point.
Well
On 2007-09-27, Duncan Coutts [EMAIL PROTECTED] wrote:
In message [EMAIL PROTECTED] [EMAIL PROTECTED] writes:
On 2007-09-27, Deborah Goldsmith [EMAIL PROTECTED] wrote:
On Sep 26, 2007, at 11:06 AM, Aaron Denney wrote:
UTF-16 has no advantage over UTF-8 in this respect, because
linkages. The external representations do, and UTF-8 has won on
that front.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-09-26, Johan Tibell [EMAIL PROTECTED] wrote:
On 9/26/07, Aaron Denney [EMAIL PROTECTED] wrote:
On 2007-09-26, Johan Tibell [EMAIL PROTECTED] wrote:
If UTF-16 is what's used by everyone else (how about Java? Python?) I
think that's a strong reason to use it. I don't know Unicode well
On 2007-09-26, Tony Finch [EMAIL PROTECTED] wrote:
On Wed, 26 Sep 2007, Aaron Denney wrote:
It's true that time-wise there are definite issues in finding character
boundaries.
UTF-16 has no advantage over UTF-8 in this respect, because of surrogate
pairs and combining characters.
Good
to be clearer.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-09-25, Andrew Coppin [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
On 2007-09-25, Andrew Coppin [EMAIL PROTECTED] wrote:
BTW, one *extremely* common function that I've never seen mentioned
anywhere is this one:
map2 :: (a - b) - [[a]] - [[b]]
map2 f = map (map f
?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
people to reconstruct
them from their implementations, in other words.
Right. But a list-of-lists isn't a terribly specific domain construct.
When it's used without further semantics, I think map . map is the best
translation of intent.
--
Aaron Denney
languages
go up to at most 2, and on average only a bit above 1. Greek and
Cyrillic are 2 bytes/char. It's really only the Asian, African, Arabic,
etc, that lose space-wise.
It's true that time-wise there are definite issues in finding character
boundaries.
--
Aaron Denney
a lazy natural just a list with no data, where the list
length encodes a number?
That's one particularly simple representation, yes. Lazy Unary.
One can also construct other representations that may be more efficient
in certain situations.
--
Aaron Denney
On Thu, Sep 13, 2007 at 11:07:03AM +0200, Stephane Bortzmeyer wrote:
On Thu, Sep 13, 2007 at 12:23:33AM +,
Aaron Denney [EMAIL PROTECTED] wrote
a message of 76 lines which said:
the characters read and written should correspond to the native
environment notions and encodings
no guarantee that a conforming Haskell
implementation will have them. It'd be silly for an implementation to
not support them, of course, but...
The ByteString library at least fixes (a) and (b).
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell
on the value level.
Meh. I prefer functional languages for general problems, but as
type-checking is a rather specific problem, I don't see why logic
programming isn't more appropriate.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe
(for internal usage
of C libraries), and I do know that John is fairly careful about locale
issues.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
in nice ways to make
extensions easier, precisely because they don't match what a
mathematician would have picked. They are indeed broken.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, but it does seem completely arbitrary that
Words somehow are only allowed to contain whole numbers!
It's more that for floats, there are a zillion plausible ways to store
them, and many have been used.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
1 - 100 of 197 matches
Mail list logo
