populated it AFAIK.
Have a look at the right/UTC timezone, I think leap-second data is
represented there. But zdump right/UTC does not give you the TAI time.
Quite the opposite, it gives you the UTC time if your clock is set to
TAI.
--
Ashley Yakeley
it should be possible to create a
Data.Time.Clock.TAI.LeapSecondTable from it.
Also, it might be worth creating an OS-specific package that dealt with
the filepaths for you, so for instance you could read in a
TimeZoneSeries given a time zone name such as America/Los_Angeles.
--
Ashley Yakeley
-01-30
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the C lib behaviour for consistency. In C, %m
means %0m in strftime and %-m in strptime. I decided to make it
%0m consistently. Also, at least in glibc, the %# modifier does not
consistently convert to lower case. In Data.Time it does.
--
Ashley Yakeley
, 2010 at 6:37 PM, Ashley Yakeley ash...@semantic.org
wrote:
Ketil Malde wrote:
Do we also want to modify equality for lazy
bytestrings, where equality
is currently independent of chunk segmentation? (I.e
rocon...@theorem.ca wrote:
As ski noted on #haskell we probably want to extend this to work on
Compact types and not just Finite types
instance (Compact a, Eq b) = Eq (a - b) where ...
For example (Int - Bool) is a perfectly fine Compact set that isn't
finite and (Int - Bool) - Int has a
Ketil Malde wrote:
Do we also want to modify equality for lazy bytestrings, where equality
is currently independent of chunk segmentation? (I.e.
toChunks s1 == toChunks s2 == s1 == s2
but not vice versa.)
Why is toChunks exposed?
--
Ashley Yakeley
I wrote:
class Compact a where
After reading Luke Palmer's message I'm thinking this might not be the
best name.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
If it ever becomes not V, it's a partial value. If it ever becomes a
singleton, it's a complete value.
On the other hand, this approach may not help with strict vs. non-strict
functions.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe
(if it's the same NaN). But this might surprise people expecting
IEEE equality, which is probably almost everyone using Float or Double.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
)
(Either (Three c f i)
(Either (Three a e i)
(Either (Three c e g)
)))
Player 2 wins, I think.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2010-04-15 17:39, Dan Piponi wrote:
In the service of readability we could also define:
data X = X
data O
In that case we'd want
type Three a b c = (a,b,c)
...which is simpler than my GADT.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
. One can nevertheless make them instances of Bounded with
undefined bounds, and have enumFrom and friends always return the empty
list.
It seems one should also be able to write
instance (Bounded a,Enum a) = Traversable (a - b) where ???
But this turns out to be curiously hard.
--
Ashley
On Wed, 2010-04-14 at 16:11 +1000, Ivan Miljenovic wrote:
but the only way you can prove it in
Haskell is by comparing the values for the entire domain (which gets
computationally expensive)...
It's not expensive if the domain is, for instance, Bool.
--
Ashley Yakeley
[] _ = undefined
instance Finite () where
allValues = [()]
data Nothing
instance Finite Nothing where
allValues = []
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
considering bottom to be a value, one would have to
distinguish different ones. For instance, (error ABC) vs. (error
PQR). Obviously this is not finite.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Ketil Malde wrote:
Another practical consideration is that checking a function taking a
simple Int parameter for equality would mean 2^65 function evaluations.
I think function equality would be too much of a black hole to be
worth it.
Oh FFS, _don't do that_.
--
Ashley Yakeley
type.
For this reason I recommend fast and loose reasoning:
http://www.cs.nott.ac.uk/~nad/publications/danielsson-et-al-popl2006.html
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Maciej Piechotka wrote:
I guess that the fact that:
- It is costly.
No, it's not. Evaluating equality for Bool - Int does not take
significantly longer than for its isomorph (Int,Int). The latter has
an Eq instance, so why doesn't the former?
--
Ashley Yakeley
Thomas Davie wrote:
Because we consider that the Functor laws must hold for all values in the type
(including bottom).
This is not so for IO, which is an instance of Functor. fmap id
undefined is not bottom.
--
Ashley Yakeley
___
Haskell-Cafe
On Wed, 2010-04-14 at 09:29 +0100, Thomas Davie wrote:
It isn't?
fPrelude fmap id (undefined :: IO ())
*** Exception: Prelude.undefined
ghci is helpfully running the IO action for you. Try this:
seq (fmap id (undefined :: IO ())) not bottom
--
Ashley Yakeley
fine.
Of course, sometimes we may want to add _additional_ information
concerning bottom, such as strictness.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
on. They're very useful.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, so it doesn't need to evaluate it. g waits
forever trying to evaluate its function, not knowing it doesn't need it.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ivan Lazar Miljenovic wrote:
Ashley Yakeley ash...@semantic.org writes:
On Wed, 2010-04-14 at 16:11 +1000, Ivan Miljenovic wrote:
but the only way you can prove it in
Haskell is by comparing the values for the entire domain (which gets
computationally expensive)...
It's not expensive
On 2010-04-14 03:41, rocon...@theorem.ca wrote:
For example (Int - Bool) is a perfectly fine Compact set that isn't
finite
Did you mean Integer - Bool? Int - Bool is finite, but large.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe
On 2010-04-14 11:12, John Meacham wrote:
On Wed, Apr 14, 2010 at 02:07:52AM -0700, Ashley Yakeley wrote:
So the facts that
(1) f == g
(2) f undefined = 6
(3) g undefined = undefined
is not a problem?
This is not a problem. f and g represent the same moral function, they
are just implemented
values, because your calculation would never terminate (or similar
condition).
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2010-04-14 13:31, Alexander Solla wrote:
And yet you are trying to recover the semantics of comparing bottoms.
No, I don't think so.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
, or are the Eq instances for Float and
Double broken?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2010-04-14 14:58, Ashley Yakeley wrote:
On 2010-04-14 13:59, rocon...@theorem.ca wrote:
There is some notion of value, let's call it proper value, such that
bottom is not one.
In other words bottom is not a proper value.
Define a proper value to be a value x such that x == x.
So neither
to return pseudo-non-termination,
that's what you get.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
will reach cpphs - in a choice between -traditional and -ansi, it is
the last one on the cpphs commandline that will take effect.
This worked in my .cabal file:
cpp-options: --cpp -ansi
ghc-options: -pgmPcpphs
Thanks!
--
Ashley Yakeley
expressions, types and top-level declarations.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Alexandru Scvortov wrote:
I'm thinking of writing a library for
analyzing/generating/manipulating JVM
bytecode. To be clear, this library would allow one to load and work with JVM
classfiles; it wouldn't be a compiler, interpretor or a GHC backend.
You might be interested in
languages, a function of
return type void may either terminate or not, exactly like Haskell's ().
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ashley Yakeley wrote:
Edward Kmett wrote:
Of course, you can argue that we already look at products and
coproducts through fuzzy lenses that don't see the extra bottom, and
that it is close enough to view () as Unit and Unit as Void, or go so
far as to unify Unit and Void, even though one
.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
undefined.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Christopher Done wrote:
On 28 March 2010 22:54, Don Stewart d...@galois.com wrote:
This looks great!
What are the implementation details of having this go live?
* Ashley: would you be able to e.g. install an index.html like this,
and hang the wiki under it?
* How do we allow
Christopher Done wrote:
On 28 March 2010 23:32, Ashley Yakeley ash...@semantic.org wrote:
There was a big competition for the logo, with this blind Condorcet voting
and everything, and this is the shape that was picked. But it kind of ran
out of steam before colours were decided upon. So I just
-io-support/
How do you pack Unicode codepoints into Word16? Do you use UTF-16?
Supposing -
s = \x010A60\x010A61 -- Old South Arabian script
t = pack s
Is (unpack t) the same as s? What is (length t)?
--
Ashley Yakeley
___
Haskell-Cafe mailing
Cetin Sert wrote:
http://corsis.sourceforge.net/img/csharp-6.png
http://corsis.sourceforge.net/img/csharp-6.pngo__O!?
That's just C# string literals. In Haskell, '\x010A60' '\x010A61', but
in C#, '\x010A' '6' '0' '\x010A' '6' '1'.
--
Ashley Yakeley
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
, that's
all.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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/hackage-scripts/package/witness
--
Ashley Yakeley
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
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 Yakeley
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
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_accounts
--
Ashley Yakeley
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.haskell.org/mailman/listinfo/haskell
machine does
what.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
;
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
.
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
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?
--
Ashley
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
/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
be 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-Cafe
]].
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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.org
http://www.haskell.org
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
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't like them.
--
Ashley
, the second image)
62
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
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
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 don't use lambdas.
--
Ashley Yakeley
Seattle, WA
___
Haskell-Cafe mailing list
Haskell
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
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:Contributionstarget=Tomso123
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
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
.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Witnesses
http://semantic.org/stuff/Open-Witnesses.pdf
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Vlad Skvortsov wrote:
Also, how do I demangle the names? It seems that, for example,
'base:GHC.Base.ZC' is a (:) function on strings, but where how am I
supposed to figure that out?
#!/usr/bin/perl
# Written by Ashley Yakeley 2003
# All rights to the public
while ()
{
s/_/ /g
-in would cause
a memory leak, I would avoid doing so; but since the whole point of -
is to avoid making the need for some state visible in the API.
The results from the - in M will only be stored once for the life of
the RTS, no matter how many times your plug-ins are reloaded.
--
Ashley
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
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
___
Haskell-Cafe mailing list
Haskell-Cafe
.
That what will happen?
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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 more feasible.
--
Ashley Yakeley
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 limited
.
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@haskell.org
http
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@haskell.org
http
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
Haskell-Cafe
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 unsafePerformIO hack to create
that it 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
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
,
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
___
Haskell-Cafe mailing list
Haskell-Cafe
.
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
carries.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
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 dictionary. Now I've got OOP objects.
--
Ashley Yakeley
___
Haskell-Cafe mailing list
Haskell
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 runtimes call by C code
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
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?
--
Ashley Yakeley
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 most once in this scope.
--
Ashley Yakeley
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 global scope
?
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
. 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
___
Haskell-Cafe mailing list
Haskell
1 - 100 of 254 matches
Mail list logo
