- Haskell - Haskell.org

Position in foundations of software and programming languages
by Gunnar Brinkmann 06 May '15

06 May '15

Dear subscribers of the haskell mailing list, Ghent University has an opening for a full time tenure track position in "foundations of software and programming languages". Details can be found at http://www.ugent.be/en/work/vacancies/professorial-staff/foundations-of-sof… Additional question can be posed to Gunnar.Brinkmann(a)ugent.be. With kind regards, Gunnar Brinkmann -- Gunnar Brinkmann Applied Mathematics, Computer Science and Statistics Ghent University Krijgslaan 281 - S9 B - 9000 Ghent email: Gunnar.Brinkmann(a)UGent.be phone: +32-9-264.48.07, Fax: +32-9-264.49.95

1 0

Summer School on Generic and Effectful Programming
by Maciej Pirog 05 May '15

05 May '15

Call for Participation SUMMER SCHOOL ON GENERIC AND EFFECTFUL PROGRAMMING St Anne's College, Oxford, 6th to 10th July 2015 http://www.cs.ox.ac.uk/projects/utgp/school/ TOPIC Generic programming is a technique that exploits the inherent structure that exists in data, to automatically produce efficient and flexible algorithms that can be adapted to suit different needs. The goal of this school is to explore datatype-generic programming and related topics from a variety of different angles, emphasizing in particular the interplay of generics and effects. This summer school is the closing activity of the EPSRC-funded project "Unifying Theories of Generic Programming" at Oxford University. LECTURERS Six lecturers from the Programming Languages community, each an acknowledged expert in their specialism, will cover various aspects of generic and effectful programming. Each will give about four hours' lectures, distributed throughout the week. Edwin Brady (University of St Andrews) "Embedded Domain-Specific Languages in Idris" Fritz Henglein (University of Copenhagen) "Worst-case Efficient Generic Functional Programming on Bulk Data" Andres Löh (Well-Typed) "Applying Type-level and Generic Programming in Haskell" Conor McBride (University of Strathclyde) "Datatypes of Datatypes" Don Syme (Microsoft Research) "Compile-time Meta-programming for the Information-rich World" Tarmo Uustalu (Tallinn University of Technology) "Containers for Effects and Contexts" PREREQUISITES The school is aimed at doctoral students in programming languages and related areas; however, researchers and practitioners will be very welcome, as will strong masters students with the support of a supervisor. It will be assumed that participants have a good understanding of typed functional programming, as in Haskell, O'Caml, or F#. DATES Registration deadline: 21st June 2015 School: 6th July (9am) to 10th July 2015 (lunchtime) COSTS Costs will be kept low, thanks to support from EPSRC. There will be a nominal registration fee of £135, and B&B accommodation in college will be £75 (ensuite) or £48 (shared bathroom) per night. We can accept at most 50 participants; places will be allocated on a first-come, first-served basis. FURTHER INFORMATION Further information, including instructions on how to register, is available at the website: http://www.cs.ox.ac.uk/projects/utgp/school/

1 0

Call for participation (FCRC+LCTES)
by Klaus Havelund 04 May '15

04 May '15

FCRC’15 <http://fcrc.acm.org/> Early bird registration is now open for FCRC 2015, the event that assembles a spectrum of affiliated research conferences and workshops into a week-long coordinated meeting. FCRC 2015 will be held at the Oregon Convention Center, in Portland, Oregon from June 13 – 19, 2015. Early Registration ends May 18th. This year’s plenary speakers include: Michael Stonebraker, MIT CSAIL, 2014 ACM Turing Award Winner, who will deliver the 2014 ACM Turing Lecture; Andrew Yao, Tsinghua University; Olivier Temam, Google; Don Syme, Microsoft Research; Kathy Yelick, University of California at Berkeley and Balaji Prabhakar, Stanford University Computational Complexity Conference CRA-W 2015 Career Mentoring Workshops EC 2015 [The 16th ACM Conference on Economics and Computation] HPDC 2015 [The 24th International Symposium on High-Performance Parallel and Distributed Computing] ISCA 2015 [The 42nd International Symposium on Computer Architecture] ISMM 2015 [ACM SIGPLAN International Symposium on Memory Management] IWQoS 2015 [IEEE/ACM International Symposium on Quality of Service] LCTES 2015 [ACM SIGPLAN/SIGBED International Conference on Languages, Compilers and Tools for Embedded Systems] PADL 2015 [17th Symposium on Practical Aspects of Declarative Languages] PLDI 2015 [36th ACM SIGPLAN Conference on Programming Language Design and Implementation] SIGMETRICS 2015 [International Conference on Measurement and Modeling of Computer Systems] SPAA 2015 [ACM Symposium on Parallelism in Algorithms and Architectures] STOC 2015 [47th ACM Symposium on Theory of Computing] TRANSACT [10th ACM SIGPLAN Workshop on Transactional Computing]

1 0

CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015
by Nabeel Al-Qirim 03 May '15

03 May '15

From: Nabeel Al-Qirim Sent: Monday, March 09, 2015 3:23 PM To: haskell(a)haskell.org; Haskell Cafe Subject: CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 IIT’15: The 11th International Conference on Innovations in Information Technology 2015 URL: http://www.it-innovations.ae/iit2015/posters.html The IIT’15 Student Poster and Demos Committee invites all undergraduate and graduate students to submit an extended (2 pages max.) abstract and to display it as a poster during the IIT’15. The poster topic should fall within the conference’s theme and tracks. SUBMISSION Extended abstracts should be sent to Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae. All students are encouraged to review their abstracts with their faculty advisers prior to submission. All accepted abstracts will be published by the IIT’15 proceedings. IMPORTANT DATES -Student Poster (Extended Paper) Submission May 30, 2015 -Notification of Student Poster acceptance July 15, 2015 -Camera ready Extended Paper and Poster material September 01, 2015 -Conference November 01-03, 2015 BEST STUDENT POSTER AWARDS There will be a competition for best student poster award at the IIT’15. This award will be given to recognize student excellence in research and presentation. CONTACT Queries should be directed to: Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae Thanks, Dr. Nabeel Al-Qirim IIT’15 Student Poster and Demos Chair College of Information Technology United Arab Emirates University P.O Box 15551 - Al Ain United Arab Emirates Tel: +971-3-7135531 Mobile: +971-507308705 Fax: +971-3-7672018 Email: nalqirim(a)uaeu.ac.ae Website: http://nalqirim.wix.com/nabeel-al-qirim Disclaimer:"The content of this email together with any attachments, statements and opinions expressed herein contains information that is confidential in nature and intended for the named addressee(s) only. If you are not the addressee of this email or you have received this message in error please notify the sender and delete the message and any associated files from your system, you have no right to copy, print, distribute or use this email or any of its attachments, or permit or disclose its contents to any other party in any way, except with the prior approval of the sender. In case of breach of what has been explained above, you will be held legally accountable." تنبيه: "تنبيه: إن محتوى هذا البريد الإلكتروني بمرفقاته وبياناته وآرائه الواردة في هذه الوثيقة يحتوي على معلومات تعتبر ذات طبيعة سرية، وتستهدف المرسل اسمه فقط، فإذا لم تكن المرسل إليه في هذه الرسالة أو كنت قد تلقيت الرسالة بالخطأ؛ يُرجى إبلاغ المُرسل وحذف الرسالة وأية ملفات مرتبطة من النظام الخاص بك، إذ ليس لديك الحق في نسخ أو طباعة أو توزيع أو استخدام محتويات هذا البريد الإلكتروني، أو السماح أو الكشف عن ذلك لأي طرف آخر تحت أي ظرف إلا بموافقة مسبقة من لمرسل، علماً بأن إخلالك بما سبق سيعرضك للمساءلة القانونية" . www.uaeu.ac.ae<http://www.uaeu.ac.ae>

1 0

Haskell Weekly News
by Kim-Ee Yeoh 01 May '15

01 May '15

*Top Picks:* - Haskell wins a bumper crop of 18 accepted Google Summer of Code proposals <http://www.reddit.com/r/haskell/comments/342rvp/google_summer_of_code_18_pr…>. Mentor offers total 44, another thumpin' sign of life. Kudos to Edward Kmett, Johan Tibell, Shachaf Ben-Kiki, and Gershom Bazerman. Gloria Haskella sine labore nulla. - Reddit Haskell celebrates <http://www.reddit.com/r/haskell/comments/33wnf1/20k_rhaskell_subscribers_ni…> 20k subscribers. It's the 7th largest PL community on reddit <https://www.reddit.com/r/programming/wiki/faq#wiki_what_language_reddits_ar…> after python, javascript, java, php, ruby, c++, in that order. - Matthew Griffith <http://mechanical-elephant.com/thoughts/2015-04-20-becoming-productive-in-h…> migrates away from Python: "I do most of my web prototyping in Haskell now." A journey vividly logged and much loved on Hacker News <https://news.ycombinator.com/item?id=9431944>. And also on Proggit <http://www.reddit.com/r/programming/comments/33oyx9/becoming_productive_in_…> and Reddit Haskell <http://www.reddit.com/r/haskell/comments/33mnlc/becoming_productive_in_hask…> . - A web developer migrates away from Rails to Haskell and explains on HN the 10x advantage <https://news.ycombinator.com/item?id=9419601#up_9420448> he reaps. - Fancy Python in Haskell dress? Check out Dogelang <http://pyos.github.io/dg/>, charmingly defiant: "With Haskell's syntax but none of its type system, dg is the best way to make fans of static typing shut up already." Proggit kibbitzing here <http://www.reddit.com/r/programming/comments/33kleg/dg_its_a_python_no_its_…>, HN there <https://news.ycombinator.com/item?id=9432383>. - Caio Rordrigues copiously illustrates <https://github.com/caiorss/Functional-Programming> Haskell programming. Pretty: a tax bracket tool <https://github.com/caiorss/Functional-Programming#tax-brackets> and a coffee shop Point-of-Sale DSL <https://github.com/caiorss/Functional-Programming#small-dsl-domain-specific…>. It's almost a whole book! - Christian Marie starts the ball rolling on library cheatsheets <https://github.com/anchor/haskell-cheat-sheets/> to guide your way through the jungle of hackage. Moar, moar! <http://www.reddit.com/r/haskell/comments/33sc98/haskell_cheat_sheets_for_co…> - Got a C library you'd love Haskell bindings for? Remember Ian Ross and his new C2HS release <http://haskell.1045720.n5.nabble.com/Haskell-Weekly-News-td5768107.html>? Well, Ian's happy <http://haskell.1045720.n5.nabble.com/Tutorial-Ideas-td5808049.html> to do it for you. Provisos <http://www.skybluetrades.net/blog/posts/2015/04/27/c2hs-tutorial-request.ht…> apply. - Olle Fredriksson announces a combinator-based Earley parsing library <https://github.com/ollef/Earley> which accepts context-free but not context-sensitive (monadic parsing) grammars. Discussion <https://www.reddit.com/r/haskell/comments/33l9cr/ann_earley_parsing_library/> reveals that "one enormously important difference for this library is that it reports all possible parses." - Another Lennart, last name Spitzner, creates another genie that turns type signatures into programs. Unlike Djinn, Exference <http://haskell.1045720.n5.nabble.com/ANN-exference-a-different-djinn-td5807…> makes no promises over termination. "Your wish is my command even at the expense of closure." - Like Agda? You can now enjoy the hole-driven development style in Haskell, brought to you courtesy of Mote by Izaak Meckler <https://github.com/imeckler/mote>. Discussion here <https://www.reddit.com/r/haskell/comments/33v4nm/ann_mote_a_tool_bringing_h…> . <http://tomassetti.me/an-erd-web-server-generation-entity-diagrams-from-a-te…> - Federico Tomassetti <http://tomassetti.me/an-erd-web-server-generation-entity-diagrams-from-a-te…> creates a web-based interface to Andrew Gallant's erd tool <https://github.com/BurntSushi/erd>. Entity-Relationship Diagrams (ERD) come from the database world and help visualize {one,many} to {one,many} relationships. Federico's web app enables him to use erd everywhere without having to install the tool chain multiple times. - Mark Dominus gives a beginner spin <http://blog.plover.com/prog/haskell/monad-search.html> to the chestnut of SEND + MORE = MONEY <https://en.wikipedia.org/wiki/Verbal_arithmetic>. This puzzle site <http://programmingpraxis.com/2012/07/31/send-more-money-part-1/> has comparisons with other languages. - Got a number system? Flip it into a data structure <https://www.fpcomplete.com/user/edwardk/fibonacci/leonardo>. Re-flip it into an efficient search algorithm <https://www.fpcomplete.com/user/edwardk/fibonacci/search>. Edward Kmett shows you how. Respective discussion here <http://www.reddit.com/r/haskell/comments/342s31/edward_kmett_leonardo_rando…> and here <http://www.reddit.com/r/haskell/comments/346b6t/edward_kmett_openended_fibo…> . *In Memoriam* - A key founder of Haskell, Professor Paul Hudak, completed <http://yaledailynews.com/blog/2015/04/30/hudak-spirited-saybrugian-and-cs-p…> his end-of-life plan <http://www.caringbridge.org/visit/hudak/journal/view/id/5538f5cea589b4216c0…> after a five-year encounter with leukemia. He stays <https://news.ycombinator.com/item?id=9431017> in the thoughts <https://news.ycombinator.com/item?id=9465999> of all <http://www.reddit.com/r/haskell/comments/33oe4b/holding_on_and_letting_go/> who cherish <http://www.reddit.com/r/haskell/comments/34exz3/prof_hudak_passed_away_last…> his gifts <http://www.reddit.com/r/programming/comments/34f19q/paul_hudak_creator_of_h…> from the heart. *Quotes of the Week* - A type system flattens the cost of change curve <http://www.agilemodeling.com/essays/costOfChange.htm>. -- Chad Austin <http://chadaustin.me/2015/04/the-long-term-problem-with-dynamically-typed-l…> - The MLs and Haskell remind me of Brian Eno's line about how the first Velvet Underground album only sold 30,000 copies, but "everyone who bought one of those 30,000 copies started a band". -- Source <https://news.ycombinator.com/item?id=9431944#up_9437017> - On the value of Haskell <https://news.ycombinator.com/item?id=9445968#up_9448988>: I find I'm able to accomplish tasks which would otherwise be beyond my skill and intelligence. For example, even though C was the first language I learned, I can't imagine writing a parser in C after discovering the simplicity & readability of monadic parsing in Haskell. - Haskell's level of abstraction is so crazy that they can actually swap out their entire I/O system for another one without changing any application interfaces, this one blew my mind, it's the change that makes GHC 7.8 run the Warp webserver twice as fast. ... All of this without changing a line in Warp, they just transparently made every traditional Haskell use modern I/O principles. Academics man, they're smart ;) -- Source <https://news.ycombinator.com/item?id=9419601#up_9432564> - An old man loved is winter with flowers. -- Edgar Z. Friedenberg *Cool Beans of the Week* - Ravi Chugh and his fine team at U. Chicago just concluded stateside's first ever FRP-based FP course for undergrads using Elm. Check out the student projects <https://www.classes.cs.uchicago.edu/archive/2015/winter/22300-1/Showcase.ht…> for inspiration on FRP architecture. Over in Bonn, Janis Voigtländer also gave such a course <https://groups.google.com/d/msg/elm-discuss/Qjs6sp3lZq0/8aa5bvYcdDYJ> that completed this year. Paul's legacy lives on. p.s. Coming soon: Cabal Hell -- Kim-Ee

1 1

[TFP'15] call for participation
by Peter Achten 01 May '15

01 May '15

----------------------------- L A S T C A L L F O R P A R T I C I P A T I O N ----------------------------- ======== TFP 2015 =========== 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers will be published as a Springer Lecture Notes in Computer Science (www.springer.com/lncs) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/) == INVITED SPEAKERS == TFP is pleased to announce talks by the following two invited speakers: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. * Anil Madhavapeddy == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2015 program chair, Manuel Serrano. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TFP is financially supported by Erlang Solutions. == PROGRAM == Please find the program at: http://tfp2015.inria.fr/program/ The program features two invited talks by Laurence Rideau and Anil Madhavapeddy and one comprehensive Dart tutorial by Florian Loitsch. == IMPORTANT DATES == Registration: May 4, 2015 TFP Symposium: June 3-5, 2015 == PROGRAM COMMITTEE == Janis Voigtländer University of Bonn, DE Scott Owens University of Kent, UK Neil Sculthorpe Swansea University, UK Colin Runciman University of York, UK Manuel Serrano Inria (PC chair), FR Rinus Plasmeijer University of Nijmegen, NL Tomas Petricek University of Cambridge, UK Marco T. Morazan Seton Hall University, USA Wolfgang De Meuter Vrije Universiteit Brussel, BE Michel Mauny Ensta ParisTech, FR Sam Lindley The University of Edinburgh, UK Daan Leijen Microsoft, USA Jurriaan Hage Utrecht University, NL Andy Gill University of Kansas, USA Thomas Gazagnaire University of Cambrige, UK Lars-Ake Fredlund Universidad Politécnica de Madrid, ES Jean-Christophe Filliatre Université Paris Sud Orsay, FR Marc Feeley Université de Montréal, CA Olaf Chitil University of Kent, UK Edwin Brady University of St Andrews, UK

1 0

CFP: UNIF 2015
by Mateu Villaret 30 Apr '15

30 Apr '15

========================================================== Call for Papers UNIF 2015 The 29th International Workshop on Unification June 28, 2015. Warsaw, Poland http://rdp15.mimuw.edu.pl/index.php?site=unif ********* part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'15) ========================================================== UNIF 2015 is the 29th event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of identifying terms, finding solutions for equations, or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc. The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the current state of the art in unification theory. Topics of Interest ------------------ A non-exhaustive list of topics of interest include: - Unification algorithms, calculi and implementations - Equational unification and unification modulo theories - Unification in modal, temporal and description logics - Admissibility of inference rules - Narrowing - Matching algorithms - Constraint solving - Combination problems - Disunification - Higher-Order unification - Type checking and reconstruction - Typed unification - Complexity issues - Query answering - Implementation techniques - Applications of unification - Antiunification/Generalization Submission ---------- Following the tradition of UNIF, we call for submissions of abstracts (5 pages) in EasyChair style, to be submitted electronically as PDF files through the EasyChair submission site: https://easychair.org/conferences/?conf=unif2015 Abstracts will be evaluated by the Programme Committee (if necessary with support from external reviewers) regarding their significance for the workshop. Accepted abstracts will be presented at the workshop and included in the informal proceedings of the workshop, available in printed form at the workshop and in electronic form from the UNIF homepage: http://www.pps.jussieu.fr/~treinen/unif/ Based on the number and quality of submissions we will decide whether to organize a special journal issue. Important Dates --------------- * Paper Submission: May 3, 2015 * Notification of Acceptance: May 31, 2015 * Final version: June 7, 2015 * Conference: June 28, 2015 Programme Committee ------------------- * Franz Baader, TU Dresden, Germany * Santiago Escobar, Universitat Politecnica de Valencia, Spain (co-chair) * Adria Gascon, SRI international, USA * Silvio Ghilardi, Universita di Milano, Italy * Artur Jez, MPI, Germany * Temur Kutsia, RISC, Johannes Kepler University Linz, Austria * Jordi Levy, IIIA-CSIC, Spain * Christopher Lynch, Clarkson University, USA * George Metcalfe, University of Bern, Switzerland * Paliath Narendran, University at Albany-SUNY, USA * Jan Otop, IST, Austria * Christophe Ringeissen, LORIA-INRIA Lorraine, France * Manfred Schmidt-Schauss, Goethe-University Frankfurt, Germany * Mateu Villaret, Universitat de Girona, Spain (co-chair) For more information, please contact any of the two chairs Santiago Escobar or Mateu Villaret.

1 1

[haskell.org Google Summer of Code] 18 Projects Accepted
by Edward Kmett 28 Apr '15

28 Apr '15

I'd like to thank everyone for helping us to get the largest Google Summer of Code we've ever had for haskell.org off the ground! We have 18 accepted projects this year, spanning the entire ecosystem. You can find the official list on: https://www.google-melange.com/gsoc/org2/google/gsoc2015/haskell The most notable change this year is that in addition to the usual stable full of cabal tweaks (3 projects this year), and other infrastructure and library changes and the odd darcs project here and there (1 project), we also took it upon ourselves to act as an umbrella organization for purescript (2 projects). * I'd like to thank Johan Tibell for helping us get our ideas organized, and the /r/haskell moderators for leaving the brainstorming page "stickied" for the duration. It rather dramatically improved both the quantity and the quality of proposals we received. After I put out a call for additional mentoring help, we had 44 mentors step up to offer to help this time around, showing that we still have capacity to grow in years to come. Thank you all for putting in the time to help rank proposals and for your continued efforts over this summer. I'd also like to thank Shachaf Ben-Kiki and Gershom Bazerman for helping out with the administration side of things. Now we are entering what Google calls the "Community Bonding" period. Students officially start coding May 25th. Please feel free to reach out to me if you have any questions or concerns. -Edward Kmett haskell.org Google Summer of Code Administrator * Purescript and Darcs proposals went into the same pool as everyone else this year without earmarking.

2 1

MPC 2015 - Call For Participation
by Maciej Pirog 27 Apr '15

27 Apr '15

CALL FOR PARTICIPATION 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/ Early registration deadline: *** 29 May 2015 *** Hotel rooms reserved until: *** 29 May 2015 *** 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. 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. REGISTRATION To register for the conference send an email to mpc2015(a)online.de stating your name and affiliation. We will then provide further details, including hotel booking. You can also use the email address for any queries you might have. The early registration fee for the conference is 375 Euros if you pay via bank transfer and 385 Euros if you pay using PayPal. The early registration deadline is 29 May 2015; after this point, the registration fee rises to 425 Euros (bank transfer) and 435 Euros (PayPal). We have a block booking of rooms at the conference hotel at a special reduced rate, but only until 29th May 2015; after this point, the rooms will be released and the special rate unavailable. INVITED SPEAKERS * Carroll Morgan, University of New South Wales (Link http://www.cse.unsw.edu.au/~carrollm/) "A nondeterministic lattice of information" * Torsten Grust, Universität Tübingen (Link http://db.inf.uni-tuebingen.de/team/TorstenGrust.html) "A Compilation of Compliments for a Compelling Companion: the Comprehension" ACCEPTED PAPERS * "Exploring an Interface Model for CKA" Bernhard Möller and Tony Hoare * "On Rely-Guarantee Reasoning" Stephan Van Staden * "A Relation-Algebraic Approach to Multirelations and Predicate Transformers" Rudolf Berghammer and Walter Guttmann * "Preference Decomposition and the Expressiveness of Preference Query Languages" Patrick Roocks * "Hierarchy in Generic Programming Libraries" José Pedro Magalhães and Andres Löh * "Polynomial Functors Constrained by Regular Expressions" Dan Piponi and Brent Yorgey * "A Program Construction and Verification Tool for Separation Logic" Brijesh Dongol, Victor B. F. Gomes, and Georg Struth * "Calculating Certified Compilers for Non-Deterministic Languages" Patrick Bahr * "Notions of Bidirectional Computation and Entangled State Monads" Faris Abou-Saleh, James Cheney, Jeremy Gibbons, James McKinna, and Perdita Stevens * "A clear picture of lens laws" Sebastian Fischer, Zhenjiang Hu, and Hugo Pacheco * "Regular Varieties of Automata and Coequations" Julian Salamanca, Jan Rutten, Marcello Bonsangue, Enric Cosme-Llópez, and Adolfo Ballester-Bolinches * "Column-wise Extendible Vector Expressions and the Relational Computation of Sets of Sets" Rudolf Berghammer * "Turing-Completeness Totally Free" Conor McBride * "Auto in Agda: Programming proof search using reflection" Pepijn Kokke and Wouter Swierstra * "Fusion for Free: Efficient Algebraic Effect Handlers" Nicolas Wu and Tom Schrijvers 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 LOCAL ORGANIZERS Ralf Hinze University of Oxford, UK (co-chair) Janis Voigtländer Universität Bonn, Germany (co-chair) José Pedro Magalhães Standard Chartered Bank, UK Maciej Piróg University of Oxford, UK Nicolas Wu University of Bristol, UK For queries about local matters, please write to jv(a)informatik.uni-bonn.de.

1 0

ANN: New Haskell.org Committee Members
by Gershom B 27 Apr '15

27 Apr '15

Following the self-nomination period and discussion, the Haskell.org committee has selected new members: * Edward Kmett (reappointment) * Ryan Trinkle * John Wiegley As per the rules of the committee, this discussion was held among the current members of the committee, and the outgoing members of the committee who were not seeking reappointment. Thank you to all candidates who submitted a self-nomination. All of the nominations we received were very strong, and we would encourage all those who nominated themselves to consider self-nominating again in the future. We would also like to thank our two outgoing members, Jason Dagit and Brent Yorgey, for their service. Cheers, Gershom

1 0