October 2014 - Haskell

ANN: yi-0.10.0 , the text editor written in Haskell
by Mateusz Kowalczyk 14 Oct '14

14 Oct '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 We're glad to announce Yi 0.10.0. Yi is 10 years old today! Our main repository is at [1]. Yi compiles with GHC 7.6.3 all the way up to GHC 7.8.3. There have been many changes since the latest Hackage release (0.8.2). I inline the relevant part of the changelog at the bottom. We are slowly trying to populate the documentation pages: we have recently started using GitHub pages[2] for this purpose. Please have a look! On top of the issues listed in the changelog, a lot of issues were closed separately. If you had a pending issue, please check the issue tracker. As always we're looking for contributors: we have tasks in just about any area. Note that you don't even need to know Haskell to help us. Visit us on #yi on Freenode: be prepared to stay for more than 5 minutes. Installation instructions are available at [2]. If you're using nix, Yi 0.10.0 will be packaged shortly. 0.10.0 - ------ * Unicode syntax highlighting fixed (issue #82) * Hook to GTK Window exposed (#557) * Multiple components moved out to separate packages (oo-prototypes, word-trie, yi-languages, yi-string) * Replace a lot of the API to use YiString/Text instead of String improving performance * Greatly improve performance in the pango front-end as long as line-wrapping is on (default) * Recognise read-only files (#145) * Various Vim keymap improvements and fixes * Use lens instead of uniplate, replace some boilerplate with lens * Improve test framework to handle windows interactions, e.g. scrolling. * Use GHC.Generics instead of derive on GHC 7.8 * Remove bitrotten ghcapi and scion flags. * Support non-qwerty vim users * Support eventlog profiling with -feventlog * Eliminate idle CPU consumption in vty frontend * General cleanup * Make C-w closer to actual emacs behaviour (#612) * Make M-h behave more like emacs (#611) * Hint with buffer names when using C-k with emacs keymap (#606) * Fix display of paths starting with / (#528) * Don't mark buffer as changed if nothing was killed (#618) * Nicer findFile &c behaviour in dired buffers (#149) * Implement C-a for CUA (#167) * Fix dired for directories with unicode files/dirs (#445) * Fix vim indenting under some circumstances (#621) * Allow the font size to be changed per buffer (#608) * Double-click and triple-click selection in pango (#100 and #101) * Count columns properly in presence of tabs (#440) * Extra marking operations in dired Contributors: Alan Zimmerman, Anders Papitto, Anthony Quizon, Ben Armston, Benno Fünfstück, Carter Charbonneau, Corey O'Connor, Cray Elliott, Dmitry Ivanov, fiendfan1, Ilya Smelkov, Jakub Arnold, Jared Hance, jetho, Mateusz Kowalczyk, Richard Goulter, Ryan Desfosses, Siddhanathan Shanmugam 0.9.0 - ----- * Vim keymap removed. Vim2 is now called Vim. [1]: https://github.com/yi-editor/yi [2]: http://yi-editor.github.io/ - -- Mateusz K. -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQIcBAEBAgAGBQJUPWXYAAoJEM1mucMq2pqXgzcP/0iljWag1qweflSYIqKa+FOc n/NYTqUV3HIYSGxolUvnm5HMfJ1uFFYmV7BVEtC7VcdntdP/bUCxu2gdOA9XxIrL JFwV3tzvLFqPYsm0bBVwq+lqRaBF2ICK95gmZpE+Osw7lrIK0SwibGAuLL+niRoo Qf5duTZXMBw0gQxay47zAb1XPwUhLYQUThSnbcOAG1raRI3OCV/eyMky+l5WMLTy 3RK5j2ZsWnps9k1XOFBVR/pQ6kJiFrButfLY7c3RBbfY9+uHQDN1ba3hr3wHsXUP fw4PiM6WmHecezH1Q7TSzH0XL+Mh5miM+g2QGphKAjeACOzskiCYRGcBpUCHSPsO EdxHe62oUvonEPAP747lCMRcYURknvoyVCDKjYzNKFBHJPFAizWW+tlv82QKKT1j CKECN7Lkra3nlLKzi11TdLHMUDGmatJeNHUMp4W1EDGG/hRbobrmD+2U2Yt/pRKH f/tSeE5Azk0xjDMNmYZBprqf1O1Q9tve4NrIHgQK0EXRWhkcFAsGIdqQBHP27Z0s JdCXdlMaRs4u2IfYoDevnFadMGF10oqQ1wUJPtIzcVvghgBkZEIMswsqbD5fTtPf Y/DFe2YcJl+lxPqgm/fq3aDnJABGYLftfJ05Rs1BGA909bnW29YqK0Si8JxAoH4R K6YQBTpqWULfHXh/ZQ68 =CAHP -----END PGP SIGNATURE-----

1 0

Mathematics of Program Construction (MPC 2015): first call for papers
by José Pedro Magalhães 10 Oct '14

10 Oct '14

Apologies for multiple copies. FIRST CALL FOR PAPERS 12th International Conference on Mathematics of Program Construction (MPC 2015) Königswinter, Germany, 29 June - 1 July 2015 http://www.cs.ox.ac.uk/conferences/MPC2015/ BACKGROUND The MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2015 MPC conference will be held in Königswinter, Germany, from 29th June to 1st July 2015. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), Québec City, Canada (2010, colocated with AMAST), and Madrid, Spain (2012). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. We also encourage the submission of "pearls": elegant, instructive, and fun essays on the mathematics of program construction. IMPORTANT DATES * Submission of abstracts: 26 January 2015 * Submission of full papers: 2 February 2015 * Notification to authors: 16 March 2015 * Final version: 13 April 2015 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 26 January 2015. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 2 February 2015. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (https://easychair.org/conferences/?conf=mpc2015) Papers must report previously unpublished work, and must not be submitted concurrently to a journal or to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2015(a)easychair.org with any questions about academic matters. The proceedings of MPC 2015 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Ralf Hinze University of Oxford, UK (chair) Eerke Boiten University of Kent, UK Jules Desharnais Université Laval, Canada Lindsay Groves Victoria University of Wellington, New Zealand Zhenjiang Hu National Institute of Informatics, Japan Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht University and Open University, The Netherlands Jay McCarthy Vassar College, US Bernhard Möller Universität Augsburg, Germany Shin-Cheng Mu Academia Sinica, Taiwan Dave Naumann Stevens Institute of Technology, US Pablo Nogueira Universidad Politécnica de Madrid, Spain Ulf Norell University of Gothenburg, Sweden Bruno C. d. S. Oliveira The University of Hong Kong, Hong Kong José Nuno Oliveira Universidade do Minho, Portugal Alberto Pardo Universidad de la República, Uruguay Christine Paulin-Mohring INRIA-Université Paris-Sud, France Tom Schrijvers KU Leuven, Belgium Emil Sekerinski McMaster University, Canada Tim Sheard Portland State University, US Anya Tafliovich University of Toronto Scarborough, Canada Tarmo Uustalu Institute of Cybernetics, Estonia Janis Voigtländer Universität Bonn, Germany VENUE The conference will take place in Königswinter, Maritim Hotel, where accommodation has been reserved. Königswinter is situated on the right bank of the river Rhine, opposite Germany's former capital Bonn, at the foot of the Siebengebirge. LOCAL ORGANIZERS Ralf Hinze University of Oxford, UK (co-chair) Janis Voigtländer Universität Bonn, Germany (co-chair) José Pedro Magalhães University of Oxford, UK Nicolas Wu University of Oxford, UK For queries about local matters, please write to jv(a)informatik.uni-bonn.de.

1 0

Re: [Haskell] [Haskell-cafe] What happened to hugs?
by Gershom B 10 Oct '14

10 Oct '14

I’m happy to announce that http://www.haskell.org/hugs has now been resuscitated, and should contain complete documentation and downloads for the Hugs system. Furthermore we’re working on putting put in place a redirect so that http://cvs.haskell.org will be able to point to the new location to keep older links intact. If there are any other stale links anyone would like patched up or binary releases that people feel should be pointed to, please let us know at admin(a)haskell.org. -gershom On September 25, 2014 at 11:57:58 PM, Rustom Mody (rustompmody(a)gmail.com) wrote: > On Thu, Sep 11, 2014 at 2:03 AM, Thorsten Rangwich > > wrote: > > > Hi, > > > > I suppose this question is not new, but neither google nor a manual search > > file be file through the archives brought enlightement. > > > > www.haskell.org/hugs > > > > still exists, but none of the links there does work. Documentation and > > source point to cvs.haskell.org ("server does not exist") and development > > points to http://hackage.haskell.org/trac/hugs ("page does not exist"). > > > > Was it migrated to somewhere else or is it dead - in latter case the page > > would not make sense any more. > > > > > > Sad that hugs links are now dead. > > There is still gofer (the predecessor to hugs). > The original of Mark Jones and modifications made by me in the early 90s > and the whys of these modifications are at > http://blog.languager.org/2014/09/pugofer.html > > > > "Raskell" (iPad app) provided a development environment usinh hugs, so I > > would at least like to install hugs on my Mac as well... > > > > Dont know about macs but last I knew it was compiling with gcc on linux > (in all of 10 seconds!) > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

1 0

ICFP 2015 Call for Workshop and Co-located Event Proposals
by David Van Horn 10 Oct '14

10 Oct '14

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2015 20th ACM SIGPLAN International Conference on Functional Programming August 30 - September 5, 2015 Vancouver, Canada http://icfpconference.org/icfp2015/ The 120th ACM SIGPLAN International Conference on Functional Programming will be held in Vancouver, British Columbia, Canada on August 30-September 5, 2015. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2015 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on August 30 (the day before ICFP) and September 3-5 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 16, 2014 Notification of acceptance: December 15, 2014 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2015 workshop co-chairs (Tom Schrijvers and Nicolas Wu), via email to icfp2015-workshops(a)cs.kuleuven.be by November 16, 2014. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 15, 2014, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2015/icfp15-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Guidelines/Workshops ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2015 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Tom Schrijvers (KU Leuven) Workshop Co-Chair: Nicolas Wu (University of Oxford) General Chair: Kathleen Fisher (Tufts University) Program Chair: John Reppy (University of Chicago) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Tom Schrijvers and Nicolas Wu), via email to icfp2015-workshops(a)cs.kuleuven.be.

1 0

Haskell Weekly News: Issue 309
by Daniel Santa Cruz 09 Oct '14

09 Oct '14

Welcome to issue 309 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from September 28 to October 4, 2014 Quotes of the Week * Uh... I'ma have to read the IRC logs... No good quotes @remember'd Top Reddit Stories * Announcing needle: ASCII-fied arrow notation Domain: scrambledeggsontoast.github.io, Score: 103, Comments: 119 Original: [1] http://goo.gl/wCPh8K On Reddit: [2] http://goo.gl/UwTJSt * How we might abolish Cabal Hell, part 1 Domain: well-typed.com, Score: 95, Comments: 69 Original: [3] http://goo.gl/N19hPq On Reddit: [4] http://goo.gl/CQQRF0 * After some failed attempts to learn Parsec I came across this incredibly patient tutorial and now I'm writing parsers! Domain: github.com, Score: 79, Comments: 17 Original: [5] http://goo.gl/msqtkb On Reddit: [6] http://goo.gl/p3EgqQ * Neil Mitchell's Haskell Blog: Why Traversable/Foldable should not be in the Prelude Domain: neilmitchell.blogspot.co.il, Score: 71, Comments: 289 Original: [7] http://goo.gl/sykNse On Reddit: [8] http://goo.gl/4wIxBX * Tutorial: Implementing highly efficient data structures with Monoids and Fingertrees Domain: codementor.io, Score: 47, Comments: 37 Original: [9] http://goo.gl/WB7Jwg On Reddit: [10] http://goo.gl/jGrLX1 * There is No Haskell Topology Domain: immanence.org, Score: 45, Comments: 32 Original: [11] http://goo.gl/JAoEDw On Reddit: [12] http://goo.gl/wuuF4i * Introduction to Low Level Haskell Optimization - Dan Doel Domain: youtu.be, Score: 44, Comments: 2 Original: [13] http://goo.gl/vYS1Hy On Reddit: [14] http://goo.gl/dG9Pn5 * Turn an optparse-applicative program into a CGI program! Domain: github.com, Score: 39, Comments: 10 Original: [15] http://goo.gl/sjCqsb On Reddit: [16] http://goo.gl/BXxeno * Yesod 1.4 released Domain: yesodweb.com, Score: 36, Comments: 1 Original: [17] http://goo.gl/T5Vqe8 On Reddit: [18] http://goo.gl/977ey0 * Updating Auto-Update Domain: yesodweb.com, Score: 36, Comments: 20 Original: [19] http://goo.gl/OwOrGZ On Reddit: [20] http://goo.gl/J2zr5n * Type-safe Routing for Spock Web Framework released Domain: github.com, Score: 32, Comments: 39 Original: [21] http://goo.gl/QZS9gU On Reddit: [22] http://goo.gl/BokvJ8 * Lattice-Based Data Structures for Deterministic Parallel and Distributed Programming (related to CRDTs; implementation in Haskell) Domain: composition.al, Score: 30, Comments: 9 Original: [23] http://goo.gl/mVQqqX On Reddit: [24] http://goo.gl/tZ0XrW * A non-recursive sorting algorithm Domain: haskellexists.blogspot.com, Score: 27, Comments: 36 Original: [25] http://goo.gl/jD0z0K On Reddit: [26] http://goo.gl/3HpTBy * Dijkstra monads Domain: why-lambda.blogspot.co.uk, Score: 25, Comments: 4 Original: [27] http://goo.gl/kx1Q6w On Reddit: [28] http://goo.gl/C86igH * Improving Haskell-related documentation Domain: self.haskell, Score: 23, Comments: 62 Original: [29] http://goo.gl/rQeuUT On Reddit: [30] http://goo.gl/rQeuUT * Haskell, Monads and Purity • via Hacker News Domain: jelv.is, Score: 23, Comments: 11 Original: [31] http://goo.gl/vm7juH On Reddit: [32] http://goo.gl/1P5OgF * FP Complete is hiring: Systems engineer for cloud and cluster work Domain: fpcomplete.com, Score: 21, Comments: 11 Original: [33] http://goo.gl/MLT5Ud On Reddit: [34] http://goo.gl/Ql8uIX * The future of the haskell2010/haskell98 packages for GHC 7.10 Domain: haskell.org, Score: 21, Comments: 22 Original: [35] http://goo.gl/94bnK3 On Reddit: [36] http://goo.gl/0c80JU * ANN: Nomyx V0.7, the only game where you can change the rules Domain: self.haskell, Score: 20, Comments: 7 Original: [37] http://goo.gl/1gGtqb On Reddit: [38] http://goo.gl/1gGtqb * Let's Build a Browser Engine in Haskell: part 5 Domain: hrothen.github.io, Score: 19, Comments: 6 Original: [39] http://goo.gl/zzSF2D On Reddit: [40] http://goo.gl/9xzqdR Top StackOverflow Questions * How fundamentaly different push-pull and arrowized FRP are? votes: 10, answers: 0 Read on SO: [41] http://goo.gl/XbbbVW * What are hashes (#) used for in Haskell's library's source? votes: 10, answers: 1 Read on SO: [42] http://goo.gl/mvNNlb * What is the inverse of a promise? votes: 9, answers: 3 Read on SO: [43] http://goo.gl/usQIiW * Is there a default polymorphic unit type haskell votes: 7, answers: 1 Read on SO: [44] http://goo.gl/5Ozy9G * nvcc + c2hs on OS X 10.9.5 votes: 7, answers: 1 Read on SO: [45] http://goo.gl/0XMNFu * How to sort a list using partial order in Haskell? votes: 7, answers: 2 Read on SO: [46] http://goo.gl/GLMiwA * Relationship between forward and backward map in Isomorphism (Lens package) votes: 6, answers: 1 Read on SO: [47] http://goo.gl/icIdIR * How to implement a generic neural network efficiently in Haskell? votes: 6, answers: 0 Read on SO: [48] http://goo.gl/HIHY8e * How do I unify two or more Signals in elerea? votes: 6, answers: 1 Read on SO: [49] http://goo.gl/jacb0r * Ambiguous type variable fixed with type equality constraint votes: 6, answers: 1 Read on SO: [50] http://goo.gl/JADmBj Until next time, [51]+Daniel Santa Cruz References 1. http://scrambledeggsontoast.github.io/2014/09/28/needle-announce/ 2. http://www.reddit.com/r/haskell/comments/2hpzpu/announcing_needle_asciified… 3. http://www.well-typed.com/blog/2014/09/how-we-might-abolish-cabal-hell-part… 4. http://www.reddit.com/r/haskell/comments/2hvm59/how_we_might_abolish_cabal_… 5. https://github.com/JakeWheat/intro_to_parsing 6. http://www.reddit.com/r/haskell/comments/2ia5u2/after_some_failed_attempts_… 7. http://neilmitchell.blogspot.co.il/2014/10/why-traversablefoldable-should-n… 8. http://www.reddit.com/r/haskell/comments/2hzqii/neil_mitchells_haskell_blog… 9. https://www.codementor.io/haskell-tutorial/monoids-fingertrees-implement-ab… 10. http://www.reddit.com/r/haskell/comments/2i3ttm/tutorial_implementing_highl… 11. http://immanence.org/post/there-is-no-haskell-topology/ 12. http://www.reddit.com/r/haskell/comments/2i85k7/there_is_no_haskell_topolog… 13. http://youtu.be/McFNkLPTOSY 14. http://www.reddit.com/r/haskell/comments/2hy6cp/introduction_to_low_level_h… 15. https://github.com/maxpow4h/webcloud#webcloud 16. http://www.reddit.com/r/haskell/comments/2huhrg/turn_an_optparseapplicative… 17. http://www.yesodweb.com/blog/2014/09/announcing-yesod-1-4 18. http://www.reddit.com/r/haskell/comments/2hvoxb/yesod_14_released/ 19. http://www.yesodweb.com/blog/2014/10/updating-auto-update 20. http://www.reddit.com/r/haskell/comments/2i5d7m/updating_autoupdate/ 21. https://github.com/agrafix/Spock 22. http://www.reddit.com/r/haskell/comments/2i2zfw/typesafe_routing_for_spock_… 23. http://composition.al/blog/2014/09/29/my-thesis-defense-talk/ 24. http://www.reddit.com/r/haskell/comments/2i17zj/latticebased_data_structure… 25. http://haskellexists.blogspot.com/2014/09/a-non-recursive-sorting-algorithm… 26. http://www.reddit.com/r/haskell/comments/2hsea9/a_nonrecursive_sorting_algo… 27. http://why-lambda.blogspot.co.uk/2014/09/dijkstra-monads.html 28. http://www.reddit.com/r/haskell/comments/2hzu5b/dijkstra_monads/ 29. http://www.reddit.com/r/haskell/comments/2i1z9u/improving_haskellrelated_do… 30. http://www.reddit.com/r/haskell/comments/2i1z9u/improving_haskellrelated_do… 31. http://jelv.is/blog/Haskell-Monads-and-Purity/ 32. http://www.reddit.com/r/haskell/comments/2i8tnl/haskell_monads_and_purity_v… 33. https://www.fpcomplete.com/page/systems-engineer 34. http://www.reddit.com/r/haskell/comments/2hz6ue/fp_complete_is_hiring_syste… 35. http://www.haskell.org/pipermail/glasgow-haskell-users/2014-September/02528… 36. http://www.reddit.com/r/haskell/comments/2i0bhr/the_future_of_the_haskell20… 37. http://www.reddit.com/r/haskell/comments/2hw529/ann_nomyx_v07_the_only_game… 38. http://www.reddit.com/r/haskell/comments/2hw529/ann_nomyx_v07_the_only_game… 39. http://hrothen.github.io/2014/10/01/lets-build-a-browser-engine-in-haskell-… 40. http://www.reddit.com/r/haskell/comments/2i0wnr/lets_build_a_browser_engine… 41. http://stackoverflow.com/questions/26164135/how-fundamentaly-different-push… 42. http://stackoverflow.com/questions/26169990/what-are-hashes-used-for-in-has… 43. http://stackoverflow.com/questions/26084439/what-is-the-inverse-of-a-promise 44. http://stackoverflow.com/questions/26097797/is-there-a-default-polymorphic-… 45. http://stackoverflow.com/questions/26125870/nvcc-c2hs-on-os-x-10-9-5 46. http://stackoverflow.com/questions/26158233/how-to-sort-a-list-using-partia… 47. http://stackoverflow.com/questions/26082221/relationship-between-forward-an… 48. http://stackoverflow.com/questions/26092063/how-to-implement-a-generic-neur… 49. http://stackoverflow.com/questions/26104735/how-do-i-unify-two-or-more-sign… 50. http://stackoverflow.com/questions/26146983/ambiguous-type-variable-fixed-w… 51. https://plus.google.com/105107667630152149014/about

1 0

PLT Redex: The Summer School, Call for Participation
by Robby Findler 07 Oct '14

07 Oct '14

PLT REDEX: THE SUMMER SCHOOL CALL for PARTICIPATION Matthias Felleisen, Robert Bruce Findler, Matthew Flatt LOCATION: University of Utah, Salt Lake City DATES: July 27 - July 31, 2015 http://www.cs.utah.edu/~mflatt/plt-redex/ PLT Redex is a lightweight, embedded DSL for modeling programming languages, their reduction semantics, and their type systems. It comes with an IDE and a toolbox for exploring, testing, debugging, and type-setting language models. The PLT research group has successfully used Redex to model and analyze a wide spectrum of published models. The summer school will introduce students to the underlying theory of reduction semantics, programming in the Redex language, and using its tool suite effectively. The course is intended for PhD students and researchers in programming languages. Enrollment is limited to 25 attendees. While the workshop itself is free, attendees must pay for travel, room, and board. We expect room and board to be around $500, assuming an arrival in the evening of Sunday July 26 and leaving Friday July 31 or August 1. Partial financial support for PhD students is available. To register, send email to Matthew Flatt (mflatt(a)cs.utah.edu) If you are a PhD student and requesting financial support, CC your advisor and ask for a one-line confirmation email. Literature Matthias Felleisen, Robert Bruce Findler, Matthew Flatt. Semantics Engineering with PLT Redex. MIT Press, 2012. Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler. Run Your Research: On the Effectiveness of Lightweight Mechanization. POPL 2012.

1 0

NFM 2015 - 3rd call for papers
by Klaus Havelund 04 Oct '14

04 Oct '14

CALL FOR PAPERS The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 27 – 29 April 2015 Pasadena, California, USA Paper Submission: 10 Nov 2014 THEME The widespread use and increasing complexity of mission- and safety-critical systems require advanced techniques that address their specification, verification, validation, and certification. The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. Within NASA such systems include for example autonomous robots, separation assurance algorithms for aircraft, Next Generation Air Transportation (NextGen), and autonomous rendezvous and docking for spacecraft. Moreover, emerging paradigms such as property-based design, code generation, and safety cases are bringing with them new challenges and opportunities. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other mission- and safety-critical systems in all design life-cycle stages. We encourage submissions on cross-cutting approaches marrying formal verification techniques with advances in critical system development, such as requirements generation, analysis of aerospace operational concepts, and formal methods integrated in early design stages and carrying throughout system development. TOPICS Topics of interest include, but are not limited to: Model checking Theorem proving SAT and SMT solving Symbolic execution Static analysis Runtime verification Program refinement Compositional verification Modeling and specification formalisms Model-based development Model-based testing Requirement engineering Formal approaches to fault tolerance Security and intrusion detection Applications of formal methods to aerospace systems Applications of formal methods to cyber-physical systems Applications of formal methods to human-machine interaction analysis INVITED SPEAKERS Dino Distefano Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK. Viktor Kuncak Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland. Rob Manning Chief Engineer at NASA/JPL. IMPORTANT DATES Paper Submission: 10 Nov 2014 Paper Notifications: 12 Jan 2015 Camera-ready Papers: 9 Feb 2015 Symposium: 27 – 29 April 2015 LOCATION AND COST The symposium will take place at the Hilton Hotel, Pasadena, California, USA, April 27-29, 2015. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to submit, to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. SUBMISSION DETAILS There are two categories of submissions: - Regular papers describing fully developed work and complete results (15 pages) - Short papers describing tools, experience reports, or descriptions of work in progress with preliminary results (6 pages) All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in a volume of Springer’s Lecture Notes on Computer Science (LNCS), and must use LNCS style formatting. Papers should be submitted in PDF format. PROGRAMME COMMITTEE Erika Abraham, RWTH Aachen University, Germany Julia Badger, NASA Johnson Space Center, USA Christel Baier, Technische Universität Dresden, Germany Saddek Bensalem, VERIMAG/UJF, France Dirk Beyer, University of Passau, Germany Armin Biere, Johannes Kepler University, Austria Nikolaj Bjorner, Microsoft Research, USA Borzoo Bonakdarpour, McMaster University, Canada Alessandro Cimatti, Fondazione Bruno Kessler, Italy Leonardo de Moura, Microsoft Research, USA Ewen Denney, NASA Ames Research Center, USA Ben Di Vito, NASA Langley Research Center, USA Dawson Engler, Stanford University, USA Jean-Christophe Filliatre, Université Paris-Sud, France Dimitra Giannakopoulou, NASA Ames Research Center, USA Alwyn Goodloe, NASA Langley Research Center, USA Susanne Graf, VERIMAG, France Alex Groce, Oregon State University, USA Radu Grosu, Vienna University of Technology, Austria John Harrison, Intel Corporation, USA Mike Hinchey, University of Limerick/Lero, Ireland Bart Jacobs, University of Leuven, Belgium Sarfraz Khurshid, The University of Texas at Austin, USA Gerwin Klein, NICTA, Australia Daniel Kroening, Oxford University, UK Orna Kupferman, Hebrew University Jerusalem, Israel Kim Larsen, Aalborg University, Denmark Rustan Leino, Microsoft Research, USA Martin Leucker, University of Lubeck, Germany Rupak Majumdar, Max Planck Institute, Germany Pete Manolios, Northeastern University, USA Peter Mueller, ETH Zurich, Switzerland Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Doron Peled, Bar Ilan University, Israel Suzette Person, NASA Langley Research Center, USA Andreas Podelski, University of Freiburg, Germany Grigore Rosu, University of Illinois, USA Kristin Yvonne Rozier, NASA Ames Research Center, USA Natarajan Shankar, SRI International, USA Natasha Sharygina, University of Lugano, Switzerland Scott Smolka, Stony Brook University, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Mike Whalen, University of Minnesota, USA Jim Woodcock, University of York, UK PC CHAIRS Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Rajeev Joshi, NASA Jet Propulsion Laboratory PUBLICITY SUPPORT Ylies Falcone, Universite Joseph Fourier, France STEERING COMMITTEE Julia Badger, NASA Johnson Space Center Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center Suzette Person, NASA Langley Research Center Kristin Yvonne Rozier, NASA Ames Research Center ---

1 0

Call for Contributions - Haskell Communities and Activities Report, November 2014 edition
by Mihai Maruseac 04 Oct '14

04 Oct '14

Dear all, We would like to collect contributions for the 27th edition of the ============================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 Nov 2014 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ============================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell us, so that we can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the previous edition --- you will find interesting projects described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Mihai Maruseac and Alejandro Serrano Mena FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2014/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2014/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should soon receive your old entry as a template (provided we have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please use lhs2tex syntax (http://www.andres-loeh.de/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also simply ask us. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell us that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached its destination, and not ended up in a spam folder? A: Prior to publication of the final report, we will send a draft to all contributors, for possible corrections. So if you do not hear from us within two weeks after the deadline, it is safer to send another mail and check whether your first one was received. -- Mihai Maruseac (MM) "If you don't know, the thing to do is not to get scared, but to learn." -- Atlas Shrugged.

1 0

ANN: New version of graphmod (1.2.4)
by Iavor Diatchki 03 Oct '14

03 Oct '14

Hello, I am pleased to announce a new version of `graphmod`---a program that helps you visualize the import dependencies between the modules in your Haskell programs. The new feature in version 1.2.4 is support for pruning the dependency graph, which is enabled with the flag -p or --prune-edges. When this option is selected, `graphmod` will ignore imports to modules that are already imported by some of the dependencies of the module. For example, consider the following modules: module A where { import B; import C } module B where { import C } module C where { } When generated with `--prune-edges`, the resulting graph will be: A -> B -> C Note that there is no edge from `A` to `C`, because `C` is already imported by `B`. Happy hacking, -Iavor

1 0

Call for Workshop Proposals - SERA 2015
by Slim Kallel 02 Oct '14

02 Oct '14

The 13th International Conference on Software Engineering Research, Management and Applications (SERA 2015) will take place in Hammamet, Tunisia, May 13-15, 2015. We are inviting you to submit a workshop proposal. http://sera2015.redcad.org/ * Scope and Goal SERA 2015 provides an international forum where engineers, researchers, and advanced graduate students are invited to present their experiences and their recent advances and latest research results related to all aspects of software engineering research and applications. The SERA workshops offer a venue where participants are given the opportunity to present and discuss new ideas and emerging topics in the field of Software Engineering, Management and Applications. The workshops will be held in conjunction with the main conference. They are designed to provide an opportunity for in-depth discussion of current and emerging topics of interest to the SERA community. * Important Dates Proposal due: December 01, 2014 Notification: December 15, 2014 * Writing a Proposal Each workshop proposal (2-4 pages total length) should include the following information: - Title of the workshop - An abstract giving the goals and scope of the workshop - Description of the workshop content and topics - Names, short biographies, and contact information of the workshop chair(s). - List of program committee members. Members should be from multiple countries. - History of the workshop if this is not the first instance - Relevant previous experience of the organizing committee - Contact information of the workshop organizer(s). * Responsibilities of the Workshop Organizers The workshop organizers are responsible for: - Writing and disseminating the call-for-papers. The call should make it clear that at least one author of any accepted paper must attend the event - Development and publishing of a workshop web site with all the relevant information - Review process and selection of accepted paper - Defining the workshop program and scheduling the presentations * Responsibilities of the SERA 2015 Organizing Committee The SERA 2015 organizing committee will be responsible for the following: - Providing publicity for the workshop series as a whole. - Providing logistics support and a meeting place for the workshop. - In conjunction with the organizers, determining the start and end times of the workshop. * Submitting a Proposal All workshop proposals should be sent by E-Mail to the workshop co-chairs : - Anis Charfi, SAP Darmstadt, Germany anis.charfi [at] sap.com - Hatem Hadj Kacem, University of Sfax, Tunisia hatem.hadjkacem [at] fsegs.rnu.tn

1 0