August 2011 - Haskell

Deadline extension: (August 31): SPLST'11
by James Chapman 25 Aug '11

25 Aug '11

Dear list, The paper deadline for SPLST’11 (12th Symposium on Programming Languages and Software Tools - http://www.cs.ioc.ee/splst11/) has been extended until August 31. There's still almost a week left to prepare a short paper on work in progress! The programme committee (and I in particular) would be delighted to receive submissions related to or using Haskell. If you would like to visit us in Estonia please consider submitting something. The workshop is timed to coincide with the Estonian Theory Days meeting which SPLST attendees are also welcome to attend. Best wishes, James Chapman Begin forwarded message: > From: Jaan Penjam <jaan(a)cs.ioc.ee> > Subject: [excs] Deadline extension: (August 31): SPLST'11 > > Dear colleagues, > > On behalf of the organizers and Program Committee I inform you that due to several requests the paper submission deadline for SPLST’11 (12th Symposium on Programming Languages and Software Tools - http://www.cs.ioc.ee/splst11/) has been extended to August 31. > > Apologies for multiple copies. > > Jaan Penjam > > x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x > > CALL for PAPERS > SPLST'11 > > 12th Symposium on Programming Languages and Software Tools > http://cs.ioc.ee/splst11/ > > October 5-7, 2011, Tallinn, Estonia > > > IMPORTANT DATES (EXTENDED) > > Submission Deadline: > Wed, August 31 > Author Notification: Wed, September 14 > Camera ready manuscript: Wed, September 21 > Registration: Mon, September 19 > > > BACKGROUND > > This symposium is the twelfth in a series of conferences which started in 1989 in Szeged, Hungary. Since then it has been organized biannually. The twelfth symposium will be hosted by the Institute of Cybernetics at Tallinn University of Technology (IoC) and organized in co-operation with the Estonian Centre of Excellence in Computer Science (EXCS). > > > AIMS AND SCOPE > > The Symposium on Programming Languages and Software Tools will provide a forum for software scientists to present and discuss recent research and development in computer science. > > The scope of the symposium covers ongoing research related to languages, tools and methods for software development. Topics of interest include, but are not limited to: > - programming and modeling languages and systems, > - formal methods and algorithms, > - parallel and distributed systems, > - techniques for embedded, database, web and ubiquitous systems, > - techniques and tools for software engineering, > - model-driven software engineering, > - software evolution, refactoring and re-engineering, > - software architectures and software processes, > etc. > > > PROCEEDINGS > > All accepted papers will be published in the conference proceedings as a report of IoC with ISBN. > > The authors of selected talks will be invited to revise their papers in order to be published as a special issue of the Proceedings of the Estonian Academy of Sciences (http://www.eap.ee/proceedings) in 2012. The papers submitted to this special issue will undergo standard journal referee process. > > > SUBMISSIONS > > Authors are invited to submit full research papers (at most 12 pages) or short research papers (4-6 pages) in PDF-format before August 31st. Submissions should be written in English and formatted using the easychair.cls LaTeX class (can be obtained fromhttp://www.easychair.org/easychair.zip) > > All submitted papers will be reviewed by members of the program committee and the accepted papers must be presented at the workshop by one of the authors. Submissions should contain sufficient detail to allow to evaluate its validity, quality, originality and relevance. Simultaneous submission to other conferences with published proceedings or journals is not allowed. > > Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=splst11 > > > PROGRAM COMMITTEE > > James Chapman - Institute of Cybernetics, Estonia > Hassan Charaf - Budapest University of Technology and Economics, Hungary > Marlon Dumas - University of Tartu, Estonia > Tibor Gyimóthy - University of Szeged, Hungary > Zoltán Horváth - Eötvös Loránd University, Hungary > Akos Kiss - University of Szeged, Hungary > Kai Koskimies - Tampere University of Technology, Finland > Tamas Kozsik - Eötvös Loránd University, Hungary > Merik Meriste - University of Tartu, Estonia > Erkki Mäkinen - University of Tampere, Finland > Jukka Paakki - University of Helsinki, Finland > András Pataricza - Budapest University of Technology and Economics, Hungary > Jaan Penjam - Institute of Cybernetics, Estonia > Jari Peltonen - Tampere University of Technology, Finland > Attila Pethõ - University of Debrecen, Hungary > Luigia Petre - Åbo Akademi University, Finland > Kari Smolander - Lappeenranta University of Technology, Finland > Tarja Systä - Tampere University of Technology, Finland > Jorma Tarhio - Aalto University, Finland > Kuldar Taveter - Tallinn University of Technology, Estonia > Tarmo Uustalu - Institute of Cybernetics, Estonia > Margus Veanes - Microsoft Research, Redmond USA > Varmo Vene - University of Tartu, Estonia > > > STEERING COMMITTEE > > Kai Koskimies - Tampere University of Technology, Finland > Zoltán Horváth - Eötvös Loránd University, Hungary > Jaan Penjam - Institute of Cybernetics, Estonia > > > CONTINUATION EVENT > > SPLST’11 symposium will be followed by the Estonian Computer Science Theory Days (http://cs.ioc.ee/excs/tdays/) on October 7-9, 2011. The SPLST participants interested in that topics may consider to continue with this scientific meeting. More information about this event can be found on the Theory Days’ web-pages. > > ------------------- > Jaan Penjam, Prof [Phone: +372 620 4214] > Senior Research Fellow of the Institute of Cybernetics at [GSM: +372 514 7798] > Tallinn University of Technology [Fax: +372 620 4151] > Akadeemia tee 21, room B404 [email: jaan(a)cs.ioc.ee] > Tallinn 12618, Estonia > > >

1 0

Looking for a PhD position in functional programming?
by John Hughes 25 Aug '11

25 Aug '11

We're advertising a position for a PhD student in the FP group at Chalmers, with closing date the 1st of September. Interested? Please apply! http://www.chalmers.se/cse/EN/news/vacancies/positions/phd-student-position… John Hughes

2 1

Haskell Weekly News: Issue 196
by Daniel Santa Cruz 25 Aug '11

25 Aug '11

Welcome to issue 196 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of August 14 to 20, 2011. [1] http://goo.gl/8hDku New and Updated Projects * graphziz (Update - Ivan Lazar Miljenovic) Wraper around Graphviz. [2] http://goo.gl/gg30u * TKYProf (New - Mitsutoshi Aoe) A web-based interactive visualizer for GHC time and allocation profiling. [3] http://goo.gl/Inqze Quotes of the Week * accel: next time I'll read a few research papers before I start trolling hakell * jmcarthur: your opinions all suck. i'm going back to #haskell (...) oh shit, i'm already there Top Reddit Stories * Haskell For Kids: Week 1 Domain: cdsmith.wordpress.com, Score: 37, Comments: 13 On Reddit: [4] http://goo.gl/RY6li Original: [5] http://goo.gl/azAVz * New IBM CPU has transactional memory built in Domain: nextbigfuture.com, Score: 35, Comments: 4 On Reddit: [6] http://goo.gl/cbjvN Original: [7] http://goo.gl/JOpWx * [GSoC] Text/UTF-8: Aftermath Domain: jaspervdj.be, Score: 32, Comments: 7 On Reddit: [8] http://goo.gl/MTHNy Original: [9] http://goo.gl/esQNO * CamHac post-hackathon report Domain: haskell.org, Score: 31, Comments: 8 On Reddit: [10] http://goo.gl/RHpfF Original: [11] http://goo.gl/GkVaa * GHC 7.4 won't have top-level MonoPatBinds anymore! Domain: hackage.haskell.org, Score: 25, Comments: 5 On Reddit: [12] http://goo.gl/bS1VL Original: [13] http://goo.gl/SK2Tz * Ending GSoC (cabal repl) Domain: lambdasandwich.blogspot.com, Score: 25, Comments: 1 On Reddit: [14] http://goo.gl/Rrzmj Original: [15] http://goo.gl/chb8A * If one of Haskell's goals is concurrency, then why is it based on the λ-calculus and not on a process calculus? Domain: en.wikipedia.org, Score: 23, Comments: 39 On Reddit: [16] http://goo.gl/Qjcgc Original: [17] http://goo.gl/ZSwt1 * University of Reddit Class: "Fixing Imperative Programmers" Domain: reddit.com, Score: 22, Comments: 2 On Reddit: [18] http://goo.gl/1hYlf Original: [19] http://goo.gl/26Qxd * A Command Line Reddit Viewer written in Haskell : programming (xpost : /programming ) Domain: reddit.com, Score: 22, Comments: 0 On Reddit: [20] http://goo.gl/bT9q8 Original: [21] http://goo.gl/VmVfA * Web-Based Environment for Gloss (Early Alpha: READ WARNINGS!) Domain: cdsmith.wordpress.com, Score: 21, Comments: 1 On Reddit: [22] http://goo.gl/e4Tjo Original: [23] http://goo.gl/wVA9H Top StackOverflow Questions * What are practical uses of applicative style? votes: 21, answers: 9 Read on SO: [24] http://goo.gl/Ms6fs * Functional equivalent of decorator pattern? votes: 20, answers: 7 Read on SO: [25] http://goo.gl/o8FhO * Why do 3 and x (which was assigned 3) have different inferred types in Haskell? votes: 18, answers: 2 Read on SO: [26] http://goo.gl/cm9av * Haskell tuple constructor (GHC) and the separation between a language and its implementation votes: 15, answers: 1 Read on SO: [27] http://goo.gl/tFvtk * Polymorphism within higher-order functions? votes: 13, answers: 1 Read on SO: [28] http://goo.gl/hNvkE * What happens to missing type variables in Church-style core? votes: 12, answers: 2 Read on SO: [29] http://goo.gl/kb2TM * Trying to implement Data.Either votes: 12, answers: 1 Read on SO: [30] http://goo.gl/lguDh * How can I make file I/O more transactional? votes: 11, answers: 2 Read on SO: [31] http://goo.gl/BjGFV * Trying to understand the types produced by monad transformers votes: 11, answers: 2 Read on SO: [32] http://goo.gl/YHsRQ * Why doesn't Safe Haskell support Template Haskell? votes: 11, answers: 1 Read on SO: [33] http://goo.gl/E1NCS About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18888 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91743 4. http://cdsmith.wordpress.com/2011/08/16/haskell-for-kids-week-1/ 5. http://www.reddit.com/r/haskell/comments/jlrva/haskell_for_kids_week_1/ 6. http://nextbigfuture.com/2011/08/ibm-plants-transactional-memory-in-cpu.htm… 7. http://www.reddit.com/r/haskell/comments/jperf/new_ibm_cpu_has_transactiona… 8. http://jaspervdj.be/posts/2011-08-19-text-utf8-the-aftermath.html 9. http://www.reddit.com/r/haskell/comments/jo6cd/gsoc_textutf8_aftermath/ 10. http://www.haskell.org/haskellwiki/CamHac/PostHackathonReport 11. http://www.reddit.com/r/haskell/comments/jj5lw/camhac_posthackathon_report/ 12. http://hackage.haskell.org/trac/ghc/ticket/2357#comment:11 13. http://www.reddit.com/r/haskell/comments/jkeqp/ghc_74_wont_have_toplevel_mo… 14. http://lambdasandwich.blogspot.com/2011/08/ending-gsoc.html 15. http://www.reddit.com/r/haskell/comments/jn8nl/ending_gsoc_cabal_repl/ 16. http://en.wikipedia.org/wiki/Process_calculus 17. http://www.reddit.com/r/haskell/comments/jlipx/if_one_of_haskells_goals_is_… 18. http://www.reddit.com/r/uorfip/ 19. http://www.reddit.com/r/haskell/comments/jok49/university_of_reddit_class_f… 20. http://www.reddit.com/r/programming/comments/jorky/a_command_line_reddit_vi… 21. http://www.reddit.com/r/haskell/comments/jouql/a_command_line_reddit_viewer… 22. http://cdsmith.wordpress.com/2011/08/14/haskell-for-kids-a-web-based-enviro… 23. http://www.reddit.com/r/haskell/comments/jis8g/webbased_environment_for_glo… 24. http://stackoverflow.com/questions/7103864/what-are-practical-uses-of-appli… 25. http://stackoverflow.com/questions/7064389/functional-equivalent-of-decorat… 26. http://stackoverflow.com/questions/7055146/why-do-3-and-x-which-was-assigne… 27. http://stackoverflow.com/questions/7086668/haskell-tuple-constructor-ghc-an… 28. http://stackoverflow.com/questions/7061538/polymorphism-within-higher-order… 29. http://stackoverflow.com/questions/7076517/what-happens-to-missing-type-var… 30. http://stackoverflow.com/questions/7121257/trying-to-implement-data-either 31. http://stackoverflow.com/questions/7059223/how-can-i-make-file-i-o-more-tra… 32. http://stackoverflow.com/questions/7088085/trying-to-understand-the-types-p… 33. http://stackoverflow.com/questions/7107308/why-doesnt-safe-haskell-support-…

1 0

Please take the State of Haskell, 2011 survey
by Johan Tibell 22 Aug '11

22 Aug '11

Hi all, I've put together a quick, 12-question State of Haskell, 2011 survey: http://blog.johantibell.com/2011/07/its-time-for-this-years-state-of.html The survey will hopefully give us some insight into how people use Haskell and perhaps also some ideas on how Haskell tools and libraries could be improved. This is the second year I run this survey. New from last year are specific questions on library support and reasoning about run-time performance. P.S. Please direct replies to this email to haskell-cafe(a)haskell.org. Cheers, Johan

1 1

[ANNOUNCE] network-address-0.1.0
by Sebastian Nowicki 22 Aug '11

22 Aug '11

Hi All, I have just released network-address-0.1.0. This is the first version of the package. The network-address library provides data structures for IP addresses as well as subnetworks. The goal is to have a generic library for representing network addresses in binary or textual form. Currently it supports IPv4 and IPv6 (partially). *Data.Network.Address> readAddress "127.0.0.1" :: IPv4 IPv4 2130706433 *Data.Network.Address> let ip = readAddress "127.0.0.1" :: IPv4 *Data.Network.Address> showAddress ip "127.0.0.1" *Data.Network.Address> let subnet = readSubnet "192.168.1.42/8" :: IPSubnet IPv4 *Data.Network.Address> subnet IPSubnet (IPv4 3232235776) (-256) *Data.Network.Address> showSubnet subnet "192.168.1.0/8" *Data.Network.Address> showAddress . base $ subnet "192.168.1.0" *Data.Network.Address> (readAddress "192.168.1.5" :: IPv4) `member` subnet True *Data.Network.Address> (readAddress "192.168.2.5" :: IPv4) `member` subnet False I was looking for an IPv4/IPv6 data structure, and found a few libraries such as network-data, iproute, and nettle-openflow. These libraries are either written for a specific purpose or bring along dependencies. I decided to create network-address to consolidate the data structures and make a lightweight, fast, generic and complete library for representing these addresses. This is my first public Haskell library. The API is unstable and possibly not idiomatic. I'd appreciate any feedback. Hackage: http://hackage.haskell.org/package/network-address GitHub: https://github.com/sebnow/haskell-network-address Regards, Sebastian

1 0

Extended Deadline: CFP 2011 Symposium on Implementation and Application of Functional Languages
by Andy Gill 21 Aug '11

21 Aug '11

The IFL deadline for submissions has been moved to the end of August. We already have a great program scheduled (to be posted shortly), and hope to get a few more interesting late additions because of this extension. CALL FOR PAPERS 23rd Symposium on Implementation and Application of Functional Languages (IFL 2011) October 3-5, 2011 University of Kansas Lawrence, Kansas, USA http://www.ittc.ku.edu/ifl2011 The Symposium returns to the US this year, hosted by the University of Kansas, in scenic Lawrence, Kansas. Lawrence is a lively college town less than an hour from Kansas City and the Kansas City International Airport (MCI). The symposium dates are October 3-5, 2011. The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2011 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2011 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2011 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues. Here we follow the ACM Sigplan republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. These revised submissions will be reviewed by the program committee using prevailing academic standards to select the best articles, which will appear in the formal proceedings. INVITED SPEAKER Bryan O-Sullivan, author of Real World Haskell, and co-founder of MailRank, Inc. TOPICS IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2011, please contact the PC chair at andygill(a)ittc.ku.edu. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation runtime function specialization runtime code generation partial evaluation (abstract) interpretation generic programming techniques automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques runtime profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques industrial applications of functional programming PAPER SUBMISSIONS Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Electrical Engineering and Computer Science of the University of Kansas. (We are more liberal with the draft proceedings, also accepting (for example) longer papers or SIGPLAN 2 column 12 page papers. For other formats contact the chair. For the consideration for the final proceedings, the 16 page LNCS format is required.) PETER LANDIN PRIZE The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. IMPORTANT DATES Presentation submission deadline: (new) August 31st, 2011 Notification of acceptance: (new) Within 24 hours of submission Early registration deadline: (new) September 16th, 2011 IFL 2011 Symposium: October 3-5, 2011 Submission for (post) review process: November 30th, 2011 Notification Accept/Reject: January 30th, 2012 Camera ready version: March 9th, 2012 PROGRAM COMMITTEE Torben Amtoft, Kansas State University Francesco Cesarini, Erlang Solutions Ltd Olaf Chitil, University of Kent Eelco Dolstra, Delft University of Technology Martin Erwig, Oregon State University Andy Gill, University of Kansas (Chair) Alwyn Goodloe, NASA Jurriaan Hage, Utrecht University Kevin Hammond, University of St. Andrews Bill Harrison, University of Missouri Ralf Hinze, Oxford University James Hook, Portland State University Garrin Kimmell, University of Iowa Andres Loh, Well-Typed LLP Rita Loogen, Philipps-University Marburg Neil Mitchell, Standard Chartered Rex Page, Oklahoma University Rinus Plasmeijer, Radboud University Nijmegen Sven-Bodo Scholz, University of Hertfordshire Mary Sheeran, Chalmers Satnam Singh, Microsoft Research Walid Taha, Halmstad University Simon Thompson, University of Kent Geoffrey Washburn, LogicBlox ---- Andy Gill, <andygill(a)ku.edu> Assistant Professor The University of Kansas, EECS Department Information and Telecommunication Technology Center http://www.ittc.ku.edu/csdl/fpg/Users/AndyGill

1 0

Haskell Weekly News: Issue 195
by Daniel Santa Cruz 18 Aug '11

18 Aug '11

Welcome to issue 195 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of August 7 to 13, 2011. [1] http://goo.gl/8hDku You can find a HTML rendition of this newsletter at: http://contemplatecode.blogspot.com/2011/08/haskell-weekly-news-issue-195.h… Announcements Luite Stegeman created a nifty tool called hdiff, which shows code changes between different versions of hackage packages. [2] http://goo.gl/uqh97 New and Updated Projects * Netwire (New - Ertugrul Soeylemez) Arrowised FRP library. [3] http://goo.gl/tVlsH * Snap Riak Extensions (New - Edward Tate). [4] http://goo.gl/O0C2A * time (Update - Ashley Yakeley) Adds "instance RealFrac DiffTime". [5] http://goo.gl/Wm3UY * file-location (Update - Greg Weber) Error and debug information for haskell that gives file locations. [6] http://goo.gl/fTG4P * HTTP (Update - Ganesh Sittampalam) Bumps base dependency to work with GHC 4.2.1 [7] http://goo.gl/bydXi * hslogger, convertible, HDBC, HDBC-odbc, HDBC-postgresql, HDBC-sqlite3 (Update - John Goerzen) Update license to BSD3. [8] http://goo.gl/sD0Qg * taffybar (New - Tristian Ravitch) Slightly fancier status bar for xmonad. [9] http://goo.gl/SlNgi Quotes of the Week * Brend: Whoever chose the title "A Gentle Introduction to Haskell" is obviously accustomed to wrestling bears in piranha pits or something. * kmc: compare "trifecta" "parsec" --> GT * elliott: ... demonstrating C++ templates' wide range of expressivity in applications from stupid compile-time hacks to _really_ stupid compile-time hacks * solrize: "The last good thing written in C was Schubert's Ninth Symphony." * cmccann: [I] learned Haskell mostly by typing a lot of really dumb things into an editor window, then feeding them to GHC Top Reddit Stories * Simon Marlow: “[…] I think I finally understand how to track call stacks properly in a lazy functional language. If this pans out, we'll get backtraces in GHCi and more accurate profiling” Domain: plus.google.com, Score: 121, Comments: 15 On Reddit: [10] http://goo.gl/0DTba Original: [11] http://goo.gl/yIhnI * A Very General Method of Computing Shortest Paths (the Gauss-Jordan-Floyd-Warshall- McNaughton-Yamada algorithm) Domain: r6.ca, Score: 41, Comments: 8 On Reddit: [12] http://goo.gl/dgW4s Original: [13] http://goo.gl/e8ZBF * I'm reading http://www.cs.ru.nl/~wouters/Publications/ThePowerOfPi.pdf What is this syntax called and where can I learn it? Domain: imgur.com, Score: 36, Comments: 15 On Reddit: [14] http://goo.gl/FpFIu Original: [15] http://goo.gl/CE9Dz * Simon Marlow: "If you're using GHC 7.2.1 and find a performance loss relative to an earlier GHC, trying playing around with the new stack option" Domain: plus.google.com, Score: 25, Comments: 8 On Reddit: [16] http://goo.gl/2FTsH Original: [17] http://goo.gl/CJZsR * In your haskell-dreams, how does a shell look? Domain: self.haskell, Score: 23, Comments: 43 On Reddit: [18] http://goo.gl/jGyqH Original: [19] http://goo.gl/jGyqH * SO: Converting floating point between Word and Float/Double (my poor, unanswered question!) Domain: stackoverflow.com, Score: 21, Comments: 3 On Reddit: [20] http://goo.gl/csKRb Original: [21] http://goo.gl/JFDn2 * Current status of gtk2hs? Domain: self.haskell, Score: 18, Comments: 10 On Reddit: [22] http://goo.gl/HFwCR Original: [23] http://goo.gl/HFwCR * (Live from CamHac) ANN: fclabels-1.0: First class accessor labels. Domain: hackage.haskell.org, Score: 13, Comments: 19 On Reddit: [24] http://goo.gl/FXdY6 Original: [25] http://goo.gl/Ijl4H * PhD Position availalble at Strathclyde Domain: lists.seas.upenn.edu, Score: 12, Comments: 2 On Reddit: [26] http://goo.gl/FbdNs Original: [27] http://goo.gl/0R8Vi * [GSoC] Text/UTF-8: Studying memory usage of a simple web server Domain: jaspervdj.be, Score: 9, Comments: 1 On Reddit: [28] http://goo.gl/HkcJL Original: [29] http://goo.gl/EQn9h * Arrow = Category + Applicative? (Part IIa) Domain: cdsmith.wordpress.com, Score: 9, Comments: 21 On Reddit: [30] http://goo.gl/hB6YY Original: [31] http://goo.gl/dBSuA Top StackOverflow Questions * Lazy Evaluation vs Macros votes: 19, answers: 5 Read on SO: [32] http://goo.gl/28jcJ * Comparison of Priority Queue implementations in Haskell votes: 16, answers: 1 Read on SO: [33] http://goo.gl/MyMp4 * Converting IEEE 754 floating point in Haskell Word32/64 to and from Haskell Float/Double votes: 16, answers: 4 Read on SO: [34] http://goo.gl/2YaVC * Applicatives compose, monads don't votes: 15, answers: 5 Read on SO: [35] http://goo.gl/Ncdij * How can I speed up my Haskell program (to the level of Python) votes: 13, answers: 3 Read on SO: [36] http://goo.gl/jOXnL * How does ArrowLoop work? Also, mfix? votes: 12, answers: 1 Read on SO: [37] http://goo.gl/JrFRX * How could I remove the "if … then … else …" keywords in Haskell (GHC)? votes: 9, answers: 3 Read on SO: [38] http://goo.gl/gjNrm * how to use hoogle locally (like ctags)? votes: 8, answers: 1 Read on SO: [39] http://goo.gl/IGVEW * Would a type class "between" Category and Arrow make sense? votes: 8, answers: 2 Read on SO: [40] http://goo.gl/zgb7w * Can I avoid "rightward drift" in Haskell? votes: 8, answers: 4 Read on SO: [41] http://goo.gl/pc0Bn * Haskell Polyvariadic Function With IO votes: 8, answers: 4 Read on SO: [42] http://goo.gl/dfUVv * Why don't Haskell compilers facilitate deterministic memory management? votes: 8, answers: 4 Read on SO: [43] http://goo.gl/uhqw6 * Defining a function a -> String, which works for types without Show? votes: 7, answers: 3 Read on SO: [44] http://goo.gl/Mjcfs * Haskell: List Comprehension to Combinatory votes: 7, answers: 3 Read on SO: [45] http://goo.gl/tLryK * Applicative without a functor votes: 7, answers: 3 Read on SO: [46] http://goo.gl/UcXZ5 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91658 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91525 4. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91576 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18880 6. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91590 7. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18883 8. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91621 9. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91672 10. https://plus.google.com/u/0/107890464054636586545/posts/XE4T6hHm3tK 11. http://www.reddit.com/r/haskell/comments/jdj2r/simon_marlow_i_think_i_final… 12. http://r6.ca/blog/20110808T035622Z.html 13. http://www.reddit.com/r/haskell/comments/jc7pb/a_very_general_method_of_com… 14. http://imgur.com/pPfjs 15. http://www.reddit.com/r/haskell/comments/jbfdc/im_reading/ 16. https://plus.google.com/107890464054636586545/posts/LqgXK77FgfV 17. http://www.reddit.com/r/haskell/comments/jfskp/simon_marlow_if_youre_using_… 18. http://www.reddit.com/r/haskell/comments/jce8q/in_your_haskelldreams_how_do… 19. http://www.reddit.com/r/haskell/comments/jce8q/in_your_haskelldreams_how_do… 20. http://stackoverflow.com/q/6976684/204932 21. http://www.reddit.com/r/haskell/comments/jd6wq/so_converting_floating_point… 22. http://www.reddit.com/r/haskell/comments/jgzcf/current_status_of_gtk2hs/ 23. http://www.reddit.com/r/haskell/comments/jgzcf/current_status_of_gtk2hs/ 24. http://hackage.haskell.org/package/fclabels-1.0 25. http://www.reddit.com/r/haskell/comments/jhoay/live_from_camhac_ann_fclabel… 26. http://lists.seas.upenn.edu/pipermail/types-announce/2011/002643.html 27. http://www.reddit.com/r/haskell/comments/jdjms/phd_position_availalble_at_s… 28. http://jaspervdj.be/posts/2011-08-09-text-utf8-memory-usage.html 29. http://www.reddit.com/r/haskell/comments/jdk6z/gsoc_textutf8_studying_memor… 30. http://cdsmith.wordpress.com/2011/08/13/arrow-category-applicative-part-iia/ 31. http://www.reddit.com/r/haskell/comments/ji8si/arrow_category_applicative_p… 32. http://stackoverflow.com/questions/7046950/lazy-evaluation-vs-macros 33. http://stackoverflow.com/questions/6976559/comparison-of-priority-queue-imp… 34. http://stackoverflow.com/questions/6976684/converting-ieee-754-floating-poi… 35. http://stackoverflow.com/questions/7040844/applicatives-compose-monads-dont 36. http://stackoverflow.com/questions/7003572/how-can-i-speed-up-my-haskell-pr… 37. http://stackoverflow.com/questions/6976944/how-does-arrowloop-work-also-mfix 38. http://stackoverflow.com/questions/6996286/how-could-i-remove-the-if-then-e… 39. http://stackoverflow.com/questions/6989668/how-to-use-hoogle-locally-like-c… 40. http://stackoverflow.com/questions/6997517/would-a-type-class-between-categ… 41. http://stackoverflow.com/questions/7008493/can-i-avoid-rightward-drift-in-h… 42. http://stackoverflow.com/questions/7030476/haskell-polyvariadic-function-wi… 43. http://stackoverflow.com/questions/7038811/why-dont-haskell-compilers-facil… 44. http://stackoverflow.com/questions/7005628/defining-a-function-a-string-whi… 45. http://stackoverflow.com/questions/7007222/haskell-list-comprehension-to-co… 46. http://stackoverflow.com/questions/7024788/applicative-without-a-functor

1 0

VSTTE 2012: Final Call for Papers - Submission Deadline: August 31
by Gudmund Grov 17 Aug '11

17 Aug '11

VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter Müller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Supérieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Université Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter Müller, ETH Zurich Tobias Nipkow, Technische Universität München Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Université Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

6 Month Postdoc Position
by Robert Atkey 17 Aug '11

17 Aug '11

6 Month Postdoc Position Mathematically Structured Programming Group University of Strathclyde Scotland We have the potential to apply for funds for a 6 month post doctoral position. The idea is that the successful candidate would spend those 6 months writing a full scale grant to fund themselves for the next 3 years. The postdoctoral position would be within the Mathematically Structured Programing group at the University of Strathclyde whose research focusses on category theory, type theory and functional programming. Current staff include Neil Ghani, Patricia Johann, Conor McBride, Peter Hancock, Robert Atkey and 6 PhD students. The candidate we are looking for should be highly self motivated and appreciate that without beauty, we are lost. Unfortunately, the deadline is extremely short and so any interested candidates should contact me immediately. I can then tell you more about what we would need to do. >From more information, please contact: Professor Neil Ghani ng(a)cis.strath.ac.uk http://personal.cis.strath.ac.uk/~ng/ http://msp.cis.strath.ac.uk/

1 0

ANNOUNCE: graphviz-2999.12.0.0
by Ivan Lazar Miljenovic 16 Aug '11

16 Aug '11

It's been a while in coming (I started work on this at the end of last year!) but I am pleased to announce the latest version of my graphviz library [1], which acts as a wrapper around the Graphviz [2] suite of graph visualisation utilities. [1] : http://projects.haskell.org/graphviz/ http://hackage.haskell.org/package/graphviz [2]: http://graphviz.org Major changes in this release (see the changelog [3] for a complete listing): * A large focus on increasing usability: - Examples for all Dot representations against an existing Dot graph - Cut-down, easier to use Attribute wrapper (all Attributes still available from Data.GraphViz.Attributes.Complete if you need any of the others). - graphElemsToDot helps visualise non-FGL graphs (if you can list all nodes and edges, you can visualise it!) * Two new Dot representations: - One that allows graph-based operations (based upon FGL) - Another based upon Andy Gill's dotgen [4] (with permission!) for easier embedding of relatively static graphs. * Pure Haskell implementations of `dot -Tcanon` and `tred`. * Now based upon Text rather than String, which improves performance for both printing and parsing and also enforces UTF-8 encoding. * Now easier to do custom I/O with Dot graphs. [3]: http://projects.haskell.org/graphviz/changelog.html [4]: http://hackage.haskell.org/package/dotgen Unfortunately, this release is largely backwards incompatible in some ways, but not too much. Specifically, it didn't take me long to migrate over Graphalyze [5] and SourceGraph [6], and most of that time was spent changing over to the new, nicer functions for creating Attributes. [5]: http://hackage.haskell.org/package/Graphalyze [6]: http://hackage.haskell.org/package/SourceGraph Please let me know if there are any other API improvements that you'd like to see to improve usage. I am planning a tutorial (half of the reason why this release took so long is that I kept thinking "this functionality would be useful for the tutorial!"; this includes the graph-based representation, the re-implementation of tred and canonicalisation, etc.), which should be out in the next month or so (I'm considering adding nicer syntax for record labels first). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0