On Wed, 15 Mar 2000 10:27:56 + (GMT), you uttered:
It would be great if at least one haskell system could get into the
standard linux distributions. ...
Sure - any idea how to get Red Hat to include the stuff?
I've asked a (busy) friend who works for redhat. I'll pass on
On Sun, 24 Nov 2002 22:50:43 +0100, Nick Name [EMAIL PROTECTED] wrote:
On Sun, 24 Nov 2002 20:42:31 +
Glynn Clements [EMAIL PROTECTED] wrote:
Even if Haskell were strict, you still wouldn't be able to treat I/O
operations as functions without discarding referential transparency.
Yes, but
On Thu, 13 Feb 2003 10:45:10 -, Simon Marlow [EMAIL PROTECTED]
wrote:
File reading is not a pure operation: running out
of file descriptors is a good counter-example.
How does this differ from running out of memory whilst trying to evaluate
something?
Cheers,
Ganesh
On Thu, 10 Jul 2003 10:58:51 +1000, Andrew J Bromage [EMAIL PROTECTED]
wrote:
This suggests that wrapping each standard mathemtaical
function/operator in its own typeclass would have literally
no run-time performance penalty:
class Plus a b c | a b - c where
(+) :: a - b - c
On Tue, 19 Aug 2003 10:27:23 +0100, Simon Marlow [EMAIL PROTECTED]
wrote:
If the databases *do* change over time, then there are two
possibilities:
1. the contents change due to external factors only
2. the contents change because this program doing the writing
in (1), you can still pretend
On Tue, 19 Aug 2003 10:52:57 +0100, Simon Marlow [EMAIL PROTECTED]
wrote:
Isn't there the possibility of inlining causing a read to
happen twice even if it only appears to happen once?
In theory that would be a valid transformation, but in practice no
compiler would duplicate arbitrary
On Wed, 10 Sep 2003 10:26:04 +0100, Robert Ennals
[EMAIL PROTECTED] wrote:
class Wibble a where
wibble :: a - Int
wobble :: a - String
set_wibble :: Int - a - a
set_wobble :: String - a - a
data Foo = Foo {wibble :: Int, wobble :: String}
deriving Wibble
The Wibble
On Tue, 24 Feb 2004 07:18:58 -0800 (PST), Hal Daume III [EMAIL PROTECTED]
wrote:
just as another sample point...
i write 99% of my code in either haskell or perl. haskell tends to be for
the longer programs, perl tends to be for the shorter ones, though the
decision is primarily made for only
Hi,
The darcs team is pleased to announce the release of darcs 2.5.1, a minor
upgrade for the 2.5 release. The main focus of this release is support for
the GHC 7.0 series and the upcoming February 2011 Haskell Platform, but
the release also includes a few bug fixes and minor usability
On 11/05/2011 10:33, Yitzchak Gale wrote:
Don Stewart wrote:
The haskell.org committee... has decided to
incorporate haskell.org as a legal entity. This email outlines our
recommendation, and seeks input from the community on this decision.
Thanks, good news! And thanks for posting to
Hi,
I've just uploaded HTTP-4000.1.2, which just bumps the base dependency
to work with GHC 4.2.1.
I'm aware that there are a bunch of pending patches people have sent me,
including some from several months ago that I haven't even acknowledged
- sorry! I hope to integrate these at CamHac this
Dear Haskellers,
The first year of the haskell.org committee is drawing to a close and it
is therefore time to seek replacements for those members whose term is
expiring.
This year two members are retiring, Ian Lynagh and Malcolm Wallace. The
rest of the committee would like to thank them for
This report is also posted to
http://haskellorg.wordpress.com/2011/10/26/first-year-report/
The haskell.org committee is reaching the end of its first year of
operation, so it's time to look back and see what has been achieved.
*haskell.org incorporation*
The most important work for the year
Hi,
The haskell.org committee for 2011-12 has been formed:
Edward Z. Yang [term ends 2013]
Ganesh Sittampalam [chair until May 2012, term ends 2012]
Vo Minh Thu [term ends 2013]
Mark Lentczner [term ends 2013]
Brent Yorgey [term ends 2014]
Jason Dagit [term ends 2014]
Edward Kmett [term ends
Hi,
There was a problem with the mailman daemon on projects.haskell.org
which meant that mail wasn't delivered from around Nov 11th till
yesterday (Nov 26th). It looks like the mail was correctly queued up
during that period and was all delivered when the daemon was restarted
yesterday.
Hi,
As mentioned in the committee's annual report
(http://haskellorg.wordpress.com/2011/10/26/first-year-report/), our
attempt to join SFC has stalled because they don't have the capacity to
accept new projects at the moment.
We therefore applied to join SPI (http://www.spi-inc.org/), and they
BTW as with the Don's original message about incorporating, I
distributed this widely to increase awareness, but please restrict any
feedback to haskell-cafe@ and committee@.
Sorry for the noise!
Ganesh
On 16/12/2011 09:08, Ganesh Sittampalam wrote:
Hi,
As mentioned in the committee's
Hi,
I have an object file that I'd like to load with GHCi. It seems this
object file has some relocations that Linker.c doesn't support - I get
this message:
final link ... ghc-6.4: HSperl.o: unhandled ELF relocation(Rel) type 10
Looking in elf.h, type 10 is R_386_GOTPC, which appears
Hi,
I found it slightly surprising that the program below (also attached as a
file) needs the nested type annotations in the place commented. It's not
really clear whether it's a bug or just a natural consequence of GADT
type-checking, but since Simon Marlow also found it surprising it at
On Wed, 26 Mar 2008, Ross Paterson wrote:
On Wed, Mar 26, 2008 at 08:52:43PM +, Ganesh Sittampalam wrote:
I'm a bit confused about why the following program doesn't compile (in
any of 6.6.1, 6.8.1 and 6.9.20080316). Shouldn't the Ord (a, b) context
be reduced?
To use bar, you need (Ord
Hi,
I have a problem in GHC 6.10 with functions in a class instance calling
other functions in the same class instance. It seems that the dictionary
is freshly constructed for this call, despite being already available.
The reason I care is that I want to memoise some expensive computations
Hi,
I recently spent a while debugging a problem where a program deadlocked in
the non-threaded runtime, but ran fine in the threaded runtime, despite
the program having no blocking FFI calls, and boiled it down to the
following test case:
module Main(main) where
import System
import
On Tue, 23 Jun 2009, Brandon S. Allbery KF8NH wrote:
On Jun 23, 2009, at 09:41 , Simon Marlow wrote:
main = do
(ih, oh, _, _) - runInteractiveProcess cat [] Nothing Nothing
comphszp - hGetContents oh
print (length comphszp)
-- hClose ih -- with this line they both deadlock
Note that you can
[ 6 of 10] Compiling Data.Array.IO( Data/Array/IO.hs,
dist/build/Data/Array/IO.o )
Data/Array/IO.hs:73:13:
`haFD' is not a (visible) field of constructor `Handle__'
Data/Array/IO.hs:73:22:
`haBuffer' is not a (visible) field of constructor `Handle__'
Data/Array/IO.hs:73:36:
On Fri, 30 Oct 2009, Sittampalam, Ganesh wrote:
Simon Peyton-Jones wrote:
Fortunately, I don't think a lot of people use the feature in anger.
Please yell if you *are* using impredicative polymorphism for
something serious. But if you are, we need to think of a workaround.
The current
On Sun, 26 Sep 2010, Ian Lynagh wrote:
We are pleased to announce the first release candidate for GHC 7.0.1:
http://new-www.haskell.org/ghc/dist/7.0.1-rc1/
This includes the source tarball, installers for OS X and Windows, and
bindists for amd64/Linux and i386/Linux.
Please test as much
Hi Neil,
On Tue, 2 Nov 2010, Neil Mitchell wrote:
Make sure you are using RC2 of the compiler, from what I remember RC1
required signatures it shouldn't have, or enabled MonoLocalBinds more
than it should - RC2 required less signatures. However, your code
could well just be heavily using the
On Mon, 6 Dec 2010, Simon Peyton-Jones wrote:
I too wish there was a good solution here. I've taken to making dated repos,
thus
http://darcs.haskell.org/ghc-new-co-17Nov10
When it becomes unusable, I make a brand new repo, with a new date
starting from HEAD, pull all the old
On Thu, 9 Dec 2010, Simon Marlow wrote:
On 08/12/2010 17:39, Yitzchak Gale wrote:
Some of those are already in the works, and all except possibly
(5) are known to be within reach. So the answer is yes, this
problem is now on the verge of being solved in Darcs.
I think that might be a little
On Wed, 8 Dec 2010, Stephen J. Turnbull wrote:
Ganesh Sittampalam writes:
I think there are three things that can help with this problem:
1) a darcs rebase command. This will give you a nice way to manage the
workflow already discussed, and you won't have to squish everything
through
Hi Simon,
You talk about the timing of application of the instance declaration
instancePatchInspect (PrimOf p)) = Conflict p
but the constraint is actually defined in the class declaration, and I
don't have any instance declarations for Conflict p itself.
classPatchInspect (PrimOf p)) =
in the meanwhile?
Or I will do it tomorrow.
Thanks!
d-
*From:* glasgow-haskell-users-boun...@haskell.org
[glasgow-haskell-users-boun...@haskell.org] on behalf of Ganesh
Sittampalam [gan...@earth.li]
*Sent:* Friday
On 11/05/2011 10:33, Yitzchak Gale wrote:
Don Stewart wrote:
The haskell.org committee... has decided to
incorporate haskell.org as a legal entity. This email outlines our
recommendation, and seeks input from the community on this decision.
Thanks, good news! And thanks for posting to
Hi,
It would be useful to access the current compilation parameters or even
an entire RunGhc monad from inside a Template Haskell splice. Is there
any way to do this?
The reason I want to do this is I'm using the ghc API at runtime to
dynamically execute code, and I want both the dynamically
On 15/09/2011 15:43, Ian Lynagh wrote:
On Thu, Sep 15, 2011 at 08:47:30AM +, Simon Peyton-Jones wrote:
Provoked the (very constructive) Yesod blog post on Limitations of
Haskell, and the follow up discussion, I've started a wiki page to collect
whatever ideas we have about the name
Hi,
The following either eats memory until killed or segfaults (I can't pin
down a reason for the difference). Tested with GHC 6.2.2 and 6.4.20050212,
with various different libgmp3s under various Redhat and Debian platforms,
and WinXP.
Prelude :m +Data.Bits
Prelude Data.Bits
On Mon, 28 Feb 2005, Remi Turk wrote:
On Mon, Feb 28, 2005 at 02:55:56PM +, Ganesh Sittampalam wrote:
Prelude :m +Data.Bits
Prelude Data.Bits 18446658724119492593 `shiftL` (-3586885994363551744) ::
Integer
and calculating, in your case, 2^3586885994363551744 is not
something your
Hi,
I'm having some trouble writing code that uses GADTs. I finally got
something that is portable between GHC 6.6 and 6.8, but I don't really
understand what's going on, and I'm a bit unhappy with the number of type
signatures required.
I'll explain them with a series of cut-down examples
On Wed, 21 Nov 2007, Alex Jacobson wrote:
Simon Marlow wrote:
Alex Jacobson wrote:
1. just using : at the prompt caused a reload. Now you have to type :r.
Interesting, I was not aware of that behaviour, so probably fixed it by
accident :)
Yeah, Igloo said the same thing. Everyone I
Hi,
I'm trying to understand what fundeps do and don't let me do. One
particular source of confusion is why the following program doesn't
typecheck:
{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies #-}
module Fundeps where
class Dep a b | a - b, b - a
conv :: (Dep a b1,Dep a b2)
On Mon, 3 Dec 2007, Simon Peyton-Jones wrote:
No, you didn't miss anything. I wouldn't expect anyone to write these
types directly. But it can happen:
class C a b | a-b
instance C Int Bool
class D x where
op :: forall y. C x y = x - y
instance D Int
Hi,
I notice that the readline package is missing from the Windows MSI build
of GHC 6.0.1. Is this deliberate and/or a fundamental limitation of the
Windows platform? Would I have to/be able to make my own Cygwin-based
build to get it?
Cheers,
Ganesh
in *practice*! Q more or less *is* TcM.
Still I don't really know how to get around this in a beautiful way.
Simon
| -Original Message-
| From: glasgow-haskell-users-boun...@haskell.org
[mailto:glasgow-haskell-users-
| boun...@haskell.org] On Behalf Of Ganesh Sittampalam
| Sent
Hi,
I'm just investigating what we can do about a problem with darcs'
handling of non-ASCII filenames on GHC 7.2.
The issue is apparently that as of GHC 7.2, getDirectoryContents now
tries to decode filenames in the current locale, rather than converting
a stream of bytes into characters:
Hi Max,
On 01/11/2011 10:23, Max Bolingbroke wrote:
This is my implementation of Python's PEP 383 [1] for Haskell.
IMHO this behaviour is much closer to what users expect.For example,
getDirectoryContents . = print shows Unicode filenames properly.
As a result of this change we were able
Hi,
I'm not entirely clear on what the overall situation will be once Simon
M's patch to add .ByteString versions to unix is added in GHC 7.4.1.
In particular the original problem darcs ran into was with
getDirectoryContents in the directory package. That in turn uses the
unix package on Posix
Hi,
As mentioned in the committee's annual report
(http://haskellorg.wordpress.com/2011/10/26/first-year-report/), our
attempt to join SFC has stalled because they don't have the capacity to
accept new projects at the moment.
We therefore applied to join SPI (http://www.spi-inc.org/), and they
BTW as with the Don's original message about incorporating, I
distributed this widely to increase awareness, but please restrict any
feedback to haskell-cafe@ and committee@.
Sorry for the noise!
Ganesh
On 16/12/2011 09:08, Ganesh Sittampalam wrote:
Hi,
As mentioned in the committee's
On 23/12/2011 13:46, Ian Lynagh wrote:
On Fri, Dec 23, 2011 at 01:34:49PM +, Simon Peyton-Jones wrote:
Arguments Boxed Unboxed
3 ( , , )(# , , #)
2 ( , ) (# , #)
1
0 () (# #)
Simple, uniform.
Uniform
Hi,
I'm having some trouble making Haskell bindings to libsane (a scanner
access library: http://www.sane-project.org/)
When I build the cut down sample of my code (below) with GHC 7.4.1 with
the non-threaded runtime, it hangs at runtime in the call to
c'sane_get_devices (after printing go).
On 07/06/2012 12:08, Simon Marlow wrote:
I don't completely understand what is going wrong here, but it looks
like an interaction between the RTS's use of a timer signal and the
libsane library. You can make it work by turning off GHC's timer with
+RTS -V0.
[..]
The signal has always been
On 17/08/2012 11:18, Simon Peyton-Jones wrote:
| Would it be reasonable to change ghc's behavior to treat this
| (ie an 'import' statement that hides something that isn't exported) as a
| warning instead of an error?
Yes, that would be easy if it's what everyone wants. Any other opinions?
Hi,
I'm getting the panic below when building darcs 2.8 with GHC 7.6. It'll
take some effort to cut it down or give repro instructions for an
uncut-down version (I needed to hack a lot of underlying packages to be
able to even get as far as doing this build), so could someone confirm
that it's
-
| haskell-users-boun...@haskell.org] On Behalf Of Ganesh Sittampalam
| Sent: 22 August 2012 06:32
| To: glasgow-haskell-users@haskell.org
| Subject: 7.6.1 RC1 panic coVarsOfTcCo:Bind
|
| Hi,
|
| I'm getting the panic below when building darcs 2.8 with GHC 7.6. It'll
| take some effort
On 01/10/2012 12:05, Simon Marlow wrote:
This probably means that you have packages installed in your ~/.cabal
from a 32-bit GHC and you're using a 64-bit one, or vice-versa. To
avoid this problem you can configure cabal to put built packages into a
directory containing the platform name.
On 28/11/2012 13:13, Ian Lynagh wrote:
My general feeling about Windows is that it's ok for the end result to
be a little annoying, because Windows DLLs *are* annoying and it's
nothing to do with GHC.
In particular I think in practice most Windows developers will have
admin rights and could
On 10/02/2013 21:43, Ian Lynagh wrote:
On Sun, Feb 10, 2013 at 09:30:23PM +, Simon Peyton-Jones wrote:
| You may ask what use is a GHC release that doesn't cause a wave of
updates?
| And hence that doesn't work with at least some libraries. Well, it's a
very useful
| forcing
Hi,
It seems that from GHC 7.4, the prohibition on implicit parameter
constraints in instance declarations has been relaxed. The program below
gives the error Illegal constraint ?fooRev::Bool in GHC 7.2.1 but
loads fine in GHC 7.4.2 and GHC 7.6.2.
I can't spot anything about this in the release
Is it possible to tie the role to whether the data constructor is
visible or not?
On 07/10/2013 14:26, Richard Eisenberg wrote:
As you may have heard, /roles/ will be introduced with GHC 7.8. Roles
are a mechanism to allow for safe 0-cost conversions between newtypes
and their base types.
I think it would be ok to expect the constructors to be visible, even
though it might need to a lot being needed.
BTW I think you might need S1 visible as well otherwise how would you
convert (S1 True :: S Bool Int) into (S1 True :: S Bool Age)?
If you don't derive the role from constructor
I feel this blurs the roles of GHC and the Platform.
Can't the cabal-install that comes with the Platform can be used with a
later GHC installation? If that's correct, then the only use case that
this proposal covers is someone who wants to use a bleeding edge GHC and
no other version on a new
releases. Ideally the binaries could be
produced on a build bot. The very least we should have the Makefile in
the cabal repo being able to create the binary in a reproducible manner.
-- Johan
On Tue, Jan 21, 2014 at 11:22 AM, Ganesh Sittampalam gan...@earth.li
mailto:gan...@earth.li wrote
Just to note a problem I encountered on Windows, which may well be user
error.
I unpacked the mingw tarball and added the bin directory from it to my
path. cabal install then failed with cabal.exe: does not exist after
producing some other output.
Running with -v3 suggested that the actual
The behaviour could be invoked only for lower-case parts, but that may
prove problematic on case-insensitive filesystems like Windows.
On 16/03/2014 13:52, Carter Schonwald wrote:
Idk, this behavior of doing Data.Vector.lhs seems pretty awesome. I
actually might start doing that. That ghc
On 23/04/2014 20:04, dm-list-haskell-librar...@scs.stanford.edu wrote:
Edward Kmett ekm...@gmail.com writes:
You can wind up in perfectly legitimate situations where the name for the
type you are working with isn't in scope, but where you can write a
combinator that would infer to have that
On Fri, 3 Feb 2006, Ross Paterson wrote:
As another example, Ben Rudiak-Gould recently pointed out that the
inclusion of stToIO breaks threaded state reasoning for ST, e.g.
readSTRef won't necessarily get what your last writeSTRef wrote (because
the region might be RealWorld, with other threads
On Fri, 28 Dec 2007, Magnus Therning wrote:
It seems my emails to the Debian Haskell list (CC'd on this email as
well) are silently dropped :-(
I don't believe that's the case; I've been getting them, and they're in
the archive:
On Fri, 19 Mar 2010, o...@okmij.org wrote:
Paul Brauner wrote:
is there a way in some haskell extension to explicit (system F's) big
lambdas and (term Type) applications in order to help type inference?
Actually, yes: newtype constructor introductions may act as a big
lambda, with
Hi,
When I try to compile this code with ghc-6.9.20080310:
module Test2 where
type family Id a
type instance Id Int = Int
type instance Id (a, b) = (Id a, Id b)
class Id a ~ ida = Foo a ida
instance Foo Int Int
instance (Foo a ida, Foo b idb) = Foo (a, b) (ida, idb)
I get these errors:
On Mon, 17 Mar 2008, Manuel M T Chakravarty wrote:
Your are completely right. Unfortunately, superclass equalities (ie, the Id
a ~ ida in the class declaration of Foo) aren't fully implemented yet.
OK, thanks. Is there any rough idea of when they will be?
If I am not mistaken, superclass
On Tue, 18 Mar 2008, Manuel M T Chakravarty wrote:
Ganesh Sittampalam:
On Mon, 17 Mar 2008, Manuel M T Chakravarty wrote:
Your are completely right. Unfortunately, superclass equalities (ie, the
Id a ~ ida in the class declaration of Foo) aren't fully implemented yet.
OK, thanks
On Tue, 25 Mar 2008, Ryan Ingram wrote:
I was experimenting with Prompt today and found that you can get a
restricted monad style of behavior out of a regular monad using Prompt:
I recently developed a similar trick:
http://hsenag.livejournal.com/11803.html
It uses the regular MonadPlus
On Fri, 28 Mar 2008, Wolfgang Jeltsch wrote:
But it is possible to give a construction of an Ord dictionary from an
AssociatedMonad dictionary. See the attached code. It works like a
charm. :-)
This is really cool, and with much wider applicability than restricted
monads; it gives us a
Hi,
The following program doesn't compile in latest GHC HEAD, although it does
if I remove the signature on foo'. Is this expected?
Cheers,
Ganesh
{-# LANGUAGE TypeFamilies #-}
module Test7 where
type family Id a
type instance Id Int = Int
foo :: Id a - Id a
foo = id
foo' :: Id a - Id a
On Sun, 6 Apr 2008, Thomas M. DuBuisson wrote:
Id is an operation over types yielding a type, as such it doesn't make
much sense to me to have (Id a - Id a) but rather something like (a -
Id a). One could make this compile by adding the obvious instance:
type instance Id a = a
Curiously,
On Mon, 7 Apr 2008, Manuel M T Chakravarty wrote:
Ganesh Sittampalam:
The following program doesn't compile in latest GHC HEAD, although it does
if I remove the signature on foo'. Is this expected?
Yes, unfortunately, this is expected, although it is very unintuitive
On Wed, 9 Apr 2008, Manuel M T Chakravarty wrote:
Sittampalam, Ganesh:
No, I meant can't it derive that equality when matching (Id a) against
(Id b)? As you say, it can't derive (a ~ b) at that point, but (Id a ~
Id b) is known, surely?
No, it is not know. Why do you think it is?
Well,
Hi,
I'm thinking of trying to get a devroom for haskell.org at the next
FOSDEM, which is Saturday-Sunday February 6th-7th 2010 in Brussels:
http://www.fosdem.org/2010/call-developer-rooms
The idea would be to try to introduce Haskell to people at FOSDEM who were
interested, and thus help
On Tue, 8 Dec 2009, Tom Tobin wrote:
On Tue, Dec 8, 2009 at 3:30 PM, Ben Franksen ben.frank...@online.de wrote:
Ketil Malde wrote:
Your contributions could still be licensed under a different license
(e.g. BSD), as long as the licensing doesn't prevent somebody else to
pick it up and
Hi Bit,
On Thu, 21 Oct 2010, Bit Connor wrote:
On Sat, Oct 16, 2010 at 10:29 AM, Claus Reinke claus.rei...@talk21.com wrote:
After it catches this error, the function returns (line 376):
return (fail (show e))
The fail is running in the Either monad (The Result type = Either).
This calls
On Sun, 24 Oct 2010, Bit Connor wrote:
On Sat, Oct 23, 2010 at 8:49 PM, Ganesh Sittampalam gan...@earth.li wrote:
I'm just looking at fixing this so I can make an upload as discussed with
Sigbjorn. I guess the best thing to do is to make all the calls to fail into
something more explicit
On Fri, 22 Oct 2010, Sigbjorn Finne wrote:
On Fri, Oct 22, 2010 at 9:35 AM, Sittampalam, Ganesh
ganesh.sittampa...@credit-suisse.com wrote:
libraries@, what's the right way to proceed? Can I make a Debian-style
non-maintainer upload with minimal changes to fix urgent issues like
these?
On Wed, 3 Nov 2010, Simon Marlow wrote:
On 29/10/2010 23:24, Ganesh Sittampalam wrote:
4000.0.10 should fix the reported issue with fail and Either, and bumps
the base dep to build with GHC 7.0
That's great. Any chance you could also look at this one, which appears to
be a pretty serious
Hi,
I've just released HTTP 4000.1.0 to hackage:
- Fixed a bug that caused infinite loops for some URLs on some platforms
(whether the URL was a trigger is probably related to the size of the
returned data, and the affected platforms. Based on a patch by Daniel
Wagner.
- This is
On Thu, 2 Dec 2010, Robert Greayer wrote:
On Thu, Dec 2, 2010 at 4:39 PM, Antoine Latter aslat...@gmail.com wrote:
On Thu, Dec 2, 2010 at 3:29 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
What we /can't/ do is define a polymorphic map function. One might try to do
something like
On Wed, 9 Sep 2009, Lewis-Sandy, Darrell wrote:
Windows Vista, Ubuntu 9.04 32-bit, Ubuntu 64 bit, etc). I have a
windows file share that is accessible to all the machines, and has been
permanently mounted as a CIFS share on the Linux machines.
I have built darcs 2.3 on the Ubuntu 9.04
On Sat, 12 Sep 2009, Brandon S. Allbery KF8NH wrote:
On Sep 12, 2009, at 11:22 , Trent W. Buck wrote:
Jason Dagit da...@codersbase.com writes:
which ensures that when the operating system is not WIN32, that
renaming of files will be performed by the OS shell.
I'm also puzzled as to why this
On Wed, 27 Aug 2008, Jonathan Cast wrote:
* I wonder why that name was chosen? The design doesn't seem to have
anything to do with IO, it's more of a `we have this in C so we want it
in Haskell too' monad.
The 'C' in ACIO says that it commutes with any operation in the IO
monad. Without that
On Thu, 28 Aug 2008, Adrian Hey wrote:
implicit parameters (a highly dubious language feature IMO).
How can you say that with a straight face at the same time as advocating
global variables? :-)
Ganesh
___
Haskell-Cafe mailing list
On Thu, 28 Aug 2008, Adrian Hey wrote:
There's no semantic difficulty with the proposed language extension,
How does it behave in the presence of dynamic loading? What about remote
procedure calls?
Also what if I want a thread-local variable? It seems like an extension
like this should
On Thu, 28 Aug 2008, Adrian Hey wrote:
Ganesh Sittampalam wrote:
On Thu, 28 Aug 2008, Adrian Hey wrote:
There's no semantic difficulty with the proposed language extension,
How does it behave in the presence of dynamic loading?
To answer this you need to be precise about the semantics
On Sat, 30 Aug 2008, Adrian Hey wrote:
Ganesh Sittampalam wrote:
Will Data.Unique still work properly if a value is sent across a RPC
interface?
A value of type Unique you mean? This isn't possible. Data.Unique has
been designed so cannot be Shown/Read or otherwise
serialised/deserialised
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
Ganesh Sittampalam wrote:
If you want to standardise a language feature, you have to explain its
behaviour properly. This is one part of the necessary explanation.
To be concrete about scenarios I was considering, what happens if:
- the same
On Sat, 30 Aug 2008, Adrian Hey wrote:
Ganesh Sittampalam wrote:
How do the implementers of Data.Unique know that they musn't let them be
serialised/deserialised?
Because if you could take a String and convert it to a Unique there
would be no guarantee that result was *unique*.
Well, yes
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
Ganesh Sittampalam wrote:
Every single call to newIORef, across the whole world, returns a different
ref.
How do you know? How can you compare them, except in the same Haskell
expression?
I can write to one and see if the other changes.
The same
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
Is it the functionality of Data.Unique that you object to, or the fact that
it's implemented with a global variable?
If the former, one could easily build Unique values on top of IORefs, since
IORef is in Eq. Thus Data.Unique is no worse than IORefs
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'm not sure that they *define* process scope, because
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
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
On Sat, 30 Aug 2008, Ashley Yakeley wrote:
Ganesh Sittampalam wrote:
Firstly, that's a property of the current implementation, rather than a
universal one, IMO. I don't for example see why you couldn't add a
newIORef variant that points into shared memory, locking issues aside.
OK, so
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, each would have its own
1 - 100 of 156 matches
Mail list logo
