Great news!
The changelog (and the 3.6 branch) does not include
https://github.com/haskell/cabal/pull/7493. This is just as well since
HEAD (with this merge) doesn't fix the related issue in my testing, but I'm
curious if such a fix can be part of a point release or if it must be 3.8?
-Tom
On
I was able to get static linking working recently using docker alpine
images and ghcup to install GHC based on the musl library. The details are
in my Stan fork [1]. This borrowed heavily from ShellCheck's static
linking release system except it uses cabal v2-build instead of v1.
[1]
Script:
Packages registered with ghc are placed in the .ghc directory. You can
delete the directory entirely or selectively unregister using ghc-pkg.
On Dec 3, 2017 10:31 AM, "Volker Wysk" wrote:
> Hi!
>
> I want to remove eveything which cabal has installed, and begin again with
is not getting my responses to this thread.
-Thomas
On Fri, May 6, 2016 at 8:45 PM, Thomas DuBuisson
<thomas.dubuis...@gmail.com> wrote:
> On Thu, May 5, 2016 at 5:52 AM, Ben Gamari <b...@well-typed.com> wrote:
>>
>> So, if you would like to see your program's compilation time
On Thu, May 5, 2016 at 5:52 AM, Ben Gamari wrote:
>
> So, if you would like to see your program's compilation time improve
> in GHC 8.2, put some time into reducing it to something minimal, submit
> it to us via a Trac ticket, and let us know in this thread.
Please see
On Thu, Sep 6, 2012 at 10:33 AM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
On Thu, Sep 6, 2012 at 1:05 PM, Ian Lynagh i...@well-typed.com wrote:
* It is now possible to defer type errors until runtime using the
-fdefer-type-errors flag.
I don't remember if this was part of the
Another data point:
The bytestring 'break' rule fired fine for me (GHC 7.4.1 Linux x86-64).
On Mon, Aug 27, 2012 at 9:37 PM, Kazu Yamamoto k...@iij.ad.jp wrote:
Hello,
I seems to us (my friends and me) that term rewriting rules for
ByteString are not fired in recent GHCs.
6.12.3
Ryan,
If you make an AES based RNG then consider making an instance for
CryptoRandomGen (see DRBG [1] for example instances). Such an
instance means you can use splitGen [2], which can split generators
in the manner described in this thread. If you make the RNG match
NIST SP 800-90 then feel
In my case I omitted BangPatterns from the pragma by accident and was
thankful for the update.
One slight benefit of the strict requirement of correct pragma is it's
easier to survey Hackage to see how features are used, their
popularity, and inform language design (ex: Garrett Morris's Haskell
All,
A recent SO question [1] led me to do a quick test on hard-coding RTS
options as suggested in the manual rts-hooks section [2].
Unfortunately the timing tests indicate ghc_rts_opts isn't being
used; tests with flags besides -N (ex: -H1024m) also show the
ghc_rts_opts being ignored. Can
If I were you, I'd look at using the recent LLVM backend work as a
means to translate Haskell - ARM.
Thomas
On Sat, Nov 7, 2009 at 9:08 AM, han e...@xtendo.org wrote:
I am (in fact we are) working to make Haskell code to run on an ARM
Linux machine called GP2X Wiz, the open-source based
On Sat, Nov 7, 2009 at 11:16 AM, scooter@gmail.com wrote:
Do we have a native LLVM bitcode writer or is it still FFI?
I was referring to a paper [1] I just ran into on reddit. I only
skimmed it, but it seems they (or just he?) integrated LLVM as a new
backend for GHC.
Thomas
[1]
Is there a way from GHCi to discover the path to a particular module that
you have imported or loaded?
If you do ghci -v4 it will print out all the exposed modules right
below the package that exposes them and the directory the package is
in. You could just copy/paste this text and do a simple
Can you define very large and compiler? I know an old version of
GHC (6.6?) would eat lots of memory when there were absurd numbers of
let statements.
Thomas
2009/8/3 Günther Schmidt red...@fedoms.com:
Hi all,
I'm having trouble compiling very large source files, the compiler eats 2GB
and
Josh,
In general you'll find the haskell-cafe (haskell-c...@haskell.org) to
be a more lively place for this type of discussion, but since we're
here I might as well mention that memory use of a Haskell function is
one of the hardest things to gain an understanding about.
main = print (show (sum
15 matches
Mail list logo