- Haskell - Haskell.org

ANNOUNCE: Arion
by Karun Ramakrishnan 01 Apr '15

01 Apr '15

Three of us have been working on Arion for a week or two now. It's a watcher and runner for Hspec tests. It associates source files with test files, watches the file system, and when a file changes it runs the corresponding test files instead of running all the test files, making the process of red-green-refactor faster. We are happy to announce that we have a nice and stable version (0.1.0.8). Thanks to the folks at hspec.github.io for listing our project on their website. To know more, please visit - https://github.com/karun012/arion Feedback/Feature Requests/Everything else welcome.

1 0

Mentoring workshop @ ICFP
by Stephanie Weirich 27 Mar '15

27 Mar '15

CALL for Applications for Student Travel Support SIGPLAN Programming Languages Mentoring Workshop @ ICFP Vancouver, BC (co-located with ICFP 2015) Sunday, August 30th, 2015 http://www.cis.upenn.edu/~sweirich/icfp-plmw15/ We are pleased to invite students interested in functional programming research to the programming languages mentoring workshop at ICFP. The goal of this workshop is to introduce senior undergraduate and early graduate students to research topics in functional programming as well as provide career mentoring advice to help them get through graduate school, land a great job, and succeed. We have recruited leaders from the functional programming community to provide overviews of current research topics, and give students valuable advice about how to thrive in graduate school, search for a job, and cultivate habits and skills that will help them in research careers. This workshop is part of the activities surrounding ICFP, the International Conference on Functional Programming, and takes place the day before the main conference. One goal of the workshop is to make the ICFP conference more accessible to newcomers and we hope that participants will stay through the entire conference. Through the generous donation of our sponsors, we are able to provide travel scholarships to fund student participation. These travel scholarships will cover reasonable travel expenses (airfare, hotel and registration fees) for attendance at both the workshop and the ICFP conference. Anyone may apply for a travel scholarship, but first priority will be given to women and underrepresented minority applicants from the United States and Canada. The workshop is open to all. Students with alternative sources of funding for their travel and registration fees are welcome. In particular, many student attendance programs provide full or partial travel funding for students to attend ICFP 2015, including the ACM Student Research Competition. More information about student attendance programs at ICFP is available: http://icfpconference.org/icfp2015/student-attendance.html APPLICATION for TRAVEL SUPPORT: The travel funding application is available here: http://www.cs.ubc.ca/~rxg/icfp-plmw/ The deadline for full consideration of funding is April 24th, 2015. Selected participants will be notified starting June 5th. ORGANIZERS: Ron Garcia, University of British Columbia Stephanie Weirich, University of Pennsylvania with Kathleen Fisher, Tufts University (and General Chair, ICFP 2015)

1 0

AVoCS 2015: Second Call for Papers
by YuHui Lin 27 Mar '15

27 Mar '15

--------------------------------------------------------------------- SECOND CALL FOR PAPERS The 15th International Workshop on Automated Verification of Critical Systems AVoCS 2015 1-4 September 2015, Edinburgh, UK https://sites.google.com/site/avocs15/ avocs2015(a)easychair.org --------------------------------------------------------------------- IMPORTANT DATES Submission of abstract for full papers: 5th June 2015 Submission of full papers: 12th June 2015 Notification (full papers): 14th July 2015 Submission of research idea papers: 7th August 2015 Notification (research idea): 14th August 2015 Early registration: 18th August 2015 Submissions of final versions: 21st August 2015 INVITED SPEAKERS Colin O'Halloran (D-RisQ & the University of Oxford) Don Sannella (Contemplate & the University of Edinburgh) SPONSORS Formal Methods Europe (FME) The Scottish Informatics & Computer Science Alliance (SICSA) BACKGROUND The aim of Automated Verification of Critical Systems (AVoCS) 2015 is to contribute to the interaction and exchange of ideas among members of the international research community on tools and techniques for the verification of critical systems. SCOPE The subject is to be interpreted broadly and inclusively. It covers all aspects of automated verification, including model checking, theorem proving, SAT/SMT constraint solving, abstract interpretation, and refinement pertaining to various types of critical systems which need to meet stringent dependability requirements (safety-critical, business-critical, performance-critical, etc.). Contributions that describe different techniques, or industrial case studies are encouraged. The technical programme will consist of invited and contributed talks and also allow for short presentations of research ideas. The workshop will be relatively informal, with an emphasis on discussion where special discussion sessions will be organised around the research ideas presentations. Topics include (but are not limited to): - Model Checking - Automatic and Interactive Theorem Proving - SAT, SMT or Constraint Solving for Verification - Abstract Interpretation - Specification and Refinement - Requirements Capture and Analysis - Verification of Software and Hardware - Specification and Verification of Fault Tolerance and Resilience - Probabilistic and Real-Time Systems - Dependable Systems - Verified System Development - Industrial Applications WORKSHOPS AI4FM 2015: 1 September 2015 -- www.ai4fm.org/ai4fm-2015/ VENUE The event will be held in the International Centre for Mathematical Sciences (ICMS) in the centre of the historic old town of Edinburgh - an UNESCO world heritage site. STUDENT GRANTS Thanks to sponsorships from FME and SICSA we can offer financial support for a limited number of students registering for AVoCS in the form of a registration fee waiver (full or partial). As this is limited, we ask the students that would like to take the advantage of this support to submit a short application. The details on how to apply will be available in due course from the AVoCS webpage. SUBMISSION DETAILS Submissions of full papers to the workshop must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the workshop. Submissions are handled via Easychair: https://easychair.org/conferences/?conf=avocs2015 The papers must be written in English and not exceed 15 pages and should use the dedicated AVoCS 2015 EASST template available rom the the following link (for LaTeX and Word): http://journal.ub.tu-berlin.de/eceasst AVoCS also encourages the submissions of research ideas in order to stimulate discussions at the workshop. Reports on ongoing work or surveys on work published elsewhere are welcome. The Programme Committee will select research ideas on the basis of submitted abstracts according to significance and general interest. Research ideas must be written in English and not exceed 2 pages using the EASST template. The presentation of these ideas will be organised around discussions, where the presenter should also prepare a set of question in which the audience will discuss. PROCEEDINGS At the workshop, pre-proceedings will be available in the form of a Heriot-Watt University Technical Report; this report will also include the research ideas. After the workshop, the authors of accepted full papers will have about one month in order to revise their papers for publication in the workshop post- proceedings which will appear in the Electronic Communications of the EASST Open Access Journal. Research ideas will not be part of the proceedings in the Open Access Journal. SPECIAL SCP JOURNAL ISSUE Authors of a selection of the best papers presented at the workshop will be invited to submit extended versions of their work for publication in a special issue of Elsevier's journal Science of Computer Programming. PROGRAM COMMITTEE Ernie Cohen, University of Pennsylvania, USA Ewen Denney, NASA Ames, USA Jean-Christophe Filliatre, CNRS, France Michael Goldsmith, University of Oxford, UK Gudmund Grov, Heriot-Watt University, UK (co-chair) Keijo Heljanko, Aalto University, Finland Mike Hinchey, University of Limerick, Ireland Marieke Huisman, University of Twente, Netherlands Andrew Ireland, Heriot-Watt University, UK (co-chair) Gerwin Klein, NICTA/UNSW, Australia Thierry Lecomte, ClearSy, France Peter Gorm Larsen, Aarhus University, Denmark Panagiotis (Pete) Manolios, Northeastern University, USA Stephan Merz, INRIA Nancy & LORIA, France Jaco van de Pol, University of Twente, Netherlands Markus Roggenbach, Swansea University, UK Marco Roveri, FBK, Italy Thomas Santen, Microsoft Research, Germany Bernard Steffen, Technical University Dortmund, Germany Jan Strejček, Masaryk University, Czech Republic Jun Sun, Singapore University of Technology and Design, Singapore Tayssir Touili, LIAFA, CNRS & University Paris Diderot, France Helen Treharne, University of Surrey, UK Laurent Voisin, Systerel, France Angela Wallenburg, Altran, UK John Wickerson, Imperial College London, UK Peter Ölveczky, University of Oslo, Norway ORGANISERS Gudmund Grov, Heriot-Watt University, UK Andrew Ireland, Heriot-Watt University, UK Yuhui Lin, Heriot-Watt University, UK (Local arrangements and publicity chair) STEERING COMMITTEE Michael Goldsmith, University of Oxford, UK Stephan Merz, INRIA Nancy & LORIA, France Markus Roggenbach, Swansea University, UK ----- We invite research leaders and ambitious early career researchers to join us in leading and driving research in key inter-disciplinary themes. Please see www.hw.ac.uk/researchleaders for further information and how to apply. Heriot-Watt University is a Scottish charity registered under charity number SC000278.

1 0

ANNOUNCE: GHC version 7.10.1
by Austin Seipp 27 Mar '15

27 Mar '15

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.10.1 ============================================================== The GHC Team is pleased to announce a new major release of GHC. There have been a number of significant changes since the last major release, including: * Several new language features and changes have been implemented: - Applicative is now a superclass of Monad and in the Prelude. - Many prelude combinators have been generalized - Static pointers * GHC now has preliminary and experimental support for DWARF based debugging. * `integer-gmp` has been completely rewritten. * Type-checking plugins can now extend the type checker. * Support for partial type signatures * Many bugfixes and other performance improvements. * Preliminary support for 'backpack' features like signatures. * Typeable is now generated by default for all data types automatically. We've also fixed a handful of issues reported since RC3: - A bug in the call arity analysis that would result in invalid core was fixed (#10176) - A bug in the Win32 package causing it to fail to load was fixed (#10165) - ghc-prim has (correctly) been bumped to version 0.4.0.0, to comply with the PVP. - Several libraries have been bumped to their latest available versions after coordination. The full release notes are here: https://downloads.haskell.org/~ghc/7.10.1/docs/html/users_guide/release-7-1… How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: https://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: https://ghc.haskell.org/trac/ghc/wiki/Platforms https://ghc.haskell.org/trac/ghc/wiki/CodeOwners Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: https://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: https://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at https://www.haskell.org/mailman/listinfo/glasgow-haskell-users https://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see https://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: https://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: https://www.haskell.org/ghc/reportabug Hashes & Signatures ~~~~~~~~~~~~~~~~~ On https://downloads.haskell.org/~ghc/7.10.1/ you will find a signed copy of the SHA256 hashes for the tarballs, using my GPG key (0F8F 3AA9 9235 C704 ADA0 B419 B942 AEE5 3B58 D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0

VSTTE 15, Second Call for Papers
by Daniel Bundala 26 Mar '15

26 Mar '15

********************************************************************** 7th Working Conference on Verified Software: Theories, Tools, and Experiments July 18 - 19, 2015 San Francisco, California, USA http://www.eecs.berkeley.edu/vstte15 Co-located with 25th Conference on Computer Aided Verification (http://i-cav.org/2015) ********************************************************************** Full Paper Submission Deadline: April 27, 2015 SCOPE: The Seventh Working Conference on Verified Software: Theories, Tools, and Experiments follows a successful inaugural working conference at Zurich in 2005 followed by conferences in Toronto (2008), Edinburgh (2010), Philadelphia (2012), Atherton (2013), and Vienna (2014). The goal of this conference is to advance the state of the art in the science and technology of software verification, through the interaction of theory development, tool evolution, and experimental validation. We welcome submissions describing significant advances in the production of verified software, i.e., software that has been proved to meet its functional specifications. We are especially interested in submissions describing large-scale verification efforts that involve collaboration, theory unification, tool integration, and formalized domain knowledge. We welcome papers describing novel experiments and case studies evaluating verification techniques and technologies. Topics of interest include education, requirements modeling, specification languages, specification/verification case-studies, formal calculi, software design methods, automatic code generation, refinement methodologies, compositional analysis, verification tools (e.g., static analysis, dynamic analysis, model checking, theorem proving, satisfiability), tool integration, benchmarks, challenge problems, and integrated verification environments. PAPER SUBMISSION Papers will be evaluated by at least three members of the Program Committee. We are accepting both long (limited to 16 pages) and short (limited to 10 pages) paper submissions, written in English. Short submissions also cover Verification Pearls describing an elegant proof or proof technique. Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions must be in LNCS format and must include a cogent and self-contained description of the ideas, methods, results, and comparison to existing work. Submissions of theoretical, practical, and experimental contributions are equally encouraged, including those that focus on specific problems or problem domains. Papers should be submitted through: https://www.easychair.org/conferences/?conf=vstte2015. Submissions that arrive late, are not in the proper format, or are too long will not be considered. The post-conference proceedings of VSTTE 2015 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. The use of LaTeX and the Springer LNCS class files, obtainable fromhttp://www.springer.de/comp/lncs/authors.html, is strongly encouraged. PUBLICATION Accepted papers will be published as post-Proceedings, to appear in Springer's Lectures Notes in Computer Science. IMPORTANT DATES: Abstract submission: April 20, 2015 Full paper submission: April 27, 2015 Notification: June 8, 2015 ORGANIZATION: General Chair: Martin Schaef (SRI International) Program Chairs: Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) Sanjit A. Seshia (University of California, Berkeley) Publicity Chair: Daniel Bundala (UC Berkeley) PROGRAM COMMITTEE: Elvira Albert (Complutense University of Madrid) Nikolaj Bjorner (Microsoft Research) Evan Chang (University of Colorado, Boulder) Ernie Cohen (University of Pennsylvania) Jyotirmoy Deshmukh (Toyota) Jin Song Dong (National University of Singapore) Vijay D'Silva (Google) Vijay Ganesh (University of Waterloo) Alex Groce (Oregon State) Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) (co-chair) Bill Harris (Georgia Institute of Technology) Chris Hawblitzel (Microsoft Research) Bart Jacobs (Katholieke Universiteit Leuven, Belgium) Susmit Jha (United Technologies) Rajeev Joshi (Laboratory for Reliable Software, Jet Propulsion Laboratory) Vladimir Klebanov, Karlsruhe Institute of Technology, DE Akash Lal (Microsoft Research India) Ruzica Piskac (Yale) Zvonimir Rakamaric (University of Utah) Kristin Yvonne Rozier (University of Cincinnati) Sanjit A. Seshia (UC Berkeley) (co-chair) Natarajan Shankar (SRI) Carsten Sinz (KIT) Nishant Sinha (IBM Research Labs) Alexander Summers (ETH Zurich) Zachary Tatlock (University of Washington) Sergey Tverdyshev (Sysgo AG) Arnaud Venet (CMU / NASA Ames Research Center) Karen Yorav (IBM Haifa Research Lab) ********************************************************************** Please contact vstte2015(a)easychair.org for further information **********************************************************************

1 0

CFP: Erlang Workshop 2015
by Hans Svensson 24 Mar '15

24 Mar '15

Hello all, Please find below the Call for Papers for the Fourteenth ACM SIGPLAN Erlang Workshop. Apologies for any duplicates you may receive. CALL FOR PAPERS =============== Fourteenth ACM SIGPLAN Erlang Workshop ----------------------------------------------------------- Vancouver, Canada, September 4, 2015 Satellite event of the 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015) August 30 - September 5, 2015 _http://www.erlang.org/workshop/2015/ErlangWorkshop2015.html_ Erlang is a concurrent, distributed functional programming language aimed at systems with requirements of massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for 16 years, creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, databases, and computer telephony and messaging. Erlang programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. We invite three types of submissions. 1. Technical papers describing language extensions, critical discussions of the status quo, formal semantics of language constructs, program analysis and transformation, virtual machine extensions and compilation techniques, implementations and interfaces of Erlang in/with other languages, and new tools (profilers, tracers, debuggers, testing frameworks, etc.). The maximum length for technical papers is restricted to 12 pages. 2. Practice and application papers describing uses of Erlang in the "real-world", Erlang libraries for specific tasks, experiences from using Erlang in specific application domains, reusable programming idioms and elegant new ways of using Erlang to approach or solve a particular problem. The maximum length for the practice and application papers is restricted to 12 pages. Note that this is a maximum length; we welcome shorter papers also, and the program committee will evaluate all papers on an equal basis independent of their lengths. 3. Poster presentations describing topics related to the workshop goals. Each includes a maximum of 2 pages of the abstract and summary. Presentations in this category will be given an hour of shared simultaneous demonstration time. Workshop Co-Chairs ------------------ Hans Svensson, QuviQ AB, Sweden Melinda Tóth, Eötvös Loránd University, Hungary Program Committee ----------------------------- (Note: the Workshop Co-Chairs are also committee members) Jesper L. Andersen, Independent Clara Benac Earle, Technical University of Madrid, Spain Laura M. Castro, University of A Coruña, Spain Christopher Meiklejohn, Basho Technologies, Inc., US Samuel Rivas, Klarna AB, Sweden Tee Teoh, Erlang Solutions Ltd, UK Simon Thompson, University of Kent, UK Important Dates ----------------------- Submissions due: Friday, 22 May, 2015 Author notification: Friday, 26 June, 2015 Final copy due: Sunday, 19 July, 2015 Workshop date: September 4, 2015 Instructions to authors -------------------------------- Papers must be submitted online via EasyChair (via the "Erlang2015" event). The submission page is https://www.easychair.org/conferences/?conf=erlang2015 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Each submission must adhere to SIGPLAN's republication policy. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Paper submissions will be considered for poster submission in the case they are not accepted as full papers. Venue & Registration Details ------------------------------------------ For registration, please see the ICFP 2015 web site at: http://icfpconference.org/icfp2015/ Related Links -------------------- ICFP 2015 web site: http://www.icfpconference.org/icfp2015/ Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/ Open Source Erlang: http://www.erlang.org/ EasyChair submission site: https://www.easychair.org/conferences/?conf=erlang2015 Author Information for SIGPLAN Conferences: http://www.sigplan.org/authorInformation.htm Atendee Information for SIGPLAN Events: http://www.sigplan.org/Resources/Policies/Anti-harassment

1 0

Doctoral Teaching Assistantships in CS at Oxford
by Jeremy Gibbons 20 Mar '15

20 Mar '15

DOCTORAL TEACHING ASSISTANTSHIPS SOFTWARE ENGINEERING PROGRAMME DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF OXFORD The University of Oxford's Computer Science department is offering two DPhil (PhD) scholarships. The scholarships are for up to five years; they include teaching responsibilities on the department's Software Engineering Programme (SEP), which has been running for over twenty years, offering part-time professional Master's degrees in Software Engineering and in Software & Systems Security. Each scholarship provides a stipend (£14057 pa from October 2015, with small annual increases subsequently) plus full fees. The Department of Computer Science was established in 1957, making it one of the longest established in the country. It is one of the UK's leading computer science departments, ranked first in a number of international rankings. The latest Research Excellence Framework (REF 2014) resulted in the 74 members of the Department having 87% of their research activity ranked 4* ("world-leading") or 3* (internationally excellent"). Successful applicants will perform their research within the department, with the aim of obtaining a DPhil in Computer Science. Applications are particularly sought from students with research interests in core areas taught in SEP: * software engineering * programming languages * systems security * embedded and mobile systems * formal modelling techniques * semantic technologies * automated verification More information about the department's research in these areas may be found at http://www.cs.ox.ac.uk/research/. The scholarships have a teaching component, in line with the five-year duration. This will involve acting as a Teaching Assistant (TA) and second marker for six one-week SEP modules per year. First-hand professional experience of software engineering or systems security is therefore desirable, albeit not essential. Class sizes are small, with at most students 20 per module. More information about the modules may be found at http://www.cs.ox.ac.uk/softeng/courses/subjects.html. Applications should include a full CV, a description of past teaching experience in relation to core SEP modules, the names of two referees, and a one- to two-page presentation of the candidate's research interests and proposed DPhil topic. They should be sent by email, to tadphil(a)softeng.ox.ac.uk, to arrive no later than noon on Friday 17th April. Applicants should also arrange for their referees to send references to the same address by the same date. Selection will be on the basis of both fit to the teaching programme and suitability of the proposed research topic. We plan to hold interviews (possibly by Skype) during the week of 20th to 24th April. If you have any queries, please feel free to contact us on tadphil(a)softeng.ox.ac.uk. Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0

[TFP'15] final call for papers - deadline extended march 31 -
by Peter Achten 18 Mar '15

18 Mar '15

----------------------------- L A S T C A L L F O R P A P E R S ----------------------------- ======== 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. == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp2015 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: March 31, 2015 Notification: April 7, 2015 Registration: May 4, 2015 TFP Symposium: June 3-5, 2015 Student papers feedback: June 9, 2015 Submission for formal review: July 1, 2015 Notification of acceptance: September 8, 2015 Camera ready paper: October 8, 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

Haskell Weekly News
by Kim-Ee Yeoh 18 Mar '15

18 Mar '15

*Top picks:* - Simon Marlow, who built much of GHC's runtime, now works at Facebook. He contributes to Haxl, a tool to "automatically batch and overlap requests for data from multiple data sources in a rule engine for identifying malicious content." In a talk last year at FP Days <http://fpdays.net/2014/sessions/index.php?session=21>, he explains how you too can use Haxl in your projects. The video was just made available at <http://www.infoq.com/presentations/remote-access-haxl> InfoQ <http://www.infoq.com/presentations/remote-access-haxl>. Hat-tip to redditor Pikachut <http://www.reddit.com/r/haskell/comments/2z049t/remote_access_made_easy_and…> for links to slides <https://github.com/simonmar/fpdays14/blob/master/Haxl%20-%20FP%20Days%20201…> and code <https://github.com/simonmar/fpdays14>. - GHC builds can be frightfully slow. Karel Gardas <http://comments.gmane.org/gmane.comp.lang.haskell.ghc.devel/8233> wonders how he can speedup builds on his 32-threaded SPARC T2000. Folks point him toward Andrey Mokhov's ongoing investigation <https://github.com/snowleopard/shaking-up-ghc> of Neil Mitchell's shake <http://community.haskell.org/~ndm/shake/> to replace GHC's current use of GNU make. SPJ hopes that it "will make a big difference." - Back in September last year, Ahmad Fatoum <https://github.com/haskell/win32/issues/24> asks whether we can fix the Win32 FFI so that it supports optional params? Some Win32 functions -- e.g. see FindWindow <https://msdn.microsoft.com/en-us/library/windows/desktop/ms633499%28v=vs.85…> -- accept NULL pointers as invocation of default behavior, currently impossible from Haskell. One option is to make copies of over 100 functions to prevent existing client code from breaking. A more radical one is to extend the existing FFI in-place and alter the type signatures by Maybe-fying the params that are actually optional. The vocal opinion is in favor of the latter, deeper fix. Yitzchak Gale <http://haskell.1045720.n5.nabble.com/Proposed-significant-breaking-changes-…> recently brought up the issue on haskell-libraries. - Maurizio Vitale <http://haskell.1045720.n5.nabble.com/extracting-a-single-declaration-using-…> asks for a way to extract verbatim a single definition from Haskell source. Michael Sloan shows a way to do it <https://gist.github.com/mgsloan/ac77dd33326322fc6ccd> using haskell-src-exts <https://hackage.haskell.org/package/haskell-src-exts>. - Conor McBride <http://www.reddit.com/r/haskell/comments/2y25ly/language_deriveapplicative/…> discusses Naperian / Representable functors as a subclass of Applicative. Elsewhere in the thread, Ed Kmett remarks that "The Log of a coinductive container being an inductive type is a new result for me." - A subreddit called haskelltil <http://www.reddit.com/r/haskelltil/> (TIL = Today I Learned) for little discoveries was announced on haskell reddit <https://pay.reddit.com/r/haskell/comments/2zcnsl/haskelltil_a_subreddit_for…> . *Repo of the week: *Calvin Cheng <http://calvinx.com/about/>, co-founder and CTO at AlgoAccess, releases code <https://github.com/calvinchengx/learnhaskell> and slides <http://www.slideshare.net/calvinchengx/functional-programming-part01> on learning Haskell for the OO programmer. *In your neighborhood:* - Kat Chuang organized an NYC-based study group <http://www.meetup.com/NY-Haskell/events/220997346/> to dissect Nishan Shukla's Haskell Data Analysis Cookbook <http://haskelldata.com/>. "This is your AHA! <https://github.com/ny-haskell/Action-Haskell-Analysis> Haskell Moment." - Redditor netroby <http://www.reddit.com/r/haskell/comments/2y4e0r/haskell_chinese_user_group_…> launched a QQ instant messaging group <http://en.wikipedia.org/wiki/Tencent_QQ>, code number 424801832, to talk Haskell. *Quote of the week:* Dimitri DeFigueiredo <https://mail.haskell.org/pipermail/beginners/2015-March/014900.html> says about the haskell-beginners mailing list, "This is the friendliest mailing list I have ever subscribed to. The people in this list are so nice that even if Haskell were not so wonderfully elegant, I would like to learn it just to be able to chat and work with them." *Acknowledgments* Thanks to Henk-Jan van Tuyl for help with the Quotes. Thanks to Gershom Bazerman, Roman Cheplyaka, and Artyom for offering assistance on web hosting HWN. *Letter to the Editor:* Can I just say that I'm very much in favour of the new format. There's interesting content that can't just be gained from occasionally checking reddit, there's an actual comment on each one rather than just the headline, and most importantly the quote is still there ;) Sorry if this is adding to a deluge of email that you're now getting because of this. Yours, Anon *Response:* Dear Anon, Glad you're enjoying HWN as much as I do creating and publishing it. I love the quotes too, and I depend on my readers to email me what they'd like to share with Team Haskell. (Sneak peak at the top-secret contingency plan: If I don't have quotes for the week, I ransack the archives. Shhh!! Don't tell anyone.) Yours is the only thank you I received. Appreciation like yours is what keeps HWN going, so let me thank you in return for sharing the love, for I remain Yours editorially, Kim-Ee Yeoh p.s. Stay tuned for an upcoming editorial on what the future holds for HWN. -- Kim-Ee

1 0

There has been discussion on matrix operations and cache thrashing; does management think using Haskell would lead to cash thrashing?
by KC 16 Mar '15

16 Mar '15

There has been discussion on matrix operations and cache thrashing; does management think using Haskell would lead to cash thrashing? What could change management's mind? -- -- Sent from an expensive device which will be obsolete in a few months! :D Casey

2 1