March 2013 - Haskell - Haskell.org

ICFP 2013: Second Call for Papers
by David Van Horn 19 Mar '13

19 Mar '13

===================================================================== 18th ACM SIGPLAN International Conference on Functional Programming ICFP 2013 Boston, MA, USA, 25-27 September 2013 http://www.icfpconference.org/icfp2013 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Thursday, 28 March 2013 23:59 UTC-11 (Pago Pago, American Samoa, time) Author response: Wednesday, 22 May 0:00 UTC-11 Friday, 24 May 2013 23:59 UTC-11 Notification: Friday, 7 June 2013 Final copy due: Friday, 5 July 2013 Scope ~~~~~ ICFP 2013 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security * Education: teaching introductory programming; parallel programming; mathematical proof; algebra * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Thursday, 28 March 2013, 23:59 UTC-11 (American Samoa time), submit a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available:http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web athttps://www.easychair.org/conferences/?conf=icfp2013 . Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC-11 on Wednesday, 22 May 2013, to read reviews and respond to them. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2013. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. General Chair: Greg Morrisett, Harvard University Program Chair: Tarmo Uustalu, Institute of Cybernetics, Tallinn Program Committee: Thorsten Altenkirch, University of Nottingham Olaf Chitil, University of Kent Silvia Ghilezan, University of Novi Sad Michael Hanus, Christian-Albrechts-Universität zu Kiel Fritz Henglein, University of Copenhagen Mauro Jaskelioff, Universidad Nacional de Rosario Alan Jeffrey, Alcatel-Lucent Bell Labs Shin-ya Katsumata, Kyoto University Shriram Krishnamurthi, Brown University John Launchbury, Galois Ryan Newton, Indiana University Sungwoo Park, Pohang University of Science and Technology Sam Staton, University of Cambridge Nikhil Swamy, Microsoft Research, Redmond, WA Dimitrios Vytiniotis, Microsoft Research, Cambridge

2 1

Fwd: Now Accepting Applications for Mentoring Organizations for GSoC 2013
by Johan Tibell 18 Mar '13

18 Mar '13

[bcc: haskell(a)haskell.org] We should make sure that we apply for Google Summer of Code this year as well. It's been very successful in the previous year, where we have gotten several projects funded every year. -- Johan ---------- Forwarded message ---------- From: Carol Smith <carols(a)google.com> Date: Mon, Mar 18, 2013 at 12:00 PM Subject: Now Accepting Applications for Mentoring Organizations for GSoC 2013 To: Google Summer of Code Announce < google-summer-of-code-announce(a)googlegroups.com> Hi all, We're pleased to announce that applications for mentoring organizations for Google Summer of Code 2013 are now being accepted [1]. If you'd like to apply to be a mentoring organization you can do so via Melange [2]. If you have questions about how to use Melange, please see our User's Guide [3]. Please note that the application period [4] closes on 29 March at 19:00 UTC [5]. We will not accept any late applications for any reason. [1] - http://google-opensource.blogspot.com/2013/03/mentoring-organization-applic… [2] - http://www.google-melange.com [3] - http://en.flossmanuals.net/melange/ [4] - http://www.google-melange.com/gsoc/events/google/gsoc2013 [5] - http://goo.gl/xmQMJ Cheers, Carol -- You received this message because you are subscribed to the Google Groups "Google Summer of Code Announce" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-summer-of-code-announce%2Bunsubscribe(a)googlegroups.com. To post to this group, send email to google-summer-of-code-announce(a)googlegroups.com. Visit this group at http://groups.google.com/group/google-summer-of-code-announce?hl=en. For more options, visit https://groups.google.com/groups/opt_out.

1 0

2nd CfP: Haskell in Leipzig (Germany) (Deadline: March 31, Workshop: June 21)
by Johannes Waldmann 18 Mar '13

18 Mar '13

Haskell in Leipzig! Now in its 8th year! http://www.bioinf.uni-leipzig.de/conference-registration/13haskell/ Calling for papers, tutorials, performances! ... on Haskell in particular, but also functional programming in general, and its extension by other paradigms. We'd love to hear about news of the language, libraries, and tools; Haskell applications in art and industry; and teaching Haskell. Presentations should be given in German but we can switch to English if requested. Submission until: March 31 Notification : April 15 Workshop : June 21 Invited talk by Christian Höner zu Siederdissen: "ADPfusion: high-performance dynamic programming in Haskell" Program comittee: Ralf Dorn (Otto-Nagel-Gymnasium Berlin), Georg Martius (MPI Leipzig), Petra Hofstedt (BTU Cottbus), Andres Löh (Well-Typed LLP), Alf Richter (iba CG Leipzig), Uwe Schmidt (FH Wedel), Peter Stadler (Univ. Leipzig), Henning Thielemann (Univ. Halle), Janis Voigtländer (Univ. Bonn), Johannes Waldmann (HTWK Leipzig)

1 0

Restored: online archives of haskell@ 1990-2000
by Don Stewart 16 Mar '13

16 Mar '13

Using Simon PJ's archive, I've restored the online archives of the Haskell Mailing list from 1990-2000. http://code.haskell.org/~dons/haskell-1990-2000/ Hopefully in a more permanent location. Some goodies: * Wadler's Law on language design : http://code.haskell.org/~dons/haskell-1990-2000/msg00737.html * GHC's remarkable 29,229 nfib/sec early benchmarks :) http://code.haskell.org/~dons/haskell-1990-2000/msg00130.html Enjoy! -- Don

1 0

ANN: Monad.Reader Issue 21
by Edward Z. Yang 16 Mar '13

16 Mar '13

I am pleased to announce that Issue 21 of the Monad Reader is now available. http://themonadreader.files.wordpress.com/2013/03/issue21.pdf Issue 21 consists of the following two articles: * "A Functional Approach to Neural Networks" by Amy de Buitléir, Michael Russell, Mark Daly * "Haskell ab initio: the Hartree-Fock Method in Haskell" by Felipe Zapata, Angel J. Alvarez Feel free to browse the source files. You can check out the entire repository using Git: git clone https://github.com/ezyang/tmr-issue21.git If you’d like to write something for Issue 22, please get in touch! Cheers, Edward

1 0

Second CfP for the International Workshop on Trends in Functional Programming In Education (TFPIE)
by p.k.f.holzenspies＠utwente.nl 15 Mar '13

15 Mar '13

L.S., Apologies for any duplicates you may receive. Please find below the Second Call for Papers for the Second International Workshop on Trends in Functional Programming In Education (TFPIE). Since the first CfP, we have confirmed that the proceedings will be published in the Electronic Proceedings in Theoretical Computer Science. Moreover, we've started short-listing candidates for a key-note. Your suggestions for keynote speakers are welcome. More information will become available on the workshop's website [1]. Please forward this CfP to whatever forum you consider appropriate. Regards, Philip K.F. Hölzenspies Programme Committee Chair TFPIE 2013 [1] http://wwwhome.ewi.utwente.nl/~holzenspiespkf/TFPIE2013.html Second Call for Papers the Second International Workshop on Trends in Functional Programming in Education TFPIE ----- The second International Workshop on Trends in Functional Programming in Education, TFPIE 2013, is co-located with Trends in Functional Programming (TFP 2013) at Brigham Young University in Utah. The goal of TFPIE is to gather researchers, teachers and all professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue were novel ideas, classroom-tested ideas and work-in-progress on the use of funcitonal programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2013 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or an article (up to 16 pages) in EPTCS style. The authors of all accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Any visitors to the TFPIE 2013 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, the presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science journal (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TFPIE 2013 welcomes submissions describing practical techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - Teaching FP to highschool, beginning CS, and graduate students - FP as a teaching tool for other (CS) topics - FP and Robotics, Music and Philosophy - Advanced FP for undergraduates - Engaging students in research using FP - FP in Programming Languages - FP as a stepping stone to other CS topics Venue ----- Brigham Young University (BYU) is the third-largest private university and the largest explicitly religious university in the United States of America. Although BYU is owned and operated by the LDS church, the workshop is independent of this affiliation. By BYU's own pen: "Brigham Young University seeks to develop students of faith, intellect and character who have the skills and the desire to continue learning and to serve others throughout their lives. Established in 1875, the university provides an outstanding education in an atmosphere consistent with the ideals and principles of its sponsor, The Church of Jesus Christ of Latter-day Saints. Known for its academically minded and internationally experienced student body, its world-class teaching and its beautiful mountain location, BYU is also recognized for its extensive language programs, talented performing arts ensembles, outstanding sports programs and devotion to combining solid scholarship with the principles of the restored gospel of Jesus Christ." See the website for submission instructions and updated information.

1 0

PPDP 2013: Call for Papers
by Tom Schrijvers 15 Mar '13

15 Mar '13

===================================================================== 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 by ACM Press* 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: May 27, 2013 Paper submission: May 30, 2013 Notification: July 4, 2013 Camera-ready: July 21, 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 * Confirmation pending

1 0

Haskell Weekly News: Issue 262
by Daniel Santa Cruz 14 Mar '13

14 Mar '13

Welcome to issue 262 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 03 to 09, 2013. Quotes of the Week * byorgey: The box does not care whether you think it is stupid. It is box. * ksf: duh, we can't run out of energy, as there's a fixed amount of it. * shachaf: getLine :: IO String contains a String in the same way that /bin/ls contains a list of files * macrover: is there a comparison between the various streams/pipes/conduits libraries? Cale: macrover: I am presently resisting the temptation to make a table with the libraries and only one other column which is "maximum number of type parameters to a type constructor". * tac: It's actually really easy to remember all the numeric typeclasses in Haskell. Just think about what makes sense... then make sure whatever your answer is is not that Top Reddit Stories * I can't shake the impression that FRP code is just awful to read. Thoughts? Domain: self.haskell, Score: 63, Comments: 87 On Reddit: [1] http://goo.gl/xKrMm Original: [2] http://goo.gl/xKrMm * Announcing: first release of io-streams Domain: snapframework.com, Score: 58, Comments: 125 On Reddit: [3] http://goo.gl/w53bU Original: [4] http://goo.gl/B1ren * School of Haskell Goes Public -- learning and teaching Haskell Domain: haskell.fpcomplete.com, Score: 50, Comments: 26 On Reddit: [5] http://goo.gl/YPaqA Original: [6] http://goo.gl/4izHq * Announcing http-streams, a new HTTP client library for Haskell using the Snap Framework's io-streams. Domain: blogs.operationaldynamics.com, Score: 43, Comments: 20 On Reddit: [7] http://goo.gl/QKVez Original: [8] http://goo.gl/qygmB * How OCaml type checker works -- or what polymorphism and garbage collection have in common Domain: okmij.org, Score: 43, Comments: 2 On Reddit: [9] http://goo.gl/0CtFH Original: [10] http://goo.gl/7wmWm * Yann Esposito's "Haskell Fast & Hard": A fast-paced tutorial for Haskell beginners Domain: fpcomplete.com, Score: 42, Comments: 16 On Reddit: [11] http://goo.gl/utdiI Original: [12] http://goo.gl/ovldG * hArduino: Control your Arduino board from Haskell Domain: self.haskell, Score: 41, Comments: 3 On Reddit: [13] http://goo.gl/27Ilp Original: [14] http://goo.gl/27Ilp * binary 0.7 Domain: lennartkolmodin.blogspot.ru, Score: 35, Comments: 14 On Reddit: [15] http://goo.gl/VcusD Original: [16] http://goo.gl/LEwBA * IRC Browse: #haskell — first release Domain: ircbrowse.net, Score: 35, Comments: 33 On Reddit: [17] http://goo.gl/3oDKs Original: [18] http://goo.gl/MXygv * Responsive design with Clay Domain: fvisser.nl, Score: 28, Comments: 5 On Reddit: [19] http://goo.gl/0ZLuU Original: [20] http://goo.gl/lQ58q * The 'build' function explained Domain: self.haskell, Score: 28, Comments: 9 On Reddit: [21] http://goo.gl/vlPaF Original: [22] http://goo.gl/vlPaF * How (the syntactic type equality of) GADTs inhibit abstraction Domain: lukepalmer.wordpress.com, Score: 26, Comments: 26 On Reddit: [23] http://goo.gl/fD8j9 Original: [24] http://goo.gl/PY1bj * Caledon 2.0: Consistency & IO. Now based on the calculus of constructions. Domain: github.com, Score: 21, Comments: 7 On Reddit: [25] http://goo.gl/W2qP6 Original: [26] http://goo.gl/rnwSY Top StackOverflow Questions * Are thread pools needed for pure Haskell code? votes: 27, answers: 1 Read on SO: [27] http://goo.gl/Pmrhi * Independent subset of cabal packages set votes: 21, answers: 2 Read on SO: [28] http://goo.gl/qBuws * Should I use a lexer when using a parser combinator library like Parsec? votes: 19, answers: 1 Read on SO: [29] http://goo.gl/6Dfd8 * Current state of Haskell soft real-time votes: 9, answers: 2 Read on SO: [30] http://goo.gl/ueRhX * Difference for ncurses between interpreted and compiled Haskell? votes: 9, answers: 1 Read on SO: [31] http://goo.gl/QnKAQ * More fun with applicative functors votes: 8, answers: 5 Read on SO: [32] http://goo.gl/pykvJ * What's the real benefit of conduit's upstream type parameter? votes: 8, answers: 2 Read on SO: [33] http://goo.gl/RdIUU * What's the benefit of conduit's leftovers? votes: 8, answers: 2 Read on SO: [34] http://goo.gl/oqnty Until next time, +Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/19v4l1/i_cant_shake_the_impression… 2. http://www.reddit.com/r/haskell/comments/19v4l1/i_cant_shake_the_impression… 3. http://snapframework.com/blog/2013/03/05/announcing-io-streams 4. http://www.reddit.com/r/haskell/comments/19qfr6/announcing_first_release_of… 5. https://haskell.fpcomplete.com/blog/2013/03/SoH-Goes-Public 6. http://www.reddit.com/r/haskell/comments/19ntvz/school_of_haskell_goes_publ… 7. http://blogs.operationaldynamics.com/andrew/software/haskell/http-streams-i… 8. http://www.reddit.com/r/haskell/comments/19rlw5/announcing_httpstreams_a_ne… 9. http://okmij.org/ftp/ML/generalization.html 10. http://www.reddit.com/r/haskell/comments/19wogp/how_ocaml_type_checker_work… 11. https://www.fpcomplete.com/user/yogsototh/haskell-fast-hard 12. http://www.reddit.com/r/haskell/comments/19xrhm/yann_espositos_haskell_fast… 13. http://www.reddit.com/r/haskell/comments/19uwf5/harduino_control_your_ardui… 14. http://www.reddit.com/r/haskell/comments/19uwf5/harduino_control_your_ardui… 15. http://lennartkolmodin.blogspot.ru/2013/03/binary-07.html 16. http://www.reddit.com/r/haskell/comments/19kkuc/binary_07/ 17. http://ircbrowse.net/browse/freenode/haskell 18. http://www.reddit.com/r/haskell/comments/19xxuu/irc_browse_haskell_first_re… 19. http://fvisser.nl/post/2013/march/4/responsive-design-with-clay.html 20. http://www.reddit.com/r/haskell/comments/19lpzv/responsive_design_with_clay/ 21. http://www.reddit.com/r/haskell/comments/19p6w3/the_build_function_explaine… 22. http://www.reddit.com/r/haskell/comments/19p6w3/the_build_function_explaine… 23. http://lukepalmer.wordpress.com/2013/03/04/how-gadts-inhibit-abstraction/ 24. http://www.reddit.com/r/haskell/comments/19mwxr/how_the_syntactic_type_equa… 25. https://github.com/mmirman/caledon 26. http://www.reddit.com/r/haskell/comments/19sq5x/caledon_20_consistency_io_n… 27. http://stackoverflow.com/questions/15191649/are-thread-pools-needed-for-pur… 28. http://stackoverflow.com/questions/15186768/independent-subset-of-cabal-pac… 29. http://stackoverflow.com/questions/15216202/should-i-use-a-lexer-when-using… 30. http://stackoverflow.com/questions/15236238/current-state-of-haskell-soft-r… 31. http://stackoverflow.com/questions/15304317/difference-for-ncurses-between-… 32. http://stackoverflow.com/questions/15209516/more-fun-with-applicative-funct… 33. http://stackoverflow.com/questions/15258406/whats-the-real-benefit-of-condu… 34. http://stackoverflow.com/questions/15258587/whats-the-benefit-of-conduits-l… 35. https://plus.google.com/105107667630152149014/about

1 0

WORLDCOMP Strikes Again for the Last Time
by chrisrogersrogers＠aol.com 13 Mar '13

13 Mar '13

I graduated from University of Florida (UFL) and am currently running a computer firm in Florida. I have attended WORLDCOMP http://www.world-academy-of-science.org in 2010. Except for few keynote speeches and presentations, the conference was very disappointing due to a large number of poor quality papers and cancellation of some sessions. I was instantly suspicious of this conference. Me and my UFL and UGA friends started a study on WORLDCOMP. We submitted a paper to WORLDCOMP 2011 and again (the same paper with a modified title) to WORLDCOMP 2012. This paper had numerous fundamental mistakes. Sample statements from that paper include: (1). Binary logic is fuzzy logic and vice versa (2). Pascal developed fuzzy logic (3). Object oriented languages do not exhibit any polymorphism or inheritance (4). TCP and IP are synonyms and are part of OSI model (5). Distributed systems deal with only one computer (6). Laptop is an example for a super computer (7). Operating system is an example for computer hardware Also, our paper did not express any conceptual meaning. However, it was accepted both the times without any modifications (and without any reviews) and we were invited to submit the final paper and a payment of $500+ fee to present the paper. We decided to use the fee for better purposes than making Prof. Hamid Arabnia (Chairman of WORLDCOMP) rich. After that, we received few reminders from WORLDCOMP to pay the fee but we never responded. We MUST say that you should look at the website http://sites.google.com/site/worlddump1 if you have any thoughts to submit a paper to WORLDCOMP. DBLP and other indexing agencies have stopped indexing WORLDCOMP’s proceedings since 2011 due to its fakeness. The status of your WORLDCOMP papers can be changed from “scientific” to “other” (i.e., junk or non-technical) at anytime. See the comments http://www.mail-archive.com/tccc@lists.cs.columbia.edu/msg05168.html of a respected researcher on this. Better not to have a paper than having it in WORLDCOMP and spoil the resume and peace of mind forever! Our study revealed that WORLDCOMP is a money making business, using UGA mask, for Prof. Hamid Arabnia. He is throwing out a small chunk of that money (around 20 dollars per paper published in WORLDCOMP’s proceedings) to his puppet who publicizes WORLDCOMP and also defends it at various forums, using fake/anonymous names. The puppet uses fake names and defames other conferences/people to divert traffic to WORLDCOMP. That is, the puppet does all his best to get a maximum number of papers published at WORLDCOMP to get more money into his (and Prof. Hamid Arabnia’s) pockets. Monte Carlo Resort (the venue of WORLDCOMP until 2012) has refused to provide the venue for WORLDCOMP’13 because of the fears of their image being tarnished due to WORLDCOMP’s fraudulent activities. WORLDCOMP will not be held after 2013. The paper submission deadline for WORLDCOMP’13 is March 18, 2013 (it will be extended many times, as usual) but still there are no committee members, no reviewers, and there is no conference Chairman. The only contact details available on WORLDCOMP’s website is just an email address! What bothers us the most is that Prof. Hamid Arabnia never posted an apology for the damage he has done to the research community. He is still trying to defend WORLDCOMP. Let us make a direct request to him: publish all reviews for all the papers (after blocking identifiable details) since 2000 conference. Reveal the names and affiliations of all the reviewers (for each year) and how many papers each reviewer had reviewed on average. We also request him to look at the Open Challenge at http://sites.google.com/site/dumpconf We think that it is our professional obligation to spread this message to alert the computer science community. Sorry for posting to multiple lists. Spreading the word is the only way to stop this bogus conference. Please forward this message to other mailing lists and people. We are shocked with Prof. Hamid Arabnia and his puppet’s activities http://worldcomp-fake-bogus.blogspot.com Search Google using the keywords “worldcomp, fake” for additional links. Sincerely, Chris

1 0

ARiSVe 2013: submission deadline extension to April 8, 2013
by Andrei Paskevich 11 Mar '13

11 Mar '13

Call For Papers 1st International Workshop on Automated Reasoning in Software Verification *** EXTENDED DEADLINE *** http://arisve2013.lri.fr Monday, June 10, 2013 Lake Placid, NY, USA Affiliated with CADE-24 Aims and Scope The focus of the workshop is application of automated reasoning in the context of software verification, and, more generally, automation in software verification. Relevant topics include but are not limited to: * specifics of verification-related automated reasoning tasks; * efficient translation of high-level verification conditions to logical languages of automated reasoning tools; * handling of the prover's feedback: proofs, models, answer terms; * logical theories of interest for program verification, decision procedures, integration into existing ATP and SMT systems; * combination of automated and user-assisted verification; * tool presentations, tool comparisons, and benchmarks; * experience reports on verification of complex algorithms and real-life software with the use of automated reasoning tools. Paper Submission and Proceedings All submissions are reviewed by the program committee. We expect that one author of every accepted paper will present their work at the workshop. Submissions are limited to 6-12 pages in the LaTeX EasyChair format easychair.cls (http://www.easychair.org/publications/easychair.zip) Technical details may be included in an appendix to be read at the reviewers' discretion. Tool presentation papers and experience reports are welcome. Papers should be submitted through EasyChair, at http://www.easychair.org/conferences/?conf=arisve2013 Submissions must be in PDF format. Electronic version of proceedings will be freely distributed from the workshop web site. Important Dates * Abstract submission deadline: April 3, 2013 (EXTENDED) * Submission deadline: April 8, 2013 (EXTENDED) * Notification: April 30, 2013 * Camera ready versions due: May 10, 2013 * Workshop: June 10, 2013 Invited Speaker K. Rustan M. Leino (Microsoft Research) Program Committee * June Andronick (NICTA) * Clark Barrett (New York University) * Ernie Cohen (Microsoft Corp.) * Loïc Correnson (CEA) * Gidon Ernst (Ausburg University) * Jean-Christophe Filliâtre (CNRS), co-chair * Alwyn Goodloe (NASA) * Matthias Horbach (Koblenz University) * Vladimir Klebanov (Karlsruhe Institute of Technology) * Konstantin Korovin (The University of Manchester) * Rosemary Monahan (National University of Ireland) * Andrei Paskevich (Université Paris-Sud), co-chair * Silvio Ranise (Fondazione Bruno Kessler)

1 0