Hi,
I'd like to know a bit about the STM implementation in GHC,
specifically about how it tries to achieve fairness. I've been reading
Composable Memory Transactions but it does not contain that much
details on this specific matter. What I want to know boils down to
this: what order are processes
On Fri, Feb 29, 2008 at 4:27 PM, Roberto Zunino [EMAIL PROTECTED] wrote:
Josef Svenningsson wrote:
What I want to know boils down to
this: what order are processes run which have been woken up from a
call to retry?
IIUC, the order of wake up is irrelevant, since *all* the threads
order they
blocked sounds sensible to me. The lists of threads blocked on a TVar are
doubly-linked (right?) so wouldn't need to be explicitly reversed.
Tim
-Original Message-
From: Simon Peyton-Jones
Sent: 29 February 2008 20:06
To: Josef Svenningsson; glasgow-haskell
On Fri, Apr 25, 2008 at 9:17 PM, Duncan Coutts
[EMAIL PROTECTED] wrote:
On Fri, 2008-04-25 at 09:08 -0700, Don Stewart wrote:
Geraint.Jones:
Are there well-known differences in the implementations of Haskell in
ghci and hugs? I've got some moderately intricate code (simulations
On Mon, Feb 2, 2009 at 8:50 PM, Reid Barton rwbar...@math.harvard.edu wrote:
On Mon, Feb 02, 2009 at 06:03:15PM +0100, Josef Svenningsson wrote:
Hi Tyson,
I also needed something like this a while ago so I knocked up a really
simple module and put it on hackage:
http://hackage.haskell.org
Hi Tyson,
I also needed something like this a while ago so I knocked up a really
simple module and put it on hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/STMonadTrans
If you have any suggestions for improvement they are most welcome.
Patches even more so.
Josef
2009/2/2
Hi,
It seems I've been able to mess up my ghc installation pretty badly.
Here is what happens if I just try to invoke ghci from the prompt:
$ ghci
GHCi, version 6.10.4: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking ...
more transparent.
Josef
On Mon, Mar 1, 2010 at 11:43 AM, Josef Svenningsson
josef.svennings...@gmail.com wrote:
Hi,
It seems I've been able to mess up my ghc installation pretty badly.
Here is what happens if I just try to invoke ghci from the prompt:
$ ghci
GHCi, version 6.10.4: http
On Tue, Mar 2, 2010 at 12:21 PM, Simon Marlow marlo...@gmail.com wrote:
On 02/03/2010 08:59, Josef Svenningsson wrote:
On Mon, Mar 1, 2010 at 11:54 PM, Jeremy Shawjer...@n-heptane.com wrote:
is there, by chance, a file named Prelude.hs in the working directory?
(the
directory you
Let me clarify a bit exactly how Gustavsson and Sands (I'll refer to them as
GS) handled the issue of the Wadler space leak. It's true that they adopted
an approach similar to Sparud in that they extended their core calculus with
a new language construct which could solve the problem. This is
Simon Marlow wrote:
On 06 October 2004 00:53, John Meacham wrote:
This seems like it could be nicely generalized such that all
enumeration types unbox to the unboxed integer of their offset. so
data Perhaps = Yes | Maybe | No
can unbox to an Int# with 0# == Yes 1# == Maybe and 2# == No.
you,
/Josef Svenningsson, PhD student at Chalmers, External core tsar
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Can you perhaps be more precise about what your problem is? You can compile
to code by issuing ghc --make Analisi -o Analisi.
/Josef
-Original Message-
From: [EMAIL PROTECTED] [mailto:glasgow-haskell-
[EMAIL PROTECTED] On Behalf Of Suzan Bayhan
Sent: den 19 november 2004
Hi,
Compiling 6.4.20050217 on Windows according to the book fails pretty early:
snippet
/cygdrive/c/ghc/ghc-6.2.2/bin//ghc -H16m -O -I. -Rghc-timing -I../../../librari
es -fglasgow-exts -no-recomp-c Compat/RawSystem.hs -o Compat/RawSystem.o -o
hi Compat/RawSystem.hi
Hi all,
I've had some fun chasing around a couple of space leaks lately. One
of the graphs that I produced looked like this:
www.cs.chalmers.se/~josefs/coresa.ps
Notice the shape of the graph. It shows a perfect squareroot function.
But my program should be allocating at a constant rate. From
On 4/14/05, Simon Marlow [EMAIL PROTECTED] wrote:
On 14 April 2005 15:35, Josef Svenningsson wrote:
I've had some fun chasing around a couple of space leaks lately. One
of the graphs that I produced looked like this:
www.cs.chalmers.se/~josefs/coresa.ps
Notice the shape of the graph
Hi,
I get the exact same thing with ghc-6.5.20060914.
Weird.
Josef
On 9/20/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello glasgow-haskell-users,
can someone try to compile this one-line module:
import Control.Concurrent.STM.TArray
with a recent 6.5 builds, preferably mingw32 ones?
it
I'm replying to a rather old thread here, about unboxing in functions. Duncan
had a continuation monad which passed around some data type that would be nice
to unbox. You discussed strictness annotations in function types as a potential
solution. I have a different tack on the problem which seems
On 5/11/07, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
| I'm replying to a rather old thread here, about unboxing in functions. Duncan
| had a continuation monad which passed around some data type that would be nice
| to unbox. You discussed strictness annotations in function types as a
On 10/17/07, Bernd Brassel [EMAIL PROTECTED] wrote:
why do you want to do this unsafely,
instead of just using 'length'? unsafePerformIO is a very slow
function, remember)
The big picture is that we generate programs like this example in order
to compile the functional logic language
Hi all!
I've been playing around with the rules facility a bit. There is a boring
shortcoming when working with infix operators. It seems that the rule
parser doesn't like them at all. The following example gives syntax error:
{-# RULES
"plus/mult" forall p . p + p = 2 * p
#-}
whereas the
On Mon, 18 Jun 2001, Julian Seward (Intl Vendor) wrote:
The (Interactive) Glasgow Haskell Compiler -- version 5.00.2
==
[..]
What's new in 5.00.2
==
[..]
How about Andrew Tolmach's -fext-core flag? Did
On Mon, 25 Jun 2001, Simon Peyton-Jones wrote:
| * I would like to make GHC generate only the core file and
| the hi file, nothing more. However, I haven't found a way of
| making GHC stop after outputting the hi file. Being able to
| do this is useful in some other cases as well; I
On Mon, 6 Aug 2001, Simon Marlow wrote:
Issue 1: should the maximum heap size be unbounded by default?
Currently the maximum heap size is bounded at 64M. Arguments for: this
stops programs with a space leak eating all your swap space. Arguments
against: it's annoying to have to raise the
Hi!
I would like to add a request to Thomas list of lacking features of
ghc --make:
When caching information between the compilation of different modules,
use weak pointers.
With large projects, ghc runs out of heapspace because of too much
caching. It's always fine to restart the build
On Mon, 15 Oct 2001, Simon Marlow wrote:
With large projects, ghc runs out of heapspace because of too much
caching.
I think it's more likely that GHC has some space leaks which cause it to
hang on to too much memory between compilations. In theory, it only
caches the contents of
Hi!
A question about the RULES pragma.
Suppose I have the following RULES pragma:
{-# RULES
foo forall a . foo a = (\x - bar x) a
#-}
Ok, it's stupid but I have examples where this is motivated, trust me.
Now, it seems that GHC simplifies the rule because what I get when
compiling it with
On Mon, 25 Feb 2002, Simon Peyton-Jones wrote:
| Suppose I have the following RULES pragma:
|
| {-# RULES
| foo forall a . foo a = (\x - bar x) a
| #-}
|
| Ok, it's stupid but I have examples where this is motivated, trust me.
|
| Now, it seems that GHC simplifies the rule because
On Wed, 13 Nov 2002, Jan Kort wrote:
Juan Ignacio Garcia Garcia wrote:
*P2 (fromRational ((toRational 4) - ( toRational 5.2 )))
-1.2002
I can't explain this one, how would fromRational
know that it has to create a Double ?
It's the defaulting mechanism that kicks in. The
[moved over to glasgow-haskell-users]
On Wed, 19 Feb 2003, Simon Peyton-Jones wrote:
| GHC used to have an optimisation for static argument like this. It
would
| turn both of the above programs into a similar form using a local
| recursive function:
|
| interp y xs = interpaux xs
|
On Fri, 30 May 2003, Simon Marlow wrote:
A binary version of GHC6 is available for sparc-solaris2 machines at:
http://www.isi.edu/~hdaume/ghc-6.0-sparc-solaris2.tar.bz2
17.5 mb
I'd appreciate it if the maintainers could copy it and make
it available
locally off of the GHC web
On Wed, 18 Jun 2003, Isaac Jones wrote:
Hello :)
Can anyone enlighten me as to the state of the ghc6 sparc
distribution? The file on Hal's web page mentioned some time back is
not the same file as on the GHC web page (I note that the filenames
are different also).
Are any of them known
Hi!
Here's a letter from someone who has next to no clue about what he is
doing so have patience and don't assume any knowledge when answering...
I'm trying to create a package for ghc. I've struggled quite a lot and
gotten this far:
(This is when invoking ghci -package yahu)
Loading package
Hi,
I'm playing around with the type system trying to encode various stuff in
it. I've gotten an error though which it would be useful to understand.
Say I have a type class:
class Foo a
and then I want a datatype like this:
data Bar a = Foo a = C1 | C2 ... | C3
This works fine syntactically
On Mon, 23 Feb 2004, MR K P SCHUPKE wrote:
Was just thinking about GHC's implementation of arrays, and their
poor performance. I know little about GHC's internal workings, but
I was thinking about how array performance could be improved.
What if when writing an array you instead construct a
Hi all,
This mail is a little story about a little guy called Josef and a little
adventure he had this week together with the compiler ghc. Although
exciting, this adventure took him several hours and Josef would have been
happier without it. So he appeals to the implementors to improve on the
On Thu, 18 Mar 2004, Carsten Schultz wrote:
Hi Sébastien!
On Thu, Mar 18, 2004 at 11:30:26AM +0100, Sébastien Pierre wrote:
In fact, I would like to know how Haskell compares in performance to
other languages because if I refer to the page I mentioned
On Fri, Jul 31, 2015 at 10:31 PM Erik de Castro Lopo mle...@mega-nerd.com
wrote:
I maintaing multiple versions of GHC on all the machines I use regularly
for Haskell development. I have:
* ghc-7.6.3 installed under /usr/lib/ghc-7.6/
* ghc-7.8.4 installed under /usr/lib/ghc-7.8/
* ghc-7.10.2
38 matches
Mail list logo
