October 2003 - Glasgow-haskell-users

Building GHC on Mac OS X or Fixing readline
by Kennis Koldewyn 05 Nov '03

05 Nov '03

I've attempted to compile GHC 6.01 from sources for Mac OS X, but after a successful configure, make soon grinds to a halt (see "Listing 1" below). I'm looking for either: 1. A brief list of tips and tricks for getting GHC to build on Mac OS X (see "My Mac" below), or 2. A way to fix my broken readline package (see "Listing 2" below). Arthur Baars mentioned on 2003-07-18 (see "Message Link 1" below) that this problem had been fixed in 6.0.1, and the GHC Downloads page mentions that the readline library must be installed. I've installed GHC 6.0.1 using Wolfgang Thaller's Mac OS X package and I (subsequently) installed readline 4.3, but GHCi still panics, and I also tried Arthur's "quick fix" without success. Thanks for any helpful suggestions, - Kennis ----- Kennis Koldewyn (koldewyn(a)cloud9.net) ----- Without computers, it would be virtually impossible for us to accompliowur xow;gkc,mf(&( - Dave Barry ----- Start of Listing 1 ----- ==fptools== make boot - --no-print-directory -r; in /Users/kennis/Downloads/ghc-6.0.1/ghc/utils/ghc-pkg ------------------------------------------------------------------------ /usr/local/bin/ghc -M -optdep-f -optdep.depend -osuf o -H16m -O -cpp -DPKG_TOOL -DWANT_PRETTY Main.hs Package.hs ParsePkgConfLite.hs make all /usr/local/bin/ghc -H16m -O -cpp -DPKG_TOOL -DWANT_PRETTY -c Package.hs -o Package.o -ohi Package.hi Package.hs:1: parse error on input `#' make[4]: *** [Package.o] Error 1 make[3]: *** [boot] Error 2 make[2]: *** [boot] Error 1 make[1]: *** [boot] Error 1 make: *** [build] Error 1 ----- End of Listing 1 ----- ----- Start of My Mac ----- I'm running Mac OS 10.2.8 on an 800 MHz PowerPC G3 12" iBook with 384 MB of memory: [/Users/kennis] uname -a Darwin Voxel.local. 6.8 Darwin Kernel Version 6.8: Wed Sep 10 15:20:55 PDT 2003; root:xnu/xnu-344.49.obj~2/RELEASE_PPC Power Macintosh powerpc [/Users/kennis] gcc --version gcc (GCC) 3.3 20030304 (Apple Computer, Inc. build 1493) ----- End of My Mac ----- ----- Start of Listing 2 ----- [/Users/kennis] ghci -package util ___ ___ _ / _ \ /\ /\/ __(_) / /_\// /_/ / / | | GHC Interactive, version 6.0.1, for Haskell 98. / /_\\/ __ / /___| | http://www.haskell.org/ghc/ \____/\/ /_/\____/|_| Type :? for help. Loading package base ... linking ... done. Loading package lang ... linking ... done. Loading package concurrent ... linking ... done. Loading package readline ... linking ... /usr/local/lib/ghc-6.0.1/HSreadline.o: unknown symbol `_rl_free_undo_list' ghc-6.0.1: panic! (the `impossible' happened, GHC version 6.0.1): can't load package `readline' ----- End of Listing 2 ----- ----- Message Link 1 ----- http://www.mail-archive.com/glasgow-haskell-users@haskell.org/ msg05041.html ----- End Message Link 1 -----

2 4

RE: GHC and Kinds
by Simon Peyton-Jones 03 Nov '03

03 Nov '03

| type Kind = Type | | What does this mean? It means that Kinds are represented by Types. Admittedly, Kinds only use a small fragment of what Types can represent, namely Arrow, and type constructor applications. So * is represented by a TyConApp with a TyCon that is called typeCon. The really annoying thing about Kinds is that there's occasionally a bit of sub-kinding. In particular error :: forall a. String -> a We want to allow error "foo" :: Int# so the kind of 'a' can't be *, nor # (the kind of unboxed types). It's an "open" kind, written "?"; both * and # are sub-kinds of ?. You should nevertheless be able to encode your kind system in the same way as GHC does. But I have been thinking that it's over-kill to use Types for Kinds, and leads to no real saving. I may well split the two types in the future. Simon

5 5

mips64-sgi-irix unreg success!
by dons＠cse.unsw.edu.au 02 Nov '03

02 Nov '03

Hey all, mips-sgi-irix builds and runs unregisterised from CVS! $ uname -a IRIX64 edison 6.5 07141529 IP30 mips $ ghc-inplace --version The Glorious Glasgow Haskell Compilation System, version 6.3 $ cat test.hs import System.Info main = do putStrLn System.Info.arch putStrLn System.Info.os $ ghc-inplace test.hs mipseb irix It runs the testsuite unregisterised, not to shabby for a weird box: OVERALL SUMMARY for test run started at Tue Oct 21 18:26:48 PDT 2003 1070 total tests, which gave rise to 1844 test cases, of which 0 caused framework failures 167 were skipped 1520 expected passes 14 expected failures 0 unexpected passes 143 unexpected failures I used the ports of GNU software that come with the "freeware" bundle for Irix, to save booting other software too. Use the following environment, at least on the above variety of mips machine: ghc-6.3 from cvs gcc-3.3 gmake-3.80 external libgmp Then: export MAKE=gmake export LDFLAGS=-L/usr/freeware/lib64 export CPPFLAGS=-I/usr/freeware/include export CFLAGS=-mabi=64 cat >> mk/build.mk <<END SRC_CC_OPTS+=-mabi=64 SRC_HC_OPTS+=-optc-mabi=64 -opta-mabi=64 -optl-mabi=64 SRC_CC_OPTS+=-L/usr/freeware/lib64 SRC_HC_OPTS+=-L/usr/freeware/lib64 END And you will have to comment out the vfork #define in libraries/base/cbits/{system.c,rawSystem.c}, as Irix vfork doesn't appear to be available without some other symbols being present. I will make a bindist available soon. Cheers, Don

10 17

Useful info from crash?
by andrew cooke 01 Nov '03

01 Nov '03

Hi, I have a ghc program that appears to be causing a memory error (either segfaulting or tripping up X and killing my session). The program is rather disorganised, so I'm trying to reduce it to something more compact before submitting a report. Is there anything that would help me locate the source of the error so I know what to include/exclude, apart from trial and error? The error occured with both ghc5 (whatever is in debian stable) and 6.0.1 (again from debian package). Thanks, Andrew -- http://www.acooke.org/andrew

2 2

Template Haskell...
by MR K P SCHUPKE 31 Oct '03

31 Oct '03

With reference to the future of template haskell - it would be nice if you could express the following: stringType :: String -> Q [Dec] stringType s = do x <- gensym "x" y <- gensym "y" return [ Newtype [] s [] (Constr s [(Strict,Tcon (TconName "String"))]) [], Proto ("show"++s) (Tapp (Tapp (Tcon Arrow) (Tcon (TconName s))) (Tcon (TconName "ShowS"))), Fun ("show"++s) [Clause [Pcon s [Pvar x]] (Normal (App (Var "showString") (Var x))) []], Instance [] (Tapp (Tcon (TconName "Show")) (Tcon (TconName s))) [ Fun "showsPrec" [Clause [Pwild,Pvar x] (Normal (App (Var ("show"++s)) (Var x))) []]], Instance [] (Tapp (Tcon (TconName "Eq")) (Tcon (TconName s))) [ Fun "==" [Clause [Pcon s [Pvar x],Pcon s [Pvar y]] (Normal (App (App (Var "==") (Var x)) (Var y))) []]] ] AS stringType :: String -> Q [Dec] stringType s = [| newtype $s = $s String show$s :: $s -> ShowS show$s ($s x) = showString x instance Show $s where showsPrec _ x = show$s x instance Eq $s where ($s x) ($s y) = (x==y) |] Maybe with a more specific type like : stringType :: TypeName -> Q [Dec] where TypeName would enforce the first letter must be capital rule. NOTE: to work this would require show$s to crate a function name from show prepended to the type name... Why is this not possible with the current template-haskell, and would this be possible with the proposed extensions (if not, why not, as the above seems very easy to read?) Regards, Keead Schupke.

1 0

Template Haskell...
by MR K P SCHUPKE 30 Oct '03

30 Oct '03

Just a thought, but once you have a data structure representing reified code there is a couple of things it would be nice to be able to do: 1) use the Parser to read a source file (i'm assuming the parser produces the same data stuctures as template haskell) 2) run the reified code directly (using ghci?) It looks from inspection that there is a Syntax.hs and a THSyntax.hs ... Is it possible to unify the data-types from these? Can you use cmRunStmt to run a template instead of splicing it? Regards, Keean Schupke.

1 0

Template Haskell...
by MR K P SCHUPKE 29 Oct '03

29 Oct '03

Okay, I have got my template working, but its extremely unreadable... could anyone tell me how to make this look more like normal Haskell code? stringType :: String -> Q [Dec] stringType s = do x <- gensym "x" return [ Newtype [] s [] (Constr s [(NonStrict,Tcon (TconName "String"))]) [], Proto ("show"++s) (Tapp (Tapp (Tcon Arrow) (Tcon (TconName s))) (Tcon (TconName "ShowS"))), Fun ("show"++s) [Clause [Pcon s [Pvar x]] (Normal (App (Var "showString") (Var x))) []], Instance [] (Tapp (Tcon (TconName "Show")) (Tcon (TconName s))) [ Fun "showsPrec" [Clause [Pwild,Pvar x] (Normal (App (Var ("show"++s)) (Var x))) []]] ]

2 1

ghc-6.0.1 on OS X Panther build
by Gregory Wright 29 Oct '03

29 Oct '03

Hi Wolfgang, I tried building 6.0.1 on Panther using 6.0.1 built on Jaguar. (The build was run under darwinports.) It failed with the following: ------------------------------------------------------------------------ ==fptools== make all -r; in /Users/gwright/src/darwinports/dports/lang/ghc/work/ghc-6.0.1/ libraries/base ------------------------------------------------------------------------ rm -f GHC/Base.o; if [ ! -d GHC/Base_split ]; then mkdir GHC/Base_split; else /usr/bin/find GHC/Base_split -name '*.o' -print | xargs rm -f __rm_food; fi; ../../ghc/compiler/ghc-inplace -H16m -O -I/opt/local/include -L/opt/local/lib -pgmP "gcc3 -E -traditional" -fglasgow-exts -cpp -Iinclude -#include HsBase.h -funbox-strict-fields -package-name base -O -Rghc-timing -split-objs -c GHC/Base.lhs -o GHC/Base.o -ohi GHC/Base.hi /tmp/ghc3798.split__111.s:unknown:missing indirect symbols for section (__DATA,__nl_symbol_ptr) <<ghc: 138861204 bytes, 13 GCs, 715994/1423644 avg/max bytes residency (2 samples), 19M in use, 0.01 INIT (0.03 elapsed), 2.01 MUT (22.94 elapsed), 0.28 GC (0.31 elapsed) :ghc>> make[2]: *** [GHC/Base.o] Error 1 make[1]: *** [all] Error 1 make: *** [build] Error 1 Warning: the following items did not execute (for ghc): com.apple.build > Ever see anything like this before? Best Wishes, Greg

2 1

GHC and Kinds
by Steffen Mazanek 29 Oct '03

29 Oct '03

Hello again, I have browsed the GHC commentary and I could not find a lot of information about kinds. But kinds are very important for my implementation! The parser seems to call liftedTypeKind from TypeRep. But in TypeRep we have type Kind = Type What does this mean? I briefly explain the basics of my algorithm, so that you see how much it depends on the notion of Kinds. I have the following declaration: data Kind = KVar Kindvar --kind variables | KVarInv Kindvar --inversion of kind variables | Star --corresponds to * | Cov --corresponds to + | Contr --corresponds to - | Inv --corresponds to x | Kind :-> Kind --function kind deriving Eq The new atomic kinds Cov, Contr and Inv can be explained by some examples. In my system, the list type constructor, that is covariant in its argument, i.e., ([] a)<([] b) whenever a<b, is represented by (Tycon "[]" (Cov:->Star)). In contrast, the arrow type constructor's kind is given by (Contr:->(Cov:->Star)) due to its contravariance. If one tries to establish a subtype relationship, kinds are taken into consideration. How can I gently integrate this behavior in the GHC? Till now I have worked with "Typing Haskell in Haskell" and I really expected a declaration like data Kind = Star | Kfun Kind Kind Any help is greatly appreciated. Regards, Steffen Mazanek

1 0

Re: Marshalling functions was: Transmitting Haskell values
by C.Reinke 29 Oct '03

29 Oct '03

> >> Is [marshaling functions] something absolutely impossible in > >> Haskell and by what reason? Just because of strong typing (forgive > >> my stupidity ;)? Or are there some deeper theoretical limitations? If you're interested in some recent work here, have a look at Clean (similar enough to Haskell), specifically their work on first-class I/O. I gave a reference in another thread: http://www.haskell.org/pipermail/haskell-cafe/2003-October/005243.html Then follow the references. "orthogonal persistence" is another nice search key.. > > The big theoretical issue is whether it would provide an Eq or Show > > instance for -> by the backdoor. Careful API design could avoid the > > worst of this. once you can do IO, you can inspect the GHC heap for "equality", or map memory into Haskell data structures, so that's not really new .. > What's the problem with a Show instance for ->? (Or, put another way: > what makes the current Show instance in the Prelude harmless compared to > a fuller implementation?) have you tried to show a function?-) an equality based on that would be very rough, a proper equality would be undecidable, and there are whole worlds of other "equalities" in between. Cheers, Claus

1 0