- Haskell - Haskell.org

Call for Papers - Third International Workshop on Bidirectional Transformations (BX 2014)
by Janis Voigtlaender 04 Oct '13

04 Oct '13

Third International Workshop on Bidirectional Transformations (BX 2014) ======================================================================= Friday March 28th, 2014 Athens, Greece co-located with EDBT/ICDT 2014 http://bx-community.wikidot.com/bx2014:home Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational data, software models, documents, graphs, trees, and so on. BX are an emerging topic in a wide range of research areas with prominent presence at top conferences in different fields. However, much of the research in bx tends to get limited exposure outside of a single field of study. The purpose of this workshop series is not only to further research into bx, but to promote cross-disciplinary research and awareness in the area. The first two instances of this workshop, BX'12 and BX'13, served as a dedicated venue for bx in all relevant areas, including: - Databases - Programming Languages - Software Engineering - Graph Transformation This instance of the workshop is the first at a database venue. The workshop rotates between venues in different areas to promote the cross-disciplinary nature of the work, as methodologies used for bx range from classical program transformation and updateable views to graph transformation techniques, from ad-hoc techniques for data synchronization to the development of domain-specific languages and their integration. We also solicit papers on model/metamodel co-evolution, which is a different yet closely related subject. Aims and Topics: ---------------- The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bidirectional transformations from different perspectives, such as: - inversion of data exchange mappings - new perspectives on view updatability - data-schema co-evolution and data synchronization - software-model synchronization - consistency analysis - (coupled) software/model transformations - language-based approaches Submissions can be: - novel research concepts and results - position papers and research perspectives - application of bx in new domains - analysis of gaps between formal concepts and application scenarios - examination of the efficiency of algorithms - analysis/classification of requirements for bx technologies - proposals and justification for benchmarks - summary papers providing novel comparisons between existing technologies - case studies and tool support Submitted papers must be in ACM format in accordance with the other workshops and proceedings at EDBT/ICDT. Papers may be 3-8 pages in length; the length of the paper should be appropriate for the level of completeness of the work. Important Dates: ---------------- Paper submission date: 7th Dec 2013 Author notification: 7th Jan 2014 Camera-ready date: 20th Jan 2014 Workshop date: 28th Mar 2014 Accepted papers will be published in the workshop proceedings of EDBT/ICDT and will be available at the conference. Program Committee: ------------------ Anthony Cleve (University of Namur, Belgium) Carlo Aldo Curino (Microsoft, USA) Zinovy Diskin (McMaster University/University of Waterloo, Canada) Romina Eramo (University of L'Aquila, Italy) Todd Green (LogicBlox, Inc, USA) Soichiro Hidaka (co-chair, National Institute of Informatics, Japan) Martin Hofmann (Ludwig-Maximilians-Universität Munich, Germany) Zhenjiang Hu (National Institute of Informatics, Japan) Marie Jacob (University Of Pennsylvania, USA) Michael Johnson (Macquarie University, Australia) Peter McBrien (Imperial College, UK) Fernando Orejas (Technical University of Catalonia, Spain) Andy Schürr (Technical University of Darmstadt, Germany) Perdita Stevens (University of Edinburgh, UK) James Terwilliger (co-chair, Microsoft, USA) Janis Voigtländer (University of Bonn, Germany) Meng Wang (Chalmers University of Technology, Sweden) Yingfei Xiong (Peking University, China)

1 0

2nd CFP: PLPV 2014, Programming Languages meets Program Verification
by Nils Anders Danielsson 01 Oct '13

01 Oct '13

Second call for papers: PLPV 2014 Programming Languages meets Program Verification San Diego, CA, USA Co-located with POPL 2014 http://www.cse.chalmers.se/~nad/plpv-2014/ Overview -------- The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. One example is provided by dependently typed programming languages, which make it possible to specify and check rich specifications using the languages' type systems. Another example is provided by extended static checking systems, which incorporate contracts with either static or dynamic contract checking. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage interaction between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (based on types, Hoare-logic, abstract interpretation, etc.), target different kinds of programming languages (functional, imperative, object-oriented, etc.), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc.). Important dates --------------- * Submission deadline: 2013-10-09T24:00-12 (midnight at the end of October 9, 2013, UTC-12) * Author notification: November 1, 2013 * Camera-ready papers due: November 17, 2013 * Workshop: January 21, 2014 Submissions ----------- For details about how to format submissions, where to send them, etc., see http://www.cse.chalmers.se/~nad/plpv-2014/call-for-papers.html. Programme committee ------------------- * Adam Chlipala, MIT * Nils Anders Danielsson, University of Gothenburg (co-chair) * Manuel Fähndrich, Microsoft Research * Philipp Haller, Typesafe * Bart Jacobs, Katholieke Universiteit Leuven (co-chair) * Chantal Keller, Aarhus University * Neelakantan R. Krishnaswami, Max Planck Institute for Software Systems * Andres Löh, Well-Typed LLP * Magnus O. Myreen, University of Cambridge * Alexander J. Summers, ETH Zurich

1 0

Vacancy Assistant Professor Software Technology Utrecht University (1, 0 fte)
by Johan Jeuring 30 Sep '13

30 Sep '13

Assistant Professor Software Technology Utrecht University (1,0 fte) Job description The division Software Systems of the Department of Information and Computing Sciences is looking for an Assistant Professor for the bachelor programmes Computing Science and Information Science and the master programmes of the department, and for research in the area of software technology. You are expected to develop an independent line of research within the field of software technology in cooperation with the other members of the division Software Systems. The tasks include: performing scientific research in the field of software systems, in particular software technology; supervising PhD students and acquiring research funding; developing and teaching courses within the bachelor and master programmes of the department; supervising internships and theses; organizational activities within the division, department or faculty. Qualifications We are looking for candidates with a PhD with expertise and experience in scientific education and research in computer science. Expertise in the fields of software technology, programming languages and typing systems, advanced programming methods, or compilers is required. Experience in academic education within a university setting is desired. You have published on the aforementioned areas in national and international conferences and / or journals. Well-developed teaching skills and command of English in speaking and writing are a requirement. Candidates who prefer part-time employment are also invited to apply by specifying the desired part-time ratio. Offer We offer a position in a dynamic environment. The position is for at most five years. The total size of the position is 100%, but part-time is possible. The salary depends on education and experience and ranges between € 2,919 (scale 10) and € ,5070 (scale 12) gross per month for a full-time appointment. Additionally, excellent secondary benefits are provided, such as 8% holiday allowance and 8.3% end of year bonus. We also offer a pension scheme, partially paid parental leave and flexible working conditions. For more information see the terms of employment. The department provides the candidate the necessary support for the arrangements of the education and research line. About the organisation Utrecht University has great ambitions for its teaching quality and study success rates. This also applies to its clear research profiles which are centred around four themes: Sustainability, Life Sciences, Youth & Identity, and Institutions. Utrecht University plays a prominent role in our society and contributes to finding the answers to topical and future societal issues. The Faculty of Science at Utrecht University comprises six departments: Biology, Pharmacy, Information and Computer Sciences, Chemistry, Mathematics and Physics and Astronomy. It has 3500 students and nearly 2000 employees, and is internationally known for its quality in research. The academic programs of the Faculty reflect developments in society and science of today. The Department of Information and Computer Science is nationally and internationally renowned for its fundamental research in computer science and information science. Its research is positioned around game technology, one of the four research themes of the Faculty of Science. The research of the department is grouped into four divisions: Software Systems, Artificial Intelligence, Virtual Worlds and Interaction Technology. The Department offers bachelor programmes in computer science and information science, and four English-language research master-programmes including Computing Science. High enrollment figures and good student ratings make the education very successful. Part of the research of the division Software Systems focuses on how programming languages, methods, and tools can be adapted to support program construction. More specifically, the research covers the following areas: programming languages and compiler construction-tools program analysis interaction analysis, error diagnosis advanced programming methods: generic programming, dependently-typed programming program testing and verification The division aims to design better programming languages and methods; to implement tools and languages that help programmers work more effectively; and to develop products and systems demonstrating the feasibility (and/or validity) of the ideas. An important application area studied in the department and the division is (serious) games. The division mainly contributes to the education in the bachelor programs information science and computer science, and to the master program Computing Science. Additional information For more information please contact Prof.dr. Johan Jeuring +31.30.253.4115 or +31.6.400.100.53, email:J.T.Jeuring@uu.nl. Apply Your application must contain a letter of motivation, your CV with publication list, teaching and research statement, and contact details of at least two references. You can respond via the application button below. The application deadline is 21/10/2013 Assistant Professor Software Technology (1,0 fte)

1 0

Haskell Weekly News: Issue 281
by Daniel Santa Cruz 26 Sep '13

26 Sep '13

Welcome to issue 281 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of September 15 to 21, 2013. Quotes of the Week * jmcarthur: weak algebraic structures? ha! i prefer my algebraic structures to put up more of a fight. * newsham: teach a man to pred and he will pred to zero. teach a man to succ and he will succ forever Top Reddit Stories * Edward C++Hands Domain: bartoszmilewski.com, Score: 83, Comments: 102 On Reddit: [1] http://goo.gl/64LLo4 Original: [2] http://goo.gl/0H0yr7 * Perfect streaming using `pipes-bytestring` Domain: haskellforall.com, Score: 59, Comments: 45 On Reddit: [3] http://goo.gl/oSlzZP Original: [4] http://goo.gl/8xwZjc * Adding safe coercions to Haskell Domain: joachim-breitner.de, Score: 58, Comments: 23 On Reddit: [5] http://goo.gl/2vs5M9 Original: [6] http://goo.gl/n0RYA3 * Which programming languages do you like besides Haskell, and why? Domain: self.haskell, Score: 55, Comments: 104 On Reddit: [7] http://goo.gl/nzgwJQ Original: [8] http://goo.gl/nzgwJQ * GHC HEAD: merged checkable "minimal complete definitions" (#7633) Domain: ghc.haskell.org, Score: 48, Comments: 36 On Reddit: [9] http://goo.gl/VoZVYL Original: [10] http://goo.gl/5F61AX * Do companies ever hire someone who has no Haskell experience to be a Haskell programmer? If I pursue such a job, how important would a Domain: self.haskell, Score: 44, Comments: 50 On Reddit: [11] http://goo.gl/KA998k Original: [12] http://goo.gl/KA998k * [Haskell-cafe] PSA: do not install xcode 5 if you are using ghc 7.6 Domain: haskell.org, Score: 43, Comments: 4 On Reddit: [13] http://goo.gl/ut6k6p Original: [14] http://goo.gl/1G8Syo * Model Analysis - The New York Times’ Erik Hinton breaks down a Fashion Week special Domain: source.mozillaopennews.org, Score: 40, Comments: 4 On Reddit: [15] http://goo.gl/NdVw6l Original: [16] http://goo.gl/bYB8JS * Programming reactively with both barrels (experiences of Haskell/FRP for mobile games) Domain: blog.reactiveprogramming.org, Score: 39, Comments: 7 On Reddit: [17] http://goo.gl/QXacUo Original: [18] http://goo.gl/wLJwt6 * Why monads have not taken the Common Lisp world by storm [r/lisp] Domain: reddit.com, Score: 33, Comments: 14 On Reddit: [19] http://goo.gl/tZUVWx Original: [20] http://goo.gl/w5KHqc * 13,000 readers Domain: self.haskell, Score: 28, Comments: 11 On Reddit: [21] http://goo.gl/lTys0R Original: [22] http://goo.gl/lTys0R * A type for IO actions that do not throw exceptions Domain: self.haskell, Score: 25, Comments: 49 On Reddit: [23] http://goo.gl/Ao8HyB Original: [24] http://goo.gl/Ao8HyB * ANN: Scotty 0.5.0 Released Domain: github.com, Score: 24, Comments: 15 On Reddit: [25] http://goo.gl/jgGJhO Original: [26] http://goo.gl/BejPTF * Haskell version freezing Domain: blog.docmunch.com, Score: 23, Comments: 8 On Reddit: [27] http://goo.gl/9LJSjY Original: [28] http://goo.gl/Ikd86k * PHOAS For Free by Edward Kmett Domain: fpcomplete.com, Score: 21, Comments: 8 On Reddit: [29] http://goo.gl/RDt1BV Original: [30] http://goo.gl/o0phN7 * Cellular Automata, Part III by Edward Kmett Domain: fpcomplete.com, Score: 20, Comments: 0 On Reddit: [31] http://goo.gl/AKCfGw Original: [32] http://goo.gl/x7GtH1 * Translating Haskell programs to Coq [/Gallina] programs Domain: github.com, Score: 20, Comments: 2 On Reddit: [33] http://goo.gl/IQAp3K Original: [34] http://goo.gl/qcib77 * ANN: pipes-csv: a fast, streaming csv parser based on cassava and pipes Domain: github.com, Score: 20, Comments: 9 On Reddit: [35] http://goo.gl/aITtGX Original: [36] http://goo.gl/yrzZ7n Top StackOverflow Questions * What does the “Just” syntax mean in Haskell? votes: 12, answers: 4 Read on SO: [37] http://goo.gl/f17UEP * How can I understand “:t ((==) <*>)” in haskell? votes: 10, answers: 1 Read on SO: [38] http://goo.gl/CwyBn4 * why polymorphism is so costly in haskell(GHC)? votes: 10, answers: 3 Read on SO: [39] http://goo.gl/4MjcbH * Break and continue in GHCi debugger without use of breakpoints votes: 9, answers: 0 Read on SO: [40] http://goo.gl/HrtcXZ * Why is there no `-XDeriveApplicative` extension? votes: 8, answers: 1 Read on SO: [41] http://goo.gl/4dcRF1 * Downsides to ScopedTypeVariables votes: 7, answers: 2 Read on SO: [42] http://goo.gl/UjBcsg * Haskell design encompassing several monads votes: 7, answers: 1 Read on SO: [43] http://goo.gl/EwWd5d * How to correct my OOP tendencies when programming in Haksell votes: 7, answers: 3 Read on SO: [44] http://goo.gl/9JVqh7 * composing functions with higher arity votes: 7, answers: 5 Read on SO: [45] http://goo.gl/jQjNJW * Why are Haskell Maps implemented as balanced binary trees instead of traditional hashtables? votes: 7, answers: 3 Read on SO: [46] http://goo.gl/nZaLGV Until next time, [47]+Daniel Santa Cruz References 1. http://bartoszmilewski.com/2013/09/19/edward-chands/ 2. http://www.reddit.com/r/haskell/comments/1mqni1/edward_chands/ 3. http://www.haskellforall.com/2013/09/perfect-streaming-using-pipes-bytestri… 4. http://www.reddit.com/r/haskell/comments/1msinm/perfect_streaming_using_pip… 5. http://www.joachim-breitner.de/blog/archives/610-Adding-safe-coercions-to-H… 6. http://www.reddit.com/r/haskell/comments/1mfz8z/adding_safe_coercions_to_ha… 7. http://www.reddit.com/r/haskell/comments/1mvb2e/which_programming_languages… 8. http://www.reddit.com/r/haskell/comments/1mvb2e/which_programming_languages… 9. http://ghc.haskell.org/trac/ghc/ticket/7633#comment:28 10. http://www.reddit.com/r/haskell/comments/1mp434/ghc_head_merged_checkable_m… 11. http://www.reddit.com/r/haskell/comments/1mtcox/do_companies_ever_hire_some… 12. http://www.reddit.com/r/haskell/comments/1mtcox/do_companies_ever_hire_some… 13. http://www.haskell.org/pipermail/haskell-cafe/2013-September/108902.html 14. http://www.reddit.com/r/haskell/comments/1ml97r/haskellcafe_psa_do_not_inst… 15. http://source.mozillaopennews.org/en-US/learning/model-analysis/ 16. http://www.reddit.com/r/haskell/comments/1mlgwd/model_analysis_the_new_york… 17. http://blog.reactiveprogramming.org/?p=107 18. http://www.reddit.com/r/haskell/comments/1moob5/programming_reactively_with… 19. http://www.reddit.com/r/lisp/comments/1mkqvj/why_monads_have_not_taken_the_… 20. http://www.reddit.com/r/haskell/comments/1mn6vb/why_monads_have_not_taken_t… 21. http://www.reddit.com/r/haskell/comments/1modra/13000_readers/ 22. http://www.reddit.com/r/haskell/comments/1modra/13000_readers/ 23. http://www.reddit.com/r/haskell/comments/1mpsvj/a_type_for_io_actions_that_… 24. http://www.reddit.com/r/haskell/comments/1mpsvj/a_type_for_io_actions_that_… 25. https://github.com/xich/scotty/blob/master/ReleaseNotes.md 26. http://www.reddit.com/r/haskell/comments/1mr9hf/ann_scotty_050_released/ 27. http://blog.docmunch.com/blog/2013/haskell-version-freezing 28. http://www.reddit.com/r/haskell/comments/1mjldi/haskell_version_freezing/ 29. https://www.fpcomplete.com/user/edwardk/phoas 30. http://www.reddit.com/r/haskell/comments/1mo59h/phoas_for_free_by_edward_km… 31. https://www.fpcomplete.com/user/edwardk/cellular-automata/part-3 32. http://www.reddit.com/r/haskell/comments/1mfaqx/cellular_automata_part_iii_… 33. https://github.com/gdijkstra/hs-to-gallina/blob/master/docs/report/report.p… 34. http://www.reddit.com/r/haskell/comments/1miawm/translating_haskell_program… 35. https://github.com/jb55/pipes-csv 36. http://www.reddit.com/r/haskell/comments/1mvbk7/ann_pipescsv_a_fast_streami… 37. http://stackoverflow.com/questions/18808258/what-does-the-just-syntax-mean-… 38. http://stackoverflow.com/questions/18813431/how-can-i-understand-t-in-haske… 39. http://stackoverflow.com/questions/18854866/why-polymorphism-is-so-costly-i… 40. http://stackoverflow.com/questions/18876128/break-and-continue-in-ghci-debu… 41. http://stackoverflow.com/questions/18861231/why-is-there-no-xderiveapplicat… 42. http://stackoverflow.com/questions/18852341/downsides-to-scopedtypevariables 43. http://stackoverflow.com/questions/18866558/haskell-design-encompassing-sev… 44. http://stackoverflow.com/questions/18867620/how-to-correct-my-oop-tendencie… 45. http://stackoverflow.com/questions/18905867/composing-functions-with-higher… 46. http://stackoverflow.com/questions/18908639/why-are-haskell-maps-implemente… 47. https://plus.google.com/105107667630152149014/about

2 1

Haskell eXchange 2013, October 9, London
by Andres Löh 20 Sep '13

20 Sep '13

Skills Matter will organize the second Haskell eXchange in a few weeks time (October 9, in London). This is a one-day Haskell conference with plenty of talks and room for discussions. Here's the complete list of speakers and topics: Simon Peyton Jones (Microsoft Research) Lenses: compositional data access and manipulation Neil Mitchell (Standard Chartered) Everyone should use a Generics library - writing HLint with Uniplate Adam Bergmark (Silk) Compiling Haskell to Javascript with Fay Andres Löh (Well-Typed LLP) Monads for free! Gracjan Polak (Scrive) Embedded domain specific languages at Scrive Bas van Dijk (Erudify) Haskell at Erudify Simon Marlow (Facebook) The Haxl Project at Facebook If you'd like to attend, you can register via http://skillsmatter.com/event/haskell/haskell-exchange For those who cannot make it, the talks will most likely all be filmed and made available online. You can, for example, look at last year's talks via http://skillsmatter.com/event/home/haskell-exchange-2012 In the same week, I'm also teaching Well-Typed's 2-day Haskell courses "Fast Track to Haskell" and "Advanced Haskell" at Skills Matter in London. More information is available here: http://skillsmatter.com/course/haskell/well-typed-fast-track-to-haskell/wt-… http://skillsmatter.com/course/haskell/well-typed-advanced-haskell/wt-4939 Cheers, Andres -- Andres Löh, Haskell Consultant Well-Typed LLP, http://www.well-typed.com

1 0

Functional Programming in Bioinformatics, Birds-of-a-Feather Session at CUFP
by Ashish Agarwal 19 Sep '13

19 Sep '13

Functional Programming in Bioinformatics Birds-of-a-Feather Session at CUFP 2013 September 23, 2013 at 6:00 PM Boston, MA United States Bioinformatics is a discipline applying computational methods to biological problems. Due to advances in experimental techniques, especially in next-generation DNA sequencing, the amount of data being generated by biologists is exponentially increasing. The resulting data deluge promises to accelerate fundamental advances in human health, agriculture, and basic research. However, progress is hindered due to the lack of software tools for managing, analyzing, visualizing, and sharing such data. The goal of this meeting is to bring together researchers and practitioners of functional programming, logic, type theory, and related fields who are interested in applying their skills to biology and medicine. We also welcome biologists who are curious about state-of-the-art software engineering techniques. The meeting will be casual with no presentations. Our goal is simply to meet and discuss our interests, and propose future events and collaborations. We will meet at Connolly’s Publik House within the conference venue, the Hilton Boston Logan Airport Hotel, on Monday September 23rd at 6:00 PM. Everyone is welcome to attend this meeting regardless of whether you registered for any ICFP or CUFP events. RSVP is not required, but to help with planning, please email “agarwal1975 at gmail.com” if you know you will attend. Please also join the Well-Formed-Bio mailing list [1], which we welcome everyone to use for discussions around the topic of formal software methods applied to biology. [1] https://groups.google.com/forum/#!forum/well-formed-bio [2] http://cufp.org/conference/sessions/2013/birds-feather-functional-programmi… Organizers: Ashish Agarwal, Jeff Hammerbacher

1 0

PEPM 2014: Final call for papers
by oleg＠okmij.org 19 Sep '13

19 Sep '13

ACM SIGPLAN 2014 WORKSHOP ON PARTIAL EVALUATION AND PROGRAM MANIPULATION Mon-Tue, January 20-21, 2014 San Diego, California, USA co-located with POPL'14 Sponsored by ACM SIGPLAN http://www.program-transformation.org/PEPM14 SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2014 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue last years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM 2014 include, but are not limited to: Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. A special issue for Science of Computer Programming is planned with recommended papers from PEPM 2014. PEPM has also established a Best Paper award. The winner will be announced at the workshop. SUBMISSION CATEGORIES AND GUIDELINES Regular Research Papers must not exceed 12 pages in ACM Proceedings style (including appendix). Tool demonstration papers and short papers must not exceed 6 pages in ACM Proceedings style (including appendix). At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM 2014 Web-site. Papers should be submitted electronically via the workshop web site. Authors using LaTeX to prepare their submissions should use the new improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template). IMPORTANT DATES Abstract due: Thu, October 3, 2013 (Extended) Paper submission: Thu, October 10, 2013, 23:59, GMT (Extended) Author notification: Mon, November 11, 2013 Camera-ready papers due: * to be announced * INVITED SPEAKERS We are happy to announce the two invited speakers of PEPM 2014: Manuel Fahndrich (Microsoft Research, USA) Sven-Bodo Scholz (Heriott-Watt University, Scotland) PROGRAM CHAIRS Wei-Ngan Chin (National University of Singapore, Singapore) Jurriaan Hage (Utrecht University, Netherlands) PROGRAM COMMITTEE Evelyne Contejean (LRI, CNRS, Universite Paris-Sud, France) Cristina David (University of Oxford, UK) Alain Frisch (LexiFi, France) Ronald Garcia (University of British Columbia, Canada) Zhenjiang Hu (National Institute of Informatics, Japan) Paul H J Kelly (Imperial College, UK) Oleg Kiselyov (Monterey, USA) Naoki Kobayashi (University of Tokyo, Japan) Jens Krinke (University College London, UK) Ryan Newton (University of Indiana, USA) Alberto Pardo (Universidad de la Republica, Uruguay) Sungwoo Park (Pohang University of Science and Technology, South Korea) Tiark Rompf (Oracle Labs & EPFL, Switzerland) Sukyoung Ryu (KAIST, South Korea) Kostis Sagonas (Uppsala University, Sweden) Max Schaefer (Nanyang Technological University, Singapore) Harald Sondergaard (The University of Melbourne, Australia) Eijiro Sumii (Tohoku University, Japan) Eric Van Wyk (University of Minnesota, USA) Jeremy Yallop (University of Cambridge, UK)

1 0

Haskell Weekly News: Issue 280
by Daniel Santa Cruz 19 Sep '13

19 Sep '13

Welcome to issue 280 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of September 8 to 14, 2013. Quotes of the Week * haasn: edwardk uses things in anger. shachaf uses them with disappointment :( * shachaf: Are you reading Mac Lane now? Saizan: yeah, it's not so bad if you skip the examples Top Reddit Stories * For my 17th birthday, my best friend got me "The most obscure programming book I could find" as a joke. I know what language I am learning next! Domain: i.imgur.com, Score: 163, Comments: 67 On Reddit: [1] http://goo.gl/0SyN5l Original: [2] http://goo.gl/oqGBzL * pipes-4.0: Simpler types and API Domain: haskellforall.com, Score: 95, Comments: 36 On Reddit: [3] http://goo.gl/ciVnq5 Original: [4] http://goo.gl/g9oq3i * Hackage 2 now available for beta testing -- switchover in a few weeks Domain: beta.hackage.haskell.org, Score: 91, Comments: 17 On Reddit: [5] http://goo.gl/aIhL67 Original: [6] http://goo.gl/zfprr9 * Cartesian Closed Comic #22: Cabal 1.18 Domain: ro-che.info, Score: 90, Comments: 3 On Reddit: [7] http://goo.gl/tVUUFG Original: [8] http://goo.gl/O0BR6c * Parallel and Incremental CRCs by Edward Kmett Domain: fpcomplete.com, Score: 58, Comments: 7 On Reddit: [9] http://goo.gl/YAChJl Original: [10] http://goo.gl/WnMsbY * Conquering Folds by Edward Kmett Domain: fpcomplete.com, Score: 47, Comments: 42 On Reddit: [11] http://goo.gl/reAjgu Original: [12] http://goo.gl/kHsSye * Conal Elliot: From Haskell to hardware via cartesian closed categories Domain: conal.net, Score: 47, Comments: 3 On Reddit: [13] http://goo.gl/VCwp7Y Original: [14] http://goo.gl/NO1sbs * FP Complete to release a personal edition of their online IDE Domain: fpcomplete.com, Score: 39, Comments: 38 On Reddit: [15] http://goo.gl/QOMy5Y Original: [16] http://goo.gl/XBE7zT * Quark : A Web Browser with a Formally Verified Kernel Domain: goto.ucsd.edu, Score: 36, Comments: 6 On Reddit: [17] http://goo.gl/RDZMY0 Original: [18] http://goo.gl/rgBcki * My first Haskell program - FNIStash - a utility for Torchlight 2 using threepenny for the GUI Domain: fluffynukeit.com, Score: 36, Comments: 19 On Reddit: [19] http://goo.gl/cK2N8v Original: [20] http://goo.gl/XOMTgQ * Conal Elliott: Overloading lambda Domain: conal.net, Score: 34, Comments: 4 On Reddit: [21] http://goo.gl/fQTt1P Original: [22] http://goo.gl/oPSQ3R * Cost semantics for STG in modern GHC Domain: blog.ezyang.com, Score: 31, Comments: 5 On Reddit: [23] http://goo.gl/mIQQxm Original: [24] http://goo.gl/5Sa49T * 0install - Python vs. OCaml vs. Haskell Domain: roscidus.com, Score: 31, Comments: 23 On Reddit: [25] http://goo.gl/htCf1x Original: [26] http://goo.gl/zhrVp0 * LogicGrowsOnTrees: a parallel implementation of logic programming using distributed tree exploration Domain: github.com, Score: 31, Comments: 9 On Reddit: [27] http://goo.gl/zp5lou Original: [28] http://goo.gl/5BgYh2 * RSS reader made by Haskell running on mbed platform (RAM size 64kB, using Ajhc Haskell compiler). Domain: youtube.com, Score: 30, Comments: 5 On Reddit: [29] http://goo.gl/n0Gkan Original: [30] http://goo.gl/cwL4vP * Conal Elliott: Optimizing CCCs Domain: conal.net, Score: 30, Comments: 12 On Reddit: [31] http://goo.gl/HVv8dr Original: [32] http://goo.gl/MCn0sO * Snap (and Heist) 0.13 released Domain: snapframework.com, Score: 29, Comments: 7 On Reddit: [33] http://goo.gl/zW5Sdn Original: [34] http://goo.gl/1wSLeJ * ANN: threepenny-gui-0.3 – GUI framework that uses the web browser as a display – now with FRP built-in Domain: apfelmus.nfshost.com, Score: 28, Comments: 8 On Reddit: [35] http://goo.gl/RUDrKD Original: [36] http://goo.gl/WZMeZN Top StackOverflow Questions * In Haskell, where does the range ['a'..] stop? votes: 20, answers: 2 Read on SO: [37] http://goo.gl/Oms7lr * Why were Haskell 98's standard classes made inferior to Haskell 1.3's? votes: 18, answers: 1 Read on SO: [38] http://goo.gl/WxvdL2 * 27 different Bool to Bool values in Haskell votes: 14, answers: 1 Read on SO: [39] http://goo.gl/1PcD1g * How to reconstruct Haskell expression from type votes: 10, answers: 1 Read on SO: [40] http://goo.gl/Qx06kz * Can links to anchors in haddock be labeled? votes: 8, answers: 0 Read on SO: [41] http://goo.gl/5deOMM * How to convert between ByteString and Storable Vector? votes: 7, answers: 1 Read on SO: [42] http://goo.gl/zBVVzI * Why is not GHC optimizing for constants? votes: 7, answers: 2 Read on SO: [43] http://goo.gl/sfo64S * newtype around ST causes type error votes: 7, answers: 1 Read on SO: [44] http://goo.gl/CwXaJp * GHC does not generate a binary despite no errors shown votes: 6, answers: 1 Read on SO: [45] http://goo.gl/PAv1oQ Until next time, [46]+Daniel Santa Cruz References

1 0

CFP Special Issue Journal of Logic and Algebraic Programming
by Josep Silva Galiana 18 Sep '13

18 Sep '13

[Please post - apologies for multiple copies] **************************************************************************** Call for Papers JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING Special Issue on Automated Specification and Verification of Web Systems http://www.dsic.upv.es/~jsilva/wwv2013/jlap2014/<http://rap.dsi.unifi.it/wwv2011/jlap-wwv.html> **************************************************************************** IMPORTANT DATES Submission of papers: October 15, 2013 First review decision: January 15, 2014 Revision due: February 30, 2014 Acceptance notification: April 15, 2014 Final manuscript due: May 15, 2014 Expected publication: Summer/Autumn 2014 AIMS AND SCOPE This special issue of the Journal of Logic and Algebraic Programming (JLAP, http://www.journals.elsevier.com/the-journal-of-logic-and-algebraic-program…) is devoted to the topics of: - the 9th International Workshop on Automated Specification and Verification of Web Systems (WWV 2013, http://www.dsic.upv.es/~jsilva/wwv2013/<http://users.dsic.upv.es/~jsilva/wwv2012/>), which took place on June 2013 in Firenze, as part of the International Federated Conferences on Distributed Computing Techniques (DisCoTec 2013). This is however an open call for papers, therefore both participants of the workshops and other authors are encouraged to submit contributions. The aim of this special issue is to provide an interdisciplinary forum to facilitate the cross-fertilization and the advancement of hybrid methods that exploit concepts and tools drawn from Rule-based programming, Software engineering, Formal methods and Web-oriented research. Nowadays, many companies and institutions have diverted their Web sites into interactive, completely-automated, Web-based applications for, e.g., e-business, e-learning, e-government and e-health. The increased complexity and the explosive growth of Web systems have made their design and implementation a challenging task. Systematic, formal approaches to their specification and verification can permit to address the problems of this specific domain by means of automated and effective techniques and tools. We solicit original papers on topics of either theoretical or applied interest, which include, but are not limited to: - Approaches to Web system analysis, certification, specification, verification, and optimization. - Languages and models for programming and designing Web systems. - Formal methods for describing and reasoning about Web systems. - Model-checking, synthesis and debugging of Web systems. - Analysis and verification of linked data. - Web information retrieval. - Abstract interpretation and program transformation applied to the semantic Web. - Intelligent tutoring and advisory systems for Web specifications authoring. - Middleware and frameworks for composition and orchestration of Web services. - Web quality and Web metrics. - Web usability and accessibility. - Testing and evaluation of Web systems and applications. SUBMISSION We expect original articles (typically 20-30 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published in another journal and that must not be simultaneously submitted for publication elsewhere. Each paper will undergo a thorough evaluation by at least two reviewers. The authors will have about 50 days to incorporate the comments of the reviewers and submit a revised version of their papers, which will be evaluated again by the reviewers to make a final decision. Contributions should be in PDF format and must comply with JLAP's author guidelines, which can be retrieved from http://www.elsevier.com/wps/find/journaldescription.cws_home/621520/authori…. The manuscripts must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are handled using the Elsevier Editorial System and can be uploaded using the following link: http://ees.elsevier.com/jlap/default.asp In the submission process, the authors must select the article type 'WWV 2013'. GUEST EDITORS António Ravara (aravara(a)fct.unl.pt <lkovacs(a)complang.tuwien.ac.at>) Universidade Nova de Lisboa, Portugal Josep Silva (jsilva(a)dsic.upv.es) Universitat Politècnica de València, Spain

1 0

2nd CFP: SCSS 2013
by Temur Kutsia 18 Sep '13

18 Sep '13

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

2 1