- Haskell-Cafe - Haskell.org

Re: [Haskell] Abusing quickcheck to check existential properties
by Sterling Clover 13 Oct '08

13 Oct '08

My understanding is that SmallCheck and lazy SmallCheck[1] are much better suited to handle existential properties, and indeed have combinators especially for that task. --Sterl. [1] http://www-users.cs.york.ac.uk/~mfn/lazysmallcheck/ smallcheck.pdf, http://hackage.haskell.org/cgi-bin/hackage-scripts/ package/smallcheck, http://hackage.haskell.org/cgi-bin/hackage- scripts/package/lazysmallcheck On Oct 12, 2008, at 1:38 PM, Norman Ramsey wrote: > I recently used QuickCheck to check on some calculations for image > compression. > (I love exact rational arithmetic!) But I thought only to check for > inverse properties, and I realized afterward I had failed to check for > ranges. For example I should have checked that > > boundedB block = -1 <= b && b <= 1 > where Cos a b c d = cos_of_block block > > which turns out to be correct. But actually my calculations were > wrong, and the real bounds on b are not +/- 1 but rather +/- 0.5, so I > might equally well have passed a more stringent test. It's quite > embarrassing as I have only 5 bits of precision to represent b, and > throwing away a bit on values that don't exist is not the best idea I > have had recently. > > What I would really like to do is write some combinators for interval > checking that say > > * It is a *universal* property that for *every* input, the output > lies within the stated interval. > > * It is an *existential* property of *some* input that the output > lies close to the ends of the stated interval. > > But how do I use QuickCheck to check an existential? > I realize I could run > > boundsNotAchieved block = -0.9 <= b && b <= 0.9 > where Cos a b c d = cos_of_block block > > and then if the test of boundsNotAcheived fails, my test passes > (by exists x : P(x) iff not forall(x) : not P(x)). > > But if I set up a test suite in which some tests are supposed to fail > and others are supposed to succeed, I will never keep track of which > is which. I would like to build an existential test. Is it > sufficient for me to write > > boundsAchieved block = expectFailure (-0.9 <= b && b <= 0.9) > where Cos a b c d = cos_of_block block > > and then run 'quickCheck boundsAchieved'? > > In the long run I'd love something like > > fillsIntervalWithin :: (Num a, Ord a, Arbitrary a) => (a, a) -> a > -> a -> Property > > with the idea that I want to test the partial application > > fillsIntervalWithin (lo, hi) epsilon > > and have the test succeed if every input x satisfies lo <= x <= hi > and if some input x satisfies not (lo + epsilon <= x <= hi - epsilon). > > I'm betting someone on this list has already thought about similar > problems and can advise me. (Because I have yet to write the > specialized instance declaration for Arbitrary that guarantees the > numerical invariants of the inputs, I have yet to test any of the > examples in this email.) > > > Norman > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell

1 0

Arch Haskell News: Oct 12 2008
by Don Stewart 13 Oct '08

13 Oct '08

News about Haskell on Arch Linux http://archhaskell.wordpress.com/2008/10/12/arch-haskell-news-oct-12-2008/ Arch now has 624 Haskell packages in AUR. That’s an increase of 15 new packages in the last 7 days. Planning is also underway for the GHC 6.10 release, and the 6.10 release candidate is in testing. Noteworthy * cabal-install-0.6.0: “The command-line interface for Cabal and Hackage.” * haskell-cabal-1.6.0.1: “A framework for packaging Haskell software” * haskell-bytestring-0.9.1.3: “Fast, packed, strict and lazy byte arrays with a list interface” * haskell-transactional-events-0.1.0.0: “Transactional events, based on Concurrent ML semantics” Full details on the site.

1 0

Could not deduce .. why ?
by Marc Weber 13 Oct '08

13 Oct '08

Surely I've overseen a small point. But I can't see it: Why doesn't ghc recognize taht elc_ (class decl), elc (instance decl) and elc_1 are the same type To help you find the connecting pieces faster I've marked them with ## ## Marc data PT a b = PT b -- phantom type containing state a and the result b class AddEl el_ el2_ elc_ where addEl :: el_ -> elc -> el2_ -- el, child -- ========== adding sub elements (tags) ============================= class AddElT est el_ estc ##elc_## est2 el2_ | estc est -> est2 , est est2 estc el2_ -> el_ , est est2 estc el2_ -> elc_ where addElT :: PT est el_ -> PT estc ##elc_## -> PT est2 el2_ -- first child ? attrs ok? instance ( AddEl el el2 ##elc## <-- this is not recognized because elc != elc_1 , Consume st (Elem celType) st' , DetermineElAddEl (NYV (Element elType AttrsOk st HFalse)) el (Valid celType) elc (NYV (Element elType AttrsOk st' HTrue)) el2 ) => AddElT (NYV (Element elType AttrsOk st HFalse)) el (Valid celType) ##elc## <-- elc_ from class declaration (NYV (Element elType AttrsOk st' HTrue)) el2 where addElT (PT t) (PT ##c##) = PT $ addEl t c -- <<<<<<<<< line 435, c should have type elc, not elc_1 src/Text/XML/Validated/Types.hs|435 col 32 error| || Could not deduce (AddEl el el2 elc_1) || from the context (AddElT || (NYV (Element elType AttrsOk st HFalse)) || el || (Valid celType) || elc || (NYV (Element elType AttrsOk st' HTrue)) || el2, || AddEl el el2 elc, || Consume st (Elem celType) st', || DetermineElAddEl || (NYV (Element elType AttrsOk st HFalse)) || el || (Valid celType) || elc || (NYV (Element elType AttrsOk st' HTrue)) || el2) || arising from a use of `addEl' || at src/Text/XML/Validated/Types.hs:435:32-40 || Possible fix: || add (AddEl el el2 elc_1) to the context of the instance declaration || In the second argument of `($)', namely `addEl t c' || In the expression: PT $ addEl t c || In the definition of `addElT': || addElT (PT t) (PT c) = PT $ addEl t c

2 1

How to translate Haskell to other languages?
by Jason Dagit 12 Oct '08

12 Oct '08

Hello, I was thinking about translating Haskell to other languages, python being the main one at the moment. Here is my attempt at manually encoding Haskell in Python: \begin{code} import types class thunk: '''Thunks allow us to delay a computation and they also store their value inside themselves once they have been accessed.''' def __init__(self, v): self.v = v def value(self): '''Force the thunk to be calculated by referencing it.''' while self.isReducible(): self.reduce() return self.v def reduce(self): '''Reduces the thunk, by either calling the represented function or reducing the layers of thunk.''' if (type(self.v) == types.FunctionType): self.v = self.v() else: self.v = self.v.value() return self.v def isReducible(self): '''Returns True when the thunk is still callable.''' return isinstance(self.v, thunk) or \ type(self.v) == types.FunctionType class nil: '''Empty list element''' def __init__(self): pass class cons: '''Non-empty lists''' def __init__(self, head, tail): self.head = head self.tail = tail '''Unpack the cons cell''' def uncons(self): return self.head, self.tail def htail(t): '''This function works like Haskell's tail function.''' l = t.value() x, xs = l.uncons() return xs def plus(t1, t2): '''Adds numbers''' i1 = t1.value() i2 = t2.value() return thunk(i1+i2) def zipWith(f, t1, t2): '''This is like Haskell's zipWith function.''' l1 = t1.value() if isinstance(l1, nil): return thunk(nil()) l2 = t2.value() if isinstance(l2, nil): return thunk(nil()) x, xs = l1.uncons() y, ys = l2.uncons() zw = thunk(lambda: zipWith(f, xs, ys)) fxy = thunk(lambda: f(x,y)) return thunk(cons(fxy, zw)) def fibs(): '''This is the classic fibs: fibs = 1 : 1 : zipWith (+) fibs (tail fibs)''' f1 = thunk(1) f2 = thunk(1) fn = thunk(fibs) rest = thunk(lambda: zipWith(plus, fn, htail(fn))) restlist = thunk(cons(f2, rest)) fiblist = thunk(cons(f1, restlist)) return fiblist def hmap(f, t): '''map _ [] = [] map f (x:xs) = f x : map f xs''' l = t.value() if isinstance(l, nil): return thunk(nil()) x, xs = l.uncons() fx = thunk(lambda: f(x)) mapfxs = thunk(lambda: hmap(f, xs)) return thunk(cons(fx, mapfxs)) def show(t): '''show :: a -> String''' v = t.value() return thunk(str(v)) def printList(t): '''This just gives us a way to debug lists.''' v = t.value() print "[", while True: h,t = v.uncons() print "%s" % h.value(), if isinstance(t.value(), nil): break else: print ", ", v = t.value() print "]" def take(tn, tl): '''take n _ | n <= 0 = [] take _ [] = [] take n (x:xs) = x : take (n-1) xs''' n = tn.value() if n <= 0: return thunk(nil()) l = tl.value() if isinstance(l, nil): return thunk(nil()) x,xs = l.uncons() nminusone = thunk(lambda: plus(tn, thunk(-1))) takerec = thunk(lambda: take(nminusone, xs)) return thunk(cons(x, takerec)) \end{code} You can try this out in python with: tenfibs = take(thunk(10), fibs()) printList(tenfibs) This will print the first 10 fibs. Questions: I think the examples above are correctly lazy. Have I missed something? I noticed my thunks can get wrapped in each other, is this to be expected, or am I doing it wrong? Is there an easier encoding using generators? When I started I was using generators instead of thunk, but I found it was complicating my design so I removed it. And yet, since generators are python's version of thunks, it seems like there should be a more natural encoding there. I'm not explicitly using a graph reduction algorithm to reach WHNF, does this mean my translation is wrong? Are there some well known test cases I should try? Anyone know of a paper that discusses making this translation? I am trying to avoid writing an interpreter in Python for Haskell. My goal is to translate Haskell functions into the equivalent Python. I'm also hoping to avoid needing a G-machine. Thanks! Jason

6 6

Shooting your self in the foot with Haskell
by John Van Enk 12 Oct '08

12 Oct '08

There's the well known "How to shoot your self in the foot" list which I have it printed and taped on my desk at work. http://www-users.cs.york.ac.uk/susan/joke/foot.htm I had a co-worker ask me how you'd shoot your self in the foot with Haskell. Here's the best I could do: "You shoot the gun, but the bullet gets trapped in the IO monad." I fully realize how un-clever this is. Some one please give me something more worth of the original list. :) -- /jve

18 24

Real World Haskell Chapter 11 ... Testing
by Galchin, Vasili 12 Oct '08

12 Oct '08

Hi, Testing of "pure" code ... . way cool ... I am sure there literature from the first order logic, model theory, categorical logic viewpoint?? Kind regards, Vasili

1 0

[] vs [()]
by Daryoush Mehrtash 12 Oct '08

12 Oct '08

What is the difference between empty list [] and list with one unit element [()]? daryoush

10 12

OT: Haskell desktop wallpaper?
by Magnus Therning 12 Oct '08

12 Oct '08

This morning I got tired of my desktop wallpaper (one that ships with Debian's Gnome packages). Typing "haskell desktop wallpaper" yeilded a lot of links to wallpapers with Colleen Haskell, while she's a beautiful lady it wasn't exactly what I was hoping to find. Hence this email. Where can I find some nice wallpapers inspired by Haskell, or maybe even created by Haskell code? Oh yes, wallpapers related to XMonad would do, I suppose ;-) /M -- Magnus Therning (OpenPGP: 0xAB4DFBA4) magnus＠therning．org Jabber: magnus＠therning．org http://therning.org/magnus identi.ca|twitter: magthe

10 13

External Sort and unsafeInterleaveIO
by Ben 11 Oct '08

11 Oct '08

hi folks -- a haskell newbie here, searching for comments and wisdom on my code. i had a project to try to implement "external sort" in haskell as a learning exercise. (external sort is sorting a list that is too large to fit in main memory, by sorting in chunks, spooling to disk, and then merging. more properly there probably should be multiple stages, but for simplicity i'm doing a one-stage external sort.) the trick is the number of files can quickly grow very large, so it is best to use one large file and seek inside it around. however as one can imagine the order-of-IO-operations becomes a bit tricky, if you're seeking file handles around underneath Data.ByteString.Lazy's nose. but late this night after not thinking about it for a while i had a brainstorm: rewrite hGetContents to keep the handle position in the right place! it's all about judicious use of unsafeInterleaveIO..... it seems to be rather fast, strangely faster than the usual "sort" at times. it also seems to have nice memory characteristics, though not perfect. it's hard to test because the normal "sort" function takes too much RAM on large lists, making my computer swap like mad. i'd appreciate any testing, comments and suggestions from the haskell gods out there. my thanks to the Data.ByteString.Lazy, Data.Binary, and Data.Edison people, who made this rather easy, once I grokked unsafeInterleaveIO. thanks and take care, B > module ExternalSort where Sort a list of Ords "offline." We're doing this to be able to sort things without taking up too much memory (for example sorting lists too large to fit in RAM.) Laziness is imperative, as is the order-of-operations. > import Control.Monad > import Data.List > import qualified Data.Binary as Bin > import qualified Data.ByteString.Lazy as B > import qualified Data.ByteString as P (hGetNonBlocking, null) > import Data.ByteString.Base (LazyByteString(LPS)) > import Foreign.Storable (sizeOf) > import System.IO (openFile, hClose, hSeek, hTell, hIsEOF, hWaitForInput, > Handle, IOMode(ReadMode, WriteMode), > SeekMode(AbsoluteSeek)) > import System.IO.Unsafe (unsafeInterleaveIO) > > import qualified Data.Edison.Seq.ListSeq as LS > import qualified Data.Edison.Coll.SplayHeap as Splay Conceptually, we sort a list in blocks, spool blocks to disk, then merge back. However for IO performance it is better to read off chunks of elements off the sorted blocks from disk instead of elements-at-a-time. It would be better if these were in KBytes instead of # of elements. > blocksize :: Int > blocksize = 10000 Turn a list into a list of chunks. > slice :: Int -> [a] -> [[a]] > slice _ [] = [] > slice size l = (take size l) : (slice size $ drop size l) Turn a list into a list of blocks, each of which is sorted. > blockify :: (Ord a) => Int -> [a] -> [[a]] > blockify bsize l = map sort $ slice bsize l Serialize a block, returning the (absolute) position of the start. > dumpBlock :: (Ord a, Bin.Binary a) => Handle -> [a] -> IO Integer > dumpBlock h b = do > start <- hTell h > B.hPut h $ Bin.encode b > return start The actual sorting function. We blockify the list, turning it into a list of sorted blocks, and spool to disk, keeping track of offsets. We then read back the blocks (lazily!), and merge them. > externalSort [] = do return [] > externalSort l = do > h <- openFile "ExternalSort.bin" WriteMode > idx <- mapM (\x -> dumpBlock h x) (blockify blocksize l) > hClose h > h <- openFile "ExternalSort.bin" ReadMode > blocks <- mapM (\x -> do {bs <- hGetContentsWithCursor h x; > return $ Bin.decode bs}) idx > return (kMerge $ blocks) Merging chunks. K-way merge (and in fact external sort in general) is detailed in Knuth, where he recommends tournament trees. The easiest thing is to probably use one of Okasaki's heaps. I'll use splay heaps, because I don't know any better. It would be better if I changed Ord for blocks to only check the first element. > kMerge :: (Ord a) => [[a]] -> [a] > kMerge [] = [] > kMerge l = > let h = Splay.fromSeq l in > kM (Splay.minElem h) (Splay.deleteMin h) > where > kM :: (Ord a) => [a] -> Splay.Heap [a] -> [a] > kM l h > | h == Splay.empty = l > | otherwise = > let next = Splay.minElem h > (f, b) = span (\x -> x <= head next) l > in > f ++ (kM next (if null b then Splay.deleteMin h > else (Splay.insert b $ Splay.deleteMin h))) > > kMergeSort :: (Ord a) => [a] -> [a] > kMergeSort l = kMerge $ blockify blocksize l This is a version of hGetContents which resets its handle position between reads, so is safe to use with interleaved handle seeking. > hGetContentsWithCursor :: Handle -> Integer -> IO B.ByteString > hGetContentsWithCursor = hGetContentsWithCursorN defaultChunkSize > > hGetContentsWithCursorN :: Int -> Handle -> Integer -> IO B.ByteString > hGetContentsWithCursorN k h start = (lazyRead start) >>= return . LPS > where > lazyRead start = unsafeInterleaveIO $ loop start > > loop start = do > hSeek h AbsoluteSeek start > ps <- P.hGetNonBlocking h k > --TODO: I think this should distinguish EOF from no data available > -- the otherlying POSIX call makes this distincion, returning either > -- 0 or EAGAIN > if P.null ps > then do eof <- hIsEOF h > if eof then return [] > else hWaitForInput h (-1) > >> (loop start) > else do > pos <- hTell h > pss <- lazyRead pos > return (ps : pss) > > defaultChunkSize :: Int > defaultChunkSize = 32 * k - overhead > where k = 1024 > overhead = 2 * sizeOf (undefined :: Int)

5 6

Re: [Haskell-cafe] Haskell in Artificial Intelligence
by Chryssochoidis Christos 11 Oct '08

11 Oct '08

On 11 Οκτ 2008, at 10:57 ΠΜ, Krasimir Angelov wrote: > Hi Christos > > We use Haskell for natural language processing. See here: > > http://www.cs.chalmers.se/~aarne/GF/ > > Best regards, > Krasimir > Thank you very much for your response Krasimir. Best regards, Christos > On Fri, Oct 10, 2008 at 8:45 PM, Christos Chryssochoidis > <c.chryssochoidis(a)gmail.com> wrote: >> Greetings, >> >> I'm interested in doing a survey about the use of Haskell in the >> field of >> Artificial Intelligence. I searched in Google, and found in the >> HaskellWiki, >> at www.haskell.org/haskellwiki/Haskell_in_industry, two >> organizations that >> use Haskell and do work related to AI. Besides that, I haven't >> found much >> else. Could somebody from the Haskell community give me some >> pointer to a >> project or system related to AI that uses Haskell? >> >> Thank you very much in advance. >> >> - CC >> >> >> >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe(a)haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >>

1 0

Re: [Haskell-cafe] Interesting new user perspective
by Donn Cave 11 Oct '08

11 Oct '08

Quoth John Goerzen <jgoerzen(a)complete.org>: | Uh... yes. Opening and closing files, command-line parsing, etc -- | needed by almost every program. Aside from some very simple | stdin-to-stdout filters, it is difficult to imagine a program where | you don't need to open a file! That's how it seems to me, too, and moreover maybe the most generally recognizable API. With a GUI or a database, you're going to need to present a fair amount of background to just about everyone, but files, command lines etc. are common to nearly every programming language. If the virtues of Haskell can't be presented in this context, then maybe it isn't such a generally useful language that people ought to be worried about learning it. Donn Cave, donn(a)avvanta.com

1 0

ANNOUNCE: maccatcher-1.0.0
by Jason Dusek 11 Oct '08

11 Oct '08

This simple little package obtains a MAC address on *NIX and Windows. It is known to work on Linux, OS X and Windows XP. There is no C fanciness in this package -- it relies on shell commands. The MAC is cached after the first query, using an IORef (I am open to other ideas, but this seemed sufficient). -- _jsn |This simple little package...| http://hackage.haskell.org/cgi-bin/hackage-scripts/package/maccatcher-1.0.0

2 2

Problem with package consistency on Hackage
by Antoine Latter 11 Oct '08

11 Oct '08

Folks, I'm not sure who to email about this, but hopefully someone on the cafe knows: On the machine which builds the Hackage packages the 'binary' package is built against 'bytestring-0.9.1.2', however the package I just uploaded gets built against 'bytestring-0.9.1.3' which leades to typecheck failures (the ByteStrings I get from the 'binary' package are not the same as all the other ByteStrings). See: http://hackage.haskell.org/packages/archive/uuid/1.0.0/logs/failure/ghc-6.8 If I wait will Hackage eventually become consistent? How does this work? Thanks, Antoine

3 2

ANNOUNCE: darcs 2.1.0 (corrected!)
by Eric Kow 10 Oct '08

10 Oct '08

This is a correction to my previous announcement. I had misgrepped the ChangeLog. There are only 20 bug fixes and 7 new features since 2.0.2. Sorry! ====== Hi all, I am delighted to announce the release of darcs 2.1.0, available at http://darcs.net/darcs-2.1.0.tar.gz What has changed? ----------------- This version provides over 20 bug fixes and 7 new features since darcs 2.0.2. The most notable changes are: * Defaulting to darcs-2. The darcs initialize command now creates darcs-2 format repositories by default. This change will make the the improved conflict handling and merging semantics from darcs 2 available to more users. Note that no action is required on your part. Darcs will continue working with all pre-existing repositories. You can explicitly request an old-fashioned repository if needed. * Better HTTP support. Dmitry Kurochkin has refined our HTTP support and fixed several http-related bugs from darcs 2.0.2. There is also an experimental --http-pipelining feature you can enable on the command line (or in your defaults file) for faster downloading. Note: --http-pipelining is enabled by default for libwww, and also for libcurl 7.19.1 (not yet released at the time of this writing) * Repository correctness. David Roundy has resolved a longstanding 'pending patch' regression (originally reported on 2008-02). Needless to say the offending case has been moved to our regression testing suite See the attached ChangeLog for more details. What should I do? ----------------- Upgrade! Binary versions should be available shortly, either from your favourite package distributor or by third party contributors. Other than installing the new darcs, no action is required on your part to perform this upgrade. Darcs 2, including this particular version, is 100% compatible with your pre-existing repositories. If you have not done so already, you should consider using the hashed repository format in place of your current old-fashioned repositories. This format offers greater protection against accidental corruption, better support for case insensitive file systems. It also provides some very nice performance features, including lazy fetching of patches and a global cache (both optional). If darcs 1 compatibility is not a concern, you could also upgrade your repositories all the way to the darcs 2 format. In addition to the robustness and performance features above, this gives you the improved merging semantics and conflicts handling that give darcs 2 its name. More details about upgrading to darcs 2 here: http://wiki.darcs.net/index.html/DarcsTwo What comes next? ---------------- We will now be shifting to a time based release model, with the next darcs release planned for January 2009. For the next release of darcs, we will be focusing on optimising darcs's day to day performance issues. We want darcs to fetch repositories as fast as it possibly can over a network, and we especially want to rehabilitate known slow commands like darcs annotate. We believe that a few simple and practical changes can really improve the darcs experience for most users. Think you can help? We would love to hear from you. In fact, the first darcs hacking sprint (25-26 October) is fast approaching! We have three venues available: Brighton, Paris and Portland and everybody is invited to come hack. See http://wiki.darcs.net/index.html/Sprints for details. Thanks everybody, and enjoy! -- Eric Kow <http://www.nltg.brighton.ac.uk/home/Eric.Kow> PGP Key ID: 08AC04F9

3 2

compiling ghc-6.8.3: unrecognized command line option "-fconfigure-option=" (SOLVED)
by Poor Yorick 10 Oct '08

10 Oct '08

For anyone who might experience the same problem... Intalling ghc-6.8.3, the following error occurred: make -C libraries all make[1]: Entering directory `/path/to/src/gh c-6.8.3/ghc-6.8.3/libraries' rm -f -f stamp/configure.library.*.base base/unbuildable ( cd base && setup/Setup configure \ --enable-library-profiling --enable-split-objs \ --prefix=/NONEXISTANT \ --bindir=/NONEXISTANT \ --libdir=/NONEXISTANT \ --libsubdir='$pkgid' \ --libexecdir=/NONEXISTANT \ --datadir=/NONEXISTANT \ --docdir=/NONEXISTANT \ --htmldir=/NONEXISTANT \ --interfacedir=/NONEXISTANT \ --with-compiler=../../compiler/stage1/ghc-inplace \ --with-hc-pkg=../../utils/ghc-pkg/ghc-pkg-inplace \ --with-hsc2hs=../../utils/hsc2hs/hsc2hs-inplace \ --with-ld=/path/to/bin/ld \ --haddock-options="--use-contents=../index.html \ --use-index=../doc-index.html" \ --configure-option='--prefix=/path/to/ghc-6.8.3' --configure-option='CC=gcc -m32' --configure-option='LDFLAGS=-Wl,-rpath,/path/to/lib -Wl,-rpath,/path/to/lib64 -Wl,--enable-new-dtags -L/path/to/lib -L/path/to/lib64 --configure-option=' --configure-option='CPPFLAGS=-I/path/to/include --configure-option=' \ --configure-option=--with-cc=gcc ) \ && touch stamp/configure.library.build-profiling-splitting.base || touch base/unbuildable Configuring base-3.0.2.0... configure: WARNING: Unrecognized options: --with-hc, --with-hc-pkg checking for gcc... gcc checking for C compiler default output file name... configure: error: C compiler cannot create executables See `config.log' for more details. config.log showed this: configure:2171: checking for C compiler default output file name configure:2193: gcc -I/path/to/include --configure-option= -Wl,-rpath,/path/to/lib -Wl,-rpath,/path/to/lib64 -Wl,--enable-new-dtags -L/path/to/lib -L/path/to/lib64 --configure-option= conftest.c >&5 cc1: error: unrecognized command line option "-fconfigure-option=" cc1: error: unrecognized command line option "-fconfigure-option=" configure:2197: $? = 1 configure:2235: result: configure: failed program was: | /* confdefs.h. */ | #define PACKAGE_NAME "Haskell base package" | #define PACKAGE_TARNAME "base" | #define PACKAGE_VERSION "1.0" | #define PACKAGE_STRING "Haskell base package 1.0" | #define PACKAGE_BUGREPORT "libraries(a)haskell.org" | /* end confdefs.h. */ | | int | main () | { | | ; | return 0; | } configure:2242: error: C compiler cannot create executables See `config.log' for more details. ## ---------------- ## ## Cache variables. ## ## ---------------- ## ac_cv_env_CC_set=set ac_cv_env_CC_value='gcc -m32' ac_cv_env_CFLAGS_set= ac_cv_env_CFLAGS_value= ac_cv_env_CPPFLAGS_set=set ac_cv_env_CPPFLAGS_value='-I/path/to/include --configure-option=' ac_cv_env_CPP_set= ac_cv_env_CPP_value= ac_cv_env_LDFLAGS_set=set ac_cv_env_LDFLAGS_value='-Wl,-rpath,/path/to/lib -Wl,-rpath,/path/to/lib64 -Wl,--enable-new-dtags -L/path/to/lib -L/path/to/lib64 --configure-option=' ac_cv_env_LIBS_set= ac_cv_env_LIBS_value= ac_cv_env_build_alias_set= ac_cv_env_build_alias_value= ac_cv_env_host_alias_set= ac_cv_env_host_alias_value= ac_cv_env_target_alias_set= ac_cv_env_target_alias_value= ac_cv_prog_ac_ct_CC=gcc ## ----------------- ## ## Output variables. ## ## ----------------- ## CC='gcc' CFLAGS='' CPP='' CPPFLAGS='-I/path/to/include --configure-option=' DEFS='' ECHO_C='' ECHO_N='-n' ECHO_T='' EGREP='' EXEEXT='' GREP='' LDFLAGS='-Wl,-rpath,/path/to/lib -Wl,-rpath,/path/to/lib64 -Wl,--enable-new-dtags -L/path/to/lib -L/path/to/lib64 --configure-option=' LIBOBJS='' LIBS='' LTLIBOBJS='' OBJEXT='' PACKAGE_BUGREPORT='libraries(a)haskell.org' PACKAGE_NAME='Haskell base package' PACKAGE_STRING='Haskell base package 1.0' PACKAGE_TARNAME='base' PACKAGE_VERSION='1.0' PATH_SEPARATOR=':' SHELL='/bin/sh' ac_ct_CC='gcc' bindir='/NONEXISTANT' build_alias='' datadir='/NONEXISTANT' datarootdir='${prefix}/share' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' dvidir='${docdir}' exec_prefix='NONE' host_alias='' htmldir='${docdir}' includedir='${prefix}/include' infodir='${datarootdir}/info' libdir='/NONEXISTANT' libexecdir='/NONEXISTANT' localedir='${datarootdir}/locale' localstatedir='${prefix}/var' mandir='${datarootdir}/man' oldincludedir='/usr/include' pdfdir='${docdir}' prefix='/path/to/ghc-6.8.3' program_transform_name='s,x,x,' psdir='${docdir}' sbindir='${exec_prefix}/sbin' sharedstatedir='${prefix}/com' sysconfdir='${prefix}/etc' target_alias='' It turned out that trailing whitespace in the LDFLAGS and CPPFLAGS environment variables were causing these problems. see libraries/Makfile: # We rely on all the CONFIGURE_ARGS being quoted with '...', and there # being no 's inside the values. FLAGGED_CONFIGURE_ARGS = $(subst $(space)',\ $(space)--configure-option=',\ $(space)$(CONFIGURE_ARGS)) -- Yorick

5 4

re: [Haskell-cafe] Functional progarmming at JAOO
by Robert Pickering 10 Oct '08

10 Oct '08

Hi Simon, Thanks for link! I attended JAOO and there were some great talks on programminng langauges, I really enjoyed Guy Steele's introduction to Fortres and Eric Meijer's "Fundamentalist Functional Programming", as well as Anders Hejlsberg's talk, and there were also talks on Scala and F#. I've not been to that many confrences but I all the same I judged this to be a unusally high interester in programming languages for an industrial conference. I got a real fealing that people are much more read to look at "alterative" languages for their projects, I think this can only be good for haskell and the wider FP community in general. Thanks,Robert ---------------------------------------- From: Simon Peyton-Jones <simonpj(a)microsoft.com> Sent: 09 October 2008 20:55 To: "haskell-cafe(a)haskell.org" <haskell-cafe(a)haskell.org> Subject: [Haskell-cafe] Functional progarmming at JAOO Friends Anders Hejlsberg, the chief designer of C# and a very influential person at Microsoft, gave a keynote talk at JAOO Aarhus last week about "Where are programming languages going". Some of you may have mixed feelings about Microsoft but I thought you might still be interested in this talk because he gives a strong plug to functional programming (and F# in particular, although Haskell gets a mention). FP is one of the three major trends he identifies, the others being concurrency and dynamic languages. http://blip.tv/file/1317881 The FP section starts 22 mins in. Simon _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

Functional progarmming at JAOO
by Simon Peyton-Jones 10 Oct '08

10 Oct '08

Friends Anders Hejlsberg, the chief designer of C# and a very influential person at Microsoft, gave a keynote talk at JAOO Aarhus last week about "Where are programming languages going". Some of you may have mixed feelings about Microsoft but I thought you might still be interested in this talk because he gives a strong plug to functional programming (and F# in particular, although Haskell gets a mention). FP is one of the three major trends he identifies, the others being concurrency and dynamic languages. http://blip.tv/file/1317881 The FP section starts 22 mins in. Simon

1 0

any estimate on when Liskell will be based on GHC 6.8.3, instead of GHC 6.6?
by Benjamin L.Russell 10 Oct '08

10 Oct '08

Recently, I had recommended Liskell to somebody in the thread entitled "Closest statically typed FP "cousin" to Scheme?" (on comp.lang.scheme) (see http://groups.google.se/group/comp.lang.scheme/browse_thread/thread/1fa8fb0…) but then another user replied that a problem with Liskell was that it was based on GHC 6.6, whereas the latest stable version of GHC was 6.8.3 (see http://groups.google.se/group/comp.lang.scheme/msg/a65f73105ef671a1) Does anybody have any estimate on when Liskell will be updated to be based on the current GHC 6.8.3, instead of the old GHC 6.6? I am interested in trying out Liskell myself, but am slightly hesitant because it is based on an older version of GHC. -- Benjamin L. Russell

1 0

Problem (and half solution?) installing cabal-install
by Mauricio 10 Oct '08

10 Oct '08

Hi, After running bootstrap.sh, I got an error related to 'pushd' not beeing available. In fact, when I run 'man sh' I can't find 'pushd' as a command. However, just changing #!/bin/sh to #!/bin/bash (bash do have 'pushd') the installation process went well, except that I got this package versions error: Setup: At least the following dependencies are missing: HTTP >=3000 && <3002, network >=1 && <3 probably when building the executable file itself, since .cabal/lib and .cabal/share were populated with a lot of stuff, but .cabal/bin was not created. Best, Maurício

1 0

Stacking monads
by Andrew Coppin 10 Oct '08

10 Oct '08

Consider the following beautiful code: run :: State -> Foo -> ResultSet State run_and :: State -> Foo -> Foo -> ResultSet State run_and s0 x y = do s1 <- run s0 x s2 <- run s1 y return s2 run_or :: State -> Foo -> Foo -> ResultSet State run_or s0 x y = merge (run s0 x) (run s0 y) That works great. Unfortunately, I made some alterations to the functionallity the program has, and now it is actually possible for 'run' to fail. When this happens, a problem should be reported to the user. (By "user" I mean "the person running my compiled application".) After an insane amount of time making my head hurt, I disocvered that the type "Either ErrorType (ResultSet State)" is actually a monad. (Or rather, a monad within a monad.) Unfortunately, this causes some pretty serious problems: run :: State -> Foo -> Either ErrorType (ResultSet State) run_or :: State -> Foo -> Foo -> Either ErrorType (ResultSet State) run_or s0 x y = do rset1 <- run s0 x rset2 <- run s1 y return (merge rset1 rset2) run_and :: State -> Foo -> Foo -> Either ErrorType (ResultSet State) run_and s0 x y = run s0 x >>= \rset1 -> rset1 >>= \s1 -> run s1 y The 'run_or' function isn't too bad. However, after about an hour of trying, I cannot construct any definition for 'run_and' which actually typechecks. The type signature for (>>=) requires that the result monad matches the source monad, and there is no way for me to implement this. Since ResultSet *just happens* to also be in Functor, I can get as far as run_and s0 x y = run s0 x >>= \rset1 -> fmap (\s1 -> run s1 y) rset1 but that still leaves me with a value of type ResultSet (Either ErrorType (ResultSet State)) and no obvious way to fix this. At this point I am sorely tempted to just change ResultSet to include the error functionallity I need. However, ResultSet is *already* an extremely complicated monad that took me weeks to get working correctly... I'd really prefer to just layer error handling on the top. But I just can't get it to work right. It's soooo fiddly untangling the multiple monads to try to *do* any useful work. Does anybody have any idea how this whole monad stacking craziness is *supposed* to work?

16 65

Libraries in home dir
by Mauricio 10 Oct '08

10 Oct '08

Hi, I want to use a few libraries from hackage and have already download and built them. Can I install those libraries somewhere in my home dir (I want to avoid installing as root) so that ghc can find them? If so, which options should I give to Setup.hs (with main=defaultMain) so that the libraries are going to be copy to that dir? Thanks, Maurício

6 7

how do you deal with mplus?
by Daryoush Mehrtash 10 Oct '08

10 Oct '08

Assuming A, B, C are monadic operation. How do you read the following function: do A 'mplus' B C I expect this to translate to: (A 'mplus' B) >>= C Can I then say it is equivalent to: (A >>=C) mplus (B >>=C) Thanks, Daryoush

4 3

is the a way to reinstall a package with cabal install?
by Anatoly Yakovenko 10 Oct '08

10 Oct '08

is the a way to reinstall a package with cabal install? I want to add profiling support to a libarary. Thanks, Anatoly

3 2

ANNOUNCE: darcs 2.1.0
by Eric Kow 09 Oct '08

09 Oct '08

Hi all, I am delighted to announce the release of darcs 2.1.0, available at http://darcs.net/darcs-2.1.0.tar.gz What has changed? ----------------- This version provides over 40 bug fixes and 20 new features since darcs 2.0.2. The most notable changes are: * Defaulting to darcs-2. The darcs initialize command now creates darcs-2 format repositories by default. This change will make the the improved conflict handling and merging semantics from darcs 2 available to more users. Note that no action is required on your part. Darcs will continue working with all pre-existing repositories. You can explicitly request an old-fashioned repository if needed. * Better HTTP support. Dmitry Kurochkin has refined our HTTP support and fixed several http-related bugs from darcs 2.0.2. There is also an experimental --http-pipelining feature you can enable on the command line (or in your defaults file) for faster downloading. Note: --http-pipelining is enabled by default for libwww, and also for libcurl 7.19.1 (not yet released at the time of this writing) * Repository correctness. David Roundy has resolved a longstanding 'pending patch' regression (originally reported on 2008-02). Needless to say the offending case has been moved to our regression testing suite See the attached ChangeLog for more details. What should I do? ----------------- Upgrade! Binary versions should be available shortly, either from your favourite package distributor or by third party contributors. Other than installing the new darcs, no action is required on your part to perform this upgrade. Darcs 2, including this particular version, is 100% compatible with your pre-existing repositories. If you have not done so already, you should consider using the hashed repository format in place of your current old-fashioned repositories. This format offers greater protection against accidental corruption, better support for case insensitive file systems. It also provides some very nice performance features, including lazy fetching of patches and a global cache (both optional). If darcs 1 compatibility is not a concern, you could also upgrade your repositories all the way to the darcs 2 format. In addition to the robustness and performance features above, this gives you the improved merging semantics and conflicts handling that give darcs 2 its name. More details about upgrading to darcs 2 here: http://wiki.darcs.net/index.html/DarcsTwo What comes next? ---------------- We will now be shifting to a time based release model, with the next darcs release planned for January 2009. For the next release of darcs, we will be focusing on optimising darcs's day to day performance issues. We want darcs to fetch repositories as fast as it possibly can over a network, and we especially want to rehabilitate known slow commands like darcs annotate. We believe that a few simple and practical changes can really improve the darcs experience for most users. Think you can help? We would love to hear from you. In fact, the first darcs hacking sprint (25-26 October) is fast approaching! We have three venues available: Brighton, Paris and Portland and everybody is invited to come hack. See http://wiki.darcs.net/index.html/Sprints for details. Thanks everybody, and enjoy! -- Eric Kow <http://www.nltg.brighton.ac.uk/home/Eric.Kow> PGP Key ID: 08AC04F9

1 0

synchronous channels in STM
by roger peppe 09 Oct '08

09 Oct '08

I was wondering if it was possible to implement synchronous channels within STM. In particular, I'd like to have CSP-like send and recv primitives on a channel that each block until the other side arrives to complete the transaction. I think I've convinced myself that it's not possible, but anyone care to differ? cheers, rog.

9 16

Web application from the ground up
by Arnaud Bailly 09 Oct '08

09 Oct '08

Hello, I am trying to implement a complete web application from the ground up, with the objective to convince myself and others that 1) it is possible, 2) it is powerful and 3) it is more expressive to do such a thing in Haskell. I managed to get to the point where I can handle users lifecycle with DB handling, and I have a CLI application. I have a World that stores Session objects, containing a "continuation" of possible functions to call. The problem I am facing now is how to handle (Fast)CGI requests, given that each request seems to be served by a dinstinct invocation of a function, and share the World between all connections. I have a vague idea that this could be handled by creating some CGIT transformed monad operating on a TVar World (that's what is hinted at on haskell wiki), but I am not sure how to tackle this. I asked this question on #haskell but had to leave too quickly. Some people there seems to think this is something very common that has been resolved over a hundred times. Once would be enough for me, and I would be very happy if someone could point me to the right direction or provide some sample code for this. Best regards, -- Arnaud Bailly, PhD OQube - Software Engineering http://www.oqube.com

4 4

Linker Errors For OpenGL / GLUT 'Hello World' Program.
by Donnie Jones 09 Oct '08

09 Oct '08

Hello, I am trying to test do some OpenGL / GLUT programming in Haskell, but I had linker issues testing the 'Hello World' OpenGL Haskell program. I believe the linker issues were caused because the Haskell GLUT package couldn't find the GLUT C libraries that were installed with Debian packages. I have tested that my OpenGL install does work with 'glxgears'. Below I have included the output from building Hello.hs with the linker errors, my Cabal install of GLUT and OpenGL (which seemed to install fine and the 'configure' stage of the package installs seem to find the OpenGL and GLUT C-libraries), and the Debian packages I have installed which provide the C-libraries for OpenGL and GLUT. Sorry for the long post, but I wanted to include all relevant information. Any help would be greatly appreciated. :) Thank you. __ Donnie ### Hello.hs ### import Graphics.Rendering.OpenGL import Graphics.UI.GLUT main = do (progname, _) <- getArgsAndInitialize createWindow "Hello World" mainLoop ########### ### Build of Haskell OpenGL / GLUT "Hello World" program, linking fails ### ghc --make Hello1.hs [1 of 1] Compiling Main ( Hello1.hs, Hello1.o ) Linking Hello1 ... /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Begin.o): In function `sAlI_info': (.text+0x1d3): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Begin.o): In function `sAxK_info': (.text+0x84f): undefined reference to `glutMainLoop' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Global.o): In function `szMM_info': (.text+0xd): undefined reference to `glutMenuStatusFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Global.o): In function `szNf_info': (.text+0x4d): undefined reference to `glutIdleFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Global.o): In function `szUK_info': (.text+0x6ac): undefined reference to `glutTimerFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `sshz_info': (.text+0x549): undefined reference to `glutEntryFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ssi2_info': (.text+0x589): undefined reference to `glutVisibilityFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ssiv_info': (.text+0x5c9): undefined reference to `glutPassiveMotionFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ssiY_info': (.text+0x609): undefined reference to `glutMotionFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ssjr_info': (.text+0x649): undefined reference to `glutReshapeFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ssjU_info': (.text+0x689): undefined reference to `glutOverlayDisplayFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `sskn_info': (.text+0x6c9): undefined reference to `glutDisplayFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stBW_info': (.text+0x4f95): undefined reference to `glutKeyboardFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stCp_info': (.text+0x4fd5): undefined reference to `glutKeyboardUpFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stGi_info': (.text+0x52e1): undefined reference to `glutSpecialFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stGL_info': (.text+0x5321): undefined reference to `glutSpecialUpFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stJk_info': (.text+0x5515): undefined reference to `glutMouseFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stQq_info': (.text+0x5a91): undefined reference to `glutSpaceballMotionFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stRv_info': (.text+0x5b31): undefined reference to `glutSpaceballRotateFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stTt_info': (.text+0x5cad): undefined reference to `glutSpaceballButtonFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stYd_info': (.text+0x6121): undefined reference to `glutButtonBoxFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `stZi_info': (.text+0x61c5): undefined reference to `glutDialsFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `su3u_info': (.text+0x6589): undefined reference to `glutTabletMotionFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `su6w_info': (.text+0x680d): undefined reference to `glutTabletButtonFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `sudL_info': (.text+0x6ea1): undefined reference to `glutJoystickFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ss3L_info': (.text+0xfca5): undefined reference to `glutGetModifiers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ss4i_info': (.text+0xfda5): undefined reference to `glutGetModifiers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ss4Q_info': (.text+0xfea5): undefined reference to `glutGetModifiers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ss5o_info': (.text+0xffa5): undefined reference to `glutGetModifiers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `ss5Y_info': (.text+0x100a5): undefined reference to `glutGetModifiers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snyp_info': (.text+0x50): undefined reference to `glutSetColor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snyr_info': (.text+0x1ac): undefined reference to `glutGetColor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snyr_info': (.text+0x1d6): undefined reference to `glutGetColor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snyr_info': (.text+0x200): undefined reference to `glutGetColor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snwY_info': (.text+0x313): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snwY_info': (.text+0x353): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Colormap.o): In function `snCI_info': (.text+0x41d): undefined reference to `glutCopyColormap' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smEq_info': (.text+0x19): undefined reference to `glutIgnoreKeyRepeat' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smEq_info': (.text+0x2f): undefined reference to `glutIgnoreKeyRepeat' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smF1_info': (.text+0x7a): undefined reference to `glutSetKeyRepeat' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smF1_info': (.text+0x93): undefined reference to `glutSetKeyRepeat' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smF1_info': (.text+0xb1): undefined reference to `glutSetKeyRepeat' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smzT_info': (.text+0x1fb): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smA6_info': (.text+0x27b): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(DeviceControl.o): In function `smA6_info': (.text+0x479): undefined reference to `glutForceJoystickFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Fonts.o): In function `slEn_info': (.text+0x519): undefined reference to `glutStrokeCharacter' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Fonts.o): In function `slFU_info': (.text+0x609): undefined reference to `glutStrokeLength' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Fonts.o): In function `slIT_info': (.text+0x8fc): undefined reference to `glutBitmapCharacter' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Fonts.o): In function `slL0_info': (.text+0xa25): undefined reference to `glutBitmapLength' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siGD_info': (.text+0x278): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siGD_info': (.text+0x2bb): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siGD_info': (.text+0x2e7): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siGD_info': (.text+0x2f9): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siGD_info': (.text+0x30b): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o):(.text+0x31d): more undefined references to `glutGameModeGet' follow /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siHQ_info': (.text+0x3ed): undefined reference to `glutEnterGameMode' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siHQ_info': (.text+0x3fc): undefined reference to `glutGameModeGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `sjqd_info': (.text+0x13c5): undefined reference to `glutGameModeString' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(GameMode.o): In function `siNC_info': (.text+0x2131): undefined reference to `glutLeaveGameMode' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o):(.text+0x15): undefined reference to `glutInitWindowSize' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o):(.text+0x3d): undefined reference to `glutInitWindowPosition' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfcH_info': (.text+0x24f): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfdf_info': (.text+0x45b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfdf_info': (.text+0x49b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfdf_info': (.text+0x4ad): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfdf_info': (.text+0x50f): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o):(.text+0x521): more undefined references to `glutGet' follow /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfiu_info': (.text+0x2f40): undefined reference to `glutInitDisplayMode' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sgtU_info': (.text+0x2fc1): undefined reference to `glutInitDisplayString' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Initialization.o): In function `sfwB_info': (.text+0x63e1): undefined reference to `glutInit' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syIX_info': (.text+0xdf): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `ryuS_info': (.text+0x173): undefined reference to `glutRemoveMenuItem' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRu_info': (.text+0x6e1): undefined reference to `glutAddMenuEntry' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRj_info': (.text+0x7b9): undefined reference to `glutAddSubMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syzf_info': (.text+0x83b): undefined reference to `glutRemoveMenuItem' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRh_info': (.text+0x951): undefined reference to `glutSetMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRf_info': (.text+0x9b2): undefined reference to `glutGetMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRQ_info': (.text+0xd7d): undefined reference to `glutDestroyMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syRN_info': (.text+0xe49): undefined reference to `glutCreateMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szk6_info': (.text+0x1a86): undefined reference to `glutAttachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szk6_info': (.text+0x1a9f): undefined reference to `glutAttachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szk6_info': (.text+0x1ab8): undefined reference to `glutAttachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szk6_info': (.text+0x1ad1): undefined reference to `glutAttachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szk6_info': (.text+0x1aea): undefined reference to `glutAttachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `syHN_info': (.text+0x1d54): undefined reference to `glutDetachMenu' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Menu.o): In function `szjX_info': (.text+0x1e79): undefined reference to `glutGetWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiR_info': (.text+0xe39): undefined reference to `glutSolidDodecahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiP_info': (.text+0xe55): undefined reference to `glutWireDodecahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiN_info': (.text+0xe71): undefined reference to `glutWireIcosahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiL_info': (.text+0xe8d): undefined reference to `glutSolidIcosahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiJ_info': (.text+0xea9): undefined reference to `glutSolidOctahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiH_info': (.text+0xec5): undefined reference to `glutWireOctahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiF_info': (.text+0xee1): undefined reference to `glutWireTetrahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `raiD_info': (.text+0xefd): undefined reference to `glutSolidTetrahedron' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdiu_info': (.text+0x5026): undefined reference to `glutSolidCube' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdir_info': (.text+0x50c6): undefined reference to `glutSolidSphere' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdim_info': (.text+0x51e7): undefined reference to `glutSolidCone' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdi9_info': (.text+0x54cf): undefined reference to `glutSolidTorus' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdi3_info': (.text+0x5622): undefined reference to `glutSolidTeapot' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdhV_info': (.text+0x58fe): undefined reference to `glutWireCube' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdhS_info': (.text+0x599e): undefined reference to `glutWireSphere' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdhN_info': (.text+0x5abf): undefined reference to `glutWireCone' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdhA_info': (.text+0x5da7): undefined reference to `glutWireTorus' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Objects.o): In function `sdhu_info': (.text+0x5efa): undefined reference to `glutWireTeapot' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8A7_info': (.text+0x61): undefined reference to `glutUseLayer' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8A7_info': (.text+0xcf): undefined reference to `glutUseLayer' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8ws_info': (.text+0x227): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8D9_info': (.text+0x2ac): undefined reference to `glutPostWindowOverlayRedisplay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8D8_info': (.text+0x326): undefined reference to `glutPostOverlayRedisplay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8x0_info': (.text+0x3ff): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8FF_info': (.text+0x482): undefined reference to `glutRemoveOverlay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8FF_info': (.text+0x4e7): undefined reference to `glutEstablishOverlay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8xt_info': (.text+0x5a7): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8HX_info': (.text+0x62a): undefined reference to `glutHideOverlay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Overlay.o): In function `s8HX_info': (.text+0x68f): undefined reference to `glutShowOverlay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0x49): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0x8f): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0xa1): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0xb3): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0x12b): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o):(.text+0x16b): more undefined references to `glutDeviceGet' follow /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0x363): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9EB_info': (.text+0x3a3): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9L1_info': (.text+0xb93): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9yO_info': (.text+0xcbb): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9z1_info': (.text+0xd3b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9ze_info': (.text+0xdbb): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9zr_info': (.text+0xe3b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9zr_info': (.text+0xe7b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9zr_info': (.text+0xe8d): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o):(.text+0xeef): more undefined references to `glutGet' follow /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(State.o): In function `s9CY_info': (.text+0x12b8): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o):(.text+0x15): undefined reference to `glutWarpPointer' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o):(.text+0x3d): undefined reference to `glutReshapeWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o):(.text+0x65): undefined reference to `glutPositionWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o):(.text+0xc5): undefined reference to `glutCreateSubWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5kf_info': (.text+0x10a): undefined reference to `glutSetCursor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5kf_info': (.text+0x123): undefined reference to `glutSetCursor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5kf_info': (.text+0x13c): undefined reference to `glutSetCursor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5kf_info': (.text+0x155): undefined reference to `glutSetCursor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5kf_info': (.text+0x16e): undefined reference to `glutSetCursor' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o):(.text+0x187): more undefined references to `glutSetCursor' follow /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s56X_info': (.text+0x6eb): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s56X_info': (.text+0x72b): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s56X_info': (.text+0x73d): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s56X_info': (.text+0x79f): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s56X_info': (.text+0x7b1): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5p7_info': (.text+0x805): undefined reference to `glutSetWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s58d_info': (.text+0x8e5): undefined reference to `glutGetWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5qr_info': (.text+0x915): undefined reference to `glutPostWindowRedisplay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5qq_info': (.text+0x93b): undefined reference to `glutPostRedisplay' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s59A_info': (.text+0xbc7): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s59A_info': (.text+0xc07): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5vb_info': (.text+0xc3f): undefined reference to `glutShowWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5vb_info': (.text+0xc4f): undefined reference to `glutIconifyWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5vb_info': (.text+0xc64): undefined reference to `glutHideWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Lh_info': (.text+0x190d): undefined reference to `glutCreateWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Mh_info': (.text+0x19a5): undefined reference to `glutDestroyWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Mh_info': (.text+0x19e5): undefined reference to `glutSwapBuffers' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Mh_info': (.text+0x1a01): undefined reference to `glutFullScreen' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Mh_info': (.text+0x1a1d): undefined reference to `glutPushWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Mh_info': (.text+0x1a39): undefined reference to `glutPopWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5NA_info': (.text+0x1a55): undefined reference to `glutSetWindowTitle' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Window.o): In function `s5Oy_info': (.text+0x1add): undefined reference to `glutSetIconTitle' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Registration.o): In function `s7aX_info': (.text+0x2dd): undefined reference to `glutGetWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Registration.o): In function `s7xG_info': (.text+0x7c3): undefined reference to `glutTimerFunc' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(Registration.o): In function `s7lI_info': (.text+0x1ec0): undefined reference to `glutGetWindow' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(QueryUtils.o): In function `s1cg_info': (.text+0x61): undefined reference to `glutDeviceGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(QueryUtils.o): In function `s1d7_info': (.text+0x121): undefined reference to `glutLayerGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(QueryUtils.o): In function `s1dY_info': (.text+0x1e1): undefined reference to `glutGet' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(HsGLUT.o): In function `hs_GLUT_marshalBitmapFont': HsGLUT.c:(.text+0x15): undefined reference to `glutBitmap8By13' HsGLUT.c:(.text+0x24): undefined reference to `glutBitmapHelvetica18' HsGLUT.c:(.text+0x2b): undefined reference to `glutBitmap9By15' HsGLUT.c:(.text+0x32): undefined reference to `glutBitmapTimesRoman10' HsGLUT.c:(.text+0x39): undefined reference to `glutBitmapTimesRoman24' HsGLUT.c:(.text+0x40): undefined reference to `glutBitmapHelvetica10' HsGLUT.c:(.text+0x47): undefined reference to `glutBitmapHelvetica12' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(HsGLUT.o): In function `hs_GLUT_marshalStrokeFont': HsGLUT.c:(.text+0x52): undefined reference to `glutStrokeRoman' HsGLUT.c:(.text+0x6b): undefined reference to `glutStrokeMonoRoman' /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2/libHSGLUT-2.1.1.2.a(HsGLUT.o): In function `hs_GLUT_getProcAddress': HsGLUT.c:(.text+0x85): undefined reference to `glutGetProcAddress' collect2: ld returned 1 exit status ### Build of Haskell OpenGL / GLUT "Hello World" program, linking fails ### ### ghc-pkg list ### ghc-pkg list /usr/lib/ghc-6.8.2/package.conf: Cabal-1.3.12, HTTP-3001.0.4, array-0.1.0.0, base-3.0.1.0, bytestring-0.9.0.1, containers-0.1.0.1, directory-1.0.0.0, filepath-1.1.0.0, {ghc-6.8.2}, haskell98-1.0.1.0, hpc-0.5.0.0, mtl-1.1.0.0, network-2.1.0.0, old-locale-1.0.0.0, old-time-1.0.0.0, packedstring-0.1.0.0, parsec-3.0.0, pretty-1.0.0.0, process-1.0.0.0, random-1.0.0.0, readline-1.0.1.0, rts-1.0, template-haskell-2.2.0.0, unix-2.3.0.0, zlib-0.4.0.4 /home/donnie/.ghc/i386-linux-6.8.2/package.conf: GLUT-2.1.1.2, OpenGL-2.2.1.1, bytestring-0.9.1.2, cgi-3001.1.5.2, cgi-3001.1.6.0, hpc-0.5.0.1, mtl-1.1.0.1, network-2.2.0.0, parsec-3.0.0, regex-base-0.93.1, regex-posix-0.93.1, regex-posix-0.93.2, xhtml-3000.1.0.0, xhtml-3000.2.0.0, xml-1.2.6, xml-1.3.1 ############# ### Cabal install of GLUT ### cabal install glut Resolving dependencies... Downloading OpenGL-2.2.1.1... Configuring OpenGL-2.2.1.1... checking for gcc... gcc checking for C compiler default output file name... a.out checking whether the C compiler works... yes checking whether we are cross compiling... no checking for suffix of executables... checking for suffix of object files... o checking whether we are using the GNU C compiler... yes checking whether gcc accepts -g... yes checking for gcc option to accept ISO C89... none needed checking for Windows environment... no checking how to run the C preprocessor... gcc -E checking for X... libraries , headers checking for gethostbyname... yes checking for connect... yes checking for remove... yes checking for shmat... yes checking for IceConnectionNumber in -lICE... yes checking build system type... i686-pc-linux-gnu checking host system type... i686-pc-linux-gnu checking target system type... i686-pc-linux-gnu checking for atan... no checking for atan in -lm... yes checking for GL library... -lGL -lm checking for GLU library... -lGLU -lGL -lm checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking for ANSI C header files... yes checking for sys/types.h... yes checking for sys/stat.h... yes checking for stdlib.h... yes checking for string.h... yes checking for memory.h... yes checking for strings.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for unistd.h... yes checking GL/gl.h usability... yes checking GL/gl.h presence... yes checking for GL/gl.h... yes checking OpenGL/gl.h usability... no checking OpenGL/gl.h presence... no checking for OpenGL/gl.h... no checking GL/glu.h usability... yes checking GL/glu.h presence... yes checking for GL/glu.h... yes checking OpenGL/glu.h usability... no checking OpenGL/glu.h presence... no checking for OpenGL/glu.h... no checking Haskell type for GLboolean... Word8 checking Haskell type for GLbyte... Int8 checking Haskell type for GLubyte... Word8 checking Haskell type for GLshort... Int16 checking Haskell type for GLushort... Word16 checking Haskell type for GLint... Int32 checking Haskell type for GLuint... Word32 checking Haskell type for GLsizei... Int32 checking Haskell type for GLenum... Word32 checking Haskell type for GLbitfield... Word32 checking Haskell type for GLfloat... Float checking Haskell type for GLclampf... Float checking Haskell type for GLdouble... Double checking Haskell type for GLclampd... Double checking Haskell type for GLchar... Int8 checking Haskell type for GLintptr... Int32 checking Haskell type for GLsizeiptr... Int32 configure: creating ./config.status config.status: creating config.mk config.status: creating OpenGL.buildinfo config.status: creating include/HsOpenGLConfig.h config.status: creating include/HsOpenGL.h config.status: include/HsOpenGL.h is unchanged Preprocessing library OpenGL-2.2.1.1... Building OpenGL-2.2.1.1... [ 1 of 84] Compiling Graphics.Rendering.OpenGL.GL.PeekPoke ( Graphics/Rendering/OpenGL/GL/PeekPoke.hs, dist/build/Graphics/Rendering/OpenGL/GL/PeekPoke.o ) [ 2 of 84] Compiling Graphics.Rendering.OpenGL.GL.IOState ( Graphics/Rendering/OpenGL/GL/IOState.hs, dist/build/Graphics/Rendering/OpenGL/GL/IOState.o ) [ 3 of 84] Compiling Graphics.Rendering.OpenGL.GL.GLboolean ( Graphics/Rendering/OpenGL/GL/GLboolean.hs, dist/build/Graphics/Rendering/OpenGL/GL/GLboolean.o ) [ 4 of 84] Compiling Graphics.Rendering.OpenGL.GL.Extensions ( Graphics/Rendering/OpenGL/GL/Extensions.hs, dist/build/Graphics/Rendering/OpenGL/GL/Extensions.o ) [ 5 of 84] Compiling Graphics.Rendering.OpenGL.GL.Exception ( Graphics/Rendering/OpenGL/GL/Exception.hs, dist/build/Graphics/Rendering/OpenGL/GL/Exception.o ) [ 6 of 84] Compiling Graphics.Rendering.OpenGL.GL.StateVar ( Graphics/Rendering/OpenGL/GL/StateVar.hs, dist/build/Graphics/Rendering/OpenGL/GL/StateVar.o ) [ 7 of 84] Compiling Graphics.Rendering.OpenGL.GL.FlushFinish ( Graphics/Rendering/OpenGL/GL/FlushFinish.hs, dist/build/Graphics/Rendering/OpenGL/GL/FlushFinish.o ) [ 8 of 84] Compiling Graphics.Rendering.OpenGL.GL.BasicTypes ( Graphics/Rendering/OpenGL/GL/BasicTypes.hs, dist/build/Graphics/Rendering/OpenGL/GL/BasicTypes.o ) [ 9 of 84] Compiling Graphics.Rendering.OpenGL.GL.SavingState ( Graphics/Rendering/OpenGL/GL/SavingState.hs, dist/build/Graphics/Rendering/OpenGL/GL/SavingState.o ) [10 of 84] Compiling Graphics.Rendering.OpenGL.GL.StringQueries ( Graphics/Rendering/OpenGL/GL/StringQueries.hs, dist/build/Graphics/Rendering/OpenGL/GL/StringQueries.o ) [11 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Initialization ( Graphics/Rendering/OpenGL/GLU/Initialization.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Initialization.o ) [12 of 84] Compiling Graphics.Rendering.OpenGL.GL.BlendingFactor ( Graphics/Rendering/OpenGL/GL/BlendingFactor.hs, dist/build/Graphics/Rendering/OpenGL/GL/BlendingFactor.o ) [13 of 84] Compiling Graphics.Rendering.OpenGL.GL.BufferMode ( Graphics/Rendering/OpenGL/GL/BufferMode.hs, dist/build/Graphics/Rendering/OpenGL/GL/BufferMode.o ) [14 of 84] Compiling Graphics.Rendering.OpenGL.GL.ComparisonFunction ( Graphics/Rendering/OpenGL/GL/ComparisonFunction.hs, dist/build/Graphics/Rendering/OpenGL/GL/ComparisonFunction.o ) [15 of 84] Compiling Graphics.Rendering.OpenGL.GL.DataType ( Graphics/Rendering/OpenGL/GL/DataType.hs, dist/build/Graphics/Rendering/OpenGL/GL/DataType.o ) [16 of 84] Compiling Graphics.Rendering.OpenGL.GL.EdgeFlag ( Graphics/Rendering/OpenGL/GL/EdgeFlag.hs, dist/build/Graphics/Rendering/OpenGL/GL/EdgeFlag.o ) [17 of 84] Compiling Graphics.Rendering.OpenGL.GL.Face ( Graphics/Rendering/OpenGL/GL/Face.hs, dist/build/Graphics/Rendering/OpenGL/GL/Face.o ) [18 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelFormat ( Graphics/Rendering/OpenGL/GL/PixelFormat.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelFormat.o ) [19 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelData ( Graphics/Rendering/OpenGL/GL/PixelData.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelData.o ) [20 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Reset ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Reset.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Reset.o ) [21 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Sink ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Sink.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Sink.o ) [22 of 84] Compiling Graphics.Rendering.OpenGL.GL.PointParameter ( Graphics/Rendering/OpenGL/GL/PointParameter.hs, dist/build/Graphics/Rendering/OpenGL/GL/PointParameter.o ) [23 of 84] Compiling Graphics.Rendering.OpenGL.GL.PolygonMode ( Graphics/Rendering/OpenGL/GL/PolygonMode.hs, dist/build/Graphics/Rendering/OpenGL/GL/PolygonMode.o ) [24 of 84] Compiling Graphics.Rendering.OpenGL.GL.PrimitiveMode ( Graphics/Rendering/OpenGL/GL/PrimitiveMode.hs, dist/build/Graphics/Rendering/OpenGL/GL/PrimitiveMode.o ) [25 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.PixelInternalFormat ( Graphics/Rendering/OpenGL/GL/Texturing/PixelInternalFormat.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/PixelInternalFormat.o ) [26 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.TextureUnit ( Graphics/Rendering/OpenGL/GL/Texturing/TextureUnit.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/TextureUnit.o ) [27 of 84] Compiling Graphics.Rendering.OpenGL.GLU.ErrorsInternal ( Graphics/Rendering/OpenGL/GLU/ErrorsInternal.hs, dist/build/Graphics/Rendering/OpenGL/GLU/ErrorsInternal.o ) [28 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Errors ( Graphics/Rendering/OpenGL/GLU/Errors.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Errors.o ) [29 of 84] Compiling Graphics.Rendering.OpenGL.GL.QueryUtils ( Graphics/Rendering/OpenGL/GL/QueryUtils.hs, dist/build/Graphics/Rendering/OpenGL/GL/QueryUtils.o ) [30 of 84] Compiling Graphics.Rendering.OpenGL.GL.BeginEnd ( Graphics/Rendering/OpenGL/GL/BeginEnd.hs, dist/build/Graphics/Rendering/OpenGL/GL/BeginEnd.o ) [31 of 84] Compiling Graphics.Rendering.OpenGL.GL.Hints ( Graphics/Rendering/OpenGL/GL/Hints.hs, dist/build/Graphics/Rendering/OpenGL/GL/Hints.o ) [32 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.PixelStorage ( Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelStorage.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelStorage.o ) [33 of 84] Compiling Graphics.Rendering.OpenGL.GL.VertexSpec ( Graphics/Rendering/OpenGL/GL/VertexSpec.hs, dist/build/Graphics/Rendering/OpenGL/GL/VertexSpec.o ) [34 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.PixelMap ( Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelMap.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelMap.o ) [35 of 84] Compiling Graphics.Rendering.OpenGL.GL.Rectangles ( Graphics/Rendering/OpenGL/GL/Rectangles.hs, dist/build/Graphics/Rendering/OpenGL/GL/Rectangles.o ) [36 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Tessellation ( Graphics/Rendering/OpenGL/GLU/Tessellation.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Tessellation.o ) [37 of 84] Compiling Graphics.Rendering.OpenGL.GL.Capability ( Graphics/Rendering/OpenGL/GL/Capability.hs, dist/build/Graphics/Rendering/OpenGL/GL/Capability.o ) [38 of 84] Compiling Graphics.Rendering.OpenGL.GL.Colors ( Graphics/Rendering/OpenGL/GL/Colors.hs, dist/build/Graphics/Rendering/OpenGL/GL/Colors.o ) [39 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Quadrics ( Graphics/Rendering/OpenGL/GLU/Quadrics.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Quadrics.o ) [40 of 84] Compiling Graphics.Rendering.OpenGL.GL.ColorSum ( Graphics/Rendering/OpenGL/GL/ColorSum.hs, dist/build/Graphics/Rendering/OpenGL/GL/ColorSum.o ) [41 of 84] Compiling Graphics.Rendering.OpenGL.GL.CoordTrans ( Graphics/Rendering/OpenGL/GL/CoordTrans.hs, dist/build/Graphics/Rendering/OpenGL/GL/CoordTrans.o ) [42 of 84] Compiling Graphics.Rendering.OpenGL.GL.Bitmaps ( Graphics/Rendering/OpenGL/GL/Bitmaps.hs, dist/build/Graphics/Rendering/OpenGL/GL/Bitmaps.o ) [43 of 84] Compiling Graphics.Rendering.OpenGL.GL.Clipping ( Graphics/Rendering/OpenGL/GL/Clipping.hs, dist/build/Graphics/Rendering/OpenGL/GL/Clipping.o ) [44 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Rasterization ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Rasterization.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Rasterization.o ) [45 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Matrix ( Graphics/Rendering/OpenGL/GLU/Matrix.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Matrix.o ) [46 of 84] Compiling Graphics.Rendering.OpenGL.GL.Fog ( Graphics/Rendering/OpenGL/GL/Fog.hs, dist/build/Graphics/Rendering/OpenGL/GL/Fog.o ) [47 of 84] Compiling Graphics.Rendering.OpenGL.GL.Framebuffer ( Graphics/Rendering/OpenGL/GL/Framebuffer.hs, dist/build/Graphics/Rendering/OpenGL/GL/Framebuffer.o ) [48 of 84] Compiling Graphics.Rendering.OpenGL.GL.LineSegments ( Graphics/Rendering/OpenGL/GL/LineSegments.hs, dist/build/Graphics/Rendering/OpenGL/GL/LineSegments.o ) [49 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable ( Graphics/Rendering/OpenGL/GL/PixelRectangles/ColorTable.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/ColorTable.o ) [50 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Convolution.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Convolution.o ) [51 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Histogram ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Histogram.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Histogram.o ) [52 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.Minmax ( Graphics/Rendering/OpenGL/GL/PixelRectangles/Minmax.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/Minmax.o ) [53 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles.PixelTransfer ( Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelTransfer.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles/PixelTransfer.o ) [54 of 84] Compiling Graphics.Rendering.OpenGL.GL.PixelRectangles ( Graphics/Rendering/OpenGL/GL/PixelRectangles.hs, dist/build/Graphics/Rendering/OpenGL/GL/PixelRectangles.o ) [55 of 84] Compiling Graphics.Rendering.OpenGL.GL.ReadCopyPixels ( Graphics/Rendering/OpenGL/GL/ReadCopyPixels.hs, dist/build/Graphics/Rendering/OpenGL/GL/ReadCopyPixels.o ) [56 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.TextureTarget ( Graphics/Rendering/OpenGL/GL/Texturing/TextureTarget.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/TextureTarget.o ) [57 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Specification ( Graphics/Rendering/OpenGL/GL/Texturing/Specification.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Specification.o ) [58 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Queries ( Graphics/Rendering/OpenGL/GL/Texturing/Queries.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Queries.o ) [59 of 84] Compiling Graphics.Rendering.OpenGL.GLU.Mipmapping ( Graphics/Rendering/OpenGL/GLU/Mipmapping.hs, dist/build/Graphics/Rendering/OpenGL/GLU/Mipmapping.o ) [60 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.TexParameter ( Graphics/Rendering/OpenGL/GL/Texturing/TexParameter.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/TexParameter.o ) [61 of 84] Compiling Graphics.Rendering.OpenGL.GL.Points ( Graphics/Rendering/OpenGL/GL/Points.hs, dist/build/Graphics/Rendering/OpenGL/GL/Points.o ) [62 of 84] Compiling Graphics.Rendering.OpenGL.GL.Polygons ( Graphics/Rendering/OpenGL/GL/Polygons.hs, dist/build/Graphics/Rendering/OpenGL/GL/Polygons.o ) [63 of 84] Compiling Graphics.Rendering.OpenGL.GL.RasterPos ( Graphics/Rendering/OpenGL/GL/RasterPos.hs, dist/build/Graphics/Rendering/OpenGL/GL/RasterPos.o ) [64 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Application ( Graphics/Rendering/OpenGL/GL/Texturing/Application.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Application.o ) [65 of 84] Compiling Graphics.Rendering.OpenGL.GL.VertexArrays ( Graphics/Rendering/OpenGL/GL/VertexArrays.hs, dist/build/Graphics/Rendering/OpenGL/GL/VertexArrays.o ) [66 of 84] Compiling Graphics.Rendering.OpenGL.GL.BufferObjects ( Graphics/Rendering/OpenGL/GL/BufferObjects.hs, dist/build/Graphics/Rendering/OpenGL/GL/BufferObjects.o ) [67 of 84] Compiling Graphics.Rendering.OpenGL.GL.PerFragment ( Graphics/Rendering/OpenGL/GL/PerFragment.hs, dist/build/Graphics/Rendering/OpenGL/GL/PerFragment.o ) [68 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Parameters ( Graphics/Rendering/OpenGL/GL/Texturing/Parameters.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Parameters.o ) [69 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Environments ( Graphics/Rendering/OpenGL/GL/Texturing/Environments.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Environments.o ) [70 of 84] Compiling Graphics.Rendering.OpenGL.GL.Shaders ( Graphics/Rendering/OpenGL/GL/Shaders.hs, dist/build/Graphics/Rendering/OpenGL/GL/Shaders.o ) [71 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing.Objects ( Graphics/Rendering/OpenGL/GL/Texturing/Objects.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing/Objects.o ) [72 of 84] Compiling Graphics.Rendering.OpenGL.GL.Texturing ( Graphics/Rendering/OpenGL/GL/Texturing.hs, dist/build/Graphics/Rendering/OpenGL/GL/Texturing.o ) [73 of 84] Compiling Graphics.Rendering.OpenGL.GL.DisplayLists ( Graphics/Rendering/OpenGL/GL/DisplayLists.hs, dist/build/Graphics/Rendering/OpenGL/GL/DisplayLists.o ) [74 of 84] Compiling Graphics.Rendering.OpenGL.GL.Domain ( Graphics/Rendering/OpenGL/GL/Domain.hs, dist/build/Graphics/Rendering/OpenGL/GL/Domain.o ) [75 of 84] Compiling Graphics.Rendering.OpenGL.GL.ControlPoint ( Graphics/Rendering/OpenGL/GL/ControlPoint.hs, dist/build/Graphics/Rendering/OpenGL/GL/ControlPoint.o ) [76 of 84] Compiling Graphics.Rendering.OpenGL.GL.Evaluators ( Graphics/Rendering/OpenGL/GL/Evaluators.hs, dist/build/Graphics/Rendering/OpenGL/GL/Evaluators.o ) [77 of 84] Compiling Graphics.Rendering.OpenGL.GLU.NURBS ( Graphics/Rendering/OpenGL/GLU/NURBS.hs, dist/build/Graphics/Rendering/OpenGL/GLU/NURBS.o ) [78 of 84] Compiling Graphics.Rendering.OpenGL.GLU ( Graphics/Rendering/OpenGL/GLU.hs, dist/build/Graphics/Rendering/OpenGL/GLU.o ) [79 of 84] Compiling Graphics.Rendering.OpenGL.GL.RenderMode ( Graphics/Rendering/OpenGL/GL/RenderMode.hs, dist/build/Graphics/Rendering/OpenGL/GL/RenderMode.o ) [80 of 84] Compiling Graphics.Rendering.OpenGL.GL.Selection ( Graphics/Rendering/OpenGL/GL/Selection.hs, dist/build/Graphics/Rendering/OpenGL/GL/Selection.o ) [81 of 84] Compiling Graphics.Rendering.OpenGL.GL.Feedback ( Graphics/Rendering/OpenGL/GL/Feedback.hs, dist/build/Graphics/Rendering/OpenGL/GL/Feedback.o ) [82 of 84] Compiling Graphics.Rendering.OpenGL.GL.Antialiasing ( Graphics/Rendering/OpenGL/GL/Antialiasing.hs, dist/build/Graphics/Rendering/OpenGL/GL/Antialiasing.o ) [83 of 84] Compiling Graphics.Rendering.OpenGL.GL ( Graphics/Rendering/OpenGL/GL.hs, dist/build/Graphics/Rendering/OpenGL/GL.o ) [84 of 84] Compiling Graphics.Rendering.OpenGL ( Graphics/Rendering/OpenGL.hs, dist/build/Graphics/Rendering/OpenGL.o ) /usr/bin/ar: creating dist/build/libHSOpenGL-2.2.1.1.a Installing: /home/donnie/.cabal/lib/OpenGL-2.2.1.1/ghc-6.8.2 Registering OpenGL-2.2.1.1... Reading package info from "dist/installed-pkg-config" ... done. Saving old package config file... done. Writing new package config file... done. Downloading GLUT-2.1.1.2... Configuring GLUT-2.1.1.2... checking for gcc... gcc checking for C compiler default output file name... a.out checking whether the C compiler works... yes checking whether we are cross compiling... no checking for suffix of executables... checking for suffix of object files... o checking whether we are using the GNU C compiler... yes checking whether gcc accepts -g... yes checking for gcc option to accept ISO C89... none needed checking for Windows environment... no checking how to run the C preprocessor... gcc -E checking for X... libraries , headers checking for gethostbyname... yes checking for connect... yes checking for remove... yes checking for shmat... yes checking for IceConnectionNumber in -lICE... yes checking build system type... i686-pc-linux-gnu checking host system type... i686-pc-linux-gnu checking target system type... i686-pc-linux-gnu checking for atan... no checking for atan in -lm... yes checking for GL library... -lGL -lm checking for GLU library... -lGLU -lGL -lm checking for grep that handles long lines and -e... /bin/grep checking for egrep... /bin/grep -E checking for ANSI C header files... yes checking for sys/types.h... yes checking for sys/stat.h... yes checking for stdlib.h... yes checking for string.h... yes checking for memory.h... yes checking for strings.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for unistd.h... yes checking windows.h usability... no checking windows.h presence... no checking for windows.h... no checking GL/glut.h usability... yes checking GL/glut.h presence... yes checking for GL/glut.h... yes checking for GLUT library... no checking for GL/glut.h... (cached) yes checking GLUT/glut.h usability... yes checking GLUT/glut.h presence... yes checking for GLUT/glut.h... yes checking for windows.h... (cached) no configure: creating ./config.status config.status: creating config.mk config.status: creating GLUT.buildinfo config.status: creating include/HsGLUTConfig.h config.status: creating include/HsGLUT.h Preprocessing library GLUT-2.1.1.2... Building GLUT-2.1.1.2... [ 1 of 21] Compiling Graphics.UI.GLUT.Extensions ( Graphics/UI/GLUT/Extensions.hs, dist/build/Graphics/UI/GLUT/Extensions.o ) [ 2 of 21] Compiling Graphics.UI.GLUT.QueryUtils ( Graphics/UI/GLUT/QueryUtils.hs, dist/build/Graphics/UI/GLUT/QueryUtils.o ) [ 3 of 21] Compiling Graphics.UI.GLUT.Constants ( Graphics/UI/GLUT/Constants.hs, dist/build/Graphics/UI/GLUT/Constants.o ) [ 4 of 21] Compiling Graphics.UI.GLUT.Types ( Graphics/UI/GLUT/Types.hs, dist/build/Graphics/UI/GLUT/Types.o ) [ 5 of 21] Compiling Graphics.UI.GLUT.Window ( Graphics/UI/GLUT/Window.hs, dist/build/Graphics/UI/GLUT/Window.o ) [ 6 of 21] Compiling Graphics.UI.GLUT.Callbacks.Registration ( Graphics/UI/GLUT/Callbacks/Registration.hs, dist/build/Graphics/UI/GLUT/Callbacks/Registration.o ) [ 7 of 21] Compiling Graphics.UI.GLUT.Overlay ( Graphics/UI/GLUT/Overlay.hs, dist/build/Graphics/UI/GLUT/Overlay.o ) [ 8 of 21] Compiling Graphics.UI.GLUT.State ( Graphics/UI/GLUT/State.hs, dist/build/Graphics/UI/GLUT/State.o ) [ 9 of 21] Compiling Graphics.UI.GLUT.Objects ( Graphics/UI/GLUT/Objects.hs, dist/build/Graphics/UI/GLUT/Objects.o ) [10 of 21] Compiling Graphics.UI.GLUT.Initialization ( Graphics/UI/GLUT/Initialization.hs, dist/build/Graphics/UI/GLUT/Initialization.o ) [11 of 21] Compiling Graphics.UI.GLUT.GameMode ( Graphics/UI/GLUT/GameMode.hs, dist/build/Graphics/UI/GLUT/GameMode.o ) [12 of 21] Compiling Graphics.UI.GLUT.Fonts ( Graphics/UI/GLUT/Fonts.hs, dist/build/Graphics/UI/GLUT/Fonts.o ) [13 of 21] Compiling Graphics.UI.GLUT.DeviceControl ( Graphics/UI/GLUT/DeviceControl.hs, dist/build/Graphics/UI/GLUT/DeviceControl.o ) [14 of 21] Compiling Graphics.UI.GLUT.Debugging ( Graphics/UI/GLUT/Debugging.hs, dist/build/Graphics/UI/GLUT/Debugging.o ) [15 of 21] Compiling Graphics.UI.GLUT.Colormap ( Graphics/UI/GLUT/Colormap.hs, dist/build/Graphics/UI/GLUT/Colormap.o ) [16 of 21] Compiling Graphics.UI.GLUT.Callbacks.Window ( Graphics/UI/GLUT/Callbacks/Window.hs, dist/build/Graphics/UI/GLUT/Callbacks/Window.o ) [17 of 21] Compiling Graphics.UI.GLUT.Menu ( Graphics/UI/GLUT/Menu.hs, dist/build/Graphics/UI/GLUT/Menu.o ) [18 of 21] Compiling Graphics.UI.GLUT.Callbacks.Global ( Graphics/UI/GLUT/Callbacks/Global.hs, dist/build/Graphics/UI/GLUT/Callbacks/Global.o ) [19 of 21] Compiling Graphics.UI.GLUT.Callbacks ( Graphics/UI/GLUT/Callbacks.hs, dist/build/Graphics/UI/GLUT/Callbacks.o ) [20 of 21] Compiling Graphics.UI.GLUT.Begin ( Graphics/UI/GLUT/Begin.hs, dist/build/Graphics/UI/GLUT/Begin.o ) [21 of 21] Compiling Graphics.UI.GLUT ( Graphics/UI/GLUT.hs, dist/build/Graphics/UI/GLUT.o ) /usr/bin/ar: creating dist/build/libHSGLUT-2.1.1.2.a Installing: /home/donnie/.cabal/lib/GLUT-2.1.1.2/ghc-6.8.2 Registering GLUT-2.1.1.2... Reading package info from "dist/installed-pkg-config" ... done. Saving old package config file... done. Writing new package config file... done. #################### ### Installed Debian packages ### dpkg -l | grep OpenGL ii freeglut3 2.4.0-5 OpenGL Utility Toolkit ii freeglut3-dev 2.4.0-5 OpenGL Utility Toolkit development files ii libgl1-mesa-dev 7.0.3-5 A free implementation of the OpenGL API -- G ii libgl1-mesa-dri 7.0.3-5 A free implementation of the OpenGL API -- D ii libgl1-mesa-glx 7.0.3-5 A free implementation of the OpenGL API -- G ii libglu1-mesa 7.0.3-5 The OpenGL utility library (GLU) ii libglu1-mesa-dev 7.0.3-5 The OpenGL utility library -- development fi ii libglw1-mesa 7.0.3-5 A free implementation of the OpenGL API -- r ii libglw1-mesa-dev 7.0.3-5 A free implementation of the OpenGL API -- d ######################

3 7

Simple Table Update
by Paul Keir 09 Oct '08

09 Oct '08

Hi, I'd like to create a new list based on an original list, using information from a second (symbol) list. That second list should be updated as each element in the new list is added. I've been using map a lot, but that's not an option here, and I'm having trouble obtaining a good recursive structure for my function. The minimal "fixpus" function below shows the problem. I have "sts" on both sides of the ":" list construct, but I'd like the second "sts" to be a version modified by the where (singular) function, "fixpu". fixpus :: [ProgUnit] -> [ProgUnitSymbolTable] -> [ProgUnit] fixpus [] _ = [] fixpus (pu:pus) sts = fixpu pu sts : fixpus pus sts where fixpu pu sts = pu (Below) I tried making "fixpu" return a tuple, and then use "fst", "snd" and "let", but I think it looks strange. I know it's quite basic, but I'd like a strong foundation for what's likely to become a medium-scale project. Can anyone offer advice? fixpus :: [ProgUnit] -> [ProgUnitSymbolTable] -> [ProgUnit] fixpus [] _ = [] fixpus (pu:pus) sts = let a = (fixpu pu sts) in fst a : fixpus pus (snd a) where fixpu pu sts = (pu,sts ++ [("",[])]) Regards, Paul

2 4

parsec 3 & parsec 2
by Jason Dusek 09 Oct '08

09 Oct '08

I recently took a look at the new Yi, and it looks neat but I am hesitant to install it -- it require Parsec 3. What will happen to my system, carefully maintained, if I unleash this new Parsec on my programs and the programs of others? Can I expect total breakage, coexistence or...? -- _jsn

4 4

Simplifying a IsFunction type class using type equality constraints
by Corey O'Connor 09 Oct '08

09 Oct '08

I recently had a need to use the IsFunction typeclass described by Oleg here: http://okmij.org/ftp/Haskell/isFunction.lhs and am wondering if the use of the TypeCast class can be correctly replaced by a type equality constraint. The IsFunction and TypeCast classes were defined as: > data HTrue > data HFalse > > class IsFunction a b | a -> b > instance TypeCast f HTrue => IsFunction (x->y) f > instance TypeCast f HFalse => IsFunction a f > > -- literally lifted from the HList library > class TypeCast a b | a -> b, b->a where typeCast :: a -> b > class TypeCast' t a b | t a -> b, t b -> a where typeCast' :: t->a->b > class TypeCast'' t a b | t a -> b, t b -> a where typeCast'' :: t->a->b > instance TypeCast' () a b => TypeCast a b where typeCast x = typeCast' () x > instance TypeCast'' t a b => TypeCast' t a b where typeCast' = typeCast'' > instance TypeCast'' () a a where typeCast'' _ x = x I found the use of TypeCast in the IsFunction could be replaced by a type family: > class IsFunction a b | a -> b > instance (f ~ TTrue) => IsFunction (x->y) f > instance (f ~ TFalse) => IsFunction a f Which, to me, is easier to understand and appears to function the same. The type equality is a stronger (?) constraint than the TypeCast class, but for the case of IsFunction the use of type equality is correct. Am I correct? Is the second definition of IsFunction actually equivalent to the original? Cheers, -Corey O'Connor

3 2

ghc 6.10 and parsec
by Jason Dusek 09 Oct '08

09 Oct '08

Which Parsec is GHC 6.10 going to ship with -- Parsec 2 or Parsec 3? -- _jsn

3 3

Re: [Haskell-cafe] synchronous channels in STM
by Levi Stephen 09 Oct '08

09 Oct '08

On Thu, Oct 9, 2008 at 9:40 AM, roger peppe <rogpeppe(a)gmail.com> wrote: > I was wondering if it was possible to implement synchronous channels > within STM. In particular, I'd like to have CSP-like send and recv > primitives > on a channel that each block until the other side arrives to complete > the transaction. I did experiment with the actors model (in theory a superset of CSP I believe) in haskell at one stage. Hopefully it will be of some use/interest to you. http://lstephen.wordpress.com/2007/09/08/the-actors-model-and-haskell/ Levi

1 0

ANNOUNCE: SourceGraph-0.1 and Graphalyze-0.3
by Ivan Miljenovic 09 Oct '08

09 Oct '08

I've now uploaded my SourceGraph program to Hackage [1]. It's rather simple at the moment, but if you pass in the .cabal file as a parameter (e.g. run it as "SourceGraph Foo.cabal"), it will create in the same directory as the .cabal file a Directory called "SourceGraph" that contains an html report of some basic graph-theoretic analysis of your code. The output format isn't ideal, but it should serve it's purpose for now (I'll fix it up and actually make it usable once my Thesis has been handed in). What I'd appreciate if people could try it out and tell me if there's any code, etc. that it can't parse. At the moment, it ignores all Data-based functions (e.g. class and instance declarations as well as record functions) and only looks at "stand-alone" functions (i.e. normal functions). SourceGraph requires version 0.3 of my Graphalyze library (version 0.2 added the reports in, but had some bugs that 0.3 fixes). [1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/SourceGraph -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

6 9

[hmatrix] build error
by Xiao-Yong Jin 09 Oct '08

09 Oct '08

Hi, looks like I hit a bug, but I'm not sure which software it belongs to, gcc, ghc or atlas? ---------- error doing "runhaskell Setup build" ---------- Preprocessing library hmatrix-0.4.1.0... /usr/bin/ld: dist/build/Numeric/GSL/Special/Internal_hsc_make: hidden symbol `__powidf2' in /usr/lib/gcc/x86_64-unknown-linux-gnu/4.3.2/libgcc.a(_powidf2.o) isreferenced by DSO /usr/bin/ld: final link failed: Nonrepresentable section on output collect2: ld returned 1 exit status linking dist/build/Numeric/GSL/Special/Internal_hsc_make.o failed command was: /usr/bin/ghc -optl-lgsl -optl-llapack dist/build/Numeric/GSL/Special/Internal_hsc_make.o -o dist/build/Numeric/GSL/Special/Internal_hsc_make ---------- error doing "runhaskell Setup build" ---------- I believe `__powidf2' is a internal symbol in gcc and it is hidden. The system is archlinux x86_64 and the software I used are atlas-lapack 3.8.2-1 gcc 4.3.2-1 Using built-in specs. Target: x86_64-unknown-linux-gnu Configured with: ../configure --prefix=/usr --enable-shared --enable-languages=c,c++,fortran,objc,obj-c++,treelang --enable-threads=posix --mandir=/usr/share/man --infodir=/usr/share/info --enable-__cxa_atexit --disable-multilib --libdir=/usr/lib --libexecdir=/usr/lib --enable-clocale=gnu --disable-libstdcxx-pch --with-tune=generic Thread model: posix gcc version 4.3.2 (GCC) ghc 6.8.2-2 [("Project name","The Glorious Glasgow Haskell Compilation System") ,("Project version","6.8.2") ,("Booter version","6.8.2") ,("Stage","2") ,("Interface file version","6") ,("Have interpreter","YES") ,("Object splitting","YES") ,("Have native code generator","YES") ,("Support SMP","YES") ,("Unregisterised","NO") ,("Tables next to code","YES") ,("Win32 DLLs","") ,("RTS ways"," debug thr thr_p thr_debug") ,("Leading underscore","NO") ] I googled but no useful information. Best, Xiao-Yong -- c/* __o/* <\ * (__ */\ <

6 8

Bluetooth libraries
by Creighton Hogg 09 Oct '08

09 Oct '08

Hello, In the interest of not duplicating any effort, I wanted to ask if anyone was aware of/working on libraries for doing bluetooth programming from Haskell. I didn't find any on hackage nor did The Google indicate that this was a filled niche. Cheers, Creighton

2 1

Re: [Haskell] Catching error / making library functions monadic (in failure)
by Duncan Coutts 09 Oct '08

09 Oct '08

On Wed, 2008-10-08 at 18:07 +0200, Philip K.F. Hölzenspies wrote: > I think this is the core problem I have. Really, error should be implemented > as fail, rather than vice versa. I see why this doesn't work, because it > would type > > error :: Monad m => String -> m a > > even though the whole idea is that it's typed 'a'. Right, that's exactly why it would not work to give error that type. However error should only be being used for programming errors, not for expected runtime errors. > Nonetheless, I would like > it if either IO wasn't the only monad allowing catching, or standard > functions not only being available with 'error' stuff (like !!, head, etc.). Those functions do have safe counterparts for when you cannot guarantee the pre-condition. It typically involves pattern matching, eg instead of head use: case foo of [] -> (x:xs) -> Or for !! you could use take or splitAt and pattern matching. If you want more exact analogues of head, !! etc then see Neil's Safe library. > > If you can report them we can fix them. > > I think I spoke too soon. The error occur in other libraries' functions, so I > unjustly smudged your wonderful gtk2hs work (for which, btw: thanks very, > very much). ok :-) > To be honest; when I write a library, I also don't assume monadic > contexts for stuff that I do in purely functional terms. Sometimes errors > occur only in deeply nested code and "just putting in error" is the easy way > out. Especially, libraries that are not intended for "industrial strength" > production code seem to be prone to this type of coding, when they're not > already monadic. I think it's not as bad as you suggest. In haskell, error is like unchecked exceptions or assertions in Java. They are for cases that really indicate a programmer error, not for bad input or IO failures. Even these kinds of errors can be caught and contained in a sensible way using exception handlers in IO. For example supposing some web server page handler had some programming error and called a function in a way that violated the pre-condition and called error. That need not kill the entire server. The page handler just needs to catch all exceptions and return a 500 internal server error and write the error out to the logs. So it's actually a reasonably robust way of dealing with the inevitable programmer errors. Duncan

1 0

monadic parser with Happy and Alex
by Manlio Perillo 08 Oct '08

08 Oct '08

Hi. I have completed a draft of a CSS lexer, using Alex. http://hg.mperillo.ath.cx/haskell/webtools/file/tip/src/CSS/Lexer.x The lexer use the posn wrapper. Now I'm starting to write the parser with Happy, however for the final product I would like to: 1) Be able to do I/O in the lexer, for stylesheets inclusion (@import rule) 2) be able to keep state in the parser (or lexer?), for character transcoding (@charset rule) This should be possible with Happy (and there are some example), however I don't find examples that make use of a lexer written with Alex. Should I write a lexer using only the Alex basic interface (without wrappers)? Thanks Manlio Perillo

3 4

ANNOUNCE: Data.IVar 0.1
by Luke Palmer 08 Oct '08

08 Oct '08

Several very elegant FRP approaches are emerging, most visibly FRP.Reactive, which rely on blocking on multiple variables at once, continuing when the *first* of them is available. . . inside an unsafePerformIO, so the beautiful STM "orElse" solution is not available. The current solution is to race threads against each other, and have the one that finishes first kill the other one. This is implemented, for example, in Data.Unamb. However, our empirical tests have shown that the GHC scheduler is not *quite* good enough to handle this efficiently, and ends up introducing too much latency and nondeterminacy. The Data.IVar<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/data-ivar-0.1>module, just uploaded to hackage, provides an alternative to thread racing as a solution to this problem. It provides *write-once* variables which can be blocked on in parallel, without forking any threads or using STM (so it is safe to use in unsafePerformIO). Example usage from the documentation: import qualified Data.IVar as IVar import Control.Concurrent main = do iv <- IVar.new iv' <- IVar.new forkIO $ threadDelay 10000000 >> writeIVar iv' "my spoon is too big" let merger = IVar.read iv `mplus` IVar.read iv' print =<< IVar.nonblocking merger -- most likely "Nothing" print =<< IVar.blocking merger -- waits a while, then prints writeIVar iv' "i am a banana" -- throws error "IVar written twice" Enjoy! Luke

4 5

RE: I'll do USB in Haskell - tips?
by Galchin, Vasili 08 Oct '08

08 Oct '08

Hello, I am also interested in SCSI, PCI, etc. I think the main problem/issue vis-a-vis USB/SCSI/PCI et. al. for Haskell is does (or will there exist) a Posix API and a Windows API for these buses/protocols? I read one URL but it will only support Linux. Ok .. maybe there API will be implemented for other Posix OS's like solaris, AIX, HP-UX, etc. but I wouldn't "bet the farm on it". I am not trying to be pesimistic but just save Marco some time in his life. Maybe Marco should talk to the people doing the Linux implementation for the "Posix" API and see how viable that API is before spending a year for nothing. Or Marco maybe you can be a trailblazer and come up with a better "Posix/Win32 USB API" and implement in Haskell? ;^) Very kind regards, Vasili

2 1

Call for Contributions - Haskell Communities and Activities Report, November 2008 edition
by Janis Voigtlaender 08 Oct '08

08 Oct '08

Dear Haskellers, so much has happened in the Haskell world in the past months. Therefore, I would very much like to collect contributions for the 15th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/communities/ Submission deadline: 31 October 2008 (please send your contributions to hcar(a)haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough -- please reconsider and submit an entry anyway! * If you are interested in any project related to Haskell that has not previously been mentioned in the HC&A Report, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the May 2008 edition -- you will find interesting topics described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The best format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2008/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2008/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should have received your old entry as a template already (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Do not worry about writing correct LaTeX, I will be able to handle your file. Please do not use HTML or even DOC. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. This corresponds to approximately one page, or 40 lines of text, with the above style and template. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or ``historic'' overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep entries up. There is no minimum length of an entry! The report aims at being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports over distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. You can use it to write ``wishlist'' items for libraries and language features you would like to see implemented. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de

1 0

Type classes question
by Roly Perera 08 Oct '08

08 Oct '08

Hi, I'm reasonably well versed in Haskell but fairly new to defining type classes. In particular I don't really understand how to arrange for all instances of X to also be instances of Y. It's quite possibly that my question is ill-posed, so I'll make it as concrete as possible: in the following code, I define a Stream class, with two instances, Stream1 and Stream2. How do I arrange for there to be one implementation of Functor's fmap for all Stream instances? I currently rely on delegation, but in the general case this isn't nice. I guess I'm either misunderstanding what it is I'm trying to achieve, or how to do this kind of thing in Haskell. Any help would be greatly appreciated. many thanks, Roly Perera {-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, ExistentialQuantification, FunctionalDependencies #-} module Test where ------------------------------------------------------------------------------- -- Just some helpers. ------------------------------------------------------------------------------- -- Product map. prod :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) f `prod` g = \(a, c) -> (f a, g c) -- Diagonal. diag :: a -> (a, a) diag x = (x, x) -- Mediating morphism into the product. both :: (a -> b) -> (a -> c) -> a -> (b, c) both f g = prod f g . diag ------------------------------------------------------------------------------- -- "Abstract" stream. ------------------------------------------------------------------------------- class Stream s a | s -> a where first :: s -> a next :: s -> s fby :: a -> s -> s -- I want every Stream to be a Functor. fmap_ :: Stream s' b => (a -> b) -> s -> s' fmap_ f = uncurry fby . both (f . first) (fmap_ f . next) ------------------------------------------------------------------------------- -- Implementation 1. ------------------------------------------------------------------------------- data Stream1 a = a :< Stream1 a instance Functor Stream1 where fmap = fmap_ instance Stream (Stream1 a) a where first (x :< _) = x next (_ :< xs) = xs fby = (:<) ------------------------------------------------------------------------------- -- Implementation 2. ------------------------------------------------------------------------------- data Stream2 a = forall b . S b (b -> a) (b -> b) instance Functor Stream2 where fmap = fmap_ instance Stream (Stream2 a) a where first (S x c _) = c x next (S x c i) = S (i x) c i fby y s = S (y, s) fst (uncurry (,) . both first next . snd)

3 3

Darcs / Git
by Dominic Steinitz 08 Oct '08

08 Oct '08

Not really a Haskell question but I'm not sure where else to go. What's the preferred method of converting a darcs repository to git? And is there a way of converting from git to darcs? The reason I ask is that my colleague cannot get darcs to work on his Windows box. Thanks, Dominic.

8 9

Linux binary dist problems
by Colin Fleming 08 Oct '08

08 Oct '08

Hi all, I just joined this list, I'm interested in learning Haskell to complement my day job language (Java). I was interested in trying to make a simple website using Haskell in order to have something to practise on, however in my host's shared environment I can't use the Linux binary packages - I get the same errors that a few people were talking about in September - firstly the "cannot determine current directory", and then after hacking the configure script the "[install] Error 136". It seems that this is probably an old libc, but this is an environment that I have almost no control over so I can't fix that. Are there any building from source options if I don't already have GHC? It looks from the porting guide that I might be able to make 6.6.2 with just a C compiler, can I then use that to build 6.8.3? Thanks for any help. As a few people have commented, it would be great to make all this easier, as it's a pretty big stumbling block to starting with Haskell, and people are likely to get discouraged pretty quickly. Cheers, Colin

3 5

newbie questions (read, etc., with Data.ByteString.Lazy.Char8)
by Mike Coleman 08 Oct '08

08 Oct '08

Hi, I could use a little help. I was looking through the Real World Haskell book and came across a trivial program for summing numbers in a file. They mentioned that that implementation was very slow, as it's based on String's, so I thought I'd try my hand at converting it to use lazy ByteString's. I've made some progress, but now I'm a little stuck because that module doesn't seem to have a 'read' method. There's a readInt method, which I guess I could use, but it returns a Maybe, and I don't see how I can easily strip that off. So: 1. Is there an easy way to strip off the Maybe that would allow an equivalently concise definition for sumFile? I can probably figure out how to do it with pattern matching and a separate function--I'm just wondering if there's a more concise way. 2. Why doesn't ByteString implement 'read'? Is it just that this function (like 'input' in Python) isn't really very useful for real programs? 3. Why doesn't ByteString implement 'readDouble', etc.? That is, why are Int and Integer treated specially? Do I not need readDouble? Thanks, Mike -- lazy version (doesn't compile) -- file: ch08/SumFile.hs import qualified Data.ByteString.Lazy.Char8 as L main = do contents <- L.getContents print (sumFile contents) where sumFile = sum . map read . L.words

8 19

Network.URI bug? (2.2.0.0)
by Bárður Árantsson 08 Oct '08

08 Oct '08

Hi all, I'm having a bit of difficulty with Network.URI -- unless I misunderstand the documentation, the attached demo program is supposed to produce: http://localhost:9000 http://localhost:9000/d1 http://localhost:9000/d1/d2 but it produces http://localhost:9000 http://localhost:9000/d1 http://localhost:9000/d2 Is this some sort of bug or am I not understanding the documentation correctly? Cheers, -- Bardur Arantsson <bardurREMOVE(a)THISscientician.net> The thing that's depressing about tennis is that no matter how good I get, I'll never be as good as a wall. Mitch Hedberg

1 1

Random question
by Iain Barnett 08 Oct '08

08 Oct '08

Hi, I have a function, that produces a random number between two given numbers rand :: Int -> Int -> IO Int rand low high = getStdRandom (randomR (low,high)) (Naively) I'd like to write something like take (rand 1 10 ) [1..10] and see [1,2,3,4] ... or anything but nasty type-error messages. I'm reading about 6 tutorials on monads simultaneously but still can't crack this simple task, and won't pain you with all the permutations of code I've already tried. It's a lot, and it ain't pretty. Would anyone be able to break away from C/C++ vs Haskell to help? Just a point in the right direction or a good doc to read, anything that helps will be much appreciated. Regards Iain

11 17

Inferred type is less polymorphic than expected, depends on order
by Jason Dagit 08 Oct '08

08 Oct '08

Originally I sent this to glasgow-haskell where I was hoping someone by the name of Simon would comment on the error message. No one commented at all, so I'm resending to haskell-cafe. Thanks! I was wondering if someone could help me understand why reordering the case statements changes the type inference for this code. 1) I find the error message a bit confusing. 2) I don't understand why it's a problem in one order and not the other. I've tried to send this as literate haskell in hopes that you can just copy and paste to a file and run the example. This happens with or without GADTs, this version doesn't have them but they don't turn out to make any difference. \begin{code} {-# LANGUAGE ExistentialQuantification, RankNTypes #-} module Main where data Sealed a = forall x. Sealed (a x) -- Or equivalently: -- data Sealed a where -- Sealed :: a x -> Sealed a \end{code} Originally, I noticed this in a monad context...The original was much more complicated. But, we can simplify it even more, so keep reading. goodOrder :: Monad m => (forall y z. p x y -> q y z -> q x z) -> m (Sealed (p x)) -> (forall b. m (Sealed (q b))) -> m (Sealed (q x)) goodOrder f mx my = do Sealed x <- mx Sealed y <- my return (Sealed (f x y)) badOrder :: Monad m => (forall y z. p x y -> q y z -> q x z) -> m (Sealed (p x)) -> (forall b. m (Sealed (q b))) -> m (Sealed (q x)) badOrder f mx my = do Sealed y <- my Sealed x <- mx return (Sealed (f x y)) Several helpful people in #haskell helped me converge on this greatly simplified version below. \begin{code} f :: p x y -> q y z -> q x z f = undefined \end{code} \begin{code} badOrder :: (Sealed (p x)) -> (forall b. (Sealed (q b))) -> (Sealed (q x)) badOrder sx sy = case sy of Sealed y -> case sx of Sealed x -> Sealed (f x y) \end{code} \begin{code} goodOrder :: (Sealed (p x)) -> (forall b. (Sealed (q b))) -> (Sealed (q x)) goodOrder sx sy = case sx of Sealed x -> case sy of Sealed y -> Sealed (f x y) \end{code} \begin{code} main = return () \end{code} This gives the error: $ ghc --make Reorder.lhs [1 of 1] Compiling Main ( Reorder.lhs, Reorder.o ) Reorder.lhs:52:29: Inferred type is less polymorphic than expected Quantified type variable `x' is mentioned in the environment: y :: q x x1 (bound at Reorder.lhs:51:24) When checking an existential match that binds x :: p x2 x The pattern(s) have type(s): Sealed (p x2) The body has type: Sealed (q x2) In a case alternative: Sealed x -> Sealed (f x y) In the expression: case sx of Sealed x -> Sealed (f x y) After discussing this a bit, I think what may be happening in the badOrder case is that the existentially bound type of x is bound after the type `b' in the type of y, leading to the error message. I would appreciate help understanding this, even if the help is, "Go read paper X, Y, and Z." Thanks! Jason

3 7

New System.Process
by john lask 07 Oct '08

07 Oct '08

Something that has irked me in the past about System.Process is the inability to obtain an OS system handle from the haskell Process handle. Such a facility would greatly enhance the interoperabity of c and haskell libraries. Provision is made (although not standardised) to obtain OS specific handles from haskell File Handles which is very useful. The same should be provided for Haskell Process handles. The main barrier to such a facility is the variability between OS representations of such a type (aka windows Handles, unix PID). comments anyone. _________________________________________________________________

2 1

announcing darcs 2.1.0pre3
by Eric Kow 07 Oct '08

07 Oct '08

Hi everybody, The third pre-release of darcs 2.1 is now available at http://darcs.net/darcs-2.1.0pre3.tar.gz Since the last pre-release, we have resolved two of the items on our work list and a recently discovered darcs 2 bug. On the other hand, we have discovered a new regression from darcs 2.0.2 and some performance issues in our recent work for issue971. We are confident that we can resolve these within the upcoming week, but since regressions are involved, I think it might be prudent to delay the release so that we at least have one week to test these changes. At the very latest, darcs 2.1 should be released on 17 October, but I hope we will be able to get it out soon after the tenth. We are now very close to the finish line. More news in a week! Upcoming release schedule ------------------------- 2008-10-10: darcs 2.1.0pre4 2008-10-17: darcs 2.1.0 Work remaining -------------- * Backing out http://bugs.darcs.net/issue971 (Petr Ročkai) We have observed a performance regression in the newer, more robust version of the darcs repair code and will be postponing this feature for next release. The work for this week consists of undoing the relevant changes and auditing the undo. * http://bugs.darcs.net/issue1095 Darcs sometimes crashes in darcs send. It is clear to us why the crash happens and how to fix it. The work for this week consists of creating a minimal test case for our regression testing suite and implementing the relevant changes. * http://bugs.darcs.net/issue1026 Improve the error messages for 'bug in get_extra' errors, which can happen if darcs is fooled into thinking that two patches are the same. Changes since the last pre-release ---------------------------------- * Bug Fix: Eliminate an error merging repeated conflicts in darcs-2 repositories (issue1043, David Roundy) * New Feature: Hide 'Ignore-this:' lines which will be generated by future versions of darcs to prevent patch-id collisions. (issue1102, Eric Kow, David Roundy) * Bug Fix: Support darcs repositories which have symbolic links in their paths (issue1078, Dmitry Kurochkin) * Bug Fix: Make ssh connection sharing (darcs transfer-mode) work with old-fashioned repositories (issue1003, David Roundy) -- Eric Kow <http://www.nltg.brighton.ac.uk/home/Eric.Kow> PGP Key ID: 08AC04F9

3 2

I'll do USB in Haskell - tips?
by Mauricio 07 Oct '08

07 Oct '08

Hi, I'll need to use a lot of USB at work and, after looking around, it seems there's no general USB code done. 'libusb' and 'openusb' do not seem ready enough so that wrapping them would be easier than writing from scratch. (If you think I am wrong until here and have time to write me your opinion, I'll value it a lot.) So: I would like to (try to) write a good implementation of USB access in Haskell. I would like it to be really general, so that we could use all of USB without need to resort to something else; available to all possible environments and operating systems; allow easy testing of USB clients, maybe using "fake" USB devices that could simulate problems; do that using Haskell code to directly access operating system API. I've read the appropriate chapters of USB 2.0 standard reference. I'll greatly appreciate any information you can give me: sugestions on what would be "the Haskell way" of doing USB; good technical information on how USB is implemented in different OSes; warnings on problems I may have; wishes of good luck :) I hope in one year I'll be able to post a message here saying Haskell is the greatest language to interface with USB devices. Thanks, Maurício

3 2