The required context on pattern synonyms isn't just useful, it's
necessary. Since arbitrary computation can happen in both the pattern
matching and construction we need the context.
Take Richard's example, without the context on Positive we would infer the
wrong type for any use of the Positive sy
For instance, at your day job, the Array type.
On Wed, Oct 5, 2011 at 12:23 PM, Roman Leshchinskiy wrote:
> Simon Peyton-Jones wrote:
> >
> > I'm not sure if this plan would support [("fred",45), ("bill",22)] :: Map
> > String Int. Probably not. Maybe that's a shortcoming... but such Maps
> >
What are the defaulting rules for IsList? It needs to be backwards compatible.
-- Lennart (iPhone)
On Sep 30, 2011, at 19:28, George Giorgidze wrote:
> GHC Users,
>
> I would like to make to the following two proposals:
> * Eliminate the default grouping close f
Also beware that Typeable uses the original names of types, which means that
moving basic types around totally wrecks backwards compatibility for those of
us who use the type name for serialization etc.
-- Lennart (iPhone)
On Aug 19, 2011, at 11:00, Johan Tibell wrote:
> These
Like everyone else I have no good solution.
When I had a ghc branch I used diff and patch to move my patches forward.
Not exactly what you expect to have to do with a version control system.
On Mon, Dec 6, 2010 at 1:57 AM, Iavor Diatchki wrote:
> Hello,
>
> I am doing some work on a GHC branch an
Encapsulation is essential for constructing robust software.
How could we get rid of that and claim to have a serious language?
On Sat, Jun 19, 2010 at 8:38 PM, Christian Höner zu Siederdissen
wrote:
> Hi everybody,
>
> I'd like some input on other peoples' thoughts on this. Recently, I
> played
Thanks!
On Sat, Mar 27, 2010 at 11:59 PM, Ian Lynagh wrote:
> On Thu, Mar 25, 2010 at 10:14:34PM +0000, Lennart Augustsson wrote:
>> #3904 should also be really easy to fix.
>
> Yup, done.
>
>
> Thanks
> Ian
>
> ___
>
I would really like to see #3900 in there. On trac it's slated for
the 6.12.2 release, but I don't see it in your list.
#3904 should also be really easy to fix.
On Tue, Mar 23, 2010 at 6:38 PM, Ian Lynagh wrote:
>
> Hi all,
>
> This is a summary of our plans for GHC 6.12.2.
>
> We plan to put ou
The usual way to do this would be to include the dependency on the RTS
in the library and then vary the RTS by using LD_PRELOAD.
I think ghc does it the wrong way.
-- Lennart
On Mon, Feb 22, 2010 at 10:00 PM, Max Bolingbroke
wrote:
> Hi Tyson,
>
> This blog post
> (http://blog.we
expect things to
still work.
For RecordPuns I don't have an opinion on what to do.
-- Lennart
On Sun, Aug 9, 2009 at 9:42 PM, Simon Peyton-Jones wrote:
> Oh, now I get it, thanks. This message concerns design choices for
> record-syntax-related GHC extensions. Lennart, pls tune in.
6.10.4 is a bug fix release. A bug fix release cannot remove packages
no matter what state the platform is in, that's just seriously broken.
On Wed, May 27, 2009 at 7:44 AM, Don Stewart wrote:
> Not part of the core libs, so these are slowly disappearing from the
> extralibs bundled shipped with
Excellent, is there a -fuse-catch flag for ghc? :)
On Tue, May 19, 2009 at 12:01 PM, Neil Mitchell wrote:
>> > ... exhaustive pattern checking might well help out a lot of
>> > people coming from untyped backgrounds...
>>
>> Or even people from typed backgrounds. I worship at the altar of
>> e
The exhaustiveness checker in ghc is not good. It reports
non-exhaustive matching a bit too often and also the error messages
are often not in terms of the original source but some desugared
version.
If those things were improved I think it should be always on.
On Mon, May 18, 2009 at 12:53 AM,
If it's easy I think just generating the code and let the type checker
report any problems would be a great thing for standalone deriving.
-- Lennart
On Tue, Apr 14, 2009 at 10:10 AM, Simon Peyton-Jones
wrote:
> Yes, indeed, see http://hackage.haskell.org/trac/ghc/ticket/3012
>
>
And to make many, many peoples life easier the binaries could have
been included in ghc 6.10.2 (but I know there are some philosophical
reasons against it).
-- Lennart
On Sun, Apr 5, 2009 at 5:48 PM, Don Stewart wrote:
> daniel.is.fischer:
>> Am Sonntag 05 April 2009 10:24:25 schri
ove harder pattern commutation properties.
I don't think there is any controversy at all about Haskell pattern
matching semantics.
As you say, it's pretty clearly spelled out.
(It wouldn't hurt to have it written down as a denotational semantics, though.)
And ghc happens to have a b
r
original email.
-- Lennart
On Thu, Mar 26, 2009 at 5:39 PM, Claus Reinke wrote:
> Sorry to be the odd man out - perhaps an example will help to
> clarify my reading of the language definition.
>
>> I find this "reordering" discussion somewhat nonsensical.
>>
l is about
specifying functions abstractly so order should only matter when it's
a matter of semantics.
On the other hand, adding some kind of pragma that indicates the
likelyhood of a branch seems quite sensible to me.
-- Lennart
On Thu, Mar 26, 2009 at 9:09 AM, Simon Marlow wrote:
>
lower, or eliminating returned constructors by using continuations
> made one inner-loop function faster, another slower..).
> Lennart is of course right: even if GHC would respect the ordering indicated
> in my source program, I might not be able to tune that source to make good
> use of
You could imagine a pragma to say which branch is likely.
f p1 = e1
f p2 = {-# LIKELY #-} e2
f p3 = e3
Is there some way to propagate pragmas through core transformations?
-- Lennart
On Wed, Mar 25, 2009 at 9:18 AM, Simon Peyton-Jones
wrote:
> Indeed GHC does not attempt to retain the or
that are in loops and
that almost always go the same way are free on all modern processors.
The branch predictor will learn quickly which way the the branch goes
and prefetch along the right path.
-- Lennart
On Tue, Mar 24, 2009 at 11:30 AM, Claus Reinke wrote:
> [commented cmm and asm eli
How could you match the first case with less than two case constructs?
There are two (:) to check for, so I'm not sure what you are complaining about.
-- Lennart
On Tue, Mar 24, 2009 at 12:16 AM, Claus Reinke wrote:
> I just noticed that GHC (6.11.20090320) seems to compile both
>
ootstrap -binary" emerge dev-lang/ghc
Please report any issues in #gentoo-haskell @ freenode.
Cheers,
Lennart Kolmodin -- Gentoo Dev
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Just Hindley-Milner type inference is exponential, making the type
system more complex isn't going to make things better.
2009/2/26 Ben Franksen :
> Hi
>
> the attached module is a much reduced version of some type-level assurance
> stuff (inspired by the Lightweight Monadic Regions paper) I am tr
I'm just guessing, but it looks like a buffering problem.
When a program dies an abnormal death (like the "Bug:" thing probably
is) then the stdout buffer is not flushed and you'll miss that bit of
the output.
You could set stdout in NoBuffering mode and see if that helps.
; Set the 'http_proxy' environment variable to point it at your local proxy
> server.
>
> --sigbjorn
>
> On 1/21/2009 07:05, Lennart Augustsson wrote:
>>
>> What port is git using for getting the ghc repo via http?
>>
>> I'm getting this messag
and I don't think any access
to that port is allowed.
If the repo is not totally available on port 80 (or the https port)
then it's impossible to get from behind paranoid firewalls.
-- Lennart
___
Glasgow-haskell-users mailing list
Glasgo
That's a truly awesome feature! I'll shorten all my module names to
single letters tomorrow.
-- Lennart
On Tue, Dec 16, 2008 at 12:43 AM, Don Stewart wrote:
> dons:
>> Running time as a function of module name length,
>>
>> http://galois.com/~dons/images/re
Turning on UndecidableInstances is the same as saying: OK typechcker,
you can loop if I make a mistake.
I've not looked closely at your code, but if you turn on that flag,
looping is probably not a bug.
-- Lennart
2008/12/4 José Pedro Magalhães <[EMAIL PROTECTED]>:
> Hello a
rom the overlay.
If you run into trouble, reply to the ml, or find us in #gentoo-haskell
at freenode.
Cheers,
Lennart Kolmodin -- using his Gentoo Linux Developer hat
[1] http://code.haskell.org/gentoo/gentoo-haskell/
[2] http://www.gentoo.org/proj/en/overlays/userguide.xml
l.org/trac/ghc/ticket/2716
(closed as invalid as the problem isn't with GHC)
Gentoo bug report at http://bugs.gentoo.org/237882 to fix gentoo's libedit.
You can try to apply the patch in the gentoo bug locally and see if that
resolves the issue.
Chee
True, if there can be indirections then that's bad news.
That would make strict fields much less efficient.
But I don't see why indirections should be needed. Simon?
On Wed, Oct 15, 2008 at 4:21 PM, Jan-Willem Maessen
<[EMAIL PROTECTED]> wrote:
>
> On Oct 15, 2008
I totally agree. Getting the value of the field should just evaluate
x and then use a pointer indirection; there should be no conditional
jumps involved in getting the value.
GHC is just doing the wrong thing.
-- Lennart
On Wed, Oct 15, 2008 at 3:58 PM, Tyson Whitehead <[EMAIL PROTEC
kell/cabal.
Then, simply:
$ emerge ghc
Cheers,
Lennart Kolmodin
[1] http://www.gentoo.org/proj/en/overlays/userguide.xml
[2] http://gentoo-wiki.com/Masked#Hard_Masked
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.h
ems i either get
> non-inlined 'onInt's in various forms or multiple matches out of the same
> dictionary, but with generic method names rather than the original
> 'fromInt'/'toInt'.
>
> claus
>
>> Thanks a million, Lennart! -fno-method-sharing was th
Here's something that actually works. You need to pass
-fno-method-sharing on the command line.
Instead of using rules on methods it uses rules on global functions,
and these global functions don't get inlined until late (after the
rule has fired).
-- Lennart
module F where
-- | D
after toInt and fromInt have been inlined you can no longer
write rules that apply, since the types involve dictionaries and the
terms pattern match on dictionaries.
-- Lennart
2008/6/7 Conal Elliott <[EMAIL PROTECTED]>:
> I'm trying to do some fusion in ghc, and I'd greatly ap
There are no rules written down. But the fast exponentiation
algorithm used by (^) assumes that (*) is associative.
I also don't think that fast exponentiation should ever multiply by 1.
-- Lennart
On Sun, Jun 1, 2008 at 6:34 PM, Serge D. Mechveliani <[EMAIL PROTECTED]> wrote:
&g
GHC is bad at CSE. Of course, in general CSE might not be a good idea, but
with strict computations it is. So someone needs to add a CSE pass.
On Sat, Mar 29, 2008 at 2:23 AM, Don Stewart <[EMAIL PROTECTED]> wrote:
> conal:
> >I'd like to know if it's possible to get GHC to perform some sim
I had it pretty well worked out for single parameter type classes, but I
couldn't see any nice extension to multiple parameters.
On Dec 11, 2007 5:30 PM, Simon Peyton-Jones <[EMAIL PROTECTED]> wrote:
> | If it really would work ok we should get it fully specified and
> | implemented so we can fix
I agree. There are other ways that to solve the same problem as the case
distinction does.
On Dec 7, 2007 12:45 PM, Johannes Waldmann <[EMAIL PROTECTED]>
wrote:
> On Fri, 7 Dec 2007, Manuel M T Chakravarty wrote:
>
> > The problem is that Haskell 98 already messed that up.
> > If type function
which you can always(?) do with type variables.
-- Lennart
On Dec 5, 2007 11:34 PM, Wolfgang Jeltsch <[EMAIL PROTECTED]>
wrote:
> Am Mittwoch, 5. Dezember 2007 17:05 schrieb Simon Peyton-Jones:
> > […]
>
> > Anyway, while on this subject, I am consideri
Or use a preprocessor that inserts a LANGUAGE pragma. :)
On Nov 22, 2007 9:14 AM, Simon Marlow <[EMAIL PROTECTED]> wrote:
> Alex Jacobson wrote:
>
> > In any case, I'm pretty sure the correct answer is not 50 language
> > pragmas with arbitrary spellings for various language features at the
> > t
This seems very, very wrong. The missing instance(s) might be left out
because of some good reason (e.g. if you have implemented sets with list and
not provided Ord).
On Nov 21, 2007 12:59 AM, Duncan Coutts <[EMAIL PROTECTED]> wrote:
> On Tue, 2007-11-20 at 19:18 -0500, Alex Jacobson wrote:
> >
I'm very much in favor of listing the exact extensions used in each file,
because I try to keep them to a minimum.
I would like to see a LANGUAGE Haskell' which includes the things that are
likely to be in Haskell' (if there is ever a Haskell').
-- Lennart
On Nov 20
I'd like to second that. 6.8 is quite an improvement. Well done!
-- Lennart
On Nov 8, 2007 12:18 PM, Ravi Nanavati <[EMAIL PROTECTED]> wrote:
> I just finished a running Bluespec's regression suite on a version of
> our tools compiled with ghc 6.8.1. The results
Look at the end of http://haskell.org/haskellwiki/GHC/Indexed_types
-- Lennart
On 8/31/07, Jim Apple <[EMAIL PROTECTED]> wrote:
>
> Regarding
>
> http://www.haskell.org/pipermail/cvs-ghc/2007-August/037655.html
>
> and
>
> Are type functions checked for terminatio
ate
; ghc-pkg hide # gives you a list of
# packages and optional flags
The ghci support is very minimalistic at this point... it only completes
on packages.
That's it!
Cheers,
Lennart
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: U
For me the type is important, I want to see it for every top level
function. Using named types it serves as documentation.
-- Lennart
On Sun, 13 May 2007, Joel Reymont wrote:
Date: Sun, 13 May 2007 14:23:42 +0100
From: Joel Reymont <[EMAIL PROTECTED]>
To: GHC Users Mailin
On Apr 16, 2007, at 15:54 , Simon Marlow wrote:
- left-to-right impredicative instantiation: runST $ foo
Is this really a good idea? This will just make people complain that
€ (x € f = f x) doesn't work when you do foo € runST (or maybe it
does?).
-- Le
s and that is IsIntT::IsInt Int
And since Haskell uses nominal type equality there is no type equal
to Int that is not Int.
The fact that you can derive IsIntC looks like a good ole' bug to me.
-- Lennart
On Mar 28, 2007, at 23:22 , Stefan O'Rear wrote:
On Wed, Mar 28
Sorry, but I'm not always connected to the Internet. I'd like to be
able to get flag help easily anyway.
-- Lennart
On Mar 13, 2007, at 14:28 , Simon Peyton-Jones wrote:
Suppose ghc --full-flag-help simply printed the URL
http://www.haskell.org/ghc/docs/l
te a parser for some Core language of GHC 5 a
couple of years ago. Um... 2003. It seems to be part of the bnfc[1]
tarball as an example. Perhaps you can use that somehow?
[1] http://www.cs.chalmers.se/~markus/BNFC/
Cheers,
Lennart Kolmodin
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.4.6 (GNU/Li
On 3/6/07, Lennart Augustsson <[EMAIL PROTECTED]> wrote:
Yeah, you really need {-# NOINLINE var #-} to make it reasonable
safe.
Couldn't GHC bake in knowledge about unsafePerformIO, and never inline
it? It is a slightly hacky solution, but since unsafePerformIO is
pretty much only used
Yeah, you really need {-# NOINLINE var #-} to make it reasonable safe.
On Mar 6, 2007, at 23:18 , David Brown wrote:
Seth Kurtzberg wrote:
On Tue, 06 Mar 2007 12:03:05 -0800
David Brown <[EMAIL PROTECTED]> wrote:
I've noticed quite a few pages referencing constructs such as:
var :: MVar (
Marc Weber wrote:
Without really knowing in which context this function is going to be
HaskTags.hs from ghc distribution.
Mm, yes. I meant I was to lazy to check which results are appropriate :)
K
___
Glasgow-haskell-users mailing list
Glasgow-haskel
;data"," ","LogInController"," = ","LogInController","
{","rLoggedIn","::","R"," ","Bool",", ","rwUserName","::","RWE","
","String",", ","rwPasswd","::","RWE"," ","String","}"]
Cheers,
Lennart K
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Sure, inferring and comparing for alpha-equal is not the best thing
pragmatically. But you asked for an algorithm that would work. :)
So the band-aid solution would be to first try with the signature, if
that fails, try without and then then use the sig.
-- Lennart
On Dec 13
s not accepted. And I turn on the warning for a
missing type sig. And if it were feasible to make this an error I
would.
-- Lennart
On Dec 13, 2006, at 13:42 , Claus Reinke wrote:
call me a stickler for details, if you must, but I am still worried
that this is
not an undesirable inabili
re
complicated than that, of course).
If the type checker doesn't really deduce 'forall a b . C a b => a ->
a' then it shouldn't print what it does.
So I'm curious, what is the exact deduced type?
-- Lennart
On Dec 11, 2006, at 07:16 , Simon Peyton-Jone
esn't know what I
mean. Then ghc is broken.
I don't see how steps 1-3 can happen unless there is something
broken. And I think the problem is in step 2. The b there isn't
quite what it seems to be. And if it isn't, it should be marked as
such.
-- Lennar
My (off-the-top-of-my-head) suggestion was much more modest.
A context synonym would only allow you to shorten contexts, it would
not be a new class.
On Dec 7, 2006, at 10:53 , J. Garrett Morris wrote:
On 12/7/06, Lennart Augustsson <[EMAIL PROTECTED]> wrote:
Speaking of wishlist, I&
I should have said that the situation in H98 is quite bad.
There you can't make default instances.
On Dec 7, 2006, at 07:49 , Johannes Waldmann wrote:
Lennart Augustsson wrote:
Speaking of wishlist, I'd also like to see context synonyms, e.g.,
context C a = (Ord a, Num a)
T
leave out type signatures altogether (but only a few people
advocate this (hello John!)).
-- Lennart
On Dec 7, 2006, at 07:20 , Johannes Waldmann wrote:
Lennart Augustsson wrote:
Btw, this reminds me again that I'd like to be able to use _ in type
signatures.
With the meaning of
signatures.
With the meaning of _ being, "there's a type here, but I can't be
bothered to write it out in full."
-- Lennart
On Dec 6, 2006, at 02:46 , Simon Peyton-Jones wrote:
I agree that this is confusing. Here is a cut-down example:
class C a b where
ince the evaulated form
doesn't take more space than the unevaluated.
-- Lennart
On Nov 28, 2006, at 09:50 , Bertram Felgenhauer wrote:
Dinko Tenev wrote:
On 11/27/06, Lennart Augustsson <[EMAIL PROTECTED]> wrote:
GHC doesn't normally do CSE. CSE can cause space leaks, so
GHC doesn't normally do CSE. CSE can cause space leaks, so you can't
do it willy-nilly.
I'm sure there are some strict contexts where it could be done
safely, but I don't think ghc uses that information (yet).
-- Lennart
On Nov 27, 2006, at 08:34 , Christian
wrong (if anything)? Or
> what do I need to do to get Gtk2Hs to compile under 6.6?
The problem is that gkt2hs 0.9.10 doesn't support GHC 6.6.
Try the darcs version instead:
darcs get --partial http://darcs.haskell.org/gtk2hs/
As usual, it will be released when it's ready :)
Cheers,
Lennart Kolmodin
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
pletion, it's nice if the
application in question has support for it. A nice example of this is
darcs[1] which implements the command '--commands' and the flag
'--list-option'.
Cheers,
Lennart Kolmodin
[1] http://www.abridgegame.org/repos/darcs-unstable/darcs_comple
If we allow C{..} in patterns we should absolutely have it in
expressions too. Both for symmetry and usefulness.
-- Lennart
On Oct 31, 2006, at 14:06 , Iavor Diatchki wrote:
Hello,
I think the "it may be confusing to novices" argument tends to be
over-used and we should
I could set you up with an account on my laptop, it's mostly
connected to the Internet, but sometimes I take it with me.
If you don't get any other offers, tell me.
It's x86 MacBook.
-- Lennart
On Sep 28, 2006, at 06:01 , Simon Peyton-Jones wrote:
Folks
Quite a
And what would rotating an Integer mean? The only sensible
interpretation I can think of is to make it behave like shift.
On Sep 18, 2006, at 23:46 , Peter Tanski wrote:
Welcome back! Since Data.Bits is not defined in the Haskell 1998
standard, are we free to change the implementation of D
On Aug 30, 2006, at 20:44 , Jan-Willem Maessen wrote:
On Aug 30, 2006, at 6:04 PM, Lennart Augustsson wrote:
On Aug 30, 2006, at 14:58 , David Roundy wrote:
On Wed, Aug 30, 2006 at 07:38:35PM +0100, Jamie Brandon wrote:
I recently defied my supervisor and used Haskell to write my
Slightly tongue in cheek, I think the real problem is that your
courses come in the wrong order. No one should use floating point
numbers without first having a course in numerical analysis. :)
-- Lennart
On Aug 30, 2006, at 14:38 , Jamie Brandon wrote:
I recently defied my
question (i.e.,
0.1+0.2). Printing it with fewer decimals would yield a different
number if it was read back.
-- Lennart
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
keep the
overhead for bignums really low. But it requires very special
handling of bignums and I'm not sure it's worth it.
-- Lennart
On Aug 1, 2006, at 03:02 , Simon Peyton-Jones wrote:
If there was an alternative small/big rep, no matter how encoded,
it'd still entail
A more clever representation of Integer could unbox numbers in big
range.
But that would require some runtime support, I think.
-- Lennart
On Jul 31, 2006, at 11:19 , Duncan Coutts wrote:
On Mon, 2006-07-31 at 14:32 +0400, Serge D. Mechveliani wrote:
Dear GHC developers,
Long ago
a bug report with them. :)
-- Lennart
Michael Marte wrote:
Hello *,
if a runtime error occurs inside a DLL compiled by ghc (like
"irrefutable pattern match failed" or exceptions caused by error),
the application that called the DLL function dies. This is ok for
development b
No, the timer thread starts even without -threaded.
If you use -threaded it gets worse because then you have
a bunch of other threads that don't exit properly.
-- Lennart
Quoting Simon Marlow <[EMAIL PROTECTED]>:
Lennart Augustsson wrote:
I've found more bugs. There
after the DLL has been unloaded. Which gives you
an access violation.
I don't have a proper fix for this yet.
-- Lennart
Michael Marte wrote:
Lennart,
do you imply that you have fixed the problem causing the crashes?
May I safely assume that DLLs produced by ghc 6.4.2 will not
I'm not implying anything, except that I've plugged the space
leak of 256M every time a DLL is loaded&unloaded.
-- Lennart
Michael Marte wrote:
Lennart,
do you imply that you have fixed the problem causing the crashes?
May I safely assume that DLLs produced by ghc 6.4.2
The memory allocated by the runtime system is never freed.
I've submitted a fix fir this.
-- Lennart
Michael Marte wrote:
Hello *,
before filing a bug report, I want others to comment on my problem.
Maybe it's my fault, not ghc's.
I wrapped up some Haskell modules
Donald Bruce Stewart wrote:
Most distros are using binary bootstrapping. I think OpenBSD is the only
one building from .hc src.
And NetBSD.
-- Lennart
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
ssible
interleavings is just stupid. That way lies madness...
(and slowness!).
-- Lennart
Simon Marlow wrote:
On 07 December 2005 19:57, Claus Reinke wrote:
there seem to be two issues here - can we agree on that at least?
1) scheduling non-sequential programs on sequential processo
You can write a simple shell script wrapper around ghci that
takes care of .a files.
-- Lennart
Keean Schupke wrote:
Thaks guys... I realise it is a simple matter of unpacking the object
files, however when using ghci for prototyping, it can be more
convenient to have all the '
And on many platforms (well, at least a few years ago) a "shared"
library doesn't have to be PIC. The dynamic loader can do relocation
when it loads the file. (Then it can't be shared.)
But this was a few years ago on Solaris and BSDs, it could be
different now.
--
Can't you unpack the ar library and then link the object files
into a shared library?
-- Lennart
Keean Schupke wrote:
GHCI does not load archive libraries. Is it possible (easy?) to get it
to load (.a) archive libraries as well as .o and .so files? The problem
is some opti
oaded on the Alpha?
-- Lennart
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
s for you.
Cheers,
Lennart Kolmodin
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
think?
Cheers,
Lennart Kolmodin
--
"The only thing that interferes with my learning is my education."
-- Albert Einstein
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Andre Pang wrote:
On 10/06/2005, at 11:16 AM, Remi Turk wrote:
Are you sure you're not talking about unsafePerformIO?
System.IO.Unsafe.unsafePerformIO:: IO a -> a
System.IO.Unsafe.unsafeInterleaveIO :: IO a -> IO a
[written to Lennert Augustsson]: yes, I think you misread
unsafeInter
You pick. :)
It can break referential transparency. It can break type safety.
-- Lennart
Andre Pang wrote:
G'day all,
Just looking at the documentation for System.IO.unsafeInterleaveIO,
what exactly is unsafe about it?
___
Gl
-exts/
by Niklas Broberg.
There is also a parser in Haddock which saves Haddock comments
(naturally :)) :
http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/haddock/
by Simon Marlow and friends. I don't know whether it's good on
extensions or not.
/ Lennart Kolmodin
--
"The on
installation of ghc-6.2.2?
Thanks in advance,
Lennart
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
ng ghc
as a separate process.
What is the status of the package and where can I get it?
I can't find it in the CVS or in any of the snapshots.
/Lennart
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
natural in some circumstances (since
you can do a Möbius transformation from a circle to an infinite line).
Haskell, on the othet hand, does not let you specify the mode.
-- Lennart
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.h
have *exactly* the same denotation as
the function in the Report.
What use would the Report be if you didn't treat it this way?
-- Lennart
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/gl
a family of functions that are really the identity, but
with different types. Read the paper, I think you could add it to ghc
without too much trouble.
-- Lennart
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/ma
an my efforts were :-)
As Simon pointed out, it's not so easy to do this with an
optimizing compiler that may inline selector functions.
The "right" way to do this is to have specialized code
that runs during GC for each thunk. This was investigated
in Christina von Dor
Simon Peyton-Jones wrote:
generate case expressions when there is more
than one string in the list, otherwise use an equality test
Oh, you mean like hbc does? ;-)
Sorry, couldn't resist.
-- Lennart
___
Glasgow-haskell-users mailing
1 - 100 of 117 matches
Mail list logo
