From kutsia at risc.jku.at Mon Sep 1 13:27:18 2014 From: kutsia at risc.jku.at (Temur Kutsia) Date: Mon, 01 Sep 2014 15:27:18 +0200 Subject: [Haskell] SCSS 2014: Call for short and work-in-progress papers Message-ID: <54047436.9090903@risc.jku.at> [Please post - apologies for multiple copies.] CALL FOR SHORT AND WORK-IN-PROGRESS PAPERS ================================================ SCSS 2014 Symbolic Computation in Software Science 6th International Symposium Gammarth, La Marsa, Tunisia, December 7-11, 2014 http://www.easychair.org/smart-program/SCSS2014/ ================================================ Scope -------- The purpose of SCSS 2014 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Submission ---------- Researchers and practitioners are invited to submit short papers, reports on interesting work in progress or system descriptions. They need not be original. Concurrent submission to another conference or a journal is allowed. The papers are limited in length to 5 pages in the EasyChair format. Submission page: https://www.easychair.org/conferences/?conf=scss2014 Important Dates --------------- September 29, 2014: Submission deadline October 3, 2014: Notification December 7-11, 2014: SCSS 2014 in Gammarth Invited Speakers ---------------- Nikolaj Bjorner (Microsoft Research) William M. Farmer (McMaster University) Program Chairs -------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Andrei Voronkov (University of Manchester, UK) Program Committee ------------------ Elvira Albert (Complutense University of Madrid, Spain) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) James H. Davenport (University of Bath, UK) Roberto Giacobazzi (University of Verona, Italy) Arie Gurfinkel (Carnegie Mellon University, USA) Nao Hirokawa (JAIST, Japan) Tetsuo Ida (University of Tsukuba, Japan) Florent Jacquemard (INRIA - IRCAM, France) Laura Kovacs (Chalmers University of Technology, Sweden) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) - chair Ali Mili (New Jersey Institute of Technology, USA) Joel Ouaknine (Oxford University, UK) Ruzica Piskac (Yale University, USA) Andrei Voronkov (University of Manchester, UK) - chair Dongming Wang (Beihang University, China and UPMC-CNRS, France) General Chairs --------------- Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Tetsuo Ida (University of Tsukuba, Japan) Local Chair ----------- Mohamed Becha Kaaniche (University of Carthage, Tunisia) From liyuanfang at gmail.com Tue Sep 2 04:23:46 2014 From: liyuanfang at gmail.com (liyuanfang at gmail.com) Date: Mon, 01 Sep 2014 21:23:46 -0700 (PDT) Subject: [Haskell] CFP: PRDC2014 Call for Participation Message-ID: <54054652.298b440a.44dd.60e0@mx.google.com> PRDC 2014 Call for Participation School of Computing, National University of Singapore, Singapore Nov. 19-21,2014 http://prdc.dependability.org/PRDC2014/index.html --------------------------------- Call for Participation http://prdc.dependability.org/PRDC2014/program.html --------------------------------- PRDC 2014 is the twentieth in this series of symposia started in 1989 that are devoted to dependable and fault-tolerant computing. PRDC is recognized as the main event in the Pacific area that covers the many dimensions of dependability and fault tolerance, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated into all aspects of daily life, the dependability of computing systems has become increasingly critical. This symposium provides a forum for countries around the Pacific Rim and other areas of the world to exchange ideas for improving the dependability of computing systems. Topics of interest include (but not limited to): * Software and hardware reliability, testing, verification, and validation * Dependability measurement, modeling, evaluation, and tools * Self-healing, self-protecting, and fault-tolerant systems * Software aging and rejuvenation * Safety-critical systems and software * Architecture and system design for dependability * Fault-tolerant algorithms and protocols * Reliability in cloud computing, Internet, and web systems and applications * Cloud and Internet Information security * Dependability issues in computer networks and communications * Dependability issues in distributed and parallel systems * Dependability issues in real-time systems, database, and transaction processing systems * Dependability issues in autonomic computing * Dependability issues in aerospace and embedded systems The program of PRDC 2014 can be found at http://prdc.dependability.org/PRDC2014/program.html. Registration information can be found at http://prdc.dependability.org/PRDC2014/registration.html. ## National University of Singapore ## A leading global university centered in Asia, the National University of Singapore (NUS) offers a global approach to education and research, with a focus on Asian perspectives and expertise. Over 36,000 students from 100 countries further enrich the community with their diverse social and cultural perspectives, making campus life vibrant and exciting. NUS has a strong and growing reputation for impactful research with numerous productive collaborations with research organizations and industry in Singapore and around the world. The Department of Computer Science, with over 80 faculty members, had a long track record in grooming leaders for the digital economy and IT workforce. The Computer Science department has more than 350 PH.D students where strong teams of more than 20 students are doing research in Formal Method area. The departments' internationally recognized faculty members perform research in various areas. ## Singapore ## Singapore (also called the Lion City), is a Southeast Asian city-state off the southern tip of the Malay Peninsula, 137 kilometres (85 mi) north of the equator. An island country made up of 63 islands, it is separated from Malaysia by the Straits of Johor to its north and from Indonesia's Riau Islands by the Singapore Strait to its south. Singapore is highly urbanized but almost half of the country is covered by greenery. More land is being created for development through land reclamation. The Lion City is a modern metropolis with one of the world's busiest ports and a world-class airport. At the same time, the small tropical island has retained many elements of its colonial past. From publicityifl at gmail.com Tue Sep 2 07:23:27 2014 From: publicityifl at gmail.com (publicityifl at gmail.com) Date: Tue, 02 Sep 2014 00:23:27 -0700 (PDT) Subject: [Haskell] Third call for papers, IFL 2014 Message-ID: <5405706f.2369b40a.7eb4.ffff9773@mx.google.com> Hello, Please, find below the third call for papers for IFL 2014. The submission page is now open. The submission date has been delayed to Sep. 8 2014 anywhere on the world. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage --- CALL FOR PAPERS 26th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES - IFL 2014 NORTHEASTERN UNIVERSITY/BOSTON, USA OCTOBER 1-3, 2014 http://ifl2014.github.io We are pleased to announce that the 26th edition of the IFL series will be held at Northeastern University in Boston, USA. The symposium will be held from 1st to 3rd of October 2014. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2014 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2014 will use a post-symposium review process to produce the formal proceedings. All participants of IFL 2014 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/Resources/Policies/Republication The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. Hence, publications that appear only in the draft proceedings do not count as publication for the ACM SIGPLAN republication policy. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Submission Details ------------------ Submission deadline draft papers: September 8 Notification of acceptance for presentation: September 10 Early registration deadline: September 11 Late registration deadline: September 17 Submission deadline for pre-symposium proceedings: September 24 26th IFL Symposium: October 1-3 Submission deadline for post-symposium proceedings: December 15 Notification of acceptance for post-symposium proceedings: January 31 2015 Camera-ready version for post-symposium proceedings: March 15 2015 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English. Papers must adhere to the standard ACM two columns conference format. For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages. For the post-symposium proceedings the page limit of 12 pages is firm. A suitable document template for LaTeX can be found at: http://www.acm.org/sigs/sigplan/authorInformation.htm Papers should be submitted online at https://easychair.org/conferences/?conf=ifl2014 Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools in the context of functional programming. If you are not sure whether your work is appropriate for IFL 2014, please contact the PC chair at samth at cs.indiana.edu. Topics of interest include, but are not limited to: ??? language concepts ??? type systems, type checking, type inferencing ??? compilation techniques ??? staged compilation ??? run-time function specialization ??? run-time code generation ??? partial evaluation ??? (abstract) interpretation ??? metaprogramming ??? generic programming ??? automatic program generation ??? array processing ??? concurrent/parallel programming ??? concurrent/parallel program execution ??? embedded systems ??? web applications ??? (embedded) domain specific languages ??? security ??? novel memory management techniques ??? run-time profiling performance measurements ??? debugging and tracing ??? virtual/abstract machine architectures ??? validation, verification of functional programs ??? tools and programming techniques ??? (industrial) applications Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Sam Tobin-Hochstadt, Indiana University (Chair) Rinus Plasmeijer, Radboud University Nijmegen (Co-Chair) Atze Dijkstra, Utrecht University Colin Runciman, University of York Graham Hutton, University of Nottingham Mary Sheeran, Chalmers University of Technology Patricia Johann, Appalachian State University Matthew Fluet, Rochester Institute of Technology Josef Svenningsson, Chalmers University of Technology Ma??gorzata Biernacka, University of Wroclaw Peter Achten, Radboud Univerity Nijmegen Laura Castro, University of A Coru??a Hai Paul Liu, Intel Labs Kathryn Gray, Cambridge University Lars Bergstrom, Mozilla Research Lindsey Kuper, Indiana University Nicolas Wu, Oxford T. Stephen Strickland, University of Maryland Xavier Clerc, INRIA Venue ----- The 26th IFL will be held in association with the College of Computer and Information Science at Northeastern University. It can be reached quickly and easily by public transport. From tarmo at cs.ioc.ee Tue Sep 2 10:32:09 2014 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 2 Sep 2014 13:32:09 +0300 (EEST) Subject: [Haskell] ETAPS 2015 2nd call for papers Message-ID: ****************************************************************** CALL FOR PAPERS: ETAPS 2015 18th European Joint Conferences on Theory And Practice of Software London, UK, 11-18 April 2015 http://www.etaps.org/2015 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences, accompanied by satellite workshops. ETAPS 2015 is the eighteenth event in the series. -- MAIN CONFERENCES (13-17 April) -- * CC: Compiler Construction (PC chair Bj?rn Franke, University of Edinburgh, UK) * ESOP: European Symposium on Programming (PC chair Jan Vitek, Northeastern University, USA) * FASE: Fundamental Approaches to Software Engineering (PC chairs Alexander Egyed, Johannes Kepler U Linz, Austria, and Ina Schaefer, Technische Universit?t Braunschweig, Germany) * FOSSACS: Foundations of Software Science and Computation Structures (PC chair Andrew Pitts, University of Cambridge, UK) * POST: Principles of Security and Trust (PC chairs Riccardo Focardi, Universit? Ca' Foscari Venezia, Italy, and Andrew Myers, Cornell University, USA) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Christel Baier, Technische Univ Dresden, Germany, and Cesare Tinelli, The University of Iowa, USA) TACAS '15 will host the 4rd Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Robert Harper (Carnegie Mellon 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 Universitet, Sweden) -- IMPORTANT DATES -- * 10 October 2014: Submission deadline for abstracts * 17 October 2014: Submission deadline for full papers * 3-5 December 2014: Author response period (ESOP and FoSSaCS only) * 19 December 2014: Notification of acceptance * 16 January 2015: Camera-ready versions due -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. TACAS has more paper categories (see http://www.etaps.org/2015/tacas). A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference (HotCRP for ESOP). Submissions not adhering to the specified format and length may be rejected immediately. - Research papers FASE, FOSSACS and TACAS have a page limit of 15 pages for research papers, whereas CC, POST allow at most 20 pages and ESOP 25 pages. Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pages). Both TACAS and FASE solicit also regular tool papers (at most 15 pages). - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) ESOP and FOSSACS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (11-12 April, 18 April) -- Around 20 satellite workshops will take place before and after the main conferences. -- HOST CITY -- London, the capital city of England and the UK, 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 is one of the world's leading financial centers and a world cultural capital. It is the world's most-visited city as measured by international arrivals and has the world's largest city airport system measured by passenger traffic. In 2012, London became the first city to host the modern Summer Olympic Games three times. -- HOST INSTITUTION -- ETAPS 2015 is hosted by the School of Electrical Engineering and Computer Science of the Queen Mary University of London. The main campus is located in the Mile End area of the East End of London. -- ORGANIZERS * General chairs: Pasquale Malacaria, Nikos Tzevelekos * Workshops chair: Paulo Oliva -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at p.malacaria at qmul.ac.uk, nikos.tzevelekos at qmul.ac.uk. From dstcruz at gmail.com Thu Sep 4 05:41:23 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 3 Sep 2014 23:41:23 -0600 Subject: [Haskell] Haskell Weekly News: Issue 304 Message-ID: Welcome to issue 304 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from August 24 to 30, 2014 Quotes of the Week * pjdelport: Haskell: Lazy evaluation, eager debugging. * trap_exit: isn't hoogle awesome? the first time I used it, I was like "for the first time in my life, google sucks" Top Reddit Stories * Hython - a Haskell-powered Python 3 interpreter Domain: github.com, Score: 95, Comments: 22 Original: [1] http://goo.gl/aI16qA On Reddit: [2] http://goo.gl/N67fnX * Using Emacs for Haskell development Domain: github.com, Score: 89, Comments: 47 Original: [3] http://goo.gl/tuPL91 On Reddit: [4] http://goo.gl/RxVWFQ * Ivory Language Domain: ivorylang.org, Score: 70, Comments: 36 Original: [5] http://goo.gl/xJJ68c On Reddit: [6] http://goo.gl/Vz9cTX * A taste of Cabalized Backpack : Inside 206-105 Domain: blog.ezyang.com, Score: 61, Comments: 73 Original: [7] http://goo.gl/8MpD3U On Reddit: [8] http://goo.gl/3kVQOG * Introducing /r/haskellgamedev Domain: self.haskell, Score: 58, Comments: 20 Original: [9] http://goo.gl/B2nzhq On Reddit: [10] http://goo.gl/B2nzhq * Acme.StringlyTyped Domain: hackage.haskell.org, Score: 44, Comments: 11 Original: [11] http://goo.gl/IfK2Uf On Reddit: [12] http://goo.gl/Z0wT5E * A new version of Yampa is out (0.9.6) Domain: keera.co.uk, Score: 43, Comments: 16 Original: [13] http://goo.gl/EHxFdd On Reddit: [14] http://goo.gl/EXGLdX * On CodeWorld and Haskell Domain: cdsmith.wordpress.com, Score: 41, Comments: 23 Original: [15] http://goo.gl/C7tkHk On Reddit: [16] http://goo.gl/qu3l04 * Introduction to Dependent Types: Haskell on Steroids Domain: jozefg.bitbucket.org, Score: 37, Comments: 17 Original: [17] http://goo.gl/fg8Rfo On Reddit: [18] http://goo.gl/YLmHNQ * Evaluation order and state tokens - School of Haskell Domain: fpcomplete.com, Score: 35, Comments: 24 Original: [19] http://goo.gl/v0D1HQ On Reddit: [20] http://goo.gl/jiiLRl * IO Monad and Purity Domain: stackoverflow.com, Score: 34, Comments: 13 Original: [21] http://goo.gl/zkBxl1 On Reddit: [22] http://goo.gl/yVQY4F * [ANN] Haste 0.4, now with GHC 7.8 support and binary packages Domain: groups.google.com, Score: 33, Comments: 5 Original: [23] http://goo.gl/DU4QYT On Reddit: [24] http://goo.gl/xcqxU0 * darcs 2.8.5 released Domain: lists.osuosl.org, Score: 30, Comments: 0 Original: [25] http://goo.gl/FbjpuA On Reddit: [26] http://goo.gl/TM6D7E * Yarr - image processing library and partial Repa clone Domain: hackage.haskell.org, Score: 28, Comments: 8 Original: [27] http://goo.gl/cfHAH8 On Reddit: [28] http://goo.gl/oyK3xF * conduit stream fusion Domain: fpcomplete.com, Score: 28, Comments: 15 Original: [29] http://goo.gl/9e57M2 On Reddit: [30] http://goo.gl/kFL5Pu * New blog post: Dealing with Asynchronous Exceptions during Resource Acquisition Domain: well-typed.com, Score: 28, Comments: 34 Original: [31] http://goo.gl/WS05yN On Reddit: [32] http://goo.gl/5hp59d Top StackOverflow Questions * Zipper Comonads, Generically votes: 43, answers: 3 Read on SO: [33] http://goo.gl/NDzqR1 * Test if a value matches a constructor votes: 25, answers: 3 Read on SO: [34] http://goo.gl/3Sa7hX * What is the difference between a cyclic list and an infinite list in haskell? votes: 16, answers: 2 Read on SO: [35] http://goo.gl/q7f7pu * Powerset Function 1-Liner votes: 13, answers: 1 Read on SO: [36] http://goo.gl/cez03g * How to make a binary tree zipper an instance of Comonad? votes: 13, answers: 1 Read on SO: [37] http://goo.gl/Zc1wr4 * Is there a better performing alternative to read and show in Haskell? votes: 11, answers: 1 Read on SO: [38] http://goo.gl/Y0m0wX * QuickCheck: How to use exhaustiveness checker to prevent forgotten constructors of a sum type votes: 11, answers: 2 Read on SO: [39] http://goo.gl/b8YbtB * Why does FRP consider time as a factor for values? votes: 10, answers: 2 Read on SO: [40] http://goo.gl/Yo65J8 Until next time, [41]+Daniel Santa Cruz References 1. https://github.com/mattgreen/hython 2. http://www.reddit.com/r/haskell/comments/2ejlxm/hython_a_haskellpowered_python_3_interpreter/ 3. https://github.com/serras/emacs-haskell-tutorial/blob/master/tutorial.md 4. http://www.reddit.com/r/haskell/comments/2efpx4/using_emacs_for_haskell_development/ 5. http://ivorylang.org/ 6. http://www.reddit.com/r/haskell/comments/2epdwp/ivory_language/ 7. http://blog.ezyang.com/2014/08/a-taste-of-cabalized-backpack/ 8. http://www.reddit.com/r/haskell/comments/2eoett/a_taste_of_cabalized_backpack_inside_206105/ 9. http://www.reddit.com/r/haskell/comments/2f0xm0/introducing_rhaskellgamedev/ 10. http://www.reddit.com/r/haskell/comments/2f0xm0/introducing_rhaskellgamedev/ 11. http://hackage.haskell.org/package/acme-stringly-typed-1.0.0.0/docs/Acme-StringlyTyped.html 12. http://www.reddit.com/r/haskell/comments/2f01jl/acmestringlytyped/ 13. http://keera.co.uk/blog/2014/08/29/new-version-yampa-0-9-6/ 14. http://www.reddit.com/r/haskell/comments/2ex7c9/a_new_version_of_yampa_is_out_096/ 15. http://cdsmith.wordpress.com/2014/08/26/on-codeworld-and-haskell/ 16. http://www.reddit.com/r/haskell/comments/2en20t/on_codeworld_and_haskell/ 17. http://jozefg.bitbucket.org/posts/2014-08-25-dep-types-part-1.html 18. http://www.reddit.com/r/haskell/comments/2er003/introduction_to_dependent_types_haskell_on/ 19. https://www.fpcomplete.com/user/snoyberg/general-haskell/advanced/evaluation-order-and-state-tokens 20. http://www.reddit.com/r/haskell/comments/2eiqwv/evaluation_order_and_state_tokens_school_of/ 21. http://stackoverflow.com/a/25576375/1651941 22. http://www.reddit.com/r/haskell/comments/2f191i/io_monad_and_purity/ 23. https://groups.google.com/forum/#!topic/haste-compiler/mel9aO9Jako 24. http://www.reddit.com/r/haskell/comments/2ev19m/ann_haste_04_now_with_ghc_78_support_and_binary/ 25. http://lists.osuosl.org/pipermail/darcs-users/2014-August/027041.html 26. http://www.reddit.com/r/haskell/comments/2ekjmx/darcs_285_released/ 27. http://hackage.haskell.org/package/yarr 28. http://www.reddit.com/r/haskell/comments/2eg1nk/yarr_image_processing_library_and_partial_repa/ 29. https://www.fpcomplete.com/blog/2014/08/conduit-stream-fusion 30. http://www.reddit.com/r/haskell/comments/2es8oj/conduit_stream_fusion/ 31. http://www.well-typed.com/blog/97/ 32. http://www.reddit.com/r/haskell/comments/2ety9f/new_blog_post_dealing_with_asynchronous/ 33. http://stackoverflow.com/questions/25554062/zipper-comonads-generically 34. http://stackoverflow.com/questions/25587501/test-if-a-value-matches-a-constructor 35. http://stackoverflow.com/questions/25498431/what-is-the-difference-between-a-cyclic-list-and-an-infinite-list-in-haskell 36. http://stackoverflow.com/questions/25476248/powerset-function-1-liner 37. http://stackoverflow.com/questions/25519767/how-to-make-a-binary-tree-zipper-an-instance-of-comonad 38. http://stackoverflow.com/questions/25496672/is-there-a-better-performing-alternative-to-read-and-show-in-haskell 39. http://stackoverflow.com/questions/25535616/quickcheck-how-to-use-exhaustiveness-checker-to-prevent-forgotten-constructors 40. http://stackoverflow.com/questions/25568712/why-does-frp-consider-time-as-a-factor-for-values 41. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From garrigue at math.nagoya-u.ac.jp Sat Sep 6 07:26:58 2014 From: garrigue at math.nagoya-u.ac.jp (Jacques Garrigue) Date: Sat, 6 Sep 2014 09:26:58 +0200 Subject: [Haskell] APLAS 2014: Call for Participation Message-ID: <5F678128-CA09-4CE4-8950-441B9F75127D@math.nagoya-u.ac.jp> ======================================================================= 12th Asian Symposium on Programming Languages and Systems (APLAS) November 17-19, 2014, Singapore http://loris-7.ddns.comp.nus.edu.sg/~aplas14 ======================================================================= C A L L F O R P A R T I C I P A T I O N C A L L F O R P O S T E R S APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS), founded by Asian researchers in cooperation with many researchers from Europe and the USA. Past APLAS symposiums were successfully held in Melbourne ('13), Kyoto ('12), Kenting ('11), Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer's LNCS. The symposium is devoted to foundational and practical issues in programming languages and systems. Invited Speakers ---------------- Zhenjiang Hu NII, Japan Dexter Kozen Cornell University, USA Julien Verlaguet Facebook, USA Program Committee ----------------- General chair Wei-Ngan Chin National University of Singapore, Singapore Program chair Jacques Garrigue Nagoya University, Japan Program committee Xiaojuan Cai Shanghai Jiao Tong University, China James Chapman Institute of Cybernetics, Estonia Cristian Gherghina Singapore University of Technology and Design Eric Goubault CEA LIST and Ecole Polytechnique, France Fei He Tsinghua University, China Gerwin Klein NICTA and UNSW, Australia Raghavan Komondoor Indian Institute of Science, Bangalore Paddy Krishnan Oracle, Australia Daan Leijen Microsoft Research, USA Yasuhiko Minamide University of Tsukuba, Japan Shin-Cheng Mu Academia Sinica, Taiwan Sungwoo Park Pohang University of Science and Technology, Korea Julian Rathke University of Southampton, UK Sukyoung Ryu KAIST, Korea Alexandra Silva Radboud University Nijmegen, Netherlands Martin Sulzmann Karlsruhe University of Applied Sciences, Germany Munehiro Takimoto Tokyo University of Science, Japan Jan Vitek Purdue University, USA Hongwei Xi Boston University, USA Venue ----- The conference will be held at the Kent Ridge Guild House of the National University of Singapore. Local information and registration are available at the following web site: http://loris-7.ddns.comp.nus.edu.sg/~aplas14 Call for Poster (Deadline 15th Sept 2014) http://loris-7.ddns.comp.nus.edu.sg/~aplas14/cfposters.html Poster Chair: Cristian Gherghina ============================= Monday, November 17th ============================= 08:30-09:00 Registration 09:00-10:00 ** Invited Talk: What is the Essence of Bidirectional Programming? Zhenjiang Hu (NII, Japan) 10:00-10:30 Coffee break 10:30-12:00 Session 1 Optimized Compilation of Multiset Rewriting with Comprehensions Edmund Soon Lee Lam, Iliano Cervesato (CMU, Qatar) Logic Programming and Logarithmic Space Cl?ment Aubert, Marc Bagnol, Paolo Pistone (Institut de Math?matiques de Marseille, France),Thomas Seiller (Institut des Hautes ?tudes Math?matiques,France) Automatic Memory Management Based on Program Transformation using Ownerships Tatsuya Sonobe, Kohei Suenaga, Atsushi Igarashi (Kyoto Univ., Japan) 12:00-13:30 Lunch and Posters 13:30-14:30 Session 2 The Essence of Ruby Katsuhiro Ueno, Yutaka Fukasawa (Tohoku University, Japan),Akimasa Morihata (Univ. of Tokyo, Japan), Atsushi Ohori (Tohoku Univ., Japan) Types for Flexible Objects Zachary Palmer, Scott Smith, Hari Menon, Alexander Rozenshteyn (The Johns Hopkins Univ., USA) 14:30-16:00 Posters and Tea 16:00-17:30 Session 3 A Translation of Intersection and Union Types for the lambda-mu Calculus Kentaro Kikuchi (RIEC, Tohoku Univ., Japan), Takafumi Sakurai (Chiba Univ., Japan) A Formalized Proof of Strong Normalization for Guarded Recursive Types Andreas Abel (Gothenburg Univ., Sweden), Andrea Vezzosi (Chalmers Univ. of Technology, Sweden) Functional Pearl: Nearest Shelters in Manhattan Shin-Cheng Mu (Academia Sinica, Taiwan), Ting-Wei Chen (National Taiwan Univ., Taiwan) ============================= Tuesday, November 18th ============================= 08:30-09:30 ** Invited Talk: Incremental Adoption of Static-Typing Julien Verlaguet (Facebook, USA) 09:30-10:00 Session 4 SUPPL: A flexible language for policies Robert Dockins and Andrew Tolmach (Portland State Univ., USA) 10:00-10:30 Coffee break 10:30-12:00 Session 5 A Method for Scalable and Precise Bug Finding Using Program Analysis and Model Checking Manuel Valdiviezo, Cristina Cifuentes and Padmanabhan Krishnan (Oracle Labs Brisbane, Australia) Model-checking for Android Malware Detection Fu Song (East China Normal Univ., China), Tayssir Touili (LIAFA, CNRS & Univ. Paris Diderot, France) Necessary and Sufficient Preconditions via Eager Abstraction Mohamed Nassim Seghir (Univ. of Edinburgh, UK), Peter Schrammel (Univ. of Oxford, UK) 12:00-13:30 Lunch 13:30-15:00 Session 6 Resource Protection using Atomics: Patterns and Verifications Afshin Amighi, Stefan Blom, Marieke Huisman (Univ. of Twente, Netherlands) Resource Analysis of Complex Programs with Cost Equations Antonio Flores Montoya, Reiner H?hnle (Technische Univ. Darmstadt, Germany) Simple and Efficient Algorithms for Octagons Aziem Chawdhary, Edward Robbins, Andy King (Univ. of Kent, UK) 15:00-15:30 Coffee break 15:30-17:00 Session 7 Compositional Entailment Checking for a Fragment of Separation Logic Constantin Enea (LIAFA, CNRS & Univ. of Paris, France), Ondrej Lengal (Brno Univ. of Technology, Czech Republic),Mihaela Sighireanu (LIAFA, CNRS & Univ. of Paris, France), Tomas Vojnar (Brno Univ. of Technology, Czech Republic) Automatic Constrained Rewriting Induction Towards Verifying Procedural Programs Cynthia Kop (Univ. of Innsbruck, Austria), Naoki Nishida (Nagoya Univ., Japan) A ZDD-based Efficient Higher-order Model Checking Algorithm Taku Terao, Naoki Kobayashi (Univ. of Tokyo, Japan) 18:00- APLAS Banquet ============================ Wednesday, November 19th ============================ 08:30-10:00 Session 8 Inferring Grammatical Summaries of String Values Se-Won Kim, Wooyoung Chin, Jimin Park, Jeongmin Kim, Sukyoung Ryu (KAIST, Korea) Syntax-Directed Divide-and-Conquer Data-Flow Analysis Shigeyuki Sato (The Univ. of Electro-Communications, Japan), Akimasa Morihata (Univ. of Tokyo, Japan) Address Chain: Profiling Java Objects without Overhead in Java Heaps Xiaohua Shi, Junru Xie, Hengyang Yu (Beihang Univ., China) 10:00-10:30 Coffee break 10:30-12:00 Session 9 Call-by-Value in a Basic Logic for Interaction Ulrich Sch?pp (Ludwig-Maximilians-Univ. M?nchen, Germany) A precise and abstract memory model for C using symbolic values Fr?d?ric Besson (Inria, France), Sandrine Blazy, Pierre Wilke (IRISA, France) Hereditary history-preserving bisimilarity: logics and automata Paolo Baldan, Silvia Crafa (Universita' di Padova, Italy) 12:00-13:00 Lunch 13:00-14:00 ** Invited Talk: NetKAT: A formal system for the verification of networks Dexter Kozen (Cornell Univ., USA) From J.Hage at uu.nl Sat Sep 6 12:45:35 2014 From: J.Hage at uu.nl (Jurriaan Hage) Date: Sat, 6 Sep 2014 14:45:35 +0200 Subject: [Haskell] ANN: Helium now available from Hackage Message-ID: <56180734-4E7B-4ECB-809F-F41A7F05259B@uu.nl> Dear Haskellers, I am happy to inform you that the programmer-friendly Helium Haskell compiler, known for its focus on error messages and hints, domain specific type error diagnosis, and its compilation logging facility, is now available from Hackage. All you need to do is cabal install helium cabal install lvmrun and you should be ready to go. The system has been tested under various instances of Windows, Mac, and Linux. To use Helium, there is a texthint program that is much like ghci (but less powerful), and a runhelium program that behaves like runhaskell. NB. the Hint environment is not yet availalble in this way (and, being pure Java, I am not sure if we will make it available in this way), and the server for logging the compiled programs is also not made available in this way. If you have a need for either of these, please e-mail me. There is a website too: http://www.cs.uu.nl/foswiki/Helium/WebHome To dispell one of the frequent misunderstandings about Helium: Helium DOES support a form of overloading. But overloading is restricted to specific classes: Num, Eq, Ord, Show and Enum, with instances for Eq and Show being derived, and for the others the instances are fixed. In other words: you can't write your own classes and instances. If you want, you can turn overloading off entirely, and profit from better error messages. Any feedback is appreciated. Replying to this e-mail will do, or mail us at helium at cs.uu.nl . cheers, Jurriaan Hage writing for the Helium Team PS. no need to bother telling us about the warnings you get when compiling with GHC 7.8.x. We know about them, and they will be fixed in a future release. As it happens, we prepared this version of Helium with GHC 7.6.3. From sbritton at cbu.edu Sun Sep 7 22:25:01 2014 From: sbritton at cbu.edu (Stephen Britton) Date: Sun, 7 Sep 2014 17:25:01 -0500 Subject: [Haskell] ANNOUNCE: New Hackage release - LargeCardinalHierarchy-0.0.1 Message-ID: Shalom Fellow Haskellers, I just uploaded my first documented Hackage release, the LargeCardinalHierarchy.hs package. I wrote this program four years ago during my junior year of university. It is a simple transfinite cardinal arithmetic library for all large cardinals listed on the following Wikipedia page: http://en.wikipedia.org/wiki/List_of_large_cardinal_properties The documentation was generated using Haddock 2.11.0 and the source code was written under GHC 6.8.2. http://hackage.haskell.org/package/LargeCardinalHierarchy-0.0.1/src/LargeCardinalHierarchy.html Best, Stephen E. A. Britton -------------- next part -------------- An HTML attachment was scrubbed... URL: From ivan.miljenovic at gmail.com Mon Sep 8 13:32:52 2014 From: ivan.miljenovic at gmail.com (Ivan Lazar Miljenovic) Date: Mon, 8 Sep 2014 23:32:52 +1000 Subject: [Haskell] ANNOUNCE: buildable-0.1.0.0 Message-ID: Have you ever wanted to deal with the builders for various data types in a polymorphic/overloaded fashion? I'm needing to do so and couldn't find any existing code that did so, so I decided to rectify this: http://hackage.haskell.org/package/buildable As a (very contrived) example: ?> build ((365 :: Dec Int) <| fromValue (Char7 ' ') |> (365 :: BigEndian Int16) |> (" omega=? " :: Utf8 String) |> Utf16 (LE ("hello" :: LT.Text))) :: SB.ByteString "365 \SOHm omega=\240\157\159\130 h\NULe\NULl\NULl\NULo\NUL" -- Ivan Lazar Miljenovic Ivan.Miljenovic at gmail.com http://IvanMiljenovic.wordpress.com From fuuzetsu at fuuzetsu.co.uk Mon Sep 8 16:01:03 2014 From: fuuzetsu at fuuzetsu.co.uk (Mateusz Kowalczyk) Date: Mon, 08 Sep 2014 17:01:03 +0100 Subject: [Haskell] ANNOUNCE: New Hackage release - LargeCardinalHierarchy-0.0.1 In-Reply-To: References: Message-ID: <540DD2BF.6020201@fuuzetsu.co.uk> On 09/07/2014 11:25 PM, Stephen Britton wrote: > Shalom Fellow Haskellers, > > I just uploaded my first documented Hackage release, the > LargeCardinalHierarchy.hs package. I wrote this program four years ago > during my junior year of university. It is a simple transfinite cardinal > arithmetic library for all large cardinals listed on the > following Wikipedia page: > > http://en.wikipedia.org/wiki/List_of_large_cardinal_properties > > The documentation was generated using Haddock 2.11.0 and the source code > was written under GHC 6.8.2. > > http://hackage.haskell.org/package/LargeCardinalHierarchy-0.0.1/src/LargeCardinalHierarchy.html > > Best, > Stephen E. A. Britton > Is there a reason why you specifically generated the docs with such an old version? If you just uploaded the source then you'd get something much more recent. -- Mateusz K. From dstcruz at gmail.com Thu Sep 11 03:30:11 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 10 Sep 2014 21:30:11 -0600 Subject: [Haskell] Haskell Weekly News: Issue 304 Message-ID: Welcome to issue 305 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from August 31 to September 06, 2014 Quotes of the Week * srhb: segfaults sure are easier to come by doing FFI stuff Top Reddit Stories * Pandoc author working with industry on Markdown spec Domain: standardmarkdown.com, Score: 68, Comments: 7 Original: [1] http://goo.gl/JBte8k On Reddit: [2] http://goo.gl/LWT42a * ICFP 2014 Talks Domain: youtube.com, Score: 56, Comments: 0 Original: [3] http://goo.gl/2zRte4 On Reddit: [4] http://goo.gl/NvWBBa * ICFP 2014 Workshops (Videos) Domain: youtube.com, Score: 53, Comments: 6 Original: [5] http://goo.gl/gpfI8T On Reddit: [6] http://goo.gl/Bj5SwB * Let's Build a Browser Engine in Haskell Domain: hrothen.github.io, Score: 45, Comments: 18 Original: [7] http://goo.gl/FkOM49 On Reddit: [8] http://goo.gl/rXM38x * Open type families are not modular Domain: blog.ezyang.com, Score: 41, Comments: 52 Original: [9] http://goo.gl/XO1bVK On Reddit: [10] http://goo.gl/ROxxUA * IDE for Haste projects Domain: haskell-web.blogspot.com.es, Score: 36, Comments: 5 Original: [11] http://goo.gl/uvjZUC On Reddit: [12] http://goo.gl/3Ra4dt * Real world one-liner examples Domain: github.com, Score: 33, Comments: 7 Original: [13] http://goo.gl/E5wFiW On Reddit: [14] http://goo.gl/9gipjb * Planning Yesod 1.4 Domain: yesodweb.com, Score: 32, Comments: 8 Original: [15] http://goo.gl/7Kul02 On Reddit: [16] http://goo.gl/erCRmZ * Practical Machines: A simple tutorial for the Machines streaming library Domain: statusfailed.com, Score: 32, Comments: 24 Original: [17] http://goo.gl/bmRQot On Reddit: [18] http://goo.gl/0QSdOL * Anecdotes and Advice on Hiring Junior or Summer/Co-Op Students for Haskell Work Domain: self.haskell, Score: 32, Comments: 29 Original: [19] http://goo.gl/M7NOJO On Reddit: [20] http://goo.gl/M7NOJO * Write your compiler passes in Coq for great good! Domain: megacz.com, Score: 30, Comments: 13 Original: [21] http://goo.gl/l7MU6n On Reddit: [22] http://goo.gl/oSqi3Z * IntelliJ IDEA haskell-idea-plugin + Hasklig Domain: self.haskell, Score: 28, Comments: 3 Original: [23] http://goo.gl/cNWkLh On Reddit: [24] http://goo.gl/cNWkLh * Upcast, a declarative cloud infrastructure orchestration tool that leverages Nix Domain: github.com, Score: 27, Comments: 12 Original: [25] http://goo.gl/vPpXcn On Reddit: [26] http://goo.gl/MHj0Le * Ray Marching Distance Fields with Haskell and GLSL Domain: github.com, Score: 27, Comments: 13 Original: [27] http://goo.gl/HZSjFq On Reddit: [28] http://goo.gl/w0IZ0w * A Pretty-Printer that Says What It Means (or, Why Idris's Pretty-Printer is a Functor) Domain: davidchristiansen.dk, Score: 25, Comments: 14 Original: [29] http://goo.gl/vfdISz On Reddit: [30] http://goo.gl/mHU49x * The Ivory Language is an eDSL for safe systems programming. You can think of Ivory as a safer C, embedded in Haskell. Domain: ivorylang.org, Score: 23, Comments: 3 Original: [31] http://goo.gl/xJJ68c On Reddit: [32] http://goo.gl/RLljxg * Pre-published the slide "Writing NetBSD Sound Drivers in Haskell" for Haskell Symposium 2014. #icfp2014 Domain: slideshare.net, Score: 23, Comments: 4 Original: [33] http://goo.gl/gsENVq On Reddit: [34] http://goo.gl/mWH3zH * Haskell 2014 talk: Reflection without Remorse: Revealing a hidden sequence to speed up monadic reflection Domain: youtube.com, Score: 23, Comments: 8 Original: [35] http://goo.gl/Dffhnx On Reddit: [36] http://goo.gl/UFPUu3 * Wadler's Blog: Howard on Curry-Howard Domain: wadler.blogspot.com, Score: 21, Comments: 0 Original: [37] http://goo.gl/Fz90FG On Reddit: [38] http://goo.gl/P5kemv Top StackOverflow Questions * Infinite lazy bitmap votes: 11, answers: 2 Read on SO: [39] http://goo.gl/4zDwFX * Correct terminology for continuations votes: 11, answers: 4 Read on SO: [40] http://goo.gl/QHVRWI * How do I make MonadRandom a Functor? votes: 9, answers: 1 Read on SO: [41] http://goo.gl/vvD7bR * Why does Haskell's foldr NOT stackoverflow while the same Scala implementation does? votes: 9, answers: 4 Read on SO: [42] http://goo.gl/zdxgAM Until next time, [43]+Daniel Santa Cruz References 1. http://standardmarkdown.com/ 2. http://www.reddit.com/r/haskell/comments/2fgtuu/pandoc_author_working_with_industry_on_markdown/ 3. https://www.youtube.com/playlist?list=PL4UWOFngo5DVBqifWX6ZlXJ7idxWaOP69 4. http://www.reddit.com/r/haskell/comments/2f8o3x/icfp_2014_talks/ 5. http://www.youtube.com/playlist?list=PL4UWOFngo5DXuUiMCNumrFhaDfMx54QgV 6. http://www.reddit.com/r/haskell/comments/2f60hd/icfp_2014_workshops_videos/ 7. http://hrothen.github.io/2014/09/05/lets-build-a-browser-engine-in-haskell/ 8. http://www.reddit.com/r/haskell/comments/2flosm/lets_build_a_browser_engine_in_haskell/ 9. http://blog.ezyang.com/2014/09/open-type-families-are-not-modular/ 10. http://www.reddit.com/r/haskell/comments/2fi4zc/open_type_families_are_not_modular/ 11. http://haskell-web.blogspot.com.es/2014/09/ide-for-haste-projects.html 12. http://www.reddit.com/r/haskell/comments/2fk91p/ide_for_haste_projects/ 13. https://github.com/sjoerdvisscher/blog/blob/master/2014/2014-09-03%20real%20world%20one-liner%20examples.md 14. http://www.reddit.com/r/haskell/comments/2feen3/real_world_oneliner_examples/ 15. http://www.yesodweb.com/blog/2014/09/planning-yesod-1-4 16. http://www.reddit.com/r/haskell/comments/2f4kym/planning_yesod_14/ 17. http://statusfailed.com/blog/2014/09/02/practical-machines-in-60-seconds.html 18. http://www.reddit.com/r/haskell/comments/2fao00/practical_machines_a_simple_tutorial_for_the/ 19. http://www.reddit.com/r/haskell/comments/2fj0v5/anecdotes_and_advice_on_hiring_junior_or/ 20. http://www.reddit.com/r/haskell/comments/2fj0v5/anecdotes_and_advice_on_hiring_junior_or/ 21. http://www.megacz.com/berkeley/coq-in-ghc/ 22. http://www.reddit.com/r/haskell/comments/2f8bu9/write_your_compiler_passes_in_coq_for_great_good/ 23. http://www.reddit.com/r/haskell/comments/2fb1j5/intellij_idea_haskellideaplugin_hasklig/ 24. http://www.reddit.com/r/haskell/comments/2fb1j5/intellij_idea_haskellideaplugin_hasklig/ 25. https://github.com/zalora/upcast 26. http://www.reddit.com/r/haskell/comments/2f2meq/upcast_a_declarative_cloud_infrastructure/ 27. https://github.com/blitzcode/ray-marching-distance-fields 28. http://www.reddit.com/r/haskell/comments/2ffmys/ray_marching_distance_fields_with_haskell_and_glsl/ 29. http://www.davidchristiansen.dk/2014/09/06/pretty-printing-idris/ 30. http://www.reddit.com/r/haskell/comments/2fntec/a_prettyprinter_that_says_what_it_means_or_why/ 31. http://ivorylang.org/ 32. http://www.reddit.com/r/haskell/comments/2f6p2h/the_ivory_language_is_an_edsl_for_safe_systems/ 33. http://www.slideshare.net/master_q/writing-netbsd-sound-drivers-in-haskell 34. http://www.reddit.com/r/haskell/comments/2fd02w/prepublished_the_slide_writing_netbsd_sound/ 35. https://www.youtube.com/watch?v=_XoI65Rxmss&index=31&list=UUP9g4dLR7xt6KzCYntNqYcw 36. http://www.reddit.com/r/haskell/comments/2fnj6p/haskell_2014_talk_reflection_without_remorse/ 37. http://wadler.blogspot.com/2014/08/howard-on-curry-howard.html 38. http://www.reddit.com/r/haskell/comments/2f9v8e/wadlers_blog_howard_on_curryhoward/ 39. http://stackoverflow.com/questions/25621889/infinite-lazy-bitmap 40. http://stackoverflow.com/questions/25648332/correct-terminology-for-continuations 41. http://stackoverflow.com/questions/25622571/how-do-i-make-monadrandom-a-functor 42. http://stackoverflow.com/questions/25622959/why-does-haskells-foldr-not-stackoverflow-while-the-same-scala-implementation-d 43. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From yangliu at ntu.edu.sg Thu Sep 11 08:50:49 2014 From: yangliu at ntu.edu.sg (Liu Yang (Asst Prof)) Date: Thu, 11 Sep 2014 08:50:49 +0000 Subject: [Haskell] ICFEM 2014 Call for Participation Message-ID: <5A4257BA3B1EEA45B17620B30FD656E12CB06318@EXCHMBOX31.staff.main.ntu.edu.sg> 16th International Conference on Formal Engineering Methods ICFEM 2014, Luxembourg, 3-7 November 2014 Call for Participation http://icfem2014.uni.lu ---------------------------------------- The 16th International Conference on Formal Engineering Methods (ICFEM 2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from 3rd November to 7 November 2014. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Highlights: ---------------------------------------- + Keynote speakers: Nikolaj Bjorner (Microsoft Research), Lionel Briand (University of Luxembourg) and Vincent Danos (University of Edinburgh) + A provisional programme and the list of accepted paper are now available (http://icfem2014.uni.lu/program.php, http://icfem2014.uni.lu/accepted.php) + Early registration by September 27, 2014 (http://icfem2014.uni.lu/registration.php) PC Chairs ---------------------------------------- + Stephan Merz (INRIA, France) + Jun Pang (University of Luxembourg, Luxembourg) ________________________________ CONFIDENTIALITY:This email is intended solely for the person(s) named and may be confidential and/or privileged.If you are not the intended recipient,please delete it,notify us and do not copy,use,or disclose its contents. Towards a sustainable earth:Print only when necessary.Thank you. -------------- next part -------------- An HTML attachment was scrubbed... URL: From gvidal at dsic.upv.es Thu Sep 11 11:19:06 2014 From: gvidal at dsic.upv.es (German Vidal) Date: Thu, 11 Sep 2014 12:19:06 +0100 Subject: [Haskell] PhD position - Computer assisted validation in Erlang References: Message-ID: <3D341836-5CA3-42DD-A158-50203DFA09D7@dsic.upv.es> -------------------------------------------------------------------------- PhD scholarship at MiST, DSIC (Universitat Politecnica de Valencia, Spain) http://users.dsic.upv.es/~gvidal/german/mist Computer assisted validation in Erlang A fully-funded PhD position to start in early 2015. ** DEADLINE FOR APPLICATIONS: SEPTEMBER 24, 2014 ** -------------------------------------------------------------------------- The common goal of the MiST research group is the development of techniques for assisting the construction of reliable software through all phases of its life cycle. We aim at providing a solid formal basis for our developments which would allow us to formally prove the correctness and effectiveness of the techniques. The group keeps a balance between theoretical and practical developments. We have a new doctoral position available to start in early 2015. Candidates should be motivated to successfully complete a full Doctoral degree program. The PhD scholarship will cover a four-year period and is linked to a research project (see below) funded within the National Plan for Research and Development. The successful applicant will receive high level doctoral training in close interaction with her/his direct supervisor and other project researchers. Each scholarship includes a PhD fees exemption, an annual salary of EUR 16422 (divided in 14 payments) and social security entitlements. The possibility to apply for additional funding to cover the cost of international stays of up to three months per year is also associated with each PhD scholarship. Furthermore, travelling costs for attending conferences and schools, computer equipment, etc., is also covered by the group. -------------------------------------------------------------------------- CAVI project We live in a digital society in which the software reliability has become a crucial aspect, both because the risks for human lives that a software bug may cause and also for its associated economic cost. Most current software products use heterogenous technologies and different programming languages that are glued together by means of complex mechanisms. This complexity, together with the fact that most software components are made by third-party developers, makes the software validation tasks a true challenge for software development companies in terms of cost. However, validation tasks are crucial for guaranteeing the quality of the software products. In this project, we aim at advancing the knowledge and technology within the area of software validation at different levels: - Software testing. This is the technology most commonly used by the software industry to prevent errors during the software development. The controlled execution of a number of tests allows one to validate, to some extent, the correctness of the software developed. - Formal verification. The main drawback of the previous technique is that, despite the fact that they can be very helpful to locate the bugs of a program, they cannot be used to ensure that a program is error-free. Therefore, we will also consider formal verification techniques that finitely approximate (by means of static analysis, abstract interpretation, constraints, etc.) the possible executions of a program. Thus, we may obtain a total assurance of the correctness of a program, which makes these techniques specially adequate for validating critical software. - Program debugging. Complementary to the previous methods, we can also find a number of debugging techniques that help the programmer to detect and locate the most common program errors. We plan to apply most of our developments to the functional and concurrent programming language Erlang; see, e.g., http://www.erlang.org/ http://en.wikipedia.org/wiki/Erlang_(programming_language) -------------------------------------------------------------------------- Applications and evaluation criteria Formal applications for the PhD scholarships must be made online, through the framework of the Spanish National Program for Training of Researchers (FPI program): http://tinyurl.com/nmx6auf In particular, in the above URL you can find: - General requirements (basically, you should be already accepted and/or enrolled in a PhD program) - Frequently asked questions - The online application site (you need to sign up first and then add mainly the following documents: copy of your passport-in case you're not spanish-, updated CV, academic certifications of your graduate and master degrees, copy of the acceptance/registration to a PhD programme). Unfortunately, all the available information is only in Spanish. Nevertheless, we will happy to help you with the process, so don't hesitate to ask us for clarifications and help with the online application in case you are interested. Evaluation criteria: - Academic performance and achievements of the candidate - Knowledge on functional and/or logic programming paradigms (including Erlang, Haskell and/or Prolog programming languages). - Willingness to undertake research visits of up to three months in other countries. - Ability to write and interact in English. -------------------------------------------------------------------------- Interested candidates are invited to contact German Vidal via email (gvidal at dsic.upv.es). Please note that the deadline for the application is approaching soon! -------------------------------------------------------------------------- From tmcdonell at cse.unsw.edu.au Mon Sep 15 14:04:14 2014 From: tmcdonell at cse.unsw.edu.au (Trevor L. McDonell) Date: Mon, 15 Sep 2014 10:04:14 -0400 Subject: [Haskell] [ANN] accelerate-0.15 Message-ID: <412E5260-16D1-48F0-86B5-8D94C5665C82@cse.unsw.edu.au> Friends, I am pleased to announce the release of the Accelerate 0.15 family of packages. Accelerate defines an embedded language of array computations for high performance computing in Haskell. Computations on multi-dimensional, regular arrays are expressed in the form of parameterised collective operations, such as maps, reductions, and permutations. These computations may then be online compiled and executed on a range of architectures, such as GPUs. This release brings mainly bug fixes and performance improvements. The following packages are available on Hackage: accelerate The language definition and reference implementation accelerate-cuda A high performance parallel backend targeting NVIDIA GPUs accelerate-io Fast conversion between Accelerate arrays and other formats, including ?vector? and ?repa?. accelerate-fft Discrete Fourier transforms, backed by CUFFT where available accelerate-examples Computational kernels and applications showcasing Accelerate The code can be found on GitHub, where you can also submit issues: https://github.com/AccelerateHS https://github.com/AccelerateHS/accelerate/issues Finally, there is also a mailing list that can be used for both use and development discussions: accelerate-haskell at googlegroups.com http://groups.google.com/group/accelerate-haskell -The Accelerate Team -------------- next part -------------- An HTML attachment was scrubbed... URL: From mail at nh2.me Mon Sep 15 14:08:44 2014 From: mail at nh2.me (=?windows-1252?Q?Niklas_Hamb=FCchen?=) Date: Mon, 15 Sep 2014 16:08:44 +0200 Subject: [Haskell] [accelerate-haskell] [ANN] accelerate-0.15 In-Reply-To: <412E5260-16D1-48F0-86B5-8D94C5665C82@cse.unsw.edu.au> References: <412E5260-16D1-48F0-86B5-8D94C5665C82@cse.unsw.edu.au> Message-ID: <5416F2EC.5070508@nh2.me> Excellent! Now here comes my number 1 feature request for the next version: IO/ST arrays/computations in accelerate, so that I can implement stuff that can work on a 1GB device array with interleaved IO, without having to download and-re-upload that array every time. Keep up the good work! From lemming at henning-thielemann.de Mon Sep 15 17:11:51 2014 From: lemming at henning-thielemann.de (Henning Thielemann) Date: Mon, 15 Sep 2014 19:11:51 +0200 Subject: [Haskell] ANN: patch-image Message-ID: <54171DD7.2030000@henning-thielemann.de> Right after the announcement of the latest version of Accelerate I like to announce an application build using that framework: "patch-image" assembles a big image from several overlapping parts. http://hackage.haskell.org/package/patch-image Now, let me extract the beginning of the docs: Compose a collage from overlapping image parts. In contrast to Hugin, this is not intended for creating panoramas from multiple photographies, but instead is specialised to creating highly accurate reconstructions of flat but big image sources, like record covers, posters or newspapers. It solves the problem that your scanner may be too small to capture a certain image as a whole. . This is the workflow: Scan parts of an image that considerably overlap. They must all be approximately oriented correctly. The program uses the overlapping areas for reconstruction of the layout of the parts. If all parts are in the directory @part@ then in the best case you can simply run: . > patch-image --output=collage.jpeg part/*.jpeg . If you get blurred areas, you might enable an additional rotation correction: . > patch-image --finetune-rotate --output=collage.jpeg part/*.jpeg Currently it depends on CUDA although this is not strictly necessary. From tmcdonell at cse.unsw.edu.au Mon Sep 15 17:27:04 2014 From: tmcdonell at cse.unsw.edu.au (Trevor L. McDonell) Date: Mon, 15 Sep 2014 13:27:04 -0400 Subject: [Haskell] [ANN] accelerate-0.15 In-Reply-To: References: <412E5260-16D1-48F0-86B5-8D94C5665C82@cse.unsw.edu.au> Message-ID: <103A6AB2-18D5-47F0-85AD-9B81EA5ED80C@cse.unsw.edu.au> On 15 Sep 2014, at 10:10 am, Alp Mestanogullari wrote: > Just a quick question: is there any plan to make what's in http://www.cse.unsw.edu.au/~tmcdonell/papers/acc-multidev-icfp2014-sub.pdf land in accelerate any time soon? Yes, we have plans to revive and fully bake this work in the near future. Stay tuned! (: -Trev -------------- next part -------------- An HTML attachment was scrubbed... URL: From chak at cse.unsw.edu.au Tue Sep 16 00:42:06 2014 From: chak at cse.unsw.edu.au (Manuel M T Chakravarty) Date: Tue, 16 Sep 2014 10:42:06 +1000 Subject: [Haskell] [Haskell-cafe] [accelerate-haskell] [ANN] accelerate-0.15 In-Reply-To: <5416F2EC.5070508@nh2.me> References: <412E5260-16D1-48F0-86B5-8D94C5665C82@cse.unsw.edu.au> <5416F2EC.5070508@nh2.me> Message-ID: [Sorry for duplicates, but I first had the wrong sender address.] We always very gladly accept pull requests! :) In any case, please add feature requests as tickets to the GitHub issue tracker (so they don?t get lost): https://github.com/AccelerateHS/accelerate/issues We are trying our best to add requested functionality, but our resources are also very limited ? hence, any contributions are most welcome. Manuel Niklas Hamb?chen : > Excellent! > > Now here comes my number 1 feature request for the next version: > > IO/ST arrays/computations in accelerate, so that I can implement stuff > that can work on a 1GB device array with interleaved IO, without having > to download and-re-upload that array every time. > > Keep up the good work! > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe at haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 496 bytes Desc: Message signed with OpenPGP using GPGMail URL: From calimeri at mat.unical.it Tue Sep 16 21:00:42 2014 From: calimeri at mat.unical.it (Francesco Calimeri) Date: Tue, 16 Sep 2014 23:00:42 +0200 Subject: [Haskell] LPNMR 2015 - Preliminary Call for Papers - 13th International Conference on Logic Programming and Non-monotonic Reasoning Message-ID: [apologies for any cross-posting] Call for Papers --------------------------------------------------------------------------- 13th International Conference on Logic Programming and Non-monotonic Reasoning LPNMR 2015 http://lpnmr2015.mat.unical.it/ Lexington, KY, USA September 27-30, 2015 (Collocated with the 4th Conference on Algorithmic Decision Theory 2015) --------------------------------------------------------------------------- AIMS AND SCOPE LPNMR 2015 is the thirteenth in the series of international meetings on logic programming and non-monotonic reasoning. LPNMR is a forum for exchanging ideas on declarative logic programming, non-monotonic reasoning, and knowledge representation. The aim of the conference is to facilitate interactions between researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those working in knowledge representation and nonmonotonic reasoning. LPNMR strives to encompass theoretical and experimental studies that have led or will lead to the construction of systems for declarative programming and knowledge representation, as well as their use in practical applications. This edition of LPNMR will feature several workshops, a special session dedicated to the 6th ASP Systems Competition, and will be collocated with the 4th Algorithmic Decision Theory Conference, ADT 2015. Joint LPNMR-ADT Doctoral Consortium will be a part of the program. Authors are invited to submit papers presenting original and unpublished research on all aspects of non-monotonic approaches in logic programming and knowledge representation. We invite submissions of both long and short papers. TOPICS Conference topics include, but are not limited to: 1. Foundations of LPNMR Systems: * Semantics of new and existing languages; * Action languages, causality; * Relationships among formalisms; * Complexity and expressive power; * Inference algorithms and heuristics for LPNMR systems; * Extensions of traditional LPNMR languages such as new logical connectives or new inference capabilities; * Updates, revision, and other operations on LPNMR systems; * Uncertainty in LPNMR systems. 2. Implementation of LPNMR systems: * System descriptions, comparisons, evaluations; * Algorithms and novel techniques for efficient evaluation; * LPNMR benchmarks. 3. Applications of LPNMR: * Use of LPNMR in formalization of Commonsense Reasoning and other areas of KR; * LPNMR languages and algorithms in planning, diagnosis, argumentation, reasoning with preferences, decision making and policies; * Applications of LPNMR languages in data integration and exchange systems, software engineering and model checking; * Applications of LPNMR to linguistics, psychology, and other sciences * Integration of LPNMR systems with other computational paradigms; * Embedded LPNMR: Systems using LPNMR subsystems. SUBMISSION LPNMR 2015 welcomes submissions of long papers (13 pages) or short papers (6 pages) in the following categories: * Technical papers * System descriptions * Application descriptions The indicated number of pages includes title page, references and figures. All submissions will be peer-reviewed and accepted papers will appear in the conference proceedings published in the Springer-Verlag Lecture Notes in Artificial Intelligence (LNAI/LNCS) series. At least one author of each accepted paper is expected to register for the conference to present the work. Submissions must be formatted according to the Springer LNCS author instructions, http://www.springer.com/comp/lncs/Authors.html must be written in English, and present original research. Paper submission will be electronic through the LPNMR-15 Easychair site: https://www.easychair.org/conferences/?conf=lpnmr2015 The Program Committee chairs are planning to arrange for the best papers to be published in a special issue of a premiere journal in the field. MULTIPLE SUBMISSION POLICY LPNMR 2015 will not accept any paper which, at the time of submission, is under review or has already been published or accepted for publication in a journal or another conference. Authors are also required not to submit their papers elsewhere during LPNMR's review period. However, these restrictions do not apply to previous workshops with a limited audience and without archival proceedings. ASSOCIATED EVENTS WORKSHOPS - LPNMR 2015 will include specialized workshops to be held on September 27 prior to the main conference. Currently planned workshops include: - Grounding, Transforming, and Modularizing Theories with Variables Organizers: Marc Denecker, Tomi Janhunen - Action Languages, Process Modeling, and Policy Reasoning Organizer: Joohyung Lee - Natural Language Processing and Automated Reasoning Organizers: Marcello Balduccini, Ekaterina Ovchinnikova, Peter Schueller - Learning and Nonmonotonic Reasoning Organizers: Alessandra Russo and Alessandra Mileo ASP COMPETITION - A special session dedicated to a discussion of the 6th ASP System Competition, including the methodology of the competition, benchmarks used, lessons learned and, most importantly, the results and the announcement of the winners. ALGORITHMIC DECISION THEORY (ADT) 2015 (collocated - same time and place) Algorithmic Decision Theory is a vibrant and growing area of research concerned with algorithmic aspects of problems arising in social choice and economics that involve optimal ways to aggregate preferences. The area abounds in hard computational problems and may be an axciting area of applications for ASP. The two conferences will seek ways to identify and promote synergies between their respective areas of focus. JOINT LPNMR-ADT DOCTORAL CONSORTIUM: Details to be announced co-Chairs: - Esra Erdem (LPNMR), Sabanci University, Turkey - Nick Mattei (ADT), NICTA, Australia IMPORTANT DATES (TENTATIVE) * Paper registration: April 13, 2015 * Paper submission: April 20, 2015 * Notification: June 1, 2015 * Final versions due: June 15, 2015 VENUE Lexington is a medium size, pleasant and quiet university town. It is located in the heart of the so-called Bluegrass Region in Central Kentucky. The city is surrounded by beautiful horse farms on green pastures dotted with ponds and traditional architecture stables, and small race tracks, and bordered by white or black fences. The Horse Museum is as beautifully located as it is interesting. Overall, the city has a nice feel that mixes well old and new. The conference will be held in the Hilton Lexington Downtown hotel. GENERAL CHAIR Victor Marek, University of Kentucky, KY, USA PROGRAM CHAIRS Giovambattista Ianni, University of Calabria, Italy Mirek Truszczynski, University of Kentucky, KY, USA WORKSHOPS CHAIR Yuliya Lierler, University of Nebrska at Omaha, NE, USA PUBLICITY CHAIR Francesco Calimeri, University of Calabria, Italy PROGRAM COMMITTEE Agostino Dovier, Universit? di Udine, Italy Agust?n Valverde, Universidad de M?laga, Spain Alessandra Mileo, National University of Ireland, Galway, INSIGHT Centre for Data Analytics, Ireland Andrea Formisano, Dip. di Matematica e Informatica, Universit? di Perugia, Italy Axel Polleres, Vienna University of Economics and Business, Austria Bart Bogaerts, Department of Computer Science, KU Leuven, Belgium Chiaki Sakama, Wakayama University, Japan Chitta Baral, Arizona State University, USA Christoph Redl, Vienna University of Technology, Austria Daniela Inclezan, Miami University, USA David Pearce, Universidad Polit?cnica de Madrid, Spain Emilia Oikarinen, Aalto University, Finland Enrico Pontelli, New Mexico State University, USA Esra Erdem, Sabanci University, Istanbul, Turkey Eugenia Ternovska, Simon Fraser University, Canada Fangkai Yang, The University of Texas at Austin, USA Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong Francesco Calimeri, Universit? della Calabria, Italy Gerhard Brewka, Leipzig University, Germany Giovanni Grasso, Oxford University, UK Hannes Strass, Leipzig University, Germany Hans Tompits, Vienna University of Technology, Austria James Delgrande, Simon Fraser University, Canada Jia-Huai You, University of Alberta, Canada Joohyung Lee, Arizona State University, USA Jose Julio Alferes, Universidade Nova de Lisboa, Portugal Kewen Wang, Griffith University, Australia Marc Denecker, K.U.Leuven, Belgium Marcello Balduccini, Drexel University, USA Marina De Vos, University of Bath, UK Martin Gebser, University of Potsdam, Germany Matthias Knorr, CENTRIA, Universidade Nova de Lisboa, Portugal Mauricio Osorio, Fundacion de la Universidad de las Americas, Puebla, Mexico Michael Fink, Vienna University of Technology, Austria Michael Gelfond, Texas Tech University, USA Orkunt Sabuncu, University of Potsdam, Germany Paul Fodor, Stony Brook University, USA Pedro Cabalar, University of Corunna, Spain Saadat Anwar, Arizona State University, USA Stefan Woltran, Vienna University of Technology Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione, e Matematica, Univ. di L'Aquila, Italy Terrance Swift, CENTRIA, Universidade Nova de Lisboa, Portugal Thomas Eiter, Vienna University of Technology, Austria Tomi Janhunen, Aalto University, Finland Torsten Schaub, University of Potsdam, Germany Vladimir Lifschitz, University of Texas at Austin, USA Wolfgang Faber, University of Huddersfield, UK Yi Zhou, University of Western Sydney, Australia Yisong Wang, Guizhou University, China Yuliya Lierler, University of Kentucky, USA CONTACT lpnmr2015 at mat.unical.it From stefan.wehr at gmail.com Wed Sep 17 08:41:17 2014 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Wed, 17 Sep 2014 10:41:17 +0200 Subject: [Haskell] [ANN] BOB 2015: Call for Contributions Message-ID: Here's a quick reminder. The Deadline for BOB 2015 is in about two weeks (30 September 2014). The BOB conference will have a strong focus on functional programming, so Haskell submissions are very welcome. Please consider submitting! BOB Conference 2015 Berlin 23.1.2015 http://bobkonf.de/2015/ CALL FOR CONTRIBUTIONS English: http://bobkonf.de/2015/cfp.html German: http://bobkonf.de/2015/cfp.html Deadline: September 30, 2014 You drive advanced software engineering methods, implement ambitious architectures and are open to cutting-edge innovation? Attend this conference, meet people that share your goals, and get to know the best software tools and technologies available today. We strive to offer you a day full of new experiences and impressions that you can use to immediately improve your daily life as a software developer. If you share our vision and want to contribute, submit a proposal for a talk or tutorial! We are looking for talks about best-of-breed software technology, e.g.: - functional programming - reactive programming - micro-service architectures - persistent data structures and databases - ... everything really that isn't mainstream, but you think should be. Presenters should provide the audience with information that is practically useful for software developers. This could take the form of e.g.: - experience reports - introductory talks on technical background - demos and how-tos We accept proposals for presentations of 45 minutes (40 minutes talk + 5 minutes questions), as well as 90 minute tutorials for beginners. The language of presentation should be either English or German. It should include (in your presentation language of choice): - an abstract of max. 1500 characters. - a short bio/cv - contact information (including at least email) - a list of 3-5 concrete ideas of how your work can be applied in a developer's daily life - additional material (websites, blogs, slides, videos of past presentations, ...) You can submit your proposal using the following form: https://docs.google.com/spreadsheet/viewform?formkey=dHJ0TjR1cEhUWmdBZFVITGVRVWN5VEE6MA - direct questions to bobkonf at active minus group dot de - proposal deadline: September 30, 2014 - notification: October 15, 2014 NOTE: The conference fee will be waived for presenters, but travel expenses will not be covered. Program Committee - Matthias Fischmann, zerobuzz UG - Matthias Neubauer, SICK AG - Michael Sperber, Active Group - Stefan Wehr, factis research Wissenschaftlicher Beirat - Annette Bieniusa, TU Kaiserslautern - Torsten Grust, Uni T?bingen - Peter Thiemann, Uni Freiburg From stefan.wehr at gmail.com Wed Sep 17 09:01:32 2014 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Wed, 17 Sep 2014 11:01:32 +0200 Subject: [Haskell] ANN: HacBerlin - Haskell Hackathon in Berlin, 26-28 Sep 2014 Message-ID: Hi everyone, this is just a quick reminder: The Haskell Hackathon in Berlin starts in 9 days and there are very few places left. Please register now: http://goo.gl/aLfnWu Where: Berlin, Germany When: Fri 26 - Sun 28 September 2014 We will do lots of Haskell hacking and listen to two excellent talks: * Beyond Parsec -- Revisiting Parser Combinators, by Andres L?h * Chordify: Advanced Functional Programming for Fun and Profit, by Jos? Pedro Magalh?es Meet in Berlin, discuss, hack together and improve the Haskell infrastructure. We welcome all programmers interested in Haskell, beginners and experts! For all details, visit our wiki page (http://www.haskell.org/haskellwiki/HacBerlin2014) and make sure to register now! Cheers, Stefan From dstcruz at gmail.com Thu Sep 18 04:28:08 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 17 Sep 2014 22:28:08 -0600 Subject: [Haskell] Haskell Weekly News: Issue 306 Message-ID: Welcome to issue 306 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from September 07 to 13, 2014 Quotes of the Week * prophile: at this point ekmett is more part of the language than a practitioner of it * Qfwfq: Simon is a title, not a forename. Top Reddit Stories * Haskell for all: Morte: an intermediate language for super-optimizing functional programs Domain: haskellforall.com, Score: 110, Comments: 83 Original: [1] http://goo.gl/MjPyyr On Reddit: [2] http://goo.gl/v2btl4 * AMP has landed in GHC Main! Domain: haskell.org, Score: 88, Comments: 71 Original: [3] http://goo.gl/giu1Xh On Reddit: [4] http://goo.gl/ZGJ76S * [Meta] What's with all these downvotes on beginner questions? Domain: self.haskell, Score: 69, Comments: 67 Original: [5] http://goo.gl/ik2uu2 On Reddit: [6] http://goo.gl/ik2uu2 * Haskell Implementors Workshop 2014 videos [youtube] Domain: youtube.com, Score: 59, Comments: 11 Original: [7] http://goo.gl/ijM6hs On Reddit: [8] http://goo.gl/48GOSr * FP Complete is hiring: Haskell web UI developer Domain: fpcomplete.com, Score: 59, Comments: 14 Original: [9] http://goo.gl/0kPlFl On Reddit: [10] http://goo.gl/WtivSo * How to get (approx) stack traces with profiled builds Domain: self.haskell, Score: 46, Comments: 15 Original: [11] http://goo.gl/ZAurK6 On Reddit: [12] http://goo.gl/ZAurK6 * Hakaru: An embedded probabilistic programming language Domain: indiana.edu, Score: 40, Comments: 10 Original: [13] http://goo.gl/PLcCGW On Reddit: [14] http://goo.gl/aP7giY * Why does David Turner say type classes were a bad idea? Domain: self.haskell, Score: 37, Comments: 96 Original: [15] http://goo.gl/WqRLZQ On Reddit: [16] http://goo.gl/WqRLZQ * Let's Build a Browser Engine in Haskell: Part 2 Domain: hrothen.github.io, Score: 33, Comments: 14 Original: [17] http://goo.gl/PyxMOy On Reddit: [18] http://goo.gl/45L7hs * Proposal for copatterns in Idris Domain: github.com, Score: 30, Comments: 38 Original: [19] http://goo.gl/7Zv7U1 On Reddit: [20] http://goo.gl/pPIq8p * GHC Blog: Static pointers and serialisation (by SPJ) Domain: ghc.haskell.org, Score: 28, Comments: 2 Original: [21] http://goo.gl/HJrm4t On Reddit: [22] http://goo.gl/kPxJj5 * introduction to the basic lens operators Domain: intolerable.me, Score: 26, Comments: 12 Original: [23] http://goo.gl/VXlKnm On Reddit: [24] http://goo.gl/b0bLfE * Prisms lead to typeclasses for subtractive types Domain: gelisam.blogspot.ca, Score: 22, Comments: 6 Original: [25] http://goo.gl/l9QIIm On Reddit: [26] http://goo.gl/GMD5Cj * Preventing memoization in (AI) search problems Domain: okmij.org, Score: 22, Comments: 16 Original: [27] http://goo.gl/oEb6WD On Reddit: [28] http://goo.gl/jqVKPS * A shallow survey of formal methods for C code Domain: imperialviolet.org, Score: 21, Comments: 7 Original: [29] http://goo.gl/rJgycy On Reddit: [30] http://goo.gl/RrXwns * Haskell Lectures Domain: shuklan.com, Score: 21, Comments: 1 Original: [31] http://goo.gl/Ef0E4 On Reddit: [32] http://goo.gl/VASdCX * A Netwire 5 Tutorial Domain: self.haskell, Score: 20, Comments: 5 Original: [33] http://goo.gl/BmcKWr On Reddit: [34] http://goo.gl/BmcKWr * Haskell Symposium talk on inline Objective-C in Haskell Domain: speakerdeck.com, Score: 20, Comments: 0 Original: [35] http://goo.gl/VDHOiP On Reddit: [36] http://goo.gl/TyL90G * HaLVM / Unikernel talk at the Xen User Summit on Monday, September 15th Domain: sched.co, Score: 19, Comments: 8 Original: [37] http://goo.gl/HoVwWT On Reddit: [38] http://goo.gl/9lqCE0 * Fun with (Extended Kalman) Filters Domain: idontgetoutmuch.wordpress.com, Score: 18, Comments: 2 Original: [39] http://goo.gl/8EGSQR On Reddit: [40] http://goo.gl/aTASRU Top StackOverflow Questions * Why does OCaml sometimes require eta expansion? votes: 12, answers: 1 Read on SO: [41] http://goo.gl/TsBuz5 * Can Haskell evaluate and not garbage collect random indexes in a list? votes: 11, answers: 2 Read on SO: [42] http://goo.gl/zXsBT1 * How do I install dependencies when cross compiling haskell code? votes: 10, answers: 1 Read on SO: [43] http://goo.gl/3qH6zK * Haskell lenses: how to make view play nicely with traverse? votes: 10, answers: 3 Read on SO: [44] http://goo.gl/EWrR5j * Is there an instance of Monad but not of MonadFix? votes: 10, answers: 2 Read on SO: [45] http://goo.gl/EAh0qc * How can the continuation monad be expressed using the free monad? votes: 10, answers: 3 Read on SO: [46] http://goo.gl/ymMoFw Until next time, [47]+Daniel Santa Cruz References 1. http://www.haskellforall.com/2014/09/morte-intermediate-language-for-super.html 2. http://www.reddit.com/r/haskell/comments/2g6wsx/haskell_for_all_morte_an_intermediate_language/ 3. http://www.haskell.org/pipermail/ghc-devs/2014-September/006265.html 4. http://www.reddit.com/r/haskell/comments/2fxqts/amp_has_landed_in_ghc_main/ 5. http://www.reddit.com/r/haskell/comments/2g3em9/meta_whats_with_all_these_downvotes_on_beginner/ 6. http://www.reddit.com/r/haskell/comments/2g3em9/meta_whats_with_all_these_downvotes_on_beginner/ 7. https://www.youtube.com/playlist?list=PL4UWOFngo5DW6nKDjK0UB5Oy9zmdWdo7K 8. http://www.reddit.com/r/haskell/comments/2frhfn/haskell_implementors_workshop_2014_videos_youtube/ 9. https://www.fpcomplete.com/blog/2014/09/hiring-haskell-web-ui-dev 10. http://www.reddit.com/r/haskell/comments/2g4mdu/fp_complete_is_hiring_haskell_web_ui_developer/ 11. http://www.reddit.com/r/haskell/comments/2fwwx3/how_to_get_approx_stack_traces_with_profiled/ 12. http://www.reddit.com/r/haskell/comments/2fwwx3/how_to_get_approx_stack_traces_with_profiled/ 13. http://indiana.edu/~ppaml/ 14. http://www.reddit.com/r/haskell/comments/2g4q81/hakaru_an_embedded_probabilistic_programming/ 15. http://www.reddit.com/r/haskell/comments/2foggq/why_does_david_turner_say_type_classes_were_a_bad/ 16. http://www.reddit.com/r/haskell/comments/2foggq/why_does_david_turner_say_type_classes_were_a_bad/ 17. http://hrothen.github.io/2014/09/08/lets-build-a-browser-engine-in-haskell-part-2/ 18. http://www.reddit.com/r/haskell/comments/2fu2l5/lets_build_a_browser_engine_in_haskell_part_2/ 19. https://github.com/idris-lang/Idris-dev/wiki/Copatterns 20. http://www.reddit.com/r/haskell/comments/2fy1hj/proposal_for_copatterns_in_idris/ 21. https://ghc.haskell.org/trac/ghc/blog/simonpj/StaticPointers 22. http://www.reddit.com/r/haskell/comments/2g4vvf/ghc_blog_static_pointers_and_serialisation_by_spj/ 23. http://intolerable.me/lens-operators-intro/ 24. http://www.reddit.com/r/haskell/comments/2fud8k/introduction_to_the_basic_lens_operators/ 25. http://gelisam.blogspot.ca/2014/09/prisms-lead-to-typeclasses-for.html 26. http://www.reddit.com/r/haskell/comments/2foz4a/prisms_lead_to_typeclasses_for_subtractive_types/ 27. http://okmij.org/ftp/Haskell/#memo-off 28. http://www.reddit.com/r/haskell/comments/2g9akh/preventing_memoization_in_ai_search_problems/ 29. https://www.imperialviolet.org/2014/09/07/provers.html 30. http://www.reddit.com/r/haskell/comments/2fsvns/a_shallow_survey_of_formal_methods_for_c_code/ 31. http://shuklan.com/haskell/ 32. http://www.reddit.com/r/haskell/comments/2g672e/haskell_lectures/ 33. http://www.reddit.com/r/haskell/comments/2fs4mv/a_netwire_5_tutorial/ 34. http://www.reddit.com/r/haskell/comments/2fs4mv/a_netwire_5_tutorial/ 35. https://speakerdeck.com/mchakravarty/foreign-inline-code-in-haskell-haskell-symposium-2014 36. http://www.reddit.com/r/haskell/comments/2fve6k/haskell_symposium_talk_on_inline_objectivec_in/ 37. http://sched.co/1rFBMed 38. http://www.reddit.com/r/haskell/comments/2g2sa0/halvm_unikernel_talk_at_the_xen_user_summit_on/ 39. http://idontgetoutmuch.wordpress.com/2014/09/09/fun-with-extended-kalman-filters-4/ 40. http://www.reddit.com/r/haskell/comments/2fwbhd/fun_with_extended_kalman_filters/ 41. http://stackoverflow.com/questions/25763412/why-does-ocaml-sometimes-require-eta-expansion 42. http://stackoverflow.com/questions/25751194/can-haskell-evaluate-and-not-garbage-collect-random-indexes-in-a-list 43. http://stackoverflow.com/questions/25765893/how-do-i-install-dependencies-when-cross-compiling-haskell-code 44. http://stackoverflow.com/questions/25773444/haskell-lenses-how-to-make-view-play-nicely-with-traverse 45. http://stackoverflow.com/questions/25814489/is-there-an-instance-of-monad-but-not-of-monadfix 46. http://stackoverflow.com/questions/25827271/how-can-the-continuation-monad-be-expressed-using-the-free-monad 47. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From tom.schrijvers at cs.kuleuven.be Mon Sep 22 15:34:12 2014 From: tom.schrijvers at cs.kuleuven.be (Tom Schrijvers) Date: Mon, 22 Sep 2014 17:34:12 +0200 Subject: [Haskell] Postdoctoral Position in Programming Languages at KU Leuven Message-ID: Postdoctoral Position in Programming Languages at KU Leuven The Declarative Languages and Artificial Intelligence (DTAI) group of KU Leuven (Belgium) invites applicants for a postdoctoral position in the area of programming languages. This position has been created at the occasion of the new appointment of prof. Tom Schrijvers as research professor at KU Leuven. The position's aim is to reinforce the research activities in functional programming, logic programming and/or programming language theory. To apply you must hold a recent PhD (or be about to graduate) in one of the above areas of programming languages. Candidates are expected to have high-quality publications in peer-reviewed conferences and journals. The postdoc will work closely with prof. Schrijvers and his PhD students, participate in ongoing research activities and enjoy the freedom to develop new lines of research. The position is for 2 x 1 year and can be further extended. The salary is competitive and the starting date negotiable. Moreover, KU Leuven's policy of equal opportunities and diversity applies to this position. Please send your application to prof. Tom Schrijvers (tom dot schrijvers at cs dot kuleuven dot be) by October 15, 2014. Your application should contain: - A cover letter explaining your interest in the position. - Your curriculum vitae. - A short research statement (max. 3 pages). - The names and contact details of three people who can, if asked, write letters of reference. -------------- next part -------------- An HTML attachment was scrubbed... URL: From iago.abal at gmail.com Tue Sep 23 08:14:39 2014 From: iago.abal at gmail.com (Iago Abal) Date: Tue, 23 Sep 2014 10:14:39 +0200 Subject: [Haskell] ANNOUNCE: bv-0.3.0 Message-ID: I am pleased to announce a new release of the bv package, a library for bit-vector arithmetic. http://hackage.haskell.org/package/bv This is essentially a maintenance release to support newest versions of GHC and base. Yet, I took the opportunity to do some code and documentation clean up. A changelog is available at https://bitbucket.org/iago/bv-haskell/src/v0.3.0/CHANGES.md. Iago -------------- next part -------------- An HTML attachment was scrubbed... URL: From ylies.falcone at ujf-grenoble.fr Tue Sep 23 13:21:26 2014 From: ylies.falcone at ujf-grenoble.fr (Ylies Falcone) Date: Tue, 23 Sep 2014 09:21:26 -0400 Subject: [Haskell] Last CFP: ACM Symposium on Applied Computing Software Verification and Testing Track Message-ID: ================================================== 30th Annual ACM Symposium on Applied Computing Software Verification and Testing Track April 13 - 17, 2015, Salamanca, Spain More information: http://fmt.cs.utwente.nl/conferences/sac-svt2015/ and http://www.acm.org/conferences/sac/sac2015/ =================================================== Important dates --------------- * September 26, 2014: Submission of regular papers -- EXTENDED * November 17, 2014: Notification of paper acceptance/rejection * December 8, 2014: Camera-ready copies of accepted papers ACM Symposium on Applied Computing ---------------------------------- The ACM Symposium on Applied Computing (SAC) has gathered scientists from different areas of computing over the past twenty-nine years. The forum represents an opportunity to interact with different communities sharing an interest in applied computing. SAC 2015 is sponsored by SIGAPP and will be held at the UNESCO world heritage city of Salamanca in Spain. Software Verification and Testing Track --------------------------------------- We invite authors to submit new results in formal verification and testing, as well as development of technologies to improve the usability of formal methods in software engineering. Also welcome are detailed descriptions of applications of mechanical verification to large scale software. Possible topics include, but are not limited to: - model checking - theorem proving - correct by construction development - model-based testing - verification-based testing - symbolic execution - static and run-time analysis - abstract interpretation - analysis methods for dependable systems - software certification and proof carrying code - fault diagnosis and debugging - verification of large scale software systems - real world applications and case studies applying software verification Submissions Guidelines ---------------------- Paper submissions must be original, unpublished work. Submissions should be in electronic format, via the START site: http://www.acm.org/conferences/sac/sac2015/Paper-SubmissionUploadPage.htm Author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be avoided and made in the third person. Submitted paper will undergo a blind review process. Authors of accepted papers should submit an editorial revision of their papers that fits within six two-column pages (an extra two pages, to a total of eight pages, may be available at a charge). Please comply to this page limitation already at submission time. Accepted papers will be published in the ACM SAC 2015 proceedings. Paper registration is required, allowing the inclusion of the paper/poster in the conference proceedings. An author or a proxy attending SAC MUST present the paper. This is a requirement for the paper/poster to be included in the ACM/IEEE digital library. No-show of scheduled papers and posters will result in excluding them from the ACM/IEEE digital library. A special issue of Science of Computer Programming has been confirmed. Selected papers will be invited for submission, and will be peer-reviewed according to the standard policy of Science of Computer Programming. Student Research Competition ---------------------------- As before, SAC 2015 organises a Student Research Competition (SRC) Program to provide graduate students the opportunity to meet and exchange ideas with researchers and practitioners in their areas of interest. Guidelines and information about the SRC program can be found at http://www.acm.org/conferences/sac/sac2015/. Submission to the SRC program should be in electronic form via the following website http://www.acm.org/conferences/sac/sac2015/SRC-SubmissionUploadPage.htm Program Committee ----------------- Laura Brandan Briones, National University of Cordoba, Argentina Maximiliano Cristi?, Universidad Nacional de Rosario, Argentina Marco Faella, University of Naples, Italy Ylies Falcone, University of Grenoble Alpes, France Tingting Han, University of London, UK Fabrice Kordon, University Pierre et Marie Curie, France Stefan Leue, University of Konstanz, Germany Shaoying Liu, Hosei University, Japan Malte Lochau, Darmstadt University, Germany Annabelle McIver, Macquarie University, Australia Mercedes Merayo, Universidad Complutense de Madrid, Spain Dominique Mery, University of Lorraine, France Mohammad Mousavi, Halmstad University, Sweden Brian Nielsen, Aalborg University, Denmark Jun Pang, University of Luxembourg, Luxembourg Corina Pasareanu, NASA Ames, USA Wishnu Prasetya, Utrecht University, The Netherlands Marjan Sirjani, Reykjavik University, Iceland Hasan S?zer, ?zyegin University, Turkey Tanja Vos, Valencia University, Spain Anton Wijs, Eindhoven University of Technology, The Netherlands Liu Yang, Nanyang Technological University, Singapore Gianluigi Zavattaro, University of Bologna, Italy Lijun Zhang, Chinese Academy of Sciences, China Program Committee Chairs ----------------- Gwen Salaun, University of Grenoble Alpes, France Marielle Stoelinga, University of Twente, Netherlands From jtd at galois.com Tue Sep 23 22:59:39 2014 From: jtd at galois.com (Jonathan Daugherty) Date: Tue, 23 Sep 2014 15:59:39 -0700 Subject: [Haskell] [ANN] cabal-dev officially deprecated in favor of cabal sandboxes Message-ID: <20140923225938.GB52475@galois.com> Greetings, I'm pleased to announce (really!) that cabal-dev is being deprecated in favor of cabal sandboxes. Cabal sandboxes have been around long enough that it's clear that cabal-dev has served its purpose and we are left in good hands with the newer Cabal features. As a result: * No further cabal-dev releases will be pushed to Hackage. * For the sake of at least keeping the codebase buildable for those depending on it, we will accept pull requests adjusting version bounds in the cabal file on the cabal-dev repository at https://github.com/creswick/cabal-dev * If you are still using cabal-dev, we strongly encourage you to migrate to sandboxes. 'cabal sandbox' is a fantastic alternative; migrating to it is just about as simple as rm -r cabal-dev && cabal sandbox init && cabal install * If you need assistance using 'cabal sandbox', a very good introduction (and cabal-dev migration guide!) can be found at http://coldwa.st/e/blog/2013-08-20-Cabal-sandbox.html Huge thanks are due to the Cabal contributors who worked to implement sandboxing support. We are all better off with having these features moved into Cabal proper. I would also like to thank Rogan Creswick (of Galois) and Josh Hoyt (of Twitter) who implemented cabal-dev, and of course we received many community contributions to improve the project; thanks to everyone! If you depend heavily on cabal-dev and are interested in maintaining it on your own, please don't hesitate to get in touch. Thanks! -- Jonathan Daugherty Software Engineer Galois, Inc. From keller at cse.unsw.edu.au Wed Sep 24 06:06:01 2014 From: keller at cse.unsw.edu.au (Gabriele Keller) Date: Wed, 24 Sep 2014 16:06:01 +1000 Subject: [Haskell] JFP special issue on parallel and concurrent FP Message-ID: Hi, If you?re working on parallel or concurrent FP, please consider submitting an article to this special issue of JFP, Cheers, Gabriele ------------------------------------------------------------------------------ CALL FOR PAPERS JFP Special Issue on Parallel and Concurrent Programming Submission Deadline: 22 December 2014 Expected Publication Date: November/December issue 2015 * Scope Functional languages are uniquely suited to provide programmers with a programming model for parallel and concurrent computing. This is reflected in the wide range of work that is currently underway, both on parallel and concurrent functional languages, but also on bringing functional language features to other programming languages. This has resulted in a rapidly growing number of practical applications. The Journal of Functional Programming will devote a special issue to functional programming for concurrent and parallel computing. The purpose of this special issue is to showcase the state of the art on how functional languages and functional concepts currently assist programmers with the task of managing the challenges of creating parallel and concurrent systems. Language designers as well as systems builders and application programmers are invited to submit papers describing the current state of the art of language support and experiences with functional programming in building real-world systems. We encourage the submission of consolidated, condensed and extended work based on prior conference and workshop publications. * Submission Details Manuscripts should be submitted in PDF format by email to one of the guest editors (see addresses below). For other submission and formatting details, please consult the Journal of Functional Programming website. Guest Editors --------------------------------------------------------------------------------- Gabriele Keller Fritz Henglein keller @cse.unsw.edu.au henglein at diku.dk School of Computer Science & Engineering Department of Computer Science (DIKU) UNSW Sydney NSW 2052 University of Copenhagen and Universitetsparken 5 The Software Systems Research Group@ NICTA DK-2100 Copenhagen Australia Denmark --------------------------------------------------------------------------------- From Graham.Hutton at nottingham.ac.uk Wed Sep 24 07:30:21 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Wed, 24 Sep 2014 08:30:21 +0100 Subject: [Haskell] Nottingham Research Fellowships (deadline 20th October) Message-ID: <237518B0-E0BB-43FA-A309-17361A517865@exmail.nottingham.ac.uk> Dear all, The University of Nottingham is seeking applications for a number of Nottingham Research Fellowships: http://tinyurl.com/notts-fellows These are highly prestigious three-year fellowships, which are normally expected to lead into permenant academic positions. Candidates should have no more than 8 years postdoctoral experience, and fellowships normally start in October 2015. The deadline for submission of initial Expressions of Interest is ** 20th October 2014 **. Applicants in the area of the Functional Programming (FP) lab would be most welcome. The FP lab is keen to receive applications from outstanding candidates with an excellent publication record, experience in combining theory with practice, and the ability to secure external funding to support their research. Further information about the FP lab is available from http://fp.cs.nott.ac.uk As an approximate guideline, candidates in the area of the FP lab would normally be expected to have at least 3 years postdoc experience, and a number of strong publications in leading international venues such as ICFP, POPL, LICS, JFP, Haskell Symposium, etc. Best wishes, Graham Hutton -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh 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 mail at nh2.me Wed Sep 24 10:45:52 2014 From: mail at nh2.me (=?windows-1252?Q?Niklas_Hamb=FCchen?=) Date: Wed, 24 Sep 2014 12:45:52 +0200 Subject: [Haskell] [ANN] cabal-dev officially deprecated in favor of cabal sandboxes In-Reply-To: <20140923225938.GB52475@galois.com> References: <20140923225938.GB52475@galois.com> Message-ID: <5422A0E0.60801@nh2.me> On 24/09/14 00:59, Jonathan Daugherty wrote: > I'm pleased to announce (really!) that cabal-dev is being deprecated in > favor of cabal sandboxes. It might also make sense to tag http://hackage.haskell.org/package/cabal-dev as a deprecated package. From jtd at galois.com Wed Sep 24 16:49:00 2014 From: jtd at galois.com (Jonathan Daugherty) Date: Wed, 24 Sep 2014 09:49:00 -0700 Subject: [Haskell] [ANN] cabal-dev officially deprecated in favor of cabal sandboxes In-Reply-To: <5422A0E0.60801@nh2.me> References: <20140923225938.GB52475@galois.com> <5422A0E0.60801@nh2.me> Message-ID: <20140924164900.GN11699@galois.com> > It might also make sense to tag > http://hackage.haskell.org/package/cabal-dev as a deprecated package. Done. Thanks! -- Jonathan Daugherty Software Engineer Galois, Inc. From dstcruz at gmail.com Thu Sep 25 03:54:24 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 24 Sep 2014 21:54:24 -0600 Subject: [Haskell] Haskell Weekly News: Issue 307 Message-ID: Welcome to issue 307 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from September 14 to 20, 2014 Quotes of the Week * Qfwfq: I seq what you mean. * trap_exit_: if haskell makes programmers 10x more productive, then why are there not better haskell ides? :-) Fuuzetsu: trap_exit_: because you don't need one when you're 10x more productive already ;P * joshcough: im just surprised when im looking for something and i dont find a package by ed kmett. Top Reddit Stories * Wayward Tide is Being Written in Haskell Domain: blog.chucklefish.org, Score: 131, Comments: 30 Original: [1] http://goo.gl/00xr22 On Reddit: [2] http://goo.gl/kJBqTe * Hython: The simplest possible language Domain: callcc.io, Score: 82, Comments: 16 Original: [3] http://goo.gl/T95xQ3 On Reddit: [4] http://goo.gl/LBKTks * Hey /r/haskell, we're hiring! Domain: blog.chucklefish.org, Score: 79, Comments: 49 Original: [5] http://goo.gl/93gW3N On Reddit: [6] http://goo.gl/zULSci * hindent: A Haskell indenter Domain: chrisdone.com, Score: 58, Comments: 18 Original: [7] http://goo.gl/4XlJpL On Reddit: [8] http://goo.gl/SCXxOS * Reflecting strictness in Haskell types Domain: h2.jaguarpaw.co.uk, Score: 51, Comments: 27 Original: [9] http://goo.gl/lfPkYD On Reddit: [10] http://goo.gl/hx6XtM * Towards Shake 1.0 Domain: neilmitchell.blogspot.com, Score: 49, Comments: 7 Original: [11] http://goo.gl/RPlddo On Reddit: [12] http://goo.gl/ckKD2m * Formatting in Haskell (Chris Done) Domain: chrisdone.com, Score: 49, Comments: 11 Original: [13] http://goo.gl/eq7hAF On Reddit: [14] http://goo.gl/f1Amec * Haskell Dice of Doom - Part 1 Domain: derekmcloughlin.github.io, Score: 39, Comments: 6 Original: [15] http://goo.gl/oF3ot3 On Reddit: [16] http://goo.gl/oLz2Fv * Beginner error messages in C++ vs Haskell Domain: izbicki.me, Score: 39, Comments: 65 Original: [17] http://goo.gl/j05AXH On Reddit: [18] http://goo.gl/ZOLvZW * Blog: GHC Weekly News - 2014/09/15 Domain: ghc.haskell.org, Score: 28, Comments: 0 Original: [19] http://goo.gl/8Dt0e8 On Reddit: [20] http://goo.gl/P4uz3y * Let's Build a Browser Engine in Haskell: part 3 Domain: hrothen.github.io, Score: 27, Comments: 8 Original: [21] http://goo.gl/0ckGRH On Reddit: [22] http://goo.gl/vZXZOy * ANN: best-haskell - haskell download ranking Domain: best-haskell.herokuapp.com, Score: 24, Comments: 11 Original: [23] http://goo.gl/9RtgrI On Reddit: [24] http://goo.gl/3zO7SN * ICFP "The Ghost of Church" - writeup by Olle Fredriksson who was the first to solve it! Domain: reddit.com, Score: 23, Comments: 3 Original: [25] http://goo.gl/9j7hG3 On Reddit: [26] http://goo.gl/nDxc4T * What is wrong with the Monoid instance for Maybe? Domain: self.haskell, Score: 21, Comments: 21 Original: [27] http://goo.gl/kgVlFf On Reddit: [28] http://goo.gl/kgVlFf * Inferring Algebraic Effects Domain: lmcs-online.org, Score: 20, Comments: 0 Original: [29] http://goo.gl/Wjklhq On Reddit: [30] http://goo.gl/PBJY7N * Are typeclasses essential? (includes Luke Palmer's view on it) Domain: stackoverflow.com, Score: 19, Comments: 30 Original: [31] http://goo.gl/5rh2dq On Reddit: [32] http://goo.gl/RuX5i7 * Built on Haskell: Findmelike - visual search for art Domain: findmelike.com, Score: 19, Comments: 1 Original: [33] http://goo.gl/MgM69t On Reddit: [34] http://goo.gl/Vzrc6R * Let's Build a Browser Engine in Haskell: setting up tests Domain: hrothen.github.io, Score: 17, Comments: 9 Original: [35] http://goo.gl/qwLXRq On Reddit: [36] http://goo.gl/mUqX6w Top StackOverflow Questions * Are typeclasses essential? votes: 20, answers: 4 Read on SO: [37] http://goo.gl/5rh2dq * Ambigous instance resolution in Haskell votes: 14, answers: 2 Read on SO: [38] http://goo.gl/KzV5jC * Understanding the casts involved in patterns matching a datatype that is indexed over a user defined kind votes: 11, answers: 1 Read on SO: [39] http://goo.gl/TppaAg * What does fixIO do? votes: 10, answers: 2 Read on SO: [40] http://goo.gl/yECrrk Until next time, [41]+Daniel Santa Cruz References 1. http://blog.chucklefish.org/?p=154 2. http://www.reddit.com/r/haskell/comments/2glk10/wayward_tide_is_being_written_in_haskell/ 3. http://callcc.io/hython-the-simplest-possible-language/ 4. http://www.reddit.com/r/haskell/comments/2go4v6/hython_the_simplest_possible_language/ 5. http://blog.chucklefish.org/?p=322 6. http://www.reddit.com/r/haskell/comments/2gyn1w/hey_rhaskell_were_hiring/ 7. http://chrisdone.com/posts/hindent 8. http://www.reddit.com/r/haskell/comments/2gyaw7/hindent_a_haskell_indenter/ 9. http://h2.jaguarpaw.co.uk/posts/strictness-in-types/ 10. http://www.reddit.com/r/haskell/comments/2gk51p/reflecting_strictness_in_haskell_types/ 11. http://neilmitchell.blogspot.com/2014/09/towards-shake-10.html 12. http://www.reddit.com/r/haskell/comments/2gnat7/towards_shake_10/ 13. http://chrisdone.com/posts/formatting 14. http://www.reddit.com/r/haskell/comments/2gyrvp/formatting_in_haskell_chris_done/ 15. http://derekmcloughlin.github.io/2014/09/13/Haskell-Dice-Of-Doom-Part-1/ 16. http://www.reddit.com/r/haskell/comments/2gg3um/haskell_dice_of_doom_part_1/ 17. https://izbicki.me/blog/error-messages-in-ghc-vs-g++.html 18. http://www.reddit.com/r/haskell/comments/2go92u/beginner_error_messages_in_c_vs_haskell/ 19. https://ghc.haskell.org/trac/ghc/blog/weekly20140915 20. http://www.reddit.com/r/haskell/comments/2gia13/blog_ghc_weekly_news_20140915/ 21. http://hrothen.github.io/2014/09/19/lets-build-a-browser-engine-in-haskell-part-3/ 22. http://www.reddit.com/r/haskell/comments/2gw2bw/lets_build_a_browser_engine_in_haskell_part_3/ 23. http://best-haskell.herokuapp.com/ 24. http://www.reddit.com/r/haskell/comments/2gsjk0/ann_besthaskell_haskell_download_ranking/ 25. http://www.reddit.com/r/theghostofchurch/comments/2fccjw/i_found_this_trinket_by_a_rho_of_trees/ckh62js 26. http://www.reddit.com/r/haskell/comments/2gkjij/icfp_the_ghost_of_church_writeup_by_olle/ 27. http://www.reddit.com/r/haskell/comments/2guo44/what_is_wrong_with_the_monoid_instance_for_maybe/ 28. http://www.reddit.com/r/haskell/comments/2guo44/what_is_wrong_with_the_monoid_instance_for_maybe/ 29. http://www.lmcs-online.org/ojs/viewarticle.php?id=1469 30. http://www.reddit.com/r/haskell/comments/2gdl31/inferring_algebraic_effects/ 31. http://stackoverflow.com/questions/25855507/are-typeclasses-essential 32. http://www.reddit.com/r/haskell/comments/2gjqop/are_typeclasses_essential_includes_luke_palmers/ 33. http://findmelike.com/ 34. http://www.reddit.com/r/haskell/comments/2gn81y/built_on_haskell_findmelike_visual_search_for_art/ 35. http://hrothen.github.io/2014/09/14/lets-build-a-browser-engine-in-haskell-setting-up-tests/ 36. http://www.reddit.com/r/haskell/comments/2ge7om/lets_build_a_browser_engine_in_haskell_setting_up/ 37. http://stackoverflow.com/questions/25855507/are-typeclasses-essential 38. http://stackoverflow.com/questions/25854072/ambigous-instance-resolution-in-haskell 39. http://stackoverflow.com/questions/25934209/understanding-the-casts-involved-in-patterns-matching-a-datatype-that-is-indexed 40. http://stackoverflow.com/questions/25876042/what-does-fixio-do 41. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From neil.ghani at strath.ac.uk Thu Sep 25 15:16:52 2014 From: neil.ghani at strath.ac.uk (Neil Ghani) Date: Thu, 25 Sep 2014 15:16:52 +0000 Subject: [Haskell] 5Yr Research Fellowships Message-ID: <3CF31E6A-5A62-4C42-8F6D-D6812E3F9F49@strath.ac.uk> In the heart of Free Glasgow, in the soon to be People's Republic of Scotland, there is a chance to join the University of Strathclyde with a 5 year research fellowship leading to a permanent full time position. All you need is a 5-page research plan ? a lot less than many Fellowship avenues. The area is data science and/or security but we intend to interpret this broadly. Very broadly. More details can be found here. strathvacancies.co.uk All the best Neil From john.tromp at gmail.com Fri Sep 26 13:54:13 2014 From: john.tromp at gmail.com (John Tromp) Date: Fri, 26 Sep 2014 09:54:13 -0400 Subject: [Haskell] Haskell Digest, Vol 133, Issue 16 In-Reply-To: References: Message-ID: > In the heart of Free Glasgow, in the soon to be People's Republic of Scotland Correction: the formerly-soon-to-be People's Republic of Scotland. -John From michael at schmong.org Fri Sep 26 17:56:26 2014 From: michael at schmong.org (Michael Litchard) Date: Fri, 26 Sep 2014 10:56:26 -0700 Subject: [Haskell] Haskell Digest, Vol 133, Issue 16 In-Reply-To: References: Message-ID: Ouch. Ouchie. On Fri, Sep 26, 2014 at 6:54 AM, John Tromp wrote: > > In the heart of Free Glasgow, in the soon to be People's Republic of > Scotland > > Correction: the formerly-soon-to-be People's Republic of Scotland. > > -John > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Mon Sep 29 23:10:35 2014 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 30 Sep 2014 02:10:35 +0300 Subject: [Haskell] ETAPS 2015 final call for papers Message-ID: <20140930021035.3859d819@duality> ****************************************************************** CALL FOR PAPERS: ETAPS 2015 18th European Joint Conferences on Theory And Practice of Software London, UK, 11-18 April 2015 http://www.etaps.org/2015 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences, accompanied by satellite workshops. ETAPS 2015 is the eighteenth event in the series. -- MAIN CONFERENCES (13-17 April) -- * CC: Compiler Construction (PC chair Bj?rn Franke, University of Edinburgh, UK) * ESOP: European Symposium on Programming (PC chair Jan Vitek, Northeastern University, USA) * FASE: Fundamental Approaches to Software Engineering (PC chairs Alexander Egyed, Johannes Kepler U Linz, Austria, and Ina Schaefer, Technische Universit?t Braunschweig, Germany) * FOSSACS: Foundations of Software Science and Computation Structures (PC chair Andrew Pitts, University of Cambridge, UK) * POST: Principles of Security and Trust (PC chairs Riccardo Focardi, Universit? Ca' Foscari Venezia, Italy, and Andrew Myers, Cornell University, USA) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Christel Baier, Technische Univ Dresden, Germany, and Cesare Tinelli, The University of Iowa, USA) TACAS '15 will host the 4rd Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Robert Harper (Carnegie Mellon 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 Universitet, Sweden) -- IMPORTANT DATES -- * 10 October 2014: Submission deadline for abstracts * 17 October 2014: Submission deadline for full papers * 3-5 December 2014: Author response period (ESOP and FoSSaCS only) * 19 December 2014: Notification of acceptance * 16 January 2015: Camera-ready versions due -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. TACAS has more paper categories (see http://www.etaps.org/2015/tacas). A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference (HotCRP for ESOP). Submissions not adhering to the specified format and length may be rejected immediately. - Research papers FASE, FOSSACS and TACAS have a page limit of 15 pages for research papers, whereas CC, POST allow at most 20 pages and ESOP 25 pages. Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pages). Both TACAS and FASE solicit also regular tool papers (at most 15 pages). - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) ESOP and FOSSACS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (11-12 April, 18 April) -- Around 20 satellite workshops will take place before and after the main conferences. -- HOST CITY -- London, the capital city of England and the UK, 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 is one of the world's leading financial centers and a world cultural capital. It is the world's most-visited city as measured by international arrivals and has the world's largest city airport system measured by passenger traffic. In 2012, London became the first city to host the modern Summer Olympic Games three times. -- HOST INSTITUTION -- ETAPS 2015 is hosted by the School of Electrical Engineering and Computer Science of the Queen Mary University of London. The main campus is located in the Mile End area of the East End of London. -- ORGANIZERS * General chairs: Pasquale Malacaria, Nikos Tzevelekos * Workshops chair: Paulo Oliva -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at p.malacaria at qmul.ac.uk, nikos.tzevelekos at qmul.ac.uk.