, and can this actually be done?)
--
Aaron Denney
--
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
program runs.
Er, no. The handles can be considered as the same but _pointing_ to
different things on different runs. Keeping them outside the IO monad,
and only accessing them inside -- i.e. the current situation -- would be
fine.
They're not mutable in any sense.
--
Aaron Denney
On 2004-11-23, Benjamin Franksen [EMAIL PROTECTED] wrote:
On Tuesday 23 November 2004 00:10, Aaron Denney wrote:
On 2004-11-22, Benjamin Franksen [EMAIL PROTECTED] wrote:
On Monday 22 November 2004 09:38, Adrian Hey wrote:
You have yet to
explain how you propose to deal with stdout etc
not exported from that module.
Reasonable advice.
I still think there should be some clever way to do this using lazy
evaluation, but it's not at all clear how.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org
.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
its community.
That's a side benefit. When darcs is appropriate for a project,
it is so so much nicer than CVS.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
reason. Possibly for the summer: the Caltech
academic year resumes in September. (I don't know why he didn't
put it up on of the clusters available there -- ITS probably has
enough quota, and I'm sure UGCS would be willing to up his quota
accordingly.)
--
Aaron Denney
the libgmp3 from
stable.
apt-get install libgmp3/stable #or grab it and install it with dpkg
apt-get install ghc6
That might work?
It should, but I have other packages that depend on a newer
version of libgmp3. Well, I've held off on upgrading them,
because of this.
--
Aaron Denney
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
).
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
it. Further, it is likely that
whatever is done to extend the type checker could be given a general
interface, which Monad would simply take advantage of, using a
meta-declaration in the same spirit as infixr etc.
Well, monads are already treated specially -- the whole do syntax.
--
Aaron Denney
functions that are not really about that.
I am not sure how this would work, but it strikes me as useful.
Anything like that in the offing?
Monads. Implicit parameters can be thought of as co-monad.
--
Aaron Denney
--
___
Haskell mailing list
is that I haven't checked any of
the tools or libraries, as I haven't used any of them.
(Mozilla 1.7.12, debian package)
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On 2006-01-12, Malcolm Wallace [EMAIL PROTECTED] wrote:
However, it also needs a disclaimer of warranty,
Agreed, agreed, agreed.
I'd prefer to find a prewritten license that covers this, of course.
--
Aaron Denney
--
___
Haskell mailing list
, you can throw in at
least one negative digit, and things just work.
I really should write up and post my example of that using balanced base
three on the wiki.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org
are just ordinary functions or general
interfaces in a more expressive programming language.
Right. I'd call haskell's typeclasses excellent language support for
formalizing and truly taking advantage of design patterns where
appropriate.
--
Aaron Denney
Disclaimer: I haven't looked at the code yet.
Having binary I/O on top seems backwards. Clearly text should be
implemented in terms of binary, rather than the reverse.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http
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
On 2006-06-08, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello
I released Streams library version 0.1e. Changes are:
- Fixed bug: openFD name WriteMode don't truncated files on unixes
How's about adding an AppendMode that doesn't truncate, but leaving
WriteMode as truncating?
--
Aaron
, actually.
For actual usability as a primary shell, I'd want that reversed --
running commands is what shells do. Adding easy access to haskell
functions on top would be great.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http
,
This is the one semi-useful thing. Of course, what you end up with is
another not-so-useful forum.
--
Aaron Denney
--
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
as well,
as I noticed in mk/config.mk that the GHCi enabling section did this.
It only seemed to end up with extra -ldl flags though.
I see on the mailing list reports of other problems that look like
libgcc.a not getting linked in. Here's another datapoint.
--
Aaron Denney
-prime/wiki/ForeignFunctionInterface
I added a note about these types. Any other ISO C types that we should
include?
complex foo.
--
Aaron Denney
--
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
quite workable.
c. instead of grafting, we add language support to allow importing
modules from a particular package (crucically, you don't have
to specify the version).
The package still needs to be located somehow, and I don't like this
split between tools and language.
--
Aaron
unconvincing to me.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
a program.
Parallelism is a strategy for exploiting that structuring (and others).
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
constructors to be imported unqualified and the rest to be imported
qualified.
import qualified Foo
unqualify1 = Foo.unqualify1
unqualify2 = Foo.unqualify2
...
(That is, this is already pretty easy to do.)
--
Aaron Denney
--
___
Haskell-prime mailing list
.
This is a wart I would really like to see get fixed.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
fromEnum/toEnum to
go through Integer, else fail.
Where I suppose defined must mean defined in this module. Hmm. That's
kind of ugly. I can see why these were combined, but it's still really
ugly.
Steppable might be a better name.
Comments anyone?
--
Aaron Denney
On 2006-03-18, Jim Apple [EMAIL PROTECTED] wrote:
On 3/18/06, Aaron Denney [EMAIL PROTECTED] wrote:
Rational _could_ be added here by the diagonal representation, but
probably sohuldn't.
We could also add an actual enumeration of rationals, as in
http://web.comlab.ox.ac.uk/oucl/work
On 2006-03-18, Aaron Denney [EMAIL PROTECTED] wrote:
class ArithmeticSequence a where
stepFrom :: a - [a]-- [n..]
stepFromBy:: a - a - [a] -- [n,n'..]
stepFromTo:: a - a - [a] -- [n..m]
stepFromByTo :: a - a - a - [a] -- [n,n'..m]
Whoops
needs to be standardized so that it will
work the same on different implementations.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
representation that deriving Enum
currently
uses.
It seems that succ and pred are unused.
No, I use them. In my opinion, it makes much more sense to write succ n than
n + 1.
Agreed, for non-arithmetical types.
--
Aaron Denney
--
___
Haskell
, not _easy_, but the difficulties are understood.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
that such a blocking foreign call _should_not_
block progress of other Haskell threads. The thread-nature of the
foreign call is blocking. The Haskell-API nature is desired to be
non-blocking.
*glyph of enlightenment*.
Ah, no wonder a lot of the discussion and docs didn't seem to make sense.
--
Aaron Denney
on
details of the class system, as well.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell-prime
problem to safe: it reads
as an instruction to the implementation, rather than a declaration by the
programmer of the properties of a particular function; as Wolfgang put it,
this function might spend a lot of time in foreign lands.
I'd like to second this.
--
Aaron Denney
-prime/wiki/ForeignFunctionInterface
I added a note about these types. Any other ISO C types that we should
include?
complex foo.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://haskell.org/mailman/listinfo/haskell
when the delayed material is out-of-line.
Meh. I'd really like a revised numeric prelude to be able to use MPTCs
with FDs.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org//mailman/listinfo/haskell
for the rest of us
too!) end in a type error, not a successful compilation, so arguably the
quality of error messages when a type-check fails is more important than
which programs compile.
Right, like I said, we need to work on better error messages.
--
Aaron Denney
.
They take away valuable space that can be used for informative messages.
If you want to filter it out, don't do it by hand, that's what computers
are for.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org
On 2006-09-02, Philippa Cowderoy [EMAIL PROTECTED] wrote:
On Sat, 2 Sep 2006, Aaron Denney wrote:
On 2006-09-02, Philippa Cowderoy [EMAIL PROTECTED] wrote:
On Sat, 2 Sep 2006, isaac jones wrote:
On Tue, 2006-08-29 at 14:04 +0200, Christophe Poucet wrote:
Hello,
Just a small
On 2006-10-26, Jon Fairbairn [EMAIL PROTECTED] wrote:
On 2006-10-25 at 20:57- Aaron Denney wrote:
On 2006-10-25, Jon Fairbairn [EMAIL PROTECTED] wrote:
No. A small alteration to the lexical syntax for the sake of
improved readability seems perfectly justifiable as long as
it doesn't
fromEnuw (succ x) = 1 + fromEnum x
and similar things.
That's a pretty strong argument that all types should obey that.
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
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
the change.
Surely we don't expect the majority of Haskell code to work unchanged as
Haskell' code?
--
Aaron Denney
--
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
are not Haskell experts, and
it would be rather hard to explain to them that they needed to
go through it all and fix it.
What makes them need to update to Haskell' instead of sticking with
Haskell '98?
--
Aaron Denney
--
___
Haskell-prime mailing list
On 2008-04-30, Ross Paterson [EMAIL PROTECTED] wrote:
On Thu, Apr 24, 2008 at 08:18:10PM +, Aaron Denney wrote:
And there is a lot that clearly isn't battle tested in a reasonable new
form, though the current practice is widely agreed upon to be broken.
Examples include all monads having
don't think recipe is a good analogy for, say, the List monad, reader
monads, etc.)
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(const [True, False])
powerset. Very nice use of the list monad.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
define the function without foldr but that misses
the point of the exercise.
Folds replace the cons operator (:) with the function you pass it.
If you want the tail of the list, you want what is on the right hand
side of every cons (unless that's []).
--
Aaron Denney
(Quoting reformatted. Try to have your responses below what you are
responding to. It makes it easier to read as a conversation.)
On 2007-08-14, Alexteslin [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
Folds replace the cons operator (:) with the function you pass it.
If you want the tail
sure you can't use one of
those other folds ?
The problem with foldl is that you can't easily make it polymorphic
because of how the null case is handled. foldl1 and foldr1 are trivial,
true.
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell
On 2007-08-14, Chaddaï Fouché [EMAIL PROTECTED] wrote:
2007/8/14, Aaron Denney [EMAIL PROTECTED]:
The problem with foldl is that you can't easily make it polymorphic
because of how the null case is handled. foldl1 and foldr1 are trivial,
true.
The original last fail on empty list, it's far
On 2007-08-15, Chaddaï Fouché [EMAIL PROTECTED] wrote:
Still I don't see why foldl would make it harder to use Maybe than
foldr (in fact it's easier).
You're right. I just wasn't looking at it quite properly.
--
Aaron Denney
--
___
Haskell-Cafe
and linear
functions of vectors. That has implications about its transformation
properties, and anything with those transformation properties can be
used as a tensor, but this formulation gives the flexibility to say what
happens when you're using different bases for different slots.
--
Aaron
at compile time, right?
--
Aaron Denney
--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2007-08-16, Kim-Ee Yeoh [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
On 2007-08-15, Pekka Karjalainen [EMAIL PROTECTED] wrote:
A little style issue here on the side, if I may. You don't need to use
(++) to join multiline string literals.
text = If you want to have multiline string
the same. _ simply means a new unique name.
Or is it primarily to indicate to the coder that xs is useless?
Yes
And to the compiler that the name won't be used, so it needn't warn you
about not using it.
--
Aaron Denney
--
___
Haskell-Cafe mailing
, 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
--
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
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
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
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
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
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
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
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
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
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
, 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
implementations.
--
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
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
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
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
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
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
:: (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
, 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
, 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
?
--
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
1 - 100 of 245 matches
Mail list logo
