to perform in terms of
the inputs, and then do them all in bulk to produce the output image. You
don't want people to go in and arbitrarily set pixels to anything they want
at any time they want.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell
of it for you. You just
write things in terms of parallel arrays (which can be small, e.g. 2 element
wide) and the compiler will fuse/flatten these together into big bulk
parallel computations with communication between them.
--
Sebastian Sylvan
normally be on the other side of the pointer would instead be stored
inline, if I understand him correctly.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
like the notion of using the fact that the language is free to change the
data representation at runtime to improve performance by collapsing an
immutable (recursive) data structure once it's been created. Partly because
it's something that would be harder to do in other languages!
--
Sebastian
On Fri, Mar 26, 2010 at 10:52 PM, Mads Lindstrøm
mads_lindstr...@yahoo.dkwrote:
Hi
On Fri, 2010-03-26 at 21:33 +, Sebastian Sylvan wrote:
Reorganizing data on the fly sounds like it may be a pretty sensible
idea now that cache misses are so bad (in comparison). The fact
on that older
generation, as well as speed up G0 collection). Ideally we'd have some way
of telling the GC to try to avoid running during the actual frame itself,
too, by for example tuning the heap region sizes automatically.
--
Sebastian Sylvan
)
Scheme (R5RS): 17 pages (45 including standard procedures)
Oberon: 16 pages, including table of contents and Appendix (containing EBNF
grammar).
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
because of your ghc version, you can
install a specific version of that library instead. E.g. for haddock you see
that the failing version was 2.4.2 but if you leave out the version number
cabal will fetch the latest one for you, which isn't compatible with GHC
6.10.
--
Sebastian Sylvan
requires that
the expressions to be pure. Currently mainstream languages rely on
programmers being Very Careful, but again these kinds of assumptions aren't
scalable.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Windows Azure could be a good fit too (as it more
directly supports native code than GAE does).
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, rather than intentionally obscure your points to avoid
causing offence. Be specific. What language? How is it different than
Haskell w.r.t. purity?
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
be
madness to write any code which depends on this unpredictable behaviour. In
other words, the expressions that get evaluated lazily must not have side
effects.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
of
Giant Brains among its practitioners. Companies tend to want to hang on to
these, even in a recession.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sense to me there either.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://msdn.microsoft.com/en-us/library/4khtbfyf(VS.80).aspx
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
because there genuinely
isn't a need, or if you tend to avoid writing code in ways which would need
it (ask a Java programmer, and they'll probably tell you that the need for
type classes and closures don't come up very often - which is clearly untrue
for a Haskell programmer).
--
Sebastian Sylvan
, utensils. Being natural or
intuitive is a 100% irrelevant metric for any tool. What matters is if
it's effective or not.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell Platform 2009.2.0.2)?
Line comments start with -- , not just --.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a function that requires extra
invariants can enforce it by using a newtype that's constructed and
manipulated in a way which preserves the extra semantic rules.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
On Thu, Sep 10, 2009 at 10:58 AM, Duncan Coutts duncan.cou...@worc.ox.ac.uk
wrote:
On Wed, 2009-09-09 at 20:19 +0100, Sebastian Sylvan wrote:
On Wed, Sep 9, 2009 at 1:28 PM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
If the Windows users can come to a consensus
culture has some legacy that may, on occasion, make it slightly harder to
use well behaved programs, but it's fairly minor these days.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
be written in a purely functional
style, so you can limit monadic code to just a few helper functions.
Yes I know but there are a lot of problems requiring O(1) array updates
so then you are stuck with IO again
Not necessarily. The ST monad will usually do just as well.
--
Sebastian
/ghc/docs/latest/html/libraries/parsec/Text-ParserCombinators-Parsec.html
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Aug 16, 2009 at 2:50 PM, John A. De Goes j...@n-brain.net wrote:
On Aug 15, 2009, at 5:32 PM, Sebastian Sylvan wrote:
On Sun, Aug 16, 2009 at 12:18 AM, John A. De Goes j...@n-brain.net
wrote:
You must think I'm arguing for some kind of low-level analog of C,
augmented
On Sat, Aug 15, 2009 at 11:54 PM, John A. De Goes j...@n-brain.net wrote:
On Aug 14, 2009, at 9:34 PM, Sebastian Sylvan wrote:
On Sat, Aug 15, 2009 at 3:55 AM, John A. De Goes j...@n-brain.net wrote:
If you don't like the file system, consider mutable memory. An effect
system will tell me I
when you rely on ordering, is no good argument that we should add even more
of it!
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Aug 16, 2009 at 12:18 AM, John A. De Goes j...@n-brain.net wrote:
On Aug 15, 2009, at 4:59 PM, Sebastian Sylvan wrote:
Your point about safety in C has no relation to safety in a functional
language with a sophisticated effect system.
I'm sorry, but I think it does. You're
that
you need to respect, so I really think that needs to be serialized.
Of course, there may be things in the IO monad that doesn't talk to the
outside world that could be commutative.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe
On Sat, Aug 15, 2009 at 3:55 AM, John A. De Goes j...@n-brain.net wrote:
On Aug 14, 2009, at 8:21 PM, Sebastian Sylvan wrote:
But you can't! I can easily envisage a scenario where there's a link
between two pieces of data in two different files, where it's okay if the
data in file
on ordering even if you
don't even realise you need to, and there's plenty of practical experience
indicating that the other option (explicit barriers to indicate when
something isn't commutative) is sheer madness.
--
Sebastian Sylvan
___
Haskell-Cafe
of another file?
Surely to catch that you must mark *all* file system access as
interefering? Even worse, another program could monitor the state of a
file and conditionally disable thet network driver, now file access
interferes with network access.
--
Sebastian Sylvan
about what
kind of assumptions are in effect.
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
work to optimize
concurrency, so it may be worth trying that. In particular I believe
it
executes sparks in batches, to reduce the overhead (which hopefully
fixes
your issue).
--
Sebastian Sylvan
--
Sebastian Sylvan
--
Sebastian Sylvan
believe it
executes sparks in batches, to reduce the overhead (which hopefully fixes
your issue).
--
Sebastian Sylvan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Aug 3, 2009 at 6:38 AM, CK Kashyap ck_kash...@yahoo.com wrote:
Thanks Sebastian,
ppm module is indeed very useful. So, I guess my question then just boils
down to, how can I write a function to mimic the setPixel function -
Basically, a blank white image would look like this (as
quickly so I don' think that's
an issue, other than the effects on speed that the extra allocations would
have. It's probably mainly speed because each pixel would have time
complexity O(n+m) rather than O(1) for an n*m image...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
= withBinaryFile fname WriteMode (\h - hPutStr h (ppm_p6
img) )
If you're looking for the learning experience, you could always read the
source for the library (which is pretty tiny).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing
) for everything except deleteMin which is O(log n)), so if that's what
he means by efficient then he's most definitely wrong. If he's talking
about small constant factors then it's harder to understand what he's
referring to more precisely, and therefore what he means by provably.
--
Sebastian
to understand what he's
referring to more precisely, and therefore what he means by provably.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
, is that things having side effects (such as newStdGen)
can only be used in the context of something else having side effects. So
the IO type is contagious, as soon as you use it in a function, then
that function must also return IO, and so on for anything using *that*
function and son.
--
Sebastian
On Wed, Jun 10, 2009 at 2:08 PM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
randomList :: (RandomGen g) - Int - g - [Integer]
Just spotted this typo, it should be:
randomList :: (RandomGen g) = Int - g - [Integer]
There may be other minor typos as I don't have a compiler handy
On Wed, Jun 10, 2009 at 2:10 PM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
On Wed, Jun 10, 2009 at 2:08 PM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
randomList :: (RandomGen g) - Int - g - [Integer]
Just spotted this typo, it should be:
randomList :: (RandomGen
timeout act fallback = do
res - newEmptyMVar
tid - forkIO $ act = writeMVar res
threadDelay timeout
stillRunning - isEmptyMVar res
if stillRunning then killThread tid return fallback else takeMVar res
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
of `()', namely `return 0'
In the second argument of `timed2', namely
`(wait 5 return 0)'
Right, I forgot about the Either bit so you'd have to make sure the
action's result and the default has the same type (or modify it to return an
Either).
--
Sebastian Sylvan
+44(0
using a state monad
like someone else already mentioned, but honestly I'd try to stay away from
it and stick to a more functional style as far as possible.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe
for any thoughts people might have!
Thanks in advance,
Neil
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
the cumbersome
twiddling with widgets.
http://en.wikipedia.org/wiki/Glade_Interface_Designer
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
it doesn't support HTML? This is pretty arduous...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and the highest one wins. Voting yes on everything
doesn't help since then all your votes cancel out.
You can do that with condorcet by just selecting the ones you approve of and
making them tied for first...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
a) = a - [a] - [a]
Which for prepend x xs will put x at the front of the list, so long as the
first element of the list xs is different from x. Once you have this
function, take a look at the type signature for foldr.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
is that you
shouldn't need to rank every single logo, just the ones you care about and
then you leave the rest at the default rank.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Mar 9, 2009 at 10:52 AM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Sebastian,
Monday, March 9, 2009, 1:08:50 PM, you wrote:
i think we should make 2-stage voting, like in F1
name them 60 a, 60 b etc. to indicate that they are
similar, but there's no reason not to allow people to differentiate between
them if tehy so choose.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe
On Mon, Mar 9, 2009 at 5:26 PM, Luke Palmer lrpal...@gmail.com wrote:
2009/3/9 Sebastian Sylvan sebastian.syl...@gmail.com
On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Sebastian,
Monday, March 9, 2009, 1:08:50 PM, you wrote:
i think we
didn't then I must not care either way.
I suspect 99% will have a few favourites, and then they will have a few that
they object to, and for the rest they just don't care which ones win.
Expressing that with the proposed system is easy.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
On Mon, Mar 9, 2009 at 10:38 PM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
On Mon, Mar 9, 2009 at 10:21 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Sebastian,
Tuesday, March 10, 2009, 1:08:38 AM, you wrote:
It just seems like duplicated work to me. They're
in the allocator/GC that's worsened by having
two threads?
What happens with -O2?
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
example
for implementing a compiler optimization to do it automatically.
Just outputting the precomputed result means nothing.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
. But Don's results *not* obtained by optimizing in this
fashion are valid comparisons, and the results obtained with this
optimization are useful for other reasons.
Louis Wasserman
wasserman.lo...@gmail.com
On Sat, Feb 21, 2009 at 5:55 PM, Sebastian Sylvan
syl...@student.chalmers.se wrote
is doing it).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/haskell-cafe
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell
the problem), don't you think it's odd that it's only
*your* criticism that gets so much flak? Maybe some part of the reason
almost every discussion you're in here usually ends up hostile is *your*
approach?
Regards,
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
and friendly tone in the
future - I would be willing to bet that if you did, you wouldn't get
attacked.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
I was intending to send this privately but clicked the wrong button.
Apologies for adding even more noise to this discussion.
On Sat, Feb 21, 2009 at 12:47 AM, Sebastian Sylvan
syl...@student.chalmers.se wrote:
On Sat, Feb 21, 2009 at 12:16 AM, Bulat Ziganshin
bulat.zigans...@gmail.com
of
the meaning of your program comes from the ordering of statements - which
usually isn't checked at all (aside from scope).
So IMO static typing is good, but it's only with functional programming that
it really shines.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Impossible? Really? How does performance relate to it being possible to
write? I would be surprised if it was indeed impossible to get something
that runs fine one *some* machine.
It may be difficult to beat C, but that doesn't mean it's impossible to
write something useful.
--
Sebastian Sylvan
+44(0
a - CGI a
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
From: Duncan Coutts duncan.cou...@worc.ox.ac.uk
Sent: Sunday, February 01, 2009 2:59 PM
To: Don Stewart d...@galois.com
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] 1,000 packages, so let's build a few!
On Sat, 2009-01-31 at 14:02
--
From: Don Stewart d...@galois.com
Sent: Saturday, January 31, 2009 8:35 PM
To: Andrew Coppin andrewcop...@btinternet.com
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] 1,000 packages, so let's build a few!
andrewcoppin:
In
-expressions-aka-monadic-or-workflow-syntax.aspx
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with MySQL.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
Consider using Contorl.Parallel.Strategies which allows you to spark of
lightweight jobs that get run on a pool of threads.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
The cabal file still includes the vty dependency, but simply removing it
made it compile.
--
From: Simon Michael si...@joyful.com
Sent: Sunday, January 18, 2009 7:04 PM
To: Sebastian Sylvan sebastian.syl...@gmail.com
Cc: hled...@googlegroups.com
Is there some sort of bundle that you can use to install cabal-install
easily? Because it looks to me like I'd have to spend the better part of an
evening manually downloading and installing the gazillion of dependencies it
has, which is far too much work when I just wanted to spend ten minutes
Doesn't work on windows.
--
From: Jeff Wheeler j...@nokrev.com
Sent: Sunday, January 18, 2009 4:27 PM
To: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] runghc Setup.hs doitall
On Sun, 2009-01-18 at 16:22 +, Sebastian Sylvan wrote
I was interested in actually using this for real, but unfortunately it seems
like you have a dependency on the unix package. Would it be possible to use
something portable (specifically to windows) instead?
From: Simon Michael
Sent: Saturday, January 17, 2009 11:42 PM
To:
.
--
From: Simon Michael si...@joyful.com
Sent: Sunday, January 18, 2009 6:08 PM
To: Sebastian Sylvan sebastian.syl...@gmail.com
Cc: hled...@googlegroups.com; haskell-cafe@haskell.org
Subject: Re: ANN: hledger 0.3 released
On 1/18/09 9:39 AM, Sebastian Sylvan
packages that won't build on that OS (by
recursively checking dependencies too).
--
From: Duncan Coutts duncan.cou...@worc.ox.ac.uk
Sent: Sunday, January 18, 2009 6:20 PM
To: Sebastian Sylvan sebastian.syl...@gmail.com
Cc: Jeff Wheeler j
for their fill of papers containing pages of squiggly symbols!).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
others like it so the
votes for that style weren't spread out over multiple entries.
Wikipedia:
http://en.wikipedia.org/wiki/Condorcet_voting
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
because there weren't any others like it
so
the votes for that style weren't spread out over multiple entries.
Wikipedia:
[2]http://en.wikipedia.org/wiki/Condorcet_voting
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
References
Visible links
1
-off
-threaded -fdph-par -package dph-base -Odph -XPArr parr2.hs
-- execution as before
main = print $ [: True | n - [: 1000 .. 5000 :], fac n == 0 :]
That's 4000 items of work there, so surely it should kick off plenty of
sparks to overcome the sparks bug?
--
Sebastian Sylvan
+44(0)7857-300802
UIN
the first GPUs
that did were released.
I think that came with OpenGL 3.0. Unless you're counting vendor-specific
extensions...
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
can not do this in the vertex shader? You really should
avoid trying to touch the vertices with the CPU if at all possible.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
everything would be, well C)
Cheers,
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
programming
language on the face of the Earth calls a dictionary. (This took me a
while!)
So, when did Java leave the face of the earth?
At the same time as C++ presumably. I hadn't really noticed, but I'll be the
first to say: Good riddance!
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
or a label deciding which version of Rule you're
building, and it also has a value of type SgRule.
Now you can create a list or Rule like so:
mylist :: [Rule]
mylist = [ MkSgRule mysgrule, MkGcRule mygcrule ]
where mysgrule :: SgRule and mygcrule :: GcRule.
--
Sebastian Sylvan
+44(0)7857
are blocking),
then set up two classes that shuffles values from the same two mailboxes in
the opposite direction?
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
, or very low concurrency).
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
situations where you need it, and a general
purpose language had better supply a way of accessing those kinds of
facilities.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
that ties into a nice IDE), and I do think this should be a
priority, but even then they wouldn't need to be used nearly as often as for
C/C++.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
that (in particular, it can do some things
in-place) and will be significantly extended in the future.
(moving to cafe)
Is there any more (easily-digested, like a paper) information available
about this? Specifically what things can happen in-place, and future
extensions...
--
Sebastian
.
--
Sebastian Sylvan
+44(0)7857-300802
UIN: 44640862
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
On Mon, 9 Jun 2008, Sebastian Sylvan wrote:
Another BIG reason: It's impossible to export a whole hierarchy qualified.
I.e it would be neat if the user could write:
import Graphics.UI.Gtk
And then have Gtk re-export sub-modules
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
On Sat, 14 Jun 2008, Sebastian Sylvan wrote:
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
The problem would be again that no one knows, where Window comes from.
Better would be
I really don't see how this is a big
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
On Sat, 14 Jun 2008, Sebastian Sylvan wrote:
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
On Sat, 14 Jun 2008, Sebastian Sylvan wrote:
On 6/14/08, Henning Thielemann [EMAIL PROTECTED] wrote:
The problem would
1 - 100 of 403 matches
Mail list logo
