- Haskell - Haskell.org

ANN: Monad.Reader Issue 19
by Brent Yorgey 31 Oct '11

31 Oct '11

I am pleased to announce that Issue 19 of The Monad.Reader, a special issue on parallelism and concurrency, is now available: http://themonadreader.files.wordpress.com/2011/10/issue19.pdf Issue 19 consists of the following three articles: * Mighttpd – a High Performance Web Server in Haskell by Kazu Yamamoto * High Performance Haskell with MPI by Bernie Pope and Dmitry Astapov * Coroutine Pipelines by Mario Blažević Feel free to browse the source files. You can check out the entire repository using darcs: darcs get http://code.haskell.org/~byorgey/TMR/Issue19 If you’d like to write something for Issue 20, please get in touch. The deadline will likely be in December; more details will be forthcoming.

3 2

Call for Papers - First International Workshop on Bidirectional Transformations
by Janis Voigtländer 29 Oct '11

29 Oct '11

=============================================================== CALL FOR PAPERS First International Workshop on Bidirectional Transformations (BX 2012) Tallinn, Estonia Sun, March 25, 2012 (co-located with ETAPS 2012, adjacent to FASE, ESOP, GT-VMT) http://www.program-transformation.org/BX12 =============================================================== INVITED SPEAKERS: * Juan de Lara (Autonomous University of Madrid, Spain) * Jean-Luc Hainaut (University of Namur, Belgium) IMPORTANT DATES: * Paper submission: Mon, December 19, 2011 * Author notification: Tue, January 24, 2012 * Camera-ready papers: Sun, February 5, 2012 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by December 12, 2011. SUBMISSION CATEGORIES: * Regular submissions (max. 15 pages, formal proceedings) * Short papers (max. 8 pages, informal proceedings) * Lightning talks (extended abstract) Submissions can be in LNCS or EC-EASST style. More details can be found on the webpage. PROCEEDINGS: There will be formal proceedings containing all accepted regular papers, published as a volume of EC-EASST (Electronic Communications of the European Association of Software Science and Technology, http://journal.ub.tu-berlin.de/eceasst) Short papers will be included in informal proceedings distributed at the workshop, and their authors may be invited to extend their contribution to a full paper for inclusion in the formal proceedings. SCOPE: Bidirectional transformations (bx) are a mechanism for maintaining the consistency of two (or perhaps more) related sources of information. Such sources can be databases, software models, documents, or their abstract models like graphs or trees. The methodologies used for bx range from classical program transformation to graph transformation techniques, from ad-hoc techniques for data synchronization to the development of domain-specific languages and their integration. We also solicit papers on model/metamodel co-evolution, which is a different yet closely related subject. The aim of the workshop is to bring together researchers, from all relevant areas, interested in bidirectional transformations from different perspectives, such as: language-based approaches, software/model transformations, and data/schema co-evolution. Topics of interest for BX 2012 include, but are not limited to: * (coupled) software/model transformations * software-model synchronization * data-schema co-evolution and data synchronization * consistency analysis * language-based approaches * analysis/classification of requirements for bx technologies * case studies and tool support * comparison of bx technologies * efficiency of algorithms and benchmarks Regular submissions (11-15 pages) can be: * research papers providing new concepts and results * position papers and research perspectives * papers that apply bx in new domains * papers closing gaps between formal concepts and application scenarios For details about short papers and lightning talks, please consult the webpage. PROGRAM CO-CHAIRS: * Frank Hermann (Technical University of Berlin, Germany; University of Luxembourg, Luxembourg) * Janis Voigtländer (University of Bonn, Germany) PROGRAM COMMITTEE MEMBERS: * Paolo Atzeni (Roma Tre University, Italy) * Benjamin Braatz (University of Luxembourg, Luxembourg) * Anthony Cleve (University of Namur, Belgium) * Alcino Cunha (University of Minho, Portugal) * Carlo Curino (Massachusetts Institute of Technology, USA) * Davide Di Ruscio (University of L'Aquila, Italy) * Zinovy Diskin (University of Waterloo, Canada) * Ulrike Golas (Zuse Institute Berlin, Germany) * Ekkart Kindler (Technical University of Denmark, Denmark) * Kazutaka Matsuda (Tohoku University, Japan) * Fernando Orejas (Technical University of Catalonia, Spain) * Benjamin Pierce (University of Pennsylvania, USA) * Andy Schürr (Technical University of Darmstadt, Germany) * Perdita Stevens (University of Edinburgh, UK) * James Terwilliger (Microsoft, USA) * Antonio Vallecillo (University of Málaga, Spain) * Yingfei Xiong (University of Waterloo, Canada)

1 0

cabal conflicting rules
by Claudio Nieder 28 Oct '11

28 Oct '11

Hi, I just get this output from cabal: cabal install leksah Resolving dependencies... cabal: dependencies conflict: ghc-7.0.4 requires array ==0.3.0.3 however array-0.3.0.3 was excluded because ghc-7.0.4 requires array ==0.3.0.2 How can it be that the same package (ghc-7.0.4) asks for two different versions (array 0.3.0.3 / 0.3.0.2) excluding each other? claudio

6 7

Haskell Weekly News: Issue 205
by Daniel Santa Cruz 26 Oct '11

26 Oct '11

Welcome to issue 205 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of October 16 to 22, 2011. You can find an HTML version of this issue at: http://contemplatecode.blogspot.com/2011/10/haskell-weekly-news-issue-205.h… Announcements Ian Lynah sent out a call for nominations for the haskell.org committee. See the link for details on how to submit a nomination. Nominations close on October 29. [1] http://goo.gl/J9J6H New and Updated Projects * netwire (Ertugrul Soeylemez; 1.2.7) [2] http://goo.gl/ULujm Quotes of the Week * kmc: i just used Hayoo to see if anyone implemented this function and it came back with one of my own libraries * JoeyA: LLVM: The easy-to-use compiler infrastructure nobody knows how to use. * kmc: Haskell isn't really designed by mathematicians. it's designed by people who programmers would consider to be mathematicians and mathematicians would consider to be programmers * Cale: foldr is the real fold; foldl is an imposter * @remember hey daniel kmc wants his uploads featured on HWN [edit note: oops, I guess that was meant for me :) +1 for new and inventive ways to communicate!] Top Reddit Stories * Tech-talk about Haskell at Google: Haskell Amuse-Bouche Domain: youtu.be, Score: 86, Comments: 5 On Reddit: [3] http://goo.gl/Pf0NZ Original: [4] http://goo.gl/NPZ17 * Deprecate Prelude.head and partial functions Domain: chrisdone.com, Score: 58, Comments: 60 On Reddit: [5] http://goo.gl/Yat8J Original: [6] http://goo.gl/NyiRO * What does your company use Haskell for? I'll go first. Domain: self.haskell, Score: 51, Comments: 38 On Reddit: [7] http://goo.gl/VOfrO Original: [8] http://goo.gl/VOfrO * I am working on a functional web-programming language as a senior thesis. What do you think so far? Domain: elm-lang.org, Score: 40, Comments: 58 On Reddit: [9] http://goo.gl/6PrQM Original: [10] http://goo.gl/l3odM * Dear Redditor Emac-loving Haskeller(s): what cool emacs Haskell Mode (or custom) features do you use? Domain: self.haskell, Score: 40, Comments: 7 On Reddit: [11] http://goo.gl/LKW0A Original: [12] http://goo.gl/LKW0A * Macros in Haskell Domain: playingwithpointers.com, Score: 38, Comments: 0 On Reddit: [13] http://goo.gl/pwfjt Original: [14] http://goo.gl/bSYN8 * Type-safe event-based programming Domain: jaspervdj.be, Score: 35, Comments: 0 On Reddit: [15] http://goo.gl/gyj9J Original: [16] http://goo.gl/ZBC55 * Yesod excellent ideas Domain: yannesposito.com, Score: 34, Comments: 5 On Reddit: [17] http://goo.gl/ikFJV Original: [18] http://goo.gl/UgBaC * AI Challenge: Ants. Haskell support is only for GHC 6.12. Shall we lobby for 7.0? Domain: aichallenge.org, Score: 28, Comments: 24 On Reddit: [19] http://goo.gl/ShqaM Original: [20] http://goo.gl/O2YOp * Why not Haskell? Domain: neugierig.org, Score: 27, Comments: 26 On Reddit: [21] http://goo.gl/INmRp Original: [22] http://goo.gl/wK3U3 Top StackOverflow Questions * What are some compelling use cases for dependent method types? votes: 44, answers: 2 Read on SO: [23] http://goo.gl/2Xmgu * Why monads? How does it resolve side-effects? votes: 14, answers: 7 Read on SO: [24] http://goo.gl/UJimh * How does Haskell printf work? votes: 13, answers: 1 Read on SO: [25] http://goo.gl/351dE * Why is my genetic algorithm seemingly behaving randomly? votes: 10, answers: 1 Read on SO: [26] http://goo.gl/a5FtH * What are the benefits of applicative parsing over monadic parsing? votes: 10, answers: 4 Read on SO: [27] http://goo.gl/UEkpx * Fixity of backtick operators? votes: 9, answers: 1 Read on SO: [28] http://goo.gl/nwji2 * Bit Size of GHC's Int Type votes: 8, answers: 2 Read on SO: [29] http://goo.gl/DDtFZ * Simple word count in haskell votes: 8, answers: 4 Read on SO: [30] http://goo.gl/ZAYyT * existential search and query without the fuss votes: 8, answers: 2 Read on SO: [31] http://goo.gl/Fnes6 * How to selectively link certain system libraries statically into Haskell program binary? votes: 8, answers: 2 Read on SO: [32] http://goo.gl/HjPTc Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18983 2. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/93163 3. http://youtu.be/b9FagOVqxmI 4. http://www.reddit.com/r/haskell/comments/lkiiw/techtalk_about_haskell_at_go… 5. http://chrisdone.com/posts/2011-10-17-boycott-head.html 6. http://www.reddit.com/r/haskell/comments/lf71l/deprecate_preludehead_and_pa… 7. http://www.reddit.com/r/haskell/comments/lfwlv/what_does_your_company_use_h… 8. http://www.reddit.com/r/haskell/comments/lfwlv/what_does_your_company_use_h… 9. http://elm-lang.org/ 10. http://www.reddit.com/r/haskell/comments/liqb4/i_am_working_on_a_functional… 11. http://www.reddit.com/r/haskell/comments/llt44/dear_redditor_emacloving_has… 12. http://www.reddit.com/r/haskell/comments/llt44/dear_redditor_emacloving_has… 13. http://playingwithpointers.com/archives/615 14. http://www.reddit.com/r/haskell/comments/lgeuk/macros_in_haskell/ 15. http://jaspervdj.be/posts/2011-10-16-type-safe-events.html 16. http://www.reddit.com/r/haskell/comments/le2dk/typesafe_eventbased_programm… 17. http://yannesposito.com/Scratch/en/blog/Yesod-excellent-ideas/ 18. http://www.reddit.com/r/haskell/comments/lj2br/yesod_excellent_ideas/ 19. http://aichallenge.org/starter_packages.php 20. http://www.reddit.com/r/haskell/comments/ljs9z/ai_challenge_ants_haskell_su… 21. http://neugierig.org/software/blog/2011/10/why-not-haskell.html 22. http://www.reddit.com/r/haskell/comments/lfv4b/why_not_haskell/ 23. http://stackoverflow.com/questions/7860163/what-are-some-compelling-use-cas… 24. http://stackoverflow.com/questions/7840126/why-monads-how-does-it-resolve-s… 25. http://stackoverflow.com/questions/7828072/how-does-haskell-printf-work 26. http://stackoverflow.com/questions/7792456/why-is-my-genetic-algorithm-seem… 27. http://stackoverflow.com/questions/7861903/what-are-the-benefits-of-applica… 28. http://stackoverflow.com/questions/7807994/fixity-of-backtick-operators 29. http://stackoverflow.com/questions/7786662/bit-size-of-ghcs-int-type 30. http://stackoverflow.com/questions/7803449/simple-word-count-in-haskell 31. http://stackoverflow.com/questions/7813691/existential-search-and-query-wit… 32. http://stackoverflow.com/questions/7832112/how-to-selectively-link-certain-…

1 0

haskell.org committee: first-year report
by Ganesh Sittampalam 26 Oct '11

26 Oct '11

This report is also posted to http://haskellorg.wordpress.com/2011/10/26/first-year-report/ The haskell.org committee is reaching the end of its first year of operation, so it's time to look back and see what has been achieved. *haskell.org incorporation* The most important work for the year has been trying to get the ownership of haskell.org resources -- principally some money from our GSoC participation, and various machines -- on a sounder footing. At the moment, Galois is kindly holding funds on behalf of haskell.org. However, this causes them administrative difficulties and it would also be better for haskell.org for them to be held separately in a vehicle with tax-free status (at least in the US) that can also accept donations. The main option we have been exploring is joining the Software Freedom Conservancy (http://www.sfconservancy.org <http://www.sfconservancy.org/>). After seeking the community's consent, we have contacted them to begin the application process. Unfortunately they are currently rather overworked and as they prioritise work for existing projects over accepting new ones, we do not yet know when there will be progress with this. In the meantime we are also investigating joining an alternative, Software in the Public Interest (http://www.spi-inc.org <http://www.spi-inc.org/>). Discussions about this option are still ongoing. The committee would like to thank Jason Dagit who has been helping us to make progress on this issue over the last few months, with the support of his employer Galois. *Subdomain policy* In response to various requests for subdomains of haskell.org, we have formulated the following policy, now (belatedly!) documented athttp://www.haskell.org/haskellwiki/Haskell.org_domain#Policy_on_adding_ne… /Subdomains should be used for *services *rather than *content*/. Content should be normally be hosted at subpaths of http://www.haskell.org <http://www.haskell.org/> So for example a Haskell graphics related website should normally go athttp://www.haskell.org/graphics, rather than http://graphics.haskell.org <http://graphics.haskell.org/>. In contrast, during the year, we did add revdeps.hackage.haskell.org for a hackage reverse-dependency lookup service, and of course hackage.haskell.org already exists. Clearly the line between services and content, and indeed the precise definitions of each, is something of a grey area, and we are certainly happy to be flexible particularly if there are technical or other reasons for doing things one way. Our overall goal is to minimise unnecessary proliferation of subdomains and to try to keep the haskell.org domain reasonably well organised, while still helping people do useful things with it. *Move of www.haskell.org <http://www.haskell.org/> to a new dedicated host* **For many years, www.haskell.org <http://www.haskell.org/> was generously hosted by Paul Hudak at Yale. This was becoming increasingly expensive for him so in late 2010 we moved to a new dedicated host (lambda.haskell.org) At the same time we put in place a policy that lambda would host only "meta" community resources, thus limiting the number of people who need to have accounts on it. For some time before this new project content had been created on community.haskell.org anyway, and this move gave us the opportunity to move "legacy" sites such as gtk2hs over to community. In addition, community.haskell.org is now also a VM running on the same machine. The committee as a whole's involvement in this was only to approve the change -- the sysadmin team did all the actual work. *General* The haskell.org infrastructure as a whole is still in a rather tenuous state. While the extreme unreliability we saw for a while has improved with the reorganisation , the level of sysadmin resource/involvement is still inadequate. The committee is open to ideas on how to improve the situation. Unfortunately we can't provide a full statement of haskell.org's accounts with this report; we are doing our best to track down the necessary information and will produce them as soon as possible. Better control and visibility of our finances and assets is of course one of the benefits we are seeking by affiliating with SFC or SPI.

1 0

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 26 Oct '11

26 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 25 Oct '11

25 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