June 2013 - Haskell - Haskell.org

Haskell Weekly News: Issue 270
by Daniel Santa Cruz 12 Jun '13

12 Jun '13

Welcome to issue 270 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 2 to 8, 2013. Quotes of the Week * shachaf: getLine :: IO String contains a String in the same way /bin/ls contains a list of files. Top Reddit Stories * Haskell's HLearn library cross-validates more than 400x faster than Java's Weka due to new monoid based algorithm Domain: izbicki.me, Score: 86, Comments: 13 On Reddit: [1] http://goo.gl/dAoe5 Original: [2] http://goo.gl/dLZJv * FP Complete Launches Haskell in Real World Competition with $1,000 Cash Prize Each Month Domain: fpcomplete.com, Score: 80, Comments: 10 On Reddit: [3] http://goo.gl/FthPX Original: [4] http://goo.gl/pzgQ2 * So I write compilers for a living now Domain: evincarofautumn.blogspot.it, Score: 76, Comments: 69 On Reddit: [5] http://goo.gl/hXp0G Original: [6] http://goo.gl/wMaab * Haskell for all: pipes-parse-1.0.0: Pushback, delimited parsers, resumable parsing, and lenses Domain: haskellforall.com, Score: 55, Comments: 77 On Reddit: [7] http://goo.gl/U3MzG Original: [8] http://goo.gl/3wEJ7 * "Thank you to the Haskell community for encouraging programmers to explore the relationship between algebra and programming." -- My accepted paper at the International Conference of Machine Learning (ICML13) Domain: jmlr.org, Score: 54, Comments: 3 On Reddit: [9] http://goo.gl/Ni0oF Original: [10] http://goo.gl/klOzM * GHCJS introduction – Concurrent Haskell in the browser, by Luite Stegeman Domain: weblog.luite.com, Score: 54, Comments: 27 On Reddit: [11] http://goo.gl/l9LDH Original: [12] http://goo.gl/avaez * Haskell from C: Where are the for Loops? Domain: fpcomplete.com, Score: 46, Comments: 28 On Reddit: [13] http://goo.gl/YqkSU Original: [14] http://goo.gl/pwYB3 * fficxx - FFI to C++ in Haskell Domain: ianwookim.org, Score: 45, Comments: 12 On Reddit: [15] http://goo.gl/y1awM Original: [16] http://goo.gl/wHF2U * Control.Category: now with kind polymorphism Domain: neocontra.blogspot.com, Score: 42, Comments: 7 On Reddit: [17] http://goo.gl/9gb6f Original: [18] http://goo.gl/ALvld * Pixel art editor in 600 lines of Haskell Domain: github.com, Score: 39, Comments: 5 On Reddit: [19] http://goo.gl/gmFOF Original: [20] http://goo.gl/w8yEg * Haskell for all: pipes-concurrency-1.2.0: Behaviors and broadcasts Domain: haskellforall.com, Score: 35, Comments: 35 On Reddit: [21] http://goo.gl/rojk1 Original: [22] http://goo.gl/aNK8l * Mastermind in Agda, Running in the Browser Domain: people.inf.elte.hu, Score: 28, Comments: 0 On Reddit: [23] http://goo.gl/N8yty Original: [24] http://goo.gl/7lhvT * Bittoll: A bitcoin transaction system written in Haskell. Domain: bittoll.com, Score: 25, Comments: 13 On Reddit: [25] http://goo.gl/9MFXB Original: [26] http://goo.gl/q39ps * standalone-haddock: host your Haskell documentation on your website Domain: feuerbach.github.io, Score: 22, Comments: 7 On Reddit: [27] http://goo.gl/dAsmP Original: [28] http://goo.gl/INyIe Top StackOverflow Questions * What is () in Haskell, exactly? votes: 18, answers: 4 Read on SO: [29] http://goo.gl/XkrXD * Haskell pre-monadic I/O votes: 15, answers: 1 Read on SO: [30] http://goo.gl/oryYA * Display function types in Haskell votes: 12, answers: 1 Read on SO: [31] http://goo.gl/qOtpV * Haskell Pattern Matching Fails on Negative Number votes: 12, answers: 2 Read on SO: [32] http://goo.gl/mw4WF * Debugging performance bottlenecks for longest common subsequence algorithm votes: 11, answers: 1 Read on SO: [33] http://goo.gl/mfa8S * What is a shrink, with regard to Haskell's QuickCheck? votes: 11, answers: 2 Read on SO: [34] http://goo.gl/eLlyO * Cross module optimizations in GHC votes: 10, answers: 1 Read on SO: [35] http://goo.gl/RyFQP * Functional composition with multi-valued functions in haskell? votes: 9, answers: 3 Read on SO: [36] http://goo.gl/10Xvd * A more succinct way to map functions onto fields of an algebraic datatype? votes: 9, answers: 1 Read on SO: [37] http://goo.gl/CfIOa * What's the history behind the Functor type class? votes: 8, answers: 1 Read on SO: [38] http://goo.gl/5BwZS Until next time, [39]+Daniel Santa Cruz References 1. http://izbicki.me/blog/hlearn-cross-validates-400x-faster-than-weka 2. http://www.reddit.com/r/haskell/comments/1fl33k/haskells_hlearn_library_cro… 3. http://www.fpcomplete.com/blog/2013/06/call-for-submissions 4. http://www.reddit.com/r/haskell/comments/1fvtbf/fp_complete_launches_haskel… 5. http://evincarofautumn.blogspot.it/2012/07/so-i-write-compilers-for-living-… 6. http://www.reddit.com/r/haskell/comments/1fsbs2/so_i_write_compilers_for_a_… 7. http://www.haskellforall.com/2013/06/pipes-parse-100-pushback-delimited.html 8. http://www.reddit.com/r/haskell/comments/1fjcpg/haskell_for_all_pipesparse1… 9. http://jmlr.org/proceedings/papers/v28/izbicki13.pdf 10. http://www.reddit.com/r/haskell/comments/1fk8fl/thank_you_to_the_haskell_co… 11. http://weblog.luite.com/wordpress/?p=14 12. http://www.reddit.com/r/haskell/comments/1fvv5q/ghcjs_introduction_concurre… 13. https://www.fpcomplete.com/blog/2013/06/haskell-from-c 14. http://www.reddit.com/r/haskell/comments/1fm55g/haskell_from_c_where_are_th… 15. http://ianwookim.org/fficxx/ 16. http://www.reddit.com/r/haskell/comments/1fy5gy/fficxx_ffi_to_c_in_haskell/ 17. http://neocontra.blogspot.com/2013/06/controlcategory-now-with-kind.html 18. http://www.reddit.com/r/haskell/comments/1fjjt0/controlcategory_now_with_ki… 19. https://github.com/mchakravarty/BigPixel 20. http://www.reddit.com/r/haskell/comments/1fqyrk/pixel_art_editor_in_600_lin… 21. http://www.haskellforall.com/2013/06/pipes-concurrency-120-behaviors-and.ht… 22. http://www.reddit.com/r/haskell/comments/1ft1sc/haskell_for_all_pipesconcur… 23. http://people.inf.elte.hu/divip/mastermind/index.html 24. http://www.reddit.com/r/haskell/comments/1fx4rb/mastermind_in_agda_running_… 25. https://www.bittoll.com/ 26. http://www.reddit.com/r/haskell/comments/1fqtmu/bittoll_a_bitcoin_transacti… 27. http://feuerbach.github.io/standalone-haddock/ 28. http://www.reddit.com/r/haskell/comments/1fuw5n/standalonehaddock_host_your… 29. http://stackoverflow.com/questions/16892570/what-is-in-haskell-exactly 30. http://stackoverflow.com/questions/17002119/haskell-pre-monadic-i-o 31. http://stackoverflow.com/questions/16971221/display-function-types-in-haske… 32. http://stackoverflow.com/questions/16976543/haskell-pattern-matching-fails-… 33. http://stackoverflow.com/questions/16952956/debugging-performance-bottlenec… 34. http://stackoverflow.com/questions/16968549/what-is-a-shrink-with-regard-to… 35. http://stackoverflow.com/questions/16908539/cross-module-optimizations-in-g… 36. http://stackoverflow.com/questions/16888222/functional-composition-with-mul… 37. http://stackoverflow.com/questions/16974868/a-more-succinct-way-to-map-func… 38. http://stackoverflow.com/questions/16880577/whats-the-history-behind-the-fu… 39. https://plus.google.com/105107667630152149014/about

1 0

Reminder: two weeks to submit talks for CUFP 2013
by Simon Marlow 12 Jun '13

12 Jun '13

This CFP and the form for submitting presentation proposals can be found at: http://cufp.org/2013cfp Commercial Users of Functional Programming 2013 Sponsored by SIGPLAN CUFP 2013 Co-located with ICFP 2013 Boston, MA, United States Sep 22-24 Talk Proposal Submission Deadline: 29 June 2013 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We are looking for both experience reports and in-depth technical talks. Experience reports are typically 25 minutes long (but negotiable), and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long (also negotiable), and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, please fill in the form at the end of this page by 29 June 2013. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Note that we will need all presenters to register for the CUFP workshop and travel to Boston at their own expense. Program Committee Marius Eriksen (Twitter, Inc), co-chair Mike Sperber (Active Group), co-chair Mary Sheeran (Chalmers) Andres Löh (Well-Typed) Thomas Gazagnaire (OCamlPro) Steve Vinoski (Basho) Jorge Ortiz (Foursquare, Inc.) Blake Matheny (Tumblr, Inc.) Simon Marlow (Facebook, Inc.) More information For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly.

1 0

ANN: ZuriHac 2013 & FP Afternoon with keynote by Simon Marlow
by Bas van Dijk 10 Jun '13

10 Jun '13

Dear Haskellers, we are delighted to announce ZuriHac 2013 and a Zurich FP Afternoon. Zurich FP Afternoon 2013 ------------------------ When: Thursday 29 August Where: ETH, Zurich, Switzerland Half a day of talks by FP practitioners, with Simon Marlow giving the keynote speech. ZuriHac 2013 ------------ When: Thursday 30 August - Friday 1 September Where: Erudify offices, Zurich, Switzerland An international, grassroots, collaborative coding festival with a simple focus, to build and improve Haskell libraries, tools, and infrastructure. This is a great opportunity to meet your fellow Haskellers in real life, find new contributors for your project, improve existing libraries and tools, or even start new ones! Registration ------------ If you wish to attend one or both events, please register by filling in this form: http://bit.ly/ZuriHac2013Reg Please note that we have a limited number of places for the Hackathon -- first come, first served. Arrangements ------------ Full details, including accommodation arrangements, can be found on the wiki page: http://www.haskell.org/haskellwiki/ZuriHac2013 We look forward to seeing you there! -- The organisers of ZuriHac 2013 ZuriHac 2013 is sponsored by Erudify and ETH

1 0

Final call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13)
by Hongseok Yang 10 Jun '13

10 Jun '13

---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2013 AT mpi-sws.org. Deadline for talk proposals: June 14, 2013 (Friday) Notification of acceptance: July 28, 2013 (Sunday) Workshop: September 28, 2013 (Saturday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2013 --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale)

1 0

ACM SIGPLAN Erlang Workshop 2013 Final Call For Papers
by Laura M. Castro 07 Jun '13

07 Jun '13

Hello, Please find below the Final Call for Papers for the Twelfth ACM SIGPLAN Erlang Workshop. Apologies for any duplicates you may receive. CALL FOR PAPERS ================= Twelfth ACM SIGPLAN Erlang Workshop ----------------------------------------------------------- Boston, Massachusetts, September 28, 2013 Satellite event of the 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013) September 25-27, 2013 Erlang is a concurrent, distributed functional programming language aimed at systems with requirements of massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for 15 years, creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, databases, and computer telephony and messaging. Erlang programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. We invite three types of submissions. 1. Technical papers describing language extensions, critical discussions of the status quo, formal semantics of language constructs, program analysis and transformation, virtual machine extensions and compilation techniques, implementations and interfaces of Erlang in/with other languages, and new tools (profilers, tracers, debuggers, testing frameworks, etc.). The maximum length for technical papers is restricted to 12 pages. 2. Practice and application papers describing uses of Erlang in the "real-world", Erlang libraries for specific tasks, experiences from using Erlang in specific application domains, reusable programming idioms and elegant new ways of using Erlang to approach or solve a particular problem. The maximum length for the practice and application papers is restricted to 12 pages. Note that this is a maximum length; we welcome shorter papers also, and the program committee will evaluate all papers on an equal basis independent of their lengths. 3. Poster presentations describing topics related to the workshop goals. Each includes a maximum of 2 pages of the abstract and summary. Presentations in this category will be given an hour of shared simultaneous demonstration time. Workshop Chair ----------------------- Steve Vinoski, Basho Technologies, USA Program Chair ------------------- Laura M. Castro, University of A Coruña, Spain Program Committee ----------------------------- (Note: the Workshop and Program Chairs are also committee members) Lars-Ake Fredlund, Universidad Politécnica de Madrid, Spain Kevin Hammond, University of St. Andrews, UK Torben Hoffman, Erlang Solutions Limited, UK Zoltán Horváth, Eötvös Loránd University, Hungary Kenneth Lundin, Ericsson AB, Sweden Mickaël Rémond, ProcessOne, France Kenji Rikitake, Basho Japan KK, Japan Simon Thompson, University of Kent, UK Important Dates ----------------------- Submission deadline: Fri June 14, 2013 Author notification: Thu July 11, 2013 Final submission for the publisher: Thu July 25, 2013 Workshop date (tentative, subject to change): September 28, 2013 Instructions to authors -------------------------------- Papers must be submitted online via EasyChair (via the "Erlang2013" event). The submission page is https://www.easychair.org/conferences/?conf=erlang2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Each submission must adhere to SIGPLAN's republication policy. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Paper submissions will be considered for poster submission in the case they are not accepted as full papers. Venue & Registration Details ------------------------------------------ For registration, please see the ICFP 2013 web site at: http://icfpconference.org/icfp2013/ Related Links -------------------- ICFP 2013 web site: http://www.icfpconference.org/icfp2013/ Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/ Open Source Erlang: http://www.erlang.org/ EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=erlang2013 Author Information for SIGPLAN Conferences: http://www.sigplan.org/authorInformation.htm -- Laura M. Castro

1 0

mail Craig Ugoretz
by Craig Ugoretz 07 Jun '13

07 Jun '13

http://www.kompmaster.org/xyzgxad/qwtziefuviipfth

1 0

ML workshop 2013: Call for presentations
by Daan Leijen 07 Jun '13

07 Jun '13

ACM SIGPLAN Workshop on ML Sunday, September 22, 2013, Boston MA (co-located with ICFP) http://research.microsoft.com/en-us/um/people/daan/mlworkshop2013 ======================================================================= The ML family of programming languages includes dialects known as Standard ML, OCaml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum where users, developers and researchers of ML languages and related technology can interact and discuss ongoing research, open problems and innovative applications. The ML workshop has adopted an informal model since 2010. It is a workshop with presentations selected from submitted abstracts. There are no published proceedings, so any contributions may be submitted for publication elsewhere. We hope that this format encourages the presentation of exciting (if unpolished) research and deliver a lively workshop atmosphere. SCOPE ----- We seek research presentations on topics related to ML, including but not limited to * Applications: case studies, experience reports, pearls, etc. * Extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * Type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * Implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * Environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * Semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Three kinds of submissions will be accepted: Research Presentations, Experience Reports and Demos. * Research Presentations: Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users. * Experience Reports: Users are invited to submit Experience Reports about their use of ML languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve. * Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.) Each presentation should take 20-25 minutes, except demos, which should take 10-15 minutes. The exact time will be decided based on the number of accepted submissions. SUBMISSION INSTRUCTIONS ----------------------- Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Submissions longer than a half a page should include a one-paragraph synopsis suitable for inclusion in the workshop program. Submissions must be uploaded to the following website before the submission deadline (2013-06-21): https://www.easychair.org/conferences/?conf=ml2013 For any question concerning the scope of the workshop or the submission process, please contact the program chair (daan at microsoft.com) IMPORTANT DATES --------------- * Friday, June 21 : Submission * Monday, July 22 : Notification * Sunday, September 22: Workshop PROGRAM COMMITTEE ----------------- Daan Leijen (chair) (Microsoft Research, US) Jesse A. Tov (Harvard University, US) Derek Dreyer (MPI-SWS, Germany) Atsushi Ohori (Univ. of Tohoku, Japan) Lars Bergstrom (Univ. of Chicago, US) Jean Yang (MIT CSAIL, US) Gavin Bierman (Microsoft Research, Cambridge, UK) Tomas Petricek (Univ. of Cambridge, UK) Yukiyoshi Kameyama (Univ. of Tsukuba, Japan) Peter Thiemann (Univ. of Freiburg, Germany) STEERING COMMITTEE ------------------ Matthew Fluet (Rochester Institute of Technology) Alain Frisch (LexiFi) Jacques Garrigue (Nagoya University) Yaron Minsky (Jane Street) Greg Morrisett (Harvard University) Andreas Rossberg (chair, Google) Chung-chieh Shan (Indiana University)

1 0

PPDP'13: Last call for papers
by Tom Schrijvers 06 Jun '13

06 Jun '13

===================================================================== Last Call for Papers 15th International Symposium on Principles and Practice of Declarative Programming PPDP 2013 Special Issue of Science of Computer Programming (SCP) Madrid, Spain, September 16-18, 2013 (co-located with LOPSTR 2013) http://users.ugent.be/~tschrijv/PPDP2013/ ====================================================================== PPDP 2013 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to: * Functional programming * Logic programming * Answer-set programming * Functional-logic programming * Declarative visual languages * Constraint Handling Rules * Parallel implementation and concurrency * Monads, type classes and dependent type systems * Declarative domain-specific languages * Termination, resource analysis and the verification of declarative programs * Transformation and partial evaluation of declarative languages * Language extensions for security and tabulation * Probabilistic modelling in a declarative language and modelling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 23nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2013) and held in cooperation with ACM SIGPLAN. The conference will be held in Madrid, Spain. Previous symposia were held at Leuven (Belgium), Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings will be published in the ACM International Conference Proceedings Series. After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2014. Important Dates Abstract Submission: June 10, 2013 Paper submission: June 13, 2013 Notification: July 18, 2013 Camera-ready: August 4, 2013 Symposium: September 16-18, 2013 Invites for SCP: October 2, 2013 Submission of SCP: December 11, 2013 Notification from SCP: February 22, 2014 Camera-ready for SCP: March 14, 2014 Authors should submit an electronic copy of the paper (written in English) in PDF. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. Papers should consist of no more than 12 pages, formatted following the ACM SIG proceedings template (option 1). The 12 page limit must include references but excludes well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Program Committee Sergio Antoy Portland State University, USA Manuel Carro IMDEA Software Institute, Spain Iliano Cervesato Carnegie Mellon University, Qatar Agostino Dovier Universita degli Studi di Udine, Italy Maria Garcia de la Banda Monash University, Australia Ralf Hinze University of Oxford, UK Yukiyoshi Kameyama University of Tsukuba, Japan Oleg Kiselyov USA Yanhong Annie Liu State University of New York at Stony Brook, USA Stefan Monnier Universite de Montreal, Canada Alan Mycroft University of Cambrige, UK Bruno C. d. S. Oliveira National University of Singapore, Singapore Alberto Pettorossi Universita di Roma Tor Vergata, Italy Enrico Pontelli New Mexico State University, USA Kristoffer Rose IBM Research, USA Sukyoung Ryu KAIST, South Korea Vitor Santos Costa University of Porto, Portugal Torsten Schaub University Potsdam, Germany Tom Schrijvers Ghent University, Belgium Martin Sulzmann Hochschule Karlsruhe, Germany Wouter Swierstra Universiteit Utrecht, The Netherlands Tarmo Uustalu Institute of Cybernetics, Estonia Janis Voigtlaender University of Bonn, Germany Meng Wang Chalmers University of Technology, Sweden Jan Wielemaker Universiteit van Amsterdam, The Netherlands Program Chair Tom Schrijvers Department of Applied Mathematics and Computer Science Ghent University 9000 Gent, Belgium General Chair Ricardo Pena Facultad de Informatica Universidad Complutense de Madrid 28040 Madrid, Spain -- prof. dr. ir. Tom Schrijvers Programming Languages Group Department of Applied Mathematics and Computer Science University of Ghent Krijgslaan 281 S9 9000 Gent Belgium Phone: +32 9 264 4805 http://users.ugent.be/~tschrijv/

1 0

Haskell Weekly News: Issue 269
by Daniel Santa Cruz 06 Jun '13

06 Jun '13

Welcome to issue 269 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 26 to June 1, 2013. Quotes of the Week * neutrino: i've been teaching people about functional programming etc (when I came in there was exactly 0 knowledge about this, after I joined that changed, but not sure in which direction) Top Reddit Stories * Haskell Platform 2013.2.0.0 is out Domain: haskell.org, Score: 103, Comments: 19 On Reddit: [1] http://goo.gl/Iabii Original: [2] http://goo.gl/DniAP * Elm & Prezi: I'm now working on Elm full-time! Domain: elm-lang.org, Score: 96, Comments: 18 On Reddit: [3] http://goo.gl/03Aab Original: [4] http://goo.gl/4o1Xh * ANN: Idris 0.9.8 released Domain: idris-lang.org, Score: 54, Comments: 58 On Reddit: [5] http://goo.gl/PGrXi Original: [6] http://goo.gl/birp8 * Type-Safe Runtime Code Generation with (Typed) Template Haskell Domain: gmainland.blogspot.co.uk, Score: 54, Comments: 17 On Reddit: [7] http://goo.gl/rMEFc Original: [8] http://goo.gl/MBOJn * Elm 0.8 released! Type annotations and aliases, better HTML/JS integration, and lots more Domain: elm-lang.org, Score: 50, Comments: 10 On Reddit: [9] http://goo.gl/B9AIa Original: [10] http://goo.gl/tM3Qq * Why did the Haskeller need to replace his keyboard regularly? Domain: self.haskell, Score: 48, Comments: 9 On Reddit: [11] http://goo.gl/FHiCn Original: [12] http://goo.gl/FHiCn * Towards a better Haskell package Domain: fvisser.nl, Score: 40, Comments: 26 On Reddit: [13] http://goo.gl/XNFGM Original: [14] http://goo.gl/jbW4Q * What does the Haskell runtime look like? Domain: self.haskell, Score: 37, Comments: 17 On Reddit: [15] http://goo.gl/n8bqD Original: [16] http://goo.gl/n8bqD * The AST Typing Problem Domain: blog.ezyang.com, Score: 33, Comments: 14 On Reddit: [17] http://goo.gl/nYMNg Original: [18] http://goo.gl/FYpD2 * [haskell.org Google Summer of Code 2013] Approved Projects Domain: haskell.org, Score: 28, Comments: 10 On Reddit: [19] http://goo.gl/hnSnz Original: [20] http://goo.gl/IUE0U Top StackOverflow Questions * What's the best way to exit a Haskell program? votes: 25, answers: 1 Read on SO: [21] http://goo.gl/3AQdw * Haskell Conduit: One processing conduit, 2 IO sources of the same type votes: 23, answers: 0 Read on SO: [22] http://goo.gl/12dwP * Why is length of “Níðhöggr” 9? votes: 22, answers: 2 Read on SO: [23] http://goo.gl/emGGm * What is a solid example of something that can be done with list comprehensions that is tricky with high order functions? votes: 11, answers: 5 Read on SO: [24] http://goo.gl/fJMcg * Fibonacci Seq. strange output forms (Haskell) votes: 10, answers: 2 Read on SO: [25] http://goo.gl/9OQYW * Gnuplot in Haskell: don't enter gnuplot terminal votes: 10, answers: 0 Read on SO: [26] http://goo.gl/Fwb66 * Haskell: YesNo type class. Why Integer? votes: 10, answers: 3 Read on SO: [27] http://goo.gl/jnLLH * Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? votes: 9, answers: 1 Read on SO: [28] http://goo.gl/HUUoL * Having trouble understanding list comprehensions votes: 9, answers: 2 Read on SO: [29] http://goo.gl/JkNL3 * What is the rule of the order of multiple type variables in haskell? votes: 9, answers: 1 Read on SO: [30] http://goo.gl/1whHM Until next time, +Daniel Santa Cruz References 1. http://www.haskell.org/platform/ 2. http://www.reddit.com/r/haskell/comments/1f6l2a/haskell_platform_2013200_is… 3. http://elm-lang.org/blog/announce/Elm-and-Prezi.elm 4. http://www.reddit.com/r/haskell/comments/1f9yd8/elm_prezi_im_now_working_on… 5. http://idris-lang.org/archives/272 6. http://www.reddit.com/r/haskell/comments/1f75ge/ann_idris_098_released/ 7. http://gmainland.blogspot.co.uk/2013/05/type-safe-runtime-code-generation-w… 8. http://www.reddit.com/r/haskell/comments/1feqhn/typesafe_runtime_code_gener… 9. http://elm-lang.org/blog/announce/version-0.8.elm 10. http://www.reddit.com/r/haskell/comments/1f77h0/elm_08_released_type_annota… 11. http://www.reddit.com/r/haskell/comments/1f6gjs/why_did_the_haskeller_need_… 12. http://www.reddit.com/r/haskell/comments/1f6gjs/why_did_the_haskeller_need_… 13. http://fvisser.nl/post/2013/may/28/towards-a-better-haskell-package.html 14. http://www.reddit.com/r/haskell/comments/1f70wi/towards_a_better_haskell_pa… 15. http://www.reddit.com/r/haskell/comments/1f48dc/what_does_the_haskell_runti… 16. http://www.reddit.com/r/haskell/comments/1f48dc/what_does_the_haskell_runti… 17. http://blog.ezyang.com/2013/05/the-ast-typing-problem/ 18. http://www.reddit.com/r/haskell/comments/1f91w3/the_ast_typing_problem/ 19. http://www.haskell.org/pipermail/haskell-cafe/2013-May/108458.html 20. http://www.reddit.com/r/haskell/comments/1f6ve7/haskellorg_google_summer_of… 21. http://stackoverflow.com/questions/16872898/whats-the-best-way-to-exit-a-ha… 22. http://stackoverflow.com/questions/16757060/haskell-conduit-one-processing-… 23. http://stackoverflow.com/questions/16779251/why-is-length-of-nidhoggr-9 24. http://stackoverflow.com/questions/16784162/what-is-a-solid-example-of-some… 25. http://stackoverflow.com/questions/16762009/fibonacci-seq-strange-output-fo… 26. http://stackoverflow.com/questions/16803070/gnuplot-in-haskell-dont-enter-g… 27. http://stackoverflow.com/questions/16824047/haskell-yesno-type-class-why-in… 28. http://stackoverflow.com/questions/16797802/is-it-possible-to-use-extended-… 29. http://stackoverflow.com/questions/16805135/having-trouble-understanding-li… 30. http://stackoverflow.com/questions/16860473/what-is-the-rule-of-the-order-o… 31. https://plus.google.com/105107667630152149014/about

1 0

Dores do Indai� - Nomes dos aprovados
by David Anderson 05 Jun '13

05 Jun '13

Dores do Indaiá ANA KARINE PAULINO DA SILVA, LUAN VICTOR VASCONCELOS NOBERTO, FRANCISCO MARKAN NOBRE DE SOUZA FILHO, PEDRO SIQUEIRA FONTENELE, JOÃO CARLOS MOREIRA DE CARVALHO, DANIEL MOREIRA ALVES DA SILVA, MARIA JOELMA BEZERRA DA SILVA, JESSICA DE PONTES GOMES. SINELANDIA MARIA DA SILVA, BRENA CARLA DE MELO CAMELO, LUCINEIDE MARIA DA SILVA, HAROLDO PEIXOTO DA JUSTA JUNIOR, RENATA ROCHA DE NEGREIROS. Campestre de Goiás. Aquiraz ALINE PINHO BARROS, LARISSA FORTE VASCONCELOS, FERNANDO DE MORAES RODRIGUES, NEWTON BEVILAQUA DIAS NETO, JOÃO CARLOS MOREIRA DE CARVALHO, CLAYTON DANTAS DE OLIVEIRA, MARIA DA CONCEIÇÃO SIMÕES LOPES, IVANILDO NUNES DA SILVA. SABRINA ISABEL DE OLIVEIRA PAIVA, ELIELSON LEANDRO DE LIMA, MAURICIO CARLOS DE SOUZA FILHO, JOSE WILSON DE CARVALHO FILHO, VITOR GOMES DOS SANTOS. Colniza. Araçuaí ANA KARINE PAULINO DA SILVA, LUAN VICTOR VASCONCELOS NOBERTO, FRANCISCO MARKAN NOBRE DE SOUZA FILHO, PEDRO SIQUEIRA FONTENELE, JOÃO CARLOS MOREIRA DE CARVALHO, DANIEL MOREIRA ALVES DA SILVA, MARIA JOELMA BEZERRA DA SILVA, JESSICA DE PONTES GOMES. SINELANDIA MARIA DA SILVA, BRENA CARLA DE MELO CAMELO, LUCINEIDE MARIA DA SILVA, HAROLDO PEIXOTO DA JUSTA JUNIOR, RENATA ROCHA DE NEGREIROS. Colniza.

1 0