- Haskell - Haskell.org

Call for Contributions - Haskell Communities and Activities Report, November 2015 edition (29th edition)
by Mihai Maruseac 02 Oct '15

02 Oct '15

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

1 0

Call for Scholarship Applications: Programming Languages Mentoring Workshop - a POPL workshop (Deadline: October 23!)
by Dimitrios Vytiniotis 30 Sep '15

30 Sep '15

CALL FOR SCHOLARSHIP APPLICATIONS (Deadline: October 23!) ACM SIGPLAN Programming Languages Mentoring Workshop, St. Petersburg, Florida, USA Tuesday, January 19, 2016 Co-located with POPL 2016 PLMW web page: http://conf.researchr.org/home/PLMW-2016 After the resounding success of the first four Programming Languages Mentoring Workshops at POPL 2012, 2013, 2014, and 2015, we proudly announce the 5th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2016 and organised by Isil Dillig, Derek Dreyer, Ross Tate, and Dimitrios Vytiniotis. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will bring together world leaders in programming languages research and teaching from academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will engage students in a process of imagining how they might contribute to our research community. We especially encourage women and underrepresented minority students to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference. A number of sponsors (listed below) have generously donated scholarship funds for qualified students to attend PLMW. These scholarships should cover reasonable expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN, unless they prefer to opt out during their application. The workshop registration is open to all. Students with alternative sources of funding are welcome as well. APPLICATION for PLMW scholarship. The scholarship application can be accessed from the workshop web site: http://conf.researchr.org/home/PLMW-2016 The deadline for full consideration of funding is FRIDAY, OCTOBER 23. Selected participants will be notified by NOVEMBER 15 or earlier. SPONSORS: NSF ACM SIGPLAN Facebook Jane Street Capital Google Microsoft

1 0

Haskell Weekly News
by Kim-Ee Yeoh 30 Sep '15

30 Sep '15

*Top picks:* - Neil Mitchell reports a stack overflow with 7.10.2 maximumBy <https://ghc.haskell.org/trac/ghc/ticket/10830> that regresses from 7.8.3. His sixth sense points to the Foldable-Traversable coup <https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP> (aka BBP: Burning Bridges Proposal) as culprit. Joachim Breitner investigates and verifies that the bug's indeed caused by BBP's redefinition of maximumBy that changed out foldl1 for foldr1. Neil guesses that with foldl1, "the strictness analysis managed to kick in and optimise things." Joachim opines that "this is more a BBP design issue than a compiler bug." For now, roll your own maximumBy if you're affected. - A reddit question <https://www.reddit.com/r/haskell/comments/3jvyf7/services_for_learners/> asks whether there's a way for "haskell learners to learn haskell from haskell gurus, one-on-one for a fee?" An answer points to CodeMentor <https://www.codementor.io/haskell-experts> where haskellers charge from $15 to $60 per quarter-hour of consultation. Heinrich Apfelmus chimes in to say he's at HackHands <https://hackhands.com/>. - Yair Chuchem, who worked at Google for a year, reveals <https://www.reddit.com/r/haskell/comments/3ij91q/who_works_at_google_and_ho…> how a software engineer's performance metric is gamed to the detriment of the Organizer of the World's Information. Not quite Wally's "I'm gonna write me a new minivan this afternoon" <http://dilbert.com/strip/1995-11-13> but close. To the indignation of his managers, Yair left Google to work with Eyal Lotem on his passion: an Abstract-Syntax-Tree-driven IDE called Lamdu <http://peaker.github.io/lamdu/>, which redditors have already unpacked here <https://www.reddit.com/r/haskell/comments/3k8ek3/lamdu_blog_designing_progr…> . - Ph.D. student Rob Zinkov <http://zinkov.com/posts/2015-08-25-building-a-probabilisitic-interpreter/> demoes a rudimentary Probabilistic Programming Interpreter based on importance sampling. *Quotes of the Week:* - User kyllo on HN: <https://news.ycombinator.com/item?id=10276498#up_10277862> It's an exciting time for Haskell developers right now, we just got an a awesome new build tool (stack), an incredible new server-side framework (servant) and our compile to JS tool (GHCJS) is improving by leaps and bounds. - @gfixler: Was OOP created as a business model to sell complex tooling? @jonruttenberg: <https://twitter.com/jonruttenberg/status/638329205483249664> @gfixler Was #haskell created as a business model to sell complex blog posts? - User breadbox on HN observes: <https://news.ycombinator.com/item?id=10122333#up_10126413> "People think that confidence follows skills, but it’s usually the other way around where skills follow confidence." This is a fact that really needs to be more widely acknowledged. (It also casts the microagressions that have the effect of chipping away at the confidence of women and minorities in a rather uncomfortable light.) - User mgrennan on HN: <https://news.ycombinator.com/item?id=10122784#up_10123667>I understand it is our nature to push away from parents to strike out on our own. I also understand why older people resist change. Magic happens when the young seek to understand the wisdom of their elders and elders hold on to explorer spirit of their youth. -- Kim-Ee

1 0

Proof Engineers Wanted
by Gerwin Klein 30 Sep '15

30 Sep '15

Data61 Seeking Proof Engineers ============================== (applications close 15 October 2015) http://ssrg.nicta.com.au/jobs/proof-engineers2015 If only there was a place where I could prove theorems for money, change the world, and have fun while doing it... Sounds too good to exist? In the Trustworthy Systems team at Data61, formerly known as NICTA, that's what we do for a living. We are the creators of seL4, the world's first fully formally verified operating system kernel with extreme performance and strong security & correctness proofs. Our highly international team is located on the UNSW campus, close to the beautiful beaches of sunny Sydney, Australia, one of the world's most liveable cities. We are looking for multiple motivated entry-level proof engineers who want to join our team, move things forward, and have global impact. We are expanding our team, because seL4 is going places. There are active projects around the world in - Automotive - because cars have been hacked enough - Aviation - for more security and safety for autonomous vehicles - Connected consumer devices - with security built in from the start - SCADA - for more secure intelligent industrial control automation - Spaceflight, autonomous and crewed - because awesome To make these projects successful, we need to scale formal verification. You would - work on industrial-scale formal proofs in Isabelle/HOL - help to extend and improve existing proofs or verify new features in seL4 - contribute to improved proof automation and better reasoning techniques - apply formal proof to real-world systems and tools To apply for this position, you should possess a significant subset of the following skills. - functional programming in a language like Haskell, ML, or OCaml - first-order or higher-order formal logic - basic experience in C - ability and desire to quickly learn new techniques - undergraduate degree in Computer Science, Mathematics, or similar - ability and desire to work in a larger team If you additionally have experience - in software verification with an interactive theorem prover such as Isabelle/HOL or Coq, and/or - with operating systems and microkernels you should definitely apply! If you have the right skills and background, we can provide training on the job. Continual learning is a central component of everything we do. You will work with a unique world-leading combination of OS and formal methods experts, students at undergraduate and PhD level, engineers, and researchers from 5 continents, speaking over 15 languages. Trustworthy Systems is a fun, creative, and welcoming workplace with full health insurance and flexible hours & work arrangements. We value diversity in all forms and welcome applications from people of all ages, including people with a disability, and those who identify as LGBTIQ. See http://ssrg.nicta.com.au/diversity/ for more information. The salary range for this position is AUD 65,000 to 90,000 for recent graduates, depending on experience and qualification. Apply by sending your CV, undergraduate transcript (if applicable), two references, and cover letter to <gerwin.klein(a)nicta.com.au> and <june.andronick(a)nicta.com.au>. This round of applications closes 15 October 2015. The seL4 code and proof are open source. Check them out at https://github.com/seL4 More information about NICTA's Trustworthy Systems team at http://ssrg.nicta.com.au Still studying? We also have internship opportunities! http://ssrg.nicta.com.au/students/ ________________________________ The information in this e-mail may be confidential and subject to legal professional privilege and/or copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.

1 0

ETAPS 2016 final call for papers
by Tarmo Uustalu 28 Sep '15

28 Sep '15

****************************************************************** CALL FOR PAPERS: ETAPS 2016 19th European Joint Conferences on Theory And Practice of Software Eindhoven, The Netherlands, 2-8 April 2016 http://www.etaps.org/2016 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops. ETAPS 2016 is the ninteenth event in the series. -- MAIN CONFERENCES (4-7 April) -- * ESOP: European Symposium on Programming (PC chair Peter Thiemann, Universität Freiburg, Germany) * FASE: Fundamental Approaches to Software Engineering (PC chairs Perdita Stevens, University of Edinburgh, UK, and Andrzej Wasowski, IT University of Copenhagen, Denmark) * FOSSACS: Foundations of Software Science and Computation Structures (PC chairs Bart Jacobs, Radboud Universiteit Nijmegen, The Netherlands, and Christof Löding, RWTH Aachen, Germany) * POST: Principles of Security and Trust (PC chairs Frank Piessens, Katholieke Universiteit Leuven, Belgium, and Luca Viganò, King's College London, UK) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Marsha Chechik, University of Toronto, Canada, and Jean-François Raskin (Université Libre de Bruxelles, Belgium) TACAS '16 hosts the 5th Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Andrew D. Gordon (MSR Cambridge and University of Edinburgh, UK) Rupak Majumdar (MPI Kaiserslautern, Germany) * ESOP invited speaker: Cristina Lopes (University of California at Irvine, USA) * FASE invited speaker: Oscar Nierstrasz (Universität Bern, Switzerland) * POST invited speaker: Vitaly Shmatikov (University of Texas at Austin, USA) -- IMPORTANT DATES -- * 9 October 2015: Submission deadline for abstracts * 16 October 2015: Submission deadline for full papers * 2-4 December 2015: Author response period (ESOP and FoSSaCS only) * 18 December 2015: Notification of acceptance * 8 January 2016: Camera-ready versions due -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE will try a light-weight double-blind review process (see http://www.etaps.org/2016/fase) - Research papers FASE, FOSSACS and TACAS have a page limit of 15 pp (excluding bibliography of max 2 pp) for research papers, whereas POST allows at most 20 pp (excluding bibliography of max 2 pp) and ESOP 25 pp (excluding bibliography of max 2 pp). Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pp, excluding bibliography of max 2 pp). Both TACAS and FASE solicit also regular tool papers (at most 15 pp, excluding bibliography of max 2 pp). - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated. ESOP and FOSSACS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (2-3 April, 8 April) -- Around 20 satellite workshops will take place before and after the main conferences. -- HOST CITY -- Eindhoven is located in the province of North Brabant in the south of the Netherlands. It is the fifth-largest city of the Netherlands. The city is well known for modern art, design and technology. The main airport of the Netherlands is the Amsterdam Airport, Schiphol. All major airlines fly to Schiphol, and Schiphol has a direct and very frequent train connection to Eindhoven. Eindhoven also has a small international airport, Eindhoven Airport, with direct connections to more than thirty destinations in Europe. -- HOST INSTITUTION -- ETAPS 2016 is hosted by Faculteit Wiskunde en Informatica, Technische Universiteit Eindhoven. -- ORGANIZERS * General chair: Jan Friso Groote * Workshops chairs: Erik de Vink and Julien Schmaltz * Publicity chair: Anton Wijs -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at j.f.groote(a)tue.nl, a.j.wijs(a)tue.nl.

1 0

FSCD'16 Preliminary Call for Papers
by Hugo Herbelin 25 Sep '15

25 Sep '15

[On behalf of Masahito Hasegawa] PRELIMINARY CALL FOR PAPERS First International Conference on Formal Structures for Computation and Deduction (FSCD'16) 22 June -- 26 June 2016, Porto, Portugal http://fscd2016.dcc.fc.up.pt/ ========================================================================== IMPORTANT DATES Abstract Submission: 29 January 2016 Paper Submission : 5 February 2016 Rebuttal : 21 - 23 March 2016 Notification : 6 April 2016 ========================================================================== FSCD (http://fscdconference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, proof theory and new emerging models of computation such as quantum computing and homotopy type theory. The name of the new conference comes from an unpublished but important book by Gerard Huet that strongly influenced many researchers in the area. Suggested, but not exclusive, list of topics for submission are: 1 Calculi * Lambda calculus * Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.) * Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.) * Proof theory (natural deduction, sequent calculus, proof nets, etc.) * Type theory and logical frameworks * Homotopy type theory 2. Methods in Computation and Deduction * Type systems (polymorphism, dependent, recursive, intersection, session, etc.) * Induction, coinduction * Matching, unification, completion, orderings * Strategies (normalization, completeness, etc.) * Tree automata * Model building and model checking * Proof search (resolution, paramodulation, narrowing, focusing, etc.) * Constraint solving and decision procedures 3. Semantics * Operational semantics and abstract machines * Game Semantics and applications * Domain theory and categorical models * Quantitative models (timing, probabilities, resources, etc.) * Quantum computation and emerging models in computation 4. Algorithmic Analysis and Transformations of Formal Systems * Type Inference and type checking * Abstract Interpretation * Complexity analysis and implicit computational complexity * Checking termination, confluence, derivational complexity and related properties * Symbolic computation 5. Tools and Applications * Programming and proof environments (proof assistants, automated theorem prover, proof checkers, specialized provers, dependently typed languages, etc.) * Verification tools (abstract interpretation, termination, confluence, specialized provers, etc.) * Libraries for proof assistants and interactive theorem provers (support for variable bindings, nominal, polynomial, equality, etc.) * Case studies in proof assistants and interactive theorem provers (formalizations, mechanizations, certifications) * Certifications (theorems, rewriting techniques, etc.) * Applications of formal systems inside and outside of CS (biology, linguistics, physics, education, etc.) INVITED SPEAKERS To be announced PROGRAM CHAIRS Delia Kesner (Univ. Paris-Diderot) Brigitte Pientka (McGill University) fscd16(a)easychair.org PROGRAM COMMITTEE Andreas Abel (Gothenburg Univ.) Zena Ariola (Univ. Oregon) Patrick Baillot (CNRS & ENS Lyon) Andrej Bauer (Univ. Ljubljana) Eduardo Bonelli (Univ. Quilmes) Patricia Bouyer (ENS Cachan) Ugo Dal Lago (Univ. Bologna) Nachum Dershowitz (Univ. Tel Aviv) Mariangiola Dezani-Ciancaglini (Univ. Torino) Derek Dreyer (MPI-SWS) Santiago Figueira (Univ. Buenos Aires) Marcelo Fiore (Univ. Cambridge) Juergen Giesl (Univ. Aachen) Nao Hirokawa (JAIST) Martin Hofmann (LMU Munchen) Delia Kesner (Univ. Paris-Diderot) Naoki Kobayashi (Univ. Tokyo) Dan Licata (Wesleyan Univ.) Chris Lynch (Clarkson Univ.) Narciso Marti-Oliet (Univ. Complutense) Aart Middeldorp (Univ. Innsbruck) Dale Miller (INRIA Saclay) Cesar Munoz (NASA) Vivek Nigam (Univ. Paraiba) Brigitte Pientka (McGill Univ.) Jakob Rehof (Univ. Dortmund) Xavier Rival (ENS Paris) Peter Selinger (Dalhousie Univ.) Paula Severi (Univ. Leicester) Jakob Grue Simonsen (Univ. Copenhagen) Matthieu Sozeau (INRIA Rocquencourt) Sophie Tison (Univ. Lille) Femke van Raamsdonk (VU Univ. Amsterdam) Nobuko Yoshida (Imperial College) CONFERENCE CHAIR Sandra Alves (University of Porto) FSCD STEERING COMMITTEE: Thorsten Altenkirch (Univ. Nottingham) Gilles Dowek (INRIA) Santiago Escobar (Univ. Politecnica de Valencia) Maribel Fernandez (King's College London) Masahito Hasegawa (Univ. Kyoto) Hugo Herbelin (INRIA) Nao Hirokawa (JAIST) Luke Ong (Chair, Univ. Oxford) Jens Palsberg (UCLA) Kristoffer Rose (Two Sigma Investments) Rene Thiemann (Univ. Innsbruck) Pawel Urzyczyn (Univ. Warsaw) Femke van Raamsdonk (VU Univ. Amsterdam) PUBLICATION The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs). All LIPIcs proceedings are open access. SUBMISSION GUIDELINES Submissions can be made in two categories: regular research papers and system descriptions. Submissions of research papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 15 pages (including figures and bibliography). Submissions of research papers will be judged on originality, significance, correctness, and readability. Submission of system descriptions must describe a working system which has not been published or submitted elsewhere. They must not exceed 10 pages and should contain a link to a working system. System descriptions will be judged on originality, significance, usefulness, and readability. Proofs of theoretical results that do not fit within the page limit, executables of systems, code of case studies, benchmarks used to evaluate a given system, should be made available, via a reference to a website or in an appendix of the paper. Reviewers will be encouraged to consider this additional material, but are not obliged to. Submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. Submissions must be formatted using the LIPIcs style files using the instructions at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ A condition of submission is that, if accepted, one of the authors must attend the conference to give the presentation. Papers should be submitted via easychair. The submission site is at https://easychair.org/conferences/?conf=fscd16 ORGANISING COMMITTEE Sandra Alves (Univ. Porto) Sabine Broda (Univ. Porto) Jose Espirito-Santo (Univ. do Minho) Mario Florido (Univ. Porto) Nelma Moreira (Univ. Porto) Luis Pinto (Univ. do Minho) Rogerio Reis (Univ. Porto) Ana Paula Tomas (Univ. Porto) Pedro Vasconcelos (Univ. Porto) ----- End forwarded message -----

1 0

ANN: CfN for new Haskell Prime language committee
by Herbert Valerio Riedel 25 Sep '15

25 Sep '15

Dear Haskell Community, In short, it's time to assemble a new Haskell Prime language committee. Please refer to the CfN at https://mail.haskell.org/pipermail/haskell-prime/2015-September/003936.html for more details. Cheers, hvr -- PGP fingerprint: 427C B69A AC9D 00F2 A43C AF1C BA3C BA3F FE22 B574

2 1

2nd CfP: SCSS 2016
by Temur Kutsia 25 Sep '15

25 Sep '15

===================== Second Call for Papers ===================== SCSS 2016 The 7th International Symposium on Symbolic Computation in Software Science Ochanomizu University, Tokyo, Japan March 28 - 31, 2016 http://www.i-eos.org/conferences/SCSS2016 Submissions to https://easychair.org/conferences/?conf=scss2016 Important Dates --------------- November 13, 2015: Abstract submission November 20, 2015: Paper submission January 5, 2016: Notification March 28-31, 2016: SCSS 2016 in Ochanomizu University, Tokyo Invited Speakers ---------------- - Peter Paule (Johannes Kepler University Linz, Austria) - Jacques Fleuriot (University of Edinburgh, UK) Tutorial -------- There will be tutorial lectures on symbolic computation. - Tetsu Yamaguchi and colleagues (Maple Soft) - Xavier Dahan (Ochanomizu University, Japan) Scope -------- The purpose of SCSS 2016 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 2016 solicits regular 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 and system security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - related 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 Program Chair ------------- James Davenport (University of Bath, UK) Honorary Chair --------------- Bruno Buchberger (Johannes Kepler University, Austria) General Chair ------------- Tetsuo Ida (University of Tsukuba, Japan) Program Committee ----------------- Kenichi Asai (Ochanomizu University, Japan) Adel Bouhoula (Carthage University, Tunisia) Changbo Chen (Chinese Academy of Sciences, China) Matthew England (Coventry University, UK) Jacques Garrigue (Nagoya University, Japan) Cezary Kaliszyk (University of Innsbruck, Austria) Yukiyoshi Kameyama (University of Tsukuba, Japan) Michael Kohlhase (Jacobs University, Germany) Temur Kutsia (Johannes Kepler University, Austria) Assia Mahboubi (Inria, France) Yasuhiko Minamide (Tokyo Institute of Technology, Japan) Yoshihiro Mizoguchi (Kyushu University, Japan) Julien Narboux (Strasbourg University, France) Renaud Rioboo (ENSIIE, France) Tateaki Sasaki (University of Tsukuba, Japan) Dongming Wang (Beihang University and CNRS, China and France) Stephen Watt (University of Waterloo, Canada) Kazuhiro Yokoyama (Rikkyo University, Japan) Local Arrangement Committee --------------------------- Kenichi Asai (Ochanomizu University, Japan) Houssem Chatbri (University of Tsukuba, Japan) Fadoua Ghourabi (Ochanomizu University, Japan) (Chair) Sosuke Moriguchi (Kwansei Gakuin University, Japan) Akira Terui (University of Tsukuba, Japan) Submission ---------- Submission is via EasyChair: https://easychair.org/conferences/?conf=scss2016 Submissions of regular research papers are invited. Regular research papers must not exceed 12 pages in the EasyChair LaTeX Class format (www.easychair.org/publications/easychair.zip) with up to 3 additional pages for technical appendices. Publication ---------- The proceedings of SCSS 2016 will be published in the EasyChair Proceedings in Computing (EPiC). After the symposium, we will have a combined special issue of the Journal of Symbolic Computation on SCSS 2014 & 2016. The full version of selected papers at SCSS 2014 & 2016 will be considered for the publication of the special issue subjected to the normal peer review process of the journal. The submission deadline of the special issue will be 2 months after the symposium.

1 0

ANNOUNCE: polymap 0.1.0.1
by David Farrell 24 Sep '15

24 Sep '15

I'm excited to announce the first release of a package I've been working on over the last week called polymap, a library providing type-safe polygonal maps whose sides are defined by a kindlist of types zipped with a storage type for each side. I've tried to match the interface exposed by the containers package as closely as possible. For example: import Data.Set (Set) import Data.PolyMap.Nat (first, second, third) import qualified Data.PolyMap as PM mEmpty :: PM.PolyMap '[ '(String, Set), '(Int, Set) ] mEmpty = PM.empty mOne :: PM.SimplePolyMap '[String, Int] Set mOne = PM.singleton ("one", length "one") main = do print mEmpty -- empty PolyMap print mOne -- PolyMap with one Relation print mTwo -- PolyMapwith two Relations print (PM.member first "one" mTwo) -- True print (PM.notMember first "asdf" mTwo) -- True --print (PM.notMember second "asdf" mTwo) -- will not typecheck --print (PM.notMember third "asdf" mTwo) -- will not typecheck print (PM.lookup first "two" mTwo) -- second Relation of PolyMap where mTwo = PM.insert ("two", length "two") mOne This is a short usage example of most of the functions currently written for polymap. There's still a long way to go both in terms of exposed functions and in terms of efficiency and such, but I felt it prudent to make a public release of my work so far as I feel it's reached a stage where it could be beneficial to others. Note that GHC 7.10 (base >=4.8, GHC extensions) is required. Git Repository: https://github.com/shockkolate/hs-polymap Issue Tracker: https://github.com/shockkolate/hs-polymap Hackage: https://hackage.haskell.org/package/polymap The code is licensed under the Unlicense license--that is to say, the code is released into the public domain for the benefit of others. I'd love to hear any feedback/suggestions/improvements/anything you want to say about polymap over the mailing list (which may be more suited to the haskell-cafe mailing list; I don't know) or in #haskell on Freenode (I'm usually in there as Shockk). N.B. Version 0.1.0.0 of the package will not build due to the use of a function in containers that has been submitted as a pull request but does not exist yet/at all.

1 0

Ph.D. Position on Analysis of Energy Consumption of High-Level Programs
by Morten Rhiger 21 Sep '15

21 Sep '15

The following position may be of interest to students with a background in functional programming: A Ph.D. position is available at Roskilde University, Denmark, on "Analysis of energy consumption of high-level programs running on parallel architectures" starting December 1, 2015 or as soon as possible thereafter. The goal of the Ph.D. project is to reduce the energy usage of programs implemented in high-level and declarative programming languages (such as side-effect free, statically typed, data-flow, functional, or domain-specific languages) by (1) studying and developing static analyses of such programs and (2) utilizing the results of these analyses to implement the programs on modern parallel architectures. Applicants are expected to be familiar with high-level programming paradigms, program analysis, type systems, and programming language implementation techniques. The Ph.D. position is funded by the Sino-Danish Center (http://www.sinodanishcenter.com/) and the Ph.D. position will involve extended stays at the Chinese Academy of Sciences in Beijing. The deadline for applications is Friday October 16, 2015. For more information and to apply for the position, see http://www.ruc.dk/job/phd/

1 0