March 2011 - Haskell - Haskell.org

Call for Papers (ICFEM 2011)
by Huibiao Zhu 17 Mar '11

17 Mar '11

************************************************************ ICFEM 2011: 13th International Conference on Formal Engineering Methods CALL FOR PAPERs 25-28 Oct 2011 Radisson BLU Hotel, Durham, UK URL: http://www.scm.tees.ac.uk/icfem2011 ************************************************************ Since 1997, ICFEM has provided a forum for those interested in the application of formal engineering methods to computer systems. Researchers and practitioners, from industry, academia, and government, are encouraged to attend, and to help advance the state of the art. We are interested in work that has been incorporated into real production systems, and in theoretical work thatpromises to bring practical, tangible benefit. ICFEM 2011 is organised by Teesside University and will be held in the historic Durham City in the North East of England (http://www.thisisdurham.com/) AREA AND TOPICS Submissions related to the following principal themes are encouraged, but any topics relevant to the field of formal methods and their support environments will also be considered: * Abstraction and refinement * Formal specification and modelling * Software verification * Program analysis * Software model checking * Formal approaches to software testing * Formal methods for object and component systems * Concurrency and software transaction memory * Formal methods for cloud computing * Software inspection * Formal methods for cyber-physical systems * Tool development and integration * Software safety, security and reliability * Experiments involving verified systems * Applications of formal methods * Formal model-based development and code generation SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. The proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English and not exceed 16 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Submission should be done through the ICFEM 2011 submission page (https://www.easychair.org/conferences/?conf=icfem2011) handled by the EasyChair conference system. All queries should be sent to the e-mail address icfem2011(a)scm.tees.ac.uk. IMPORTANT DATES 31 March, 2011: Abstract submission deadline 7 April, 2011: Full-paper submission deadline 8 June, 2011: Acceptance/rejection notification 6 July, 2011: Camera-ready version due ORGANIZATION COMMITTEE Honorary Chairs: Marc Cavazza, Teesside University Cliff Hardcastle, Teesside University General Chairs: Phil Brooke, Teesside University, UK Cliff Jones, Newcastle University, UK Program Chairs: Shengchao Qin, Teesside University, UK Zongyan Qiu, Peking University, UK Program Committee: Bernhard K. Aichernig (Graz University of Technology, Austria) Keijiro Araki (Kyushu University, Japan) Farhad Arbab (CWI and Leiden University, The Netherlands) Richard Banach (University of Manchester, UK) Nikolaj Bjorner (Microsoft Research Redmond, USA) Jonathan P. Bowen (University of Westminster, UK) Michael Butler (University of Southampton, UK) Andrew Butterfield (Trinity College Dublin, Ireland) Ana Cavalcanti (University of York, UK) Aziem Chawdhary (University of Edinburgh, UK) Wei-Ngan Chin (National University of Singapore, Singapore) Florin Craciun (Soter Sys, Romania) Thao Dang (French National Center for Scientific Research, France) Jim Davies (Oxford University, UK) Dino Distefano (Queen Mary College, University of London, UK) Jin-Song Dong (National University of Singapore, Singapore) Zhenhua Duan (Xidian University, China) Colin Fidge (Queensland University of Technology, Australia) J. S. Fitzgerald (Newcastle University, UK) Leo Freitas (Newcastle University, UK) Joaquim Gabarro (Universitat Politecnica de Catalunya, Spain) Stefania Gnesi (ISTI-CNR, Italy) Anthony Hall (Consultant) Ian J. Hayes (The University of Queensland, Australia) Mike Hinchey (Lero, Ireland) Zhenjiang Hu (National Institute of Informatics, Japan) Michael Jackson (Consultant) Thierry Jeron (INRIA , France) Gerwin Klein (NICTA, Australia) Laura Kovacs (Vienna University of Technology, Austria) Kim G. Larsen (Aalborg University, Denmark) Peter Gorm Larsen (Aarhus University, Denmark) Michael Leuschel (Heinrich-Heine Universitat Dusseldorf, Germany) Xuandong Li (Nanjing University, China) Shaoying Liu (Hosei University, Japan) Zhiming Liu (UNU/IIST, Macau) Tiziana Margaria (University of Potsdam, Germany) Dominique Mery (Nancy University and LORIA, France) Stephan Merz (INRIA Nancy & LORIA, France) Huaikou Miao (Shanghai University, China) Peter Muller (ETH Zurich, Switzerland) Jun Pang (University of Luxembourg, Luxembourg) Matthew Parkinson (Microsoft Research Cambridge, UK) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Augusto Sampaio (Universidade Federal de Pernambuco, Brazil) Thomas Santen (Microsoft Innovations Center Aachen, Germany) Wuwei Shen (Western Michigan University, USA) Marjan Sirjani (Reykjavik University, Iceland) Bill Stoddart (Teesside University, UK) Jing Sun (University of Auckland, New Zealand) Jun Sun (Singapore University of Technology and Design, Singapore) Meng Sun (Peking University, China) Kenji Taguchi (AIST, Japan) Tetsuo Tamai (University of Tokyo, Japan) Yih-Kuen Tsay (National Taiwan University, Taiwan) T.H. Tse (University of Hong Kong, Hong Kong) Viktor Vafeiadis (MPI-SWS, Germany) Miroslav Velev (Aries Design Automation, USA) Laurent Voisin (Systerel, France) Hai H. Wang (Aston University, UK) Ji Wang (National University of Defense Technology, China) Linzhang Wang (Nanjing University, China) Heike Wehrheim (University of Paderborn, Germany) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Hongli Yang (Beijing University of Technology, China) Naijun Zhan (Chinese Academy of Sciences, China) Jian Zhang (Chinese Academy of Sciences, China) Hong Zhu (Oxford Brookes University, UK) Huibiao Zhu (East China Normal University, China) Steering Committee Keijiro Araki, Japan Jin Song Dong, Singapore Chris George, Canada Jifeng He, China Mike Hinchey, Ireland Shaoying Liu (Chair), Japan John McDermid, UK Tetsuo Tamai, Japan Jim Woodcock, UK

1 0

Haskell Weekly News: Issue 173
by Daniel Santa Cruz 17 Mar '11

17 Mar '11

Welcome to issue 173 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of March 06-12, 2011. For a (easier to read) HTML version goto: http://bit.ly/gQCQHf Announcements Bas van Dijk [2]annouced updates to regions (0.9), regions-mtl (0.3.1.5), and regions-monadstf (0.3.1.5) Don Stewart [3]gave us reason to celebrate with the announcement of the new Haskell Platform 2011.2, the "single, standard Haskell distribution for everyone." Most of you have probably already heard/gotten this new release, but in case you haven't... Remi Turk [4]annouced the first release of cinvoke, "a binding to the C library cinvoke, allowing functions to be loaded and called whose names and types are not known before run-time." Quotes of the Week * kmc: [After discussing monads, containers, and tortillas] therefore the key difference between a container and a monad is delicious carne asada * edwardk: [you mean #haskell has a 2 phD/nick average ?] clearly this is why SPJ stays away, he doesn't want to dilute that metric. * byorgey: The magic of printf is that it is well-typed but you need not actually know what the types are. * monochrom: How do I extract the IO out of IO String? * kmc: ghc -XTwitter -ddump-tweets * xplat: because, you know, you have to write a quicksort so differently in java than any other language. first you create an AbstractSequenceSubrangeFactory interface, and then you create the implementation for ArrayList ... Top Reddit Stories * The Haskell Platform 2011.2 is out!: From (hackage.haskell.org.nyud.net) scored 80 with 34 comments. Read on [5]reddit or the [6]original post. * Umm... yes... you can now write new GHC compiler passes in Coq (!!?): From (cs.berkeley.edu) scored 55 with 16 comments. Read on [7]reddit or the [8]original post. * The Type Technology Tree (mapping Type Extensions in GHC): From (blog.ezyang.com) scored 53 with 5 comments. Read on [9]reddit or the [10]original post. * a message from Tokyo: From (haskell.org) scored 47 with 9 comments. Read on [11]reddit or the [12]original post. * Haskellâs Niche: Hard Problems: From (cdsmith.wordpress.com) scored 43 with 16 comments. Read on [13]reddit or the [14]original post. * Functional flocks : modelling and visualizing flocking behavior in Haskell: From (syntacticsalt.com) scored 21 with 0 comments. Read on [15]reddit or the [16]original post. * Tech Talk Video: Faster Persistent Data Structures Through Hashing: From (corp.galois.com) scored 20 with 5 comments. Read on [17]reddit or the [18]original post. * Recursion is a low-level operation: From (blog.fogus.me), scored 18 with 25 comments. Read on [19]reddit or the [20]original post. * Yesod 1.0 Roadmap: From (docs.yesodweb.com) scored 17 with 9 comments. Read on [21]reddit or the [22]original post. * Type inference weirdness: From (self.haskell), scored 13 with 26 comments. Read on [23]reddit. Top StackOverflow Answers * [25]haskell beginner - recursive recursion votes: 10 This can be improved substantially by using a different algorithm: The smallest number which can be divided by a set of numbers (in this case, the set is [1..10]) is the least common multiple of those numbers. Haskell even has a least common multiple function (lcm) built-in which you can use: Prelude> foldl lcm 1 [1..10] 2520 If you prefer not to use ... * [26]Reasoning laziness votes: 10 I believe the problem is that Data.Vector is not strict in its elements. So although your reasoning is right, when accumulating the histogram your thunks looks like: <1+(1+(1+0)) (1+(1+0)) 0 0 (1+(1+(1+(1+0)))) ... > Rather than <3 2 0 0 4 ...> And only when you print are those sums computed. I don't see a strict accum function in the ... * [27]What are some compelling use cases of infinite data structures? votes: 13 Here are two examples, one big and one small: Why Functional Programming Matters by John Hughes has a good example, of a chess game. The move tree for a chess game is not actually infinite, but its big enough that it might as well be infinite (call it "near-infinite"). In a strict language you can't actually treat it as a tree, because there isn't enough ... * [28]Computational cost of applicative style votes: 14 I really suspect they'll be compiled down to the same thing in most cases. I did a tiny test, import Control.Applicative test1 :: (b -> b -> c) -> (a -> b) -> (a -> b) -> a -> c test1 bracket takeConn putConn pool = bracket (takeConn pool) (putConn pool) test2 :: (b -> b -> c) -> (a -> b) -> (a -> b) -> a -> ... Top StackOverflow Questions * what does "exists" mean in Haskell type system? (votes: 20, answers: 4) [29]read * Is there a book which teaches about compilers using Haskell? (votes: 12, answers: 3) [30]read * Reasoning laziness (votes: 10, answers: 1) [31]read * What are some compelling use cases of infinite data structures? (votes: 10, answers: 5) [32]read * The difference between +1 and -1 (votes: 9, answers: 3) [33]read About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. I'm in dire need of finding good "quotes of the week". If you happen to come across any, please don't hesitate to send it along. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/18554 3. http://article.gmane.org/gmane.comp.lang.haskell.platform/1519 4. http://article.gmane.org/gmane.comp.lang.haskell.general/18543 5. http://www.reddit.com/r/haskell/comments/g1g0a/the_haskell_platform_20112_i… 6. http://hackage.haskell.org.nyud.net/platform/?2011-2 7. http://www.reddit.com/r/haskell/comments/fze1q/umm_yes_you_can_now_write_ne… 8. http://www.cs.berkeley.edu/~megacz/coq-in-ghc/ 9. http://www.reddit.com/r/haskell/comments/fz0ve/the_type_technology_tree_map… 10. http://blog.ezyang.com/2011/03/type-tech-tree/ 11. http://www.reddit.com/r/haskell/comments/g2m0t/a_message_from_tokyo/ 12. http://www.haskell.org/pipermail/glasgow-haskell-users/2011-March/020166.ht… 13. http://www.reddit.com/r/haskell/comments/g382d/haskells_niche_hard_problems/ 14. http://cdsmith.wordpress.com/2011/03/13/haskells-niche-hard-problems/ 15. http://www.reddit.com/r/haskell/comments/g2v75/functional_flocks_modelling_… 16. http://syntacticsalt.com/2011/03/10/functional-flocks/ 17. http://www.reddit.com/r/haskell/comments/g030j/tech_talk_video_faster_persi… 18. http://corp.galois.com/blog/2011/3/8/tech-talk-video-faster-persistent-data… 19. http://www.reddit.com/r/haskell/comments/g1ajf/recursion_is_a_lowlevel_oper… 20. http://blog.fogus.me/2011/03/09/recursion-is-a-low-level-operation/ 21. http://www.reddit.com/r/haskell/comments/fywf1/yesod_10_roadmap/ 22. http://docs.yesodweb.com/blog/road-to-yesod-1-0 23. http://www.reddit.com/r/haskell/comments/g2aiv/type_inference_weirdness/ 25. http://stackoverflow.com/questions/5250012/haskell-beginner-recursive-recur… 26. http://stackoverflow.com/questions/5274700/reasoning-laziness/5275489#52754… 27. http://stackoverflow.com/questions/5284458/what-are-some-compelling-use-cas… 28. http://stackoverflow.com/questions/5230043/computational-cost-of-applicativ… 29. http://stackoverflow.com/questions/5235116/what-does-exists-mean-in-haskell… 30. http://stackoverflow.com/questions/5234398/is-there-a-book-which-teaches-ab… 31. http://stackoverflow.com/questions/5274700/reasoning-laziness 32. http://stackoverflow.com/questions/5284458/what-are-some-compelling-use-cas… 33. http://stackoverflow.com/questions/5210182/the-difference-between-1-and-1

1 0

ANN: VTY 4.6.0.6
by Corey O'Connor 16 Mar '11

16 Mar '11

http://hackage.haskell.org/package/vty The most significant change in this release is a move to github.com for the primary source repository, issue tracking, and wiki: https://github.com/coreyoconnor/vty Other changes: * Various compatibility fixes. Thanks Michael Steele, Lennart Kolmodin, and Yoshikuni Jujo. * Use of IO Handles instead of POSIX FDs for output. Improves reliability with using the inline module and other systems that write to the stdOut Handle. -Corey O'Connor coreyoconnor(a)gmail.com http://corebotllc.com/ Available for contract and consulting work. Commercial VTY support available.

1 0

poetry
by David Harley 16 Mar '11

16 Mar '11

Has anyone else ever come across this text? As on I walked, a comfort seemed to touch A heart that had not been disconsolate Strength came where weakness was not known to be, At least not felt; and restoration came, Like an intruder, knocking at the door Of unacknowledged weariness. I took the balance in my hand and weighed myself. I saw but little, and thereat was pleased; Little did I remember, and even this Still pleased me more; but I had hopes and peace And swellings of the spirits, was rapt and soothed, Conversed with promises, had glimmering views How Life pervades the undecaying mind, How the immortal Soul with God-like power Informs, creates, and thaws the deepest sleep That time can lay upon her; how on earth, Man, if he do but live within the light Of high endeavours, daily spreads abroad His being with a strength that cannot fail. I always think it could/should have been written by a Haskell programmer, but I assure you it wasn't, although there is an uncanny coincidental historical connection. -- Using Opera's revolutionary email client: http://www.opera.com/mail/

1 0

ANN: Monad.Reader special Poetry and Fiction Edition
by Brent Yorgey 15 Mar '11

15 Mar '11

I am pleased to announce that the special Poetry and Fiction Edition of The Monad.Reader is now available [1]. Enjoy! Also, the submission deadline for Issue 18 has been extended one week, to Friday, April 8. Please get in touch if you would like to submit something! -Brent [1] http://themonadreader.files.wordpress.com/2011/03/specialissue.pdf

1 0

ANN: craftwerk-0.1, craftwerk-cairo-0.1, craftwerk-gtk-0.1
by Malte Harder 14 Mar '11

14 Mar '11

Dear all, I just released the first version of the Craftwerk graphics library for 2d vector graphics. Craftwerk is intended to act as an abstract interface to different backend drivers. The library itself has a TikZ (http://sourceforge.net/projects/pgf) driver builtin to output vector graphics for use in LaTeX documents. The craftwerk-cairo library supplies a Cairo output function to the library. The aim is to support these two backends in a seamless manner such that graphics created with either backend are not or nearly not distinguishable. The third package (craftwerk-gtk) contains convenience functions to display graphics created with craftwerk directly in a Gtk window, including the basic zooming, PDF & TikZ export via a file chooser dialog. It also allows to create a simple user interface that passes options to the rendering function. The feature support is rather rudimentary at the moment, but for current Cairo users most features should be already available from within the craftwerk API. The aim is to support more high level functions like TikZ offers. The project started when I realized that I need to prepare a lot of visualizations at university twice, once for display and once for print. I hope that this library proves to be useful for people with similar tasks. A great thing would be if the Chart library allows to plug another backend in. I haven't really looked into that, but this would allow me to leave Gnuplot and R behind for most purposes and at the same time get higher quality output that is better integrable. I started learning Haskell only half a year ago and this is my first real project. So far I have to say that I enjoy it very much. Therefore, if you find some weird constructions or have any comments about the design of the library, I'm looking forward for any feedback! The source repository can be found under: https://github.com/mahrz/Craftwerk and packages here: http://hackage.haskell.org/package/craftwerk-0.1 http://hackage.haskell.org/package/craftwerk-cairo-0.1 http://hackage.haskell.org/package/craftwerk-gtk-0.1 Best, Malte -- Malte Harder malte.harder(a)gmail.com

2 1

Haskell mail server fail?
by Kenneth Hoste 14 Mar '11

14 Mar '11

Hello, Since last week, I'm not receiving any mails from the Haskell mailing lists (haskell@, haskell-cafe@ and beginners@) at work. (I'm temporarily using my GMail account now) I checked with the guys in our IT department what's going on, and it seems like the Haskell mail server lambda.haskell.org is not (re)configured as it should. The relevant log message on our side is: reject: RCPT from lambda.haskell.org[78.46.100.180]: 504 5.5.2 <lambda>: Helo command rejected: need fully-qualified hostname; from=<haskell-bounces(a)haskell.org> to=<kenneth.hoste(a)ugent.be> proto=ESMTP helo=<lambda> Apparently lambda should be responding with "helo=<lambda.haskell.org>" (or somesuch) in order to make the mails pass through on our end. We have a pretty strict anti-SPAM policy, and I was told that not using a fully qualified hostname as helo response is a common characteristic of spam servers. Can someone look into this? greetings, Kenneth

2 1

LOPSTR 2011 - Last CFP
by German Vidal 14 Mar '11

14 Mar '11

News: - Invited speakers: * John Gallagher (Roskilde University, Denmark) * Fritz Henglein (University of Copenhagen, Denmark) * Vitaly Lagoon (Cadence Design Systems, Boston, USA) - Springer accepted to publish the post-proceedings in the Lecture Notes in Computer Science series. - Submission deadlines approaching: * Paper submission: March 27, 2011 * Extended abstract submission: April 3, 2011 ============================================================ Call for papers 21th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2011 http://users.dsic.upv.es/~lopstr11/ Odense, Denmark, July 18-20, 2011 (co-located with PPDP 2011, AAIP 2011 and WFLP 2011) ============================================================ Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 21st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2011) will be held in Odense, Denmark; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2011 will be co-located with PPDP 2011 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming- in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: - specification - synthesis - verification - transformation - analysis - optimisation - specialization - partial evaluation - inversion - composition - program/model manipulation - certification - security - transformational techniques in SE - applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Following past editions, the formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. IMPORTANT DATES AND SUBMISSION GUIDELINES: - Paper submission: March 27, 2011 - Extended abstract submission: April 3, 2011 - Notification (for pre-proceedings): May 16, 2011 - Camera-ready (for pre-proceedings): June 12, 2011 - Symposium: July 18-20, 2011 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Lecture Notes in Computer Science style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both short and full papers can be accepted for presentation at the symposium and will then appear in the LOPSTR 2011 pre-proceedings. Full papers can also be immediately accepted for publication in the formal proceedings to be published by Springer in the LNCS series. In addition, after the symposium, the programme committee will select further short or full papers presented in LOPSTR 2011 to be considered for formal publication. These authors will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then after another round of reviewing, these revised papers can also be published in the formal proceedings. Invited speakers: - John Gallagher, Roskilde University, Denmark - Fritz Henglein, University of Copenhagen, Denmark (shared with PPDP) - Vitaly Lagoon, Cadence Design Systems, Boston, USA (shared with PPDP) Program Committee: Elvira Albert (Complutense University of Madrid, Spain) Malgorzata Biernacka (University of Wroclaw , Poland) Manuel Carro (Technical University of Madrid, Spain) Michael Codish (Ben-Gurion University of the Negev, Israel) Danny De Schreye (K.U.Leuven, Belgium) Maribel Fernandez (King's College London, UK) Raul Gutierrez (University of Illinois at Urbana-Champaign, USA) Mark Harman (University College London, UK) Frank Huch (C.A.U. Kiel, Germany) Michael Leuschel (University of Dusseldorf, Germany) Yanhong Annie Liu (State University of New York at Stony Brook, USA) Kazutaka Matsuda (Tohoku University, Japan) Fred Mesnard (Universite de La Reunion, France) Ulrich Neumerkel (Technical University of Wien, Austria) Alberto Pettorossi (Universita' di Roma Tor Vergata, Italy) Carla Piazza (University of Udine, Italy) Peter Schneider-Kamp (University of Southern Denmark, Denmark) Hirohisa Seki (Nagoya Institute of Technology, Japan) Josep Silva (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) Jurgen Vinju (Centrum Wiskunde & Informatica, The Netherlands) Jianjun Zhao (Shanghai Jiao Tong University, Shanghai) Contacts Program Chair (contact him for additional information about papers and submissions): German Vidal Department of Computer Science (DSIC) Universitat Politecnica de Valencia Valencia, Spain Email: lopstr11(a)dsic.upv.es General Chair Peter Schneider-Kamp Dept. of Mathematics and Computer Science University of Southern Denmark Campusvej 55 DK-5230 Odense M, Denmark Email: petersk(a)imada.sdu.dk

1 0

ICFP 2011 Deadline Extension
by Wouter Swierstra 14 Mar '11

14 Mar '11

===================================================================== ICFP 2011: International Conference on Functional Programming http://www.icfpconference.org/icfp2011 ===================================================================== On behalf of the Program Committee of ICFP 2011, I would like to announce a deadline extension for authors affected by the recent earthquake in Japan. The Program Committee will accept titles and abstracts until Monday 4 April at 23:59, and full submissions until Thursday 7 April at 23:59 from those authors affected by the earthquake. Our thoughts go out to the victims of this tragedy. Wouter Swierstra ICFP Publicity Chair

1 0

ANN: hsmagick 0.5
by Vincent Gerard 13 Mar '11

13 Mar '11

Hello Haskellers, I am currently taking over the maintainership of hsmagick, a FFI bindings library to ImageMagick. Therefore, I am pleased to announce the 0.5 release of hsmagick. http://hackage.haskell.org/package/hsmagick Major changes: ------ * imageToBlob and blobToImage functions using ByteStrings * Use of ForeignPtr instead of Ptr as memory references representation. Thanks to Steffen Siering patches, the internal representation has been changed from Ptr to ForeignPtr. The finalization of ForeignPtr should resolve space leaks issues. * destroyImage function is exposed, to release the memory immediately. * hsmagick builds with GHC 7 The source repository is now hosted on github https://github.com/vincentg/hsmagick Please, do not hesitate to contact me by email or with github for any questions, requests, bugs, patches, anything about hsmagick. Cheers, Vincent Gerard (Please make sure not to reply to haskell(a)haskell.org.)

1 0