July 2012 - Haskell - Haskell.org

Haskell Weekly News: Issue 236
by Daniel Santa Cruz 19 Jul '12

19 Jul '12

Welcome to issue 236 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of July 8 to 14, 2012. Quotes of the Week * RichardBuckminsterFuller: When I am working on a problem, I never think about beauty. But when I have finished, if the solution is not beautiful, I know that it is wrong. * Taneb: I'm doing the thing that every bored haskeller does one day and rewriting Prelude Top Reddit Stories * Haskell Performance Patterns Domain: johantibell.com, Score: 71, Comments: 34 On Reddit: [1] http://goo.gl/gZkMB Original: [2] http://goo.gl/2rj4t * Code Us Some Roguelike in Haskell! Domain: jamiltron.com, Score: 55, Comments: 19 On Reddit: [3] http://goo.gl/VYOx1 Original: [4] http://goo.gl/OOiSG * I never tested this code before releasing it Confession of a Haskell Hacker Domain: r6.ca, Score: 51, Comments: 48 On Reddit: [5] http://goo.gl/EBfT7 Original: [6] http://goo.gl/9zA0u * Breaking from a loop Domain: haskellforall.com, Score: 37, Comments: 19 On Reddit: [7] http://goo.gl/yqxqg Original: [8] http://goo.gl/NtI8j * The Classy Prelude, an alternate prelude which makes it easier to use conflicting names via typeclasses, and thereby encourages usage of more powerful libraries like text and unordered-containers. Domain: yesodweb.com, Score: 35, Comments: 46 On Reddit: [9] http://goo.gl/cZKM5 Original: [10] http://goo.gl/70d6R * The Long and Epic Journey of LambdaCase Domain: unknownparallel.wordpress.com, Score: 33, Comments: 52 On Reddit: [11] http://goo.gl/EAVXs Original: [12] http://goo.gl/ymkGy * How is this fibonacci-function memoized? Domain: stackoverflow.com, Score: 33, Comments: 1 On Reddit: [13] http://goo.gl/lo3LD Original: [14] http://goo.gl/wwHQb * errors-1.0: Simplified error handling Domain: haskellforall.com, Score: 30, Comments: 31 On Reddit: [15] http://goo.gl/tKzP1 Original: [16] http://goo.gl/O10hN * Influenced by Haskell Domain: griffsgraphs.com, Score: 30, Comments: 29 On Reddit: [17] http://goo.gl/6ptoi Original: [18] http://goo.gl/Nrz7K * Experience Report: Haskell in Computational Biology (Daniels, Gallant, Ramsey)[pdf 7 pp] Domain: eecs.tufts.edu, Score: 30, Comments: 11 On Reddit: [19] http://goo.gl/XsvMK Original: [20] http://goo.gl/TUdnL * == for Float not referentially transparent Domain: haskell.org, Score: 23, Comments: 51 On Reddit: [21] http://goo.gl/6qZ1J Original: [22] http://goo.gl/DR9TE * My second attempt at writing Haskell Domain: self.haskell, Score: 21, Comments: 27 On Reddit: [23] http://goo.gl/i7u3p Original: [24] http://goo.gl/i7u3p * Announcing split-channel « Melding Monads Domain: blog.melding-monads.com, Score: 20, Comments: 16 On Reddit: [25] http://goo.gl/XwHdl Original: [26] http://goo.gl/oh5Ce * Deriving the Y combinator from first principles Domain: wellnowwhat.net, Score: 18, Comments: 12 On Reddit: [27] http://goo.gl/5uxYN Original: [28] http://goo.gl/Q76lk * Announcing WAI 1.3! Domain: yesodweb.com, Score: 18, Comments: 11 On Reddit: [29] http://goo.gl/QD769 Original: [30] http://goo.gl/mQFBK Top StackOverflow Questions * How is this fibonacci-function memoized? votes: 43, answers: 3 Read on SO: [31] http://goo.gl/MGjr3 * What is the combinatory logic equivalent of intuitionistic type theory? votes: 39, answers: 0 Read on SO: [32] http://goo.gl/ki9nT * Does Haskell have return type overloading? votes: 15, answers: 5 Read on SO: [33] http://goo.gl/sBGWj * Is there a way to avoid unnecessary recursion? votes: 12, answers: 2 Read on SO: [34] http://goo.gl/Gk39e * Using vectors for performance improvement in Haskell votes: 12, answers: 2 Read on SO: [35] http://goo.gl/74KOH * Eliminate Haskell array bounds check for Bounded type? votes: 11, answers: 1 Read on SO: [36] http://goo.gl/CHDtJ * Having my cereal and parsing it too votes: 8, answers: 2 Read on SO: [37] http://goo.gl/1SG24 * How does HOpenGL behave with regards to other threads and TChans in Haskell? votes: 8, answers: 2 Read on SO: [38] http://goo.gl/dmoqc * Number of arguments and point-free in Haskell votes: 8, answers: 2 Read on SO: [39] http://goo.gl/8Z0B2 * Haskell: Design pattern: classes or pass functions votes: 7, answers: 3 Read on SO: [40] http://goo.gl/EO7tr * Haskell — sort list with impure function votes: 7, answers: 4 Read on SO: [41] http://goo.gl/o9kbc Until next time, Daniel Santa Cruz References 1. http://johantibell.com/files/haskell-performance-patterns.html#%281%29 2. http://www.reddit.com/r/haskell/comments/wjtms/haskell_performance_patterns/ 3. http://jamiltron.com/2012/07/Code_Us_Some_Roguelike_in_Haskell.html 4. http://www.reddit.com/r/haskell/comments/wd6p3/code_us_some_roguelike_in_ha… 5. http://r6.ca/blog/20120708T122219Z.html 6. http://www.reddit.com/r/haskell/comments/w7zd8/i_never_tested_this_code_bef… 7. http://www.haskellforall.com/2012/07/breaking-from-loop.html 8. http://www.reddit.com/r/haskell/comments/wfwyt/breaking_from_a_loop/ 9. http://www.yesodweb.com/blog/2012/07/classy-prelude 10. http://www.reddit.com/r/haskell/comments/wfiao/the_classy_prelude_an_altern… 11. http://unknownparallel.wordpress.com/2012/07/09/the-long-and-epic-journey-o… 12. http://www.reddit.com/r/haskell/comments/wbb69/the_long_and_epic_journey_of… 13. http://stackoverflow.com/q/11466284/1288 14. http://www.reddit.com/r/haskell/comments/whx2k/how_is_this_fibonaccifunctio… 15. http://www.haskellforall.com/2012/07/errors-10-simplified-error-handling.ht… 16. http://www.reddit.com/r/haskell/comments/w7xrv/errors10_simplified_error_ha… 17. http://griffsgraphs.com/2012/07/01/programming-languages-influences/ 18. http://www.reddit.com/r/haskell/comments/w9npe/influenced_by_haskell/ 19. http://www.eecs.tufts.edu/~ndaniels/Noah_files/mrfy_experience_report.pdf 20. http://www.reddit.com/r/haskell/comments/wf6xe/experience_report_haskell_in… 21. http://www.haskell.org/pipermail/glasgow-haskell-users/2012-July/022568.html 22. http://www.reddit.com/r/haskell/comments/wbsd3/for_float_not_referentially_… 23. http://www.reddit.com/r/haskell/comments/walg1/my_second_attempt_at_writing… 24. http://www.reddit.com/r/haskell/comments/walg1/my_second_attempt_at_writing… 25. http://blog.melding-monads.com/2012/07/10/announcing-split-channel/ 26. http://www.reddit.com/r/haskell/comments/wdhf1/announcing_splitchannel_meld… 27. http://www.wellnowwhat.net/blog/?p=485 28. http://www.reddit.com/r/haskell/comments/wd5rb/deriving_the_y_combinator_fr… 29. http://www.yesodweb.com/blog/2012/07/announcing-wai-1-3 30. http://www.reddit.com/r/haskell/comments/wih94/announcing_wai_13/ 31. http://stackoverflow.com/questions/11466284/how-is-this-fibonacci-function-… 32. http://stackoverflow.com/questions/11406786/what-is-the-combinatory-logic-e… 33. http://stackoverflow.com/questions/11420126/does-haskell-have-return-type-o… 34. http://stackoverflow.com/questions/11454936/is-there-a-way-to-avoid-unneces… 35. http://stackoverflow.com/questions/11481675/using-vectors-for-performance-i… 36. http://stackoverflow.com/questions/11411797/eliminate-haskell-array-bounds-… 37. http://stackoverflow.com/questions/11424961/having-my-cereal-and-parsing-it… 38. http://stackoverflow.com/questions/11443824/how-does-hopengl-behave-with-re… 39. http://stackoverflow.com/questions/11487171/number-of-arguments-and-point-f… 40. http://stackoverflow.com/questions/11423749/haskell-design-pattern-classes-… 41. http://stackoverflow.com/questions/11469806/haskell-sort-list-with-impure-f…

1 0

Haskell Symposium 2012 - Call for Participation (early registration closes 9th August)
by Janis Voigtländer 18 Jul '12

18 Jul '12

==================================================================== CALL FOR PARTICIPATION ACM SIGPLAN Haskell Symposium 2012 Copenhagen, Denmark 13th September, 2012 (directly after ICFP) http://www.haskell.org/haskell-symposium/2012/ ==================================================================== The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Accepted papers and programme: ============================== * http://haskell.org/haskell-symposium/2012/#schedule REGISTRATION IS NOW OPEN: ========================= * http://www.icfpconference.org/icfp2012/registration.html * Early registration deadline: 9th August, 2012 Local arrangements (including travel and accommodation): ======================================================== * http://www.icfpconference.org/icfp2012/local.html See you in Copenhagen, Janis Voigtlaender Haskell 2012 Programme Chair ====================================================================

1 0

Call for Participation: LOPSTR and PPDP 2012
by Jon Sneyers 18 Jul '12

18 Jul '12

(Apologies for multiple copies of this announcement) CALL FOR PARTICIPATION: ============================================================ LOPSTR 2012 22nd International Symposium on Logic-Based Program Synthesis and Transformation Leuven, Belgium, September 18-20, 2012 http://costa.ls.fi.upm.es/lopstr12 and PPDP 2012 14th International Symposium on Principles and Practice of Declarative Programming Leuven, Belgium, September 19-21, 2012 http://dtai.cs.kuleuven.be/events/PPDP2012/ ============================================================ Early registration is until 31 July 2012. There is a significant discount if you register for both events. Registration link: http://dtai.cs.kuleuven.be/events/PPDP2012/reg.html More information about LOPSTR'12: http://costa.ls.fi.upm.es/lopstr12/ More information about PPDP'12: http://dtai.cs.kuleuven.be/events/PPDP2012/

1 0

PEPM 2013: Second Call for Papers
by Shin-Cheng Mu 18 Jul '12

18 Jul '12

C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ==================================================================== NEWS - Submission deadline: September 28 (abstract) and October 2 (paper) - Invited speakers: Zhenjiang Hu and Peter Thiemann - Special issue of Science of Computer Programming (SCP) (5-Year Impact Factor of SCP: 1.304) ==================================================================== SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of 'short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers will be invited for a journal special issue of Science of Computer Programming dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. IMPORTANT DATES Abstract submission: September 25, 2012 Paper submission: October 2, 2012 Notification: November 6, 2012 Camera ready: November 14, 2012 SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France)

1 0

Call for Participation: SoTeSoLa, 19-23 Aug, Koblenz
by Ralf Laemmel 18 Jul '12

18 Jul '12

Dear Haskell-ers, SoTeSoLa is not a Haskell- or FP-centric event, but Haskell-ers are very much encouraged to represent their technological space at the school. In fact, I know for a reason that some Haskell-ers will be there, but the more the better. I expect that Haskell will play a role in one of the two hackathons and perhaps in some working group. (For instance, we are thinking about a working group on the spreadsheet-centric technological space, where Haskell plays a role as a modeling language and otherwise.) Regards, Ralf ---------------------------------------------------------------- The summer school SoTeSoLa 2012 is a highly discussion- and result-oriented Research 2.0 event on software technologies and software languages. http://planet-sl.org/sotesola2012 SoTeSoLa 2012 takes place in Koblenz 19-23 August 2012. SoTeSoLa brings together senior and junior researchers and technologists interested in software science, specifically the foundations of software technologies and the notion of technological spaces as linking together software languages, technologies, and various resources adding up to a technological and community context. SoTeSoLa also hosts this time the SATToSE 2012 seminar on "Advanced Techniques & Tools for Software Evolution". Key topics at the school are these: - Generic language technology - Co-evolution of software artifacts - Multi-language, multi-technology problems - Research 2.0 applied to software engineering - Technological spaces: past, present, and future - eLearning for language engineers & technologists - Models of knowledge resources for software developers - Model-driven engineering beyond software development - Software re/reverse/engineering in the Semantic Web Era SoTeSoLa aims at exercising a new format for a software language/technology forum, i.e., a more Research 2.0-based approach so that much focus is on understanding each others context, integrating knowledge, automation thereof, and organizing future research and work of the participants. To this end, regular lectures are de-emphasized, but a more discussion- and result-oriented format will be exercised. The event maxes out at 42 participants. SoTeSoLa 2012 is supported by the ADAPT research focus at the University of Koblenz-Landau as part of Rhineland Palatinate's Research Initiative 2008--2013. SoTeSoLa 2012 is also supported by RainCode. SoTeSoLa is hosted by the Software Languages Team in Koblenz. Deadlines: - Registration deadline: 4 August 2012 - Hotel reservation deadline: 1 August 2012 - Deadline for SATToSE presentation proposals: 25 July 2012 - Deadline for student grant applications: 25 July 2012 - Deadline for hackathon and working-group proposals: none and ASAP - Notification for SATToSE presentation proposals: 29 July 2012 - Summer school: 19 August (afternoon) - 23 August 2012 (noon)

1 0

Final Call For Papers: Implementation and Application of Functional Languages 2012, Oxford, UK
by Tom Harper 17 Jul '12

17 Jul '12

The deadline for pre-symposium drafts, 30 July, is approaching! IFL has a post-symposium review process, so it is a great chance to submit a draft or extended abstract and get feedback before the review process. ------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. 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 2012 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 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. 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. 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. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze(a)cs.ox.ac.uk. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 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, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze(a)cs.ox.ac.uk. For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 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 ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea José Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US

1 0

A riddle...
by Andreas Abel 16 Jul '12

16 Jul '12

Today a student came to me with a piece of code that worked it executed by itself, but produced different result in the context of his larger problem. We cut down the example to the following: > import Graphics.UI.Gtk > > -- should produce [(26471,0,65535),... > rgbliste = > (map (\ i -> > let rb = 5 * (mod (mod 181935629 (4534+i)) 100)-250+128 in > let gb = 5 * (mod (mod 128872693 (5148+i)) 100)-250+128 in > let bb = 5 * (mod (mod 140302469 (7578+i)) 100)-250+128 in > let r = min 255 $ max 0 rb in > let g = min 255 $ max 0 gb in > let b = min 255 $ max 0 bb in > (r*257,g*257,b*257)) [0..]) > > --farbliste = map (\ (r,g,b) -> Color r g b) rgbliste > > main :: IO () > main = do > print $ head rgbliste If you run it, it prints (26471,0,65535). If you uncomment the def. of farbliste, it prints (44461,65535,65535). I was surprised. What is going on? Cheers, Andreas -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich Oettingenstr. 67, D-80538 Munich, GERMANY andreas.abel(a)ifi.lmu.de http://www2.tcs.ifi.lmu.de/~abel/

5 5

ANNOUNCE: Pup-Events-1.0
by Dan 15 Jul '12

15 Jul '12

Hello! This is my first release on Hackage and haskell@. So without further ado, here we go! Pup-Events is a collection of modules I initially created to help aid me in game development. It's main purpose is to facilitate the sending, receiving, creation, and handling of events in networked, third-party programs. It consists of the following packages: * Pup-Events-Client: The client facing code, contains the PupEventsClient module. You spawn a bunch of these and connect them to Pup-Events-Server * Pup-Events-Server: The server code, you'd only have one of these. This contains the PupEventsServer module. * Pup-Events-PQueue: A small priority queue implementation I made. The Client and Server use this when sending events. Contains the PupEventsPQueue module. In addition there's also a package "Pup-Events-Demo" which contains a small demo application I wrote in OpenGL to show off the framework. It's designed to be an example of what you can do with Pup-Events. You can pull all of the Pup-Events modules (not including the demo) by installing Pup-Events, which is a meta-package to pull in the Client, Server, and PQueue modules. Hopefully everyone enjoys it! I've certainly found it useful. Daniel Wilson -- ~~ Whatever happens, the sun's still gonna come up tomorrow ~~

1 0

Re: [Haskell] Spam on the Haskell wiki
by Ashley Yakeley 15 Jul '12

15 Jul '12

I have verified that a verified email address is required to edit (by creating an account). -- Ashley On Sat, 2012-07-14 at 20:52 -0700, Mark Lentczner wrote: > We probably need more than just recaptcha (don't use anything else - > they are breakable) - there are real-time forum spammer lists one > needs to consult, and other measures. It may seem draconian, but for > other communities I run on the web, we've given up and have to resort > to manual review of every account request. > > > > - Mark > > > > On Sat, Jul 14, 2012 at 6:05 PM, Don Stewart <dons00(a)gmail.com> wrote: > > More admins on the wiki is good, esp. those with experience to > implement anti-spam measures. > > > > Ashley is around , but as usual, we need more help. > > > > On Saturday, July 14, 2012, Gwern Branwen wrote: > > I recently moved, and when I returned to the Internet > a few days > later, I was greeted with several hundred spam pages > in Recent > Changes. The torrent of spam has not let up, and I > estimate that I > have blocked 3-500 accounts and deleted as many pages. > (I blocked > another 5 or so while composing this email.) Certainly > the deletion > and block logs are long enough: > > - > http://www.haskell.org/haskellwiki/index.php?title=Special%3ALog&type=delet… > - > http://www.haskell.org/haskellwiki/index.php?title=Special:Ipblocklist&limi… > > I have asked Ashley Yakeley to turn on additional > anti-spam measures, > but he has not been active on the wiki since January > (http://www.haskell.org/haskellwiki/Special:Contributions/Ashley_Y > http://www.haskell.org/haskellwiki/index.php?title=Special:Log&user=Ashley_Y) > and has not replied to my talk messages or > accompanying emails. > > I had to do this single-handedly as there are no other > administrators. > This took up a good chunk of today and yesterday, and > the spam is > continuing. I cannot handle it much longer: it's > incredibly tedious > and using up far more time than I have to give it. > Measures need to be > taken: > > 1. Email confirmation needs to be checked that Ashley > did in fact > enable it. I suspect he did not, since I also > administrate the > LessWrong wiki - which I know for certain has email > confirmation is > enabled - is being attacked by the same spammers > (similar or identical > templates & spam) but at a much reduced scale. > 2. Additional administrators must be created. I > suggest: > > - dons > - Magnus Therning > - Neil Mitchell > - byorgey > - Henk-Jan van Tuyl > > I am sure there are others who can be trusted. > 3. Additional bureaucrats should be created. I suggest > myself. > 4. ReCAPTCHA enabled for 'edits adding new, > unrecognized external > links' - which is all of the spam. Further reading: > http://www.mediawiki.org/wiki/Manual:Combating_spam & > http://www.mediawiki.org/wiki/Anti-spam_features > 5. if Ashley is inactive, his account may be a > security risk. The > English Wikipedia now removes administrator bits after > a year of > inactivity; we should consider a similar policy. > > None of these can be taken by myself, as I am neither > a sysadmin on > Haskell.org nor a bureaucrat on the wiki. > > If none of these steps are taken and spam continues to > remain a > problem in 2 months (15 September 2012), I will cease > patrolling > Recent Changes. I no longer have the time or patience. > > -- > gwern > http://www.gwern.net > > > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell > > >

1 0

GHC users on PowerPC and *BSD/Darwin?
by Erik de Castro Lopo 12 Jul '12

12 Jul '12

Hi all, Users of GHC on PowerPC would probably be aware of this bug: http://hackage.haskell.org/trac/ghc/ticket/2972 which causes GHCi to segfault as soon as it was started. Ben M. Collins has come up with a fix for this I am preparing it for submission to the GHC git tree. I have have tested it on linux-powerpc, but would also like to test it on *BSD/Darwin. Anybody out there interested? You will need: * A PowerPC machine running *BSD or Darwin. * A working GHC compiler. If you're interested email me at erikd AT mega-nerd dot com. Cheers, Erik -- ---------------------------------------------------------------------- Erik de Castro Lopo http://www.mega-nerd.com/

1 0