October 2011 - Haskell

ANNOUNCE: HasGP library 0.1
by Sean Holden 26 Oct '11

26 Oct '11

I would like to announce the initial release of the HasGP library for Gaussian process inference. HasGP is a library, implemented in Haskell, providing algorithms for supervised regression and classification using Gaussian processes (GPs). It is an experimental library, the aim of which is to explore functional programming as a means of implementing machine learning systems, as opposed to the predominant imperative/object-oriented approach. The library is available on Hackage and further information is available at the project's web site: http://www.cl.cam.ac.uk/~sbh11/HasGP/index.html Best wishes, Sean. ------------------------------------------------------------------------------- Dr Sean B Holden University of Cambridge University Senior Lecturer Computer Laboratory William Gates Building Phone: (01223) 763725 15 JJ Thomson Avenue Email: sbh11(a)cl.cam.ac.uk Cambridge CB3 0FD Web: http://www.cl.cam.ac.uk/users/sbh11 United Kingdom -------------------------------------------------------------------------------

1 0

[JOB] Functional Programming at Jane Street
by Yaron Minsky 25 Oct '11

25 Oct '11

Jane Street is looking to hire functional programmers for our offices in New York, London and Hong Kong. We're looking for both interns for this upcoming summer as well as full-time hires. Jane Street is a strong believer in statically typed functional programming and has probably the largest team of functional programmers in any industrial setting. OCaml is our language of choice, but we're very happy to hire Haskellers (indeed, we already have a good number of them on board already!) We use OCaml for running our entire business, supporting everything from statistical research to systems administration to automated trading systems. If you're interested in using functional programming to solve real-world problems, there's no better place. Jane Street has a very informal feel --- if you dress much nicer than a t-shirt in jeans, you'll look out of place --- but it's also an intellectually challenging place where you get to wrestle with hard problems and learn about the subject matter of trading, a fascinating field in its own right. There's also a strong focus on education, with both on the job training and a system of formal classes. We also have a strong commitment to open-source. We released our Core suite of libraries a few years back, and we continue to extend the reach of our public releases. And we have and will continue to financially support projects to improve the OCaml ecosystem. Compensation is more than competitive, and no prior experience with finance is required. Here are some resources you can use to learn more about Jane Street and what we do. - A talk I gave at CMU about how and why we use OCaml <http://ocaml.janestreet.com/?q=node/61> - Our technical blog: <http://ocaml.janestreet.com> If you want to get a flavor of our approach to software, you might be interested in looking at Async, a monadic concurrency library we just released: http://ocaml.janestreet.com/?q=node/100 Follow this link to apply: http://janestreet.com/apply -- Yaron Minsky

1 0

Two new lectureships (assistant professorships) in Nottingham
by Graham Hutton 25 Oct '11

25 Oct '11

Dear all, We are currently seeking two new Lecturers (Assistant Professors) in Computer Science at the University of Nottingham, UK. These posts are available from 1st January 2012 on a fixed-term basis for three years. Applications from within the area of functional programming would be most welcome. For further details, see: http://www.nottingham.ac.uk/jobs/currentvacancies/ref/CE05936S The deadline for applications is 9th November 2011. Best wishes, Graham Hutton -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

Five tenure-track slots -- IU FP group looking to expand (deadline Nov 15)
by Ryan Newton 24 Oct '11

24 Oct '11

We're recruiting for FIVE tenure track slots this year. The programming languages group at IU includes two active Haskellers (myself and Amr Sabry) as well as Dan Friedman and Kent Dybvig. We lost Amal Ahmed to a two-body problem would like to try to replace her (though she is irreplaceable) . If you appreciate top-notch wooded beauty in a campus and a college-town atmosphere, IU is for you! The deadline is coming up soon (Nov 15); see below. Best, -Ryan ------------------------------------------------- Indiana University School of Informatics and Computing Five Tenure-Track/Tenured Positions The School of Informatics and Computing at Indiana University, Bloomington, invites applications for five tenure-track/tenured positions beginning in fall 2012, in the areas of bioinformatics, computer science (all subareas), computer science education research (joint position with School of Education), computer security, and social informatics. The School expects continued hiring in the coming years. Positions are open at all levels. Applicants should have a Ph.D.in the relevant area and a well-established record (senior level) or demonstrable potential for excellence in research and teaching (junior level). The IU Bloomington School of Informatics and Computing is the first of its kind and among the largest in the country, with unsurpassed breadth. It includes more than 70 faculty members, 500 graduate students, and strong undergraduate programs. Degrees offered include M.S. degrees in Computer Science, Bioinformatics, Human Computer Interaction Design, and Security Informatics, and Ph.D. degrees in Computer Science and in Informatics. The School has received public recognition as a "top-ten program to watch" (Computerworld) thanks to its excellence and leadership in academic programs, interdisciplinary research, placement, and outreach. The school offers excellent work conditions, including attractive salaries and research support, and low teaching loads in a setting of strong student growth. Located in the wooded rolling hills of southern Indiana, Bloomington is a culturally thriving college town with a moderate cost of living and the amenities for an active lifestyle. IU is renowned for its top-ranked music school, high performance computing and networking facilities, and performing and fine arts. Applicants should submit a curriculum vitae, a statement of research and teaching, and the names of 3 references (junior level) or 6 references (senior level) using the recruit link at http://hiring.soic.indiana.edu(preferred) or by mail to: Faculty Search Committee School of Informatics and Computing 919 E 10th Street Bloomington, IN 47408 Questions may be sent to faculty-search(a)informatics.indiana.edu. To receive full consideration completed applications must be received by November 15, 2011. Indiana University is an Equal Opportunity/Affirmative Action employer. Applications from women and minorities are strongly encouraged. IU Bloomington is vitally interested in the needs of Dual Career couples. -- Ryan R. Newton (812) 856-4205 Asst. Professor Indiana University - School of Informatics & Computing rrnewton(a)indiana.edu Lindley Hall 230H

1 0

Call for Papers (TASE 2012)
by Huibiao Zhu 21 Oct '11

21 Oct '11

TASE 2012 - PRELIMINARY CALL FOR PAPERS *********************************************************** The Sixth IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE 2012) 4-6 July 2012, Beijing, China http://selab.bjut.edu.cn/tase2012 For more information email: tase2012(a)bjut.edu.cn *********************************************************** Large scale software systems and the Internet are of growing concern to academia and industry. This poses new challenges to the various aspects of software engineering, for instance, the reliability of software development, Web-oriented software architecture and aspect and object-orientation techniques. As a result, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2012 is a forum for researchers from academia, industry and government to present ideas, results, and ongoing research on theoretical advances in software engineering. TASE 2012 is the sixth in a series of symposiums, sponsored by IEEE CS and IFIP. The first TASE symposium was held in Shanghai, China, in June 2007. The second TASE symposium was held in Nanjing, China, in June 2008. The third TASE symposium was held in Tianjin, China, in July 2009. The fourth TASE symposium was held in Taipei, in August 2010, and the fifth TASE symposium was held in Xi'an, China, in August 2011. Topics of Interest: Authors are invited to submit high quality technical papers describing original and unpublished work in all theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Specification and Verification * Program Analysis * Software Testing * Model-Driven Engineering * Software Architectures and Design * Aspect and Object Orientation * Embedded and Real-Time Systems * Software Processes and Workflows * Component-Based Software Engineering * Software Safety, Security and Reliability * Reverse Engineering and Software Maintenance * Service-Oriented Computing * Semantic Web and Web Services * Type System and Theory * Program Logics and Calculus * Dependable Concurrency * Software Model Checking * Probability and Randomization The proceedings will be published by IEEE Computer Society Press. It is envisaged to invite the best tool-related contributions to a Special Section of STTT, Springer Verlag's Intern. Journal on Software Tools for Technology Transfer. General Co-Chairs: Jifeng He (East China Normal University, China) Baocai Yin (Beijing University of Technology, China) Program Co-Chairs: Tiziana Margaria (University Potsdam, Germany) Zongyan Qiu (Peking University, China) Hongli Yang (Beijing University of Technology, China) Organizing Chair: Husheng Liao (Beijing University of Technology, China) Local Arrangement Chair: Dan Wang (Beijing University of Technology, China) Important Dates: January 13, 2012: Title and abstract submission deadline January 20, 2012: Paper submission deadline March 23, 2012: Acceptance/rejection notification April 13, 2012: Camera-ready version due July 4-6, 2012: TASE 2012

1 0

LINEARITY 2012 - Call for papers
by Mário Florido 21 Oct '11

21 Oct '11

Call for Papers Second International Workshop on Linearity http://sites.google.com/site/linearity2012/ Tallinn, Estonia 1 April 2012 An associated event of ETAPS 2012, European Joint Conferences on Theory and Practice of Software =================================================================== With the urge for more robust, verifiable and optimised programming languages, the interest for linearity in order to have more control on computational resources is increasing in several areas of Computer Science, both in the theoretical side: with work on proof technology, complexity classes and more recently quantum computation, and in the practical side: work on program analysis, expressive operational semantics, linear languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. LINEARITY 2012 will be a one-day satellite event of ETAPS 2012. Topics of interest include foundational calculus, models, applications to programming languages and systems. This includes (but is not limited to): * Linear types: session types, etc * Linear calculi; * Functional calculi: lambda-calculus, rho-calculus, term and graph rewriting; * Object calculi; * Interaction-based systems: interaction nets, games; * Concurrent models: process calculi, action graphs; * Calculi expressing locality, mobility, and active data; * Quantum computational models; * Biological or chemical models of computation; Important Dates --------------- * 16 December 2011: Abstract deadline (registration with easychair) * 22 December 2011: Submission deadline * 20 January 2012: Author notification * 3 February 2012: Deadline for final versions of accepted papers * 1 April 2012: Workshop Submission and Publication -------------------------- Authors are invited to submit a short paper (5-7 pages). Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/account/signin.cgi?timeout=1;conf=linearity2012 After the workshop authors are invited to submit a revised version (12 pages) of their presentation. After a second round of refereeing, accepted contributions will appear in an issue of Electronic Proceedings in Theoretical Computer Science (www.eptcs.org) Authors and participants will also be invited to submit an article to a special issue of a Journal. Programme Committee ------------------- * Sandra Alves (co-chair) * Maribel Fernández * Mário Florido * Martin Hofmann * Ian Mackie (co-chair) * Simone Martini * Valeria de Paiva * Simona Ronchi Della Rocca * Alex Simpson Contact ------- Sandra Alves: sandra(a)dcc.fc.up.pt Ian Mackie: iancmackie(a)gmail.com

1 0

Faculty Fellowships
by Simon Peyton-Jones 21 Oct '11

21 Oct '11

Friends Microsoft Research is inviting nominations for its Faculty Fellowship program, starting on September 30, 2011. This program recognizes and supports exceptional early-career faculty engaged in innovative computing research. The objective is to stimulate and support the research of promising individuals who have the potential to make a profound impact on the state-of-the-art in their research disciplines and to become future thought leaders. The award is substantial -- typically enough to fund a faculty salary for a couple of years. Applications by 31 October. Further information is available at http://research.microsoft.com/en-us/collaboration/awards/msrff.aspx, questions regarding eligibility etc. can be directed to flshph(a)microsoft.com<mailto:flshph@microsoft.com>. Simon

1 0

ICFP 2012: Call for workshops and co-located events
by Wouter Swierstra 21 Oct '11

21 Oct '11

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2012 17th ACM SIGPLAN International Conference on Functional Programming September 9 - 15, 2012 Copenhagen, Denmark http://icfpconference.org/icfp2012/ The 17th ACM SIGPLAN International Conference on Functional Programming will be held in Copenhagen, Denmark on September 9-15, 2012. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2012 and sponsored by SIGPLAN. These events should be more informal and focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 9 (the day before ICFP) and September 13-15 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 19, 2011 Notification of acceptance: December 17, 2011 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2012 workshop co-chairs (Patrik Jansson and Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au by November 19, 2011. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 17, 2011, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2012/icfp12-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2012 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Gabriele Keller (University of New South Wales) Workshop Co-Chair: Patrik Jansson (Chalmers University of Technology) General Chair : Peter Thiemann (University of Freiburg) Program Chair: Robby Findler (Northwestern University) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Patrik Jansson and Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au

1 0

Haskell Weekly News: Issue 204
by Daniel Santa Cruz 19 Oct '11

19 Oct '11

Welcome to issue 204 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of October 9 to 15, 2011. You can find the HTML version of this issue at: http://contemplatecode.blogspot.com/2011/10/haskell-weekly-news-issue-204.h… New and Updated Projects * lhs2tex-hl (Alessandro Vermeulen; 1.4.3) Upgraded package builds with GHC 7.2.x. [1] http://goo.gl/2VQmw * global-variables (Jean-Marie Gaillourdet; 1.0) A package providing a global namespace for IORefs, MVars, and TVars. [2] http://goo.gl/B9YPO * vector-bytestring (Bas van Dijk; 0.0.0.0) "The very ambitious goal of this package is that it will eventually replace our beloved bytestring package. By basing this package on vector, we can benefit from all the optimizations (like stream-fusion!) in that library." [3] http://goo.gl/SAUiF * simple-actors (Brandon Simmons; 0.1.0) An eDSL library for actor model concurrency. [4] http://goo.gl/f9hvu * ircbot (Jeremy Shaw; 0.1.1) ... "becase that's what Haskell really needs -- another irc bot library." [5] http://goo.gl/A252O Quotes of the Week * Pseudonym: A type is a collection of values, and a class is a collection of types. * xplat: you just need to write a corresponding set of modules for well-hung coinduction * Porges: State is stored in spacesuits. [via: reddit] [djahandarie] Group projects are stupid [shachaf] Try a semigroup project sometime. You need to lose your identity. Top Reddit Stories * shqq: Embedding shell commands in Haskell code Domain: mainisusuallyafunction.blogspot.com, Score: 51, Comments: 5 On Reddit: [6] http://goo.gl/b7zj5 Original: [7] http://goo.gl/9LVhi * Shooting yourself in the foot with Haskell Domain: haskell.org, Score: 47, Comments: 7 On Reddit: [8] http://goo.gl/C1VJY Original: [9] http://goo.gl/yGceC * Why learn Haskell? [PDF slides] Domain: ugcs.net, Score: 32, Comments: 31 On Reddit: [10] http://goo.gl/Coml0 Original: [11] http://goo.gl/MgVwe * How to beat the CAP theorem - purely functional databases Domain: nathanmarz.com, Score: 28, Comments: 11 On Reddit: [12] http://goo.gl/s1TjI Original: [13] http://goo.gl/HQvlK * Yo /r/haskell, I heard you like monads... Domain: self.haskell, Score: 25, Comments: 26 On Reddit: [14] http://goo.gl/xSbj7 Original: [15] http://goo.gl/xSbj7 * FRP and Haskell being used for physiological experimentation and analysis - Haskell-cafe Domain: haskell.org, Score: 21, Comments: 3 On Reddit: [16] http://goo.gl/XxE3y Original: [17] http://goo.gl/fMBMR * Composing a list of Enumeratees Domain: permalink.gmane.org, Score: 19, Comments: 14 On Reddit: [18] http://goo.gl/fwcY1 Original: [19] http://goo.gl/V2bgc * hp2pretty-0.5 released - Now with go faster stripes! Domain: claudiusmaximus.goto10.org, Score: 19, Comments: 0 On Reddit: [20] http://goo.gl/csnhI Original: [21] http://goo.gl/18myY * FRP - How to deal with concurrent external events? Domain: apfelmus.nfshost.com, Score: 16, Comments: 0 On Reddit: [22] http://goo.gl/HqgyJ Original: [23] http://goo.gl/2QYcU * Talk (by factis research) about developing commercial software in Haskell Domain: factisresearch.blogspot.com, Score: 16, Comments: 5 On Reddit: [24] http://goo.gl/iyKDs Original: [25] http://goo.gl/RSHLE * A French community for Haskell Domain: alpmestan.wordpress.com, Score: 15, Comments: 0 On Reddit: [26] http://goo.gl/KSy83 Original: [27] http://goo.gl/rF4Zs * VirtuaHac: The Completely Online Hackathon Domain: haskell.org, Score: 15, Comments: 8 On Reddit: [28] http://goo.gl/3Ej9Z Original: [29] http://goo.gl/wj05N * kmeans-vector: kmeans clustering algorithm implementation Domain: hackage.haskell.org, Score: 14, Comments: 0 On Reddit: [30] http://goo.gl/DcvcO Original: [31] http://goo.gl/df48V Top StackOverflow Questions * Meaning of Haskell exceptions votes: 19, answers: 2 Read on SO: [32] http://goo.gl/Aa2H9 * Are there pronounceable names for common Haskell operators? votes: 19, answers: 2 Read on SO: [33] http://goo.gl/qr2QN * Space leak only in certain cases in GHC interpreter when doing: concat <some list> !! n votes: 18, answers: 0 Read on SO: [34] http://goo.gl/y7W50 * Type theory: type kinds votes: 18, answers: 3 Read on SO: [35] http://goo.gl/ne79b * Why is the minimalist, example Haskell quicksort not a “true” quicksort? votes: 16, answers: 6 Read on SO: [36] http://goo.gl/Zldpx * Space leaks, and Writers, and Sums (oh my!) votes: 15, answers: 3 Read on SO: [37] http://goo.gl/Lt62v * Can this functionality be implemented with Haskell's type system? votes: 14, answers: 3 Read on SO: [38] http://goo.gl/4aV7G * Total function of type (forall n . Maybe (f n)) -> Maybe (forall n . (f n)) votes: 14, answers: 3 Read on SO: [39] http://goo.gl/qUyYR * Standard web server interface equivalent to WSGI/Rack for Haskell votes: 9, answers: 2 Read on SO: [40] http://goo.gl/9fWNq * Automatic lifting of infix operators to monadic infix operators votes: 8, answers: 3 Read on SO: [41] http://goo.gl/jDQWC Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/93087 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18977 3. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18975 4. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/93016 5. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92986 6. http://mainisusuallyafunction.blogspot.com/2011/10/shqq-embedding-shell-com… 7. http://www.reddit.com/r/haskell/comments/l86s6/shqq_embedding_shell_command… 8. http://www.haskell.org/haskellwiki/Shooting_your_self_in_the_foot 9. http://www.reddit.com/r/haskell/comments/l6smh/shooting_yourself_in_the_foo… 10. http://ugcs.net/~keegan/talks/why-learn-haskell/talk.pdf 11. http://www.reddit.com/r/haskell/comments/la9ey/why_learn_haskell_pdf_slides/ 12. http://nathanmarz.com/blog/how-to-beat-the-cap-theorem.html 13. http://www.reddit.com/r/haskell/comments/lb66h/how_to_beat_the_cap_theorem_… 14. http://www.reddit.com/r/haskell/comments/ldu36/yo_rhaskell_i_heard_you_like… 15. http://www.reddit.com/r/haskell/comments/ldu36/yo_rhaskell_i_heard_you_like… 16. http://www.haskell.org/pipermail/haskell-cafe/2011-October/095857.html 17. http://www.reddit.com/r/haskell/comments/l6yep/frp_and_haskell_being_used_f… 18. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92928 19. http://www.reddit.com/r/haskell/comments/la4at/composing_a_list_of_enumerat… 20. http://claudiusmaximus.goto10.org/cm/2011-10-15_hp2pretty-0.5_released.html 21. http://www.reddit.com/r/haskell/comments/lcw7n/hp2pretty05_released_now_wit… 22. http://apfelmus.nfshost.com/blog/2011/10/11-frp-concurrent-events.html 23. http://www.reddit.com/r/haskell/comments/l9hgz/frp_how_to_deal_with_concurr… 24. http://factisresearch.blogspot.com/2011/10/yesterday-i-gave-talk-at-haskell… 25. http://www.reddit.com/r/haskell/comments/l9zq3/talk_by_factis_research_abou… 26. http://alpmestan.wordpress.com/2011/10/09/a-french-community-for-haskell/ 27. http://www.reddit.com/r/haskell/comments/l6eqx/a_french_community_for_haske… 28. http://haskell.org/haskellwiki/VirtuaHac 29. http://www.reddit.com/r/haskell/comments/l6knx/virtuahac_the_completely_onl… 30. http://hackage.haskell.org/package/kmeans-vector-0.1 31. http://www.reddit.com/r/haskell/comments/l67mi/kmeansvector_kmeans_clusteri… 32. http://stackoverflow.com/questions/7704999/meaning-of-haskell-exceptions 33. http://stackoverflow.com/questions/7746894/are-there-pronounceable-names-fo… 34. http://stackoverflow.com/questions/7707661/space-leak-only-in-certain-cases… 35. http://stackoverflow.com/questions/7752452/type-theory-type-kinds 36. http://stackoverflow.com/questions/7717691/why-is-the-minimalist-example-ha… 37. http://stackoverflow.com/questions/7720929/space-leaks-and-writers-and-sums… 38. http://stackoverflow.com/questions/7705119/can-this-functionality-be-implem… 39. http://stackoverflow.com/questions/7720108/total-function-of-type-forall-n-… 40. http://stackoverflow.com/questions/7700619/standard-web-server-interface-eq… 41. http://stackoverflow.com/questions/7742625/automatic-lifting-of-infix-opera…

1 0

haskell.org committee: Call for nominations
by Ganesh Sittampalam 18 Oct '11

18 Oct '11

Dear Haskellers, The first year of the haskell.org committee is drawing to a close and it is therefore time to seek replacements for those members whose term is expiring. This year two members are retiring, Ian Lynagh and Malcolm Wallace. The rest of the committee would like to thank them for their excellent service, both from the time before the committee was formed when they amongst the people who handled similar responsibilities on a more informal basis, and over the last year. To nominate yourself, please send an e-mail to committee at haskell.org by 29 October 2011. The retiring members are eligible to re-nominate themselves. Please feel free to include any information about yourself that you think will help us to make a decision. Being a member of the committee does not require a significant amount of time, but committee members should aim to be responsive during discussions when the committee is called upon to make a decision. More details about the committee's roles and responsibilities are on http://www.haskell.org/haskellwiki/Haskell.org_committee If you have any questions about the process, please feel free to e-mail us at committee at haskell.org or to contact one of us individually. We will shortly also be producing a report and accounts covering the first year of operation of the committee. Regards, Ganesh On behalf of the haskell.org committee

1 0