August 2011 - Haskell

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

ANNOUNCE: GHC version 7.2.1
by Ian Lynagh 26 Mar '12

26 Mar '12

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.2.1 ============================================================= The GHC Team is pleased to announce a new major release of GHC, 7.2.1. The 7.2 branch is intended to be more of a "technology preview" than normal GHC stable branches; in particular, it supports a significantly improved version of DPH, as well as new features such as compiler plugins and "safe Haskell". The design of these new features may evolve as we get more experience with them. See the release notes for more details of what's new and what's changed. We are also using this branch as an opportunity to work out the best workflows to use with git. We expect the 7.2 branch to be short-lived, with 7.4.1 coming out shortly after ICFP as normal. Full release notes are here: http://www.haskell.org/ghc/docs/7.2.1/html/users_guide/release-7-2-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

4 3

Open PhD and PostDoc positions at Marburg University
by Klaus Ostermann 04 Jan '12

04 Jan '12

ear all, we are happy to announce that we have new openings at the PhD and PostDoc level. The Programming Language and Software Technology Group, headed by Klaus Ostermann, conducts research dedicated to developing new technologies that help to construct high-quality software in a productive way. We use and develop an exciting set of technologies involving functional, object-oriented, domain-specific and aspect-oriented programming languages, software product lines, parser technology, language-integrated queries, static and dynamic software analysis, type systems, and many other topics. For more information consult http://www.uni-marburg.de/fb12/ps/ We offer positions with a lot of freedom to choose and develop research topics, few obligations, collaboration with a very strong group of researchers, competitive salary, and opportunities to develop a strong academic career path (e.g. by founding their own junior research group). For the PostDoc positions, we expect applicants to have demonstrated scientific excellence in areas related to our own research. For PhD positions, we expect evidence of the potential for scientific excellence. Knowledge of German is not required; the communication language in our group is English. Marburg is an attractive small "student town" right in the center of Germany. We are only an hour ride away from Frankfurt Airport, which will bring you to many destinations worldwide in a single hop. To apply for a position, please send informal inquiries to Klaus Ostermann (contact data can be found on our website). We are flexible with regard to the starting date, but generally the sooner the better. We are looking forward to hearing from you. Best wishes, Klaus Ostermann on behalf of the PS group at Marburg University http://www.uni-marburg.de/fb12/ps

2 1

Proposal to incorporate Haskell.org
by Don Stewart 16 Dec '11

16 Dec '11

Hello everyone. The haskell.org committee[1], in the interest of the long-term stability of the open source Haskell community infrastructure, has decided to incorporate haskell.org as a legal entity. This email outlines our recommendation, and seeks input from the community on this decision. The committee's proposal is that haskell.org incorporate as an entity under the Software Freedom Conservancy umbrella organization (the same group that Darcs joined recently): http://sfconservancy.org/ If we proceed with this move, haskell.org will be a legal entity, and registered as a non-profit, allowing us to more directly accept (US tax-deductible) donations, and to invest in assets that benefit the Haskell open source community. We welcome your feedback on the proposal attached below. -- Don Stewart (on behalf of the Haskell.org committee) ------------------------------------------------------------------------ = A proposal for the incorporation of Haskell.org = In recent years, haskell.org has started to receive assets, e.g. money from Google Summer Of Code, donations for Hackathons, and a Sparc machine for use in GHC development. We have also started spending this money: in particular, on hosting haskell.org itself. There is also interest in running fundraising drives for specific things such as Hackathon sponsorship and hosting fees. However, haskell.org doesn't currently exist as a legal entity, meaning that these assets have had to be held on our behalf by other entities, such as Galois and various universities. This leads to tricky situations, with no-one being sure who should decide how the haskell.org assets can be used. To solve these problems, we propose that haskell.org applies to become a member project of the Software Freedom Conservancy (SFC) <http://conservancy.softwarefreedom.org/>. The SFC is a non-profit organization that provides free financial and administrative services to open source projects. Additionally, it has 501(c)(3) status, meaning donations from the US are tax-deductible. The SFC would hold haskell.org's money and other assets, and would be able to accept donations on behalf of haskell.org. The haskell.org committee, as described here [2], will make decisions on spending assets and other decisions related to governing the non-profit. Before proceeding, we are inviting input from the community in the form of specific objections or queries regarding the plan. We've tried to answer some of the most likely questions: Q: Does this mean that my Haskell project must now be covered by a copyleft licence such as GPL? A: No, but Haskell projects using haskell.org resource should use an Open Source licence <http://www.opensource.org/licenses/alphabetical>. Q: Will it still be possible to use community.h.o to host non-open-source material, such as academic papers? A: An overall minority of such content, as is the current situation, is not a problem. Q: Will it still be possible to have job ads on the haskell.org mailing lists and website? A: Yes. Q: Will this affect our ability to host the Haskell Symposium <http://www.haskell.org/haskell-symposium/> and Industrial Haskell Group<http://industry.haskell.org/> webpages within haskell.org? A: No. Q: What will be the relationship between haskell.org and other organizations such as the Haskell Symposium and Industrial Haskell Group? A: Those organisations will continue to exist as separate entities. Q: If an umbrella non-profit organisation "The Haskell Foundation" was created, would haskell.org be able to join it? A: Yes. It's likely that in such a scenario, the Haskell Foundation would become the owner of the haskell.org domain name, with the cost divided between the members. The entity that is part of the SFC would be renamed "community.haskell.org" in order to avoid confusion. [1]: http://www.haskell.org/haskellwiki/Haskell.org_committee [2]: http://www.haskell.org/haskellwiki/Haskell.org_committee#Operation

5 6

Haskell Weekly News: Issue 197
by Daniel Santa Cruz 31 Aug '11

31 Aug '11

Welcome to issue 197 the HWN, a newsletter covering developments in the Haskell community. This release covers the week of August 21 to 27, 2011. [1] http://goo.gl/8hDku Announcements Liyang HU announced HakkaTaikai, a Haskell hackathon in Tokyo, on Sunday September 25th, 2011. [2] http://goo.gl/tJ4F4 Qiuchi Jian wondered if anyone would be interested in joining him in translating the 2010 Haskell Report into Chinese. [3] http://goo.gl/QDdeF Johan Tibell announced the results of this year's "State of Haskell" survey. [4] http://goo.gl/26Evg New and Updated Projects * network-address (New - Sebastian Nowicki) Provides data structures for IP addresses as well as subnetworks. [5] http://goo.gl/LTuUK * shelltestrunner (Update - Simon Michael) Tests command-line programs or arbitrary shell commands. [6] http://goo.gl/uKHMo * netwire (Update - Ertugrul Soeylemez) An arrowized functional reactive programming library written with networking applications in mind. [7] http://goo.gl/yM0hy * instinct (New - Ertugrul Soeylemez) Library for neural networks. [8] http://goo.gl/yM0hy Quotes of the Week * elliott: i'm here to prove theorems and compile code and I'm all out of code * shachaf: To deepSeq is a fundamental right * djahandarie: I wonder if De Bruijn was any good at remembering names. * JaffaCake: In the beginning there were 8 registers, and That Was Enough For Everyone. * frezik: "The compiler accepted it, why can't you?" * Cale: the units of the monoids in the algebras for the monoid monad * _Ray_: fucking hell, math and cs need to stop having awesome interesting things. it's ruining my life. * accel: next time I'll read a few research papers before I start trolling hakell * ddarius: isJust :: Maybe a -> Bool; isJust = unsafeCoerce Top Reddit Stories * Interested in a 2nd edition of "Real World Haskell"? Domain: self.haskell, Score: 130, Comments: 33 On Reddit: [9] http://goo.gl/fNS6P Original: [10] http://goo.gl/fNS6P * GHC on ARM: Merged into GHC HEAD Domain: ghcarm.wordpress.com, Score: 78, Comments: 7 On Reddit: [11] http://goo.gl/BvFvX Original: [12] http://goo.gl/ZKDYx * Why Haskell is Kinda Cool Domain: amtal.github.com, Score: 56, Comments: 27 On Reddit: [13] http://goo.gl/9ealD Original: [14] http://goo.gl/0AJIn * Haskell for Kids: Week 2! Domain: cdsmith.wordpress.com, Score: 55, Comments: 20 On Reddit: [15] http://goo.gl/0Qm5z Original: [16] http://goo.gl/DzdUy * Results from the State of Haskell, 2011 Survey Domain: blog.johantibell.com, Score: 54, Comments: 18 On Reddit: [17] http://goo.gl/BAQye Original: [18] http://goo.gl/l6sc1 * PyPy: We need Software Transactional Memory Domain: morepypy.blogspot.com, Score: 49, Comments: 2 On Reddit: [19] http://goo.gl/6dPjT Original: [20] http://goo.gl/kNCma * mmmodularity! - A modular package language for Haskell Domain: skilpat.tumblr.com, Score: 48, Comments: 8 On Reddit: [21] http://goo.gl/6dfSf Original: [22] http://goo.gl/os9IJ * A Tutorial Introduction to the Lambda Calculus Domain: utdallas.edu, Score: 34, Comments: 9 On Reddit: [23] http://goo.gl/OtPrs Original: [24] http://goo.gl/zTIx4 * Functional representation of Rubik's cube Domain: pnyf.inf.elte.hu, Score: 30, Comments: 3 On Reddit: [25] http://goo.gl/TMOnc Original: [26] http://goo.gl/EoYbu * monad-control, for more flexible transformers Domain: yesodweb.com, Score: 27, Comments: 14 On Reddit: [27] http://goo.gl/XF6GZ Original: [28] http://goo.gl/ijd6V * A different haskell emacs mode (work in progress) Domain: chrisdone.com, Score: 26, Comments: 5 On Reddit: [29] http://goo.gl/lfmxF Original: [30] http://goo.gl/7qvho Top StackOverflow Questions * Haskell: How does non-strict and lazy differ? votes: 25, answers: 5 Read on SO: [31] http://goo.gl/2KJVY * forall in Scala votes: 18, answers: 5 Read on SO: [32] http://goo.gl/ejOwF * What is the name of this monad-like functional programming pattern? votes: 16, answers: 1 Read on SO: [33] http://goo.gl/Rv1BC * Is (reverse . f . reverse) efficient? votes: 11, answers: 4 Read on SO: [34] http://goo.gl/U7qLu * Haskell Space Overflow votes: 8, answers: 4 Read on SO: [35] http://goo.gl/5uBY2 * How to write recursive lambda expression in Haskell? votes: 8, answers: 2 Read on SO: [36] http://goo.gl/TokK2 * Is the random number generator in Haskell thread-safe? votes: 8, answers: 4 Read on SO: [37] http://goo.gl/ERVpl * How can I create a tuple where each of the members are compared by an expression? votes: 7, answers: 5 Read on SO: [38] http://goo.gl/BiUpC * Haskell cartesian product of infinite lists votes: 7, answers: 4 Read on SO: [39] http://goo.gl/DC9M5 * How to implement a generic hierarchy of structures with injected functionality votes: 7, answers: 6 Read on SO: [40] http://goo.gl/IoMT6 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18899 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91853 4. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18894 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18893 6. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18900 7. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91845 8. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91845 9. http://www.reddit.com/r/haskell/comments/jtdrz/interested_in_a_2nd_edition_… 10. http://www.reddit.com/r/haskell/comments/jtdrz/interested_in_a_2nd_edition_… 11. http://ghcarm.wordpress.com/2011/08/27/current-status-merged-into-ghc-head/ 12. http://www.reddit.com/r/haskell/comments/jwgxj/ghc_on_arm_merged_into_ghc_h… 13. http://amtal.github.com/2011/08/25/why-haskell-is-kinda-cool.html 14. http://www.reddit.com/r/haskell/comments/juemg/why_haskell_is_kinda_cool/ 15. http://cdsmith.wordpress.com/2011/08/23/haskell-for-kids-week-2/ 16. http://www.reddit.com/r/haskell/comments/js4kd/haskell_for_kids_week_2/ 17. http://blog.johantibell.com/2011/08/results-from-state-of-haskell-2011.html 18. http://www.reddit.com/r/haskell/comments/jqfey/results_from_the_state_of_ha… 19. http://morepypy.blogspot.com/2011/08/we-need-software-transactional-memory.… 20. http://www.reddit.com/r/haskell/comments/jrprb/pypy_we_need_software_transa… 21. http://skilpat.tumblr.com/post/9411500320/a-modular-package-language-for-ha… 22. http://www.reddit.com/r/haskell/comments/jvlrw/mmmodularity_a_modular_packa… 23. http://www.utdallas.edu/~gupta/courses/apl/lambda.pdf 24. http://www.reddit.com/r/haskell/comments/jt0m1/a_tutorial_introduction_to_t… 25. http://pnyf.inf.elte.hu:8000/Rubik_en.xml 26. http://www.reddit.com/r/haskell/comments/jwfz2/functional_representation_of… 27. http://www.yesodweb.com/blog/2011/08/monad-control 28. http://www.reddit.com/r/haskell/comments/jtuk9/monadcontrol_for_more_flexib… 29. http://chrisdone.com/posts/2011-08-21-haskell-emacs.html 30. http://www.reddit.com/r/haskell/comments/js3sm/a_different_haskell_emacs_mo… 31. http://stackoverflow.com/questions/7140978/haskell-how-does-non-strict-and-… 32. http://stackoverflow.com/questions/7213676/forall-in-scala 33. http://stackoverflow.com/questions/7135540/what-is-the-name-of-this-monad-l… 34. http://stackoverflow.com/questions/7152183/is-reverse-f-reverse-efficient 35. http://stackoverflow.com/questions/7140732/haskell-space-overflow 36. http://stackoverflow.com/questions/7141229/how-to-write-recursive-lambda-ex… 37. http://stackoverflow.com/questions/7153255/is-the-random-number-generator-i… 38. http://stackoverflow.com/questions/7136921/how-can-i-create-a-tuple-where-e… 39. http://stackoverflow.com/questions/7141287/haskell-cartesian-product-of-inf… 40. http://stackoverflow.com/questions/7157841/how-to-implement-a-generic-hiera…

1 0

[CUFP 2011] Birds of a Feather sessions
by Ashish Agarwal 30 Aug '11

30 Aug '11

========================================================= Birds of a Feather sessions (BOFs) Commercial Users of Functional Programming Workshop (CUFP 2011) http://cufp.org/bofs-2011 Tokyo, Japan, September 22 - 23 ========================================================= Following last year's success, CUFP 2011 will again include Birds of a Feather sessions. BoFs provide a place for our community to gather informally at CUFP and reach consensus on matters of importance. Any CUFP attendee can propose a BoF session, and grab one of the spare rooms to hold a discussion. Attendance in the evening is open to all. BoF sessions facilitate ad-hoc discussions and provide a place to gather and start off the chat, before moving on during the evening to a local restaurant or pub. There is no deadline for proposing a session, but we encourage you to do so at the earliest possible time to help us with planning and to publicize your proposed discussion. Attendees are also free to show up even if you have not confirmed, but again earlier confirmation will help us with planning. Please see http://cufp.org/bofs-2011 for details on how to propose a BoF session or confirm attendance at one of them. Scheduled BoFs will be listed here as they are confirmed. General information on CUFP 2011 can be found at http://cufp.org/conference/2011. The conference is co-located with ICFP. You can register for CUFP at the main ICFP website http://www.icfpconference.org/icfp2011.

1 0

ANNOUNCE: swapper: Transparently swapping data from in-memory structures to disk
by Roman Smrž 30 Aug '11

30 Aug '11

The package swapper provides a wrapper for functors, which allows their data to be automatically and transparently swapped to disk and loaded back when necessary. The version 0.1 is the first public one. Hackage: http://hackage.haskell.org/package/swapper Github: http://github.com/roman-smrz/swapper/ The original motivation was the use with happstack-state, which is a system to maintain a global state whole kept in memory. If the data get too big, they can be swapped to disk by the operating system, yet sometimes a bit more control may be beneficial. That is provided by this package (a cache, with possible custom implementation, deciding which and how many items are kept in memory, is associated with the structure) and also the use of snapshots is optimized more than in the case of OS swap: only the data currently cached need to be added when creating snapshot and after loading one, the data are read only as needed. Regards, Roman Srmž

2 2

VSTTE 2012: Extended deadline for paper submission: September 10
by Gudmund Grov 29 Aug '11

29 Aug '11

VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ (*** NEW SUBMISSION DEADLINE: September 10, 2011 ***) The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES September 10, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter Müller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Supérieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Université Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter Müller, ETH Zurich Tobias Nipkow, Technische Universität München Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Université Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

ANN: shelltestrunner 1.1
by Simon Michael 25 Aug '11

25 Aug '11

I'm pleased to announce shelltestrunner 1.1. shelltestrunner tests command-line programs or arbitrary shell commands. It reads simple declarative tests specifying a command, some input, and the expected output, error output and exit status. Tests can be run selectively, in parallel, with a timeout, in color, and/or with differences highlighted. Projects using it include hledger, yesod, and berp. shelltestrunner is free software released under GPLv3+. New in 1.1: * bump process dependency to allow building with GHC 7.2.1 * new `-a/--all` flag shows all failure output without truncating Home page: http://joyful.com/shelltestrunner Install: $ cabal install shelltestrunner

1 0

ANNOUNCE: HakkuTaikai: Haskell Hackathon in Tokyo, 25th September 2011
by Liyang HU 25 Aug '11

25 Aug '11

You may have heard the rumours, and I can confirm that it's true: HakkuTaikai is happening! After spending a long week at ICFP 2011 talking about Haskell, why not relax by actually hacking some Haskell? Full details on the wiki page: http://www.haskell.org/haskellwiki/HakkuTaikai When: Sunday, 25th September 2011 Where: Room 1208 of the NII building; the same location as ICFP. Registration is free! See the wiki page above for details. Feel free to email or IRC or twit me with any questions. Many thanks to http://www.nii.ac.jp/ for hosting the event! Cheers, /Liyang

1 0