April 2013 - Haskell - Haskell.org

Oregon PL Summer School: register by April 30th
by Amal Ahmed 17 Apr '13

17 Apr '13

*** The registration deadline for this year's Oregon PL Summer School has been extended to April 30th. This year's Oregon Programming Languages Summer School will take place from July 22nd to August 3rd. Full information on registration and scholarships an be found here: http://www.cs.uoregon.edu/Activities/summerschool The school has a long and successful tradition (sponsored by the NSF, ACM SIGPLAN, and industry). It covers current research in the theory and practice of programming languages. Material is presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. Prerequisites are an elementary knowledge of logic and mathematics, as covered in undergraduate classes on discrete mathematics, and some knowledge of programming languages at the level of an undergraduate survey course. A new feature this year is a Coq boot camp session, to be held on July 21st -- one day before the summer school officially begins. The boot camp will provide a one-day, intensive, hands-on introduction to the practical mechanics of the Coq proof assistant. More information is available at the summer school website. This year's program is titled Types, Logic, and Verification. The speakers and topics include: Amal Ahmed -- Logical Relations Northeastern University Robert Harper -- Type Theory Foundations Carnegie Mellon University Dan Licata -- Dependently-Typed Programming in Agda Carnegie Mellon University and Institute for Advanced Study Greg Morrisett -- Coq as a Programming Language Harvard University Simon Peyton-Jones -- Adventures with Types in Haskell Microsoft Research Frank Pfenning -- Linear Logic and Session-based Concurrency Carnegie Mellon University Andrew Tolmach -- Software Foundations in Coq Portland State University Stephanie Weirich -- Designing Dependently-Typed Programming Languages University of Pennsylvania Steve Zdancewic -- Verifying LLVM Optimizations in Coq University of Pennsylvania We hope you can join us for this excellent program! Amal Ahmed Zena Ariola Bob Constable Frank Pfenning Benjamin Pierce OPLSS 2013 organizers

1 0

AI4FM 2013: Final Call for Short Contributions - 1 week to go
by Grov, Gudmund 17 Apr '13

17 Apr '13

---------------------------------------------------- AI4FM 2013 - the 4th International Workshop on the use of AI in Formal Methods http://www.ai4fm.org/ai4fm-2013/ Rennes, France, 22nd July, 2013 In association with ITP 2013 ---------------------------------------------------- --- Final Call for Short Contributions --- *** PhD funding available *** *** New deadline *** General ------- This workshop will bring together researchers from formal methods and AI; it will address the issue of how AI can be used to support the formal software development process, including modelling and proof. Previous AI4FM workshops have included a mix of industrial and academic participants and we anticipate attracting a similarly diverse audience. Industrial use of formal methods is certainly increasing but, in order to make it more mainstream, the cost of applying formal methods, in terms of mathematical skill level and development time, must be reduced â€” we believe that AI can help with these issues. Rigorous software development using formal methods allows the construction of an accurate characterisation of a problem domain that is firmly based on mathematics; by applying standard mathematical analyses, these methods can be used to prove that systems satisfy formal specifications. A recent ACM computing survey paper describes over sixty industrial projects and discusses the effect formal methods have on time, cost and quality. It shows that with tools backed by mature theory, formal methods are becoming cost effective and their use is easier to justify, not as an academic exercise or legal requirement, but as part of a business case. Furthermore, the use of such formal methods is no longer confined to safety critical systems: the list of industrial partners in the EU-funded DEPLOY project is one indication of this broader use. Most methods tend to fit a ``posit-and-prove'' paradigm where the user posits a development step (expressed in terms of specifications of yet-to-be-realised components) that has to be justified by proofs. The associated properties that must be verified are often called proof obligations (POs) or verification conditions. In most cases, such proofs require mechanical support by theorem provers. One can distinguish between automatic and interactive provers, where the latter are generally more expressive but require user interaction. AI has had a large impact on the development of provers. In fact, some of the first AI applications were in theorem proving and all theorem provers now contain heuristics to reduce the search space that can be attributed to AI. Nevertheless, theorem proving research and (pure) AI research have diverged and theorem proving is barely considered to be AI-related anymore. PhD Bursary ----- Formal Methods Europe (FME) has kindly agreed to cover the registration fee for a limited number of PhD students. A proviso for receiving this bursary is that the student presents at the workshop. Scope ----- We encourage submissions presenting work in progress, tools under development, and PhD projects, in order that the workshop can become a forum for active dialogue between the groups involved in theorem provers, formal methods and artificial intelligence. Particular areas of interest include, but are not limited to: * The use of machine learning to support interactive theorem proving; * The use of machine learning to enhance automated theorem proving; * The development of search heuristics; * The us of AI for term synthesis, invariant generation, lemma discovery and concept invention; * The use of AI for counter-example generation; * The use of AI to support and guide the formal modelling process; * The role of AI planning for formal systems developments, from requirements to the end product (including software and hardware); * The interplay between reasoning and modelling and the role of AI in this framework; * Ontologies in the formal engineering process. Submission ---------- The main aim for the workshop is discussion, thus submissions do not need to be original. Extended versions of submissions may have been published previously, or submitted concurrently with or after AI4FM 2013 to another workshop, conference or a journal. Submission is by email to: ai4fm2013(a)ai4fm.org Please submit an abstract up to 3 pages in a PDF format. The extended abstracts will be handed out to all participants, and will be made into a technical report prior to the workshop. Please indicate if you are student and would like to apply for the FME bursary. Acceptance for presentation at the workshop will be made by the organisers based on relevance to the workshop. Important Dates --------------- Submission deadline: April 24, 2013 Notification of acceptance: May 01, 2013 Final version due: May 15, 2013 Workshop: July 22nd, 2013 Organisers ----------------- * Leo Freitas (Newcastle University, UK) * Gudmund Grov (Heriot-Watt University, UK) * Ewen Maclean (University of Edinburgh, UK) Contact Details ---------------- If you have any queries, please email the organisers at the following email address: ai4fm2013(a)ai4fm.org ----- Sunday Times Scottish University of the Year 2011-2013 Top in the UK for student experience Fourth university in the UK and top in Scotland (National Student Survey 2012) 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

RA Position@MSP
by Neil Ghani 17 Apr '13

17 Apr '13

*********************************************************** * RA Position, 4 Years * * Mathematically Structured Programming Group * * University of Strathclyde * *********************************************************** Applications are invited for a 4 year fixed term RA position to work on the EPSRC funded grant "Logical Relations for Program Verification". Logical relations have been developed for core fragments of many modern programming languages and verification systems. But as languages and properties to be proved have become increasingly sophisticated and expressive, logical relations have struggled to keep pace. We aim to revolutionise the landscape of logical relations by providing framework for their development and use that is principled, conceptually simple, reusable, and uniform (rather than ad hoc). Our framework will be capable of both describing the wide array of logical relations already used in existing applications and prescribing new logical relations for future ones. It will be based on the mathematical concept of comprehension for a fibration. You will work with Dr Patricia Johann and Prof Neil Ghani who are the investigators on this project and also 2 of their PhD students working on similar topics. You will also work with project partners Prof A Simpson (Univ. Edinburgh), Dr R Atkey (Contemplate), Dr A Kennedy (Microsoft), Dr N Benton (Microsoft) and Dr C Schuermann (ITU Copenhagen). As a Research Associate you will establish a personal research portfolio, plan research proposals, engage in relevant teaching, undertake professional and knowledge exchange activities, and input to administrative activities, with general support from senior colleagues. You will conduct individual and/or collaborative research, including determining appropriate research methods and contributing to the development of new research methods. You will write up research work for publication, individually or in collaboration with colleagues, and disseminate results as appropriate to the discipline by, for example, peer reviewed journal publications and presentation at conferences. You will join external networks to share information and ideas, inform the development of research objectives and identify potential sources of funding. You will also assist in the supervision of PhD students working on research related to the EPSRC grant. You will be educated to a minimum of PhD level (or equivalent professional experience) in an appropriate discipline. You will have sufficient breadth or depth of knowledge in category theory, type theory and/or the semantics of programming languages. You will have a developing ability to conduct individual research work, to disseminate results and to prepare research papers and proposals and you will have an ability to plan and organise own workload effectively. You will have an ability to work within a team environment and you will have excellent interpersonal and communication skills, with the ability to listen, engage and persuade, and to present complex information in an accessible way to a range of audiences. For further Details please contact Professor Neil Ghani using the email address ng at cis.strath.ac.uk

1 0

Reminder: ICSM 2013 abstract submission due April 17, full paper submission due April 24
by Natalia Dragan 14 Apr '13

14 Apr '13

============================================================================ ICSM 2013 CFP - Research Track ============================================================================ 29th IEEE International Conference on Software Maintenance 22 - 28 September 2013 - Eindhoven, The Netherlands http://icsm2013.tue.nl/ Follow us on Twitter: @IEEEICSM ============================================================================ The deadline for the Research track is approaching! Please read below and refer to the web page for further information. ================================ IMPORTANT DATES ================================ Abstract submission: April 17, 2013 Full papers submission: April 24, 2013 Notification: June 14, 2013 Camera-ready: July 13, 2013 ================================ CHAIRS ================================ General Chair: Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Program Co-chairs: Tom Mens, University of Mons, Belgium and Yann-Gaël Guéhéneuc, École Polytechnique de Montréal, Canada ================================ TOPICS ================================ Topics of Interest include but not limited to: • Software repository analysis and mining • Run-time evolution, dynamic reconfiguration and self adaptation • Reverse engineering, re- engineering and migration • Software refactoring, restructuring and renovation • Software and system comprehension • Code cloning, code provenance, concept location and related research • Change and defect management • Evolution of non-code artefacts (e.g., requirements, design models, documentation, software architectures, business process models) • Maintenance-related testing (e.g., regression testing) • Maintenance and evolution processes • Software quality improvement • Software evolution for emerging paradigms • Human aspects of software evolution ================================ PAPER SUBMISSION ================================ Research papers must adhere to the IEEE CS Proceedings style guidelines and are limited to 10 pages. Further details are available at: http://icsm2013.tue.nl/CFP/index.html

1 0

Foundations of Health Information Engineering and Systems (FHIES 2013) - final call for papers
by Jeremy.Gibbons＠cs.ox.ac.uk 12 Apr '13

12 Apr '13

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 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.) 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 and BOF proposals 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 Intention to submit: April 29th Submission deadline: May 6th 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

[TFP2013] CFP Deadline Extension
by Pieter Koopman 11 Apr '13

11 Apr '13

FINAL CALL FOR PAPERS (DEADLINE EXTENSION) 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ [The deadline has been extended two weeks from April 2nd to April 16th.] 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), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS:http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. 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, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage athttp://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises 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: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging 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 transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional 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 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD 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. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 16th, 2013 (extended) Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: Tuesday, May 14th, 2013 Camera ready for draft proceeding: Tuesday, May 7th, 2013 (extended) The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. http://ce.byu.edu/cw/tfp/ TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Steering Committee Secretary: Marco T. Morazán, Seton Hall University, New Jersey, U.S.A. Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universität Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Schrijvers from Ghent University Viktória Zsók from Eötvös Loránd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://ce.byu.edu/cw/tfp/

1 0

Haskell Weekly News: Issue 265
by Daniel Santa Cruz 11 Apr '13

11 Apr '13

Welcome to issue 265 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 31 to April 6, 2013. Quotes of the Week * Jafet: Haskell is an abstract research language used only in academia, education, banking, stock trading, circuit design, embedded systems, cryptography, operating systems research, bioinformatics, phone apps, and web services. * monochrom: primop is where the turtle tower ends and the russian dolls begin! * sclv: haha. i love this stuff but if i bury myself in it my head will start spinning around like exorcist and i will start spitting blood Top Reddit Stories * Haskell beats C using generalised stream fusion - Geoff Mainland, Simon Peyton Jones, Simon Marlow, Roman Leshchinskiy. Submitted to ICFP 2013 [PDF] Domain: research.microsoft.com, Score: 106, Comments: 47 On Reddit: [1] http://goo.gl/Ui7bS Original: [2] http://goo.gl/es51B * Functor is now a superclass of Monad in GHC HEAD Domain: darcs.haskell.org, Score: 87, Comments: 33 On Reddit: [3] http://goo.gl/B1LYf Original: [4] http://goo.gl/JiunP * Yet Another Lambda Blog » Haskell as fast as C: A case study Domain: lambda.jstolarek.com, Score: 61, Comments: 25 On Reddit: [5] http://goo.gl/cemyl Original: [6] http://goo.gl/uCbTd * Beautiful Concurrency - a series of articles by Simon Peyton-Jones - on FP Complete School of Haskell Domain: fpcomplete.com, Score: 60, Comments: 20 On Reddit: [7] http://goo.gl/pWAA4 Original: [8] http://goo.gl/ynFG8 * Web Woes for Haskell Domain: self.haskell, Score: 43, Comments: 42 On Reddit: [9] http://goo.gl/vl13n Original: [10] http://goo.gl/vl13n * Cap'n Proto: faster protocol buffers, written in Haskell & C++ Domain: kentonv.github.com, Score: 42, Comments: 11 On Reddit: [11] http://goo.gl/6Qwza Original: [12] http://goo.gl/94iip * Resource limits for Haskell Domain: blog.ezyang.com, Score: 38, Comments: 1 On Reddit: [13] http://goo.gl/01WPS Original: [14] http://goo.gl/KjwNx * Dependent Types - A New Paradigm? by Paul Callaghan Domain: pragprog.com, Score: 33, Comments: 1 On Reddit: [15] http://goo.gl/Gjs3K Original: [16] http://goo.gl/4wbYa * So I accidentally a profunctors tutorial Domain: fpcomplete.com, Score: 31, Comments: 43 On Reddit: [17] http://goo.gl/QnzoR Original: [18] http://goo.gl/VDlYh * UPenn CIS 194: Intro to Haskell, Instructor: Brent Yorgey Domain: seas.upenn.edu, Score: 31, Comments: 4 On Reddit: [19] http://goo.gl/zXgrM Original: [20] http://goo.gl/OC3x1 * Sorting with Agda Domain: mazzo.li, Score: 30, Comments: 33 On Reddit: [21] http://goo.gl/rkq58 Original: [22] http://goo.gl/8GRCF * Announcing The Pragmatic Haskeller Domain: cakesolutions.net, Score: 29, Comments: 7 On Reddit: [23] http://goo.gl/3ahrb Original: [24] http://goo.gl/AsOKQ * Flavours of free applicative functors Domain: ro-che.info, Score: 27, Comments: 6 On Reddit: [25] http://goo.gl/oE2sk Original: [26] http://goo.gl/sE5VD * Free Applicative Functors (ICFP submission) Domain: paolocapriotti.com, Score: 25, Comments: 11 On Reddit: [27] http://goo.gl/2dB7B Original: [28] http://goo.gl/VWnHG * Handling out of memory? Domain: self.haskell, Score: 25, Comments: 17 On Reddit: [29] http://goo.gl/mGwUt Original: [30] http://goo.gl/mGwUt * hydra-print - visualizing multiple texts streams Domain: parfunk.blogspot.se, Score: 24, Comments: 7 On Reddit: [31] http://goo.gl/uToAZ Original: [32] http://goo.gl/lc70w * Lazy IO breaks equational reasoning Domain: okmij.org, Score: 24, Comments: 124 On Reddit: [33] http://goo.gl/48f0h Original: [34] http://goo.gl/m8Vbr * Haskell on Windows Domain: gundersen.net, Score: 23, Comments: 14 On Reddit: [35] http://goo.gl/oRV4B Original: [36] http://goo.gl/0hOL4 * Constrained Monads (GADTs indexed by Constraint) Domain: ittc.ku.edu, Score: 21, Comments: 7 On Reddit: [37] http://goo.gl/lVRpl Original: [38] http://goo.gl/jtbU3 Top StackOverflow Questions * Simple examples to illustrate Category, Monoid and Monad? votes: 28, answers: 1 Read on SO: [39] http://goo.gl/HPE8k * Which techniques have contributed the most to Haskell's improving performance? [closed] votes: 18, answers: 1 Read on SO: [40] http://goo.gl/tz904 * Why does Parsec not use Control.Applicative operators votes: 13, answers: 1 Read on SO: [41] http://goo.gl/0mR3f * ghc 7.4.2, Dynamically calling modules votes: 10, answers: 1 Read on SO: [42] http://goo.gl/MZD8q * What's wrong with this implementation of quicksort using Arrows? votes: 10, answers: 2 Read on SO: [43] http://goo.gl/zwhfy * Initializing algebraic data type from list votes: 9, answers: 4 Read on SO: [44] http://goo.gl/nbyUP * Scoped type variables require explicit foralls. Why? votes: 9, answers: 1 Read on SO: [45] http://goo.gl/SUlCf * Parsing UnicodeSyntax with haskell-src-exts votes: 8, answers: 1 Read on SO: [46] http://goo.gl/Yi8Vd Until next time, +Daniel Santa Cruz References 1. http://research.microsoft.com/en-us/um/people/simonpj/papers/ndp/haskell-be… 2. http://www.reddit.com/r/haskell/comments/1br0ls/haskell_beats_c_using_gener… 3. http://darcs.haskell.org/libraries/base/GHC/Base.lhs 4. http://www.reddit.com/r/haskell/comments/1bfojn/functor_is_now_a_superclass… 5. http://lambda.jstolarek.com/2013/04/haskell-as-fast-as-c-a-case-study/ 6. http://www.reddit.com/r/haskell/comments/1bikvs/yet_another_lambda_blog_has… 7. https://www.fpcomplete.com/user/simonpj/beautiful-concurrency 8. http://www.reddit.com/r/haskell/comments/1bm3ep/beautiful_concurrency_a_ser… 9. http://www.reddit.com/r/haskell/comments/1bqsvi/web_woes_for_haskell/ 10. http://www.reddit.com/r/haskell/comments/1bqsvi/web_woes_for_haskell/ 11. http://kentonv.github.com/capnproto/install.html 12. http://www.reddit.com/r/haskell/comments/1bjt4f/capn_proto_faster_protocol_… 13. http://blog.ezyang.com/2013/04/resource-limits-for-haskell/ 14. http://www.reddit.com/r/haskell/comments/1bkjj8/resource_limits_for_haskell/ 15. http://pragprog.com/magazines/2013-04/dependent-types 16. http://www.reddit.com/r/haskell/comments/1bmqba/dependent_types_a_new_parad… 17. https://www.fpcomplete.com/user/liyang/profunctors 18. http://www.reddit.com/r/haskell/comments/1bg21c/so_i_accidentally_a_profunc… 19. http://www.seas.upenn.edu/~cis194/lectures.html 20. http://www.reddit.com/r/haskell/comments/1bqax8/upenn_cis_194_intro_to_hask… 21. http://mazzo.li/posts/AgdaSort.html 22. http://www.reddit.com/r/haskell/comments/1biasi/sorting_with_agda/ 23. http://www.cakesolutions.net/teamblogs/2013/04/05/announcing-the-pragmatic-… 24. http://www.reddit.com/r/haskell/comments/1brbac/announcing_the_pragmatic_ha… 25. http://ro-che.info/articles/2013-03-31-flavours-of-free-applicative-functor… 26. http://www.reddit.com/r/haskell/comments/1be2iv/flavours_of_free_applicativ… 27. http://paolocapriotti.com/blog/2013/04/03/free-applicative-functors/ 28. http://www.reddit.com/r/haskell/comments/1bnql3/free_applicative_functors_i… 29. http://www.reddit.com/r/haskell/comments/1bsucw/handling_out_of_memory/ 30. http://www.reddit.com/r/haskell/comments/1bsucw/handling_out_of_memory/ 31. http://parfunk.blogspot.se/2013/04/hydra-print.html 32. http://www.reddit.com/r/haskell/comments/1bsc9u/hydraprint_visualizing_mult… 33. http://okmij.org/ftp/Haskell/index.html#lazyIO-not-True 34. http://www.reddit.com/r/haskell/comments/1bsitm/lazy_io_breaks_equational_r… 35. http://www.gundersen.net/haskell-on-windows/ 36. http://www.reddit.com/r/haskell/comments/1bsm6v/haskell_on_windows/ 37. http://www.ittc.ku.edu/csdl/fpg/papers/Sculthorpe-13-ConstrainedMonad.html 38. http://www.reddit.com/r/haskell/comments/1bktx3/constrained_monads_gadts_in… 39. http://stackoverflow.com/questions/15726733/simple-examples-to-illustrate-c… 40. http://stackoverflow.com/questions/15750998/which-techniques-have-contribut… 41. http://stackoverflow.com/questions/15767978/why-does-parsec-not-use-control… 42. http://stackoverflow.com/questions/15824756/ghc-7-4-2-dynamically-calling-m… 43. http://stackoverflow.com/questions/15849550/whats-wrong-with-this-implement… 44. http://stackoverflow.com/questions/15734573/initializing-algebraic-data-typ… 45. http://stackoverflow.com/questions/15800878/scoped-type-variables-require-e… 46. http://stackoverflow.com/questions/15784076/parsing-unicodesyntax-with-hask… 47. https://plus.google.com/105107667630152149014/about

1 0

SBLP 2013: Final CFP, deadline for Abstracs 19/4
by Andre Rauber Du Bois 10 Apr '13

10 Apr '13

[Apologies if you receive multiple copies of this CFP] ======================================================= CALL FOR PAPERS 17th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES Brasília, Distrito Federal, Brazil September 29th to October 4th, 2013 http://cbsoft2013.unb.br/en/sblp-en ======================================================== IMPORTANT DATES Paper abstract submission (15 lines): April 19th Full paper submission: April 26th, 2013 Notification of acceptance: May 31st, 2013 Final papers due: June 28th, 2013 INVITED SPEAKERS * Tim Harris, Oracle Labs * More TBA INTRODUCTION The 17th Brazilian Symposium on Programming Languages, SBLP 2013, will be held in Brasília, Brazil, on September 29th to October 4th, 2013. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. The symposium will be part of the 4th Brazilian Conference on Software: Theory and Practice, CBSoft 2013, http://cbsoft2013.cic.unb.br/, which will host four traditional, well-established symposia: * XXVII Brazilian Symposium on Software Engineering (SBES) * XVII Brazilian Symposium on Programming Languages (SBLP) * XVI Brazilian Symposium on Formal Methods (SBMF) * VII Brazilian Symposium on Components, Software Architecture and Software Reuse (SBCARS) SBLP 2013 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Contributions should be written in Portuguese or English. We solicit papers that should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. Full papers submitted in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer. For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting on partial results of on-going master dissertations or doctoral theses. All accepted papers will be published in the conference proceedings distributed in a digital media by the CBSOFT organizers. Submissions should be done using SBLP 2013 installation of the EasyChair conference mangement system at http://www.easychair.org/conferences/?conf=sblp2013. As in previous editions, a journal special issue, with selected papers from accepted contributions, is anticipated. Selected papers from 2003 to 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP from 2009 to 2012, also with selected papers from the conference proceedings, are being edited as special issues of Science of Computer Programming, published by Elsevier. CBSOFT CHAIRS Genaina Nunes Rodrigues, UnB Rodrigo Bonifácio, UnB Diego Aranha, UnB PROGRAMME CHAIRS André Rauber Du Bois, UFPel Phil Trinder, Glasgow University PROGRAMME COMMITTEE Alberto Pardo, Univ. de La Republica Alex Garcia, IME Alvaro Freitas Moreira, UFRGS André Rauber Du Bois, UFPel (co-chair) Andre Santos, UFPE Carlos Camarao, UFMG Christiano Braga, UFF Edwin Brady, University of St. Andrews Fernando Castor Filho, UFPE Fernando Quintão Pereira, UFMG Francisco Heron de Carvalho Junior, UFC Hans-Wofgang Loidl, Heriot-Watt University Jeremy Singer, Glasgow University Joao Saraiva, Universidade do Minho João F. Ferreira, Teesside University Lucilia Figueiredo, UFOP Luis Soares Barbosa, Univ. do Minho Manuel António Martins, Univ. de Aveiro Marcelo A. Maia, UFU Marcello Bonsangue, Leiden Univ/CWI Marcelo d'Amorim, UFPE Marco Tulio Valente, UFMG Mariza A. S. Bigonha, UFMG Martin A. Musicante, UFRN Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Phil Trinder, Glasgow University (co-chair) Qiu Zongyang, Beijing University Rafael Dueire Lins, UFPE Renato Cerqueira, PUC-Rio Ricardo Massa, UFPE Roberto S. Bigonha, UFMG Roberto Ierusalimschy, PUC-Rio Sandro Rigo, UNICAMP Sergio Soares, UFPE Simon Thompson, Univ. of Kent Varmo Vene, Univ. de Tartu

1 0

PhD/Postdoc Position at U Tübingen (Germany)
by Torsten Grust 09 Apr '13

09 Apr '13

[ Dear Haskell folks, while the job posting below may sound somewhat ``databasey'', our group performs most of its research in the trenches between the PL and DB worlds. Haskell definitely is our research vehicle of choice. Database-Supported Haskell (Hackage: DSH) and our work on bringing back monad comprehensions into GHC are testament to this, I guess. Please consider joining us! Cheers, Torsten ] Starting October 2013, the DATABASE SYSTEMS Chair (Prof. Dr. Torsten Grust) at the Wilhelm-Schickard-Institute for Computer Science of Universität Tübingen (Germany), has a vacant position for a RESEARCH ASSISTANT. We encourage both, university graduates and Postdocs, to apply. = RESEARCH & TEACHING = Our team currently performs research in the following areas: - the interplay of database technology and various aspects of functional programming languages, - the compilation and optimization of (new) database languages, and - database systems for non-relational data (trees, nested lists, ...). It is a principle of our work to construct systems (see db.inf.uni-tuebingen.de/research/dsh or ferry-lang.org) that make our ideas tangible and assessable. The chair's research contributions are recognized internationally and more often than not are the fruit of collaboration with associated research groups. Our teaching activities embrace the classical topics of database technology as well as Computer Science, both at undergraduate and graduate levels. Whenever possible, we try to intertwine our research and teaching activities. = REQUIREMENTS = We are looking forward to grow our team and welcome applications of highly motivated candidates with an excellent university degree (in Computer Science or a closely related field) who are willing to support our research and teaching efforts. We are open to proposals for new research directions and hope that you like systems building as much as we do. Good knowledge of German (teaching) as well as English (research and publication) are a requirement. = JOB DETAILS AND APPLICATION = Successful candidates will sign a contract with the Universität Tübingen under the current regulations applicable to employees in Public Service (TV?D). You will be working in Tübingen, the traditional university town in the Neckar valley (Stutgart region). Tübingen is a beautiful and lively medieval town with a large university population. Located in southern Germany, at the edge of the Swabian Jura and Blackwood Forest, the surrounding country is characterized by rolling hills, forests, river valleys, historic towns, and extensive walking and biking trails. The quality of life is excellent. Universität Tübingen aims at increasing the number of female employees and thus especially welcomes applications of female candidates. Applications of disabled candidates will be given priority, depending on their suitability. Please send your complete application in PDF format via e-mail to Prof. Dr. Torsten Grust (torsten.grust(a)uni-tuebingen.de) The deadline for applications is May 19, 2013. Inquiries with respect to this position may be directed to Prof. Dr. Torsten Grust +49 7071 / 29 75477 torsten.grust(a)uni-tuebingen.de db.inf.uni-tuebingen.de/team/grust -- | Prof. Dr. Torsten Grust | Database Systems — Universität Tübingen (Germany) | torsten.grust(a)uni-tuebingen.de | db.inf.uni-tuebingen.de

1 0

besout
by Abdelwaheb Miled 09 Apr '13

09 Apr '13

I'm pleased to announce that I've uploaded the *besout* package to hackage. http://hackage.haskell.org/package/besout *besout* is intended to compute extended gcd of polynomials over F_p[x]. The three main functions of *besout* are : *multPolyZ* : product of two polynomial P , Q in F_p[x] using a technique similar to Horner rules. *euclidanPolyMod* : quotient and remainder of euclidean division of polynomial P by Q in the ring F_p[x] where p is a prime number. *extendedgcdpoly* : extended gcd of polynomials P and Q in the ring F_p[x] where p is a prime number. I am open to suggestions. Abdelwaheb Miled

1 0