Couldn't you measure it by changing base to use data Int = I# {-# UNPACK
#-} Int# and see what happens?
On Thursday, February 16, 2012, Alex Mason wrote:
Hi Johan,
Sounds like it's definitely worth playing with. I would hesitate to use
the shootout benchmarks though, simply because anything
It doesn't do any copying.
On Thu, May 19, 2011 at 3:27 AM, Christian Höner zu Siederdissen
choe...@tbi.univie.ac.at wrote:
Hi,
I'd like to use repa in a rather perverted mode, I guess:
for my programs I need to be able to update arrays in place and
repeatedly perform operations on them.
-profit, allowing us to more directly accept
(US tax-deductible) donations, and to invest in assets that benefit the
Haskell open source community.
We welcome your feedback on the proposal attached below.
-- Don Stewart (on behalf of the Haskell.org committee
, Apr 29, 2011 at 12:00 AM, Don Stewart don...@gmail.com wrote:
I'm very interested in what the best way to get incremental event data
from a running GHC process would be.
Looking at the code, we flush the event buffer fairly regularly, but
the event parser is currently strict.
So we'd need
I've got a proof of concept event-log monitoring server and
incremental parser for event streams:
* http://code.haskell.org/~dons/code/ghc-events-stream/
* http://code.haskell.org/~dons/code/ghc-monitor/
Little screen shot of the snap server running, watching a Haskell
process' eventlog fifo:
I managed to build one on top of attoparsec's lazy parser that seems
to work -- but I'd like ghc to flush a bit more regularly so I could
test it better.
-- Don
On Sun, May 1, 2011 at 7:59 PM, Bryan O'Sullivan b...@serpentine.com wrote:
On Thu, Apr 28, 2011 at 3:00 PM, Don Stewart don
I'm very interested in what the best way to get incremental event data
from a running GHC process would be.
Looking at the code, we flush the event buffer fairly regularly, but
the event parser is currently strict.
So we'd need a lazy (or incremental) parser, that'll return a list of
successful
Perhaps look at the plugins package source?
-- Don
On Thu, Apr 7, 2011 at 12:20 PM, Rob Nikander rob.nikan...@gmail.com wrote:
Hi all,
I'd like to load a value from a .o file. I've got...
import ObjLink
main = do
initObjLinker
loadObj Thing.o
resolveObjs
Just ptr - lookupSymbol
MyPlugin.hs'?
Rob
On Thu, Apr 7, 2011 at 3:35 PM, Don Stewart don...@gmail.com wrote:
Perhaps look at the plugins package source?
-- Don
On Thu, Apr 7, 2011 at 12:20 PM, Rob Nikander rob.nikan...@gmail.com wrote:
Hi all,
I'd like to load a value from a .o file. I've got...
import ObjLink
ETA? We may do a minor rev of the HP at that point too, to set us up for 2011.
On Tue, Mar 15, 2011 at 10:04 AM, Ian Lynagh ig...@earth.li wrote:
Hi all,
Due to a number of issues in the 7.0.2 release, we plan to put out a
7.0.3 release before finally retiring the 7.0 branch.
We intend to
There's an open bug ticket about XCode 4 not linking properly (I think
due to the new dtrace support making GHC builds tied to a specific
XCode version).
Can you downgrade to XCode 3 in the meantime?
On Mon, Mar 14, 2011 at 8:43 AM, Luca Ciciriello
luca_cicirie...@hotmail.com wrote:
Hi All.
Does MacPorts still interact badly with libiconv? (The system and
MacPorts versions out of sync, making Haskell unbuildable unless in
MacPorts).
On Thu, Mar 10, 2011 at 5:50 AM, Christian Maeder
christian.mae...@dfki.de wrote:
Dear All,
we would appreciate a ghc-7.0.2 distribution package via
And that means you can't mix MacPorts and the Mac HP installer. We
might want to make that very clear.
On Thu, Mar 10, 2011 at 6:58 AM, Christian Maeder
christian.mae...@dfki.de wrote:
Am 10.03.2011 15:52, schrieb Don Stewart:
Does MacPorts still interact badly with libiconv? (The system
- Forwarded message from Isaac Gouy igo...@yahoo.com -
Date: Fri, 4 Mar 2011 09:11:16 -0800 (PST)
From: Isaac Gouy igo...@yahoo.com
To: Don Stewart d...@galois.com
Subject: fyi benchmarks game GHC 7.0.2
Hi
A couple of the measurement differences to GHC 7.0.1 look strange, just letting
hsunix? What version of GHC are you building?
teeler:
Hi,
I'm not sure where the right place is to configure this. While linking
hsunix + some others, the
compiler assumes that -lrt is the appropriate library to find
semaphore-related functions,
but for the particular toolchain i'm
Good work!
The HP team is ready to go!
-- Don
igloo:
We are pleased to announce the second release candidate for GHC 7.0.2:
http://www.haskell.org/ghc/dist/7.0.2-rc2/
This includes the source tarball, the Windows installer, and bindists
for 32bit and 64bit Intel OS X, amd64/Linux,
tsuraan:
I just read the article Scalable Event Handling for GHC by Sullivan
and Tibell, and I was wondering if its implementation has been
incorporated into the mainline GHC yet. I'm sure the information is
out there, but I'm having a bit of trouble searching on it. If it has
been
ddssff:
I can neither darcs pull nor darcs get the repository at
http://darcs.haskell.org/ghc - it just hangs indefinitely. Anyone
else having this problem?
Nope ...
$ darcs get http://darcs.haskell.org/ghc
This is the GHC darcs repository (HEAD branch)
For more information,
You can also buy the tshirt for this ticket :-)
http://haskell.spreadshirt.com/bring-back-monad-comprehensions-A6499530
simonpj:
Good idea. I've made a new Trac ticket and responded there. I suggest that
others do the same, so the conversation is captured in the ticket.
I've created a wiki page to track the common errors when upgrading to
GHC 7.
http://haskell.org/haskellwiki/Upgrading_packages/Updating_to_GHC_7
Solutions to each problem should be listed here.
simonpj:
I've been meaning to write a blog post about this, because it's a
significant
daniel.is.fischer:
Trying out HEAD (specifically, ghc-6.13.20100831-src.tar.bz2 built with
6.12.3) investigating an issue with the text package, I found that I/O of
ByteStrings has become significantly slower (on my machine at least:
$ uname -a
Linux linux-mkk1 2.6.27.48-0.2-pae #1 SMP
simonpj:
| ghc-6.12.3:
| 89,330,672 bytes allocated in the heap
| 15,092 bytes copied during GC
| 35,980 bytes maximum residency (1 sample(s))
| 29,556 bytes maximum slop
| 2 MB total memory in use (0 MB lost due to
johan.tibell:
Hi,
I'm trying to create a data type for maps where both keys and values are
unpacked into the data type constructors (see code at the end of this email).
I
achieve this using an associated data type of two arguments (`Map` in the code
below). The problem I have is that this
jac:
Hi,
I'd like to learn how to use ghc rewrite rules. I simply want to replace
a function called f by a function called g. I do not unterstand why the
rule f-g does not fire.
Cheers, Jan
module Main where
{-# RULES
f-gforall x. f x = g x
#-}
main :: IO ()
main =
v.dijk.bas:
Hello,
I've a short question about interruptible operations. In the following
program is it possible for 'putMVar' to re-throw asynchronous
exceptions even when asynchronous exception are blocked/masked?
newEmptyMVar = \mv - block $ putMVar mv x
The documentation in
duncan.coutts:
On Wed, 2010-05-05 at 21:24 +1000, Roman Leshchinskiy wrote:
Whenever I do cabal sdist on one of my projects, I get this warning:
Distribution quality warnings:
'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit
and not just imposing longer
choener:
To summarise: I need arrays that allow in-place updates.
Many of the array libraries provide both mutable and immutable
interfaces, typically in ST or IO, including vector.
___
Glasgow-haskell-users mailing list
Any 'internal error' is almost certainly an RTS or compiler bug. Can you
make a bug report?
philip.weaver:
Hi all,
A program that I built with GHC is crashing at runtime with the following
error:
internal error: eval_thunk_selector: strange selectee 12
I have not found much via
Sounds like the known issue of ghc --make (the compilation manager)
retaining meta data (like .hi file info) when compiling many modules.
This isn't the case with one-shot compiltation.
I'm not sure there's anything you can do about it.
aslatter:
Including ghc-users.
On Sat, Mar 6, 2010 at
I tried out some of the vector and uvector fusion benchmarks with the
new LLVM backend
http://donsbot.wordpress.com/2010/02/21/smoking-fast-haskell-code-using-ghcs-new-llvm-codegen/
and got some great results for the tight loops generated through fusion.
Up to 2x faster than gcc -O3 in some
garious:
Static linking to GMP on Windows is sending me towards a bunch of red
tape at work. What can I do to make integer-simple the default
integer library for GHC? Need anything more than test suite and
performance metrics? Any date planned for the 6.12.2 release?
You can dynamically
marlowsd:
I manged to improve this:
Main_mainzuzdszdwfold_info:
.Lc1lP:
addq $32,%r12
cmpq 144(%r13),%r12
ja .Lc1lS
movq %r14,%rax
cmpq $10,%rax
jne .Lc1lV
movq $ghczmprim_GHCziTypes_Dzh_con_info,-24(%r12)
movsd
.
-scooter
--Original Message--
From: Don Stewart
Sender: glasgow-haskell-users-boun...@haskell.org
To: glasgow-haskell-users@haskell.org
Subject: Re: Removing/deprecating -fvia-c
Sent: Feb 14, 2010 09:58
igloo:
Hi all,
We are planning to remove the -fvia-c way of compiling code
marlowsd:
Simon Marlow has recently fixed FP performance for modern x86 chips in
the native code generator in the HEAD. That was the last reason we know
of to prefer via-C to the native code generators. But before we start
the removal process, does anyone know of any other problems with the
dons:
marlowsd:
Simon Marlow has recently fixed FP performance for modern x86 chips in
the native code generator in the HEAD. That was the last reason we know
of to prefer via-C to the native code generators. But before we start
the removal process, does anyone know of any other
marlowsd:
On 03/02/2010 15:39, Simon Peyton-Jones wrote:
| Or we could switch to different quotation brackets altogether for
| quasiquotation, the obvious possibility being|...blah...|, and
| pads|...blah...|. That would not be hard, and would only affect the
| handful of current
igloo:
Hi all,
We are planning to remove the -fvia-c way of compiling code
(unregisterised compilers will continue to compile via C only, but
registerised compilers will only use the native code generator).
We'll probably deprecate -fvia-c in the 6.14 branch, and remove it in
6.16.
Why cross compile when we already have a native GHC on OpenBSD/x86_64 ..
use that to build the source directly.
khaelin:
Hi,
I'm trying to cross-compile GHC as follows:
Host: Linux, x86_64, GHC 6.12.1
Target: OpenBSD 4.6 stable, i386
I follow the guide at:
ia:
I'm looking for a way of specifying language extensions in a way which will
work in all versions of GHC from 6.4 onwards.
GHC 6.4 does not support the LANGUAGE pragma. Specifying language options in
the OPTIONS_GHC pragma starts to produce deprecation warnings in 6.10, and
will
Hey Haskellers,
Looks like a great opportunity to talk about parallel Haskell to other
communities:
Second USENIX Workshop on Hot Topics in Parallelism
http://gpgpu.org/2009/12/20/cfp-hotpar-2010
Following the tremendous success of HotPar ‘09, the Second USENIX
Workshop on Hot
catamorphism:
On 11/30/09, Matthijs Kooijman matth...@stdin.nl wrote:
Hi All,
I was wondering if there are any formal semantics defined for GHC's core
language? I'm working with some core to core rewriting passes for which I'd
like to verify the soundness, but that would require some
christosc:
I've noticed that when I load in GHCi a file that has a non-latin name,
although it gets loaded, its name appears garbled in the message after
the loading:
Prelude :load πρόχειρον.hs
[1 of 1] Compiling Main ( ÏÏοÌÏειÏον.hs,
interpreted )
Ok, modules
http://softtalkblog.wordpress.com/2009/09/29/more-about-haskell-and-intel-concurrent-collections/
Intel involved in work to port Concurrent Collections to Haskell.
Might be interesting for benchmarks on 6.12
-- Don
___
Glasgow-haskell-users mailing
mechvel:
People,
I need to convert Char - Int in a possibly _standard_ way for
Haskell -- and also in an efficient way. In particular, it must not
spend 100 comparisons in a look through the listing of Char.
I use ord :: Char - Int and chr :: Int - Char.
ord and chr are
marlowsd:
Simon and I have been chatting about how we accommodate libraries in the
GHC repository. After previous discussion on this list, GHC has been
gradually migrating towards having snapshots of libraries kept as
tarballs in the repo (currently only time falls into this category),
axman6:
Hi all,
I've been talking to one of the LLVM developers, who's working on an
operating system called AuroraUX, which, among other things, is trying
to use LLVM as much as possible in the system (using clang as the
default compiler, compiler-rt [libgcc replacement from the LLVM
joshua:
Hello, I'm quite new to Haskell, but experienced in other languages (C,
Python, Ruby, SQL, etc). I am interested in Haskell because I've heard
that the language is capable of lots of optimizations based on laziness,
and I want to learn more about that.
I dug in with Project Euler
bulat.ziganshin:
Hello Joshua,
Sunday, August 2, 2009, 11:45:57 AM, you wrote:
94,604 bytes allocated in the heap
Is there any way I could find out what these 94kb of RAM were
allocated for? This seems high -- my entire program's working set
is 6kb.
as Don said,
dons:
Showing what transformations happened. Notably, 2 occurences of the
streamU/unstreamU
transformation, to remove intermediate structures.
The final code looks like:
$s$wfold :: Int# - Int#
$s$wfold =
\ (sc_s19l :: Int#) -
case modInt# (-9223372036854775807) 3 of
jgbailey:
I apologize in advance for the vagueness of my report here - it's one
of those situations I'm not sure how to cut it down to size yet.
I have a module that uses HaskellDB and Template Haskell together. The
module itself depends on 23 other modules, each of which give a type
jgbailey:
On Fri, Jul 24, 2009 at 2:02 PM, Don Stewartd...@galois.com wrote:
Oh, and I note you're not using -O or -O2 either?
-- Don
This is a compile time problem, wouldn't -O make it worse?
Almost certainly!
___
Glasgow-haskell-users
Interesting.
- Forwarded message from Neal Alexander relapse@gmx.com -
Date: Tue, 21 Jul 2009 18:48:38 -0700
From: Neal Alexander relapse@gmx.com
To: haskell-c...@haskell.org
Subject: [Haskell-cafe] System.Mem.performGC leaks?
main = forever performGC
The OS reported memory
Might be interesting to try the transformation manually and benchmark?
simonpj:
Nice idea, but I’m not yet convinced that it would work well in practice.
First, there’s an exponential explosion in the number of constructors
required. Anything with an exponential is worrying.
Something for SimonPJ
- Forwarded message from Reiner Pope reiner.p...@gmail.com -
Date: Mon, 20 Jul 2009 22:09:09 +0930
From: Reiner Pope reiner.p...@gmail.com
To: Haskell Cafe mailing list haskell-c...@haskell.org
Subject: [Haskell-cafe] SpecConstr difficulties
Hi everyone,
I've been
john:
I noticed that programs compiled with GHC 6.10 seem to be eating signals
and exiting with an error code of 255, rather than the proper exit code
for the signal that killed the process.
I can understand that the GHC runtime may need to perform some cleanup
on a SIGINT or other signal,
Don't use TransformListComp ??
-- Don
ndmitchell:
Hi,
The TransformListComp extension makes group a keyword. Unfortunately
group is a useful function, and is even in Data.List. Thus,
Data.List.group and TransformListComp are incompatible. This seems a
very painful concession to give up a
Not part of the core libs, so these are slowly disappearing from the
extralibs bundled shipped with GHC (in favour of the platform bundle).
The 6.10.3 windows installer is due out June 1.
-- Don
ndmitchell:
Hi,
I just downloaded the Windows snapshot of 6.10.3.20090526, and found
that mtl
duncan.coutts:
On Fri, 2009-05-22 at 05:30 -0700, Don Stewart wrote:
Answer recorded at:
http://haskell.org/haskellwiki/Performance/Parallel
I have to complain, this answer doesn't explain anything. This isn't
like straight-line performance, there's no reason as far as I can see
Catch already does assertion checking (1). Its runtime on moderate to
small programs (HsColour in particular) is far less than the time GHC
takes to compile them, and I still have no idea what its runtime is on
enormous programs (2). An analysis can be whole program and can be
slow, one does
ndmitchell:
Catch already does assertion checking (1). Its runtime on moderate to
small programs (HsColour in particular) is far less than the time GHC
takes to compile them, and I still have no idea what its runtime is on
enormous programs (2). An analysis can be whole program and can be
ndmitchell:
If Catch says your program will not crash, then it will not crash. I
even gave an argument for correctness in the final appendix of my
thesis http://community.haskell.org/~ndm/thesis/ (pages 175-207). Of
course, there are engineering concerns (perhaps your Haskell compiler
ndmitchell:
OK. i'm just trying to get an intuition for the analysis.
Catch is defined by a small Haskell program. You can write a small
Haskell evaluation for a Core language. The idea is to write the
QuickCheck style property, then proceed using Haskell style proof
steps. The checker is
I'm not sure I'd want -Wall on by default (though being -Wall clean is
very good). But exhaustive pattern checking might well help out a lot of
people coming from untyped backgrounds.
http://ocaml.janestreet.com/?q=node/64
Ron's also wondering why exhaustive pattern checking isn't on ?
petersen:
2009/5/10 Ian Lynagh ig...@earth.li:
On Sat, May 09, 2009 at 05:59:22PM +1000, Jens Petersen wrote:
Could you please update the Fedora entry on the distribution packages page:
:
Thanks for the update; done.
Thank you very much, Ian!
Sorry one more thing I forgot: would
- Forwarded message from Johan Tibell johan.tib...@gmail.com -
Date: Sun, 10 May 2009 19:23:20 +0200
From: Johan Tibell johan.tib...@gmail.com
To: haskell-cafe haskell-c...@haskell.org
Subject: [Haskell-cafe] Heads up: Conflicting versions of network-2.2.1
Hi,
The version of
marlowsd:
On 28/04/2009 17:25, Johannes Waldmann wrote:
Thanks for your comments.
Check whether it is GC-bound by using +RTS -sstderr.
Well yes, it does a lot of GC (there's no way for the compiler
to optimize away the list of primes) because that was the point
of the example: to
Hey Scott,
Yes, I think this is the appropriate place. The Data Parallel Haskell
team, and the GHC rts team are watching!
-- Don
scooter.phd:
[Sorry if this is the wrong place to hold this discussion... I'll move
it if told to do so...]
Simon P-J (et. al.) did recently publish a paper on
I've added more notes to this page:
http://haskell.org/haskellwiki/Performance/Parallel
berthold:
Message: 8
Date: Fri, 24 Apr 2009 19:20:46 +0200
From: Johannes Waldmann waldm...@imn.htwk-leipzig.de
Subject: Threads and memory management
To: glasgow-haskell-users@haskell.org
marlowsd:
2009/4/20 Dave Bayer ba...@cpw.math.columbia.edu:
I ran some longer trials, and noticed a further pattern I wish I could
explain:
I'm comparing the enumeration of the roughly 69 billion atomic lattices on
six atoms, on my four core, 2.4 GHz Q6600 box running OS X, against an
Could you send a full example we can compile and test?
This is only a fragment.
bulat.ziganshin:
Hello glasgow-haskell-users,
i've looked for this bug in Trac but don't found anything. so:
startGUI action = runInBoundThread $ do
unsafeInitGUIForThreadedRTS
myThreadId = writeIORef
daniel.is.fischer:
Am Sonntag 05 April 2009 10:24:25 schrieb Ashley Yakeley:
Duncan Coutts wrote:
In the mean time you can just:
$ cabal install time
Where do I get the cabal command? I'm installing GHC on a new machine
and I was hoping it would be included. I can't obtain it via
choener:
Hi,
having tried the 6.10.2rc1 release candidate, I still find that parMap
rnf xs on a list of thunks xs does not optimally use all available
processors. With N the number of cores, I still see that each block of N
thunks (say: x_1 and x_2) has to be calculated before (x3 and x4)
bulat.ziganshin:
Hello Neil,
Tuesday, March 24, 2009, 9:08:08 PM, you wrote:
one more case
0.16% percent of Hackage!
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
colin:
I am trying to incorporate Dana Xu's static contract checking code
into ghc 6.11. I've run into a problem that puzzles me. I am getting
the following error message:
verify/SimplIface.lhs:16:7:
Could not find module `Text.ParserCombinators.Parsec.Language':
Use -v to see
We must have the gtk2hs team invovled in this discussion. They were
using an undocumented feature. It may be trivial to fix.
--Don
jnf:
Hello Simon,
I've put a request about the issue on the gtk2hs users mailing list:
I've tried a gtk2hs app on ghc 6.10.2 release candidate.
It crashes
marlowsd:
Ben Lippmeier wrote:
On 12/03/2009, at 12:24 AM, Satnam Singh wrote:
Before making the release I thought it would be an idea to ask people
what other features people would find useful or performance tuning.
So if you have any suggestions please do let us know!
Is it available
karel.gardas:
Don Stewart wrote:
marlowsd:
Ben Lippmeier wrote:
On 12/03/2009, at 12:24 AM, Satnam Singh wrote:
Before making the release I thought it would be an idea to ask people
what other features people would find useful or performance tuning.
So if you have any suggestions
tuomov:
On 2009-03-11, Simon Marlow marlo...@gmail.com wrote:
For a start, you should set your platforms like this:
build = i386-unknown-mingw32
host = i386-unknown-mingw32
target = i386-unknown-cygwin32
GHC configuration does not support differing host/target (i.e.,
tuomov:
I want a _real_ cygwin version of darcs. The non-deterministic
pseudo-cygwin *nix/Windows hybrid currently available has just
too many problems integrating into cygwin, that I want to use as
my TeXing and minor coding environment. A real cygwin version
of darcs would seem to depend
Hey guys,
We have nice fusion frameworks now. E.g. stream fusion on uvector,
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/uvector
Takes something like this:
import Data.Array.Vector
import Data.Bits
main = print . productU . mapU (*2) . mapU (`shiftL` 2) $
claus.reinke:
Here is a trivial example with drastic difference between
T = Int and T = Word (~2.5x here):
main = print $ foldl' (+) 0 [1..1::T]
..
GHC.Prim.word2Int#
(GHC.Prim.and#
(GHC.Prim.int2Word# wild13_XbE)
(GHC.Prim.int2Word# y#_a4EZ))
marlowsd:
Claus Reinke wrote:
Here is a trivial example with drastic difference between
T = Int and T = Word (~2.5x here):
main = print $ foldl' (+) 0 [1..1::T]
..
A quick grep shows almost no specialization at all for Word, or for
IntXX/WordXX (see below). Still, none of that
claus.reinke:
Looking at prelude/PrelRules.hs has reminded me of an old
conundrum: if I switch from Int to Word, should I expect any
performance differences?
A while ago, I needed lots of fairly small positive numbers,
together with a small number of flags for each, so I thought
I'd switch
Ah ha! Excellent!
Much apprciated.
twhitehead:
I believe the arrays for (Word/Int)(8/16/32) are currently taking eight,
four,
and two times, respectively, as much memory as actually required. That is,
newMBU n = ST $ \s1# -
case sizeBU n (undefined::e) of {I# len# -
case
gwright:
Hi,
What is the preferred gcc to use with ghc 6.10.1? I'm starting
the long and doubtless slow process of putting together a more user
friendly (and binary distributable) ghc distribution to be built using
MacPorts.
The guidance about gcc on the wiki is vague. Is there a
Running time as a function of module name length,
http://galois.com/~dons/images/results.png
10 is the magic threshold, where indirections start creeping in.
Codegen cost heuristic fail?
-- Don
___
Glasgow-haskell-users mailing list
dons:
Running time as a function of module name length,
http://galois.com/~dons/images/results.png
10 is the magic threshold, where indirections start creeping in.
Codegen cost heuristic fail?
Given this, could you open a bug ticket for it, with all the info we
have,
hoangta:
Hello everybody,
I am following A Tutorial on Parallel and Concurrent Programming in
Haskell and I have a problem with making Haskell to use my multi-cores
(Core 2 Quad CPU).
The Haskel version I used is GHC 6.10.1, for Haskell 98. I compile my
below program with
igloo:
Hi all,
We've been weighing up the options to solve the recent problems that
editline has given us, and we think that this is the best way forward:
For 6.12:
* http://hackage.haskell.org/trac/ghc/ticket/2811
Implement unicode support for text I/O
(we've had this on the
shoot.spam:
Hi,
Please bear with a very basic question. I am trying to 'learn me a
Haskell for great good' using Hutton's book and some online tutorials.
I started off with Hugs and recently used GHC (to use the 'let a =
.. syntax interactively, which Hugs doesn't allow perhaps).
jwlato:
On Wed, Nov 19, 2008 at 4:17 PM, Simon Peyton-Jones
[EMAIL PROTECTED] wrote:
| I'm compiling with -O2 -Wall. After looking at the Core output, I
| think I've found the key difference. A function that is bound in a
| where statement is different between the monolithic and split
duncan.coutts:
I don't think I'm just speaking for myself when I say that pseq is
confusing and the docs similarly.
Given the type
a - b - b
we would assume that it is lazy in it's first arg and strict in the
second. (Even in the presence of seq we know that it really really must
be
jwlato:
Hello,
I have a problem with a package I'm working on, and I don't have any
idea how to sort out the current problem.
One part of my package is in one monolithic module, without an export
list, which works fine. However, when I've started to separate out
certain functions into
This is a straight forward ld.so path problem, by the sounds of it.
Are you sure you're setting ld environment search paths correctly?
-- Don
james.swaine:
that didn't fix the problem - i still get the same error message. the
configure script help should be updated though to show that
doesn't include /usr/local/lib, do you
think this might be the problem?
-james
On Fri, Nov 14, 2008 at 1:00 AM, Don Stewart [EMAIL PROTECTED] wrote:
james.swaine:
We've had unbelievable problems getting past this ridiculous
'unable to
load object file
at 12:02 PM, Don Stewart [EMAIL PROTECTED] wrote:
Is your LD_LIBRARY_PATH environment variable exported, and set to
include the path to the lib dir that libedit lives in?
e.g.
$ echo $LD_LIBRARY_PATH
/home/dons/lib
Allows the system linker to find things
james.swaine:
We've had unbelievable problems getting past this ridiculous 'unable to
load object file or shared library libedit.so.0' error when attempting to
build the 6.10.1 source tree. We initially just built editline in a user
directory and attempted to manipulate
judah.jacobson:
On Sun, Nov 9, 2008 at 6:42 AM, Duncan Coutts
[EMAIL PROTECTED] wrote:
On Sun, 2008-11-09 at 01:49 +, Ian Lynagh wrote:
On Sat, Nov 08, 2008 at 12:33:57PM -0800, Judah Jacobson wrote:
bind \e[3~ ed-delete-next-char
It's a shame this doesn't just work out of the
jeff.polakow:
Hello,
You will be even more surpised to find out that:
bar = (fst foo, snd foo)
is considered correct. Does this hint give you any insight?
This tells me that GHC definitely has a bug, or at at best an infelicity.
Hey Jeff,
File a bug here
duncan.coutts:
On Fri, 2008-11-07 at 13:02 -0800, Don Stewart wrote:
Does anyone know how libedit is supposed to be configured? readline
uses /etc/inputrc but libedit either does not or doesn't understand all
of it.
/me wonders if it was really necessary to switch from readline
1 - 100 of 197 matches
Mail list logo
