- Haskell - Haskell.org

PPDP 2013: 2nd Call for Papers
by Tom Schrijvers 07 May '13

07 May '13

===================================================================== 2nd Call for papers 15th International Symposium on Principles and Practice of Declarative Programming PPDP 2013 Special Issue of Science of Computer Programming (SCP) Madrid, Spain, September 16-18, 2013 (co-located with LOPSTR 2013) http://users.ugent.be/~tschrijv/PPDP2013/ ====================================================================== EXTENDED SUBMISSION DEADLINE: JUNE 13, 2013 PPDP 2013 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to: * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modelling in a declarative language and modelling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 23nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2013) and held in cooperation with ACM SIGPLAN. The conference will be held in Madrid, Spain. Previous symposia were held at Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings will be published in the ACM International Conference Proceedings Series. After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2014. Important Dates Abstract Submission: June 10, 2013 Paper submission: June 13, 2013 Notification: July 18, 2013 Camera-ready: August 4, 2013 Symposium: September 16-18, 2013 Invites for SCP: October 2, 2013 Submission of SCP: December 11, 2013 Notification from SCP: February 22, 2014 Camera-ready for SCP: March 14, 2014 Authors should submit an electronic copy of the paper (written in English) in PDF. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. Papers should consist of no more than 12 pages, formatted following the ACM SIG proceedings template (option 1). The 12 page limit must include references but excludes well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Program Committee Sergio Antoy Portland State University, USA Manuel Carro IMDEA Software Institute, Spain Iliano Cervesato Carnegie Mellon University, Qatar Agostino Dovier Universita degli Studi di Udine, Italy Maria Garcia de la Banda Monash University, Australia Ralf Hinze University of Oxford, UK Yukiyoshi Kameyama University of Tsukuba, Japan Oleg Kiselyov USA Yanhong Annie Liu State University of New York at Stony Brook, USA Stefan Monnier Universite de Montreal, Canada Alan Mycroft University of Cambrige, UK Bruno C. d. S. Oliveira National University of Singapore, Singapore Alberto Pettorossi Universita di Roma Tor Vergata, Italy Enrico Pontelli New Mexico State University, USA Kristoffer Rose IBM Research, USA Sukyoung Ryu KAIST, South Korea Vitor Santos Costa University of Porto, Portugal Torsten Schaub University Potsdam, Germany Tom Schrijvers Ghent University, Belgium Martin Sulzmann Hochschule Karlsruhe, Germany Wouter Swierstra Universiteit Utrecht, The Netherlands Tarmo Uustalu Institute of Cybernetics, Estonia Janis Voigtlaender University of Bonn, Germany Meng Wang Chalmers University of Technology, Sweden Jan Wielemaker Universiteit van Amsterdam, The Netherlands Program Chair Tom Schrijvers Department of Applied Mathematics and Computer Science Ghent University 9000 Gent, Belgium General Chair Ricardo Pena Facultad de Informatica Universidad Complutense de Madrid 28040 Madrid, Spain

1 0

Request for input on "Programming in Haskell"
by Graham Hutton 07 May '13

07 May '13

Have you taught a course using Hutton's textbook on Programming in Haskell? If so, please read on! As part of the national assessment of universities in the UK that takes place every 5-6 years, I'm producing a case study on the impact of the book on student and professional training. The case study will include a number of quotes from academic and industrial users who have used the book for teaching purposes. If you have taught a course using the book any time from January 2008 onwards, and would be willing to provide a short quote (2-3 sentences) for the case study, that would be very much appreciated. It doesn't matter if you are no longer teaching the course or are not currently using the book. If you are interested, drop me an email and I'll explain what's involved. Many thanks, Graham Hutton -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

DEADLINE EXTENSION: CHR 2013 Workshop
by Jon Sneyers 07 May '13

07 May '13

(apologies for multiple copies) * DEADLINE EXTENSION: Paper submission deadline is now May 14th! (instead of May 8th) ========================================================================= Call for Papers Tenth International Workshop on Constraint Handling Rules CHR 2013 http://dtai.cs.kuleuven.be/CHR/CHR2013/ Berlin (Germany), July 13th, 2013 (co-located with the 3rd Intl Summer School on CHR) ========================================================================= Introduction The CHR 2013 Workshop will be held on July 13th, 2013 in Berlin (Germany) at the occasion of the 3rd International Summer School on CHR. More information on the venue and the co-located summer school can be found on the summer school website (http://met.guc.edu.eg/CHR2013/) The Constraint Handling Rules (CHR) language has become a major declara- tive specification formalism and implementation language for constraint reasoning algorithms and applications. Algorithms specified using infe- rence rules, rewrite rules, sequents, proof rules, or logical axioms can often be directly written in CHR. Its clean semantics facilitates pro- gram design, analysis, and transformation. For more information, please visit the CHR website (http://dtai.cs.kuleuven.be/CHR/) The aim of the CHR workshop series is to stimulate and promote interna- tional research and collaboration on topics related to the CHR language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous Workshops on Constraint Handling Rules were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portugal) at ICLP, in 2008 in Hagen- berg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP, in 2010 in Edinburgh (Scotland, UK) at ICLP, in 2011 in Cairo (Egypt), at the 2nd CHR summer school, and in 2012 in Budapest (Hungary) at ICLP. Topics of Interest The workshop calls for full papers and short papers describing ongoing work on any aspect of CHR and related approaches. The following topics are relevant (this list is non-exhaustive): - (Logical) Algorithms - Applications - Constraint Solvers - Critical Assessment - Expressiveness and Complexity - Implementations and Optimization - Language Extensions (Types, Modules,...) - Mutual inspiration from related areas such as Answer Set Programming, (Term) Rewriting Systems, ... - Program Analysis - Program Transformation and Generation - Programming Environments (Debugging) - Programming Pearls - Programming Tools - Retractable Constraints - Semantics - System Descriptions Important dates - Paper submission deadline: May 14th, 2013 [EXTENDED!] - Notification of acceptance: June 8th, 2013 - Final version due: June 23rd, 2013 - Workshop date: July 13th, 2013 Submission Information The two categories for submissions are: - full papers for describing technically sound, innovative ideas that can advance the state of the art of CHR; - short papers, for ongoing work not yet ready for full publication and research project overviews. All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. Technical papers must not exceed 15 pages. The limit for short papers is 8 pages, as is the standard page limit for application papers, and system and tool papers. However, particularly strong contributions in the latter two areas may be submitted as technical paper as well. All papers must be in the Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS home page (http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0) Submissions must be made via the EasyChair submission system, available at http://www.easychair.org/conferences/?conf=chr2013 Programme Committee - Slim Abdennadher, German University of Cairo, Egypt - María Alpuente, UPV, Spain - Henning Christiansen, Roskilde University, Denmark (co-chair) - Marina De Vos, University of Bath, UK - François Fages, INRIA Rocquencourt, France - Thom Frühwirth, University of Ulm, Germany - Maurizio Gabbrielli, University of Bologna, Italy - Marco Gavanelli, University of Ferrara, Italy - Rémy Haemmerlé, Technical University of Madrid, Spain - Michael Maher, University of New South Wales, Canberra, Australia - Thierry Martinez, INRIA Paris-Rocquencourt, France - Maria Chiara Meo, Gabriele d'Annunzio University, Italy - Eric Monfroy, UTFSM and LINA, Chile/France - Tom Schrijvers, Ghent University, Belgium - Jon Sneyers, KU Leuven, Belgium (co-chair) - Armin Wolf, Fraunhofer FIRST, Germany Workshop Coordinators Contact: chr2013(a)easychair.org Henning Christiansen Department of Communication, Business and Information Technologies, Roskilde University, Denmark http://www.ruc.dk/~henning/ Jon Sneyers Department of Computer Science, KU Leuven Leuven, Belgium http://people.cs.kuleuven.be/~jon.sneyers/ Steering committee: Thom Frühwirth Programmiermethodik und Compilerbau, Ulm University Ulm, Germany http://www.informatik.uni-ulm.de/pm/mitarbeiter/fruehwirth/ Slim Abdennadher Department of Computer Science & Engineering, German University in Cairo Cairo, Egypt http://met.guc.edu.eg/staff/slim_abdennadher.aspx

1 0

Extended Deadline: MEMOCODE 2013: Call for papers
by Emil Axelsson 07 May '13

07 May '13

CALL FOR PAPERS - MEMOCODE 2013 (NOTE: NEW EXTENDED DATES for PAPERS and DESIGN CONTEST) Eleventh ACM/IEEE International Conference on Formal Methods and Models for Codesign http://www.memocode-conference.com 18-20 October 2013, Portland, Oregon, USA Co-located with DIFTS and FMCAD SCOPE The eleventh ACM/IEEE MEMOCODE conference focuses on research and developments in methods, tools, and architectures for the design of hardware/software systems. MEMOCODE seeks submissions that present novel formal methods and design techniques to create, refine, and verify complex hardware/software systems and to tackle the tight constraints on timing, power, costs, reliability and security that these systems face. We also invite application-oriented papers, and especially encourage submissions that highlight the tools and design perspective of formal methods and models, including success as well as failure stories, constructive analysis thereof, and demonstrations of hardware/software codesign. Techniques may range from formal verification to simulation-based verification technologies, and from languages to design paradigms that unify hardware and software codesign. Architectures may range from cloud computing and multi-core platforms to networks on chip. Applications and demonstrators may address values ranging from productivity and reuse to performance and quality. MEMOCODE 2013 is co-located with FMCAD, the thirteenth conference on Formal Methods in Computer-Aided Design, and DIFTS, the International Workshop on Design and Implementation of Formal Tools and Systems. PAPER SUBMISSIONS Paper submissions must be accepted through the EasyChair review system on our web site. Papers must be 10 pages or less, and must be formatted following IEEE Computer Society guidelines. Submissions must be written in English, describe original work, and not substantially overlap papers that have been published or are being submitted to a journal or another conference with published proceedings. (NOTE: NEW, EXTENDED DATES !!!) Abstract submission deadline: May 15 Paper submission deadline: May 22 Notification of acceptance: June 18 Final version for Papers: July 17 DESIGN CONTEST MEMOCODE 2013 is proud to organize its traditional Design Contest. The conference will sponsor at least one prize with a significant monetary award. Each team delivering a complete and working solution will be invited to prepare a 2-page abstract to be published in the proceedings and to present it during a dedicated poster session at the conference. The winning teams may contribute a 4-page short paper for presentation in the conference program. Further information will be made available on our website. (NOTE: NEW, EXTENDED DATES !!!) Design Contest start: June 1 Design submission deadline: July 1 Notification of design results: July 19 Final version for abstracts: July 31 PUBLICATION Conference proceedings will be published by the IEEE Computer Society. Besides conference proceedings, we are planning a special journal issue with the very best 2013 papers of MEMOCODE, DIFTS, and FMCAD. We look forward to your participation! Marly Roncken, Jean-Pierre Talpin, and Eriko Nurvitadhi MEMOCODE 2103 Program Chairs and Design Contest Chair

1 0

BayHac '13
by Mark Lentczner 04 May '13

04 May '13

Please join us for a weekend of Haskell hacking: *BayHac '13* *May 17th ~ 19th, 2013* *Hacker Dojo* *Mountain View, CA* Full details on the Haskell Wiki: BayHac '13<http://www.haskell.org/haskellwiki/BayHac2013> - Mark

1 1

Foundations of Health Information Engineering and Systems (FHIES 2013) - extended submission deadline
by Jeremy.Gibbons＠cs.ox.ac.uk 03 May '13

03 May '13

THIRD AND FINAL CALL FOR PAPERS Third International Symposium on Foundations of Health Information Engineering and Systems http://www.cs.ox.ac.uk/FHIES2013/ International Institute for Software Technology United Nations University, Macau 21st-23rd August, 2013 EXECUTIVE SUMMARY - CHANGES SINCE PREVIOUS CALL Submission deadline extended by two weeks, to May 20th. Additional category of extended abstracts (max 2 pages) solicited. Apologies for duplication. BACKGROUND ICT plays an increasingly enabling role in addressing the global challenges of healthcare, in both the developed and the developing world. The use of software in medical devices has caused growing concerns in relation to safety and efficacy. The increasing adoption of health information systems provides great potential benefits but also poses severe risks, both with respect to security and privacy and in regard to patient safety. Hospital and other information systems raise important issues of workflow support and interoperability. Regulators, manufacturers and clinical users have pointed out the need to research sound and science-based engineering methods that facilitate the development and certification of quality ICT systems in health care. Such methods may draw from or combine techniques from various disciplines, including but not limited to software engineering, electronic engineering, computing science, information science, mathematics, and industrial engineering. AIMS The purpose of the symposium series on Foundations of Health Information Engineering and Systems is to promote a nascent research area that aims to develop and apply theories and methods from a variety of disciplines for the purpose of modeling, building and certifying software-intensive ICT systems in healthcare. A particular objective of FHIES is to explicitly include a focus on healthcare ICT applications in the developing world (in addition to systems used in the developed countries), since unique engineering challenges arise in that special setting. Because humans often play a pivotal role in the process of using such systems, theories from the human factors engineering community may need to be integrated with methods from the technology-oriented domains in order to create effective engineering methodologies for socio-technical systems in the healthcare domain. Previous FHIES symposia were held in 2011, in Mabalingwe, South Africa (with post-conference proceedings in Springer LNCS 7151, and in 2012, in Paris, France (with post-conference proceedings to appear in Springer LNCS). SCOPE FHIES seeks contributions from both the solution domain (engineering methods) and the problem domain (healthcare and health informatics). Solution-domain papers should present their methods in the context of a concrete application in healthcare, while problem-domain papers should be devised to educate the methods community about unique challenges and characteristics of the healthcare domain. Submissions should seek to inform and further the development, adaptation, evaluation and adoption of formally based and rigorous engineering methods in health care systems. Topics of interest include but are not limited to: * modelling, analysis, simulation and verification in health informatics; * design and verification techniques for software-based ICT and software-intensive medical devices; * application and integration of foundational methods from different disciplines in engineering and science to health informatics; * specific engineering challenges of ICT-based health service delivery in different settings, especially in the developing world. For a more detailed list of topics, see the symposium website. CATEGORIES We solicit high quality full submissions in the following categories: * original research contributions (16 pages max) * application experience, case studies and software prototypes (16 pages max.) * surveys, comparisons, and state-of-the-art reports (16 pages max.) * position papers identifying challenges and milestones of a research project (8 pages max.) We also invite short submissions for special sessions: * student papers on work in progress on an MSc or PhD project (4 pages max.) * tool demonstrations (2 pages max.) * proposals to organize birds-of-a-feather sessions or panels (2 pages max.) * extended abstracts (2 pages max.) SUBMISSIONS Submissions should be in English, prepared in the LNCS format (http://www.springer.de/comp/lncs/authors.html) and all page limits are measured in this format. Full submissions (those in the first four categories above) will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the symposium; student papers will be judged on clarity of description and the promise of interesting results; tool demonstrations, BOF proposals, and extended abstracts will be judged on relevance to the symposium. All papers will be peer-reviewed by at least three program committee members. Papers should be submitted via EasyChair, at http://www.easychair.org/conferences/?conf=fhies2013 Submission constitutes a commitment for at least one author to attend the symposium and present the paper, if it is accepted. PUBLICATION All accepted submissions will be distributed in a technical report at the Symposium. After the event, postproceedings will be published in Springer LNCS. Authors of all accepted full submissions will be invited to revise their papers, in order to resolve any larger issues raised during reviewing. Authors of accepted short submissions will be invited to submit full papers for review and LNCS publication too. In addition, a special issue of a suitable journal is planned, focusing on the overall objectives of FHIES: this will have an open call for contributions. IMPORTANT DATES Submission deadline: extended to May 20th Notification of acceptance: June 12th Delivery of preproceedings version: July 17th Symposium: August 21st-23rd Submission for postproceedings review: October 4th Notification of acceptance: October 11th Camera ready version: October 18th Publication of proceedings: December 23rd ORGANIZERS General chairs: * Zhiming Liu, United Nations University, MO * Jens Weber, University of Victoria, CA Programme chairs: * Jeremy Gibbons, University of Oxford, UK * Wendy MacCaull, St. Francis Xavier University, CA Programme committee: * Ime Asangansi, University of Oslo, NO * Tom Broens, Mobihealth, NL * Lori Clarke, University of Massachusetts, US * David Clifton, University of Oxford, UK * Gerry Douglas, University of Pittsburgh, US * Johannes Faber, IIST, United Nations University, MO * Jozef Hooman, Embedded Systems Institute and Radboud University Nijmegen, NL * Michaela Huhn, Technische Universität Clausthal, DE * Shinsako Kiyomoto, KDDI R&D Laboratories Inc, JP * Craig Kuziemsky, University of Ottawa, CA * Yngve Lamo, Bergen University College, NO * Insup Lee, University of Pennsylvania, US * Orlando Loques, Instituto de Computação, Universidade Federal Fluminense, BR * Gilbert Maiga, Makerere University, UG * Dominique Mery, Université de Lorraine, LORIA, FR * Deshendran Moodley, University of KwaZulu-Natal, ZA * Jun Pang, University of Luxembourg, LU * Manfred Reichert, University of Ulm, DE * Ita Richardson, Lero, University of Limerick, IE * David Robertson, University of Edinburgh, UK * Christopher Seebregts, Jembi Health Systems / Medical Research Council, ZA * Bo Song, Qingdao University of Science and Technology, CN * Alan Wassyng, McMaster University, CA Keynote speakers: * Joe Cafazzo, Centre for Global eHealth Innovation, CA * Jane Liu, Academia Sinica, TW * Bill Thies, Microsoft Research, IN

1 0

Summer school on Applied Functional Programming at Utrecht University; deadline for registration May 15
by Doaitse Swierstra 02 May '13

02 May '13

Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous four occasions students were all very happy with the school and we plan to repeat this success this year. Among the intended audience are prospective master students who gained an interest in Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In previous years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/USCS/ -- on this page you can find the poster you can print and hang somewhere (why not your office door): Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra, Atze Dijkstra and Johan Jeuring

2 1

SCSS 2013 - Deadline Extension
by Temur Kutsia 02 May '13

02 May '13

[Please post - apologies for multiple copies.] Deadline extension ================================================= SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ ================================================= Important Dates --------------- May 10, 2013: Abstract submission deadline (extended) May 13, 2013: Paper submission deadline (extended) June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: The symposium Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Wei Li (Beihang University, China) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ María Alpuente (Technical University of Valencia, Spain) Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University — Qatar Campus) Horatiu Cirstea (Loria, France) Jürgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Paul Jackson (University of Edinburgh, UK) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Pierre-Etienne Moreau (INRIA-LORIA Nancy, France) André Platzer (Carnegie Mellon University, USA) Stefan Ratschan (Czech Academy of Sciences) Rachid Rebiha (University of Lugano, Switzerland and IC Unicamp, Brazil) Enric Rodríguez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing.

1 0

Haskell job / adaptive learning
by Carl Baatz 02 May '13

02 May '13

Dear Haskellers, Erudify (http://erudify.com/) is looking for software engineers to join our team. We are developing an autonomous interactive online tutor. We sell our product to enterprise and provide it for free to schools and consumers. We are looking for software engineers who are smart and friendly, have several years of programming experience, and a passion for building practical and high quality software. Haskell is our main language and we are using JavaScript on the client side. The field of automated learning and teaching is still in its infancy and we are thrilled about the work we are doing to improve how people learn. So what are we looking for? We expect you to prefer design principles compatible with Unix and the Web. You make an effort to learn new technologies that could be helpful and you work to master those you already use. You have worked with a broad range of technologies in your career. You get things done and realise that trade-offs are necessary, but compromising the long-term goal is not. You have experience with Haskell, but might not be an expert. Erudify consists of eleven people -- six of us are Engineers, of which four are specialised in Haskell (with another Haskeller joining soon). We are based in Zürich and our working language is English. Please email us at jobs(a)erudify.com if you are curious. Also, two of our engineers, Bas van Dijk and Simon Meier, will be at the Odessa hackathon from 2 May to 6 May -- they'd be delighted to chat with you. Best wishes, Carl Baatz

1 0

Haskell Weekly News: Issue 266
by Daniel Santa Cruz 02 May '13

02 May '13

Welcome to issue 266 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 7 to 27, 2013. Quotes of the Week * hpc: the dirty secret of haskell programmers is that their power does not come from their PhD, but their bowtie * tibbe: I think I have implemented a reverse state monad by mistake. The numbers suggest I'm getting the values tunneled back from the future. :/ * SaulGorn: A formalist is one who cannot understand a theory unless it is meaningless. * cmccann: laziness by default is a shortcoming. eagerness by default is a bigger shortcoming. * monochrom: #haskell-blah has brilliant people too. for example me. * limo: OK, guys was nice meeting you and now I'm a proud owner of a GHCi icon on my desktop * otters: lens law #1: the implementation must be shorter than the type * MartinDeMello: Any sufficiently well-commented Lisp program contains an ML program in its comments. * tgeeky: whatever man. Jesus only had twelve or so deciples, lens has 80! * SatnamSingh: I always thought that category theory was something that happened to other people. (#ICFP) * cmccann: see the thing is tabs are good for indentation. haskell doesn't use indentation, it uses alignment. it is not indenting. it is ASCII art. * JohnVonNeumann: In mathematics you don't understand things. You just get used to them. * edwardk: you can view Yoneda f as enforced fmap fusion and Codensity f as enforced bind fusion. Top Reddit Stories * Functors, applicatives, and monads in pictures Domain: adit.io, Score: 136, Comments: 67 On Reddit: [1] http://goo.gl/xRC6K Original: [2] http://goo.gl/QcfqM * What I Wish I Knew When Learning Haskell, Stephen Diehl [39 slides, Left/Rgt-arrow key to back/advance] Domain: dev.stephendiehl.com, Score: 119, Comments: 37 On Reddit: [3] http://goo.gl/T8uzi Original: [4] http://goo.gl/eZTA0 * git clone in Haskell from the bottom up Domain: stefan.saasen.me, Score: 86, Comments: 6 On Reddit: [5] http://goo.gl/Al86J Original: [6] http://goo.gl/nWSXV * Vinyl: Modern Records for Haskell Domain: jonmsterling.com, Score: 56, Comments: 27 On Reddit: [7] http://goo.gl/pSUph Original: [8] http://goo.gl/ra0Jb * Follow-up: Web Woes for Haskell Domain: self.haskell, Score: 49, Comments: 9 On Reddit: [9] http://goo.gl/PJZEA Original: [10] http://goo.gl/PJZEA * What does “coalgebra” mean in the context of programming? (StackOverflow) Domain: stackoverflow.com, Score: 45, Comments: 23 On Reddit: [11] http://goo.gl/nMqBF Original: [12] http://goo.gl/UH2Wl * The Mother of all Monads - School of Haskell Domain: self.haskell, Score: 42, Comments: 27 On Reddit: [13] http://goo.gl/XO7mQ Original: [14] http://goo.gl/XO7mQ * Why do all the Haskell Web Frameworks rely on Template Haskell? Domain: self.haskell, Score: 40, Comments: 59 On Reddit: [15] http://goo.gl/v5p6F Original: [16] http://goo.gl/v5p6F * Job opening for Haskell developer in Nijmegen (NL) Domain: self.haskell, Score: 39, Comments: 6 On Reddit: [17] http://goo.gl/Uzqs8 Original: [18] http://goo.gl/Uzqs8 * Tutorial: Building a Sample Application with Haskell Snap, PostgreSQL, and the PostgreSQL Simple Snaplet Domain: janrain.com, Score: 39, Comments: 17 On Reddit: [19] http://goo.gl/TAM6J Original: [20] http://goo.gl/37Nry * Haskell for all: Defaults Domain: haskellforall.com, Score: 38, Comments: 20 On Reddit: [21] http://goo.gl/7NYex Original: [22] http://goo.gl/FqiuW * Haskell for all: pipes-concurrency-1.0.0: Reactive programming Domain: haskellforall.com, Score: 38, Comments: 23 On Reddit: [23] http://goo.gl/DaSaZ Original: [24] http://goo.gl/eGw3F * Haskell in Ipython Domain: github.com, Score: 38, Comments: 7 On Reddit: [25] http://goo.gl/Y7DEP Original: [26] http://goo.gl/324JX * A taste of Curry (Wolfgang Jeltsch) Domain: jeltsch.wordpress.com, Score: 38, Comments: 0 On Reddit: [27] http://goo.gl/Ijh6Y Original: [28] http://goo.gl/17Ry1 * Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism Domain: semantic-domain.blogspot.co.uk, Score: 37, Comments: 21 On Reddit: [29] http://goo.gl/Yv9RY Original: [30] http://goo.gl/qW1Qq * Template Haskell on impossible architectures (x-post from r/programming) Domain: joeyh.name, Score: 37, Comments: 14 On Reddit: [31] http://goo.gl/m1Jvp Original: [32] http://goo.gl/GqiAR * inefficient Ackermann implementation not obvious how to improve Domain: stackoverflow.com, Score: 37, Comments: 20 On Reddit: [33] http://goo.gl/CEaOT Original: [34] http://goo.gl/JploA * Haskell for all: pipes and io-streams Domain: haskellforall.com, Score: 37, Comments: 20 On Reddit: [35] http://goo.gl/fmLhr Original: [36] http://goo.gl/8BoLg * Build applications with Shake build system Domain: lethalman.blogspot.it, Score: 35, Comments: 5 On Reddit: [37] http://goo.gl/MZBLj Original: [38] http://goo.gl/bP7lK * What’s in a number? criterion edition Domain: serpentine.com, Score: 34, Comments: 6 On Reddit: [39] http://goo.gl/cfVMa Original: [40] http://goo.gl/hqBfW * Announcing postgresql-simple 0.3.1 Domain: blog.melding-monads.com, Score: 34, Comments: 5 On Reddit: [41] http://goo.gl/LEuEv Original: [42] http://goo.gl/jrn5v * LGtk: Lens-based Gtk Interface Domain: people.inf.elte.hu, Score: 32, Comments: 64 On Reddit: [43] http://goo.gl/SC7kn Original: [44] http://goo.gl/FfYeE * Introduction to QuickCheck testing (new FP complete SoH tutorial) Domain: fpcomplete.com, Score: 32, Comments: 7 On Reddit: [45] http://goo.gl/2BnS6 Original: [46] http://goo.gl/6DKRG * Introduction to Haskell, Lecture 12 is Live (Category Theory). This is the last lecture in this series. Thank you for your support! Domain: shuklan.com, Score: 31, Comments: 4 On Reddit: [47] http://goo.gl/to9jd Original: [48] http://goo.gl/JZYSv Top StackOverflow Questions * What does “coalgebra” mean in the context of programming? votes: 134, answers: 3 Read on SO: [49] http://goo.gl/UH2Wl * Ackermann very inefficient with Haskell/GHC votes: 39, answers: 7 Read on SO: [50] http://goo.gl/JploA * How to concisely express function iteration? votes: 21, answers: 3 Read on SO: [51] http://goo.gl/OknK3 * Does the GHC garbage collector have any special optimisations for large objects? votes: 16, answers: 1 Read on SO: [52] http://goo.gl/p1zvM * Parallel computations with fast randomness and purity? votes: 16, answers: 4 Read on SO: [53] http://goo.gl/O3FzX * Idiomatic Scala translation of Kiselyov's zippers? votes: 15, answers: 1 Read on SO: [54] http://goo.gl/TCBaL * Singleton types in Haskell votes: 14, answers: 1 Read on SO: [55] http://goo.gl/u3867 * Encoding correctness constraints directly into the Haskell type system? votes: 14, answers: 2 Read on SO: [56] http://goo.gl/in0xv * Monad transformers with identity monad votes: 12, answers: 2 Read on SO: [57] http://goo.gl/hx2Ic * Extensible Haskell Type Classes votes: 12, answers: 4 Read on SO: [58] http://goo.gl/zdYpL * GADT's failed exhaustiveness checking votes: 12, answers: 2 Read on SO: [59] http://goo.gl/GIFDu * QuickCheck: Arbitrary instances of nested data structures that generate balanced specimens votes: 11, answers: 1 Read on SO: [60] http://goo.gl/WH3FV * What is this special functor structure called? votes: 11, answers: 1 Read on SO: [61] http://goo.gl/cKt7o Until next time, [62]+Daniel Santa Cruz References 1. http://adit.io/posts/2013-04-17-functors,_applicatives,_and_monads_in_pictu… 2. http://www.reddit.com/r/haskell/comments/1co0s5/functors_applicatives_and_m… 3. http://dev.stephendiehl.com/hask/ 4. http://www.reddit.com/r/haskell/comments/1cbjqm/what_i_wish_i_knew_when_lea… 5. http://stefan.saasen.me/articles/git-clone-in-haskell-from-the-bottom-up/ 6. http://www.reddit.com/r/haskell/comments/1ch3l2/git_clone_in_haskell_from_t… 7. http://www.jonmsterling.com/posts/2013-04-06-vinyl-modern-records-for-haske… 8. http://www.reddit.com/r/haskell/comments/1buh5y/vinyl_modern_records_for_ha… 9. http://www.reddit.com/r/haskell/comments/1cy58c/followup_web_woes_for_haske… 10. http://www.reddit.com/r/haskell/comments/1cy58c/followup_web_woes_for_haske… 11. http://stackoverflow.com/questions/16015020/what-does-coalgebra-mean-in-the… 12. http://www.reddit.com/r/haskell/comments/1cht4v/what_does_coalgebra_mean_in… 13. http://www.reddit.com/r/haskell/comments/1cyajx/the_mother_of_all_monads_sc… 14. http://www.reddit.com/r/haskell/comments/1cyajx/the_mother_of_all_monads_sc… 15. http://www.reddit.com/r/haskell/comments/1czxvj/why_do_all_the_haskell_web_… 16. http://www.reddit.com/r/haskell/comments/1czxvj/why_do_all_the_haskell_web_… 17. http://www.reddit.com/r/haskell/comments/1clkjb/job_opening_for_haskell_dev… 18. http://www.reddit.com/r/haskell/comments/1clkjb/job_opening_for_haskell_dev… 19. http://janrain.com/blog/tutorial-building-a-sample-application-with-haskell… 20. http://www.reddit.com/r/haskell/comments/1d5c38/tutorial_building_a_sample_… 21. http://www.haskellforall.com/2013/04/defaults.html 22. http://www.reddit.com/r/haskell/comments/1c2g1r/haskell_for_all_defaults/ 23. http://www.haskellforall.com/2013/04/pipes-concurrency-100-reactive.html?m=1 24. http://www.reddit.com/r/haskell/comments/1cc6fe/haskell_for_all_pipesconcur… 25. https://github.com/creswick/ihaskell-notebook 26. http://www.reddit.com/r/haskell/comments/1d0151/haskell_in_ipython/ 27. http://jeltsch.wordpress.com/2013/04/27/a-taste-of-curry/ 28. http://www.reddit.com/r/haskell/comments/1d8n51/a_taste_of_curry_wolfgang_j… 29. http://semantic-domain.blogspot.co.uk/2013/04/thanks-to-olle-fredriksson.ht… 30. http://www.reddit.com/r/haskell/comments/1c50t3/complete_and_easy_bidirecti… 31. http://joeyh.name/blog/entry/Template_Haskell_on_impossible_architectures/ 32. http://www.reddit.com/r/haskell/comments/1cm4n1/template_haskell_on_impossi… 33. http://stackoverflow.com/questions/16115815/ackermann-very-inefficient-with… 34. http://www.reddit.com/r/haskell/comments/1cq3r4/inefficient_ackermann_imple… 35. http://www.haskellforall.com/2013/04/pipes-and-io-streams.html 36. http://www.reddit.com/r/haskell/comments/1ct65e/haskell_for_all_pipes_and_i… 37. http://lethalman.blogspot.it/2013/04/build-vala-applications-with-shake.html 38. http://www.reddit.com/r/haskell/comments/1bv703/build_applications_with_sha… 39. http://www.serpentine.com/blog/2013/04/13/whats-in-a-number-criterion-editi… 40. http://www.reddit.com/r/haskell/comments/1cauc5/whats_in_a_number_criterion… 41. http://blog.melding-monads.com/2013/04/27/announcing-postgresql-simple-0-3-… 42. http://www.reddit.com/r/haskell/comments/1d8mf1/announcing_postgresqlsimple… 43. http://people.inf.elte.hu/divip/LGtk.html 44. http://www.reddit.com/r/haskell/comments/1cemr2/lgtk_lensbased_gtk_interfac… 45. https://www.fpcomplete.com/user/pbv/an-introduction-to-quickcheck-testing 46. http://www.reddit.com/r/haskell/comments/1cus3k/introduction_to_quickcheck_… 47. http://shuklan.com/haskell/lec12.html 48. http://www.reddit.com/r/haskell/comments/1c00tj/introduction_to_haskell_lec… 49. http://stackoverflow.com/questions/16015020/what-does-coalgebra-mean-in-the… 50. http://stackoverflow.com/questions/16115815/ackermann-very-inefficient-with… 51. http://stackoverflow.com/questions/16010778/how-to-concisely-express-functi… 52. http://stackoverflow.com/questions/16186488/does-the-ghc-garbage-collector-… 53. http://stackoverflow.com/questions/16248600/parallel-computations-with-fast… 54. http://stackoverflow.com/questions/15940473/idiomatic-scala-translation-of-… 55. http://stackoverflow.com/questions/16017294/singleton-types-in-haskell 56. http://stackoverflow.com/questions/16207008/encoding-correctness-constraint… 57. http://stackoverflow.com/questions/15946633/monad-transformers-with-identit… 58. http://stackoverflow.com/questions/15967167/extensible-haskell-type-classes 59. http://stackoverflow.com/questions/16225281/gadts-failed-exhaustiveness-che… 60. http://stackoverflow.com/questions/15959357/quickcheck-arbitrary-instances-… 61. http://stackoverflow.com/questions/16123588/what-is-this-special-functor-st… 62. https://plus.google.com/105107667630152149014/about

1 0