- Haskell-Cafe - Haskell.org

Is there a tool to see reduction steps?
by Daryoush Mehrtash 17 Oct '12

17 Oct '12

I have been given a piece of code that uses Tie-ing the Knot concept to label a tree of nodes in breath first manner. It seems to work fine, but I am having trouble expanding the code on my own to see the evaluation process. I like to know if there is a tools to use to see the reduction steps. > data Tree = Leaf | Node Tree Int Tree deriving Show > > label (Node ln _ rn) ((h:r):rest) = (Node lr h rr, r:r2) where > (lr, r1) = label ln rest > (rr, r2) = label rn r1 > label _ _ = (Leaf, []) > lt t = let (r, unused) = label t ([1..]:unused) > in r -- Daryoush Weblog: http://onfp.blogspot.com/

3 2

Call for Papers: Only Two Months Left - STVR Special Issue on Tests and Proofs
by Achim D. Brucker 17 Oct '12

17 Oct '12

Apologies for duplicates. ************************************************* **** Two months until the deadline for *** **** submitting a paper to the *** **** STVR special issue on Tests and Proofs *** ************************************************* CALL FOR PAPERS STVR Special Issue on Tests and Proofs http://lifc.univ-fcomte.fr/tap2012/stvr/ The Software Testing, Verification & Reliability (STVR) journal (http://www3.interscience.wiley.com/journal/13635/home) invites authors to submit papers to a Special Issue on Tests and Proofs. Background ========== The increasing use of software and the growing system complexity make focused software testing a challenging task. Recent years have seen an increasing industrial and academic interest in the use of static and dynamic analysis techniques together. Success has been reported combining different test techniques such as model-based testing, structural testing, or concolic testing with static techniques such as program slicing, dependencies analysis, model-checking, abstract interpretation, predicate abstraction, or verification. This special issue serves as a platform for researchers and practitioners to present theory, results, experience and advances in Tests and Proofs (TAP). Topics ====== This special issue focuses on all topics relevant to TAP. In particular, the topics of interest include, but are not limited to: * Program proving with the aid of testing techniques * New challenges in automated reasoning emerging from specificities of test generation * Verification and testing techniques combining proofs and tests * Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming, SAT and SMT solving * Model-based testing and verification * Automatic bug finding * Debugging of programs combining static and dynamic analysis * Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing * Formal frameworks for test and proof * Tool descriptions, experience reports and evaluation of test and proof * Case studies combining tests and proofs * Applying combination of test and proof techniques to new application domains such as validating security procotols or vulnerability detection of programs * The processes, techniques, and tools that support test and proof Submission Information ====================== The deadline for submissions is 17th December, 2012. Notification of decisions will be given by April 15th, 2013. All submissions must contain original unpublished work not being considered for publication elsewhere. Original extensions to conference papers - identifing clearly additional contributions - are also encouraged unless prohibited by copyright. Submissions will be refereed according to standard procedures for Software Testing, Verification and Reliability. Please submit your paper electronically using the Software Testing, Verification & Reliability manuscript submission site. Select "Special Issue Paper" and enter "Tests and Proofs" as title. Important Dates: ================ * Paper submission: December 17, 2012 * Notification: April 15, 2013 Guest Editors ============= * Achim D. Brucker, SAP AG, SAP Research, Germany http://www.brucker.ch/ * Wolfgang Grieskamp, Google, U.S.A. http://www.linkedin.com/in/wgrieskamp * Jacques Julliand, University of Franche-Comté, France http://lifc.univ-fcomte.fr/page_personnelle/accueil/8 -- Dr. Achim D. Brucker, SAP AG, SAP Research Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe, Phone: +49 6227 7-52595 http://www.brucker.ch

1 0

Issue building ghc on NetBSD/amd64
by lhagan 17 Oct '12

17 Oct '12

I'm attempting to build ghc on NetBSD/amd64 by following the instructions at http://hackage.haskell.org/trac/ghc/wiki/Building/Porting, but I haven't been able to get past the configure step on the target (see errors below). Where am I going wrong here? Alternatively, any ideas on where I can find pre-built binaries for this system? NetBSD/i386 would be easy, but I've had no luck finding a 64-bit version. Here's the configure error: ./configure --enable-hc-boot --build=x86_64-unknown-netbsd --host=x86_64-unknown-netbsd --target=x86_64-unknown-netbsd checking for gfind... no checking for find... /usr/bin/find checking for sort... /usr/bin/sort checking for ghc... no checking build system type... x86_64-unknown-netbsd checking host system type... x86_64-unknown-netbsd checking target system type... x86_64-unknown-netbsd HOST: x86_64-unknown-netbsd GHC build : x86_64-unknown-netbsd GHC host : x86_64-unknown-netbsd GHC target : x86_64-unknown-netbsd configure: Building in-tree ghc-pwd ./configure[3900]: : cannot execute - Is a directory configure: error: Building ghc-pwd failed

3 5

I would like a clarification about Enumerators and Iteratees, please :)
by Alfredo Di Napoli 16 Oct '12

16 Oct '12

Hi guys, I've started playing with Iteratee and Enumerators: very cool and addictive stuff. I have wrote this simple code: https://gist.github.com/3899017 In a nutshell, it gives back the number of occurences for a single char in case the argument passed from the command line is a single char, or the number of lines of the entire file. I've tried it first on a small file (~100MB) and then on a huge one (~3GB). As far as I understood Iteratee IO should be a smart way to do IO, avoiding to keep the entire file in memory; what I observe in the second case, instead, is a sort of memory leak. The memory grows and grows until the entire machine hangs. If I split the huge file in "small" chunks, memory comsumption is still high but the computation terminates and is fast. So my two questions: a) What am I missing? Should be memory used be constant? And how can I achieve this purpose? b) I'm using the package enumerator because as far as I can see is the most used. How does it compares with "iteratee"? Which of the two are more performant? Bye and thanks, A.

2 1

cabal-install-1.16.0.2
by Johan Tibell 16 Oct '12

16 Oct '12

Hi all, I've created bug fix release candidates for Cabal and cabal-install to address the bugs found after the release. If everyone could take some time to try them out, especially those who had issues with the previous releases. To install the release candidates run: cabal install http://johantibell.com/files/Cabal-1.16.0.2.tar.gz \ http://johantibell.com/files/cabal-install-1.16.0.1.tar.gz Unless there are any issues, we'll make a release in the next few days. Cheers, Johan

2 2

Research Associate in Modelling and Testing using QuickCheck
by Simon Thompson 15 Oct '12

15 Oct '12

As a part of the EU-funded project PROWESS we're looking for a postdoctoral research associate for 2 years 11 months to work on modelling and testing of web services, in the context of property-based testing using QuickCheck. PROWESS involves not only Kent, but also the universities of Sheffield and A Coruña, Chalmers University in Gothenburg and the Polytechnic University of Madrid. Industrial participants include Erlang Solutions Ltd, Quviq AB, Interoud and SP, the Technical Research Institute of Sweden. At the core of PROWESS is property-based testing as implemented in the QuickCheck tool, which provides property-based testing (PBT) for Erlang. In PBT, instead of describing a system through a series of unit tests, it is specified by a set of logical properties, which are then tested on randomly generated inputs to the system. For state-based systems, models are described as state machines, and the systems are exercised through randomly generate paths through the machines. This approach has been used very successfully in a number of application areas, most notably in the automotive sector, where QuickCheck models are used to test automotive software written in C for its conformance to the AUTOSAR standard. The Kent team on PROWESS will help to deliver the following results. • A library of common properties for PBT of web services. • Tools and techniques for extraction of specifications and models from existing test suites for web services. • Tools and techniques to present and assess different competing implementations of a specification. • Approaches to dealing with evolution of properties, models and systems. • An approach to assessing the quality of properties by means of mutation of implementations (by analogy with mutation testing). • Mechanisms by which requirements can be related to other artefacts such as properties and models. The successful applicant should have a doctoral qualification in computer science, experience of using functional programming as well as strong core CS sills. They should be able to work independently, and also to liaise effectively with members of the project both at Kent and at other partners. More details about the post, and the application procedure, are at http://www11.i-grasp.com/fe/tpl_kent01.asp?newms=jj&id=37073&aid=14243 If you have any questions about the position, or would like to discuss it informally, please contact me by email. Simon Thompson Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson(a)kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt

1 0

Generating test data in QuickCheck
by Janek S. 15 Oct '12

15 Oct '12

I'm writing tests using QuickCheck to test data types that are not an instance of QC's Arbitrary. To prevent orphan instances I use forAll function instead of instantiating these types as Arbitrary. The problems arise when I need to generate several different variables for one test. To do this I either nest calls to forAll or create a pair generator like this: genPair = liftM2 (,) (myGenerator1) (myGenerator2) Running time of such tests is very long (both with nesting forAll and using pair generator) and it gets shorter when I resize myGenerator1 and myGenerator2. This leads me to conslusion that, due to nesting of generators QC is generating 100*100*100 test cases instead of 100. How do I "flatten" my generators to always get 100 test cases (or whatever the default number of test is)? Janek

1 0

NYC Haskell Developer Wanted
by Doug Beardsley 15 Oct '12

15 Oct '12

Karamaan Group, a principal investment firm based in Manhattan is looking for an outstanding software developer to develop tools for financial analysis and knowledge management. Candidates should have at least a bachelor's degree in computer science and a good sense of coding style. This is a high-impact, high-visibility job opportunity where successful candidates will be entrusted with a lot of responsibility for products that have a direct effect on the P&L of the firm and influences our workflow. Karamaan Group is a small hedge fund, so the next hire will have a very direct influence on our software development and the firm as a whole. We are a growth oriented firm that values people who take a craftsman's pride in their work. We like to take a contrarian view of things, value experimenting, and use often overlooked technologies. We are looking for a candidate who shows strong analytical, organizational, and communication skills. We have a legacy Java code base that may need occasional maintenance, but for the past few years, most of our new development has been done with Haskell (with bits and pieces of a few other languages here and there). The ideal candidate would have at least some experience with Java and the related technologies used in our existing code, but since Haskell is our language of choice, we're looking for strong Haskell skills. We have a knowledge management system built on Snap, so experience with Snap or Haskell web development in general would help. Unlike most finance companies, we don't require previous experience in finance or business, but knowledge in those areas is definitely a plus. Please send your CV and cover letter to recruitment at karamaan.com.

2 1

Interleaving type variables in a tree, has this a name ?
by Eric Dedieu 14 Oct '12

14 Oct '12

Hi Haskell Helpers, For a hobby projet to learn haskell, I'm trying to use this kind of interleaved tree structure (simplified): > data ANode a b = ANode a [BNode a b] [BNode a b] > data BNode a b = BNode b [ANode a b] [ANode a b] The first list of each node is for links "up", the second for "down". I can navigate with functions like: > type UpRank = Int -- index in the list of nodes > type DownRank = Int > > upA :: UpRank -> ANode a b -> Maybe (BNode a b, DownRank) > downB :: DownRank -> BNode a b -> Maybe (ANode a b, UpRank) Such as going first up then down leads me to the same point (actually this simplified structure is not enough to do this, but is enough to show my problem simply). Thee are also of course upB and downA. >From this idea I have devised a kind of zipper to navigate the tree, add nodes, and be able to step back. However, with this pattern of interleaving a and b values, I could not help but duplicating in a way every data or function declaration, to apply from an A or a B, and often code is very similar (like for upA and downB). Also, I want to go through the tree and modify it keeping the same structure, applying different functions to A and B nodes, like a "map" involving a pair of functions that will be applied alternatively. I also want a kind of "fold". This leads very often to pairs or Either: > (a -> a, b -> b) > (ANode a b -> ANode a b, BNode a b -> BNode a b) > Either (ANode a b) (BNode a b) Out of curiosity, is all this (duplicating functions for alternating type variables, using pairs) a known pattern ? Does it have a name ? Are there well known (and less tedious) alternatives, or higher-level workarounds ? Thanks for any hint, Eric

2 2

Tutorial: Haskell for the Evil Genius
by Andrew Pennebaker 14 Oct '12

14 Oct '12

I've gotten mixed feedback from Reddit for my tutorial. It provides an overview of how functional and declarative programming in Haskell empower baddies, increasing the accuracy and efficiency of their atomic superweapons. What do you guys think of my tutorial, Haskell for the Evil Genius <http://www.yellosoft.us/evilgenius/>? Cheers, Andrew Pennebaker www.yellosoft.us

16 30

Re: [Haskell-cafe] character encoding problems with hxt (I think)
by Uwe Schmidt (FH Wedel) 14 Oct '12

14 Oct '12

Hi Henry, it's not an encoding error but an error concerning the validation of the document. The document "/usr/share/xml/iso-codes/iso_3166_2.xml" is not valid with respect to its internal DTD. The opening tag <iso_3166_country code="GH"> on line 3711 does not have a closing tag. That closing tag should be inserted directly in front of  <iso_3166_country code="GL" /> on line 3735. Further the "/" for an empty element for the "GL" code must be removed. So it's not an error in HXT, but HXT has found an error in the input file. The input file is not valid XML. Solution: Turn off validation and live with the wrong structure of that document, or correct the XML file (and give the maintainers of that file a bug report). But with the error message HXT gave you, there is some room for improvements. Cheers, Uwe -- Uwe Schmidt FH Wedel

1 0

2 line finite (monadic) state machine
by Izaak Meckler 13 Oct '12

13 Oct '12

Hi all, I just wrote some nice code: A finite state machine with monadic state, allowing both DFAs and NFAs to be expressed with the same functions. I've only used it in [], Set, and Maybe, but I think it would be interesting in several others (a probability monad comes to mind). Also, if anyone has any sensible interpretation of this in the continuation monad, let me know. import Control.Monad import Data.Maybe type State = String type Map a b = [(a, b)] -- In Map State (Map Char (m State)), the monad m determines the kind of FSM that is being run. -- If m = [] (or Set), these functions work as a NFA. If m = Maybe, we essentially have a DFA. transition :: (MonadPlus m) => Map State (Map Char (m State)) -> State -> Char -> m State transition transMap q c = fromMaybe mzero $ lookup q transMap >>= lookup c toFSM :: (MonadPlus m) => Map State (Map Char (m State)) -> State -> (String -> m State) toFSM transMap q0 = foldM (transition transMap) q0 egMachine = toFSM [("p", [ ('0', ["p"]) , ('1', ["p", "q"])])] "p"

1 0

character encoding problems with hxt (I think)
by nadine.and.henry＠pobox.com 13 Oct '12

13 Oct '12

Dear Haskellers, I'm trying to write some code that grabs countries and provinces from the iso_3166 files on Linux systems. I seem to be running into some kind of character encoding problem. file says iso_3166_2.xml is a utf8 file, and isutf8 agrees, but when I run the following code, it crashes. uft8Copy makes a byte for byte copy as expected. noCrash read and writes the document without crashing, but the accented characters in the strings show up garbled. Just search for "DE" and you'll see what I mean. crash (on my system, (Debian testing)) produces the error message below. Can anyone enlighten me on what is going on? Thanks in advance. Henry Laxen ------------------------------------------------------------------------ {-# LANGUAGE Arrows #-} import Text.XML.HXT.Core import Data.List import qualified System.IO.UTF8 as U isoFile = "/usr/share/xml/iso-codes/iso_3166_2.xml" countZerosInLines = length . filter (\x -> x == '0') . concat utf8Copy = do xml <- U.readFile isoFile let doc = readString [withValidate no] xml U.writeFile "iso_written.xml" xml putStrLn "Ran utf8Copy" noCrash :: IO () noCrash = do lines <- runX (readDocument [withValidate no] isoFile >>> writeDocumentToString [withShowTree yes] ) -- mapM_ putStrLn lines print $ countZerosInLines lines putStrLn "Ran noCrash" crash :: IO () crash = do xml <- U.readFile isoFile let doc = readString [withValidate no] xml src <- runX $ doc //> writeDocumentToString [withShowTree yes] print $ countZerosInLines src putStrLn "Ran crash (didn't)" {- Ran utf8Copy 1236 Ran noCrash error: UTF-8 encoding error at input position 2640: InvalidLaterByte 1 error: UTF-8 encoding error at input position 2646: InvalidLaterByte 1 *** Exception: Enum.toEnum{Word8}: tag (363) is outside of bounds (0,255) -} main = do utf8Copy noCrash crash ------------------------------------------------------------------------

1 0

Type of scramblings
by Roman Cheplyaka 13 Oct '12

13 Oct '12

I am reading through Oleg's "Eliminating translucent existentials"[1]. [1]: http://okmij.org/ftp/Computation/Existentials.html#eliminating-translucent He draws a distinction between forall a . [a] -> [a] and forall a . [a]^n -> [a] as types of "scramblings". This is something I'm struggling to understand. First of all, I think here we're talking about total functions, otherwise there's no point in introducing dependent types. There are of course more total functions of type `[a]^n -> [a]` than of type `[a] -> [a]`, in the sense that any term of the latter type can be assigned the former type. But, on the other hand, any total function `f :: [a]^n -> [a]` has an "equivalent" total function g :: [a] -> [a] g xs | length xs == n = f xs | otherwise = xs (The condition `length xs == n` can be replaced by a similar condition that also works for infinite lists.) The functions `f` and `g` are equivalent in the sense that for any list `xs` of length `n` `f xs === g xs`. Thus, even though it seems that we allow more total functions by replacing `[a]` with `[a]^n`, that doesn't buy us any additional expressiveness. What am I missing? Roman

3 2

Using CatchIO on StateT
by Dmitry Vyal 12 Oct '12

12 Oct '12

Greetings, I found The MonadCatchIO-mtl package while looking for a way to catch exceptions in my custom StateT s (ReaderT r IO) monad. CatchIO worked flawlessly when handlers used the environment r from Reader, but things broken when I tried to use state. According to source, the handler is run with the same state which was passed to runStateT. instance MonadCatchIO m => MonadCatchIO (StateT s m) where m `catch` f = StateT $ \s -> (runStateT m s) `Control.Monad.CatchIO.catch` (\e -> runStateT (f e) s) And my finalizing action depends on the current state. Can you give an advice how to get the behavior I need? Best regards, Dmitry Vyal

2 1

Hackage Documentation issue
by Jonas Almström Duregård 12 Oct '12

12 Oct '12

Hi, Short question: can I or someone else make the Hackage build bot rebuild a package with a new dependency (even though the initial build was successful)? Long question: Does anyone know what would cause the documentation of a successful Hackage build not to appear on the web? Specifically I'm trying to get docs working for: http://hackage.haskell.org/package/BNFC-meta-0.4 Doing cabal haddock works well for me, and I managed to find the log of the Hackage build: http://hackage.haskell.org/packages/archive/BNFC-meta/0.4/logs/success/ghc-… The problem seems to be related to one of the dependencies (Alex-meta) which had a similar problem: the documentation step failed (but not the build). I was able to fix it (or at least work around it) so Alex-meta has working documentation now. Can I or someone else prompt the BNFC-meta documentation to rebuild with the new dependency (even though the initial build was successful)? I wouldn't want to upload a new version just to get docs rebuilt, and i'm not even sure it solves the issue. Regards, Jonas

1 0

Ordering of BigFloats in numbers-3000.0.0.0
by Michael Orlitzky 12 Oct '12

12 Oct '12

I'm trying to use, http://hackage.haskell.org/package/numbers-3000.0.0.0 to get better precision "for free" out of some numerical code. I ran into an issue pretty quickly, though. In Data.Number.BigFloat, we have, data BigFloat e = BF (Fixed e) Integer deriving (Eq, Ord) and the derived Ord is obviously incorrect: Prelude Data.Number.BigFloat> let x = 0.1 :: BigFloat Prec50 Prelude Data.Number.BigFloat> let y = 0.02 :: BigFloat Prec50 Prelude Data.Number.BigFloat> x < y True But, I'm not sure who I should contact as the maintainer. The LICENSE file has, Copyright (c) 2007-2012 Lennart Augustsson, Russell O'Connor, Richard Smith, Daniel Wagner, Dan Burton The cabal file says (no email address), Maintainer: Lennart Augustsson And the repo is at, https://github.com/DanBurton/numbers Does anyone know who I should bug for a fix?

4 7

London Haskell User Group is back
by Derek Wright 11 Oct '12

11 Oct '12

[Sorry if you have already seen / heard this already, this really is the last announcement...] After 3 years away the London Haskell User Group is back. Our first meeting is in a couple of weeks. Wednesday 24-Oct-2012 6-30pm City University, College Building, St John Street, London. EC1V 4PB http://www.meetup.com/London-HUG/events/85763942/ Why Do Monads Matter? Speaker: Derek Wright A quick tour through the why rather than the how of monads. Trying to give an intuition about why these concepts matter in the first place. From The Four Horsemen of the Catapocalypse (Failure, Dependence, Uncertainty and Destruction) through Kleisli arrows and ending up with monads and categorical programming. See why these abstract concepts should be part of every Haskell programmers toolkit. Join us for the first talk of London Haskell 2.0, then participate in a discussion about the future meetings and shape the vision! We are using Meetup to organise everything and the main page for London Haskell is: http://www.meetup.com/London-HUG/ There has already been a lot interest and 35 (out of a possible 40) have signed up already! Hope to see you there. Yours, Derek.

1 0

64-bit vs 32-bit haskell platform on Mac: misleading notice on Platform website?
by Eugene Kirpichov 11 Oct '12

11 Oct '12

Hi, I installed Haskell Platform 32-bit on a fresh 64-bit mac, because the page http://www.haskell.org/platform/mac.html says: "Pick the 32-bit vesion, unless you have a specific reason to use the 64-bit version. The 32-bit one is slightly faster for most programs." Then, during the installation of a package, the following happeed: Loading package cairo-0.12.3.1 ... <command line>: can't load .so/.DLL for: /opt/local/lib/libz.dylib (dlopen(/opt/local/lib/libz.dylib, 9): no suitable image found. Did find: /opt/local/lib/libz.dylib: mach-o, but wrong architecture) That libz.dylib is a 64-bit library and it can't be used by 32-bit Haskell platform. QUESTION: It seems to me that most people, at least most who care about "slightly faster" programs, are likely to run into something like this - using native 64-bit libraries. Compatibility exists only in the opposite direction. Wouldn't it be appropriate to remove this notice and ask people to use the 64-bit version unless they have a specific reason not to? -- Eugene Kirpichov http://www.linkedin.com/in/eugenekirpichov We're hiring! http://tinyurl.com/mirantis-openstack-engineer

9 20

Safe Haskell and instance coherence
by Mikhail Glushenkov 11 Oct '12

11 Oct '12

Hello, It's a relatively well-known fact that GHC allows for multiple type class instances for the same type to coexist in a single program. This can be used, for example, to construct values of the type Data.Set.Set that violate the data structure invariant. I was mildly surprised to find out that this works even when Safe Haskell is turned on: https://gist.github.com/3854294 Note that the warnings tell us that both instances are "[safe]" which gives a false sense of security. I couldn't find anything on the interplay between orphan instances and Safe Haskell both in the Haskell'12 paper and online. Is this something that the authors of Safe Haskell are aware of/are intending to fix? -- () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments

3 7

ANN: data-dword: Long binary words from short ones
by Mikhail Vorozhtsov 11 Oct '12

11 Oct '12

Hi. I'm pleased to announce my new little library, data-dword[1]. It provides Template Haskell utilities for defining binary word data types from low and high halves, e.g. data Word96 = Word96 Word32 Word64 -- strictness is configurable data Int96 = Int96 Int32 Word64 -- All instances are fully implemented (including `quotRem`, etc) instance Bounded, Enum, Eq, Integral, Num, Ord, Read, Real, Show, Ix, Bits, Hashable -- Extra bit-manipulating functions, unwrapped addition and -- multiplication, etc. instance BinaryWord, DoubleWord -- Rewrite rules for converting to/from the standard integral types {-# RULES "fromIntegral/..." ... #-} The library comes with a pretty thorough test suite (that ATM has some failures on x86-32 due to bug #7233[2] in the base library). [1] http://hackage.haskell.org/package/data-dword [2] http://hackage.haskell.org/trac/ghc/ticket/7233

2 2

Haskell Weekly News: Issue 247
by Daniel Santa Cruz 11 Oct '12

11 Oct '12

Welcome to issue 247 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of September 30 to October 6, 2012. Quotes of the Week * monochrom: 98% of people lack the property that they're members of the other 2% * ManuelChakravarty: We used to say, "Learn Haskell, it makes you a better Java programmer." Now we say, "Learn Agda, it makes you a better Haskell programmer." * Cale: data Nature a = Rock a | Stream (Nature a) | Bush (Nature a) (Nature a) * rwbarton: type inference is supposed to be the compiler's job, not the reader's job * ShelSilverstein: Lazy Lazy Lazy Lazy Lazy Lazy Jane. She wants a drink of water so she waits and waits and waits and waits and waits for it to rain. * Cale: We're up to 950 users which apparently means that any beginner question is now answered by 4 people. * YayMe: When I first started playing with haskell I could barely sleep for 2 days because of how confused it made me * EvanLaforge: Then we can tell them about how we had to walk in the snow both ways uphill fighting space leaks with bare hands while they just have to read about it. * nand: every time I try arguing semantics, I come to the conclusion that every word is the exact same thing and refers to anything * bfig: i have been reborn as a haskell programer after finding Debug.Trace Top Reddit Stories * Factorization diagrams Domain: mathlesstraveled.com, Score: 82, Comments: 11 On Reddit: [1] http://goo.gl/Jrk0M Original: [2] http://goo.gl/kXkiV * The New Cloud Haskell Domain: well-typed.com, Score: 73, Comments: 21 On Reddit: [3] http://goo.gl/hcRJJ Original: [4] http://goo.gl/0oWfj * GHC HEAD now features Agda-like Holes Domain: hpaste.org, Score: 66, Comments: 43 On Reddit: [5] http://goo.gl/J8bIu Original: [6] http://goo.gl/297jv * FizzBuzz Revisited using Monoids Domain: dave.fayr.am, Score: 55, Comments: 68 On Reddit: [7] http://goo.gl/nqIsE Original: [8] http://goo.gl/995Zq * Which advanced Haskell topics interest you? (Survey) Domain: docs.google.com, Score: 39, Comments: 12 On Reddit: [9] http://goo.gl/Djy63 Original: [10] http://goo.gl/K5pRm * A fast new SipHash implementation Domain: serpentine.com, Score: 34, Comments: 8 On Reddit: [11] http://goo.gl/ZGSxD Original: [12] http://goo.gl/GiD3F * Communication Patterns in Cloud Haskell (Part 1): master-slave, work-stealing and work-pushing Domain: well-typed.com, Score: 33, Comments: 10 On Reddit: [13] http://goo.gl/IRr8s Original: [14] http://goo.gl/6vUyY * Category and lenses Domain: web.jaguarpaw.co.uk, Score: 28, Comments: 2 On Reddit: [15] http://goo.gl/r6Ajl Original: [16] http://goo.gl/VwtQP * Yesod Tutorial 1 at FP Complete Domain: fpcomplete.com, Score: 28, Comments: 15 On Reddit: [17] http://goo.gl/wnUkh Original: [18] http://goo.gl/kvCMu * The usual type signatures for foldl and foldr are confusing Domain: self.haskell, Score: 27, Comments: 63 On Reddit: [19] http://goo.gl/XGHq8 Original: [20] http://goo.gl/XGHq8 * Haskell Symposium 2012 (with youtube links) Domain: haskell.org, Score: 27, Comments: 1 On Reddit: [21] http://goo.gl/7Dz89 Original: [22] http://goo.gl/I1XXa * Solving a Partial Differential Equation Comonadically Domain: idontgetoutmuch.wordpress.com, Score: 27, Comments: 2 On Reddit: [23] http://goo.gl/Qxwjq Original: [24] http://goo.gl/lBm12 * Need a math related Haskell project suggestion Domain: self.haskell, Score: 22, Comments: 20 On Reddit: [25] http://goo.gl/o3lYl Original: [26] http://goo.gl/o3lYl * Algebraically Interpreting Polymorphism Domain: stackoverflow.com, Score: 21, Comments: 12 On Reddit: [27] http://goo.gl/3SCA9 Original: [28] http://goo.gl/wC6rm Top StackOverflow Questions * Why is seq bad? votes: 18, answers: 1 Read on SO: [29] http://goo.gl/IwVYS * Can I speed up this Haskell algorithm? votes: 18, answers: 3 Read on SO: [30] http://goo.gl/PSVUB * Is there a library that uses ConstraintKinds to generalize all the base type classes to allow constraints? votes: 15, answers: 1 Read on SO: [31] http://goo.gl/MfTMC * What are skolems? votes: 15, answers: 2 Read on SO: [32] http://goo.gl/qEnEI * What does it usually mean when a Haskell record accessor leads with an underscore? votes: 14, answers: 3 Read on SO: [33] http://goo.gl/3YD1n * How does this piece of obfuscated Haskell code work? votes: 12, answers: 1 Read on SO: [34] http://goo.gl/rLtFG * How to implement a game loop in reactive-banana? votes: 12, answers: 1 Read on SO: [35] http://goo.gl/nx3zR * How do Haskell currying and pattern matching work together? votes: 9, answers: 1 Read on SO: [36] http://goo.gl/jBCz0 * How does the constraints package work? votes: 9, answers: 1 Read on SO: [37] http://goo.gl/mb2na * In haskell, What does :+: mean in data type definition? votes: 9, answers: 1 Read on SO: [38] http://goo.gl/kv0Yn * Monad m => a -> [a -> m a] -> m a votes: 9, answers: 1 Read on SO: [39] http://goo.gl/ns8FG * How to decorate a Tree in Haskell votes: 7, answers: 2 Read on SO: [40] http://goo.gl/kBn66 Until next time, Daniel Santa Cruz References 1. http://mathlesstraveled.com/2012/10/05/factorization-diagrams/ 2. http://www.reddit.com/r/haskell/comments/1117h2/factorization_diagrams/ 3. http://www.well-typed.com/blog/70 4. http://www.reddit.com/r/haskell/comments/10y089/the_new_cloud_haskell/ 5. http://hpaste.org/75668 6. http://www.reddit.com/r/haskell/comments/10u7xr/ghc_head_now_features_agdal… 7. http://dave.fayr.am/posts/2012-10-4-finding-fizzbuzz.html 8. http://www.reddit.com/r/haskell/comments/10zlyy/fizzbuzz_revisited_using_mo… 9. https://docs.google.com/spreadsheet/viewform?formkey=dE1QZFNRLTFMdkllYWIyR2… 10. http://www.reddit.com/r/haskell/comments/10r2yk/which_advanced_haskell_topi… 11. http://www.serpentine.com/blog/2012/10/02/a-fast-new-siphash-implementation… 12. http://www.reddit.com/r/haskell/comments/10u381/a_fast_new_siphash_implemen… 13. http://www.well-typed.com/blog/71 14. http://www.reddit.com/r/haskell/comments/10zo6t/communication_patterns_in_c… 15. http://web.jaguarpaw.co.uk/~tom/blog/2012/09/30/category-and-lenses.html 16. http://www.reddit.com/r/haskell/comments/10ph2c/category_and_lenses/ 17. http://fpcomplete.com/yesod-tutorial-1-my-first-web-site/ 18. http://www.reddit.com/r/haskell/comments/10seol/yesod_tutorial_1_at_fp_comp… 19. http://www.reddit.com/r/haskell/comments/10q2ls/the_usual_type_signatures_f… 20. http://www.reddit.com/r/haskell/comments/10q2ls/the_usual_type_signatures_f… 21. http://www.haskell.org/haskell-symposium/2012/index.html 22. http://www.reddit.com/r/haskell/comments/10xafx/haskell_symposium_2012_with… 23. http://idontgetoutmuch.wordpress.com/2012/04/01/solving-a-partial-different… 24. http://www.reddit.com/r/haskell/comments/10zy51/solving_a_partial_different… 25. http://www.reddit.com/r/haskell/comments/10zf9c/need_a_math_related_haskell… 26. http://www.reddit.com/r/haskell/comments/10zf9c/need_a_math_related_haskell… 27. http://stackoverflow.com/questions/10453558/algebraically-interpreting-poly… 28. http://www.reddit.com/r/haskell/comments/10rt4y/algebraically_interpreting_… 29. http://stackoverflow.com/questions/12687392/why-is-seq-bad 30. http://stackoverflow.com/questions/12730503/can-i-speed-up-this-haskell-alg… 31. http://stackoverflow.com/questions/12697348/is-there-a-library-that-uses-co… 32. http://stackoverflow.com/questions/12719435/what-are-skolems 33. http://stackoverflow.com/questions/12746229/what-does-it-usually-mean-when-… 34. http://stackoverflow.com/questions/12659951/how-does-this-piece-of-obfuscat… 35. http://stackoverflow.com/questions/12685430/how-to-implement-a-game-loop-in… 36. http://stackoverflow.com/questions/12658936/how-do-haskell-currying-and-pat… 37. http://stackoverflow.com/questions/12728159/how-does-the-constraints-packag… 38. http://stackoverflow.com/questions/12733171/in-haskell-what-does-mean-in-da… 39. http://stackoverflow.com/questions/12755655/monad-m-a-a-m-a-m-a 40. http://stackoverflow.com/questions/12658443/how-to-decorate-a-tree-in-haske…

1 0

ANNOUNCE: luachunk-0.1
by Anupam Jain 10 Oct '12

10 Oct '12

Hi all, I just released luachunk-0.1 on Hackage (http://github.com/ajnsit/luachunk) Luachunk is a small library to read and write Lua 5.1 bytecode chunks. It is modeled after ChunkSpy.lua (http://luaforge.net/projects/chunkspy/) though the code is written from scratch. A pretty listing printer for lua bytecode is in the works. I used LuaChunk in a project to generate Lua bytecode via a DSL, and then interpret it with HsLua. I hope to release the DSL itself sometime in the future. -- Anupam

2 3

Re: [Haskell-cafe] CPS Streams
by jeff p 10 Oct '12

10 Oct '12

Here is an haste of the original message since it seems like the formatting was lost. http://hpaste.org/76082 sorry about that, Jeff

1 0

ANN: Groundhog 0.2 - now with database index support
by Boris Lykah 10 Oct '12

10 Oct '12

I am excited to announce a new release of Groundhog 0.2 - a library for high-level database access. * http://hackage.haskell.org/package/groundhog * http://hackage.haskell.org/package/groundhog-th * http://hackage.haskell.org/package/groundhog-postgresql * http://hackage.haskell.org/package/groundhog-sqlite * http://github.com/lykahb/groundhog Since the last release I got a lot of positive feedback which showed that many people are interested in the project. I want to thank them for their encouragement and constructive suggestions that helped me to adjust the development priorities. To help keeping track of the Groundhog project development, the most important changes of a release are now logged to the HISTORY files in repository. Along with many small improvements and refactorings, this major release has two novel features: * Support for database unique indexes. Now the unique keys can be created with either constraints or indexes. In the API the difference affects only the code generation settings which have a new field * Customizing column type name for schema migration. This contributes to compatibility with already existing databases and allows utilization of the database-specific features like limiting string size or number precision. See example at https://github.com/lykahb/groundhog/blob/master/examples/dbSpecificTypes.hs Package groundhog-th has improved error reporting. Now it precisely reports the line and position where parsing of the YAML-based settings failed. This required a patch in the yaml dependency, so other yaml package users have this fix as well. The full description of the YAML settings format is available at http://hackage.haskell.org/packages/archive/groundhog-th/0.2.0/doc/html/Dat… I appreciate your feedback.

1 0

Image processing using Repa
by Janek S. 10 Oct '12

10 Oct '12

I'm playing a bit with Repa library and its DevIL bindings. I tried to modify one of the examples from tutorial on HaskellWiki. I want to load an image, rotate it and save it to disk. I managed to write something like this: import Foreign.Ptr import System.Environment import Data.Array.Repa as R hiding ((++)) import qualified Data.Array.Repa.Repr.ForeignPtr as RFP import Data.Array.Repa.IO.DevIL main = do [f] <- getArgs (RGB v) <- runIL $ readImage f RFP.computeIntoP (RFP.toForeignPtr v) (rot180 v) runIL $ writeImage ("flip-"++f) (RGB v) return () rot180 g = backpermute e flop g where e@(Z :. x :. y :. _) = extent g flop (Z :. i :. j :. k) = (Z :. x - i - 1 :. y - j - 1 :. k) This is obviously wrong, because the foreign pointer used as a data source is at the same time used as destination, so the data gets overwritten before it is used. Does this mean that I have to allocate foreign memory buffers on my own? If so, than it feels kind of painfull to go through the hassle of allocating foreign pointers, converting between many different representations and so on. Am I doing something wrong and if not is there a more painless way of working with images and repa in Haskell? Jan

2 2

CPS Streams
by jeff p 10 Oct '12

10 Oct '12

{- I've always thought that the essence of iteratees is just CPS (I have no desire to argue the merits of this statement, and I preemptively concede to anyone who disagrees with this), so I decided to experiment with a direct CPS version of streams. The resulting code turned out nicer than I'd expected, so I'm writing about it in case anyone else finds it interesting or instructive (it seems to me that Haskellers tend to shy away from CPS). I'm pretty sure this technique is not new, but a cursory search didn't turn up quite the same thing. I'd be interested in any pointers to this somewhere else, as well any general feedback about this. -} {-# LANGUAGE ScopedTypeVariables, TupleSections #-} import Control.Applicative hiding (empty) import Control.Arrow import Control.Exception import Control.Monad (unless) import Data.Attoparsec.Text import Data.Text import Data.Text.IO import Prelude hiding (catch, getLine, lines, length, null, putStrLn, readFile, splitAt) import qualified Prelude as P import System.IO (IOMode(..), hClose, hIsClosed, withFile) import System.IO.Error hiding (catch) {- A stream is a function which takes a stream continuation and gives a result. A stream continuation takes an input (the next element of the stream) and the rest of the stream and returns a result. If the continuation is given Nothing, then the stream it was given to is done. This intuition can be realized with the following type which will let us do compositional incremental input processing in a direct functional style. -} newtype Stream0CPS a r = Stream0CPS { stream0CPS :: Maybe (a, Stream0 a r) -> r } type Stream0 a r = Stream0CPS a r -> r -- Stream the lines of a file. -- The finally statement is not necessary, but it lets us observe when files are closed. fileStream0 :: FilePath -> Stream0 Text (IO r) fileStream0 fileName k = withFile fileName ReadMode $ \h -> do P.putStrLn $ "___opening "++fileName finally (go h k) (do isClosed <- hIsClosed h unless isClosed $ hClose h >> P.putStrLn ("___finally closing "++fileName) ) where go h k = stream0CPS k . fmap (, go h) =<< safeNextLine h safeNextLine h = catch (Just <$> hGetLine h) $ \e -> if isEOFError e then hClose h >> P.putStrLn ("___EOF closing "++fileName) >> return Nothing else ioError e -- Print elements of a stream. printStream0 :: Show a => Stream0 a (IO ()) -> IO () printStream0 xs = xs $ Stream0CPS $ maybe (P.putStrLn "NOTHING") (\(x, xs') -> P.putStrLn (show x) >> printStream0 xs') -- Append two streams together. appendStream0 :: Stream0 a r -> Stream0 a r -> Stream0 a r appendStream0 xs ys k = xs $ Stream0CPS cont where cont Nothing = ys k cont (Just (v, xs')) = stream0CPS k $ Just (v, appendStream0 xs' ys) -- Create a stream with only the first n elements of a given stream. takeStream0 :: Int -> Stream0 a r -> Stream0 a r takeStream0 n xs k | n > 0 = xs $ Stream0CPS $ stream0CPS k . fmap (id *** takeStream0 (n - 1)) | otherwise = stream0CPS k Nothing {- Suppose we have a file named testWords with the words "one" through "five" on separate lines, and a file called testNums with the numbers 1 though 5 on separate lines. Then we can do the following: *Main> printStream0 $ appendStream0 (fileStream0 "testWords") (fileStream0 "testNums") ___opening testWords "one" "two" "three" "four" "five" ___EOF closing testWords ___opening testNums "1" "2" "3" "4" "5" ___EOF closing testNums NOTHING which is as expected, however, we also see: *Main> printStream0 $ appendStream0 (takeStream0 3 $ fileStream0 "testWords") (fileStream0 "testNums") ___opening testWords "one" "two" "three" ___opening testNums "1" "2" "3" "4" "5" ___EOF closing testNums NOTHING ___finally closing testWords which is not ideal since we'd like testWords to be closed as soon as we're done with it. In order to accomplish this, we have to add a way to tell a stream to close down. This is easily accomplished by giving an extra argument to streams, which tells them what to do. While below we have only allowed for streams to continue and stop, there is no reason the StreamAction type, and the stream functions, couldn't be expanded to allow for dynamically changing stream behavior, e.g. a variable sized chunker, or a tunable filter. -} newtype StreamCPS a r = StreamCPS { streamCPS :: Maybe (a, Stream a r) -> r } type Stream a r = StreamAction -> StreamCPS a r -> r data StreamAction = Continue | Stop {- Now we just have to modify the previous functions to explain what to do when asked to stop. -} fileStream :: FilePath -> Stream Text (IO r) fileStream fileName action k = withFile fileName ReadMode $ \h -> do P.putStrLn $ "___opening "++fileName finally (go h action k) (do isClosed <- hIsClosed h unless isClosed $ hClose h >> P.putStrLn ("___finally closing "++fileName) ) where go h Continue k = streamCPS k . fmap (, go h) =<< safeNextLine h go h Stop k = hClose h >> P.putStrLn ("___Stop closing "++fileName) >> streamCPS k Nothing safeNextLine h = catch (Just <$> hGetLine h) $ \e -> if isEOFError e then hClose h >> P.putStrLn ("___EOF closing "++fileName) >> return Nothing else ioError e printStream :: Show a => Stream a (IO ()) -> IO () printStream xs = xs Continue $ StreamCPS $ maybe (P.putStrLn "NOTHING") (\(x, xs') -> P.putStrLn (show x) >> printStream xs') -- In order to stop appendStream xs ys, stop xs then stop ys appendStream :: Stream a r -> Stream a r -> Stream a r appendStream xs ys Stop k = xs Stop $ StreamCPS $ \_ -> ys Stop k appendStream xs ys Continue k = xs Continue $ StreamCPS cont where cont Nothing = ys Continue k cont (Just (v, xs')) = streamCPS k $ Just (v, appendStream xs' ys) takeStream :: Int -> Stream a r -> Stream a r takeStream _ xs Stop k = xs Stop k takeStream n xs Continue k | n > 0 = xs Continue $ StreamCPS $ streamCPS k . fmap (id *** takeStream (n - 1)) | otherwise = xs Stop k {- Now we get the desired behavior: *Main> printStream $ appendStream (takeStream 3 $ fileStream "testWords") (fileStream "testNums") ___opening testWords "one" "two" "three" ___Stop closing testWords ___opening testNums "1" "2" "3" "4" "5" ___EOF closing testNums NOTHING Here are a few more stream functions to give a feel for what sorts of things can easily be done. -} emptyStream :: Stream a r emptyStream _ k = streamCPS k Nothing getLineStream :: Stream Text (IO r) getLineStream Stop k = streamCPS k Nothing getLineStream Continue k = streamCPS k . Just . (, getLineStream) =<< getLine listToStream :: [a] -> Stream a r listToStream _ Stop k = streamCPS k Nothing listToStream [] Continue k = streamCPS k Nothing listToStream (x:xs) Continue k = streamCPS k $ Just (x, listToStream xs) -- Stream consumers should have a general enough return type to work with streams in a monad. countStream :: Monad m => Stream a (m Int) -> m Int countStream xs = xs Continue $ StreamCPS $ go 0 where go n (Just (_, xs')) = xs' Continue $ StreamCPS $ go $ n + 1 go n Nothing = return n consStream :: a -> Stream a r -> Stream a r consStream _ s Stop k = s Stop k consStream x s Continue k = streamCPS k $ Just (x, s) mapStream :: (a -> b) -> Stream a r -> Stream b r mapStream f xs action k = xs action $ StreamCPS $ streamCPS k . fmap (f *** mapStream f) filterStream :: (a -> Bool) -> Stream a r -> Stream a r filterStream p xs action k = xs action $ StreamCPS $ maybe (streamCPS k Nothing) (\(x, xs') -> if p x then streamCPS k $ Just (x, filterStream p xs') else filterStream p xs' Continue k) dropStream :: Int -> Stream a r -> Stream a r dropStream _ xs Stop k = xs Stop k dropStream n xs Continue k = xs Continue newK where newK | n > 0 = StreamCPS $ maybe (streamCPS k Nothing) (\(_, xs') -> dropStream (n - 1) xs' Continue k) | otherwise = k -- Round robin interleaving of a list of streams. mergeStreams :: [Stream a r] -> Stream a r mergeStreams [] _ k = streamCPS k Nothing mergeStreams (s:ss) Stop k = s Stop $ StreamCPS $ \_ -> mergeStreams ss Stop k mergeStreams (s:ss) Continue k = s Continue $ StreamCPS $ maybe (mergeStreams ss Continue k) $ \(v,s') -> streamCPS k $ Just (v, mergeStreams $ ss++[s']) -- Run an attoparsec parser over the given stream. -- Note the parser can consume partial and/or multiple lines from the stream to generate its result. attoStream :: forall a r . Parser a -> Stream Text (IO r) -> Stream a (IO r) attoStream p = go (parse p) where go :: (Text -> Result a) -> Stream Text (IO r) -> Stream a (IO r) go _ xs Stop k = xs Stop $ StreamCPS $ \_ -> streamCPS k Nothing go f xs Continue k = xs Continue $ StreamCPS $ maybe (streamCPS k Nothing) $ \(line, xs') -> case f line of Done rest v -> streamCPS k $ Just (v, attoStream p $ consStream rest xs') f'@(Partial _) -> go (feed f') xs' Continue k f'@(Fail _ _ctxs err) -> P.putStrLn ("___Atto Error: "++err) >> go (feed f') xs' Stop k

2 1

object file cannot be loaded.
by Magicloud Magiclouds 10 Oct '12

10 Oct '12

Hi, I am installing postgres hackage (cannot remember the exact name right now). When it compiling the template haskell part I got the following error message. I tried to clear all user space hackages. Not helping. Loading package text-0.11.2.3 ... linking ... ghc: /home/magicloud/.cabal/lib/text-0.11.2.3/ghc-7.6.1/HStext-0.11.2.3.o: unknown symbol `bytestringzm0zi10zi0zi1_DataziByteStringziInternal_PS_con_info' ghc: unable to load package `text-0.11.2.3' -- 竹密岂妨流水过山高哪阻野云飞 And for G+, please use magiclouds#gmail.com.

2 4

OpenGL library will not load into GHCi 7.6.1 on Win7 x86-64
by Dan Haraj 10 Oct '12

10 Oct '12

This is a regression of some sort since the library operates fine within GHCi for previous versions of GHC. I don't know whether it is a problem with GHCi, the OpenGL library, or some third party. This is the error encountered when a module that uses OpenGL tries to load: Prelude Main> main Loading package OpenGLRaw-1.2.0.0 ... linking ... ghc.exe: unable to load package `OpenGLRaw-1.2.0.0' Prelude Main> :q Leaving GHCi. <interactive>: C:\...\OpenGLRaw-1.2.0.0\ghc-7.6.1\HSOpenGLRaw-1.2.0.0.o: unknown symbol `__imp_wglGetProcAddress' I have very little of an idea of what's going on here. It would be rather painful to debug this myself so any insight is appreciated.

2 1

ANN: New York Haskell Users Group -- First Meeting on Wed., Nov 14.
by Gershom B 10 Oct '12

10 Oct '12

The (arguably) greatest city in the U.S. now (finally) has a users group for (unarguably) the greatest programming language anywhere. We're very happy to announce the inaugural meeting of the New York Haskell Users Group. We intend this group to be welcoming to new developers, but with enough substance to keep old Haskell hands interested and amused. If you're in the area but can't make it, you can join the meetup regardless at http://www.meetup.com/NY-Haskell/ to stay informed of future events. We plan to have a mix of talks and experience reports at all levels, so if you will be passing through town and might have something to say, let us know! Two Haskell Talks: Practical Data Processing With Haskell _and_ Putting Cloud Haskell to Work Wednesday, November 14, 2012 7:00 PM To 9:00 PM Pivotal Labs, 841 Broadway New York, NY RSVP: http://www.meetup.com/NY-Haskell/ We're kicking off the New York Haskell Users Group with two great talks, one for people just getting started and one for those with some experience already. Both should be accessible and enjoyable no matter how much (or little) you already know. Food and refreshments will be provided, courtesy of the generosity of Pivotal Labs, and after the talks, we're planning to keep the discussion going over food and drink at a nearby establishment. 7pm - Practical Data Processing With Haskell: Ozgun Ataman will give an introductory talk on Haskell, diving right in with how you can start using Haskell for practical data manipulation tasks today. You'll be introduced to a typical setup for Haskell development and given a demonstration of how a common data format (CSV, JSON, etc.) can be parsed, processed and finally output using Haskell. The talk will include a small actual Haskell program to be modified live and some commentary around using Haskell in practical applications. 8pm - Putting Cloud Haskell to Work for Distributed Computing: Gershom Bazerman will give an overview of the new distributed-process library that implements Cloud Haskell, providing computation across heterogeneous nodes through a message passing interface. He will discuss what this new tool provides out of the box, and what you'll have to bring to the table. The talk will include some code samples using the new library, as well as some experience about what it's like to use Haskell for distributed computing in the real world. Speaker Biographies: Ozgun Ataman is the founder of Soostone, a managment consulting and analytics company built on Haskell. He is the author of many open-source Haskell libraries, and is a contributor to the Snap web framework. Gershom Bazerman is a developer at S&P Capital IQ. He is most well known in the Haskell community as the author of the JMacro library for programmatic generation of JavaScript, and for one well-received April fools joke.

1 0

total Data.Map.! function
by Henning Thielemann 09 Oct '12

09 Oct '12

I wondered whether there is a brilliant typing technique that makes Data.Map.! a total function. That is, is it possible to give (!) a type, such that m!k expects a proof that the key k is actually present in the dictionary m? How can I provide the proof that k is in m? Same question for 'lab' (import Data.Graph.Inductive(lab)). That is, can there be a totalLab, with (totalLab gr = fromJust . lab gr) that expects a proof that the node Id is actually contained in a graph?

4 4

problem with cabal-install-1.16.0 and Cabal-1.16.0.1 on Haskell Platform for OS X
by Derrell Piper 09 Oct '12

09 Oct '12

Hi, New Haskell user here. I have the latest Haskell Platform 2012.2.0.0 for Mac OS X, 64 bit installed. I have not installed any additional packages. Believe me, the Prelude hurts enough. Anyways, seeing the big update to cabal, I decided to install it and did a: cabal install cabal-install-1.16.0 Cabal-1.16.0.1 ...per the announcement. The installation seemingly went well (log attached) but I'm left with a symlink farm that's still pointing at the old version. NB: I did the installation in my own account (ddp), not via sudo which looks like what was probably expected given the ownerships I do see. Here's what I'm left with: % which cabal /usr/bin/cabal % ls -la /usr/bin/cabal lrwxr-xr-x 1 root wheel - 26 Oct 8 16:42 /usr/bin/cabal -> /Library/Haskell/bin/cabal % ls -la /Library/Haskell/bin/cabal* lrwxr-xr-x 1 ddp wheel - 10 Oct 8 16:42 /Library/Haskell/bin/cabal -> cabal.wrap lrwxr-xr-x 1 ddp wheel - 37 Oct 8 16:42 /Library/Haskell/bin/cabal.real -> ../lib/cabal-install-0.14.0/bin/cabal -rwxr-xr-x 1 root admin - 4197 May 27 12:37 /Library/Haskell/bin/cabal.wrap I find that it actually installed itself here: % ls -la ~/Library/Haskell/bin/cabal* lrwxr-xr-x 1 ddp staff - 47 Oct 8 20:45 /Users/ddp/Library/Haskell/bin/cabal -> ../ghc-7.4.1/lib/cabal-install-1.16.0/bin/cabal So I guess my questions are: 1) did I miss some step along the way? 2) what's the correct way to fix this? Just change the cabal.real symlink to point to where it actually is? 3) which, if any, directories should I have in my PATH in general: /Library/Haskell/bin, ~/Library/Haskell/bin, neither or both? Thanks, Derrell Installation log: fluffy512% cabal --version cabal-install version 0.14.0 using version 1.14.0 of the Cabal library fluffy513% cabal update Downloading the latest package list from hackage.haskell.org Note: there is a new version of cabal-install available. To upgrade, run: cabal install cabal-install fluffy514% cabal install cabal-install-1.16.0 Cabal-1.16.0.1 Resolving dependencies... [ 1 of 65] Compiling Distribution.Compat.Exception ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Compat/Exception.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Compat/Exception.o ) [ 2 of 65] Compiling Distribution.Compat.TempFile ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Compat/TempFile.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Compat/TempFile.o ) [ 3 of 65] Compiling Distribution.Compat.CopyFile ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Compat/CopyFile.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Compat/CopyFile.o ) [ 4 of 65] Compiling Distribution.GetOpt ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/GetOpt.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/GetOpt.o ) [ 5 of 65] Compiling Distribution.Compat.ReadP ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Compat/ReadP.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Compat/ReadP.o ) [ 6 of 65] Compiling Distribution.Text ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Text.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Text.o ) [ 7 of 65] Compiling Distribution.Version ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Version.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Version.o ) [ 8 of 65] Compiling Language.Haskell.Extension ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Language/Haskell/Extension.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Language/Haskell/Extension.o ) [ 9 of 65] Compiling Distribution.TestSuite ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/TestSuite.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/TestSuite.o ) [10 of 65] Compiling Distribution.System ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/System.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/System.o ) [11 of 65] Compiling Distribution.Simple.PreProcess.Unlit ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/PreProcess/Unlit.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/PreProcess/Unlit.o ) [12 of 65] Compiling Distribution.ReadE ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/ReadE.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/ReadE.o ) [13 of 65] Compiling Distribution.Verbosity ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Verbosity.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Verbosity.o ) [14 of 65] Compiling Distribution.Package ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Package.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Package.o ) [15 of 65] Compiling Distribution.ModuleName ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/ModuleName.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/ModuleName.o ) [16 of 65] Compiling Distribution.Simple.Utils ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Utils.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Utils.o ) [17 of 65] Compiling Distribution.Simple.Program.Types ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Types.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Types.o ) [18 of 65] Compiling Distribution.Simple.Program.Builtin ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Builtin.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Builtin.o ) [19 of 65] Compiling Distribution.Simple.Program.Db ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Db.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Db.o ) [20 of 65] Compiling Distribution.Simple.Program.Run ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Run.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Run.o ) [21 of 65] Compiling Distribution.Simple.Program ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program.o ) [22 of 65] Compiling Distribution.Simple.Program.Ar ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Ar.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Ar.o ) [23 of 65] Compiling Distribution.Simple.Program.Hpc ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Hpc.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Hpc.o ) [24 of 65] Compiling Distribution.Simple.Program.Ld ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Ld.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Ld.o ) [25 of 65] Compiling Distribution.Simple.Program.Script ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/Script.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/Script.o ) [26 of 65] Compiling Distribution.License ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/License.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/License.o ) [27 of 65] Compiling Distribution.Compiler ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Compiler.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Compiler.o ) [28 of 65] Compiling Distribution.PackageDescription ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/PackageDescription.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/PackageDescription.o ) [29 of 65] Compiling Distribution.PackageDescription.Configuration ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/PackageDescription/Configuration.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/PackageDescription/Configuration.o ) [30 of 65] Compiling Distribution.PackageDescription.Check ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/PackageDescription/Check.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/PackageDescription/Check.o ) [31 of 65] Compiling Distribution.ParseUtils ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/ParseUtils.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/ParseUtils.o ) [32 of 65] Compiling Distribution.InstalledPackageInfo ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/InstalledPackageInfo.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/InstalledPackageInfo.o ) [33 of 65] Compiling Distribution.Simple.PackageIndex ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/PackageIndex.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/PackageIndex.o ) [34 of 65] Compiling Distribution.Simple.GHC.IPI642 ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/GHC/IPI642.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/GHC/IPI642.o ) [35 of 65] Compiling Distribution.Simple.GHC.IPI641 ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/GHC/IPI641.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/GHC/IPI641.o ) [36 of 65] Compiling Distribution.PackageDescription.Parse ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/PackageDescription/Parse.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/PackageDescription/Parse.o ) [37 of 65] Compiling Distribution.Simple.Command ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Command.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Command.o ) [38 of 65] Compiling Distribution.Simple.Compiler ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Compiler.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Compiler.o ) [39 of 65] Compiling Distribution.Simple.Program.HcPkg ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/HcPkg.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/HcPkg.o ) [40 of 65] Compiling Distribution.Simple.InstallDirs ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/InstallDirs.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/InstallDirs.o ) [41 of 65] Compiling Distribution.Simple.Setup ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Setup.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Setup.o ) [42 of 65] Compiling Distribution.Simple.LocalBuildInfo ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/LocalBuildInfo.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/LocalBuildInfo.o ) [43 of 65] Compiling Distribution.Simple.Build.Macros ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Build/Macros.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Build/Macros.o ) [44 of 65] Compiling Distribution.Simple.BuildPaths ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/BuildPaths.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/BuildPaths.o ) [45 of 65] Compiling Distribution.Simple.Build.PathsModule ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Build/PathsModule.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Build/PathsModule.o ) [46 of 65] Compiling Distribution.Simple.LHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/LHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/LHC.o ) [47 of 65] Compiling Distribution.Simple.Hpc ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Hpc.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Hpc.o ) [48 of 65] Compiling Distribution.Simple.JHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/JHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/JHC.o ) [49 of 65] Compiling Distribution.Simple.NHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/NHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/NHC.o ) [50 of 65] Compiling Distribution.Simple.UHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/UHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/UHC.o ) [51 of 65] Compiling Distribution.Simple.Test ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Test.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Test.o ) [52 of 65] Compiling Distribution.Simple.PreProcess ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/PreProcess.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/PreProcess.o ) [53 of 65] Compiling Distribution.Simple.Hugs ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Hugs.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Hugs.o ) [54 of 65] Compiling Distribution.Simple.SrcDist ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/SrcDist.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/SrcDist.o ) [55 of 65] Compiling Distribution.Simple.UserHooks ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/UserHooks.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/UserHooks.o ) [56 of 65] Compiling Distribution.Simple.Bench ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Bench.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Bench.o ) [57 of 65] Compiling Distribution.Simple.Program.GHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Program/GHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Program/GHC.o ) [58 of 65] Compiling Distribution.Simple.GHC ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/GHC.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/GHC.o ) [59 of 65] Compiling Distribution.Simple.Configure ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Configure.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Configure.o ) [60 of 65] Compiling Distribution.Simple.Install ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Install.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Install.o ) [61 of 65] Compiling Distribution.Simple.Register ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Register.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Register.o ) [62 of 65] Compiling Distribution.Simple.Build ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Build.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Build.o ) [63 of 65] Compiling Distribution.Simple.Haddock ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple/Haddock.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple/Haddock.o ) [64 of 65] Compiling Distribution.Simple ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Distribution/Simple.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Distribution/Simple.o ) [65 of 65] Compiling Main ( /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/Setup.hs, /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/Main.o ) Linking /var/folders/sm/f2yb5sp11490bcy5k6t46v200000gn/T/Cabal-1.16.0.1-48304/Cabal-1.16.0.1/dist/setup/setup ... Configuring Cabal-1.16.0.1... Building Cabal-1.16.0.1... Preprocessing library Cabal-1.16.0.1... [ 1 of 67] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o ) [ 2 of 67] Compiling Distribution.TestSuite ( Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o ) [ 3 of 67] Compiling Distribution.Simple.PreProcess.Unlit ( Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o ) [ 4 of 67] Compiling Distribution.GetOpt ( Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o ) [ 5 of 67] Compiling Distribution.Compat.Exception ( Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o ) [ 6 of 67] Compiling Distribution.Compat.TempFile ( Distribution/Compat/TempFile.hs, dist/build/Distribution/Compat/TempFile.o ) [ 7 of 67] Compiling Distribution.Compat.CopyFile ( Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o ) [ 8 of 67] Compiling Distribution.Compat.ReadP ( Distribution/Compat/ReadP.hs, dist/build/Distribution/Compat/ReadP.o ) [ 9 of 67] Compiling Distribution.ReadE ( Distribution/ReadE.hs, dist/build/Distribution/ReadE.o ) [10 of 67] Compiling Distribution.Verbosity ( Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o ) [11 of 67] Compiling Distribution.Text ( Distribution/Text.hs, dist/build/Distribution/Text.o ) [12 of 67] Compiling Distribution.ModuleName ( Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.o ) [13 of 67] Compiling Distribution.System ( Distribution/System.hs, dist/build/Distribution/System.o ) [14 of 67] Compiling Language.Haskell.Extension ( Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.o ) [15 of 67] Compiling Distribution.Version ( Distribution/Version.hs, dist/build/Distribution/Version.o ) [16 of 67] Compiling Distribution.License ( Distribution/License.hs, dist/build/Distribution/License.o ) [17 of 67] Compiling Distribution.Package ( Distribution/Package.hs, dist/build/Distribution/Package.o ) [18 of 67] Compiling Distribution.Simple.Utils ( Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o ) [19 of 67] Compiling Distribution.Simple.Program.Types ( Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o ) [20 of 67] Compiling Distribution.Simple.Program.Run ( Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o ) [21 of 67] Compiling Distribution.Simple.Program.Ar ( Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o ) [22 of 67] Compiling Distribution.Simple.Program.Ld ( Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o ) [23 of 67] Compiling Distribution.Simple.Program.Hpc ( Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o ) [24 of 67] Compiling Distribution.Simple.Program.Script ( Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o ) [25 of 67] Compiling Distribution.Simple.Program.Builtin ( Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o ) [26 of 67] Compiling Distribution.Simple.Program.Db ( Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o ) [27 of 67] Compiling Distribution.Simple.Program ( Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o ) [28 of 67] Compiling Distribution.Compiler ( Distribution/Compiler.hs, dist/build/Distribution/Compiler.o ) [29 of 67] Compiling Distribution.ParseUtils ( Distribution/ParseUtils.hs, dist/build/Distribution/ParseUtils.o ) [30 of 67] Compiling Distribution.InstalledPackageInfo ( Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.o ) [31 of 67] Compiling Distribution.Simple.PackageIndex ( Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o ) [32 of 67] Compiling Distribution.Simple.GHC.IPI642 ( Distribution/Simple/GHC/IPI642.hs, dist/build/Distribution/Simple/GHC/IPI642.o ) [33 of 67] Compiling Distribution.Simple.GHC.IPI641 ( Distribution/Simple/GHC/IPI641.hs, dist/build/Distribution/Simple/GHC/IPI641.o ) [34 of 67] Compiling Distribution.Simple.Command ( Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o ) [35 of 67] Compiling Distribution.PackageDescription ( Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.o ) [36 of 67] Compiling Distribution.PackageDescription.Configuration ( Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.o ) [37 of 67] Compiling Distribution.PackageDescription.Parse ( Distribution/PackageDescription/Parse.hs, dist/build/Distribution/PackageDescription/Parse.o ) [38 of 67] Compiling Distribution.PackageDescription.PrettyPrint ( Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.o ) [39 of 67] Compiling Distribution.PackageDescription.Check ( Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o ) [40 of 67] Compiling Distribution.Simple.Compiler ( Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o ) [41 of 67] Compiling Distribution.Simple.Program.HcPkg ( Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o ) [42 of 67] Compiling Distribution.Simple.InstallDirs ( Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o ) [43 of 67] Compiling Distribution.Simple.Setup ( Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o ) [44 of 67] Compiling Distribution.Make ( Distribution/Make.hs, dist/build/Distribution/Make.o ) [45 of 67] Compiling Distribution.Simple.Program.GHC ( Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o ) [46 of 67] Compiling Distribution.Simple.LocalBuildInfo ( Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o ) [47 of 67] Compiling Distribution.Simple.BuildPaths ( Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o ) [48 of 67] Compiling Distribution.Simple.JHC ( Distribution/Simple/JHC.hs, dist/build/Distribution/Simple/JHC.o ) [49 of 67] Compiling Distribution.Simple.NHC ( Distribution/Simple/NHC.hs, dist/build/Distribution/Simple/NHC.o ) [50 of 67] Compiling Distribution.Simple.UHC ( Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o ) [51 of 67] Compiling Distribution.Simple.Build.Macros ( Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o ) [52 of 67] Compiling Distribution.Simple.Build.PathsModule ( Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o ) Distribution/Simple/Build/PathsModule.hs:210:19: Warning: Pattern match(es) are non-exhaustive In a case alternative: Patterns not matched: PPC PPC64 Sparc Arm ... [53 of 67] Compiling Distribution.Simple.GHC ( Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o ) [54 of 67] Compiling Distribution.Simple.LHC ( Distribution/Simple/LHC.hs, dist/build/Distribution/Simple/LHC.o ) [55 of 67] Compiling Distribution.Simple.Hpc ( Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o ) [56 of 67] Compiling Distribution.Simple.Test ( Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o ) [57 of 67] Compiling Distribution.Simple.PreProcess ( Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o ) [58 of 67] Compiling Distribution.Simple.UserHooks ( Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o ) [59 of 67] Compiling Distribution.Simple.Bench ( Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o ) [60 of 67] Compiling Distribution.Simple.SrcDist ( Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o ) [61 of 67] Compiling Distribution.Simple.Hugs ( Distribution/Simple/Hugs.hs, dist/build/Distribution/Simple/Hugs.o ) [62 of 67] Compiling Distribution.Simple.Register ( Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o ) [63 of 67] Compiling Distribution.Simple.Configure ( Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o ) [64 of 67] Compiling Distribution.Simple.Install ( Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o ) [65 of 67] Compiling Distribution.Simple.Build ( Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o ) [66 of 67] Compiling Distribution.Simple.Haddock ( Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o ) [67 of 67] Compiling Distribution.Simple ( Distribution/Simple.hs, dist/build/Distribution/Simple.o ) [ 1 of 67] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o ) [ 2 of 67] Compiling Distribution.TestSuite ( Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o ) [ 3 of 67] Compiling Distribution.Simple.PreProcess.Unlit ( Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o ) [ 4 of 67] Compiling Distribution.GetOpt ( Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o ) [ 5 of 67] Compiling Distribution.Compat.Exception ( Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.p_o ) [ 6 of 67] Compiling Distribution.Compat.TempFile ( Distribution/Compat/TempFile.hs, dist/build/Distribution/Compat/TempFile.p_o ) [ 7 of 67] Compiling Distribution.Compat.CopyFile ( Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o ) [ 8 of 67] Compiling Distribution.Compat.ReadP ( Distribution/Compat/ReadP.hs, dist/build/Distribution/Compat/ReadP.p_o ) [ 9 of 67] Compiling Distribution.ReadE ( Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o ) [10 of 67] Compiling Distribution.Verbosity ( Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o ) [11 of 67] Compiling Distribution.Text ( Distribution/Text.hs, dist/build/Distribution/Text.p_o ) [12 of 67] Compiling Distribution.ModuleName ( Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.p_o ) [13 of 67] Compiling Distribution.System ( Distribution/System.hs, dist/build/Distribution/System.p_o ) [14 of 67] Compiling Language.Haskell.Extension ( Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.p_o ) [15 of 67] Compiling Distribution.Version ( Distribution/Version.hs, dist/build/Distribution/Version.p_o ) [16 of 67] Compiling Distribution.License ( Distribution/License.hs, dist/build/Distribution/License.p_o ) [17 of 67] Compiling Distribution.Package ( Distribution/Package.hs, dist/build/Distribution/Package.p_o ) [18 of 67] Compiling Distribution.Simple.Utils ( Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o ) [19 of 67] Compiling Distribution.Simple.Program.Types ( Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o ) [20 of 67] Compiling Distribution.Simple.Program.Run ( Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o ) [21 of 67] Compiling Distribution.Simple.Program.Ar ( Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o ) [22 of 67] Compiling Distribution.Simple.Program.Ld ( Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o ) [23 of 67] Compiling Distribution.Simple.Program.Hpc ( Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o ) [24 of 67] Compiling Distribution.Simple.Program.Script ( Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o ) [25 of 67] Compiling Distribution.Simple.Program.Builtin ( Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o ) [26 of 67] Compiling Distribution.Simple.Program.Db ( Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o ) [27 of 67] Compiling Distribution.Simple.Program ( Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o ) [28 of 67] Compiling Distribution.Compiler ( Distribution/Compiler.hs, dist/build/Distribution/Compiler.p_o ) [29 of 67] Compiling Distribution.ParseUtils ( Distribution/ParseUtils.hs, dist/build/Distribution/ParseUtils.p_o ) [30 of 67] Compiling Distribution.InstalledPackageInfo ( Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.p_o ) [31 of 67] Compiling Distribution.Simple.PackageIndex ( Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o ) [32 of 67] Compiling Distribution.Simple.GHC.IPI642 ( Distribution/Simple/GHC/IPI642.hs, dist/build/Distribution/Simple/GHC/IPI642.p_o ) [33 of 67] Compiling Distribution.Simple.GHC.IPI641 ( Distribution/Simple/GHC/IPI641.hs, dist/build/Distribution/Simple/GHC/IPI641.p_o ) [34 of 67] Compiling Distribution.Simple.Command ( Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o ) [35 of 67] Compiling Distribution.PackageDescription ( Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.p_o ) [36 of 67] Compiling Distribution.PackageDescription.Configuration ( Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.p_o ) [37 of 67] Compiling Distribution.PackageDescription.Parse ( Distribution/PackageDescription/Parse.hs, dist/build/Distribution/PackageDescription/Parse.p_o ) [38 of 67] Compiling Distribution.PackageDescription.PrettyPrint ( Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.p_o ) [39 of 67] Compiling Distribution.PackageDescription.Check ( Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o ) [40 of 67] Compiling Distribution.Simple.Compiler ( Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o ) [41 of 67] Compiling Distribution.Simple.Program.HcPkg ( Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o ) [42 of 67] Compiling Distribution.Simple.InstallDirs ( Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o ) [43 of 67] Compiling Distribution.Simple.Setup ( Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o ) [44 of 67] Compiling Distribution.Make ( Distribution/Make.hs, dist/build/Distribution/Make.p_o ) [45 of 67] Compiling Distribution.Simple.Program.GHC ( Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o ) [46 of 67] Compiling Distribution.Simple.LocalBuildInfo ( Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o ) [47 of 67] Compiling Distribution.Simple.BuildPaths ( Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o ) [48 of 67] Compiling Distribution.Simple.JHC ( Distribution/Simple/JHC.hs, dist/build/Distribution/Simple/JHC.p_o ) [49 of 67] Compiling Distribution.Simple.NHC ( Distribution/Simple/NHC.hs, dist/build/Distribution/Simple/NHC.p_o ) [50 of 67] Compiling Distribution.Simple.UHC ( Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o ) [51 of 67] Compiling Distribution.Simple.Build.Macros ( Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o ) [52 of 67] Compiling Distribution.Simple.Build.PathsModule ( Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o ) Distribution/Simple/Build/PathsModule.hs:210:19: Warning: Pattern match(es) are non-exhaustive In a case alternative: Patterns not matched: PPC PPC64 Sparc Arm ... [53 of 67] Compiling Distribution.Simple.GHC ( Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o ) [54 of 67] Compiling Distribution.Simple.LHC ( Distribution/Simple/LHC.hs, dist/build/Distribution/Simple/LHC.p_o ) [55 of 67] Compiling Distribution.Simple.Hpc ( Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o ) [56 of 67] Compiling Distribution.Simple.Test ( Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o ) [57 of 67] Compiling Distribution.Simple.PreProcess ( Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o ) [58 of 67] Compiling Distribution.Simple.UserHooks ( Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o ) [59 of 67] Compiling Distribution.Simple.Bench ( Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o ) [60 of 67] Compiling Distribution.Simple.SrcDist ( Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o ) [61 of 67] Compiling Distribution.Simple.Hugs ( Distribution/Simple/Hugs.hs, dist/build/Distribution/Simple/Hugs.p_o ) [62 of 67] Compiling Distribution.Simple.Register ( Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o ) [63 of 67] Compiling Distribution.Simple.Configure ( Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o ) [64 of 67] Compiling Distribution.Simple.Install ( Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o ) [65 of 67] Compiling Distribution.Simple.Build ( Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o ) [66 of 67] Compiling Distribution.Simple.Haddock ( Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o ) [67 of 67] Compiling Distribution.Simple ( Distribution/Simple.hs, dist/build/Distribution/Simple.p_o ) In-place registering Cabal-1.16.0.1... Running Haddock for Cabal-1.16.0.1... Preprocessing library Cabal-1.16.0.1... Warning: The documentation for the following packages are not installed. No links will be generated to these packages: rts-1.0 Haddock coverage: 0% ( 0 / 4) in 'Paths_Cabal' 22% ( 2 / 9) in 'Distribution.TestSuite' 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit' 100% ( 10 / 10) in 'Distribution.GetOpt' 14% ( 1 / 7) in 'Distribution.Compat.Exception' 40% ( 2 / 5) in 'Distribution.Compat.TempFile' 0% ( 0 / 4) in 'Distribution.Compat.CopyFile' 98% ( 40 / 41) in 'Distribution.Compat.ReadP' 44% ( 4 / 9) in 'Distribution.ReadE' 17% ( 2 / 12) in 'Distribution.Verbosity' 25% ( 1 / 4) in 'Distribution.Text' 86% ( 6 / 7) in 'Distribution.ModuleName' 40% ( 4 / 10) in 'Distribution.System' 57% ( 4 / 7) in 'Language.Haskell.Extension' 83% ( 35 / 42) in 'Distribution.Version' 67% ( 2 / 3) in 'Distribution.License' 71% ( 12 / 17) in 'Distribution.Package' 69% ( 53 / 77) in 'Distribution.Simple.Utils' 90% ( 9 / 10) in 'Distribution.Simple.Program.Types' 33% ( 3 / 9) in 'Distribution.Simple.Program.Run' 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar' 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld' 33% ( 1 / 3) in 'Distribution.Simple.Program.Hpc' 100% ( 4 / 4) in 'Distribution.Simple.Program.Script' 13% ( 4 / 31) in 'Distribution.Simple.Program.Builtin' 76% ( 19 / 25) in 'Distribution.Simple.Program.Db' 43% ( 34 / 79) in 'Distribution.Simple.Program' 62% ( 5 / 8) in 'Distribution.Compiler' 12% ( 7 / 58) in 'Distribution.ParseUtils' 9% ( 1 / 11) in 'Distribution.InstalledPackageInfo' 89% ( 31 / 35) in 'Distribution.Simple.PackageIndex' 25% ( 2 / 8) in 'Distribution.Simple.GHC.IPI642' 67% ( 2 / 3) in 'Distribution.Simple.GHC.IPI641' 64% ( 27 / 42) in 'Distribution.Simple.Command' 70% ( 47 / 67) in 'Distribution.PackageDescription' 44% ( 4 / 9) in 'Distribution.PackageDescription.Configuration' 32% ( 7 / 22) in 'Distribution.PackageDescription.Parse' 100% ( 3 / 3) in 'Distribution.PackageDescription.PrettyPrint' 90% ( 9 / 10) in 'Distribution.PackageDescription.Check' 60% ( 12 / 20) in 'Distribution.Simple.Compiler' 62% ( 8 / 13) in 'Distribution.Simple.Program.HcPkg' 55% ( 11 / 20) in 'Distribution.Simple.InstallDirs' 14% ( 10 / 69) in 'Distribution.Simple.Setup' 57% ( 4 / 7) in 'Distribution.Make' 14% ( 1 / 7) in 'Distribution.Simple.Program.GHC' 65% ( 13 / 20) in 'Distribution.Simple.LocalBuildInfo' 40% ( 6 / 15) in 'Distribution.Simple.BuildPaths' 43% ( 3 / 7) in 'Distribution.Simple.JHC' 71% ( 5 / 7) in 'Distribution.Simple.NHC' 14% ( 1 / 7) in 'Distribution.Simple.UHC' 50% ( 1 / 2) in 'Distribution.Simple.Build.Macros' 67% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule' 50% ( 7 / 14) in 'Distribution.Simple.GHC' 50% ( 5 / 10) in 'Distribution.Simple.LHC' 71% ( 5 / 7) in 'Distribution.Simple.Hpc' 92% ( 11 / 12) in 'Distribution.Simple.Test' 38% ( 6 / 16) in 'Distribution.Simple.PreProcess' 75% ( 3 / 4) in 'Distribution.Simple.UserHooks' 100% ( 2 / 2) in 'Distribution.Simple.Bench' 92% ( 11 / 12) in 'Distribution.Simple.SrcDist' 57% ( 4 / 7) in 'Distribution.Simple.Hugs' 50% ( 4 / 8) in 'Distribution.Simple.Register' 64% ( 9 / 14) in 'Distribution.Simple.Configure' 100% ( 2 / 2) in 'Distribution.Simple.Install' 75% ( 3 / 4) in 'Distribution.Simple.Build' 33% ( 1 / 3) in 'Distribution.Simple.Haddock' 91% ( 20 / 22) in 'Distribution.Simple' Warning: Distribution.Compat.ReadP: could not find link destinations for: Distribution.Compat.ReadP.Parser Distribution.Compat.ReadP.P Warning: Distribution.ReadE: could not find link destinations for: Distribution.ReadE.ErrorMsg Warning: Distribution.Compiler: could not find link destinations for: Distribution.Compiler.classifyCompilerFlavor Warning: Distribution.PackageDescription.Parse: could not find link destinations for: Distribution.PackageDescription.Parse.TestSuiteStanza Documentation created: dist/doc/html/Cabal/index.html Installing library in /Users/ddp/Library/Haskell/ghc-7.4.1/lib/Cabal-1.16.0.1/lib Registering Cabal-1.16.0.1... Configuring cabal-install-1.16.0... Building cabal-install-1.16.0... Preprocessing executable 'cabal' for cabal-install-1.16.0... [ 1 of 65] Compiling Distribution.Client.Haddock ( Distribution/Client/Haddock.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Haddock.o ) [ 2 of 65] Compiling Distribution.Client.JobControl ( Distribution/Client/JobControl.hs, dist/build/cabal/cabal-tmp/Distribution/Client/JobControl.o ) [ 3 of 65] Compiling Distribution.Client.BuildReports.Types ( Distribution/Client/BuildReports/Types.hs, dist/build/cabal/cabal-tmp/Distribution/Client/BuildReports/Types.o ) [ 4 of 65] Compiling Distribution.Client.Dependency.Modular.Version ( Distribution/Client/Dependency/Modular/Version.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Version.o ) [ 5 of 65] Compiling Distribution.Client.Dependency.Modular.PSQ ( Distribution/Client/Dependency/Modular/PSQ.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/PSQ.o ) [ 6 of 65] Compiling Distribution.Client.Dependency.Modular.Package ( Distribution/Client/Dependency/Modular/Package.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Package.o ) [ 7 of 65] Compiling Distribution.Client.Utils ( Distribution/Client/Utils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Utils.o ) [ 8 of 65] Compiling Distribution.Client.PackageUtils ( Distribution/Client/PackageUtils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/PackageUtils.o ) [ 9 of 65] Compiling Distribution.Compat.FilePerms ( Distribution/Compat/FilePerms.hs, dist/build/cabal/cabal-tmp/Distribution/Compat/FilePerms.o ) [10 of 65] Compiling Distribution.Compat.Time ( Distribution/Compat/Time.hs, dist/build/cabal/cabal-tmp/Distribution/Compat/Time.o ) [11 of 65] Compiling Distribution.Client.GZipUtils ( Distribution/Client/GZipUtils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/GZipUtils.o ) [12 of 65] Compiling Distribution.Client.Tar ( Distribution/Client/Tar.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Tar.o ) [13 of 65] Compiling Distribution.Client.PackageIndex ( Distribution/Client/PackageIndex.hs, dist/build/cabal/cabal-tmp/Distribution/Client/PackageIndex.o ) [14 of 65] Compiling Distribution.Client.Init.Licenses ( Distribution/Client/Init/Licenses.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Init/Licenses.o ) [15 of 65] Compiling Distribution.Client.Init.Types ( Distribution/Client/Init/Types.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Init/Types.o ) [16 of 65] Compiling Distribution.Compat.Exception ( Distribution/Compat/Exception.hs, dist/build/cabal/cabal-tmp/Distribution/Compat/Exception.o ) [17 of 65] Compiling Distribution.Client.Types ( Distribution/Client/Types.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Types.o ) [18 of 65] Compiling Distribution.Client.Init.Heuristics ( Distribution/Client/Init/Heuristics.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Init/Heuristics.o ) [19 of 65] Compiling Distribution.Client.InstallPlan ( Distribution/Client/InstallPlan.hs, dist/build/cabal/cabal-tmp/Distribution/Client/InstallPlan.o ) [20 of 65] Compiling Distribution.Client.Dependency.Types ( Distribution/Client/Dependency/Types.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Types.o ) [21 of 65] Compiling Distribution.Client.Dependency.Modular.Flag ( Distribution/Client/Dependency/Modular/Flag.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Flag.o ) [22 of 65] Compiling Distribution.Client.Dependency.Modular.Dependency ( Distribution/Client/Dependency/Modular/Dependency.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Dependency.o ) [23 of 65] Compiling Distribution.Client.Dependency.Modular.Tree ( Distribution/Client/Dependency/Modular/Tree.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Tree.o ) [24 of 65] Compiling Distribution.Client.Dependency.Modular.Index ( Distribution/Client/Dependency/Modular/Index.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Index.o ) [25 of 65] Compiling Distribution.Client.Dependency.Modular.IndexConversion ( Distribution/Client/Dependency/Modular/IndexConversion.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/IndexConversion.o ) [26 of 65] Compiling Distribution.Client.Dependency.Modular.Builder ( Distribution/Client/Dependency/Modular/Builder.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Builder.o ) [27 of 65] Compiling Distribution.Client.Dependency.Modular.Message ( Distribution/Client/Dependency/Modular/Message.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Message.o ) [28 of 65] Compiling Distribution.Client.Dependency.Modular.Log ( Distribution/Client/Dependency/Modular/Log.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Log.o ) [29 of 65] Compiling Distribution.Client.Dependency.Modular.Preference ( Distribution/Client/Dependency/Modular/Preference.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Preference.o ) [30 of 65] Compiling Distribution.Client.Dependency.Modular.Configured ( Distribution/Client/Dependency/Modular/Configured.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Configured.o ) [31 of 65] Compiling Distribution.Client.Dependency.Modular.Assignment ( Distribution/Client/Dependency/Modular/Assignment.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Assignment.o ) [32 of 65] Compiling Distribution.Client.Dependency.Modular.Explore ( Distribution/Client/Dependency/Modular/Explore.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Explore.o ) [33 of 65] Compiling Distribution.Client.Dependency.Modular.Validate ( Distribution/Client/Dependency/Modular/Validate.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Validate.o ) [34 of 65] Compiling Distribution.Client.Dependency.Modular.Solver ( Distribution/Client/Dependency/Modular/Solver.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/Solver.o ) [35 of 65] Compiling Distribution.Client.Dependency.Modular.ConfiguredConversion ( Distribution/Client/Dependency/Modular/ConfiguredConversion.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular/ConfiguredConversion.o ) [36 of 65] Compiling Distribution.Client.Dependency.Modular ( Distribution/Client/Dependency/Modular.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/Modular.o ) [37 of 65] Compiling Distribution.Client.Dependency.TopDown.Types ( Distribution/Client/Dependency/TopDown/Types.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/TopDown/Types.o ) [38 of 65] Compiling Distribution.Client.Dependency.TopDown.Constraints ( Distribution/Client/Dependency/TopDown/Constraints.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/TopDown/Constraints.o ) [39 of 65] Compiling Distribution.Client.IndexUtils ( Distribution/Client/IndexUtils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/IndexUtils.o ) [40 of 65] Compiling Distribution.Client.Dependency.TopDown ( Distribution/Client/Dependency/TopDown.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency/TopDown.o ) [41 of 65] Compiling Distribution.Client.World ( Distribution/Client/World.hs, dist/build/cabal/cabal-tmp/Distribution/Client/World.o ) [42 of 65] Compiling Paths_cabal_install ( dist/build/autogen/Paths_cabal_install.hs, dist/build/cabal/cabal-tmp/Paths_cabal_install.o ) [43 of 65] Compiling Distribution.Client.HttpUtils ( Distribution/Client/HttpUtils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/HttpUtils.o ) [44 of 65] Compiling Distribution.Client.FetchUtils ( Distribution/Client/FetchUtils.hs, dist/build/cabal/cabal-tmp/Distribution/Client/FetchUtils.o ) [45 of 65] Compiling Distribution.Client.BuildReports.Anonymous ( Distribution/Client/BuildReports/Anonymous.hs, dist/build/cabal/cabal-tmp/Distribution/Client/BuildReports/Anonymous.o ) [46 of 65] Compiling Distribution.Client.BuildReports.Upload ( Distribution/Client/BuildReports/Upload.hs, dist/build/cabal/cabal-tmp/Distribution/Client/BuildReports/Upload.o ) [47 of 65] Compiling Distribution.Client.BuildReports.Storage ( Distribution/Client/BuildReports/Storage.hs, dist/build/cabal/cabal-tmp/Distribution/Client/BuildReports/Storage.o ) [48 of 65] Compiling Distribution.Client.Win32SelfUpgrade ( Distribution/Client/Win32SelfUpgrade.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Win32SelfUpgrade.o ) [49 of 65] Compiling Distribution.Client.Init ( Distribution/Client/Init.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Init.o ) [50 of 65] Compiling Distribution.Client.Check ( Distribution/Client/Check.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Check.o ) [51 of 65] Compiling Distribution.Client.Update ( Distribution/Client/Update.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Update.o ) [52 of 65] Compiling Distribution.Client.Targets ( Distribution/Client/Targets.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Targets.o ) [53 of 65] Compiling Distribution.Client.Dependency ( Distribution/Client/Dependency.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Dependency.o ) [54 of 65] Compiling Distribution.Client.Setup ( Distribution/Client/Setup.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Setup.o ) [55 of 65] Compiling Distribution.Client.Config ( Distribution/Client/Config.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Config.o ) [56 of 65] Compiling Distribution.Client.SetupWrapper ( Distribution/Client/SetupWrapper.hs, dist/build/cabal/cabal-tmp/Distribution/Client/SetupWrapper.o ) Distribution/Client/SetupWrapper.hs:51:12: Warning: In the use of `ghcVerbosityOptions' (imported from Distribution.Simple.GHC): Deprecated: "Use the GhcOptions record instead" [57 of 65] Compiling Distribution.Client.Upload ( Distribution/Client/Upload.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Upload.o ) [58 of 65] Compiling Distribution.Client.List ( Distribution/Client/List.hs, dist/build/cabal/cabal-tmp/Distribution/Client/List.o ) [59 of 65] Compiling Distribution.Client.Configure ( Distribution/Client/Configure.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Configure.o ) [60 of 65] Compiling Distribution.Client.Fetch ( Distribution/Client/Fetch.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Fetch.o ) [61 of 65] Compiling Distribution.Client.SrcDist ( Distribution/Client/SrcDist.hs, dist/build/cabal/cabal-tmp/Distribution/Client/SrcDist.o ) [62 of 65] Compiling Distribution.Client.Unpack ( Distribution/Client/Unpack.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Unpack.o ) [63 of 65] Compiling Distribution.Client.InstallSymlink ( Distribution/Client/InstallSymlink.hs, dist/build/cabal/cabal-tmp/Distribution/Client/InstallSymlink.o ) [64 of 65] Compiling Distribution.Client.Install ( Distribution/Client/Install.hs, dist/build/cabal/cabal-tmp/Distribution/Client/Install.o ) [65 of 65] Compiling Main ( Main.hs, dist/build/cabal/cabal-tmp/Main.o ) Linking dist/build/cabal/cabal ... Warning: No documentation was generated as this package does not contain a library. Perhaps you want to use the --executables flag. Installing executable(s) in /Users/ddp/Library/Haskell/ghc-7.4.1/lib/cabal-install-1.16.0/bin Updating documentation index /Users/ddp/Library/Haskell/doc/index.html

2 1

ANN: cabal-install-1.16.0 (and Cabal-1.16.0.1)
by Johan Tibell 09 Oct '12

09 Oct '12

On the behalf of the many contributors to cabal, I'm proud to present cabal-install-1.16.0. This release contains almost a year worth of patches. Highlights include: * Parallel installs (cabal install -j) * Several improvements to the dependency solver. * Lots of bugfixes We're also simultaneously releasing Cabal-1.16.0.1, which address a few bugs. To install: cabal update cabal install cabal-install-1.16.0 Cabal-1.16.0.1 Complete list of changes in cabal-install-1.16.0: * Bump cabal-install version number to 1.16.0 * Extend the unpack command for the .cabal file updating * On install, update the .cabal file with the one from the index * Make compatible with `network-2.4` API * Update ZLIB_VER in bootstrap.sh for ghc-7.6 compatibility * cabal-install.cabal: add Distribution.Client.JobControl and Distribution.Compat.Time * Adapt bootstrap.sh to ghc-7.6 changes * Move comment that was missed in a refactoring * cabal-install: Adapt for GHC 7.6 * Ensure that the cabal-install logfile gets closed * Make cabal-install build with Cabal-1.16. * Initialise the 'jobs' config file setting with the current number of CPU cores. * Update version bounds for directory. * Update bootstrap.sh to match platform 2012.2.0.0 * Relax dependency on containers. * Bump versions. * Better output for parallel install. * Fix warnings. * Remove 'tryCachedSetupExecutable'. * Redundant import. * Use a lock instead of 'JobControl 1'. * Comments, cosmetic changes. * Implement the setup executable cache. * Add the missing JobControl module * Fix missing import after merge of par build patches * Fix impl of PackageIndex.allPackagesByName * Drop the "ghc-options: -rtsopts" on cabal-install. We do not need it. * Parallelise the install command This is based on Mikhail Glushenkov's patches. * InstallPlan: Add a Processing package state. * Add a '-j' flag for the 'install' command. * Add -threaded and -rtsopts to cabal-install's ghc-options. * Fix typos. * Fix warnings. * 80-col violation. * Spelling. * Fix warnings. * Extended a comment. * Force the log for the error to be printed in parallel with the complete trace. * Remove goal choice nodes after reordering is completed. * Make modular solver handle manual flags properly. * Store manual flag info in search tree. * Maintain info about manual flags in modular solver. * Fix cabal-install build. * Merge pull request #6 from pcapriotti/master * Adapt to change in GHC package db flags. * Merge pull request #1 from iustin/master * Add support for Apache 2.0 license to cabal-install * Handle test and bench stanzas without dependencies properly in modular solver. * Updated repo location in cabal files. * last-minute README changes * updated copyright year for Duncan * updated changelog * added deepseq to bootstrap.sh * handling the solver options properly in config file * handling the "optimization" option properly in config file * Update cabal-install bootstrap.sh * treat packages that are unknown no longer as an "internal error" in modular solver * minor wording change when printing install plans * no longer pre-filter broken packages for modular solver * for empty install plans, print the packages that are installed * make the reinstall check less noisy * disable line-wrapping for solver debug output * adding a solver flag for shadowing of installed packages * adding the possibility for index-disabled packages * choose default solver based on compiler version * Added a comment * Use the new --package-db flag stuff in cabal-install * head cabal-install requires head Cabal * Fix ticket #731 * Add brief description of PVP to cabal init generated .cabal files * Bump versions to 1.15 and 0.15 This is the head branch, the 1.14.x and 0.14.x are in the 1.14 branch. * init: guess at filling in deps in the build-depends: field * init: see whether source directory 'src' exists. * init: improve prompt: enclose y/n in parens * init: improve prompt: 'homepage' field is not for repos. * bootstrap with --global should still respect $PREFIX * Update cabal-install boostrap.sh package versions * Fix 'cabal configure --enable-{tests,benchmarks}'. 'cabal configure' was not adding optional stanza constraints when checking dependencies, causing '--enable-{tests,benchmarks}' to be silently ignored. * added missing error message * Don't try to run test suites where none exist. * Fixed non-exhaustive pattern matches with new InstallOutcome. * Automatically run test suites when invoked with 'cabal install --enable-tests'. Do not install if tests fail. * make test and bench available as user constraints * let --reinstall imply --force-reinstalls for targets * stanza support in modular solver * show optional stanzas when printing install plans * Added a missing case. * Enable tests and benchmarks in cabal-install without modifications to the Cabal library. * Don't build benchmarks, even if installing benchmark dependencies. * Update types in modular dependency solver to compile with new test/benchmark dependency constraints. * Handle test and benchmark dependencies through the resolver properly. * updating dependencies in bootstrap.sh * fix compilation with ghc-7.4 * Added a comment. * removing trailing whitespace * removing datatype contexts * Now require mtl-2 Complete list of changes in Cabal-1.16.0.1: * Bump Cabal version number to 1.16.0.1 * Fix failing test * Do not pass -XHaskell98 to older compilers (fixes #1016) * don't test --disable-library-vanilla for now * Fix logic for building dynamic executables with TemplateHaskell * Fix the logic for building profiled executables with TemplateHaskell. * add test for non-vanilla profiling and dynamic builds with Template Haskell * Build Setup executables without HPC. Fixes #1012. * Make 'viewAsFieldDescr' a total function. Cheers, Johan & Bryan

12 17

Re: [Haskell-cafe] Long pauses / idle time in a Haskell TCP server
by Jamie Turner 09 Oct '12

09 Oct '12

> I'm seeing long pauses in a server based on the 'scalable-server' > package from Hackage, version 0.2.2 [1]. It normally performs very > well, about 100-150 micro-secs client latency over the loopback > interface, but a fair number of requests are much slower, 38-40 > milli-secs, making the mean latency and throughput quite bad. Hi Alex--author of scalable-server here. 38ms sounds like Nagle's algorithm. (http://en.wikipedia.org/wiki/Nagle's_algorithm) In short, the socket is waiting on sending a small amount of data to see if the application wants to send more data. If so, the kernel can repack the data together so that it all can be switched in one TCP packet. You need to set NoDelay (TCP_NODELAY) if you want to disable this behavior; scalable-server doesn't currently have a flag to configure this, but I'm open to pull requests! (Also, are you using hackage scalable-server, or the "new" scalable server based on conduit on github? I'd recommend switching to the github version if not. A few key bugs exist in the older implementation.) - Jamie

2 1

ghc-mtl, hint, mueval for ghc-7.6 ?
by Johannes Waldmann 08 Oct '12

08 Oct '12

While porting some code to 7.6, I'm stuck here: Preprocessing library ghc-mtl-1.0.1.1... [1 of 1] Compiling Control.Monad.Ghc ( Control/Monad/Ghc.hs, dist/build/Control/Monad/Ghc.o ) Control/Monad/Ghc.hs:29:48: No instance for (DynFlags.HasDynFlags Ghc) this seems to block hint and mueval. Is there a known workaround for this problem, or a sugggested replacement package? Thanks - J.W.

2 1

Panic loading network on windows (GHC 7.6.1)
by JP Moresmau 08 Oct '12

08 Oct '12

Hello, I've installed Cabal and cabal-install 1.16 (which required network) on a new GHC 7.6.1 install and everything went well, except now when building a package requiring network I get: Loading package network-2.4.0.1 ... ghc.exe: Unknown PEi386 section name `.idata $4' (while processing: c:/ghc/ghc-7.6.1/mingw/lib\libws2_32.a) ghc.exe: panic! (the 'impossible' happened) (GHC version 7.6.1 for i386-unknown-mingw32): loadArchive "c:/ghc/ghc-7.6.1/mingw/lib\\libws2_32.a": failed I have done something wrong while building network on my Windows XP machine? What can I check? Thanks! -- JP Moresmau http://jpmoresmau.blogspot.com/

4 5

Long pauses / idle time in a Haskell TCP server
by Alex Iliev 08 Oct '12

08 Oct '12

Hello, I'm seeing long pauses in a server based on the 'scalable-server' package from Hackage, version 0.2.2 [1]. It normally performs very well, about 100-150 micro-secs client latency over the loopback interface, but a fair number of requests are much slower, 38-40 milli-secs, making the mean latency and throughput quite bad. The server is a simple version of a memory cache, with operations to "put" a key-value mapping, and to "get" the value for a key, using a data map. I've tried with the strict versions of 'unordered-containers' and the 'containers' package for the data map implementation, with similar results. I've tried it with ghc 7.4.1 and with 7.6.1 with similar results. Runtime info I got shows: - GC report: GC time is much less than the total time of the slow responses, so does not explain them. - CPU profile: Idle time is very high, and would explain the slow responses. By idle time I mean the part of wall time which is not included in the profile report's "total time". For example, when running a test for 5 minutes, the profile report has total time = 0.05 secs. 'top' output is consistent - quite low CPU usage during such a test. Apart from this there is nothing notable in the profile, most time is spent in the network input and output processing (network-enumerator etc.). One observation is that the pauses seem correlated with overwriting entries in the data map. If I'm mostly adding new keys (as well as reading), the throughput is much better, and the idle time in the CPU profile is lower (though the time spent in GC increases a lot). I've removed all concurrency from the program (including my version of scalable-server) to eliminate that factor, but the problem persists. I tried it on two fairly different Linux machines, with similar results. The client I use to benchmark is a simple C program, so I don't suspect it of causing the pauses. Looking at the timestamps on the network traffic confirms that the pauses are at the server. Any idea what might be causing the idle time? The long pauses are consistently 38-40ms, maybe that points to some aspect of CPU scheduling, leaving the program idle for some time? I can put the code on github if it would help. Many thanks! Alex [1] http://hackage.haskell.org/package/scalable-server-0.2.2

2 1

ANNOUNCE: test-framework-golden-1.1
by Roman Cheplyaka 08 Oct '12

08 Oct '12

I am glad to announce the first public release of test-framework-golden — a golden testing library. Hackage: http://hackage.haskell.org/package/test-framework-golden GitHub: https://github.com/feuerbach/test-framework-golden Golden tests are similar to unit tests (as implemented in HUnit), but the idea is to store the expected result in files (called «golden» files). I was introduced to the idea of golden testing by Bohdan Vlasyuk at ZuriHac in 2010. Since then I've discovered that this is a nice approach and it is already used in variety of projects (e.g. ghc, haddock). Surprisingly, not much is written about golden testing, and I've been unable to find any golden testing libraries for Haskell or any other programming language. Every project has its own ad-hoc implementation in Haskell/Python/Shell/etc. The closest match on the market is Simon Michael's shelltestrunner. But to use it you have to expose the tested functionality via command line, which may be inconvenient. So this is my attempt at a general golden testing library. It consists of two modules. Test.Golden has a simple interface that helps you get started very quickly. Test.Golden.Advanced provides a very generic testing function that you can use to implement the testing system you dream about. The library is integrated with test-framework, so you can use golden tests in addition to SmallCheck/QuickCheck/HUnit tests. In future there's a plan to support some golden test management capabilities. Roman

5 14

a parallel mapM?
by Greg Fitzgerald 07 Oct '12

07 Oct '12

I'm new to concurrent programming in Haskell. I'm looking for a drop-in replacement for 'mapM' to parallelize a set of independent IO operations. I hoped 'mapConcurrently' might be it, but I need something that will only spawn as many threads as I have CPUs available [1]. I also tried Control.Parallel.Strategies [2]. While that route works, I had to use unsafePerformIO. Considering that IO is for sequencing effects and my IO operation doesn't cause any side-effects (besides hogging a file handle), is this a proper use of unsafePerformIO? Attempt 1 -------------- import System.Process(readProcess) import Control.Concurrent.Async(mapConcurrently) main :: IO [String] main = mapConcurrently (\n -> readProcess "echo" ["test: " ++ show n] "") [0..1000] $ ghc --version The Glorious Glasgow Haskell Compilation System, version 7.6.1 $ runghc test.hs test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: runInteractiveProcess: pipe: Too many open files test.hs: echo: createProcess: resource exhausted (Too many open files) Attempt 2 -------------- import System.Process(readProcess) import Control.Parallel.Strategies(parMap, rpar) import System.IO.Unsafe(unsafePerformIO) main :: IO [String] main = myMapConcurrently (\n -> readProcess "echo" ["test: " ++ show n] "") [0..1000] where myMapConcurrently f = return . parMap rpar (unsafePerformIO . f) $ runghc test.hs > /dev/null && echo Success Success Thanks, Greg

7 8

Cabal dependencies
by José Lopes 06 Oct '12

06 Oct '12

Hello, I'm trying to understand Cabal dependencies. Why does the following situation happen? # cabal install xmobar --dry-run Resolving dependencies... In order, the following would be installed: parsec-3.1.3 (reinstall) changes: mtl-2.1.1 -> 2.0.1.0 xmobar-0.15 (new package) Warning: The following packages are likely to be broken by the reinstalls: texmath-0.6.1.1 regex-tdfa-1.1.8 Unixutils-1.50 network-2.4.0.1 HTTP-4000.2.5 network-2.3.0.14 sendfile-0.7.6 happstack-server-7.0.7 happstack-hsp-7.1.0 happstack-7.0.0 hslogger-1.1.5 citeproc-hs-0.3.4 acid-state-0.6.4 HTTP-4000.2.3 ltk-0.12.1.0 json-0.5 highlighting-kate-0.5.1 Use --force-reinstalls if you want to install anyway. Best regards, José -- José António Branquinho de Oliveira Lopes Instituto Superior Técnico Technical University of Lisbon

4 8

Am I the only one having problems with RWH?
by Janek S. 06 Oct '12

06 Oct '12

I began learning Haskell 9 months ago. I still consider myself a beginner, but I'm progressing towards more advanced concepts. I read scientific papers (simpler ones) and books about Haskell and functional programming. Right now I'm reading Pearls of Functional Algorithm Design, Introduction to Functional Programming, Implementation of Functional Programming Languages and Real World Haskell. RWH is causing me a lot of trouble though. This leads me to frustration because book covers rather basic material. I just spent another 1,5 hour reading chapter 10 again and trying to understand how presented parsing functions work. Even if I am barely able to grasp what is going on I feel that I wouldn't know how to write such code by myself. Am I the only one having such problems with RWH? Jan

4 4

Benchmarks for graph algorithms
by damodar kulkarni 06 Oct '12

06 Oct '12

Hi cafe, Where do Haskell and DPH stand in comparison to C/OpenMP w.r.t. graph algorithms? Are benchmarks for graph algorithms available for Haskell like the ones we find at http://www.graphanalysis.org/benchmark/? - Damodar

1 0

referential transparency? (for fixity of local operators)
by Johannes Waldmann 06 Oct '12

06 Oct '12

I was really surprised at the following: *Main> 1 + 2 * 3 7 *Main> ( \ (+) (*) -> 1 + 2 * 3 ) (+) (*) 9 because I was somehow assuming that either a) the Prelude fixities of the operators are kept b) or they are undefined, so the parser rejects. but the Haskell standard says "Any operator lacking a fixity declaration is assumed to be infixl 9". This really should be "infix 9"?

5 5

does try force evaluation of IO value
by s9gf4ult＠gmail.com 06 Oct '12

06 Oct '12

if i have some lazy io action, assuming (maction :: IO a) which may raise exceptions while running, will "try" force evaluation of "a" to determine is exception raised or not ? Sorry for my broken english.

2 5

Windows - Creating FreeGLUT DLL
by Thiago Negri 05 Oct '12

05 Oct '12

I'm trying OpenGL on Haskell and couldn't create the FreeGLUT DLL myself. I did follow this tutorial: http://netsuperbrain.com/blog/posts/freeglut-windows-hopengl-hglut/ But when I put my DLL on the folder of the binary, it complains about "initGlut". Using the DLL pointed by FreeGLUT official site, created by other person, works fine. I don't know what I did wrong. Anyone had this problem? Thanks.

1 0

Re: [Haskell-cafe] ANNOUNCE: test-framework-golden-1.1
by Roman Cheplyaka 05 Oct '12

05 Oct '12

* Janek S. <fremenzone(a)poczta.onet.pl> [2012-10-05 11:50:53+0200] > > Cool, looking forward to reading it! > Well, the post is already finished: > http://ics.p.lodz.pl/~stolarek/blog/2012/10/code-testing-in-haskell/ > I was just going to publish it and then your email came up on the list. > > > I hope you won't forget to cover SmallCheck in your article as well. > > Being also the maintainer of SmallCheck, I want it to steal some fame > > from QuickCheck :) > Sorry to disappoint you, but I did not mention SmallCheck. So far I'm relying on QuickCheck and > didn't feel like I need to look for other testing library. I might be wrong of course. There are some technical advantages to SmallCheck (determinism, no need to shrink etc.), but the main reason I prefer it is because it gives me more confidence. With quickcheck, I know that it generated 100 tests, but I've no idea what those tests are, and whether the RNG missed some important corner cases. With SmallCheck I know that it tried *all* cases up to certain depth, so it's much more reassuring. (Except for cases when the notion of depth isn't that informative, like floating-point numbers.) Roman

2 1

Re: [Haskell-cafe] ANNOUNCE: test-framework-golden-1.1
by Roman Cheplyaka 05 Oct '12

05 Oct '12

* Tim Docker <tim(a)dockerz.net> [2012-10-05 12:19:40+1000] > Hi Roman, > > This sounds like a great idea. As you suggest, I've put this kind of > thing together in scripts many times, without a consistent framework. > > I haven't tried it yet, but have one question. When you call a > function like > > goldenVsString > > I assume one generally provides a relative path. what is the file > path relative to? How does one arrange a package of haskell code and > associated golden files, and reference the golden files from within > the haskell so that the tree works from any location? The paths are naturally relative to the working directory of the test executable. In my projects, I typically have ./test.hs ./tests/case1.golden ./tests/case2.golden ./tests/case3.golden And so test.hs refers to test cases by relative paths like "tests/case1.golden". Of course, that'll only work if you run test.hs from its directory, but it is the case most of the time anyway. Also, since paths are relative to the directory containing the project.cabal file, "cabal test" works, too. If, for some reason, you want to be able to run tests from any location, you could provide the path to golden paths e.g. via an environment variable. Roman > On 05/10/12 07:55, Roman Cheplyaka wrote: > >I am glad to announce the first public release of test-framework-golden — a > >golden testing library. > > > >Hackage: http://hackage.haskell.org/package/test-framework-golden > >GitHub: https://github.com/feuerbach/test-framework-golden > > > >Golden tests are similar to unit tests (as implemented in HUnit), but the idea > >is to store the expected result in files (called «golden» files). > > > >I was introduced to the idea of golden testing by Bohdan Vlasyuk at ZuriHac in > >2010. Since then I've discovered that this is a nice approach and it is already > >used in variety of projects (e.g. ghc, haddock). > > > >Surprisingly, not much is written about golden testing, and I've been unable to > >find any golden testing libraries for Haskell or any other programming language. > >Every project has its own ad-hoc implementation in Haskell/Python/Shell/etc. > > > >The closest match on the market is Simon Michael's shelltestrunner. But to use > >it you have to expose the tested functionality via command line, which may be > >inconvenient. > > > >So this is my attempt at a general golden testing library. > > > >It consists of two modules. > >Test.Golden has a simple interface that helps you get started very quickly. > >Test.Golden.Advanced provides a very generic testing function that you can use > >to implement the testing system you dream about. > > > >The library is integrated with test-framework, so you can use golden tests in > >addition to SmallCheck/QuickCheck/HUnit tests. > > > >In future there's a plan to support some golden test management capabilities. > > > >Roman > > > >_______________________________________________ > >Haskell-Cafe mailing list > >Haskell-Cafe(a)haskell.org > >http://www.haskell.org/mailman/listinfo/haskell-cafe >

1 0

Which advanced Haskell topics interest you
by Manuel M T Chakravarty 05 Oct '12

05 Oct '12

Most existing Haskell books and similar teaching material is aimed at programmers who are new to Haskell. This survey is to assess the community interest in teaching material covering advanced topics beyond the commonly taught introductory material. https://docs.google.com/spreadsheet/viewform?formkey=dE1QZFNRLTFMdkllYWIyR2… Manuel

5 5

Re: [Haskell-cafe] Creating Repa arrays from unboxed vectors
by Janek S. 05 Oct '12

05 Oct '12

Thanks! > This makes it look like you've got two versions of vector installed, This is true, I have vector-0.9.1 and vector-0.10, but > with Repa built against the version that _isn't_ 0.9.1. this, I think, is not exactly correct: [root@GLaDOS : /dane/download] ghc-pkg field repa depends depends: QuickCheck-2.4.2-41cb2884cc20cd78948de62849bd9667 base-4.5.0.0-6db966b4cf8c1a91188e66d354ba065e bytestring-0.9.2.1-18f26186028d7c0e92e78edc9071d376 ghc-prim-0.2.0.0-c2ff696e5b8ec4d4b2bc2e42085fe471 template-haskell-2.7.0.0-133c0fdb189e05de22bd926d39f99fe3 vector-0.9.1-04dd5c58c224b03a4dc90091cf93a01d So Repa is build againts 0.9.1. Everything works when I do "ghc-pkg hide vector-0.10.0". Is there a way to tell GHCi which version of library it should load? I tried -XPackageImports but it doesn't allow to specify version of a package, only its name (or I don't know how to specify version). Jan

3 3

What is a functional approach to linear algebra routines? I see REPA warns that one must use fusion or risk slow routines.
by KC 05 Oct '12

05 Oct '12

Apparently using STUarrays in an imperative fashion is fraught with peril (and the performance of molasses). Casey -- -- Regards, KC

1 0