On 2010-05-27, aditya siram 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
-><-
___
Haske
ccess, to borrow 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
curl knows nothing about encoding and convert one byte to one Char
> and
> getFile uses new IO which uses system locale to choose encoding.
Then clearly curl should not return Strings, but byte arrays. Of
course, curl can very well look at the h
pplicable, 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
;s client workspace 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,
he 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/listinfo/haskell-cafe
through CPtr (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-Caf
x27;CComplex' type using
> unboxed types and other things already available?
Yes, because the C standard guarantees that a complex is
stored as [2].
I have been using the following, for binding to FFTW:
---
int where
adjacent floating point values are now 2 apart. You basically can't
depend on any nice 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
for type-inference, because it's
essentially what type-inference is. Given 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
-><-
___
On 2008-09-17, Jonathan Cast <[EMAIL PROTECTED]> wrote:
> On Wed, 2008-09-17 at 21:20 +0000, 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
>> >> thr
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
the system or
another process and the implementation considers this an error."
Did HPUX's behavior change at some point? This is a standard idiom,
and I don't remember having any trouble with it, but I haven't used
anythi
modeling CSP-based
hardware designs. In my spare time I started writing a compiler from
our HDL to Concurrent 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
On 2008-09-17, Jonathan Cast <[EMAIL PROTECTED]> wrote:
> On Wed, 2008-09-17 at 18:40 +0000, Aaron Denney wrote:
>> On 2008-09-17, Arnar Birgisson <[EMAIL PROTECTED]> wrote:
>> > Hi Manlio and others,
>> >
>> > On Wed, Sep 17, 2008 at 14:58, Manli
hon sacrifies this for
> performance, it has nothing to do with the language itself.
Huh. I see multi-threading as a workaround for expensive processes,
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
this.
While a thousands separator can improve readability, it's 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
up except when you're doing something like MPI where you
> are pretty much forced to assume that the same (pure!) computation has
> the same effect on each node.
Ah, okay. I think that's a real edge case, and probably not
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
>>> bein
ood enough. This of course requires a
small bit 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
ard documentation, testing, debugging and
> packaging tools, and large community.
>
> And a community with a lot of energy.
>
> We're serious about this thing.
So, 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
l inclusion, and
constructs changing what counts as a type.
--
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.
--
else.
> It would be nice if compilers would offer, as an optional alternative,
> a system of locating modules based on manifest files.
> That would then allow multiple modules per source file.
And simplify supporting recursive modules...
--
Aaron Denney
-><-
E pragma hack, we can claim it was never supported
and do away 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
use
> you're deep in development, 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
-><-
__
add. Didn't seem worth the change.
>
> You would also 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
-><-
_
ld merge some parts from next into master so as to advance the
> point where master and next fork.
That's one solution. Of course, darcs doesn't have semantic dependency,
but syntactic dependency. (You can add extra dependencies to
model semantic dependencies, but you can't take away the syntactic
dependencies.) Another solution, if there's syntactic,
but not semantic dependencies, is to manually use patch and diff to get
90% there, and then cleanup and record.
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
nd wacky ways. It has an "integral"
view of software development, the changes are lazily derived from the
saved state at each point, and are strictly ordered even when they're
independent. It can, when needed, work with these changes to accomplish
fairly interesting history
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]>:
&g
ebase". Of course there is a question
> how good practice it is ... but it is being used.
Darcs patches are pretty much an implicit rebase.
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
but has a tunable false positive
>> rate. (A false 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 "reversib
On 2008-05-18, Achim Schneider <[EMAIL PROTECTED]> wrote:
> Aaron Denney <[EMAIL PROTECTED]> wrote:
>
>> Go read K&R[1]. It shouldn't take more than a week's worth of spare
>> time.
>>
> HELL NO!
>
> There's a reason why my lectur
ll,
1998
http://www.amazon.com/Programming-Language-Prentice-Hall-Software/dp/0131103628/
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2008-05-13, Andrew Coppin <[EMAIL PROTECTED]> wrote:
> Aaron Denney wrote:
>> On 2008-05-12, Andrew Coppin <[EMAIL PROTECTED]> wrote:
>>
>>> (Stupid little-endian nonsense... mutter mutter...)
>>>
>>
>> I used to be a big-en
vel or higher,
making the internal labels fairly arbitrary. It matters and can cause
confusion in actual serial protocols, of course, which have been making
a resurgence in recent years, though again, the bit order in these are
well understood. Just possibly wrong.
--
Aaron Denney
-><-
e. The point was that for big-endian, the word size
> won't matter. Little-endian words will be reversed with respect to
> the normal (left-to-right, most significant first) way we print
> numbers.
Right. Because we print numbers backwards.
--
Aaron Denney
-><-
e way to go, as bit 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
aterThan [] _ = True
noGreaterThan _ [] = False
noGreaterThan (_:as) (_:bs) = noGreaterThan as bs
are perfectly reasonable, but it's less clear 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
rgument terribly
> compelling, but it is there anyway.
Just a nit, but 3 seems to make perfect sense 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
->&
ncomplete type 'struct
> mq_attr'
> compiling dist/build/System/Posix/MQueue_hsc_make.c failed
> comma
This looks as if only a "struct mq_attr;" definition is found, which
lets opaque types be defined in C -- only pointers to it may be
allocated by the compiler, no
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
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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:
>&g
e"
semantic equality, and no interesting data structures can be made
instances 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
ca
hanks. All of these seem 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
-><-
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 abstr
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, rathe
ht.
> Ord (total ordering) is way too strong a requirement
> for sorting. Antisymmetry isn't needed for sorting
> and isn't possessed by OrdWrap. A bit more structure
> for order-related classes would surely help here.
Say what? If I don't have a total ordering, then i
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
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
>>>
>>> mig
you to write code
(b) it's harder for others to interoperate with your code and use it.
Generally, you're the one that gets to make this trade off, because
you're writing the code. Whether someone else uses your code, or
others', or writes their own is th
ght not mean the same as..
>
> if (x==y) then f y else g x y
In Int code, of course not, because I know the types, and I know the
behaviour 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 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
; that *this way lies madness*, so in future I will not be making
> any effort to define or respect "sane", unambiguous and stable behaviour
> for "insane" Eq/Ord instances for any lib I produce or hack on. Instead
> I will be aiming for correctness and optimal efficien
them it got modified to
> include them. Because they are a new addition, they got tacked on
> lightly, which is why keywords actually have a module in Hoogle :-)
How's about modifying hoogle to put up a message asking them before the
normal response?
--
Aaron Denney
-><-
__
he checking I am talking about is done by the hardware at machine speeds
>> and provides *certainty* that overflow did not occur.
>
> So you advocate using different hardware?
At a minimum, any usable hardware sets flags on overflow.
Testing on those is pretty cheap. Much cheaper than c
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]> wro
ids this incompatibility
Well, the whole purpose of the ABI is to allow linking code together
from different compilers. This doesn't 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 be
messages
> from a decimal representation.
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 st
documentation.
http://the.earth.li/~sgtatham/putty/0.60/htmldoc/Chapter8.html#puttygen-savepub
http://the.earth.li/~sgtatham/putty/0.60/htmldoc/Chapter8.html#puttygen-pastekey
http://the.earth.li/~sgtatham/putty/0.60/htmldoc/Chapter8.html#pubkey-gettingre
s | grep Country
>
> Some also have location in the TXT field 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 care about (e.g. whatever the hell consciousness
> is) do not use these non-classical correlations then you can create a
> simplified
> model that avoids the complexity of quantum theory.
Right.
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
; that neither is imperative.
Have 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
C ABI.
> "Haskell" is a declarative 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
-><-
__
; | Branch (BTree a) a (BTree a)
be better?
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
lly* stuck!
I'd say, rather, 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
or at best, not very well chosen), but
> nobody came up with a better suggestion yet.
Oh, 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
eally the wrong signatures:
pack8into16 :: (Word8, Word8) -> Word16
pack8into32 :: (Word8, Word8, Word8, Word8) -> Word32
unpack16into8 :: Word16 -> (Word8, Word8)
unpack32into8 :: Word32 -> (Word8, Word8, Word8, Word8)
curry the above to taste.
--
Aaron Denney
-><-
___
n't set them up. C programs,
or anything else 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
; source code interpreter; I submit this would be the least surprising
> thing to do.
>
> When it loads dependent modules, I think it can safely load the .o/.hi
> versions as it does now if they exist, since we don't expect full symbol
> table access there.
I _like_ being
ld 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
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, sometimes not. I don't think it makes too much difference
here though. My actual concern is about having to compute with IntDiff
(large) (large + x) many times 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
>http://mathworld.wolfram.com/
And planetmath:
http://planetmath.org/
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ver used as noun, solely an adjective.
Further, maintaining the same identity but not revealing the
corresponding legal identity is "pseudonymous". Pseudonym can be used
as a noun, but it refers strictly to the name itself, and never the
bearer.
--
Aaron Denney
-><-
_
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
-><-
_
t; understood by shells, and only in certain circumstances (i.e. 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
-><-
nverting between (<=) and compare, not actual
algorithmic implementations, which can pull in strongly less efficient
implementations.
--
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.
ts are the issue, 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
efined, and it doesn't kill people who use exponentials.
As I said above, it effectively is. And, after all, 1, 2, 3, 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
-><-
___
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
pictures as symbols and values, as in DrScheme.
Or as in Mathematica 6, to be a bit more mainstream.
> Or UNICODE fonts.
GHC already supports UTF-8. Vim and Emacs already support UTF-8. Done.
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
);" would be
reporting 40. The run-time system is essentially constructing all of
these Integers (and functions returning them) at one point or another,
and these need to be represented.
Compare with "last" on these structures:
Prelude> last [1.
this during GC to improve
>> sharing.
>
> Not rocket science at all, but relatively expensive. A time/space
> tradeoff. And these days, with memory and disks feeling cheap, most
> people want to trade time for space, not the other way around.
Caches are still limited sizes, and th
rent magic relies on the fact that any total predicate over
> (total) bool streams, i.e.
>
> p :: [Bool] -> Bool
>
> can only inspect a _finite_ prefix of the input list.
Well, any /computable/ total predicate. This distinction isn't
that re
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:
>> >>>
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
>>>>
On 2007-09-27, Ross Paterson <[EMAIL PROTECTED]> wrote:
> On Thu, Sep 27, 2007 at 07:26:07AM +0000, Aaron Denney wrote:
>> On 2007-09-27, Ross Paterson <[EMAIL PROTECTED]> wrote:
>> > Combining characters are not an issue here, just the surrogate pairs,
ice-versa? Never
want 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, 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.
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 surr
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
>> &g
er except in the case of making
FFI 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
UTF-8. Most European 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
boundar
as recently mentioned.
> Name domain constructs rather than expecting 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,
ment functions as the first
argument to (.). Are you sure your failed attempts weren't of this
form?
--
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:
>&
for it, when (map . map)
is likely to be clearer.
--
Aaron Denney
-><-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
over the code (or
>> write it yourself - its not hard!)
>>
>
> Um... isn't 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 const
1 - 100 of 209 matches
Mail list logo
