Welcome to issue 298 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from June 15 to 28, 2014 Quotes of the Week * Kinnison * imagines a radio station playing only things like 'Life tru a Lens', stuff by 'Dire States' or 'Monadonna' Top Reddit Stories * Today I published an introductory book on Haskell Data Analysis Domain: haskelldata.com, Score: 99, Comments: 26 Original:  http://goo.gl/R2kRFu On Reddit:  http://goo.gl/Ka0oP5 * Backpack: An ML-like module system for Haskell Domain: plv.mpi-sws.org, Score: 76, Comments: 44 Original:  http://goo.gl/7Zkxbg On Reddit:  http://goo.gl/78H37f * Cgrep, a context-aware grep for source code. Domain: awgn.github.io, Score: 67, Comments: 13 Original:  http://goo.gl/q1VdEA On Reddit:  http://goo.gl/2NNTrO * Teenage Haskell Domain: twdkz.wordpress.com, Score: 63, Comments: 7 Original:  http://goo.gl/c
It appears that The Haskell Platform includes libglut32.a and other important libs, so it is self-contained, provided users can work with the version of ghc that is provided: currently 7.6.3 under Windows. In particular, 'cabal install glut' works fine with the default version of ghc. But if I try using ghc-7.8.2 I get: Configuring GLUT-18.104.22.168... cabal: Missing dependencies on a foreign library: * Missing C library: glut32 ... All of the following do not change the result: 1. Adding --extra-lib-dirs=c:\glut-3.7.6-bin to the command line. 2. Using freeglut instead of glut 3. Copying libglut.a from The Haskell Package mingw/lib directory to c:\ghc-3.8.2\mingw\lib (dangerous because I am mixing architectures here). How does cabal decide that the C library glut32 is missing? Where is it looking? Why doesn't it look in the places I specify? Thanks, Dominick
Hey, I have wrote a little tool and some people had issues installing it with cabal and had to use "--reorder-goals" to be able to install it . Obviously it's because I have very few dependency bounds (actually near none aside base). I don't have to be convince that it's a bad idea, the motivation for adding bounds are pretty clear... but... I'm not sure how to define them? Should I know what is the lowest possible combination of my dependencies who would compile... because if I'm too strict it might be difficult for some user to install? or maybe I should target as lowest what is in current haskell-platform? I'm looking for some advice and feedback from maintainers. Thanks in advance! : https://github.com/aloiscochard/codex/issues/6
The Haskell 2010 report is here: http://darcs.haskell.org/haskell2010-report Also mirrored in git here: git< at >github.com:hvr/haskell2010-report.git This version doesn't build because it uses old "Char" instead of "Data.Char"-style imports. So my version here: https://github.com/chrisdone/haskell2010-report Fixes that: https://github.com/chrisdone/haskell2010-report/commit/6a773abb7201f4854ba5173227da28bf868747e5 But that's as far as I get. Here is what happens when I run $ cd tools; make; cd .. $ cd report; make I get: http://lpaste.net/raw/5699097250156773376 As is typical in the LaTeX, a torrent of uninteresting information is spewed out. Finally, at the end, it says: Does anyone familiar with the language of LaTeX have any idea what's going on? Has anyone successfully been able to build it? If so, please state the exact steps to do so and I will be very grateful. Ciao!
Hi, I have the following function plotf :: Ploteable a => ([a] -> IO ()) -> (a -> a) -> [a] -> IO () plotf plot fn xs = plot $ map fn xs that compiles correctly, but when I use it with: plotf win sin [1..100::Double] -- where win :: [Double] -> IO () I'm geting the error: No instance for (Ploteable Double) arising from a use of ‘plotf’ In the expression: plotf win sin [1 .. 100 :: Double] In an equation for ‘it’: it = plotf win sin [1 .. 100 :: Double] What am I missing? Thanks! 50 Aniversario de la Cujae. Inaugurada por Fidel el 2 de diciembre de 1964 http://cujae.edu.cu
------------------------------------------------- PhD studentship - Interval Computation in Haskell ------------------------------------------------- * Applicants should have a strong background in real analysis and functional programming. * The closing date for applications is 18th July 2014. * The project will be supervised by Michal Konečný, Aston University. * The student will receive a 3-year studentship of £15,500/year. * UK/EU student's fee is covered, non-EU student's fee is £10,914 in 2014/2015. * The student will act as a teaching assistant for a distance learning course approx. 7h/week. * For more information, use the following links: o Description of the potential project topics o AERN - a Haskell interval computation library o Supervisor's home page o Department research home page o Details of the studentship and links to application forms (The above advert is also available at http:/
From the user manual, it sounds like a clause of a closed type family should be rejected once no subsitution of the type could make it unify with the clause. If so, it doesn't seem to do an occurs check: type family IsEq a b :: Bool where IsEq a a = True IsEq a b = False forall a . IsEq a a :: Bool = forall (a :: k). 'True forall a . IsEq a [a] :: Bool = forall a. IsEq a [a] I came across this while trying to using Generics to find the immediate children of a term - this sort of non-reduction happens while comparing a type like (Term var) with a constructor argument of type var. Brandon _______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users< at >haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users