July 2012 - Haskell-Cafe

Memory corruption issues when using newAlignedPinnedByteArray, GC kicking in?
by Nicolas Trangez 11 Jul '12

11 Jul '12

All, While working on my vector-simd library, I noticed somehow memory I'm using gets corrupted/overwritten. I reworked this into a test case, and would love to get some help on how to fix this. Previously I used some custom FFI calls to C to allocate aligned memory, which yields correct results, but this has a significant (+- 10x) performance impact on my benchmarks. Later on I discovered the newAlignedPinnedByteArray# function, and wrote some code using this. Here's what I did in the test case: I created an MVector instance, with the exact same implementation as vector's Data.Vector.Storable.Mutable.MVector instance, except for basicUnsafeNew where I pass one more argument to mallocVector [1]. I also use 3 different versions of mallocVector (depending on compile-time flags): mallocVectorOrig [2]: This is the upstream version, discarding the integer argument I added. Then here's my first attempt, very similar to the implementation of mallocPlainForeignPtrBytes [3] at [4] using GHC.* libraries. Finally there's something similar at [5] which uses the 'primitive' library. The test case creates vectors of increasing size, then checks whether they contain the expected values. For the default implementation this works correctly. For both others it fails at some random size, and the values stored in the vector are not exactly what they should be. I don't understand what's going on here. I suspect I lack a reference (or something along those lines) so GC kicks in, or maybe the buffer gets relocated, whilst it shouldn't. Basically I'd need something like GHC.ForeignPtr.mallocPlainAlignedForeignPtrBytes :: Int -> Int -> IO (ForeignPtr a) Thanks, Nicolas [1] https://gist.github.com/3084806#LC37 [2] https://gist.github.com/3084806#LC119 [3] http://hackage.haskell.org/packages/archive/base/latest/doc/html/src/GHC-Fo… [4] https://gist.github.com/3084806#LC100 [5] https://gist.github.com/3084806#LC81

2 1

hiring haskell programmer.
by Vagif Verdi 11 Jul '12

11 Jul '12

Hello. My company is looking to hire a haskell developer. South California (San Dimas), full time job, local only (no telecommute) We use yesod (haskell web framework) for internal web application and web services, and compojure (clojure web framework) for customer facing web site. All development will be ether with haskell (if libraries permit) or clojure on JVM. If interested please contact me. Regards, Vagif Verdi

1 0

Connecting Travis CI and hackage
by Dmitry Malikov 10 Jul '12

10 Jul '12

*tldr*: is there a way to upload package to hackage from Travis automatically and safely (hiding password to hackage account)? Several days ago I discovered Travis ( http://travis-ci.org/ ) - nice open source build-service, easy to start and monitoring. I've configured some github projects and add build status to it's readme. It's usable to know how is your haskell package building on separate fresh machine. Following git-flow developing model there is a develop branch for snapshots and master branch for release. That why every commit in master branch should produce new release build ⇒ every commit in master branch should produce new hackage build upload. And also it will be nice to have that routine process done automatically. It could be done using cabal-upload tool and --username and --password options. But it means that .travis.yml file should contain my hackage-password explicitly. How can I avoid that? -- Best regards, dmitry malikov !

3 3

Combining Network Descriptions in Reactive.Banana
by Alexander Foremny 10 Jul '12

10 Jul '12

Hello list, I am currently experimenting with Reactive.Banana and I am trying to write a program that simply displays a String which is supplied by the user. Thus in Main.hs I'd like to create a Behavior t String from some arbitrary sources and pass this to a library function performing the printing. However, I am not able to get the desired behavior of my program. A sample Main.hs is available as Gist [1]. The cause of error appears to be that the type t over which NetworkDescription and Behavior are parameterized are distinct! I tried several variations of the code in [1] using ExistentialQuantification over t and/or giving explicit type signatures. The error is slightly different in each case, but always boils down to the same reason. In case explicit error messages are required I can post them to the list. Any insight into this would be of great help. And additionally I'd be interested if this kind of program is possible with Reactive.Banana at all. [1] https://gist.github.com/3004430

4 4

Linking against Sqlite3 on Windows problem
by Eugene Dzhurinsky 10 Jul '12

10 Jul '12

Hi all! I created simple application, which uses sqlite3 as it's datastore back-end. I faced no problems when building and running it on Linux, but after I tried to build it on Windows, I see weird linking error: Linking dist\build\hnotes\hnotes.exe ... C:\Documents and Settings\Admin\Application Data\cabal\sqlite-0.5.2.2\ghc-7.0.4/libHSsqlite-0.5.2.2. a(sqlite3-local.o):sqlite3-local.c:(.text+0x21): undefined reference to `sqlite3_temp_directory' C:\Documents and Settings\Admin\Application Data\cabal\sqlite-0.5.2.2\ghc-7.0.4/libHSsqlite-0.5.2.2. a(sqlite3-local.o):sqlite3-local.c:(.text+0x40): undefined reference to `sqlite3_temp_directory' collect2: v ld 1 cabal.EXE: Error: some packages failed to install: hnotes-0.1 failed during the building phase. The exception was: ExitFailure 1 What may be wrong there? I suspect that qalite3.dll has to be added to linking stage, but have no idea how to do that. Adding --extra-lib-dirs=path-to-sqlite-dll doesn't help either (perhaps because I need to update my cabal file somehow, to support this?). Thank you for the help! -- Eugene N Dzhurinsky

2 1

ANNOUNCE: control-monad-loop 0.1
by Joey Adams 10 Jul '12

10 Jul '12

This package provides imperative-style loops supporting "continue" and "break". For example: import Control.Monad import Control.Monad.IO.Class import Control.Monad.Trans.Loop import Control.Monad.Trans.Class main :: IO () main = foreach [0..] $ \i -> foreach [0..] $ \j -> do when (j == 0) $ continue -- skip to next iteration when (j >= 5) $ exit -- exit the loop when (i >= 5) $ lift exit -- exit the outer loop by calling 'exit' in the parent monad liftIO $ print (i, j) It works by having the loop body run under the LoopT monad transformer, which provides early exit functions 'continue' and 'exit'. Functions like 'foreach' and 'while' run a LoopT callback, passing it continuations defining 'continue' and 'exit'. http://hackage.haskell.org/package/control-monad-loop

2 3

ANNOUNCE: Sifflet visual programming language, release 2.0.0.0
by gdweber＠iue.edu 10 Jul '12

10 Jul '12

I don't usually get this excited about a release, but after nearly a year of not being able to do any work on Sifflet, I am now *Extremely Happy* to announce -- Sifflet and sifflet-lib 2.0.0.0, now available on Hackage! This version introduces a type checker and partial support for higher order functions in Sifflet, the visual, functional programming language and support system for students learning about recursion. Sifflet programmers define functions by drawing diagrams, and the Sifflet interpreter uses the diagrams to show how function calls are evaluated. Sifflet-lib is the library containing many modules of the Sifflet application. What's New ---------- July 5, 2012, Version 2.0.0.0: * Partial support for higher order functions, like map and filter. See Lesson 10 in the Sifflet Tutorial. * Sifflet now provides type checking and type inference. This should make it possible to provide exporters to languages, like Java, that require type declarations. (Unfortunately, the error messages for incorrectly typed functions are not yet friendly for novice programmers.) * Added a menu command (File / Save image ...) to save vector graphic images of functions in the Sifflet Workspace or Edit function windows. Images can be saved in SVG, Postscript, and PDF formats. * Reorganized hierarchical modules in the library to conform to the recommended practice. See the RELEASE-NOTES for details. * Several bugs are fixed, including one which crashed Sifflet when applying a function definition with an incomplete `if` tree. See ISSUES for details. * There is a new file format for saving function definitions to support higher-order function types. The new format, siffml 2.0, has a RELAX NG schema; siffml 1.0 files can still be opened in Sifflet 2.0. About Sifflet ------------- Sifflet is a visual, functional programming language intended as an aid for learning about recursion. * A picture explains Sifflet better than words: please see the screenshot showing how to evaluate 3!: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Features: - Visual editor. - Visual tracer/debugger which shows how recursive and other function calls are evaluated. To support active learning and avoid screen clutter, Sifflet displays only as much of the computation as the user requests. - Carefully crafted tutorial with 44 pictures, about 26 pages if printed. - Number, string, and list data types. - Small collection of primitive functions. - Runnable examples of compound functions. - Sifflet functions can be exported to Scheme, Python 3, and Haskell. References ---------- * Download: http://hackage.haskell.org/package/sifflet-lib http://hackage.haskell.org/package/sifflet * Home page: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Sifflet Tutorial: http://mypage.iu.edu/~gdweber/software/sifflet/doc/tutorial.html * RELEASE-NOTES: http://mypage.iu.edu/~gdweber/software/sifflet/RELEASE-NOTES * ISSUES: http://mypage.iu.edu/~gdweber/software/sifflet/ISSUES ------------------------------------------------------------------------ -- Gregory D. Weber, Ph. D. : Associate Professor of Informatics / \ Indiana University East 0 : Tel. (765) 973-8420; FAX (765) 973-8550 / \ http://mypage.iu.edu/~gdweber/ 1 []

2 3

combining predicates, noob question
by Sebastián Krynski 10 Jul '12

10 Jul '12

As I was using predicates (a -> bool) , it appeared the need for combining them with a boolean operator (bool -> bool -> bool) in order to get a new predicate combining the previous two. So I wrote my function combinerPred (see code below). While I think this is JUST ok, i'm feeling a monad in the air. So.. where is the monad? combinerPred :: (a -> Bool) -> (a -> Bool) -> (Bool -> Bool -> Bool) -> (a -> Bool) combinerPred pred1 pred2 op = \x -> op (pred1 x) (pred2 x) thanks Sebastián

4 5

Best way to build a GHC backend?
by Jonathan Geddes 10 Jul '12

10 Jul '12

Venerable Haskell Hackers, I love Haskell and think it should run everywhere. Now supposing I would like to build another backend for GHC, perhaps for Java Bytecode, .Net CIL, or JavaScript, What would be the best way to approach that? I can think of a few options: 1. Produce External Core with -fext-core and compile that with a completely separate compiler 2. Use the GHC apis to build a compiler that reuses a load of GHC's code, but has it's own backend 3. Add a new backend directly into GHC Any other options? While I'm on the subject, why has Haskell not been ported to the likes of the JVM, .NET CLR, or JavaScript? Are Haskell's non-strict semantics just too different from the semantics of these other platforms? SPJ is known for saying that Haskell's plan for world domination is support for many parallelism/concurrency idioms. I believe running on many platforms is just as important. From my point of view, languages that cannot run on one of the 3 aforementioned platforms will become irrelevant. (with the exception of C, of course). Thoughts? --J Arthur

6 7

Haskell Implementors' Workshop talk proposals due in one week!
by Johan Tibell 09 Jul '12

09 Jul '12

Call for Talks ACM SIGPLAN Haskell Implementors' Workshop http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2012 Copenhagen, Denmark, September 14th, 2012 The workshop will be held in conjunction with ICFP 2012 http://www.icfpconference.org/icfp2012/ Important dates Proposal Deadline: 10th July 2012 Notification: 27th July 2012 Workshop: 14th September 2012 The Haskell Implementors' Workshop is to be held alongside ICFP 2012 this year in Copenhagen, Denmark. There will be no proceedings; it is an informal gathering of people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure. This relatively new workshop reflects the growth of the user community: there is a clear need for a well-supported tool chain for the development, distribution, deployment, and configuration of Haskell software. The aim is for this workshop to give the people involved with building the infrastructure behind this ecosystem an opportunity to bat around ideas, share experiences, and ask for feedback from fellow experts. We intend the workshop to have an informal and interactive feel, with a flexible timetable and plenty of room for ad-hoc discussion, demos, and impromptu short talks. Scope and target audience ------------------------- It is important to distinguish the Haskell Implementors' Workshop from the Haskell Symposium which is also co-located with ICFP 2012. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors' Workshop will have no proceedings -- although we will aim to make talk videos, slides and presented data available with the consent of the speakers. In the Haskell Implementors' Workshop, we hope to study the underlying technology. We want to bring together anyone interested in the nitty-gritty details behind turning plain-text source code into a deployed product. Having said that, members of the wider Haskell community are more than welcome to attend the workshop -- we need your feedback to keep the Haskell ecosystem thriving. The scope covers any of the following topics. There may be some topics that people feel we've missed, so by all means submit a proposal even if it doesn't fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Talks ----- At this stage we would like to invite proposals from potential speakers for a relatively short talk. We are aiming for 20 minute talks with 10 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 200 words to: johan.tibell(a)gmail.com We will also have a lightning talks session which will be organised on the day. These talks will be 2-10 minutes, depending on available time. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Organisers ---------- * Lennart Augustsson (Standard Chartered Bank) * Manuel M T Chakravarty (University of New South Wales) * Gregory Collins - co-chair (Google) * Simon Marlow (Microsoft Research) * David Terei (Stanford University) * Johan Tibell - co-chair (Google)

1 1