From ivan.miljenovic at gmail.com Mon Feb 2 05:22:10 2015 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Mon, 2 Feb 2015 16:22:10 +1100 Subject: [Haskell] ANNOUNCE: monad-levels Message-ID: I'm pleased to announce the first release of my new monad-levels library (aka Yet Another Monad Transformer Library ;-) http://hackage.haskell.org/package/monad-levels I've written more about the motivations of the library here: https://ivanmiljenovic.wordpress.com/2015/02/02/monadic-yak-shaving/ -- Ivan Lazar Miljenovic Ivan.Miljenovic at gmail.com http://IvanMiljenovic.wordpress.com From benl at ouroborus.net Mon Feb 2 11:42:46 2015 From: benl at ouroborus.net (Ben Lippmeier) Date: Mon, 2 Feb 2015 22:42:46 +1100 Subject: [Haskell] CFP: Haskell Symposium 2015 Message-ID: ===================================================================== ACM SIGPLAN CALL FOR SUBMISSIONS Haskell Symposium 2015 Vancouver, Canada, 3-4 September 2015, directly after ICFP http://www.haskell.org/haskell-symposium/2015 ===================================================================== ** The Haskell Symposium has an early track this year ** ** See the Submission Timetable for details. ** The ACM SIGPLAN Haskell Symposium 2015 will be co-located with the International Conference on Functional Programming (ICFP 2015) in Vancouver, Canada. The Haskell Symposium aims to present original research on Haskell, discuss practical experience and future development of the language, and to promote other forms of denotative programming. Topics of interest include: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal semantics of the present language or future extensions, type systems, effects, metatheory, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management, as well as foreign function and component interfaces; * Libraries, that demonstrate new ideas or techniques for functional programming in Haskell; * Tools, such as profilers, tracers, debuggers, preprocessors, and testing tools; * Applications, to scientific and symbolic computing, databases, multimedia, telecommunication, the web, and so forth; * Functional Pearls, being elegant and instructive programming examples; * Experience Reports, to document general practice and experience in education, industry, or other contexts. Papers in the latter three categories need not necessarily report original academic research results. For example, they may instead report reusable programming idioms, elegant ways to approach a problem, or practical experience that will be useful to other users, implementors, or researchers. The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a standard solution to a standard programming problem, or report on experience where you used Haskell in the standard way and achieved the result you were expecting. More advice is available via the Haskell wiki: (http://wiki.haskell.org/HaskellSymposium/ExperienceReports) Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work, and to other languages where appropriate. In addition, we solicit proposals for: * System Demonstrations, based on running software rather than novel research results. These proposals should summarize the system capabilities that would be demonstrated. The proposals will be judged on whether the ensuing session is likely to be important and interesting to the Haskell community at large, whether on grounds academic or industrial, theoretical or practical, technical, social or artistic. Please contact the program chair with any questions about the relevance of a proposal. Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. 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 program, see its web page (http://pac.sigplan.org). Proceedings: ============ Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance (http://authors.acm.org/main.html). Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Accepted proposals for system demonstrations will be posted on the symposium website, but not formally published in the proceedings. All accepted papers and proposals will be posted on the conference website one week before the meeting. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Submission Details: =================== Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The text should be in a 9-point font in two columns. The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Papers need not fill the page limit -- for example, a Functional Pearl may be much shorter than 12 pages. Each paper submission must adhere to SIGPLAN's republication policy, as explained on the web. Demo proposals are limited to 2-page abstracts, in the same ACM format as papers. "Functional Pearls", "Experience Reports", and "Demo Proposals" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. A link to the paper submission system will appear on the Haskell Symposium web site closer to the submission deadline. Submission Timetable: ===================== Early Track Regular Track System Demos ---------------- ------------------- --------------- 13th March Paper Submission 1st May Notification 19th May Abstract Submission 22nd May Paper Submission 5th June Resubmission Demo Submission 26th June Notification Notification Notification 19th July Final papers due Final papers due Deadlines stated are valid anywhere on earth. In this iteration of the Haskell Symposium we are trialling a two-track submission process, so that some papers can gain early feedback. Papers can be submitted to the early track on 13th March. On 1st May, strong papers are accepted outright, and the others will be given their reviews and invited to resubmit. On 5th June early track papers may be resubmitted, and are sent back to the same reviewers. The Haskell Symposium regular track operates as in previous years. Papers accepted via the early and regular tracks are considered of equal value and will not be distinguished in the proceedings. Although all papers may be submitted to the early track, authors of functional pearls and experience reports are particularly encouraged to use this mechanism. The success of these papers depends heavily on the way they are presented, and submitting early will give the program committee a chance to provide feedback and help draw out the key ideas. Program Committee: =================== Mathieu Boespflug - Tweag I/O Edwin Brady - University of St Andrews Atze Dijkstra - Utrecht University Tom DuBuisson - Galois Torsten Grust - University of Tuebingen Patrik Jansson - Chalmers University of Technology Patricia Johann - Appalachian State University Oleg Kiselyov - Tohoku University Edward Kmett - McGraw Hill Financial Neelakantan Krishnaswami - University of Birmingham Ben Lippmeier (chair) - Vertigo Technology Hai (Paul) Liu - Intel Labs Garrett Morris - University of Edinburgh Dominic Orchard - Imperial College London Matt Roberts - Macquarie University Tim Sheard - Portland State University Joel Svensson - Indiana University Edsko de Vries - Well Typed ===================================================================== From ronald.modesitt.835 at gmail.com Mon Feb 2 21:03:18 2015 From: ronald.modesitt.835 at gmail.com (Ronald Modesitt) Date: Mon, 2 Feb 2015 14:03:18 -0700 Subject: [Haskell] Remove from mailing list Message-ID: Please remove me from your mailing list. ronald.modesitt.835 at gmail.com Thanks Ronald F. Modesitt 1215 Ptarmigan Dr. Longmont, CO 80504 303-485-3887 -------------- next part -------------- An HTML attachment was scrubbed... URL: From sumit.sahrawat.apm13 at iitbhu.ac.in Mon Feb 2 22:09:26 2015 From: sumit.sahrawat.apm13 at iitbhu.ac.in (Sumit Sahrawat, Maths & Computing, IIT (BHU)) Date: Tue, 3 Feb 2015 03:39:26 +0530 Subject: [Haskell] Remove from mailing list In-Reply-To: References: Message-ID: Go to this link : https://www.haskell.org/mailman/listinfo/haskell. On 3 February 2015 at 02:33, Ronald Modesitt wrote: > Please remove me from your mailing list. > ronald.modesitt.835 at gmail.com > > Thanks > > Ronald F. Modesitt > 1215 Ptarmigan Dr. > Longmont, CO 80504 > 303-485-3887 > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > > -- Regards Sumit Sahrawat -------------- next part -------------- An HTML attachment was scrubbed... URL: From bundala at berkeley.edu Mon Feb 2 22:16:46 2015 From: bundala at berkeley.edu (Daniel Bundala) Date: Mon, 2 Feb 2015 14:16:46 -0800 Subject: [Haskell] CFP: VSTTE 2015 Message-ID: CALL FOR PAPERS VSTTE 2015 ********************************************************************** 7th Working Conference on Verified Software: Theories, Tools, and Experiments July 18 - 19, 2015 San Francisco, California, USA http://www.eecs.berkeley.edu/vstte15 Co-located with 25th Conference on Computer Aided Verification (http://i-cav.org/2015) ********************************************************************** Full Paper Submission Deadline: April 27, 2015 SCOPE: The Seventh Working Conference on Verified Software: Theories, Tools, and Experiments follows a successful inaugural working conference at Zurich in 2005 followed by conferences in Toronto (2008), Edinburgh (2010), Philadelphia (2012), Atherton (2013), and Vienna (2014). The goal of this conference is to advance the state of the art in the science and technology of software verification, through the interaction of theory development, tool evolution, and experimental validation. We welcome submissions describing significant advances in the production of verified software, i.e., software that has been proved to meet its functional specifications. We are especially interested in submissions describing large-scale verification efforts that involve collaboration, theory unification, tool integration, and formalized domain knowledge. We welcome papers describing novel experiments and case studies evaluating verification techniques and technologies. Topics of interest include education, requirements modeling, specification languages, specification/verification case-studies, formal calculi, software design methods, automatic code generation, refinement methodologies, compositional analysis, verification tools (e.g., static analysis, dynamic analysis, model checking, theorem proving, satisfiability), tool integration, benchmarks, challenge problems, and integrated verification environments. PAPER SUBMISSION Papers will be evaluated by at least three members of the Program Committee. We are accepting both long (limited to 16 pages) and short (limited to 10 pages) paper submissions, written in English. Short submissions also cover Verification Pearls describing an elegant proof or proof technique. Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions must be in LNCS format and must include a cogent and self-contained description of the ideas, methods, results, and comparison to existing work. Submissions of theoretical, practical, and experimental contributions are equally encouraged, including those that focus on specific problems or problem domains. Papers should be submitted through: https://www.easychair.org/conferences/?conf=vstte2015. Submissions that arrive late, are not in the proper format, or are too long will not be considered. The post-conference proceedings of VSTTE 2015 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. The use of LaTeX and the Springer LNCS class files, obtainable fromhttp://www.springer.de/comp/lncs/authors.html, is strongly encouraged. PUBLICATION Accepted papers will be published as post-Proceedings, to appear in Springer's Lectures Notes in Computer Science. IMPORTANT DATES: Abstract submission: April 20, 2015 Full paper submission: April 27, 2015 Notification: June 8, 2015 ORGANIZATION: General Chair: Martin Schaef (SRI International) Program Chairs: Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) Sanjit A. Seshia (University of California, Berkeley) Publicity Chair: Daniel Bundala (UC Berkeley) PROGRAM COMMITTEE: Elvira Albert (Complutense University of Madrid) Nikolaj Bjorner (Microsoft Research) Evan Chang (University of Colorado, Boulder) Ernie Cohen (University of Pennsylvania) Jyotirmoy Deshmukh (Toyota) Jin Song Dong (National University of Singapore) Vijay D'Silva (Google) Vijay Ganesh (University of Waterloo) Alex Groce (Oregon State) Arie Gurfinkel (Software Engineering Institute, Carnegie Mellon University) (co-chair) Bill Harris (Georgia Institute of Technology) Chris Hawblitzel (Microsoft Research) Bart Jacobs (Katholieke Universiteit Leuven, Belgium) Susmit Jha (United Technologies) Rajeev Joshi (Laboratory for Reliable Software, Jet Propulsion Laboratory) Vladimir Klebanov, Karlsruhe Institute of Technology, DE Akash Lal (Microsoft Research India) Ruzica Piskac (Yale) Zvonimir Rakamaric (University of Utah) Kristin Yvonne Rozier (University of Cincinnati) Sanjit A. Seshia (UC Berkeley) (co-chair) Natarajan Shankar (SRI) Carsten Sinz (KIT) Nishant Sinha (IBM Research Labs) Alexander Summers (ETH Zurich) Zachary Tatlock (University of Washington) Sergey Tverdyshev (Sysgo AG) Arnaud Venet (CMU / NASA Ames Research Center) Karen Yorav (IBM Haifa Research Lab) ********************************************************************** Please contact vstte2015 at easychair.org for further information ********************************************************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: From compscience.announcement at gmail.com Tue Feb 3 20:22:33 2015 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Tue, 3 Feb 2015 21:22:33 +0100 Subject: [Haskell] LCTES 2015: 2nd Call for Papers Message-ID: ############################################################ LCTES 2015 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools and Theory for Embedded Systems ############################################################ LCTES provides a link between the programming languages and embedded systems engineering communities. Researchers and developers in these areas are addressing many similar problems, but with different backgrounds and approaches. LCTES is intended to expose researchers and developers from either area to relevant work and interesting problems in the other area and provide a forum where they can interact. ## Important Dates Submission deadline: Feb. 15 Notifications by: Apr. 1 Camera-ready deadline: Apr. 11 LCTES 2015 will be held on June 18 and 19 as part of the FCRC 2015 (Federated Computing Research Conference 2015) in Portland, Oregon, USA. This will be the sixteenth conference in the LCTES series. Embedded system design faces many challenges both with respect to functional requirements and nonfunctional requirements, many of which are conflicting. They are found in areas such as design and developer productivity, verification, validation, maintainability, and meeting performance goals and resource constraints. Novel design-time and run-time approaches are needed to meet the demand of emerging applications and to exploit new hardware paradigms, and in particular to scale up to multicores (including GPUs and FPGAs) and distributed systems built from multicores. LCTES 2015 solicits papers presenting original work on programming languages, compilers, tools, theory, and architectures that help in overcoming these challenges. Research papers on innovative techniques are welcome, as well as experience papers on insights obtained by experimenting with real-world systems and applications. Papers are solicited on, but not limited to, the following topics in embedded systems: - Programming language challenges, including: - Domain-specific languages - Features to exploit multicore, reconfigurable, and other emerging architectures - Features for distributed, adaptive, and real-time control embedded systems - Language capabilities for specification, composition, and construction of embedded systems - Language features and techniques to enhance reliability, verifiability, and security - Virtual machines, concurrency, inter-processor synchronization, and memory management - Compiler challenges, including: - Interaction between embedded architectures, operating systems, and compiler - Interpreters, binary translation, just-in-time compilation, and split compilation - Support for enhanced programmer productivity - Support for enhanced debugging, profiling, and exception/interrupt handling - Optimization for low power/energy, code and data size, and best-effort and real-time performance - Parameterized and structural compiler design space exploration and auto-tuning - Tools for analysis, specification, design, and implementation, including: - Hardware, system software, application software, and their interfaces - Distributed real-time control, media players, and reconfigurable architectures - System integration and testing - Performance estimation, monitoring, and tuning - Run-time system support for embedded systems - Design space exploration tools - Support for system security and system-level reliability - Approaches for cross-layer system optimization - Theory and foundations of embedded systems, including: - Predictability of resource behaviour: energy, space, time - Validation and verification, in particular of concurrent and distributed systems - Formal foundations of model-based design as basis for code generation, analysis, and verification - Mathematical foundations for embedded systems - Models of computations for embedded applications - Novel embedded architectures, including: - Design and implementation of novel architectures - Workload analysis and performance evaluation - Architecture support for new language features, virtualization, compiler techniques, debugging tools - Empirical studies and their reproduction, and confirmation ## Note to Authors A few of the best submissions to LCTES 2015 are planned to be invited for submission, with some revisions, to a special issue of the ACM Transactions on Embedded Computing Systems (TECS). The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. ## Organization General Chair Sam H. Noh, Hongik University, Republic of Korea Program Chairs Sebastian Fischmesiter, University of Waterloo, Canada Jason Xue, City University of Hong Kong, China LCTES Steering Committee Bruce Childers, University of Pittsburgh, USA Jan Vitek, Northeastern University, USA Bjorn De Sutter, University of Edinbugh, Great Britain Jaejin Lee, Seoul National University, Republic of Korea Heiko Falk, Ulm University, Germany Wang Yi, Uppsala University, Sweden Jingling Xue, University of New South Wales, Australia Youtao Zhang, University of Pittsbugh, USA Prasad Kulkarni, University of Kansas, USA Program Committee Luis Almeida, University of Porto, Portugal Ian Bate, University of York, Great Britain Philip Brisk, University of California, Los Angeles, USA Marco Caccamo, University of Illinois, Urbana-Champaign, USA Peter Desnoyers, Northeastern University, USA Petru Eles, Link?pings Universitet, Sweden Georgios Fainekos, Arizona State University, USA Guto Froehlich, Universidade Federal de Santa Catarina Forianopolis, Brazil Giovani Gracioli, Universidade Federal de Santa Catarina Joinville, Brazil Radu Grosu, Technical University Vienna, Austria Nan Guan, Northeastern University, China Apala Guha, IIT Dehli, India Gernot Heiser, University of New South Wales, Australia Michael Jantz, University of Tennessee, Knoxville, USA Zhiping Jia, ShangDong University, China Jinsoo Kim, Sungkyunkwan University, Republic of Korea Raimund Kirner, University of Hertfordshire, Great Britain Kai Lampka, Uppsala University, Sweden Terrence Mak, Chinese University of Hong Kong, China Rahul Mangharam, University of Pennsylvania, USA Florence Maraninchi, VERIMAG, France Sang Lyul MIN, Seoul National University, Republic of Korea Sayan Mitra, University of Illinois, Urbana-Champaign, USA Tulika Mitra, Singapore National University, Singapore Thomas Nolte, M?lardalen University, Sweden Lin Phan, University of Pennsylvania, USA Dumitru Potop-Butucaru, INRIA Rocquencourt, France Zili Shao, Hong Kong Polytechnic University, China Liang Shi, Chong Qing Uniersity, China Aviral Shrivastava, Arizona State University, USA Wilfried Steiner, TTTech, Austria Michael Swift, University of Wisconsin, Madison, USA Gera Weiss, Ben Gurion University, Israel Jingling Xue, University of New South Wales, Australia Chengmo Yang, University of Delaware, USA Wang Yi, Uppsala University, Sweden Yuan-Hao Zhang, Academia Sinica, Taiwan -------------- next part -------------- An HTML attachment was scrubbed... URL: From dstcruz at gmail.com Thu Feb 5 04:21:49 2015 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 4 Feb 2015 21:21:49 -0700 Subject: [Haskell] Haskell Weekly News: Issue 316 Message-ID: Welcome to issue 316 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from January 18 to 31, 2015 After doing more than 150 of these, I have come to the conclusion that it is time for me to take a permanent break from HWN. I realize that "we could do better", and have something a bit more edited than a collection of links, and some quotes. I wish I had more time to devote to such endeavor, but my time is currently being taken up by trying to help my 1 year old explore her little world. If you'd like to be the one to continue the long tradition of HWN, drop me a line. Thanks for following along for the last 3 years! Quotes of the Week * johnw: "Sir, what weapon did the assailant use against you?" "All I know is that it was done in IO, officer." * monochrom: $ can't buy you love, but it can buy you function application * hiptobecubic: benzrf, well sure. I'm not suggesting that lens has actually left any operators available for anything Top Reddit Stories * I think I've nailed it! I've solved the records problem! Domain: nikita-volkov.github.io, Score: 348, Comments: 193 Original: [1] http://goo.gl/PhJo6K On Reddit: [2] http://goo.gl/vWPeOj * Use Haskell for shell scripting Domain: haskellforall.com, Score: 121, Comments: 62 Original: [3] http://goo.gl/Fx4HeT On Reddit: [4] http://goo.gl/2g83KR * Major Prelude changes proposed Domain: haskell.org, Score: 119, Comments: 252 Original: [5] http://goo.gl/wtFWt3 On Reddit: [6] http://goo.gl/kaegj2 * Slides from Don Stewart's Google tech talk Domain: code.haskell.org, Score: 104, Comments: 75 Original: [7] http://goo.gl/ejfoFp On Reddit: [8] http://goo.gl/9cK9dB * Haskell Design Patterns: .Extended Modules Domain: jaspervdj.be, Score: 86, Comments: 29 Original: [9] http://goo.gl/TvwGCF On Reddit: [10] http://goo.gl/wkNx38 * IO Monad Considered Harmful Domain: blog.jle.im, Score: 86, Comments: 157 Original: [11] http://goo.gl/z9Elq7 On Reddit: [12] http://goo.gl/uehgF9 * We are making great efforts to spread Haskell around our local programming groups. Today, I finally saw a Haskell post, so I'm glad it is kinda working. Kinda. Domain: i.imgur.com, Score: 86, Comments: 41 Original: [13] http://goo.gl/0SsbT7 On Reddit: [14] http://goo.gl/gyBJ1o * My Haskell tooling wishlist by Chris Done Domain: chrisdone.com, Score: 77, Comments: 27 Original: [15] http://goo.gl/VIRJgM On Reddit: [16] http://goo.gl/ChmItY * Categories for Programmers: Functors Domain: bartoszmilewski.com, Score: 70, Comments: 14 Original: [17] http://goo.gl/6M64jC On Reddit: [18] http://goo.gl/tW6ubH * I wrote another monad tutorial. Sorry. Domain: kevinmahoney.co.uk, Score: 63, Comments: 22 Original: [19] http://goo.gl/zEQIgS On Reddit: [20] http://goo.gl/XXeZN3 * Introducing SJS, a type inferer and checker for JavaScript (written in Haskell) Domain: noamlewis.wordpress.com, Score: 61, Comments: 33 Original: [21] http://goo.gl/oQRSNo On Reddit: [22] http://goo.gl/1LfY1u * Solving the expression problem with Object Algebras and Tagless Interpreters Domain: oleksandrmanzyuk.wordpress.com, Score: 59, Comments: 30 Original: [23] http://goo.gl/daJWGy On Reddit: [24] http://goo.gl/fKy9zV Top StackOverflow Questions * Why do we need monads? votes: 142, answers: 5 Read on SO: [25] http://goo.gl/Ioviv9 * Why compiling this Haskell program with -fllvm produces a different result? votes: 19, answers: 0 Read on SO: [26] http://goo.gl/twid2N * What is the difference between traits in Rust and typeclasses in Haskell? votes: 18, answers: 0 Read on SO: [27] http://goo.gl/KJdBqh * Motivation behind Phantom Types? votes: 17, answers: 3 Read on SO: [28] http://goo.gl/q7IQQC * What is the precedence of ~, and why? votes: 17, answers: 1 Read on SO: [29] http://goo.gl/iZHxLy * Using GHC API to compile Haskell sources to CORE and CORE to binary votes: 13, answers: 2 Read on SO: [30] http://goo.gl/Qto29m * How to ship an executable with Language.Haskell.Interpreter? votes: 13, answers: 0 Read on SO: [31] http://goo.gl/JptPyG Until next time, [32]+Daniel Santa Cruz References 1. http://nikita-volkov.github.io/record/ 2. http://www.reddit.com/r/haskell/comments/2svayz/i_think_ive_nailed_it_ive_solved_the_records/ 3. http://www.haskellforall.com/2015/01/use-haskell-for-shell-scripting.html 4. http://www.reddit.com/r/haskell/comments/2u6b8m/use_haskell_for_shell_scripting/ 5. https://www.haskell.org/pipermail/libraries/2015-January/024777.html 6. http://www.reddit.com/r/haskell/comments/2ttvsj/major_prelude_changes_proposed/ 7. http://code.haskell.org/~dons/talks/dons-google-2015-01-27.pdf 8. http://www.reddit.com/r/haskell/comments/2u0380/slides_from_don_stewarts_google_tech_talk/ 9. http://jaspervdj.be/posts/2015-01-20-haskell-design-patterns-extended-modules.html 10. http://www.reddit.com/r/haskell/comments/2t4lba/haskell_design_patterns_extended_modules/ 11. http://blog.jle.im/entry/io-monad-considered-harmful 12. http://www.reddit.com/r/haskell/comments/2tbbxh/io_monad_considered_harmful/ 13. http://i.imgur.com/Rw8mmad.jpg 14. http://www.reddit.com/r/haskell/comments/2tg9gs/we_are_making_great_efforts_to_spread_haskell/ 15. http://chrisdone.com/posts/haskell-wishlist 16. http://www.reddit.com/r/haskell/comments/2tpwim/my_haskell_tooling_wishlist_by_chris_done/ 17. http://bartoszmilewski.com/2015/01/20/functors/ 18. http://www.reddit.com/r/haskell/comments/2t2g5a/categories_for_programmers_functors/ 19. http://kevinmahoney.co.uk/articles/haskell-io/ 20. http://www.reddit.com/r/haskell/comments/2trmyx/i_wrote_another_monad_tutorial_sorry/ 21. https://noamlewis.wordpress.com/2015/01/20/introducing-sjs-a-type-inferer-and-checker-for-javascript/ 22. http://www.reddit.com/r/haskell/comments/2szt1u/introducing_sjs_a_type_inferer_and_checker_for/ 23. https://oleksandrmanzyuk.wordpress.com/2014/06/18/from-object-algebras-to-finally-tagless-interpreters-2/ 24. http://www.reddit.com/r/haskell/comments/2stmt6/solving_the_expression_problem_with_object/ 25. http://stackoverflow.com/questions/28139259/why-do-we-need-monads 26. http://stackoverflow.com/questions/28053448/why-compiling-this-haskell-program-with-fllvm-produces-a-different-result 27. http://stackoverflow.com/questions/28123453/what-is-the-difference-between-traits-in-rust-and-typeclasses-in-haskell 28. http://stackoverflow.com/questions/28247543/motivation-behind-phantom-types 29. http://stackoverflow.com/questions/28257511/what-is-the-precedence-of-and-why 30. http://stackoverflow.com/questions/28059669/using-ghc-api-to-compile-haskell-sources-to-core-and-core-to-binary 31. http://stackoverflow.com/questions/28204973/how-to-ship-an-executable-with-language-haskell-interpreter 32. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From fa-ml at ariis.it Thu Feb 5 05:11:33 2015 From: fa-ml at ariis.it (Francesco Ariis) Date: Thu, 5 Feb 2015 06:11:33 +0100 Subject: [Haskell] Haskell Weekly News: Issue 316 In-Reply-To: References: Message-ID: <20150205051133.GA28929@x60s.casa> On Wed, Feb 04, 2015 at 09:21:49PM -0700, Daniel Santa Cruz wrote: > After doing more than 150 of these, I have come to the conclusion that > it is time for me to take a permanent break from HWN. I realize that > "we could do better", and have something a bit more edited than a > collection of links, and some quotes. I wish I had more time to devote > to such endeavor, but my time is currently being taken up by trying to > help my 1 year old explore her little world. Thanks so much for doing these! Always useful, great way to keep up to date with other places than the ML. Good luck with the 1 year old, may her steps be functional! -F From simonpj at microsoft.com Thu Feb 5 09:07:07 2015 From: simonpj at microsoft.com (Simon Peyton Jones) Date: Thu, 5 Feb 2015 09:07:07 +0000 Subject: [Haskell] Haskell Weekly News: Issue 316 In-Reply-To: References: Message-ID: <618BE556AADD624C9C918AA5D5911BEF562BF720@DB3PRD3001MB020.064d.mgd.msft.net> After doing more than 150 of these, I have come to the conclusion that it is time for me to take a permanent break from HWN. I realize that "we could do better", and have something a bit more edited than a collection of links, and some quotes. I wish I had more time to devote to such endeavour, but my time is currently being taken up by trying to help my 1 year old explore her little world. We owe Daniel a huge debt of thanks. HWN is a huge service to the community. I have read many interesting blog posts that I would have never otherwise found. Thank you! We really need a successor! Please, please. Simon From: Haskell [mailto:haskell-bounces at haskell.org] On Behalf Of Daniel Santa Cruz Sent: 05 February 2015 04:22 To: haskell at haskell.org; haskell-cafe at haskell.org Subject: [Haskell] Haskell Weekly News: Issue 316 Welcome to issue 316 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from January 18 to 31, 2015 After doing more than 150 of these, I have come to the conclusion that it is time for me to take a permanent break from HWN. I realize that "we could do better", and have something a bit more edited than a collection of links, and some quotes. I wish I had more time to devote to such endeavor, but my time is currently being taken up by trying to help my 1 year old explore her little world. If you'd like to be the one to continue the long tradition of HWN, drop me a line. Thanks for following along for the last 3 years! Quotes of the Week * johnw: "Sir, what weapon did the assailant use against you?" "All I know is that it was done in IO, officer." * monochrom: $ can't buy you love, but it can buy you function application * hiptobecubic: benzrf, well sure. I'm not suggesting that lens has actually left any operators available for anything Top Reddit Stories * I think I've nailed it! I've solved the records problem! Domain: nikita-volkov.github.io, Score: 348, Comments: 193 Original: [1] http://goo.gl/PhJo6K On Reddit: [2] http://goo.gl/vWPeOj * Use Haskell for shell scripting Domain: haskellforall.com, Score: 121, Comments: 62 Original: [3] http://goo.gl/Fx4HeT On Reddit: [4] http://goo.gl/2g83KR * Major Prelude changes proposed Domain: haskell.org, Score: 119, Comments: 252 Original: [5] http://goo.gl/wtFWt3 On Reddit: [6] http://goo.gl/kaegj2 * Slides from Don Stewart's Google tech talk Domain: code.haskell.org, Score: 104, Comments: 75 Original: [7] http://goo.gl/ejfoFp On Reddit: [8] http://goo.gl/9cK9dB * Haskell Design Patterns: .Extended Modules Domain: jaspervdj.be, Score: 86, Comments: 29 Original: [9] http://goo.gl/TvwGCF On Reddit: [10] http://goo.gl/wkNx38 * IO Monad Considered Harmful Domain: blog.jle.im, Score: 86, Comments: 157 Original: [11] http://goo.gl/z9Elq7 On Reddit: [12] http://goo.gl/uehgF9 * We are making great efforts to spread Haskell around our local programming groups. Today, I finally saw a Haskell post, so I'm glad it is kinda working. Kinda. Domain: i.imgur.com, Score: 86, Comments: 41 Original: [13] http://goo.gl/0SsbT7 On Reddit: [14] http://goo.gl/gyBJ1o * My Haskell tooling wishlist by Chris Done Domain: chrisdone.com, Score: 77, Comments: 27 Original: [15] http://goo.gl/VIRJgM On Reddit: [16] http://goo.gl/ChmItY * Categories for Programmers: Functors Domain: bartoszmilewski.com, Score: 70, Comments: 14 Original: [17] http://goo.gl/6M64jC On Reddit: [18] http://goo.gl/tW6ubH * I wrote another monad tutorial. Sorry. Domain: kevinmahoney.co.uk, Score: 63, Comments: 22 Original: [19] http://goo.gl/zEQIgS On Reddit: [20] http://goo.gl/XXeZN3 * Introducing SJS, a type inferer and checker for JavaScript (written in Haskell) Domain: noamlewis.wordpress.com, Score: 61, Comments: 33 Original: [21] http://goo.gl/oQRSNo On Reddit: [22] http://goo.gl/1LfY1u * Solving the expression problem with Object Algebras and Tagless Interpreters Domain: oleksandrmanzyuk.wordpress.com, Score: 59, Comments: 30 Original: [23] http://goo.gl/daJWGy On Reddit: [24] http://goo.gl/fKy9zV Top StackOverflow Questions * Why do we need monads? votes: 142, answers: 5 Read on SO: [25] http://goo.gl/Ioviv9 * Why compiling this Haskell program with -fllvm produces a different result? votes: 19, answers: 0 Read on SO: [26] http://goo.gl/twid2N * What is the difference between traits in Rust and typeclasses in Haskell? votes: 18, answers: 0 Read on SO: [27] http://goo.gl/KJdBqh * Motivation behind Phantom Types? votes: 17, answers: 3 Read on SO: [28] http://goo.gl/q7IQQC * What is the precedence of ~, and why? votes: 17, answers: 1 Read on SO: [29] http://goo.gl/iZHxLy * Using GHC API to compile Haskell sources to CORE and CORE to binary votes: 13, answers: 2 Read on SO: [30] http://goo.gl/Qto29m * How to ship an executable with Language.Haskell.Interpreter? votes: 13, answers: 0 Read on SO: [31] http://goo.gl/JptPyG Until next time, [32]+Daniel Santa Cruz References 1. http://nikita-volkov.github.io/record/ 2. http://www.reddit.com/r/haskell/comments/2svayz/i_think_ive_nailed_it_ive_solved_the_records/ 3. http://www.haskellforall.com/2015/01/use-haskell-for-shell-scripting.html 4. http://www.reddit.com/r/haskell/comments/2u6b8m/use_haskell_for_shell_scripting/ 5. https://www.haskell.org/pipermail/libraries/2015-January/024777.html 6. http://www.reddit.com/r/haskell/comments/2ttvsj/major_prelude_changes_proposed/ 7. http://code.haskell.org/~dons/talks/dons-google-2015-01-27.pdf 8. http://www.reddit.com/r/haskell/comments/2u0380/slides_from_don_stewarts_google_tech_talk/ 9. http://jaspervdj.be/posts/2015-01-20-haskell-design-patterns-extended-modules.html 10. http://www.reddit.com/r/haskell/comments/2t4lba/haskell_design_patterns_extended_modules/ 11. http://blog.jle.im/entry/io-monad-considered-harmful 12. http://www.reddit.com/r/haskell/comments/2tbbxh/io_monad_considered_harmful/ 13. http://i.imgur.com/Rw8mmad.jpg 14. http://www.reddit.com/r/haskell/comments/2tg9gs/we_are_making_great_efforts_to_spread_haskell/ 15. http://chrisdone.com/posts/haskell-wishlist 16. http://www.reddit.com/r/haskell/comments/2tpwim/my_haskell_tooling_wishlist_by_chris_done/ 17. http://bartoszmilewski.com/2015/01/20/functors/ 18. http://www.reddit.com/r/haskell/comments/2t2g5a/categories_for_programmers_functors/ 19. http://kevinmahoney.co.uk/articles/haskell-io/ 20. http://www.reddit.com/r/haskell/comments/2trmyx/i_wrote_another_monad_tutorial_sorry/ 21. https://noamlewis.wordpress.com/2015/01/20/introducing-sjs-a-type-inferer-and-checker-for-javascript/ 22. http://www.reddit.com/r/haskell/comments/2szt1u/introducing_sjs_a_type_inferer_and_checker_for/ 23. https://oleksandrmanzyuk.wordpress.com/2014/06/18/from-object-algebras-to-finally-tagless-interpreters-2/ 24. http://www.reddit.com/r/haskell/comments/2stmt6/solving_the_expression_problem_with_object/ 25. http://stackoverflow.com/questions/28139259/why-do-we-need-monads 26. http://stackoverflow.com/questions/28053448/why-compiling-this-haskell-program-with-fllvm-produces-a-different-result 27. http://stackoverflow.com/questions/28123453/what-is-the-difference-between-traits-in-rust-and-typeclasses-in-haskell 28. http://stackoverflow.com/questions/28247543/motivation-behind-phantom-types 29. http://stackoverflow.com/questions/28257511/what-is-the-precedence-of-and-why 30. http://stackoverflow.com/questions/28059669/using-ghc-api-to-compile-haskell-sources-to-core-and-core-to-binary 31. http://stackoverflow.com/questions/28204973/how-to-ship-an-executable-with-language-haskell-interpreter 32. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From ky3 at atamo.com Thu Feb 5 12:28:18 2015 From: ky3 at atamo.com (Kim-Ee Yeoh) Date: Thu, 5 Feb 2015 19:28:18 +0700 Subject: [Haskell] Haskell Weekly News: Issue 316 In-Reply-To: <618BE556AADD624C9C918AA5D5911BEF562BF720@DB3PRD3001MB020.064d.mgd.msft.net> References: <618BE556AADD624C9C918AA5D5911BEF562BF720@DB3PRD3001MB020.064d.mgd.msft.net> Message-ID: On Thu, Feb 5, 2015 at 4:07 PM, Simon Peyton Jones wrote: > We really need a successor! Please, please. I have offered to continue HWN. If picked, I intend to bring it back to the informed news source that it was circa early 2000s. I'm cognizant of the diversification of online hangouts. Whereas it was plenty enough to curate haskell-cafe way back when, it's no longer enough to sort through Haskell Reddit and Stack Overflow. Haskell professionals already know to watch the ghc mailing lists, especially libraries, ghc-devs, and tickets. There's Google+, which holds its share of haskellers. But there's a slew of non-haskell.org mailing lists around real world applications, e.g. purescript/elm, pipes, and commercial-haskell, that command sizeable sections of the community. And last but not least, can anyone afford to ignore the Twitter grapevine? I make no promises to comprehensive coverage. But I endeavor to build bridges across special interest tectonics. -- Kim-Ee -------------- next part -------------- An HTML attachment was scrubbed... URL: From dstcruz at gmail.com Fri Feb 6 04:50:57 2015 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Fri, 06 Feb 2015 04:50:57 +0000 Subject: [Haskell] Haskell Weekly News: Issue 316 References: <20150205051133.GA28929@x60s.casa> Message-ID: On Wed Feb 04 2015 at 10:14:08 PM Francesco Ariis wrote: > Thanks so much for doing these! Always useful, great way to keep > up to date with other places than the ML. > > Good luck with the 1 year old, may her steps be functional! > Thanks! I hope her first steps are not lazy :-) Cheers, Daniel -------------- next part -------------- An HTML attachment was scrubbed... URL: From kh at cs.st-andrews.ac.uk Fri Feb 6 10:17:53 2015 From: kh at cs.st-andrews.ac.uk (Kevin Hammond) Date: Fri, 6 Feb 2015 10:17:53 +0000 Subject: [Haskell] PhD Studentships at St Andrews Message-ID: <204B4BD6-1E30-4048-AC7E-A4A34AB9CEA5@cs.st-andrews.ac.uk> [Please forward to suitable candidates. Thanks! Kevin.] The School of Computer Science at the University of St Andrews has several fully funded research scholarships available. These are available to UK residents (possibly also to EU nationals), and pay fees as well as maintenance. There is no formal deadline, but applications should be made as soon as possible. We have an active group of about ten academics, postdoctoral research fellows and postgraduate students working on a variety of topics in functional programming. We'd welcome applicants who are interested in any aspect of functional programming and related areas, including: Parallel Functional programming; Heterogeneous multicores (including CPU/GPU combinations); Refactoring; Program Generation; Domain Specific Languages; Static Analysis; Patterns of computation; Machine-Learning; Compilation; Real-time functional programming (e.g. in Hume); Semantics of Programming Languages; Functional cloud computing; Functional Programming and Security; Dependent Types; Effects and other extra-functional properties; Relaxed memory consistency; Multicore programming; Formal concurrency models; Concurrency verification; Application of functional ideas to other paradigms, including C and C++; Data Analytics. We work with various functional languages including Haskell, Erlang, idris, OCAML, Hume and F#. We have excellent links with both academic and industry, and are coordinating the EU Framework 7 ParaPhrase project, which involves 13 partners from 8 European countries: http://www.paraphrase-ict.eu, and the EU Horizon 2020 RePhrase project, which involves 8 partners from 8 European countries: http://rephrase.weebly.com Please contact me to discuss possible project ideas. Applications should be made through: http://www.cs.st-andrews.ac.uk/prospective-pg/research-degrees Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk). The University of St Andrews is a charity registered in Scotland : No SC013532 From allbery.b at gmail.com Fri Feb 6 14:12:17 2015 From: allbery.b at gmail.com (Brandon Allbery) Date: Fri, 6 Feb 2015 09:12:17 -0500 Subject: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316 In-Reply-To: References: <20150205051133.GA28929@x60s.casa> Message-ID: On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani wrote: > and, to haskell-cafe, > "Haskell Weekly News: Issue 316" original message[1] had sent only to > haskell at haskell.org? > (not to haskell-cafe? or my mailer trouble?) > gmail suppresses duplicate messages, so if you are subscribed to both lists you will receive it only once. -- brandon s allbery kf8nh sine nomine associates allbery.b at gmail.com ballbery at sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net -------------- next part -------------- An HTML attachment was scrubbed... URL: From takenobu.hs at gmail.com Sat Feb 7 02:31:01 2015 From: takenobu.hs at gmail.com (Takenobu Tani) Date: Sat, 7 Feb 2015 11:31:01 +0900 Subject: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316 In-Reply-To: References: <20150205051133.GA28929@x60s.casa> Message-ID: sorry, frequent mail in important thread. I understood why I did not receive initial mail. Daniel's initial mail was determined that the spam mail in Gmail. I found it in Gmail spam folder. Cheers, Takenobu 2015-02-07 10:32 GMT+09:00 Takenobu Tani : > Hi Brandon, > > Thank you for your help. > I think my environmental problems. > > It's OK, if everyone could read it in cafe:-) > > Thank you, > Takenobu > > > > 2015-02-06 23:12 GMT+09:00 Brandon Allbery : > >> On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani >> wrote: >> >>> and, to haskell-cafe, >>> "Haskell Weekly News: Issue 316" original message[1] had sent only to >>> haskell at haskell.org? >>> (not to haskell-cafe? or my mailer trouble?) >>> >> >> gmail suppresses duplicate messages, so if you are subscribed to both >> lists you will receive it only once. >> >> -- >> brandon s allbery kf8nh sine nomine >> associates >> allbery.b at gmail.com >> ballbery at sinenomine.net >> unix, openafs, kerberos, infrastructure, xmonad >> http://sinenomine.net >> > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From Nalqirim at uaeu.ac.ae Sun Feb 8 14:09:42 2015 From: Nalqirim at uaeu.ac.ae (Nabeel Al-Qirim) Date: Sun, 8 Feb 2015 14:09:42 +0000 Subject: [Haskell] CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 Message-ID: <613A9065892D6441AC7E1D2FE4E16EA147BD7AC9@PEXMBOX20101.uaeu.ac.ae> CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 IIT?15: The 11th International Conference on Innovations in Information Technology 2015 URL: http://www.it-innovations.ae/iit2015/posters.html The IIT?15 Student Poster and Demos Committee invites all undergraduate and graduate students to submit an extended (2 pages max.) abstract and to display it as a poster during the IIT?15. The poster topic should fall within the conference?s theme and tracks. SUBMISSION Extended abstracts should be sent to Dr. Nabeel Al-Qirim at nalqirim at uaeu.ac.ae. All students are encouraged to review their abstracts with their faculty advisers prior to submission. All accepted abstracts will be published by the IIT?15 proceedings. IMPORTANT DATES -Student Poster (Extended Paper) Submission May 30, 2015 -Notification of Student Poster acceptance July 15, 2015 -Camera ready Extended Paper and Poster material September 01, 2015 -Conference November 01-03, 2015 BEST STUDENT POSTER AWARDS There will be a competition for best student poster award at the IIT?15. This award will be given to recognize student excellence in research and presentation. CONTACT Queries should be directed to: Dr. Nabeel Al-Qirim at nalqirim at uaeu.ac.ae Thanks, Dr. Nabeel Al-Qirim IIT?15 Student Poster and Demos Chair College of Information Technology United Arab Emirates University P.O Box 15551 - Al Ain United Arab Emirates Tel: +971-3-7135531 Mobile: +971-507308705 Fax: +971-3-7672018 Email: nalqirim at uaeu.ac.ae Website: http://nalqirim.wix.com/nabeel-al-qirim ________________________________ Disclaimer: This email and the file(s) attached shall remain confidential and is intended for the receivers use only. If you are not the intended receiver or if you have received this email by mistake, please advise the sender and delete the email along with its attachment(s) from your system immediately. You do not have the right to copy/print/distribute this email or attached file(s), or to release its contents to any other party other than the intended receivers whatsoever; except if you take prior written approval from the sender. If you violate the above, you will be legally held accountable. From neil.ghani at strath.ac.uk Mon Feb 9 15:06:55 2015 From: neil.ghani at strath.ac.uk (Neil Ghani) Date: Mon, 9 Feb 2015 15:06:55 +0000 Subject: [Haskell] 4Yr PostDoc with McBride/Ghani Message-ID: <992440A2-20EE-45E0-91C6-606A4A17C9D6@strath.ac.uk> Please forward to anyone you think might be interested cheers neil Salary range: ?30434 - ?34,233 FTE: 1.0 Term: Fixed Term (4 years) Closing date: 23 February 2015 Applications are invited for a Research Associate to work under the supervision of Professor Neil Ghani and Dr Conor McBride on the EPSRC grant "Homotopy Type Theory: Programming and Verification". Homotopy Type Theory (HoTT) is a revolutionary new approach to type theory where types are interpreted as spaces, terms as points and equalities as paths. Decades of research in homotopy theory has uncovered the structure of such paths and HoTT uses this structure as the basis of a new theory of equality. Excitingly, within homotopy theory, one naturally studies higher homotopies of paths between paths and this gives the higher dimensional structure of equality we previously lacked. The objective of this grant is to translate the advances of HoTT into more concrete programming language and verification tools. You will join a team consisting of Prof Neil Ghani, Dr Conor McBride at the University of Strathclyde as well as Dr Nicola Gambino at the University of Leeds and Dr Thorsten Altenkirch at the Univeristy of Nottingham. We will be hiring an RA to work on the more theoretical parts of the project at Nottignham while your main duties will be to conduct research on the more applied - that is programming language - aspects of the project at Strathclyde. You will possess a PhD in mathematics or computer science and be familiar with type theory, category theory and programming languages. Interviews have been scheduled for 25 March 2015. For informal enquiries, please contact Professor Neil Ghani, (email: neil.ghani at strath.ac.uk or tel: 0141 548 4303) or Dr Conor McBride, (email conor.mcbride at strath.ac.uk or tel 01415483121. From andrei.paskevich at lri.fr Tue Feb 10 09:46:03 2015 From: andrei.paskevich at lri.fr (Andrei Paskevich) Date: Tue, 10 Feb 2015 10:46:03 +0100 Subject: [Haskell] First Call for Papers, PxTP 2015 Message-ID: The Fourth International Workshop on Proof eXchange for Theorem Proving (PxTP) http://pxtp15.lri.fr/ August 2-3, 2015, Berlin, Germany associated with CADE 2015 Important dates * Abstract submission: Thu, May 7, 2015 * Paper submission: Thu, May 14, 2015 * Notification: Tue, June 16, 2015 * Camera ready versions due: Thu, June 25, 2015 * Workshop: August 2-3, 2015 Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automated and interactive, during the past decades, made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and also collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools to exchange problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation and communication methods, standards, protocols, and programming interfaces. The workshop welcomes the interested developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and in descriptions of the current bottlenecks and proposals for improvement. Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs connected to problems, proofs, and models; * comparison, refactoring, and optimization of proofs; * practical experiences, case studies, feasibility studies; * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations). Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org/). Papers will be submitted via EasyChair, at the PxTP'2015 workshop page (http://www.easychair.org/conferences/?conf=pxtp2015). Accepted full papers will appear in an EPTCS volume. Invited speakers (joint with the AMI'2015 workshop) * Georges Gonthier (Microsoft Research) * Bart Jacobs (KU Leuven) Program committee * Jesse Alama (Vienna University of Technology) * Peter Baumgartner (NICTA) * Jasmin Blanchette (TU M?nchen) * Guillaume Burel (C?DRIC, ENSIIE) * ?velyne Contejean (LRI, CNRS, Universit? Paris Sud) * Cezary Kaliszyk (University of Innsbruck), co-chair * Ramana Kumar (University of Cambridge) * Dale Miller (Inria / LIX, ?cole polytechnique) * Bruno Woltzenlogel Paleo (Vienna University of Technology) * Andrei Paskevich (LRI, Universit? Paris Sud), co-chair * Damien Pous (LIP, CNRS, ENS Lyon) * Geoff Sutcliffe (University of Miami) * Laurent Th?ry (Inria) * Cesare Tinelli (University of Iowa) * Josef Urban (Radboud University Nijmegen) From simonpj at microsoft.com Tue Feb 10 15:50:02 2015 From: simonpj at microsoft.com (Simon Peyton Jones) Date: Tue, 10 Feb 2015 15:50:02 +0000 Subject: [Haskell] GHC 7.10 Prelude: we need your opinion Message-ID: <618BE556AADD624C9C918AA5D5911BEF562C4A1C@DB3PRD3001MB020.064d.mgd.msft.net> Haskell Friends This email asks for your help in deciding how to proceed with some Prelude changes in GHC 7.10. Please read on, but all the info is also at the survey link, here: http://goo.gl/forms/XP1W2JdfpX. Deadline is 21 Feb. The ?Core Libraries Committee (CLC) is responsible for developing the core libraries that ship with GHC. This is an important but painstaking task, and we owe the CLC a big vote of thanks for taking it on. For over a year the CLC has been working on integrating the Foldable and Traversable classes (shipped in base in GHC 7.8) into the core libraries, and into the Prelude in particular. Detailed planning for GHC 7.10 started in the autumn of 2014, and the CLC went ahead with this integration. Then we had a failure of communication. As these changes affect the Prelude, which is in scope for all users of Haskell, these changes should be held to a higher bar than the regular libraries@ review process. However, the Foldable/Traversable changes were not particularly well signposted. Many people have only recently woken up to them, and some have objected (both in principle and detail). This is an extremely unfortunate situation. On the one hand we are at RC2 for GHC 7.10, so library authors have invested effort in updating their libraries to the new Prelude. On the other, altering the Prelude is in effect altering the language, something we take pretty seriously. We should have had this debate back in 2014, but here we are, and it is unproductive to argue about whose fault it is. We all share responsibility. We need to decide what to do now. A small group of us met by Skype and we've decided to do this: ? Push back GHC 7.10's release by at least a month, to late March. This delay also gives us breathing space to address an unrelated show-stopping bug, Trac #9858. ? Invite input from the Haskell community on which of two approaches to adopt (this survey). The main questions revolve around impact on the Haskell ecosystem (commercial applications, teaching, libraries, etc etc), so we want to ask your opinion rather than guess it. ? Ask Simon Marlow and Simon Peyton Jones to decide which approach to follow for GHC 7.10. Wiki pages have been created summarizing these two primary alternatives, including many more points and counter-points and technical details: ? Overall summary: https://ghc.haskell.org/trac/ghc/wiki/Prelude710 ? Details of Plan List: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List ? Details of Plan FTP: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP This survey invites your input on which plan we should follow. Would you please ? Read the details of the alternative plans on the three wiki pages above ? Add your response to the survey Please do read the background. Well-informed responses will help. Thank you! DEADLINE: 21 February 2015 Simon PJ -------------- next part -------------- An HTML attachment was scrubbed... URL: From simonpj at microsoft.com Tue Feb 10 16:05:21 2015 From: simonpj at microsoft.com (Simon Peyton Jones) Date: Tue, 10 Feb 2015 16:05:21 +0000 Subject: [Haskell] [Haskell-cafe] GHC 7.10 Prelude: we need your opinion In-Reply-To: <4445561423583958@web8j.yandex.ru> References: <618BE556AADD624C9C918AA5D5911BEF562C4A1C@DB3PRD3001MB020.064d.mgd.msft.net> <4445561423583958@web8j.yandex.ru> Message-ID: <618BE556AADD624C9C918AA5D5911BEF562C4AE6@DB3PRD3001MB020.064d.mgd.msft.net> | What were the objections? Especially the principle ones? Please read the info pages, which set out the arguments quite carefully. Also, I spammed several email lists to ensure broad coverage, but it'd be best to debate on the libraries at haskell.org, rather than reply-to-all; that's what it's for. (Which I failed to send the announcement to! I'll fix that.) Simon | -----Original Message----- | From: Miguel Mitrofanov [mailto:miguelimo38 at yandex.ru] | Sent: 10 February 2015 15:59 | To: Simon Peyton Jones; haskell at haskell.org; Haskell Cafe (haskell- | cafe at haskell.org); GHC users; ghc-devs at haskell.org | Subject: Re: [Haskell-cafe] GHC 7.10 Prelude: we need your opinion | | What were the objections? Especially the principle ones? | | 10.02.2015, 18:51, "Simon Peyton Jones" : | > Haskell Friends | > | > This email asks for your help in deciding how to proceed with some | Prelude changes in GHC 7.10.? Please read on, but all the info is also | at the survey link, here: http://goo.gl/forms/XP1W2JdfpX.?? Deadline | is 21 Feb. | > | > The ?Core Libraries Committee (CLC) is responsible for developing the | core libraries that ship with GHC. This is an important but | painstaking task, and we owe the CLC a big vote of thanks for taking | it on. | > | > For over a year the CLC has been working on integrating the Foldable | and Traversable classes (shipped in base in GHC 7.8) into the core | libraries, and into the Prelude in particular. Detailed planning for | GHC 7.10 started in the autumn of 2014, and the CLC went ahead with | this integration. | > | > Then we had a failure of communication.? As these changes affect the | Prelude, which is in scope for all users of Haskell, these changes | should be held to a higher bar than the regular libraries@ review | process.? However, the Foldable/Traversable changes were not | particularly well signposted. Many people have only recently woken up | to them, and some have objected (both in principle and detail). | > | > This is an extremely unfortunate situation. On the one hand we are | at RC2 for GHC 7.10, so library authors have invested effort in | updating their libraries to the new Prelude. On the other, altering | the Prelude is in effect altering the language, something we take | pretty seriously. We should have had this debate back in 2014, but | here we are, and it is unproductive to argue about whose fault it is. | We all share responsibility. | > | > We need to decide what to do now. A small group of us met by Skype | and we've decided to do this: | > | > ????????? Push back GHC 7.10's release by at least a month, to late | March.? This delay also gives us breathing space to address an | unrelated show-stopping bug, Trac #9858. | > | > ????????? Invite input from the Haskell community on which of two | approaches to adopt (this survey).? The main questions revolve around | impact on the Haskell ecosystem (commercial applications, teaching, | libraries, etc etc), so we want to ask your opinion rather than guess | it. | > | > ????????? Ask Simon Marlow and Simon Peyton Jones to decide which | approach to follow for GHC 7.10. | > | > Wiki pages have been created summarizing these two primary | alternatives, including many more points and counter-points and | technical details: | > | > ????????? Overall summary: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710 | > | > ????????? Details of Plan List: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List | > | > ????????? Details of Plan FTP: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP | > | > This survey invites your input on which plan we should follow. Would | you please | > | > ????????? Read the details of the alternative plans on the three | wiki pages above | > | > ????????? Add your response to the survey | > | > Please do read the background.? Well-informed responses will | help.? Thank you! | > | > DEADLINE: 21 February 2015 | > | > Simon PJ | > | > , | > | > _______________________________________________ | > Haskell-Cafe mailing list | > Haskell-Cafe at haskell.org | > http://www.haskell.org/mailman/listinfo/haskell-cafe From twhitehead at gmail.com Tue Feb 10 20:38:45 2015 From: twhitehead at gmail.com (Tyson Whitehead) Date: Tue, 10 Feb 2015 15:38:45 -0500 Subject: [Haskell] Rank-N types with (.) composition Message-ID: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> I came across something that seems a bit strange to me. Here is a simplified version (the original was trying to move from a lens ReifiedFold to a lens-action ReifiedMonadicFold) {-# LANGUAGE RankNTypes #-} import Control.Applicative newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } trip :: Wrap -> Wrap trip a = Wrap (extract a) The compiler is okay with this. It chokes on this alternative though trip :: Wrap -> Wrap trip = Wrap . extract giving (GHC 7.8.2) Couldn't match type ?f0 Int? with ?forall (f :: * -> *). Functor f => f Int? Expected type: f0 Int -> Wrap Actual type: (forall (f :: * -> *). Functor f => f Int) -> Wrap In the first argument of ?(.)?, namely ?Wrap? In the expression: Wrap . extract I'm guessing this is because the compiler fancy footwork to handle the implicit parameters, something like trip a = Wrap (\f fDict -> extract a f fDict) where f is the Functor type and fDict is the associated dictionary, isn't compatible with the (.) definition of f . g = \x -> f (g x) Is this correct? I would appreciate anyone insight here. Is there a way combine these (.) style? Thanks! -Tyson From david.feuer at gmail.com Tue Feb 10 20:51:31 2015 From: david.feuer at gmail.com (David Feuer) Date: Tue, 10 Feb 2015 15:51:31 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: The problem is that GHC's type system is (almost entirely) predicative. I couldn't tell you just what that means, but to a first approximation, it means that type variables cannot be instantiated to polymorphic types. You write trip = Wrap . extract which means (.) Wrap extract (.)::(b->c)->(a->b)->a->c Wrap :: (forall f. Functor f => f Int) -> Wrap The trouble here is that the type variable b in the type of (.) isn't allowed to be polymorphic, but Wrap's argument must be. Note that there's a weird exception: ($) actually has an impredicative type, because it's a special case in the type checker. This is largely for historical reasons. On Tue, Feb 10, 2015 at 3:38 PM, Tyson Whitehead wrote: > I came across something that seems a bit strange to me. Here is a simplified version (the original was trying to move from a lens ReifiedFold to a lens-action ReifiedMonadicFold) > > {-# LANGUAGE RankNTypes #-} > > import Control.Applicative > > newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } > > trip :: Wrap -> Wrap > trip a = Wrap (extract a) > > The compiler is okay with this. It chokes on this alternative though > > trip :: Wrap -> Wrap > trip = Wrap . extract > > giving (GHC 7.8.2) > > Couldn't match type ?f0 Int? > with ?forall (f :: * -> *). Functor f => f Int? > Expected type: f0 Int -> Wrap > Actual type: (forall (f :: * -> *). Functor f => f Int) -> Wrap > In the first argument of ?(.)?, namely ?Wrap? > In the expression: Wrap . extract > > I'm guessing this is because the compiler fancy footwork to handle the implicit parameters, something like > > trip a = Wrap (\f fDict -> extract a f fDict) > > where f is the Functor type and fDict is the associated dictionary, isn't compatible with the (.) definition of > > f . g = \x -> f (g x) > > Is this correct? I would appreciate anyone insight here. Is there a way combine these (.) style? > > Thanks! -Tyson > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell From dan.doel at gmail.com Tue Feb 10 21:28:56 2015 From: dan.doel at gmail.com (Dan Doel) Date: Tue, 10 Feb 2015 16:28:56 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: Impredicativity, with regard to type theories, generally refers to types being able to quantify over the collection of types that they are then a part of. So, the judgment: (forall (a :: *). a -> a) :: * is impredicative, because we have a type in * that quantifies over all types in *, which includes itself. Impredicativity in general refers to this sort of (mildly) self-referential definition. GHC will tell you that the above judgment is true, but things aren't that simple. The type inference algorithm can either try to make use of such impredicative instantiations, or act like everything is predicative. And aspects of GHC's algorithm are either simplified or made possible at all because of assumptions of predicativity. Also, I think ($) is the way it is specifically because 'runST $ ...' is considered useful and common enough to warrant an ad-hoc solution. There have been other ad-hoc solutions in the past, but redesigning inference to not be ad-hoc about it would be very difficult at best. -- Dan On Tue, Feb 10, 2015 at 3:51 PM, David Feuer wrote: > The problem is that GHC's type system is (almost entirely) > predicative. I couldn't tell you just what that means, but to a first > approximation, it means that type variables cannot be instantiated to > polymorphic types. You write > > trip = Wrap . extract > > > which means > > (.) Wrap extract > > (.)::(b->c)->(a->b)->a->c > > Wrap :: (forall f. Functor f => f Int) -> Wrap > > The trouble here is that the type variable b in the type of (.) isn't > allowed to be polymorphic, but Wrap's argument must be. > > Note that there's a weird exception: ($) actually has an impredicative > type, because it's a special case in the type checker. This is largely > for historical reasons. > > On Tue, Feb 10, 2015 at 3:38 PM, Tyson Whitehead > wrote: > > I came across something that seems a bit strange to me. Here is a > simplified version (the original was trying to move from a lens ReifiedFold > to a lens-action ReifiedMonadicFold) > > > > {-# LANGUAGE RankNTypes #-} > > > > import Control.Applicative > > > > newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } > > > > trip :: Wrap -> Wrap > > trip a = Wrap (extract a) > > > > The compiler is okay with this. It chokes on this alternative though > > > > trip :: Wrap -> Wrap > > trip = Wrap . extract > > > > giving (GHC 7.8.2) > > > > Couldn't match type ?f0 Int? > > with ?forall (f :: * -> *). Functor f => f Int? > > Expected type: f0 Int -> Wrap > > Actual type: (forall (f :: * -> *). Functor f => f Int) -> Wrap > > In the first argument of ?(.)?, namely ?Wrap? > > In the expression: Wrap . extract > > > > I'm guessing this is because the compiler fancy footwork to handle the > implicit parameters, something like > > > > trip a = Wrap (\f fDict -> extract a f fDict) > > > > where f is the Functor type and fDict is the associated dictionary, > isn't compatible with the (.) definition of > > > > f . g = \x -> f (g x) > > > > Is this correct? I would appreciate anyone insight here. Is there a > way combine these (.) style? > > > > Thanks! -Tyson > > _______________________________________________ > > Haskell mailing list > > Haskell at haskell.org > > http://www.haskell.org/mailman/listinfo/haskell > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: From david.feuer at gmail.com Tue Feb 10 21:37:40 2015 From: david.feuer at gmail.com (David Feuer) Date: Tue, 10 Feb 2015 16:37:40 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: On Tue, Feb 10, 2015 at 4:28 PM, Dan Doel wrote: > Also, I think ($) is the way it is specifically because 'runST $ ...' is > considered useful and common enough to warrant an ad-hoc solution. There > have been other ad-hoc solutions in the past, but redesigning inference to > not be ad-hoc about it would be very difficult at best. > > -- Dan Of the ad-hoc solutions available, I'd personally think the least surprising would be to make f $ x special syntax instead of an operator. The main tricky bit would be preserving source for error messages; the type checker would have to keep track, for each application, of whether it was a standard juxtaposition or whether it used $. From dan.doel at gmail.com Tue Feb 10 22:44:54 2015 From: dan.doel at gmail.com (Dan Doel) Date: Tue, 10 Feb 2015 17:44:54 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: Well, that might also be surprising, unless ($) is also magically made to work like a standard operator (just off the top of my head; there may be other confusing aspects). Really, I think the least ad-hoc solution (other than a hypothetical best-of-both-worlds inference algorithm) would be to allow code like: runST do ... where you can apply expressions directly to certain syntactic constructs without an operator in between. I suspect the majority of cases where 'runST $' is used are followed by a 'do,' and not having the remaining ones wouldn't be nearly as painful to use with parentheses (since they likely wouldn't be multi-line). And this extension is desirable for other reasons as well (though I can't recall any specifics off the top of my head). But I wouldn't hold your breath for that. On Tue, Feb 10, 2015 at 4:37 PM, David Feuer wrote: > On Tue, Feb 10, 2015 at 4:28 PM, Dan Doel wrote: > > > Also, I think ($) is the way it is specifically because 'runST $ ...' is > > considered useful and common enough to warrant an ad-hoc solution. There > > have been other ad-hoc solutions in the past, but redesigning inference > to > > not be ad-hoc about it would be very difficult at best. > > > > -- Dan > > Of the ad-hoc solutions available, I'd personally think the least > surprising would be to make f $ x special syntax instead of an > operator. The main tricky bit would be preserving source for error > messages; the type checker would have to keep track, for each > application, of whether it was a standard juxtaposition or whether it > used $. > -------------- next part -------------- An HTML attachment was scrubbed... URL: From twhitehead at gmail.com Tue Feb 10 23:19:49 2015 From: twhitehead at gmail.com (Tyson Whitehead) Date: Tue, 10 Feb 2015 18:19:49 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> On February 10, 2015 16:28:56 Dan Doel wrote: > Impredicativity, with regard to type theories, generally refers to types > being able to quantify over the collection of types that they are then a > part of. So, the judgment: > > (forall (a :: *). a -> a) :: * > > is impredicative, because we have a type in * that quantifies over all > types in *, which includes itself. Impredicativity in general refers to > this sort of (mildly) self-referential definition. Thanks Dan and David, That was informative. Also very interesting that ($) is a special case. I tried this newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } trip'' :: Wrap -> Wrap trip'' a = Wrap $ extract a and the compiler was happy. Wrapping ($) as ($') gave an error as you implied it would trip''' :: Wrap -> Wrap trip''' a = Wrap $' extract a where ($') = ($) With regard to my earlier comment about translating the (.) version trip' :: Wrap -> Wrap trip' = Wrap . extract to core, I can see it's actually okay. A most you may need is a lambda to float the implicit parameters backwards trip' :: Wrap -> Wrap trip' = Wrap . (\a f fDict -> extract f fDict a) as GHC seems to always float them as far leftward as possible extract :: Functor f => Wrap -> f Int I take it there are no user supplied types a person can give to overcome the predicative assumption? Out of curiosity, how would you write the special internal type that ($) has that separates it from ($') above? Thanks! -Tyson From allbery.b at gmail.com Tue Feb 10 23:30:36 2015 From: allbery.b at gmail.com (Brandon Allbery) Date: Tue, 10 Feb 2015 18:30:36 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> Message-ID: On Tue, Feb 10, 2015 at 6:19 PM, Tyson Whitehead wrote: > Out of curiosity, how would you write the special internal type that ($) > has that separates it from ($') above? I don't think there's any way to write the type. Remember that GHC uses System Fc internally; that can represent more types than can be written in source code. That said, you can probably examine generated Core to see what it looks like in System Fc. -- brandon s allbery kf8nh sine nomine associates allbery.b at gmail.com ballbery at sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net -------------- next part -------------- An HTML attachment was scrubbed... URL: From dan.doel at gmail.com Tue Feb 10 23:31:05 2015 From: dan.doel at gmail.com (Dan Doel) Date: Tue, 10 Feb 2015 18:31:05 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> Message-ID: There is no special type for ($). The name is simply special cased in the compiler. The rule is something like: Whenever you see: f Prelude.$ x instead try to type check: f x That may not be the exact behavior, but it's close. To fix (.) (in a similar fashion) you would have to have a similar rule, like: Whenever you see: f Prelude.. g instead try to type check: \x -> f (g x) -- Dan On Tue, Feb 10, 2015 at 6:19 PM, Tyson Whitehead wrote: > On February 10, 2015 16:28:56 Dan Doel wrote: > > Impredicativity, with regard to type theories, generally refers to types > > being able to quantify over the collection of types that they are then a > > part of. So, the judgment: > > > > (forall (a :: *). a -> a) :: * > > > > is impredicative, because we have a type in * that quantifies over all > > types in *, which includes itself. Impredicativity in general refers to > > this sort of (mildly) self-referential definition. > > Thanks Dan and David, > > That was informative. Also very interesting that ($) is a special case. > I tried this > > newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } > > trip'' :: Wrap -> Wrap > trip'' a = Wrap $ extract a > > and the compiler was happy. Wrapping ($) as ($') gave an error as you > implied it would > > trip''' :: Wrap -> Wrap > trip''' a = Wrap $' extract a > where ($') = ($) > > With regard to my earlier comment about translating the (.) version > > trip' :: Wrap -> Wrap > trip' = Wrap . extract > > to core, I can see it's actually okay. A most you may need is a lambda to > float the implicit parameters backwards > > trip' :: Wrap -> Wrap > trip' = Wrap . (\a f fDict -> extract f fDict a) > > as GHC seems to always float them as far leftward as possible > > extract :: Functor f => Wrap -> f Int > > I take it there are no user supplied types a person can give to overcome > the predicative assumption? > > Out of curiosity, how would you write the special internal type that ($) > has that separates it from ($') above? > > Thanks! -Tyson > -------------- next part -------------- An HTML attachment was scrubbed... URL: From twhitehead at gmail.com Wed Feb 11 00:02:51 2015 From: twhitehead at gmail.com (Tyson Whitehead) Date: Tue, 10 Feb 2015 19:02:51 -0500 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: <1523160.TEDBk6S5bp@whitehead.beowulf.uwo.ca> On February 10, 2015 17:44:54 Dan Doel wrote: > Really, I think the least ad-hoc solution (other than a hypothetical > best-of-both-worlds inference algorithm) would be to allow code like: > > runST do ... > > where you can apply expressions directly to certain syntactic constructs > without an operator in between. I suspect the majority of cases where > 'runST $' is used are followed by a 'do,' and not having the remaining ones > wouldn't be nearly as painful to use with parentheses (since they likely > wouldn't be multi-line). And this extension is desirable for other reasons > as well (though I can't recall any specifics off the top of my head). I would like that a lot even if not for this case. It's always seemed kind of silly that you have to throw in a $. Cheers! -Tyson From lemming at henning-thielemann.de Wed Feb 11 08:25:35 2015 From: lemming at henning-thielemann.de (Henning Thielemann) Date: Wed, 11 Feb 2015 09:25:35 +0100 (CET) Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> Message-ID: On Tue, 10 Feb 2015, Tyson Whitehead wrote: > I came across something that seems a bit strange to me. Here is a > simplified version (the original was trying to move from a lens > ReifiedFold to a lens-action ReifiedMonadicFold) You are on Haskell at haskell.org here. Could you please move to haskell-cafe? From simonpj at microsoft.com Wed Feb 11 09:39:31 2015 From: simonpj at microsoft.com (Simon Peyton Jones) Date: Wed, 11 Feb 2015 09:39:31 +0000 Subject: [Haskell] Rank-N types with (.) composition In-Reply-To: <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> References: <1557238.IhA1og8xmu@whitehead.beowulf.uwo.ca> <1637612.9k5Y53Y3NQ@whitehead.beowulf.uwo.ca> Message-ID: <618BE556AADD624C9C918AA5D5911BEF562C5871@DB3PRD3001MB020.064d.mgd.msft.net> ($) has its own *typing rule*; it does not have a special type. It's very ad hoc, but ($) is used so much to decrease parens that (e1 $ e2) is almost special syntax! At the moment the *only* robust way to pass a polymorphic function to a polymorphic function (here, you are passing Wrap to (.)) is to wrap it in a newtype, much as Wrap does. I have made several forays into the impredicative swamp, and barely made it back to the shore alive. I think that, at least in the context of Haskell, the trick is to be less ambitious, something like QML. Since this comes up regularly, I've started a wiki page to explain the issues: https://ghc.haskell.org/trac/ghc/wiki/ImpredicativePolymorphism Please do improve it. Simon | -----Original Message----- | From: Haskell [mailto:haskell-bounces at haskell.org] On Behalf Of Tyson | Whitehead | Sent: 10 February 2015 23:20 | To: Dan Doel | Cc: haskell at haskell.org | Subject: Re: [Haskell] Rank-N types with (.) composition | | On February 10, 2015 16:28:56 Dan Doel wrote: | > Impredicativity, with regard to type theories, generally refers to | > types being able to quantify over the collection of types that they | > are then a part of. So, the judgment: | > | > (forall (a :: *). a -> a) :: * | > | > is impredicative, because we have a type in * that quantifies over | all | > types in *, which includes itself. Impredicativity in general refers | > to this sort of (mildly) self-referential definition. | | Thanks Dan and David, | | That was informative. Also very interesting that ($) is a special | case. I tried this | | newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } | | trip'' :: Wrap -> Wrap | trip'' a = Wrap $ extract a | | and the compiler was happy. Wrapping ($) as ($') gave an error as you | implied it would | | trip''' :: Wrap -> Wrap | trip''' a = Wrap $' extract a | where ($') = ($) | | With regard to my earlier comment about translating the (.) version | | trip' :: Wrap -> Wrap | trip' = Wrap . extract | | to core, I can see it's actually okay. A most you may need is a | lambda to float the implicit parameters backwards | | trip' :: Wrap -> Wrap | trip' = Wrap . (\a f fDict -> extract f fDict a) | | as GHC seems to always float them as far leftward as possible | | extract :: Functor f => Wrap -> f Int | | I take it there are no user supplied types a person can give to | overcome the predicative assumption? | | Out of curiosity, how would you write the special internal type that | ($) has that separates it from ($') above? | | Thanks! -Tyson | _______________________________________________ | Haskell mailing list | Haskell at haskell.org | http://www.haskell.org/mailman/listinfo/haskell From spider.vz at gmail.com Fri Feb 13 00:25:53 2015 From: spider.vz at gmail.com (Vadim Zaytsev) Date: Fri, 13 Feb 2015 01:25:53 +0100 Subject: [Haskell] STAF 2015: Joint Call for Papers Message-ID: ???????????????????????????????????????????? * Joint Call for Papers for STAF 2015 * Software Technologies: Applications and Foundations * 20-24 July 2015, L'Aquila, Italy * http://www.disim.univaq.it/staf2015/ * https://twitter.com/staf2015 ???????????????????????????????????????????? STAF 2015 events include: - ICMT'15: Eighth International Conference on Model Transformation - ECMFA'15: Eleventh European Conference on Modelling Foundations and Applications - TAP'15: Ninth International Conference on Tests and Proofs - ICGT'15: Seventh International Conference on Graph Transformation - TTC'15: Eighth Transformation Tool Contest - BX'15: Fourth International Workshop on Bidirectional Transformations - Projects Showcase - Doctoral Symposium - (more workshops TBA) ???????????????????????????????????????????? The deadlines coming up soon are (abstract/paper deadlines given, if applicable): - 13/20 February: TAP - 15/22 February: ICMT - 27 February/6 March: ECMFA - 11 March: TTC (cases) - 20/27 March: ICGT We provide some brief information on each of the conferences below, please refer to their corresponding websites for complete calls for submissions, as well as more detailed explanation of each event's topics and priorities. ???????????????????????????????????????????? * 9th International Conference on Tests and Proofs (TAP 2015) * http://tap2015.in.tum.de/ * http://tap2015.in.tum.de/call.shtml * https://www.easychair.org/conferences/?conf=tap2015 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. TAP 2015 will accept three kinds of submissions: regular research papers, short papers and tutorial proposals. TAP 2015 keynote talk will be given by Einar Broch Johnsen. Organisation: - Program Co-Chair: Jasmin C. Blanchette (TU Muenchen, Inria) - Program Co-Chair: Nikolai Kosmatov (CEA LIST) ???????????????????????????????????????????? * 8th International Conference on Model Transformation (ICMT 2015) * http://www.model-transformation.org/ * http://www.di.univaq.it/diruscio/sites/ICMT2015/?page_id=21 * https://easychair.org/conferences/?conf=icmt2015 Model transformation encompasses a variety of technical spaces (modelware, grammarware, dataware, ontoware), a variety of model representations (text, tables, trees, graphs) and a variety of transformation paradigms (rule-based transformations, term rewriting, OO manipulations, weaving, refactoring). The study of model transformation includes foundations, structuring mechanisms, and properties, such as modularity, composability and parametrisation of transformations, transformation languages, techniques and tools. To achieve impact on software engineering in general, methodologies and tools are required to integrate model transformation into existing development environments and processes. Four kinds of submissions are sought: research papers, application papers, exploratory papers and tool demo papers. Organisation: - Program Co-Chair: Dimitris Kolovos (University of York, UK) - Program Co-Chair: Manuel Wimmer (Vienna University of Technology, Austria) - Social Chair: James R. Williams (University of York, UK) - Web Chair: Javier Troya (Vienna University of Technology, Austria) ???????????????????????????????????????????? * 11th European Conference on Modelling Foundations and Applications (ECMFA 2015) * https://www.uni-marburg.de/fb12/swt/ecmfa2015/ * https://www.uni-marburg.de/fb12/swt/ecmfa2015/cfp.pdf * https://www.easychair.org/conferences/?conf=ecmfa2015 The ECMFA conference series is dedicated to advancing the state of knowledge and fostering the industrial application of Model-Based Engineering as an approach to the design, analysis and development of software and systems that relies on exploiting high-level models and computer-based automation to achieve significant boosts in both productivity and quality. Its focus is on engaging the key figures of research and industry in a dialogue which results in stronger and more effective practical application of MBE, hence producing more reliable software based on state-of-the-art research results. ECMFA has two distinct Paper Tracks: one for research papers (Track F) dealing with the foundations for MBE, and one for industrial applications papers (Track A) dealing with the applications of MBE, including experience reports on MBE tools. Organisation: - Foundations Program Chair: Gabriele Taentzer (Philipps-Universitaet Marburg, Germany) - Applications Program Chair: Francis Bordeleau (Carleton University, Ottawa, Canada) ???????????????????????????????????????????? * 8th Transformation Tool Contest (TTC 2015) * http://www.transformation-tool-contest.eu/ * http://www.transformation-tool-contest.eu/cfc.html * https://www.easychair.org/conferences/?conf=ttc2015 The aim of the Transformation Tool Contest is to evaluate and compare the expressiveness, the usability and the performance of transformation tools for structured data along a number of selected challenging case studies. Cases can still be submitted up to 11 March 2015. In 2015, our special focus is on program transformations and bidirectional transformations. Shortly after that deadline, the best cases will be selected, a Call for Solutions will be issued, and then people have the chance to submit solutions to the selected cases until 29 April 2015. Organisation: - Tassilo Horn (University of Koblenz-Landau, Germany) - Filip Krikava (University of Lille & INRIA Lille) - Louis Rose (University of York, UK) ???????????????????????????????????????????? * 7th International Conference on Graph Transformation (ICGT 2015) * http://btn1x4.inf.uni-bayreuth.de/icgt2015/ * http://btn1x4.inf.uni-bayreuth.de/icgt2015/cfp.html * http://www.easychair.org/conferences/?conf=icgt2015 Many dynamic structures can be represented as graphs and their changes modeled as graph transformations. Theory and applications of graphs, graph grammars and graph transformation systems have been studied in our community for more than 40 years. This year ICGT offers two tracks: a Foundations Track and an Applications Track. The research papers (limited to 16 pages) submitted for the Foundations Track describe innovative contributions to current research on the foundations of graph transformations and are evaluated with respect to their originality, significance, and technical soundness. Papers for the applications track can be submitted in different categories: technical papers (limited to 16 pages), case studies (limited to 12 pages) and tool demo papers (limited to 8 pages). Organisation: - Program Co-Chair: Francesco Parisi-Presicce (University of Rome La Sapienza, Italy) - Program Co-Chair: Bernhard Westfechtel (University of Bayreuth, Germany) - Publicity Chair: Thomas Buchmann (University of Bayreuth, Germany) ???????????????????????????????????????????? Organisation of STAF 2015: - General Chair: Alfonso Pierantonio (Universit? degli Studi dell?Aquila, Italy) - Workshop Co-Chair: Davide Di Ruscio (Universit? degli Studi dell?Aquila, Italy) - Workshop Co-Chair: Pieter Van Gorp (Eindhoven University of Technology, The Netherlands) - Doctoral Symposium Co-Chair: Henry Muccini (Universit? degli Studi dell?Aquila, Italy) - Doctoral Symposium Co-Chair: D?niel Varr? (Budapest University of Technology and Economics, Hungary) - Doctoral Symposium Co-Chair: Martin Gogolla (University of Bremen, Germany) - Projects Showcase Co-Chair: Marco Autili (Universit? degli Studi dell?Aquila, Italy) - Projects Showcase Co-Chair: Bernhard Sch?tz (firtiss GmbH, Germany) - Publication Co-Chair: Louis Rose (University of York, UK) - Publication Co-Chair: Javier Troya (Technische Universit?t Wien, Austria) - Social Media and Publicity Chair: Vadim Zaytsev (Universiteit van Amsterdam, The Netherlands) - Web Chair: Francesco Basciani (Universit? degli Studi dell?Aquila, Italy) - Local: Massimo Tivoli, Romina Eramo, Ludovico Iovino, Francesco Gallo, Juri Di Rocco, Gianni Rosa ???????????????????????????????????????????? From P.Achten at cs.ru.nl Fri Feb 13 13:42:08 2015 From: P.Achten at cs.ru.nl (Peter Achten) Date: Fri, 13 Feb 2015 14:42:08 +0100 Subject: [Haskell] [TFP 2015] 2nd call for papers Message-ID: <54DDFF30.5010106@cs.ru.nl> ----------------------------- S E C O N D C A L L F O R P A P E R S ----------------------------- ======== TFP 2015 =========== 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers will be published as a Springer Lecture Notes in Computer Science (www.springer.com/lncs) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/). == INVITED SPEAKER == TFP is pleased to announce a talk by the following invited speaker: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2015 program chair, Manuel Serrano. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TFP is financially supported by == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp2015 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: March 17, 2015 Notification: March 24, 2015 Registration: April 7, 2015 TFP Symposium: June 3-5, 2015 Student papers feedback: June 9, 2015 Submission for formal review: July 1, 2015 Notification of acceptance: September 8, 2015 Camera ready paper: October 8, 2015 == PROGRAM COMMITTEE == Janis Voigtl?nder University of Bonn, DE Scott Owens University of Kent, UK Neil Sculthorpe Swansea University, UK Colin Runciman University of York, UK Manuel Serrano Inria (PC chair), FR Rinus Plasmeijer University of Nijmegen, NL Tomas Petricek University of Cambridge, UK Marco T. Morazan Seton Hall University, USA Wolfgang De Meuter Vrije Universiteit Brussel, BE Michel Mauny Ensta ParisTech, FR Sam Lindley The University of Edinburgh, UK Daan Leijen Microsoft, USA Jurriaan Hage Utrecht University, NL Andy Gill University of Kansas, USA Thomas Gazagnaire University of Cambrige, UK Lars-Ake Fredlund Universidad Polit?cnica de Madrid, ES Jean-Christophe Filliatre Universit? Paris Sud Orsay, FR Marc Feeley Universit? de Montr?al, CA Olaf Chitil University of Kent, UK Edwin Brady University of St Andrews, UK From icfp.publicity at googlemail.com Fri Feb 13 16:28:13 2015 From: icfp.publicity at googlemail.com (David Van Horn) Date: Fri, 13 Feb 2015 11:28:13 -0500 Subject: [Haskell] ICFP 2015: Final Call for Papers Message-ID: ===================================================================== 20th ACM SIGPLAN International Conference on Functional Programming ICFP 2015 Vancouver, Canada, August 31 - September 2, 2015 http://www.icfpconference.org/icfp2015 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Friday, February 27 2015, 23:59 UTC-11 https://icfp15.hotcrp.com/ Author response: Tuesday, April 21, 2015 through Thursday, 23 April, 2015 Notification: Friday, May 1, 2015 Final copy due: Friday, June 12, 2015 Scope ~~~~~ ICFP 2015 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming. * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling. * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types. * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation. * Applications: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security. * Education: teaching introductory programming; parallel programming; mathematical proof; algebra. * Functional Pearls: elegant, instructive, and fun essays on functional programming. * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working. If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Friday, 27 February 2015, 23:59 UTC-11, submit a full paper of at most 12 pages (6 pages for an Experience Report) in standard ACM conference format, including bibliography, figures, and appendices. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions will have a choice of one of three ways to manage their publication rights. These choices are described at http://authors.acm.org/main.html Presentations will be videotaped and released online if the presenter consents. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available at http://www.sigplan.org/Resources/Author/ Submission: Submissions will be accepted on the web using a link that will be posted at https://icfp15.hotcrp.com/ Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC on Tuesday, 21 April 2015, to read reviews and respond to them. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking the definitive version of ACM article should reduce user confusion over article versioning. After your article has been published and assigned to your ACM Author Profile page, please visit http://www.acm.org/publications/acm-author-izer-service to learn how to create your links for free downloads from the ACM DL. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. General Chair: Kathleen Fisher Tufts University (USA) Program Chair: John Reppy University of Chicago (USA) Program Committee: Amal Ahmed Northeastern University (USA) Jean-Philippe Bernardy Chalmers University of Technology (Sweden) Matthias Blume Google (USA) William Byrd University of Utah (USA) Andy Gill University of Kansas (USA) Neal Glew Google (USA) Fritz Henglein University of Copenhagen (Denmark) Gabriele Keller University of New South Wales and NICTA (Australia) Andrew Kennedy Microsoft Research Cambridge (UK) Neelakantan Krishnaswami Birmingham University (UK) Daan Leijen Microsoft Research Redmond (USA) Keiko Nakata FireEye Dresden (Germany) Mike Rainey INRIA Rocquencourt (France) Andreas Rossberg Google (Germany) Manuel Serrano INRIA Sophia Antipolis (France) Simon Thompson University of Kent (UK) David Van Horn University of Maryland (USA) Stephanie Weirich University of Pennsylvania (USA) From tarmo at cs.ioc.ee Fri Feb 13 17:42:44 2015 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Fri, 13 Feb 2015 19:42:44 +0200 Subject: [Haskell] TYPES 2015 2nd call for contributions Message-ID: <20150213194244.711beea8@duality> Reminder: Abstracts (2 pp easychair.cls) due by 13 March 2015 News: Tutorials by Joachim Kock and Peter LeFanu Lumsdaine. Post-proceedings volume in LIPIcs confirmed. CALL FOR CONTRIBUTIONS 21st International Conference on Types for Proofs and Programs, TYPES 2015 Tallinn, Estonia, 18-21 May 2015 http://cs.ioc.ee/types15/ Background The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. The meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014). The TYPES areas of interest include, but are not limited to: foundations of type theory and constructive mathematics; applications of type theory; dependently typed programming; industrial uses of type theory technology; meta-theoretic studies of type systems; proof assistants and proof technology; automation in computer-assisted reasoning; links between type theory and functional programming; formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. Invited speakers Gilles Barthe (IMDEA Software) Andrej Bauer (University of Ljubljana) Peter Selinger (Dalhousie University) Tutorials Joachim Kock (Universitat Aut?noma de Barcelona) Peter LeFanu Lumsdaine (Stockholm University) Contributed talks We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. Submission is via EasyChair by 13 March 2015. The authors will be notified of acceptance/rejection by 3 April 2015. Camera-ready versions of the accepted contributions, due by 24 April 2015, will be published in an informal book of abstracts for distribution at the workshop. Post-proceedings Similarly to TYPES 2011, 2013, 2014, we will publish a post-proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open for everyone. Tentative submission deadline: mid-September 2015. Programme committee Andrea Asperti (Universit? di Bologna) Robert Atkey (University of Edinburgh) Ulrich Berger (Swansea University) Jean-Philippe Bernardy (Chalmers University of Technology) Edwin Brady (University of St Andrews) Jo?lle Despeyroux (INRIA Sophia Antipolis - M?diterran?e) Herman Geuvers (Radboud Universiteit Nijmegen) Sam Lindley (University of Edinburgh) Assia Mahboubi (INRIA Saclay - ?le-de-France) Ralph Matthes (IRIT, CNRS and Universit? Paul Sabatier) Aleks Nanevski (IMDEA Software) Christine Paulin-Mohring (LRI, Universit? Paris-Sud) Simona Ronchi Della Rocca (Universit? di Torino) Ulrich Sch?pp (Ludwig-Maximilians-Universit?t M?nchen) Bas Spitters (Carnegie Mellon University) Pawel Urzyczyn (University of Warsaw) Tarmo Uustalu (Institute of Cybernetics, Tallinn) (chair) Organizers Logic and semantics group, Institute of Cybernetics, Tallinn Sponsors ERDF via EXCS, the Estonian Centre of Excellence in Computer Science From tarmo at cs.ioc.ee Fri Feb 13 20:13:43 2015 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Fri, 13 Feb 2015 22:13:43 +0200 Subject: [Haskell] ETAPS 2015 call for participation Message-ID: <20150213221343.35911ec2@duality> ****************************************************************** CALL FOR PARTICIPATION ETAPS 2015 18th European Joint Conferences on Theory And Practice of Software London, UK, 11-18 April 2015 http://www.etaps.org/ ****************************************************************** -- ABOUT ETAPS -- The European Joint Conferences on Theory And Practice of Software (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 six main annual conferences, accompanied by satellite workshops. ETAPS 2015 is already the eighteenth event in the series. -- MAIN CONFERENCES (13-17 April) -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems -- INVITED TALKS -- Unifying speakers: Daniel Licata (Wesleyan University, USA) Catuscia Palamidessi (INRIA Saclay and LIX, France) CC invited speaker: Keshav Pingali (University of Texas, USA) FoSSaCS invited speaker: Frank Pfenning (Carnegie Mellon University, USA) TACAS invited speaker: Wang Yi (Uppsala University, Sweden) -- CONTRIBUTED PAPERS See the accepted paper lists and the programme of the main conferences at the conference website. -- SATELLITE EVENTS (11-12 and 18 April) -- 17 satellite workshops will take place before or after ETAPS 2015. GALOP, GaM, QAPL (11-12 April) FMSPLE, FOPARA, SynCop, VPT (11 April) DICE, FESCA, VerifyThis, WoC, WPLI (12 April) HotSpot, MBT, PLACES, TTATT, TPDP (18 April) -- REGISTRATION Early registration is until Saturday, 14 February 2015. Normal-rate registration is until Tuesday, 10 March 2015. -- ACCOMMODATION We request that participants arrange their accommodation on their own. See our recommendations on the website. -- HOST CITY -- London is one of the most visited and cosmopolitan cities on earth. It is a leading global city, with strengths in the arts, commerce, education, entertainment, fashion, finance, healthcare, media, professional services, research and development, tourism and transport all contributing to its prominence. It can be reached by more people, from more destinations, in less time, than any other destination in the world. -- ORGANIZERS General chairs: Pasquale Malacaria, Nikos Tzevelekos Workshop chair: Paulo Oliva Publicity chairs: Michael Tautschnig and Greta Yorsh Further organizers: Dino Distefano, Edmund Robinson and Mehrnoosh Sadrzadeh --- HOST INSTITUTION Queen Mary University of London -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps2015 at qmul.ac.uk From gershomb at gmail.com Sun Feb 15 07:50:07 2015 From: gershomb at gmail.com (Gershom B) Date: Sun, 15 Feb 2015 02:50:07 -0500 Subject: [Haskell] ANN: New Haskell.org Homepage Now Live Message-ID: I?m pleased to announce that http://www.haskell.org has received its first significant design update since 2010! More significantly, for the first time since 2006 it is not a wiki, but an actual language homepage. More significantly still, for the first time ever, the Haskell homepage now runs on a fully Haskell-powered stack. I suppose some people might also be interested in the fact that it looks quite nice, and has significantly cleaned up the information it presents, so as to provide a more focused experience for newcomers looking to explore the language. The page is now includes the collective work of over 230 commits by 17 contributors. First and foremost among those is Chris Done, who conceived the vision, wrote the bulk of the code, and executed the design. Also thanks to our many admins, including Austin Seipp, Ricky Elrod, et al., who managed the deployment, and have been working behind the scenes to continue to modernize and update our creaking infrastructure. Onto a few key things to remember: ? * The wiki is still around at https://wiki.haskell.org and it is still a fantastic resource. It is now speedy again, and we have an account creation process. By all means, jump in, and help curate and cultivate its wealth of knowledge. ? * The new site is all on github:?https://github.com/haskell-infra/hl ? there you will also find an issue tracker as well. We are sure there are many gaffes, gaps, and oddities that remain to be patched up in the site, especially with regards to its content. Tickets, pull requests, and comments are encouraged. ? * The official home for our mailinglists is now http://mail.haskell.org ? hopefully this will cause no problems or confusion, and the redirects should be in place properly. Please let us know if there are any issues. ? * We think we covered everything, but there is the possibility that some item, service, or redirect broke in the course of this transition. Please let us know if this is the case. ? * If you have been responsible for some subdirectory under the www.haskell.org banner, then you will find that you do not yet have an account on the new server. Please contact us and we?ll get you set up to continue to maintain that portion of the site. ? * As always, you can reach the haskell ops and admin team at admin at haskell.org, or on freenode irc at #haskell-infrastructure. Regards, Gershom (and also the Haskell.org Committee and Haskell.org Admin Team) From sabel at ki.informatik.uni-frankfurt.de Sun Feb 15 12:31:14 2015 From: sabel at ki.informatik.uni-frankfurt.de (David Sabel) Date: Sun, 15 Feb 2015 13:31:14 +0100 Subject: [Haskell] ANN: New Haskell.org Homepage Now Live In-Reply-To: References: Message-ID: <54E09192.50909@ki.informatik.uni-frankfurt.de> I wonder why the downloads section doesn't link to the Haskell platform. What's the reason for it? David Am 15.02.2015 um 08:50 schrieb Gershom B: > I?m pleased to announce that http://www.haskell.org has received its first significant design update since 2010! More significantly, for the first time since 2006 it is not a wiki, but an actual language homepage. More significantly still, for the first time ever, the Haskell homepage now runs on a fully Haskell-powered stack. I suppose some people might also be interested in the fact that it looks quite nice, and has significantly cleaned up the information it presents, so as to provide a more focused experience for newcomers looking to explore the language. > > The page is now includes the collective work of over 230 commits by 17 contributors. First and foremost among those is Chris Done, who conceived the vision, wrote the bulk of the code, and executed the design. Also thanks to our many admins, including Austin Seipp, Ricky Elrod, et al., who managed the deployment, and have been working behind the scenes to continue to modernize and update our creaking infrastructure. > > Onto a few key things to remember: > > * The wiki is still around at https://wiki.haskell.org and it is still a fantastic resource. It is now speedy again, and we have an account creation process. By all means, jump in, and help curate and cultivate its wealth of knowledge. > * The new site is all on github: https://github.com/haskell-infra/hl ? there you will also find an issue tracker as well. We are sure there are many gaffes, gaps, and oddities that remain to be patched up in the site, especially with regards to its content. Tickets, pull requests, and comments are encouraged. > * The official home for our mailinglists is now http://mail.haskell.org ? hopefully this will cause no problems or confusion, and the redirects should be in place properly. Please let us know if there are any issues. > * We think we covered everything, but there is the possibility that some item, service, or redirect broke in the course of this transition. Please let us know if this is the case. > * If you have been responsible for some subdirectory under the www.haskell.org banner, then you will find that you do not yet have an account on the new server. Please contact us and we?ll get you set up to continue to maintain that portion of the site. > * As always, you can reach the haskell ops and admin team at admin at haskell.org, or on freenode irc at #haskell-infrastructure. > > Regards, > Gershom > (and also the Haskell.org Committee and Haskell.org Admin Team) > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell From difrumin at gmail.com Sun Feb 15 13:56:10 2015 From: difrumin at gmail.com (Daniil Frumin) Date: Sun, 15 Feb 2015 14:56:10 +0100 Subject: [Haskell] ANN: New Haskell.org Homepage Now Live In-Reply-To: <54E09192.50909@ki.informatik.uni-frankfurt.de> References: <54E09192.50909@ki.informatik.uni-frankfurt.de> Message-ID: Dear Haskell.org team thank you for your great work! But I was wondering this as well, why there is no mention of the Haskell platform in the Downloads section? I am also a little bit concerned about the "News" section: arguably, the news about GHC and Haskell platform releases are more important than newest stackoverflow questions or reddit posts. The newsfeed on Python.org, for example, is almost exclusively dedicated to releases and real-life events (which is also located on the front page). On Sun, Feb 15, 2015 at 1:31 PM, David Sabel wrote: > I wonder why the downloads section doesn't link to the Haskell platform. > What's the reason for it? > > David > > Am 15.02.2015 um 08:50 schrieb Gershom B: >> >> I?m pleased to announce that http://www.haskell.org has received its first >> significant design update since 2010! More significantly, for the first time >> since 2006 it is not a wiki, but an actual language homepage. More >> significantly still, for the first time ever, the Haskell homepage now runs >> on a fully Haskell-powered stack. I suppose some people might also be >> interested in the fact that it looks quite nice, and has significantly >> cleaned up the information it presents, so as to provide a more focused >> experience for newcomers looking to explore the language. >> >> The page is now includes the collective work of over 230 commits by 17 >> contributors. First and foremost among those is Chris Done, who conceived >> the vision, wrote the bulk of the code, and executed the design. Also thanks >> to our many admins, including Austin Seipp, Ricky Elrod, et al., who managed >> the deployment, and have been working behind the scenes to continue to >> modernize and update our creaking infrastructure. >> >> Onto a few key things to remember: >> >> * The wiki is still around at https://wiki.haskell.org and it is still >> a fantastic resource. It is now speedy again, and we have an account >> creation process. By all means, jump in, and help curate and cultivate its >> wealth of knowledge. >> * The new site is all on github: https://github.com/haskell-infra/hl ? >> there you will also find an issue tracker as well. We are sure there are >> many gaffes, gaps, and oddities that remain to be patched up in the site, >> especially with regards to its content. Tickets, pull requests, and comments >> are encouraged. >> * The official home for our mailinglists is now http://mail.haskell.org >> ? hopefully this will cause no problems or confusion, and the redirects >> should be in place properly. Please let us know if there are any issues. >> * We think we covered everything, but there is the possibility that >> some item, service, or redirect broke in the course of this transition. >> Please let us know if this is the case. >> * If you have been responsible for some subdirectory under the >> www.haskell.org banner, then you will find that you do not yet have an >> account on the new server. Please contact us and we?ll get you set up to >> continue to maintain that portion of the site. >> * As always, you can reach the haskell ops and admin team at >> admin at haskell.org, or on freenode irc at #haskell-infrastructure. >> >> Regards, >> Gershom >> (and also the Haskell.org Committee and Haskell.org Admin Team) >> >> _______________________________________________ >> Haskell mailing list >> Haskell at haskell.org >> http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell -- Sincerely yours, -- Daniil From Henrik.Nilsson at nottingham.ac.uk Wed Feb 18 15:14:12 2015 From: Henrik.Nilsson at nottingham.ac.uk (Henrik Nilsson) Date: Wed, 18 Feb 2015 15:14:12 +0000 Subject: [Haskell] Fwd: FARM 2015 Workshop - 1st call for papers and demos In-Reply-To: <201502120830.t1C8U4pc006212@easychair.org> References: <201502120830.t1C8U4pc006212@easychair.org> Message-ID: <54E4AC44.904@nottingham.ac.uk> Dear Haskell interested, Please find enclosed the call for paper for FARM that may be of interest to many of you. Best, /Henrik -------- Original Message -------- Subject: FARM 2015 Workshop - 1st call for papers and demos Date: Thu, 12 Feb 2015 08:30:04 +0000 From: FARM 2015 To: Henrik Nilsson FARM 2015 3rd ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design Vancouver, Canada, 5 September, 2015 The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) gathers together people who are harnessing functional techniques in the pursuit of creativity and expression. Functional Programming has emerged as a mainstream software development paradigm, and its artistic and creative use is booming. A growing number of software toolkits, frameworks and environments for art, music and design now employ functional programming languages and techniques. FARM is a forum for exploration and critical evaluation of these developments, for example to consider potential benefits of greater consistency, tersity, and closer mapping to a problem domain. FARM encourages submissions from across art, craft and design, including textiles, visual art, music, 3D sculpture, animation, GUIs, video games, 3D printing and architectural models, choreography, poetry, and even VLSI layouts, GPU configurations, or mechanical engineering designs. The language used need not be purely functional (?mostly functional? is fine), and may be manifested as a domain specific language or tool. Theoretical foundations, language design, implementation issues, and applications in industry or the arts are all within the scope of the workshop. Submissions are invited in two categories: * Full papers 5 to 12 pages using the ACM SIGPLAN template. FARM 2015 is an interdisciplinary conference, so a wide range of approaches are encouraged and we recognize that the appropriate length of a paper may vary considerably depending on the approach. However, all submissions must propose an original contribution to the FARM theme, cite relevant previous work, and apply appropriate research methods. * Demo abstracts Demo abstracts should describe the demonstration and its context, connecting it with the themes of FARM. A demo could be in the form of a short (10-20 minute) tutorial, presentation of work-in-progress, an exhibition of some work, or even a performance. Abstracts should be no longer than 2 pages, using the ACM SIGPLAN template and will be subject to a light-touch peer review. If you have any questions about what type of contributions that might be suitable, or anything else regarding submission or the workshop itself, please contact the organisers at: farm-2015 at easychair.org KEY DATES: Full Paper and Demo Abstract submission Deadline: 17 May Author Notification: 26 June Camera Ready: 19 July Workshop: 5 September SUBMISSION All papers and demo abstracts must be in portable document format (PDF), using the ACM SIGPLAN style guidelines. The text should be in a 9-point font in two columns. The submission itself will be via EasyChair: https://easychair.org/conferences/?conf=farm2015 PUBLICATION Accepted papers will be included in the formal proceedings published by ACM Press and will also be made available through the the ACM Digital Library; see http://authors.acm.org/main.cfm for information on the options available to authors. Authors are encouraged to submit auxiliary material for publication along with their paper (source code, data, videos, images, etc.); authors retain all rights to the auxiliary material. WORKSHOP ORGANISATION Workshop Chair: Henrik Nilsson, University of Nottingham Program Chair: David Janin, University of Bordeaux Publicity Chair: Samuel Aaron, University of Cambridge Program Committee: Samuel Aaron, University of Cambridge Jean Bresson, IRCAM Paris David Broman, KTH and UC Berkeley Paul Hudak, Yale University David Janin (chair), University of Bordeaux Anton Kholomiov, Orffeus instrumental ensemble Moscow Alex Mclean, University of Leeds Carin Meier, Outpace Systems Henrik Nilsson, University of Nottingham Yann Orlarey, GRAME Lyon Donya Quick, Yale University Shigeki Sagayama, Meiji University Chung-chieh Shan, Indiana University Michael Sperber, Active Group GmbH Bodil Stokke, FutureAdLabs For further details, see the FARM website: http://functional-art.org This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. -------------- next part -------------- A non-text attachment was scrubbed... Name: farm-cfp-2015.pdf Type: application/pdf Size: 67298 bytes Desc: not available URL: From compscience.announcement at gmail.com Thu Feb 19 16:31:38 2015 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Thu, 19 Feb 2015 08:31:38 -0800 Subject: [Haskell] NFM 2015 - CALL FOR PARTICIPATION Message-ID: NFM 2015CALL FOR PARTICIPATION The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 27 ? 29 April 2015 Pasadena, California, USA THEME The widespread use and increasing complexity of mission- and safety-critical systems require advanced techniques that address their specification, verification, validation, and certification. The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. The focus of the symposium is on formal methods, and aims to foster collaboration between NASA researchers and engineers and the wider aerospace and academic formal methods communities. TOPICS Topics of interest include, but are not limited to: - Model checking - Theorem proving - SAT and SMT solving - Symbolic execution - Static analysis - Runtime verification - Systematic testing - Program refinement - Compositional verification - Modeling and specification formalisms - Model-based development - Model-based testing - Requirement engineering - Formal approaches to fault tolerance - Security and intrusion detection - Applications of formal methods INVITED SPEAKERS Dino Distefano Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK. Viktor Kuncak Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland. Rob Manning Chief Engineer at NASA/JPL. LOCATION, COST, REGISTRATION AND HOTEL ROOM BOOKING The symposium will take place at the Hilton Hotel, Pasadena, California, USA, April 27-29, 2015. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to attend; however, all attendees must register (but please only register if you intend to attend). Registration form and hotel booking websites are reachable from the main website. A block of rooms at a low price are reserved with booking deadline of March 26. PC CHAIRS Klaus Havelund, NASA Jet Propulsion Laboratory, USA Gerard Holzmann, NASA Jet Propulsion Laboratory, USA Rajeev Joshi, NASA Jet Propulsion Laboratory, USA PUBLICITY SUPPORT Ylies Falcone, Universit? Joseph Fourier, France PROGRAMME COMMITTEE Erika Abraham, RWTH Aachen University, Germany Julia Badger, NASA Johnson Space Center, USA Christel Baier, Technische Universit?t Dresden, Germany Saddek Bensalem, VERIMAG/UJF, France Dirk Beyer, University of Passau, Germany Armin Biere, Johannes Kepler University, Austria Nikolaj Bjorner, Microsoft Research, USA Borzoo Bonakdarpour, McMaster University, Canada Alessandro Cimatti, Fondazione Bruno Kessler, Italy Leonardo de Moura, Microsoft Research, USA Ewen Denney, NASA Ames Research Center, USA Ben Di Vito, NASA Langley Research Center, USA Dawson Engler, Stanford University, USA Jean-Christophe Filliatre, Universit? Paris-Sud, France Dimitra Giannakopoulou, NASA Ames Research Center, USA Alwyn Goodloe, NASA Langley Research Center, USA Susanne Graf, VERIMAG, France Alex Groce, Oregon State University, USA Radu Grosu, Vienna University of Technology, Austria John Harrison, Intel Corporation, USA Mike Hinchey, University of Limerick/Lero, Ireland Bart Jacobs, University of Leuven, Belgium Sarfraz Khurshid, The University of Texas at Austin, USA Gerwin Klein, NICTA, Australia Daniel Kroening, Oxford University, UK Orna Kupferman, Hebrew University Jerusalem, Israel Kim Larsen, Aalborg University, Denmark Rustan Leino, Microsoft Research, USA Martin Leucker, University of Lubeck, Germany Rupak Majumdar, Max Planck Institute, Germany Pete Manolios, Northeastern University, USA Peter Mueller, ETH Zurich, Switzerland Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Doron Peled, Bar Ilan University, Israel Suzette Person, NASA Langley Research Center, USA Andreas Podelski, University of Freiburg, Germany Grigore Rosu, University of Illinois, USA Kristin Yvonne Rozier, NASA Ames Research Center, USA Natarajan Shankar, SRI International, USA Natasha Sharygina, University of Lugano, Switzerland Scott Smolka, Stony Brook University, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Mike Whalen, University of Minnesota, USA Jim Woodcock, University of York, UK STEERING COMMITTEE Julia Badger, NASA Johnson Space Center Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center Suzette Person, NASA Langley Research Center Kristin Yvonne Rozier, NASA Ames Research Center -------------- next part -------------- An HTML attachment was scrubbed... URL: From moreno.falaschi at uniud.it Sun Feb 22 12:13:14 2015 From: moreno.falaschi at uniud.it (Moreno Falaschi) Date: Sun, 22 Feb 2015 12:13:14 +0000 Subject: [Haskell] LOPSTR 2015: 2nd Call for Papers Message-ID: <0ADC775D-29E3-4383-B3E1-A7A18ADEB387@uniud.it> ============================================================ 25th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2015 Special Issue of Formal Aspects of Computing http://alpha.diism.unisi.it/lopstr15/ University of Siena, Siena, IT, July 13-15, 2015 (co-located with PPDP 2015) DEADLINES Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 25th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2015) will be held at the University of Siena, Siena, Italy; previous symposia were held in Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2015 will be co-located with PPDP 2015 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * synthesis * transformation * specialization * composition * optimization * inversion * specification * analysis and verification * testing and certification * program and model manipulation * transformational techniques in SE * applications and tools Survey papers that present some aspects of the above topics from a new perspective, and application papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Important Dates Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 Notification: May 25, 2015 Camera-ready (for electronic pre-proceedings): June 15, 2015 Symposium: July 13-15, 2015 Submission Guidelines Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Submissions cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via the Easychair submission website for LOPSTR 2015, which can be accessed through the website of LOPSTR 2015. Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Special journal issue After the symposium, a selection of the best papers will be invited to a special issue of the 'Formal Aspects of Computing' journal. The submissions to the special issue must be substantial extensions of the proceedings versions and will undergo the usual journal reviewing process. Invited speakers Patrick Cousot, New York University, USA (Jointly with PPDP) Gilles Barthe, IMDEA Software Institute, Spain Dale Miller, INRIA and LIX/Ecole Polytechnique, France Program Committee Slim Abdennadher, German University of Cairo, Egypt Maria Alpuente, Universitat Politecnica de Valencia, Spain Demis Ballis, University of Udine, Italy Olaf Chitil, University of Kent, UK Michael Codish, Ben-Gurion University, Israel Moreno Falaschi, University of Siena, Italy (Program Chair) Jerome Feret, INRIA and ENS, France Maurizio Gabbrielli, University of Bologna, Italy Jurgen Giesl, RWTH Aachen University, Germany Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain Arnaud Gotlieb, SIMULA Research Laboratory, Norway Gopal Gupta, University of Texas at Dallas, USA Manuel Hermenegildo, IMDEA, Spain Viktor Kuncak, EPFL Lausanne, Switzerland Luigi Liquori, INRIA Sophia-Antipolis Mediterranee, France Alexei Lisitsa, University of Liverpool, UK Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain Jorge Navas, NASA, USA Kazuhiro Ogata, JAIST, Japan Carlos Olarte, ECT, Univ. Federal do Rio Grande do Norte, Brasil Catuscia Palamidessi, INRIA and Ecole Polytechnique, France Maurizio Proietti, IASI-CNR, Italy Albert Rubio, Universitat Politecnica de Catalunya, Barcelona, Spain Wim Vanhoof, University of Namur, Belgium Program and Symposium Chair: Moreno Falaschi, Dept. of Information Engineering and Mathematics, Univ. of Siena, Italy (moreno.falaschi at unisi.it) Organizing Committee Monica Bianchini, DIISM, Univ. of Siena, Italy Sara Brunetti, DIISM, Univ. of Siena, Italy Andrea Machetti, DIISM, Univ. of Siena, Italy Simonetta Palmas, DIISM, Univ. of Siena, Italy Maurizio Proietti, IASI-CNR, Italy Simone Rinaldi, DIISM, Univ. of Siena, Italy Elisa Tiezzi, DIISM, Univ. of Siena, Italy Sara Ugolini, Dip. Informatica, Univ. of Pisa -------------- next part -------------- An HTML attachment was scrubbed... URL: From moreno.falaschi at uniud.it Sun Feb 22 12:16:37 2015 From: moreno.falaschi at uniud.it (Moreno Falaschi) Date: Sun, 22 Feb 2015 12:16:37 +0000 Subject: [Haskell] PPDP 2015: 2nd call for papers Message-ID: <4A56F524-9687-44AD-803B-63BECD41160B@uniud.it> ====================================================================== Call for papers 17th International Symposium on Principles and Practice of Declarative Programming PPDP 2015 Special Issue of Science of Computer Programming (SCP) Siena, Italy, July 14-16, 2015 (co-located with LOPSTR 2015) http://costa.ls.fi.upm.es/ppdp15 ====================================================================== SUBMISSION DEADLINE: 20 MARCH, 2015 PPDP 2015 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modeling in a declarative language and modeling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 25th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2015). The conference will be held in Siena, Italy. Previous symposia were held at Canterbury (UK), Madrid (Spain), Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). You might have a look at the contents of past PPDP symposia. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2016. Important Dates Abstract Submission: 14 March, 2015 Paper submission: 20 March, 2015 Notification: 14 May, 2015 Camera-ready: To be announced Symposium: 14-16 July, 2015 Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted to the submission website for PPDP 2015. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist the program committee in selecting appropriate reviewers for the paper. Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. -------------------------------------------------------------------------------------------------------------------------- INVITED SPEAKERS Patrick Cousot, New York University, USA (Jointly with LOPSTR) Martin Hofmann, LMU Munich, Germany ???????????????????????????????????????? Program Committee Michael Adams, University of Utah, USA Puri Arenas, Complutense University of Madrid, Spain Amir Ben-Amram, Tel-Aviv Academic College, Israel Ines Castro, Universidade do Porto, Portugal Patrick Cousot, New York University, USA Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Thom Fr?hwirth, University of Ulm, Germany Roberto Giacobazzi, University of Verona, Italy Michael Hanus, CAU Kiel, Germany Andy King, University of Kent, UK F. L?pez-Fraguas, Complutense University of Madrid, Spain Ian Mackie, University of Sussex, UK Dale Miller, INRIA and LIX/Ecole Polytechnique, France Torsten Schaub, University of Potsdam, Germany Tom Schrijvers KU Leuven, Belgium Frank D. Valencia, CNRS and LIX, Ecole Polytechnique, France German Vidal, Universitat Politecnica de Valencia, Spain Marina Vos, University of Bath, UK Nobuko Yoshida, Imperial College London, UK Program Chair Elvira Albert Complutense University of Madrid C/ Profesor Garcia Santesmases E-28040 Madrid, Spain Email: elvira at sip.ucm.es Symposium Chair Moreno Falaschi Department of information engineering and mathematics University of Siena, Italy Email: moreno.falaschi at unisi.it -------------- next part -------------- An HTML attachment was scrubbed... URL: From simonpj at microsoft.com Mon Feb 23 22:20:10 2015 From: simonpj at microsoft.com (Simon Peyton Jones) Date: Mon, 23 Feb 2015 22:20:10 +0000 Subject: [Haskell] GHC 7.10 will use Plan FTP Message-ID: <618BE556AADD624C9C918AA5D5911BEF7BEB3523@DB3PRD3001MB020.064d.mgd.msft.net> Colleagues You will remember (see this email) that the Haskell community has been engaged in a debate about proposed changes to the Haskell Prelude, the Plan-List or Plan-FTP debate. We decided to hold an open survey to get feedback from the community. Simon Marlow and Simon PJ were asked to make a decision in the light of that feedback. The survey closed on 21 Feb, so it's time to decide. Bottom line: we recommend Plan FTP. There are strong arguments in both directions. For the record, our own personal instincts were both in the conservative, Plan List direction. But the survey gave some pretty compelling feedback, and was far more unequivocal than we expected. Some details * Over 800 people participated in the survey. That's a lot for an 11-day window. Many wrote several paragraphs of supporting information. Thank you for participating so actively! * Overall, 82% of respondents were in favour of FTP, a 4:1 majority. Simon and I found this level of unanimity quite surprising - and it made our task much easier. We clearly under-estimated the Haskell community's appetite for absorbing change when they approve of the direction of travel. * Herbert helped us by doing a rough categorisation into hobbyist/non-hobbyist responses. o The first interesting fact is that there were a lot of non-hobbyist responses: in fact a majority (58%) of the responses were from non-hobbyists. So increasingly people are using Haskell for real work. o The support for Plan FTP among hobbyists was overwhelming (over 87%). But it was still very strong indeed among non-hobbyists (over 79%). Caveat: time was short, so the hobby/non-hobby categorisation is extremely approximate. But since the results are so unambiguous, even the crude results are helpful. * We tried filtering out responses that were blank in the name field and both text boxes. The 82% majority did not budge. What happens now * GHC 7.10 will embody Plan FTP. * The Core Libraries committee, freshly energised and informed by this episode, is drafting new guidelines to clarify what it does, and how it works; and to help avoid a repetition of the recent drama. * The responses. In the survey we said "We won't publish either textual responses or personally-identifying information without your consent. The full responses will be made available only to a limited few." However, the English-language comments are a remarkable snapshot of the Haskell community, and it would be a shame to discard them without deeper study. We propose to make them available to the Core Libraries Committee, to inform their future choices. If anyone else wants to digest the comments into a summary report, we think that would be a service to the community, and (in our view, provided they are a reputable person etc) would fall under the "available to a limited few" rubric. If that appeals to you, write to us. If you object even to such limited sharing, write to us too. This wasn't an entirely easy process, especially because it happened so late in the release cycle. But although many people felt quite strongly about List vs FTP, the whole debate has involved light rather than heat; people have concentrated on the technical issues, rather than yelling. Overall, it's been very encouraging to see the resilience, transparency, and constructive tone of the community. We really appreciate that - thank you. Simon Marlow and Simon Peyton Jones -------------- next part -------------- An HTML attachment was scrubbed... URL: From gershomb at gmail.com Mon Feb 23 22:55:06 2015 From: gershomb at gmail.com (Gershom B) Date: Mon, 23 Feb 2015 17:55:06 -0500 Subject: [Haskell] The Future of Community.Haskell.Org Message-ID: This message is intended to kick off a discussion on the state of the Community.Haskell.Org server and possible future plans. Included below is the text of a blog post on the infra blog ( https://blog.haskell.org/post/the_future_of_community_haskell_org/) We would especially like input and feedback from those who use or rely on any community.haskell.org services or accounts. We don't want to leave you in the lurch, and want to make sure that you feel your needs can be taken care of smoothly, even as we look to wind things down. Feedback is welcome via email (to admin at h.o) as a post on the blog, or via the reddit discussion ( http://www.reddit.com/r/haskell/comments/2wwc42/the_future_of_communityhaskellorg_request_for/ ) - - - Community.haskell.org is a server in our ecosystem that comparatively few know about these days. It actually was, to my knowledge, a key part of how the whole haskell.org community infrastructure got set up way back when. The sparse homepage still even says: "This server is run by a mysterious group of Haskell hackers who do not wish to be known as a Cabal, and is funded from money earned by haskell.org mentors in the Google Summer-of-Code programme." At a certain point after this server was created, it ceased to be run by a "mysterious group of Haskell hackers" and instead became managed officially by the haskell.org Committee that we know today. You can see the original announcement email in the archives . The community server, first set up in 2007 played a key role back before the current set of cloud-based services we know today was around. It provided a shared host which could provide many of the services a software project needs -- VCS hosting, public webspace for documentation, issue trackers, mailing lists, and soforth. Today, the server is somewhat of a relic of another time. People prefer to host projects in places like github, bitbucket, or darcs hub . Issue trackers likewise tend to be associated with these hosts, and there are other free, hosted issue trackers around as well. When folks want a mailing list, they tend to reach for google groups. Meanwhile, managing a big box full of shell account has become a much more difficult, riskier proposition. Every shell account is a security vulnerability waiting to happen, and there are more adversarial "scriptkiddie" hackers than ever looking to claim new boxes to spam and otherwise operate from. Managing a mailman installation is likewise more difficult. There are more spammers out there, with better methods, and unmaintained lists quickly can turn into ghost towns filled with pages of linkspam and nothing but. The same sad fate falls on unmaintained tracs. As a whole, the internet is a more adversarial world for small, self-hosted services, especially those whose domain names have some "google juice". We think it would be good to, to the extent possible, get out of the business of doing this sort of hosting. And indeed, very few individuals tend to request accounts, since there are now so many nicer, better ways of getting the benefits that community.haskell.org once was rare in providing. So what next? Well, we want to "end of life" most of community.haskell.org, but in as painless a way as possible. This means finding what few tracs, if any, are still active, and helping their owners migrate. Similarly for mailing lists. Of course we will find a way to continue to host their archives for historical purposes. Similarly, we will attempt to keep source repositories accessible for historical purposes, but would very much like to encourage owners to move to more well supported code hosting. One purpose that, until recently, was hard to serve elsewhere was in hosting of private darcs repositories with shared access -- such as academics might use to collaborate on a work in project. However, that capability is now also provided on http://hub.darcs.net. At this point, we can't think of anything in this regard that is not better provided elsewhere -- but if you can, please let us know. On webspace, it may be the case that a little more leniency is in order. For one, it is possible to provide restricted accounts that are able to control web-accessible files but have no other rights. For another, while many open source projects now host documentation through github pages or similar, and there are likewise many services for personal home pages, nonetheless it seems a nice thing to allow projects to host their resources on a system that is not under the control of a for-profit third party that, ultimately is responsible to its bottom line and not its users. But all this is open for discussion! Community.haskell.org was put together to serve the open source community of Haskell developers, and its direction needs to be determined based on feedback regarding current needs. What do you think? What would you like to see continued to be provided? What do you feel is less important? Are there other good hosted services that should be mentioned as alternatives? And, of course, are you interested in rolling up your sleeves to help with any of the changes discussed? This could mean simply helping out with sorting out the mailman and trac situation, inventorying the active elements and collaborating with their owners. Or, it could mean a more sustained technical involvement. Whatever you have to offer, we will likely have a use for it. As always, you can emailadmin at h.o or hop on the #haskell-infrastructure freenode channel to get involved directly. Cheers, Gershom -------------- next part -------------- An HTML attachment was scrubbed... URL: From innovative.engineer at gmail.com Tue Feb 24 01:04:55 2015 From: innovative.engineer at gmail.com (Michael Gough) Date: Mon, 23 Feb 2015 17:04:55 -0800 Subject: [Haskell] NFM 2015 - CALL FOR PARTICIPATION In-Reply-To: References: Message-ID: I registered for NFM 2015 and didn't receive any confirmation email. Does anyone know anything about this? http://www.NASAFormalMethods.org/nfm2015 On Thu, Feb 19, 2015 at 8:31 AM, Klaus Havelund < compscience.announcement at gmail.com> wrote: > > > NFM 2015CALL FOR PARTICIPATION > > The 7th NASA Formal Methods Symposium > > http://www.NASAFormalMethods.org/nfm2015 > > 27 ? 29 April 2015 > Pasadena, California, USA > THEME > > The widespread use and increasing complexity of mission- and > safety-critical systems require advanced techniques that address their > specification, verification, validation, and certification. The NASA Formal > Methods Symposium is a forum for theoreticians and practitioners from > academia, industry, and government, with the goals of identifying > challenges and providing solutions to achieving assurance in mission- and > safety-critical systems. The focus of the symposium is on formal methods, > and aims to foster collaboration between NASA researchers and engineers and > the wider aerospace and academic formal methods communities. > TOPICS > > Topics of interest include, but are not limited to: > > - Model checking > - Theorem proving > - SAT and SMT solving > - Symbolic execution > - Static analysis > - Runtime verification > - Systematic testing > - Program refinement > - Compositional verification > - Modeling and specification formalisms > - Model-based development > - Model-based testing > - Requirement engineering > - Formal approaches to fault tolerance > - Security and intrusion detection > - Applications of formal methods > > INVITED SPEAKERS > > Dino Distefano > Software Engineer at Facebook, California, USA and Professor at Queen Mary > University of London, UK. > > Viktor Kuncak > Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, > Switzerland. > > Rob Manning > Chief Engineer at NASA/JPL. > LOCATION, COST, REGISTRATION AND HOTEL ROOM BOOKING > > The symposium will take place at the Hilton Hotel, Pasadena, California, > USA, April 27-29, 2015. > > There will be no registration fee for participants. > > All interested individuals, including non-US citizens, are welcome to > attend; however, all attendees must register (but please only register if > you intend to attend). Registration form and hotel booking websites are > reachable from the main website. A block of rooms at a low price are > reserved with booking deadline of March 26. > PC CHAIRS > > Klaus Havelund, NASA Jet Propulsion Laboratory, USA > Gerard Holzmann, NASA Jet Propulsion Laboratory, USA > Rajeev Joshi, NASA Jet Propulsion Laboratory, USA > PUBLICITY SUPPORT > > Ylies Falcone, Universit? Joseph Fourier, France > PROGRAMME COMMITTEE > > Erika Abraham, RWTH Aachen University, Germany > Julia Badger, NASA Johnson Space Center, USA > Christel Baier, Technische Universit?t Dresden, Germany > Saddek Bensalem, VERIMAG/UJF, France > Dirk Beyer, University of Passau, Germany > Armin Biere, Johannes Kepler University, Austria > Nikolaj Bjorner, Microsoft Research, USA > Borzoo Bonakdarpour, McMaster University, Canada > Alessandro Cimatti, Fondazione Bruno Kessler, Italy > Leonardo de Moura, Microsoft Research, USA > Ewen Denney, NASA Ames Research Center, USA > Ben Di Vito, NASA Langley Research Center, USA > Dawson Engler, Stanford University, USA > Jean-Christophe Filliatre, Universit? Paris-Sud, France > Dimitra Giannakopoulou, NASA Ames Research Center, USA > Alwyn Goodloe, NASA Langley Research Center, USA > Susanne Graf, VERIMAG, France > Alex Groce, Oregon State University, USA > Radu Grosu, Vienna University of Technology, Austria > John Harrison, Intel Corporation, USA > Mike Hinchey, University of Limerick/Lero, Ireland > Bart Jacobs, University of Leuven, Belgium > Sarfraz Khurshid, The University of Texas at Austin, USA > Gerwin Klein, NICTA, Australia > Daniel Kroening, Oxford University, UK > Orna Kupferman, Hebrew University Jerusalem, Israel > Kim Larsen, Aalborg University, Denmark > Rustan Leino, Microsoft Research, USA > Martin Leucker, University of Lubeck, Germany > Rupak Majumdar, Max Planck Institute, Germany > Pete Manolios, Northeastern University, USA > Peter Mueller, ETH Zurich, Switzerland > Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA > Corina Pasareanu, NASA Ames Research Center, USA > Doron Peled, Bar Ilan University, Israel > Suzette Person, NASA Langley Research Center, USA > Andreas Podelski, University of Freiburg, Germany > Grigore Rosu, University of Illinois, USA > Kristin Yvonne Rozier, NASA Ames Research Center, USA > Natarajan Shankar, SRI International, USA > Natasha Sharygina, University of Lugano, Switzerland > Scott Smolka, Stony Brook University, USA > Willem Visser, University of Stellenbosch, South Africa > Mahesh Viswanathan, University of Illinois, USA > Mike Whalen, University of Minnesota, USA > Jim Woodcock, University of York, UK > STEERING COMMITTEE > > Julia Badger, NASA Johnson Space Center > Ewen Denney, NASA Ames Research Center > Ben Di Vito, NASA Langley Research Center > Klaus Havelund, NASA Jet Propulsion Laboratory > Gerard Holzmann, NASA Jet Propulsion Laboratory > Cesar Munoz, NASA Langley Research Center > Corina Pasareanu, NASA Ames Research Center > Suzette Person, NASA Langley Research Center > Kristin Yvonne Rozier, NASA Ames Research Center > > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Tue Feb 24 09:06:46 2015 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 24 Feb 2015 09:06:46 +0000 Subject: [Haskell] 7 PhD studentships in Nottingham Message-ID: Dear all, The School of Computer Science in Nottingham is advertising 7 fully-funded PhD studentships for "home" students (or EU students who have been ordinarily resident in the UK for 3 years prior to the start of the programme). Applicants in the area of the Functional Programming lab (fp.cs.nott.ac.uk) are encouraged! If you are interested in applying, please contact a potential supervisor in the FP lab prior to submitting your application: Venanzio Capretta - type theory, mathematical logic, corecursive structures, proof assistants, dependently-typed programming. Henrik Nilsson - functional reactive programming, modelling and simulation, domain-specific languages, probabilistic languages. Thorsten Altenkirch and Graham Hutton - not planning to take on any further new PhD students this year. Best wishes, Graham +-----------------------------------------------------------+ 7 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI1433 Applications are invited for up to 7 fully-funded PhD studentships for "home" students (or EU students who have been ordinarily resident in the UK for 3 years prior to the start of the programme) in the School of Computer Science at the University of Nottingham, starting on 1st October 2015. The topics for the studentships are open, but should relate to the interests of one of the School's research groups: Agents Lab; Automated Scheduling, Optimisation and Planning; Computer Vision Lab; Functional Programming Lab; Intelligent Modelling and Analysis; Mixed Reality Lab; Networked Systems. The studentships are for three years, include a stipend of ??13,863 per year and tuition fees, and are available to students who qualify as "home" applicants in terms of their fee status. Applicants are normally expected to have a first-class Masters or Bachelors degree in Computer Science or a related discipline, and must obtain the support of a potential supervisor in the School prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. Applications should be submitted via the postgraduate applications website: http://www.nottingham.ac.uk/pgstudy/apply/apply-online.aspx. As part of your personal statement, please include an outline research proposal (max 1 page). Informal enquiries may be addressed to Christine.Fletcher at nottingham.ac.uk. Closing date for applications: Tuesday 31st March 2015 +-----------------------------------------------------------+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From tarmo at cs.ioc.ee Wed Feb 25 18:47:49 2015 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Wed, 25 Feb 2015 20:47:49 +0200 Subject: [Haskell] ETAPS 2016 call for satellite events Message-ID: <20150225204749.086081d1@duality> 19th European Joint Conferences on Theory and Practice of Software ETAPS 2016 Eindhoven, The Netherlands, April 2-8, 2016 http://www.etaps.org/2016/ Call for Satellite Events -- ABOUT ETAPS -- The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS is an annual event which takes place in Europe each spring since 1998. The nineteenth conference, ETAPS 2016, will take place April 2-8, 2016 in Eindhoven, The Netherlands. ETAPS main conferences will take place on April 4-7, 2016. They are: + ESOP: European Symposium on Programming, + FASE: Fundamental Approaches to Software Engineering, + FOSSACS: Foundations of Software Science and Computation Structures, + POST: Principles of Security and Trust, + TACAS: Tools and Algorithms for the Construction and Analysis of Systems. -- SATELLITE EVENTS -- The ETAPS 2016 organizing committee invites proposals for satellite events (workshops etc.) that will complement the main conferences. They should fall within the scope of ETAPS. This encompasses all aspects of the system development process, including specification, design, implementation, analysis and improvement, as well as the languages, methodologies and tools which support these activities, covering a spectrum from practically-motivated theory to soundly-based practice. Satellite events provide an opportunity to discuss and report on emerging research approaches and practical experience relevant to theory and practice of software. ETAPS 2016 satellite events will be held immediately before and after the main conferences, on April 2-3 and April 8, 2016. -- ARRANGEMENTS FOR SATELLITE EVENTS -- The organizers of an ETAPS 2016 satellite are expected to: + create and maintain a website for the event, + form a PC, produce a call for papers for the event (if appropriate), + advertise the event through specialist mailing lists etc. to complement the publicity of ETAPS, + review the submissions received and make acceptance decisions, + prepare an informal (pre)proceedings for the event (if appropriate), + prepare the event's program complying with any scheduling constraints defined by the ETAPS 2016 organizing committee, + prepare and organize the publication of a formal (post-)proceedings (if desired). The ETAPS 2016 organizing committee will: + promote the event on the website and in the publicity material of ETAPS 2016, + integrate the event's program into the overall program of the conference, + arrange registration for the event as a component of registration for ETAPS, collect a participation fee from the registrants, + produce a compilation USB memory stick of the informal (pre-) proceedings of the satellite events of ETAPS 2016 and distribute this to the registrants, + provide the event with a meeting room of an appropriate size, A/V equipment, coffee breaks and possibly lunch(es). As a rule, ETAPS will not contribute toward the travel or accommodation costs of invited speakers or organizers of satellite events. -- SUBMISSION OF SATELLITE EVENT PROPOSALS -- Researchers and practitioners wishing to organize satellite events are invited to submit proposals to the workshop co-chairs Julien Schmaltz and Erik de Vink using this web form. A proposal should not exceed two pages and should include: + the name and acronym of the satellite event, + the names and contact information of the organizers, + the duration of the event: one or two days, + the preferred period: April 2, April 3, April 8 or April 2-3, + the expected number of participants, + a brief description (120 words approximately) of the event topic for the website and publicity material of ETAPS 2016, + a brief explanation of the event topic and its relevance to ETAPS, + an explanation of the selection procedure of contributions to the event, the PC chair and members, if known already, information about past editions of the event, if applicable, + any other relevant information, like a special event format, invited speakers, demo sessions, special space requirements, etc., + a tentative schedule for paper submission, notification of acceptance and final versions for the (informal pre-)proceedings (the ETAPS 2016 organizing committee will need the final files by March 12, 2016), + the plans for formal publication (no formal publication, formal proceedings ready by the event, formal post-proceedings, publication venue - EPTCS or elsewhere). The proposals will be evaluated by the ETAPS 2016 organizing committee on the basis of their assessed benefit for prospective participants of ETAPS 2016. Prospective organizers may wish to consult the web pages of previous satellite events as examples: ETAPS 2015: http://www.etaps.org/2015/workshops ETAPS 2014: http://www.etaps.org/2014/workshops ETAPS 2013: http://www.etaps.org/2013/workshops ETAPS 2012: http://www.etaps.org/2012/workshops -- IMPORTANT DATES -- Satellite event proposals deadline: March 29, 2015. Notification of acceptance: April 2, 2015. -- VENUE -- ETAPS 2016 will take place at the Campus of the Eindhoven University of Technology. Eindhoven, located in the south of the Netherlands, has a small international airport, Eindhoven Airport, with direct connections to various destinations in Europe. The main airport of the Netherlands is the Amsterdam Airport, Schiphol. Schiphol has a direct train connection to Eindhoven. -- FURTHER INFORMATION AND ENQUIRIES -- Please contact the workshop co-chairs, Julien Schmaltz, j.schmaltz at tue.nl, and Erik de Vink, e.p.d.vink at tue.nl. From pardo at fing.edu.uy Wed Feb 25 22:51:27 2015 From: pardo at fing.edu.uy (Alberto Pardo) Date: Wed, 25 Feb 2015 20:51:27 -0200 Subject: [Haskell] CFP - SBLP 2015: 19th Brazilian Symposium on Programming Languages Message-ID: CALL FOR PAPERS - SBLP 2015 19th Brazilian Symposium on Programming Languages 21-26 September 2015 Belo Horizonte, Brazil http://cbsoft.org/sblp2015 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES Abstract submission: 20 April, 2015 Paper submission: 27 April, 2015 Author notification: 18 June, 2015 Camera ready deadline: 2 July 2015 INTRODUCTION The Brazilian Symposium on Programming Languages is a well-established symposium which provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. SBLP 2015 is part of 6th Brazilian Conference on Software: Theory and Practice, CBSoft 2015, that will be held in Belo Horizonte, Minas Gerais, Brazil, from September 21st to September 26th, 2015. Authors are invited to submit original research on any relevant topic which can be either in the form of regular or short papers. TOPICS Topics of interest include, but are 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. INVITED SPEAKERS * Doaitse Swierstra, Utrecht University * TBA SUBMISSION AND PUBLICATION All submissions will be peer-reviewed and judged on the basis of its originality, contribution to the field, technical and presentation quality, and relevance to the symposium. Contributions should be written in Portuguese or English. Papers should fall into one of two different categories: regular papers, which can be up to 15 pages long in LNCS format, or short papers, with up to 5 pages in LNCS format. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. We encourage the submission of short papers reporting partial results of on-going master dissertations or doctoral theses. Accepted papers written in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer. Both regular and short papers must be prepared using the LNCS format, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. Papers must be submitted electronically (in PDF format) via the Easychair System: http://www.easychair.org/conferences/?conf=sblp2015. As in previous editions, after the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a journal special issue. Since 2009, selected papers of each SBPL edition are being published in a special issue of Science of Computer Programming, by Elsevier. PROGRAM CHAIRS Alberto Pardo, Universidad de la Rep?blica, Uruguay Doaitse Swierstra, Utrecht University, The Netherlands PROGRAM COMMITTEE Alberto Pardo, Universidad de la Rep?blica (co-chair) Alex Garcia, IME Alvaro Moreira, Federal University of Rio Grande do Sul Andre Rauber Du Bois, Federal University of Pelotas Carlos Camar?o, Federal University of Minas Gerais Christiano Braga, Fluminense Federal University Doaitse Swierstra, Utrecht University (co-chair) Fabio Mascarenhas, Federal University of Rio de Janeiro Fernando Pereira, Federal University of Minas Gerais Fernando Castor, Federal University of Pernambuco Francisco Carvalho-Junior, Federal University of Ceara Hans-Wolfgang Loidl, Heriot-Watt University Jo?o Saraiva, University of Minho Jo?o F. Ferreira, Teesside University Louis-Noel Pouchet, University of California, Los Angeles Lucilia Figueiredo, Federal University of Ouro Preto Luis Barbosa, University of Minho Manuel A. Martins, University of Aveiro Marcelo Maia, Federal University of Uberl?ndia Marcelo D'Amorim, Federal University of Pernambuco Mariza Bigonha, Federal University of Minas Gerais Martin Musicante, Federal University of Rio Grande do Norte Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Rafael Lins, Federal University of Pernambuco Renato Cerqueira, PUC-Rio Roberto Bigonha, Federal University of Minas Gerais Roberto Ierusalimschy PUC-Rio Rodrigo Geraldo, Federal University of Ouro Preto Sandro Rigo, State University of Campinas S?rgio Medeiros, Federal University of Rio Grande do Norte Simon Thompson, University of Kent Varmo Vene, University of Tartu Zongyan Qiu Peking University -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Fri Feb 27 17:33:36 2015 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Fri, 27 Feb 2015 19:33:36 +0200 Subject: [Haskell] TYPES 2015 final call for contributions Message-ID: <20150227193336.67a0b617@duality> [Selection of talks based on abstracts (2 pp easychair.cls) due 13 March 2015! A post-proceedings volume in LIPIcs, with an open call.] CALL FOR CONTRIBUTIONS 21st International Conference on Types for Proofs and Programs, TYPES 2015 Tallinn, Estonia, 18-21 May 2015 http://cs.ioc.ee/types15/ Background The TYPES meetings are a forum to present new and on-going work in all aspects of type theory and its applications, especially in formalized and computer assisted reasoning and computer programming. The meetings from 1990 to 2008 were annual workshops of a sequence of five EU funded networking projects. Since 2009, TYPES has been run as an independent conference series. Previous TYPES meetings were held in Antibes (1990), Edinburgh (1991), B?stad (1992), Nijmegen (1993), B?stad (1994), Torino (1995), Aussois (1996), Kloster Irsee (1998), L?keberg (1999), Durham (2000), Berg en Dal near Nijmegen (2002), Torino (2003), Jouy en Josas near Paris (2004), Nottingham (2006), Cividale del Friuli (2007), Torino (2008), Aussois (2009), Warsaw (2010), Bergen (2011), Toulouse (2013), Paris (2014). The TYPES areas of interest include, but are not limited to: foundations of type theory and constructive mathematics; applications of type theory; dependently typed programming; industrial uses of type theory technology; meta-theoretic studies of type systems; proof assistants and proof technology; automation in computer-assisted reasoning; links between type theory and functional programming; formalizing mathematics using type theory. We encourage talks proposing new ways of applying type theory. Invited speakers Gilles Barthe (IMDEA Software) Andrej Bauer (University of Ljubljana) Peter Selinger (Dalhousie University) Tutorials Joachim Kock (Universitat Aut?noma de Barcelona) Peter LeFanu Lumsdaine (Stockholm University) Contributed talks We solicit contributed talks. Selection of those will be based on extended abstracts/short papers of 2 pp formatted with easychair.cls. Submission is via EasyChair by 13 March 2015. The authors will be notified of acceptance/rejection by 3 April 2015. Camera-ready versions of the accepted contributions, due by 24 April 2015, will be published in an informal book of abstracts for distribution at the workshop. Post-proceedings Similarly to TYPES 2011, 2013, 2014, we will publish a post-proceedings in the Leibniz International Proceedings in Informatics (LIPIcs) series. Submission to that volume will be open for everyone. Tentative submission deadline: mid-September 2015. Programme committee Andrea Asperti (Universit? di Bologna) Robert Atkey (University of Edinburgh) Ulrich Berger (Swansea University) Jean-Philippe Bernardy (Chalmers University of Technology) Edwin Brady (University of St Andrews) Jo?lle Despeyroux (INRIA Sophia Antipolis - M?diterran?e) Herman Geuvers (Radboud Universiteit Nijmegen) Sam Lindley (University of Edinburgh) Assia Mahboubi (INRIA Saclay - ?le-de-France) Ralph Matthes (IRIT, CNRS and Universit? Paul Sabatier) Aleksandar Nanevski (IMDEA Software) Christine Paulin-Mohring (LRI, Universit? Paris-Sud) Simona Ronchi Della Rocca (Universit? di Torino) Ulrich Sch?pp (Ludwig-Maximilians-Universit?t M?nchen) Bas Spitters (Carnegie Mellon University) Pawel Urzyczyn (University of Warsaw) Tarmo Uustalu (Institute of Cybernetics, Tallinn) (chair) Organizers Logic and semantics group, Institute of Cybernetics, Tallinn Sponsors ERDF via EXCS, the Estonian Centre of Excellence in Computer Science From andreas.abel at ifi.lmu.de Fri Feb 27 18:57:58 2015 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Fri, 27 Feb 2015 19:57:58 +0100 Subject: [Haskell] PhD position in dependent types/functional programming at Chalmers Message-ID: <54F0BE36.50609@ifi.lmu.de> We have an opening for a PhD student in dependent type theory and functional programming at Chalmers. Here is an excerpt from the ad: "The PhD student will join the Programming Logic group and contribute to its research on dependent type theory and functional programming. Topics of interest include the following directions of work: - Design of dependently typed functional programming languages. - Theory and implementation of type checkers, compilers etc. for dependently typed functional programming languages. - Investigations into the use of dependently typed functional programming languages, both as programming languages and as logical systems. - Models and applications of (homotopy) type theory." Note that work on and in Agda matches several of the topics above. Full text of the advertisement: http://www.chalmers.se/en/about-chalmers/vacancies/?rmpage=job&rmjob=2902 Application deadline: March 31, 2015 -- Andreas Abel <>< Du bist der geliebte Mensch. Department of Computer Science and Engineering Chalmers and Gothenburg University, Sweden andreas.abel at gu.se http://www2.tcs.ifi.lmu.de/~abel/ From frantisek at farka.eu Sat Feb 28 16:05:33 2015 From: frantisek at farka.eu (Frantisek Farka) Date: Sat, 28 Feb 2015 16:05:33 +0000 Subject: [Haskell] Haskell Wiki broken links Message-ID: <20150228160533.6dc6891c@farka.eu> Hi all, I have found out that new haskell.org site and migration of Haskell wiki to wiki.haskell.org did broke some of the old links, e. g.: http://www.haskell.org/haskellwiki/index.php?title=Functor-Applicative-Monad_Proposal&oldid=58553 is redirecting simply to https://wiki.haskell.org/Haskell whereas the proper page still exists: https://wiki.haskell.org/index.php?title=Functor-Applicative-Monad_Proposal&oldid=58553 Can anyone fix the server configuration? Best wishes, Franta