1 (specifically, the second image)
62
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, 2009-03-09 at 10:08 +, Sebastian Sylvan wrote:
> But the point 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.
You'll also want to rank the popular ones even if you don'
the existing machine at Yale.
I don't know when anyone will have a new machine.
This is an overview of which machine does what:
http://haskell.org/haskellwiki/Haskell.org_domain
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.o
f2 = "Hello"} in x
f1d :: Int
f1d = field1 d
Annoyingly, GHC objects to the "field1 d" application.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ile to [[Image:TMR-Issue13.pdf]].
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
modified after being cast.
Probably I'll be the one to update most appearances on haskell.org once
we have a winner, though I think the logo appears in a number of places
around the web.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell
ttp://hackage.haskell.org/cgi-bin/hackage-scripts/package/witness
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/open-witness
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Martijn van Steenbergen wrote:
Ashley Yakeley wrote:
Have a look at these:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/witness
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/open-witness
Ah, nice! It seems most we came up with is already in there. Even Any
which I
an update of the machine
from an old Red Hat distro (RHEL AS release 3 update 9) to something a
bit more modern, like Debian 5.0 or Ubuntu Server 9.04.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
be.
Basically, someone was creating thousands of accounts automatically. It
seems likely this will happen again.
Another solution would be to sysop a few users to
admin/bureaucrat, so that even if a few are inactive or away, the rest
can handle requests.
What would the process be?
--
Ash
not been officially decided on,
I just picked the same colours as the Haskell Platform logo. So for the
time being, there is a visual link between the two logos.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
Magnus Therning wrote:
Philippa Cowderoy wrote:
On Mon, 2009-06-15 at 13:52 -0400, Gwern Branwen wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
On Mon, Jun 15, 2009 at 1:18 PM, Ashley Yakeley wrote:
For requesting accounts: who would receive the email, and which person
would create
which machine does
what.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ic kinds, I'd be able to do it easily;
unfortunately, it doesn't have them.
I think the "type families" extension can do this.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ounds.
Actually, you can use type families without using classes or instances
at all.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Maurício wrote:
Maybe OpenID could help with spam problems without
the need for manual intervention:
http://www.mediawiki.org/wiki/Extension:OpenID
Nope, can't install it on this version.
http://haskell.org/haskellwiki/Special:Version
--
Ashley Ya
I wrote:
OK, so who wants to create accounts? What are your haskell.org usernames?
Anyone else? Gwern? Philippa?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
particle titles, so the
first character cannot be a lower-case letter (actually, it will get
folded to upper-case). But spaces are OK.
If you want to let people know that you can do this for them, add your
email address here:
http://haskell.org/haskellwiki/HaskellWiki:New_acc
I wrote:
Rules for usernames are the same as rules for particle titles,
erm, article titles
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
x. But if you want to check out Apple's IDE,
you'll really need a 68K Mac, as the PPC version is very buggy and I
don't think the 68K version will run in PPC.
--
Ashley Yakeley
Seattle, WA
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/pipermail/haskell-cafe/2007-May/025791.html>.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
instance
of Eq has a == a = True.
There really are two different notions of equality here. Perhaps they
should be given two different names in the language?
--
Ashley Yakeley
Seattle, WA
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
; of GPH. This
isn't referentially transparent, of course, but maybe it could be
written in the IO monad:
nondet p q = unsafePerformIO (getnondet p q)
getnondet :: a -> a -> IO a
--
Ashley Yakeley, Seattle WA
___
Haskell-Cafe mailing li
with some
other type in it, they wouldn't be able to.
This doesn't really help you now, but extending Haskell with open types
and functions would solve this...
http://www.informatik.uni-bonn.de/~loeh/OpenDatatypes.pdf
http://haskell.org/haskellwiki/Extensible_datatypes
--
Ashl
Aaron Denney wrote:
I know of no good way to express that a given data type obeys the
same interface two (or more) ways.
The best approach here is to use data structures instead of classes:
data Monoid a = MkMonoid
{
monoidNull :: a,
monoidFunc :: a -> a -> a
}
--
Ashley Y
/Haskell.org says that Ashley Yakeley
<[EMAIL PROTECTED]> supports new haskell wiki
Yep. Email me or leave a comment on my talk page:
http://haskell.org/haskellwiki/User_talk:Ashley_Y
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
s and
really should be two different classes. See
<http://haskell.org/haskellwiki/MonadPlus>.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Michael Shulman wrote:
Ah, excellent. So it sounds like at least in Haskell prime, I'll
probably be able to use MonadPlus to do what I want, because MaybeT
and ErrorT will be instances of MonadOr instead.
I'm not sure if this is part of Haskell Prime, though.
--
Ashl
On the other hand, Maybe and Either cannot. The key seems to be in only
having one "form", i.e. no "|"s in the definition. Does this class
actually have a use, or is it merely a curiosity?
--
Ashley Yakeley
Seattle WA
___
Haskel
t Hoistables (Maybe and Either, for instance).
(Also I think "Idiom" is a better class name than "Applicative".)
--
Ashley Yakeley
Seattle WA
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
re not Hoistables (Maybe and Either, for instance).
Ah, that's not correct, not all Hoistables are Idioms. For instance,
this type can be made an instance of Hoistable but not of Idiom:
data Extra a = MkExtra Int a
--
Ashley Yakeley
Seattle WA
__
class name than "Applicative".)
Me too! Can you tell Ross and Conor? I've tried...
Hey Ross, Conor, "Idiom" is a better name than "Applicative". Pretty
much everyone thinks so.
*
I don't subscribe to haskell-cafe, so apparent
easier.
It's an instance of Num etc. (as seconds).
--
Ashley Yakeley
Seattle WA
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
type variables are of course implicitly qualified "forall".
In an ideal world, where compatibility with 98 were not an issue, they
would be "unknown" and we wouldn't need an "unknown" keyword. But it's
not
tance)?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Since learning Haskell, I can now count in Spanish! See:
"one" in Spanish,
"two" in Spanish,
"three" in Spanish,
"four" in Spanish..
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@ha
them to a more local
tee-shirt printer than CafePress then let me know and I will email the
SVG files.
Paul.
Come the revolution, comrade, all the imperative functions will be executed.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@h
Don Stewart wrote:
* Arch now has 609 Haskell packages in AUR.
Have you thought about doing this for Ubuntu? If you know how to
automatically generate packages, you could set up a PPA (private package
archive) on Launchpad.
--
Ashley Yakeley
o
{
MkEqualType <- matchWitness (lensWitness lens1) (lensWitness lens2);
return (lensPut lens2 b (lensGet lens1 b));
};
(Actually, I'm doing something a bit more useful than get1put2.)
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
You can blank the page but you cannot delete it. I'll delete the pages
and block the user/IP address later today.
-- Ashley
On Fri, 2008-12-05 at 15:37 +, Duncan Coutts wrote:
> Who is able to delete wiki spam?
>
> http://haskell.org/haskellwiki/?title=Special:Contributions&target=Tomso123
ght that the current and most of the
proposed Haskell logos do not: they don't make any reference to the
syntax of the language itself. Doing so seems to miss the point of a
logo: it's supposed to appeal visually, rather than semantically. So I'd
like to see some submissions that
George Pollard wrote:
This is why I like Cale's mountain (which incorporates a sneaky
lambda ;P). A mountain peak/summit/apex also has nice connotations!
http://haskell.org/haskellwiki/Haskell_logos/New_logo_ideas#Cale_Gibbard
I think it would be better without the lambda. In fact, many of the
running Debian 4.0 (like both monk and nun). I'm not sure how much this
can be done gradually.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t/UTC" timezone (and much other useful information).
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
19620101.txt. Probably looks
> more complicated than necessary but I'm parsing the file anyway for
> other purposes.
With tz, though, you could discover the table at run-time and so be more
likely to be up to date.
--
Ashley Yakeley
___
Haske
d type `Sub' against inferred type `Super'
When matching `(?x::Bool) => Int'
and `Int'
Expected type: Sub -> p
Inferred type: Super -> p
In the expression: sp
In either case, if cast1a compiles, shouldn't cast1b compile?
--
Ashley Y
ially an interface to the zoneinfo database rather than
time functionality as such. Ideally there would be a better C interface
to zoneinfo that wouldn't involve mucking around with (global)
environment variables.
--
Ashley Yakeley
Seattle, WA
_
<- matchWitness wb1 wb2
return MkEqualType
matchWitness _ _ = Nothing
Now whenever you match some value with MkEqualType, the compiler will
infer the identity of the two types. See my "witness" package:
http://hackage.haskell.org/cgi-bin/hac
just looks a bit "left-biased", that's
all.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Data.Fixed (in base) has been updated with Data instances in HEAD. When
that's released, I'll release time-extra that will contain Data
instances. I've got it all ready to go.
The reason Data instances are in time-extras is that the time library
must be Haskell 98, while Data instances require Ran
urn . ab)
-- f1 fab fa = fab >>= (\ab -> fmap ab fa)
-- (return a) >>= p = p a
-- (fa >>= p) >>= q = fa >>= (\a -> p a >>= q)
What are good names for C1, C2 and f1?
--
Ashley Yakeley, Seattle WA
nce Sub1 x => Sup x where
> op3 _ = True
>
> instance Sub2 x => Sup x where
> op3 _ = False
Try this:
class Sup a where
op3 :: a -> Bool
class (Sup a) => Sub1 a where
op1 :: a -> a
class (Sup a) => Sub2 a where
op2 :: a -> a
David Roundy wrote:
Hello all,
I have a question about how to create the right kind to declare lists to be
a class. I have a class Foo
class Foo f where
foo :: f a -> Foo
and I want to define that a list of Foos is also a Foo, but can't see how
to do it. I imagine something like
instance
In article <[EMAIL PROTECTED]>,
David Roundy <[EMAIL PROTECTED]> wrote:
> On Thu, Dec 22, 2005 at 06:27:41PM -0800, Ashley Yakeley wrote:
> > David Roundy wrote:
> > >Hello all,
> > >
> > >I have a question about how to create the right kind to d
goal here is to be closer
to the machine.
Trouble comes when you try to aggregate, however; one would need kinds
that represent 8-byte values consisting of four bytes of data and four
bytes of pointer, and so on.
--
Ashley Yakeley, Seattle WA
___
Haskell-C
Johannes Ahlmann wrote:
an alternative would be geshi (http://qbnz.com/highlighter/) for which a
mediawiki plugin also exists
(http://meta.wikimedia.org/wiki/GeSHiHighlight), but it says on the
geshi site "GeSHi supports PHP5 and Windows". and i'm not clear whether
they mean it _also_ supports t
e. The third might not be too hard. It's not
clear how to do the others, however. I should hate to discover that a
bug in my implementation was accidentally causing it to behave as a
secure distributed HTTP-addressable digital media semanti
Now we just need the Godot version, in which nothing happens twice.
You may have to wait for that.
--
Ashley Yakeley
Seattle WA
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and also Lexifi, though it appears to be written in OCaml:
http://homepages.inf.ed.ac.uk/wadler/realworld/lexifi.html
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
"GADT" rhymes with "cat". The "d" is silent, like the Danish "godt", or
the German "Stadt", or the American trademark "Bundt".
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe
(at least in Afrikaans). It lends itself well to being
uttered contemptuously.
Who thinks GADTs are unnecessary, and why?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Peter Gavin wrote:
Gtk2Hs version 0.9.13 is now available. [1]
New features:
* bindings for Gnome VFS and GStreamer
Is this bindings for the new GIO/GVFS stuff?
Is Gtk2Hs cabal-ised?
-- Ashley
___
Haskell-Cafe mailing list
Haskell-Cafe@haske
o apt. I couldn't get up2date to work.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Duncan Coutts wrote:
This topic came up in #haskell this evening...
On Sun, 2008-08-24 at 16:12 -0700, Ashley Yakeley wrote:
1. Global mutable state. For instance, here's the count variable for
Data.Unique rewritten:
uniqSource :: MVar Integer
uniqSource <- newMVarTL 0
Isn
he base
library used. Does the segfault "happen in Haskell" or not?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-case hack. There's a better way.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Brandon S. Allbery KF8NH wrote:
typeOf / Typeable is itself an ugly special case,
Right.
> and really should be designed into the language
That's not necessary. The same thing can be done with top-level "<-"
(see other thread)
John Meacham wrote:
... if ACIO is well defined which I think it is.
Affine: ma >> mb = mb
Central:
do {a <- ma;b <- mb;return (a,b)} = do {b <- mb;a <- ma;return (a,b)}
...for some concept of "=".
Is this correct? Are there any other constraints?
___
Adrian Hey wrote:
Maybe it would be safest to just say anything with a finaliser can't be
created at the top level.
Do you have an example of something that is correctly ACIO to create,
but has a problematic finaliser?
--
Ashley Ya
open exceptions I mentioned originally), since there are pure
functions that do useful things with them.
Not sure about TVars either, which operate in the STM monad. Would you
also need a oneshotSTM (or a class)?
--
Ashley Yakeley
___
Haskell-Ca
dTVar uniqueVar
writeTVar uniqueVar (n+1)
return n
AFAICT, one-shots are less powerful and just as complicated as an ACIO
monad.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Lennart Augustsson wrote:
No hardware drivers use global variables.
No problem, write your hardware drivers in a different monad. Thus IO is
the type for code that can use global variables, and H (or whatever) is
the type for code that must not.
--
Ashley Yakeley
e in which values
from newUnique are supposed to be different, and it would also be the
scope in which top-level <- would be called at most once.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
allow both the best of both worlds, as we could have a monad
that one couldn't create global variables for, and a monad for which one
could.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Paul Johnson wrote:
This is a strange question, I know, but is there anyone working in any
of the above companies on this mailing list?
Everyone will no doubt be wondering what they have in common. I'm
afraid I can't discuss that.
Air Traffic Control?
--
Ashl
rate calls to
newIORef, it's about how many times an individual <- will be executed.
Two IO executions are in the same "global scope" if their resulting
values can be used in the same expression. Top-level <- declarations
must execute at
Ashley Yakeley wrote:
I don't really follow this. Do you mean the minimal such scope, or the
maximal such scope? The problem here is not about separate calls to
newIORef, it's about how many times an individual <- will be executed.
Two IO executions are in the same "glob
ata.Unique?
Implementing them on IORefs seems ugly. Or should they just be a
primitive of the platform, like IORefs themselves?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
t Eq, as it happens. That
gives you process scope for free,
Isn't this rather ugly, though? We're using IORefs for something that
doesn't involve reading or writing to them. Shouldn't there be a more
general mechanism?
--
Ashley Yakeley
e process scope.
If we have a concept of "process scope", how is it hard to implement?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ganesh Sittampalam wrote:
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
Ganesh Sittampalam wrote:
This seems fine to me. It's based on something that already does work
properly across a process scope,
But you agree that IORefs define a concept of "process scope"?
I'
he new shared space is really only one more issue.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
niques and thunks cannot be shared
between them; and each would have its own top-level scope, even though
they're in the same process.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ganesh Sittampalam wrote:
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
OK. Let's call it "top-level scope". Haskell naturally defines such a
thing, regardless of processes and processors. Each top-level <- would
run at most once in top-level scope.
If you had two Haskell
ystem of open exceptions for
IO, with an IOWitness value for each exception type, witnessing to the
data that the exception carries.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ot;bar"
exception, both of which carry an Int. Rather than create new Foo and
Bar types, I can just create a new witness for each.
Or if I want, I can create a dictionary of heterogeneous items, with
IOWitness values as keys. Then I can do a top-level <- to declare keys
in this dictionar
ly creating different dummy types so
that we can have different TypeRep values, which act as witnesses. It's
the TypeReps that actually do the work.
It would be much cleaner to declare the witnesses directly.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
lugins duplicates that MVar, that's a bug in
hs-plugins. It's up to a dynamic loader to get initialisation code correct.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Menendez wrote:
Isn't that what we have right now? Typeable gives you a TypeRep, which
can be compared for equality. All the introspection stuff is in Data.
Oh, yes, you're right.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Ha
then Unique values would
have the same type and could be compared.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Menendez wrote:
On Wed, Sep 3, 2008 at 2:53 AM, Ashley Yakeley <[EMAIL PROTECTED]> wrote:
It's worth mentioning that the current Data.Unique is part of the standard
base library, while hs-plugins is rather experimental. Currently Data.Unique
uses the "NOINLINE unsafePe
should be a valid transformation on any module.
So if I dynamically load module M that uses base, I will in fact get a
completely new and incompatible version of Maybe, IO, [], Bool, Char
etc. in all the type-signatures of M?
--
Ashley Yakeley
___
Haskell
memory, for a start. We already know that
hs-plugins won't for modules it already loaded itself (apparently it
crashes the RTS), and I suspect it doesn't at all.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
x27;s dynamic linker,
which does single object loading. GHC also performs the necessary
linking of new objects into the running process."
<http://www.cse.unsw.edu.au/~dons/hs-plugins/hs-plugins-Z-H-2.html#node_sec_4>
--
Ashley Yakeley
___
Ha
the module.
Oh dear. To fix this, I suppose the RTS would have to be able to keep
track of all static initialisers. But it shouldn't otherwise affect
program optimisation.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@h
sers would
have to be marked in object files, so the RTS could link them separately
when dynamically loading. The RTS would also keep a list of initialisers
in the main program.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskel
as once the newtype is boiled away, the code is
basically dealing with Integers, not Uniques.
I really don't know enough about the RTS to know. The alternative would
be to keep all initialised values when the module is unloaded. I'm
guessing this is m
Sittampalam, Ganesh wrote:
Ashley Yakeley wrote:
I really don't know enough about the RTS to know. The
alternative would be to keep all initialised values
when the module is unloaded. I'm guessing this is more
feasible.
Easier, but a guaranteed memory leak.
But it's
y way to get a continuous leak is to load and unload an
endless stream of _different_ modules, each with their own initialisers.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ve to be some way to specify how to apply the flag to
dependencies as well.
In general I'm way beyond my knowledge of the RTS, so I may have
something Very Wrong here. I don't think hs-plugins implements unloading
at all currently.
--
Ashley Yakeley
__
1 - 100 of 303 matches
Mail list logo
