- Glasgow-haskell-users

Re: Can't compile GHC 6.8.2
by John Lato 25 Nov '08

25 Nov '08

> On Monday 24 November 2008 23:15, Barney Stratford wrote: >> There's good news and bad news. The good news is that the compilation of >> my shiny almost-new GHC is complete. The bad news is, it won't link. >> It's grumbling about >> >> ld: >> /System/Fink/src/fink.build/ghc-6.8.2-1/ghc-6.8.2/rts/libHSrts.a(PrimOps.o) >> has external relocation entries in non-writable section (__TEXT,__text) >> for symbols: >> ___gmpn_cmp ----------- etc. ---------- IMO, many apple dev. tools are insidiously broken (Apple's cpp is my current nemesis). Could you try using a different linker? That might be a sufficient workaround. You could call gcc with the correct arguments to complete the linking phase, rather than ld (or vice-versa). The only other suggestion I've seen is to re-order the exported functions before compiling the library. I don't know if this would help in your case, but it has worked with other libraries. That's the best I can suggest, anyway. John

1 0

Backspace/delete/history in ghci
by Colin Paul Adams 24 Nov '08

24 Nov '08

I can't use the backspace key, or arrow keys in ghci (6.10.1) as i would normally expect to on any program on Linux. Is this connected with the readline/editline/haskelline debate I have observed recently? -- Colin Adams Preston Lancashire

3 5

Re: ANNOUNCE: GHC version 6.10.1 - EditLine / terminal incompatibility?
by Philip K.F. Hölzenspies 24 Nov '08

24 Nov '08

Dear Ian, all, After the announcement, I downloaded and installed the final release of 6.10.1. At some prior stage, I used the RC1 release, which had the same bug, but I had generally assumed it to be an RC-phenomenon. Which bug? Well... It seems editline has some incompatibility with my terminal. Maybe, I should configure something differently, but any and all of the control characters I type and work for all readline based (and all custom line-readers I have come across), but not for the new ghci. Most annoying is the fact that backspace doesn't work (instead, the control sequence ^? is printed and pressing enter results in "lexical error at character '\DEL'"). However, arrow keys (left ^[[D, up ^[[A, right ^[[C and down ^[[B) and common Ctrl+_ combinations (^d, ^e, ^a) also give similar errors. It is striking that the lexer does recognize them as the correct characters (printed error messages doe say \DEL, \EOT, \ENQ, etc). I'm using xterm (X.Org 6.8.99.903(229)) on an OpenSuSE 10.3 system and the default termcap settings. Any clues? Is this bug known? Regards, Philip

14 44

sum[1..100000] --> stack overflow in GHC, but not in Hugs?
by Vishal Belsare 23 Nov '08

23 Nov '08

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). There's a simple issue I am having with GHC. sum[1..100000] works fine on Hugs, however, the same in GHCi generates a stack overflow exception. I am trying to figure out what's going on. Prelude> sum[1..100000] 5000050000 Prelude> sum[1..1000000] *** Exception: stack overflow Prelude> ________________________ Hugs> sum[1..10000] 50005000 Hugs> sum[1..100000] 5000050000 Hugs> Thanks in anticipation. Best regards, Vishal Belsare ps: please excuse if the question is too uncool for the list. I come from an economics background; the markets are bad, I am depressed and to add to my pain, GHC refuses to let me know sum[1..100000] -- Firstly, I propose for myself the rule that the obviousness of a proposition does not free me from the obligation to continue searching for a proof of it, at least until I clearly realize that absolutely no proof could ever be required, and why. ~ Bernhard Bolzano

5 4

Unicode's greek lambda
by Kazu Yamamoto 22 Nov '08

22 Nov '08

Hello, When the -XUnicodeSyntax option is specified, GHC accepts some Unicode characters including left/right arrows. Unfortunately, the letter "greek lambda" cannot be used. Are there any technical reasons to not accept it? Regards, --Kazu

14 20

ghci-haskeline (was: Re: ANNOUNCE: GHC version 6.10.1 - EditLine / terminal incompatibility?)
by Judah Jacobson 21 Nov '08

21 Nov '08

On Thu, Nov 20, 2008 at 7:16 AM, Ian Lynagh <igloo(a)earth.li> wrote: > > Although another option would be to make GHCi a separate (GPL) frontend > to the (BSD) GHC API. The only downside is that (with static linking) we > have another large binary. Another upside is that other GHC API users > don't get an editline dependency. I've actually been experimenting with something similar: darcs get http://code.haskell.org/~judah/ghci-haskeline/ If you have ghc-6.10.1, 'cabal install'ing inside that repo will give you a version of ghci which uses Haskeline as its backend. Basically, I copied 4 modules from the GHC source tree (GhciMonad, InteractiveUI, GhciTags and Main) and modifed them to use Haskeline; the rest of GHC is obtained through the API. Current benefits over the readline/editline versions: - Works on Windows - Tab completion of quoted filenames within Haskell expressions - Tab completion of Unicode identifiers (trac #2058) - Internally, eliminates the need for some GLOBAL_VARs The only real regression I'm aware of is that Haskeline doesn't yet provide a way to "bind" custom key commands as in an inputrc or editrc file. The recent discussion has indicated how important that feature is for some users, so it's next on my TODO list. -Judah

5 5

Crash in garbage collector
by Colin Paul Adams 21 Nov '08

21 Nov '08

I managed to get calling a Haskell function from an Eiffel program working with one Eiffel compiler, but when I compiled the program with a different Eiffel compiler, and ran it, I get a crash, apparently in the GHC garbage collector: (gdb) backtrace #0 0x0000000000452fc0 in evacuate () #1 0x000000000043b7f8 in scavenge_static () #2 0x0000000000439ea4 in GarbageCollect () #3 0x00000000004351df in scheduleDoGC () #4 0x00000000004353da in exitScheduler () #5 0x00000000004345a2 in hs_exit_ () #6 0x000000000041900c in T21f3 (C=0x1971f80, a1=7) at fib1.c:1200 #7 0x00000000004191a8 in T21c10 () at fib1.c:1000 #8 0x0000000000419356 in main (argc=<value optimized out>, argv=<value optimized out>) at fib1.c:11616 Can you suggest how I should go about investigating this problem further? -- Colin Adams Preston Lancashire

3 7

Ghci for Mac OSX?
by Colin Adams 21 Nov '08

21 Nov '08

I installed the 6.10.1 .pkg on my MacBook Air, and ghci works fine, but if I type ghci, I get program not found. Is it supposed to be available for Mac?

3 2

ANNOUNCE: GHC version 6.10.1
by Ian Lynagh 21 Nov '08

21 Nov '08

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 6.10.1 ============================================================== The GHC Team is pleased to announce a new major release of GHC. There have been a number of significant changes since the last major release, including: * Some new language features have been implemented: * Record syntax: wild-card patterns, punning, and field disambiguation * Generalised quasi-quotes * Generalised list comprehensions * View patterns * Type families have been completely re-implemented * Now comes with Haddock 2, which supports all GHC extensions * Parallel garbage collection * Base provides extensible exceptions * The GHC API is easier to use * External core (output only) now works again * Data Parallel Haskell (DPH) comes as part of GHC The full release notes are here: http://haskell.org/ghc/docs/6.10.1/html/users_guide/release-6-10-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language; the current language version is Haskell 98, agreed in December 1998 and revised December 2002. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

10 22

Lazy minimum
by Dave Bayer 21 Nov '08

21 Nov '08

Compare these two lines in ghci (if you have at least 4 GB of memory): > let a = replicate (2^26) 2 in minimum [[1],a,a] > let a = replicate (2^26) 2 in minimum [a,a,[1]] The first finishes much faster than the second. This comes up for example in isomorphism testing of graphs embedded in surfaces, which is much easier than the general case: A choice of a directed edge determines a walk of the vertices and edges of the graph, from which the graph can be recovered. A minimal walk can be used to determine a canonical form for the graph, making for a nice Haskell one-liner: > normal graph = unwalk $ minimum $ map (walk graph) $ edges graph However, this code suffers from the same issue as the toy ghci lines above. Even though the walks are lazy, the minimum function wastefully explores them. It's clear how to fix this, comparing lazy lists: Play rounds of "Survivor", peeling off the heads of the lists at each iteration. One inevitably evaluates all of each minimal list, if there is more than one. This is familiar. For my example, the automorphisms of a graph show up in the complexity of any isomorphism algorithm; they manifest themselves here as the set of minimal walks. What I'm wondering, however, is if there is a way to code "minimum" efficiently in general, > minimum :: Ord a => [a] -> a where one knows absolutely nothing further about the type "a", but one believes that lazy evaluation will run afoul of the above issue. It would seem that this would require compiler support, allowing code to access approximations to lazy data generalizing the head of a lazy list. I'm reminded of working with power series by working mod x^n for various n. Here, I'd like a bounded version of "compare", that returned EQ for data that agreed to a specified lazy evaluation depth. Did I miss that class? Is there a construct in GHC that would allow me to write "minimum" efficiently for lazy data?

4 5