- Haskell - Haskell.org

Announce: Haskell Platform 2012.4.0.0
by Mark Lentczner 06 Nov '12

06 Nov '12

I'm pleased to announce that Haskell Platform 2012.4.0.0<http://www.haskell.org/platform/index.html#2012.4.0.0>is now available. This release contains three new packages to the platform: - async-2.0.1.3<http://lambda.haskell.org/platform/doc/current/packages/async-2.0.1.3/doc/h…> - split-0.2.1.1<http://lambda.haskell.org/platform/doc/current/packages/split-0.2.1.1/doc/h…> - vector-0.10.0.1<http://vector-0.10.0.1http://lambda.haskell.org/platform/doc/current/packag…> The remainder of the changes are small updates to the versions of GHC (now 7.4.2) and several other packages. Installers for Windows <http://www.haskell.org/platform/windows.html>, Mac OS X <http://www.haskell.org/platform/mac.html>, and the source tar ball<http://www.haskell.org/platform/linux.html>are all now available from the site. Linux distribution packages should be available shortly. On behalf of the Haskell Platform team<http://trac.haskell.org/haskell-platform/wiki/Members> , - Mark "mzero" Lentczner, Release Manager

2 2

Call for Papers (ICTAC 2013)
by Huibiao Zhu 05 Nov '12

05 Nov '12

*************************************************************** ICTAC 2013 10th International Colloquium on Theoretical Aspects of Computing *** Call For Papers *** September 4-6, 2013 Shanghai, China http://ictac2013.ecnu.edu.cn/ *************************************************************** ICTAC 2013 is the 10th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2013 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. THEMES AND TOPICS OF PAPERS ICTAC 2013 calls for regular research papers on theories of computation and programming, foundations of software engineering, and on formal techniques in software design and verification; short papers on recent work or proposals of challenges in new programming paradigms such as Cyber-Physical Systems, Cloud Computing and Social Networks; and papers about tools that support formal techniques for software modeling, system design and verification. The topical areas of the conference include, but not limited to Automata theory and formal languages; Principles and semantics of programming languages; Theories of concurrency, mobility and reconfiguration; Logics and their applications; Software architectures and their models, refinement and verification; Relationship between software requirements, models and code; Program static and dynamic analysis and verification; Software specification, refinement, verification and testing; Model checking and theorem proving; Models of object and component systems; Coordination and feature interaction; Integration of theories, formal methods and tools for engineering computing systems; Service-oriented architectures: models and development methods; Models of concurrency, security, and mobility; Theory of distributed, grid and cloud computing; Real-time, embedded, hybrid and cyber-physical systems; Type and category theory in computer science; Models for learning and education; Case studies, theories, tools and experiments of verified systems; Domain-specific modeling and technology: examples, frameworks and experience. Challenges and foundations in the environmental modeling and monitoring, healthcare, and disaster management. PUBLICATION AND SUBMISSION As for the past editions, it is the plan that the proceedings of ICTAC 2013 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2013 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be Regular Papers, Short Papers or Tool Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 18 pages and Short Papers and tool papers should be between 5 and 10 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers must be submitted at http://www.easychair.org/conferences/?conf=ictac2013. Short papers and tool papers must contain clear reference to the background theories and techniques; and a tool paper must further provide a link to a webpage that contains a tutorial and demo of the tool. All queries should be sent to the e-mail address ictac2013(a)sei.ecnu.edu.cn. IMPORTANT DATES Paper submission deadline: 8 March 2013 Paper Accept/Reject Notification: 26 Apr 2013 Final paper submission: 17 May 2013 Conference dates: 4 --- 6 September 2013 ASSOCIATED EVENTS Festschrift Symposium in Honor of Prof. He Jifeng: 01-03 September 2013 Summer School on Software Engineering: 26-30 August 2013 CONFERENCE CHAIRS Zhou Chaochen, Software Institute, Chinese Academy of Sciences Peter Haddawy, UNU-IIST, Macau SAR, China Bill Roscoe, University of Oxford, UK PROGRAMME CHAIRS Zhiming Liu, UNU-IIST, Macau SAR, China Jim Woodcock, University of York, UK Huibiao Zhu, East China Normal University PROGRAMME COMMITTEE Farhad Arbab (CWI and Leiden University, The Netherlands) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Zhenbang Chen (National University of Defense Technology, China) Van Hung Dang (University of Engineering and Technology, Vietnam) Thao Dang (VERIMAG, France) David Deharbe (Universidade Federal do Rio Grande do Norte, Brasil) Jinsong Dong (National University of Singapore, Singapore) Meenakshi Dsouza (IIIT, India) Zhenhua Duan (Xidian University, China) John Fitzgerald (Newcastle University, UK) Martin Fr?nzle (Carl von Ossietzky Universit?t Oldenburg, Germany) Marcelo Frias (Instituto Tecnologico Buenos Aires, Argentina) Lindsay Groves (Victoria University of Wellington, New Zealand) Kim Guldstrand Larsen (Aalborg University, Denmark) Ian J. Hayes (University of Queensland, Australia) Zhenjiang Hu (NII, Japan) Lei Ju (Shandong University, China) Daniel Kroening (Oxford University, UK) Martin Leucker (University of Lübeck, Germany) Zhiming Liu (UNU-IIST, Macau SAR, China) Annabelle Mciver (Macquarie University, Australia) Dominique Mery (Université de Lorraine, France) Tobias Nipkow (Technische Universit?t München, Germany) Paritosh Pandya (TIFR, India) Jun Pang (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Abhik Roychoudhury (National University of Singapore, Singapore) Augusto Sampaio (Federal university of Pernambuco, Brasil) Ondrej Sery (University of Lugano, Switzerland) Natarajan Shankar (SRI, US) Marjan Sirjani (Reykjavik University, Iceland) Andrzej Tarlecki (Warsaw University, Poland) Mark Utting (The University of Waikato, New Zealand) Tarmo Uustalu (Tallinn University of Technology, Estonia) Farn Wang (National Taiwan University, Taiwan) Burkhart Wolff (University Paris-Sud, France) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Naijun Zhan (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Jianhua Zhao (Nanjing University, China) Huibiao Zhu (East China Normal University, China)

1 0

Call for Papers (ICTAC 2013)
by Huibiao Zhu 05 Nov '12

05 Nov '12

*************************************************************** ICTAC 2013 10th International Colloquium on Theoretical Aspects of Computing *** Call For Papers *** September 4-6, 2010 Shanghai, China http://ictac2013.ecnu.edu.cn/ *************************************************************** ICTAC 2013 is the 10th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2013 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. THEMES AND TOPICS OF PAPERS ICTAC 2013 calls for regular research papers on theories of computation and programming, foundations of software engineering, and on formal techniques in software design and verification; short papers on recent work or proposals of challenges in new programming paradigms such as Cyber-Physical Systems, Cloud Computing and Social Networks; and papers about tools that support formal techniques for software modeling, system design and verification. The topical areas of the conference include, but not limited to Automata theory and formal languages; Principles and semantics of programming languages; Theories of concurrency, mobility and reconfiguration; Logics and their applications; Software architectures and their models, refinement and verification; Relationship between software requirements, models and code; Program static and dynamic analysis and verification; Software specification, refinement, verification and testing; Model checking and theorem proving; Models of object and component systems; Coordination and feature interaction; Integration of theories, formal methods and tools for engineering computing systems; Service-oriented architectures: models and development methods; Models of concurrency, security, and mobility; Theory of distributed, grid and cloud computing; Real-time, embedded, hybrid and cyber-physical systems; Type and category theory in computer science; Models for learning and education; Case studies, theories, tools and experiments of verified systems; Domain-specific modeling and technology: examples, frameworks and experience. Challenges and foundations in the environmental modeling and monitoring, healthcare, and disaster management. PUBLICATION AND SUBMISSION As for the past editions, it is the plan that the proceedings of ICTAC 2013 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2013 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be Regular Papers, Short Papers or Tool Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 18 pages and Short Papers and tool papers should be between 5 and 10 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers must be submitted at http://www.easychair.org/conferences/?conf=ictac2013. Short papers and tool papers must contain clear reference to the background theories and techniques; and a tool paper must further provide a link to a webpage that contains a tutorial and demo of the tool. All queries should be sent to the e-mail address ictac2013(a)sei.ecnu.edu.cn. IMPORTANT DATES Paper submission deadline: 8 March 2013 Paper Accept/Reject Notification: 26 Apr 2013 Final paper submission: 17 May 2013 Conference dates: 4 --- 6 September 2013 ASSOCIATED EVENTS Festschrift Symposium in Honor of Prof. He Jifeng: 01-03 September 2013 Summer School on Software Engineering: 26-30 August 2013 CONFERENCE CHAIRS Zhou Chaochen, Software Institute, Chinese Academy of Sciences Peter Haddawy, UNU-IIST, Macau SAR, China Bill Roscoe, University of Oxford, UK PROGRAMME CHAIRS Zhiming Liu, UNU-IIST, Macau SAR, China Jim Woodcock, University of York, UK Huibiao Zhu, East China Normal University PROGRAMME COMMITTEE Farhad Arbab (CWI and Leiden University, The Netherlands) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Zhenbang Chen (National University of Defense Technology, China) Van Hung Dang (University of Engineering and Technology, Vietnam) Thao Dang (VERIMAG, France) David Deharbe (Universidade Federal do Rio Grande do Norte, Brasil) Jinsong Dong (National University of Singapore, Singapore) Meenakshi Dsouza (IIIT, India) Zhenhua Duan (Xidian University, China) John Fitzgerald (Newcastle University, UK) Martin Fr?nzle (Carl von Ossietzky Universit?t Oldenburg, Germany) Marcelo Frias (Instituto Tecnologico Buenos Aires, Argentina) Lindsay Groves (Victoria University of Wellington, New Zealand) Kim Guldstrand Larsen (Aalborg University, Denmark) Ian J. Hayes (University of Queensland, Australia) Zhenjiang Hu (NII, Japan) Lei Ju (Shandong University, China) Daniel Kroening (Oxford University, UK) Martin Leucker (University of Lübeck, Germany) Zhiming Liu (UNU-IIST, Macau SAR, China) Annabelle Mciver (Macquarie University, Australia) Dominique Mery (Université de Lorraine, France) Tobias Nipkow (Technische Universit?t München, Germany) Paritosh Pandya (TIFR, India) Jun Pang (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Abhik Roychoudhury (National University of Singapore, Singapore) Augusto Sampaio (Federal university of Pernambuco, Brasil) Ondrej Sery (University of Lugano, Switzerland) Natarajan Shankar (SRI, US) Marjan Sirjani (Reykjavik University, Iceland) Andrzej Tarlecki (Warsaw University, Poland) Mark Utting (The University of Waikato, New Zealand) Tarmo Uustalu (Tallinn University of Technology, Estonia) Farn Wang (National Taiwan University, Taiwan) Burkhart Wolff (University Paris-Sud, France) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Naijun Zhan (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Jianhua Zhao (Nanjing University, China) Huibiao Zhu (East China Normal University, China)

1 0

ANNOUNCE: connection
by Vincent Hanquez 04 Nov '12

04 Nov '12

Hi Haskellers, I'm pleased to announce the release of connection. Connection is the pinnacle of most of my network related packages, and wrap together all the libraries needed to provide a easy and smooth experience to open client connection. It provides very simple access to SOCKS and TLS along with normal raw client socket. The goal is to hide most complicated settings either completely or re-expose them more simply, and provide safe defaults. repository: https://github.com/vincenthz/hs-connection hackage: http://hackage.haskell.org/package/connection Two simple examples (more can be find in the README on github): - opening a raw connection to www.example.com port 80: ctx <- initConnectionContext connectTo ctx $ ConnectionParams { connectionHostname = "www.example.com" , connectionPort = fromIntegral 80 , connectionUseSecure = Nothing , connectionUseSocks = Nothing } - opening a TLS connection to www.example.com port 443: ctx <- initConnectionContext connectTo ctx $ ConnectionParams { connectionHostname = "www.example.com" , connectionPort = fromIntegral 443 , connectionUseSecure = Just def , connectionUseSocks = Nothing } Enjoy, do reports bug and suggestions the usual way (on github issue tracker or by email) -- Vincent @vincenthz

1 0

ANNOUNCE: vty-ui 1.6 released
by Jonathan Daugherty 03 Nov '12

03 Nov '12

Greetings, I'm happy to announce the release of version 1.6 of the vty-ui package. This release focuses on the following changes, some of which resolved long-standing GitHub issues: * Most uses of 'String' were replaced with 'Data.Text.Text'. * All built-in widgets are now capable of handling "wide" unicode characters (i.e., those requiring two terminal cells instead of one). Corresponding support code is provided for widget authors. * Support for GHC 7.6 (with the help of the 'vty' package). To realize support for wide characters, the text and text editing widgets were heavily refactored. As an added bonus, the text editor widget now uses a zipper under the hood[1]. This resulted in a signficant implementation and interface cleanup as well as added testability and more QuickCheck properties. You can obtain the release on Hackage or from the vty-ui project site at http://jtdaugherty.github.com/vty-ui/ The user's manual for 1.6 can be obtained at http://jtdaugherty.github.com/vty-ui/manuals/vty-ui-users-manual-1.6.pdf For a comprehensive list of API changes and other noteworthy trivia, see https://github.com/jtdaugherty/vty-ui/blob/master/CHANGELOG As always, check out the demo programs to get a feel for what the library can do. Thanks to Corey O'Connor, the maintainer of vty, for fixing bugs and exposing unicode character width functionality in vty. Thanks also to the folks on the GitHub issues who patiently waited for me to find time to do all of the work that went into this release. :) Enjoy! [1] Graphics.Vty.Widgets.TextZipper. -- Jonathan Daugherty Software Engineer Galois, Inc.

1 0

Haskell Weekly News: Issue 249
by Daniel Santa Cruz 02 Nov '12

02 Nov '12

Welcome to issue 249 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of October 21 to October 27, 2012. Quotes of the Week * johnw: ah terminology, just when you think you know something, they redefined "know"... * lispy: The crappy thing about using partial fun*** Exception: Pattern match failure * shachaf: This Useful Information information brought to you by: ghci, and: the letter t * edwardk: i should have picked a better name to minimize confusion cmccann: huh. that's not something I ever expected to hear edwardk say * beaky: why did they settle on bitshiftrightassign (>>=) for monadic bind? Top Reddit Stories * Why is this simple text processing program so much slower than in dynamic languages? Domain: honza.ca, Score: 64, Comments: 189 On Reddit: [1] http://goo.gl/jW5ow Original: [2] http://goo.gl/pPzIb * Fay slides Domain: fay-lang.org, Score: 50, Comments: 42 On Reddit: [3] http://goo.gl/0UM4T Original: [4] http://goo.gl/h8iZE * Haskell for all: "Hello, core!" Domain: haskellforall.com, Score: 48, Comments: 6 On Reddit: [5] http://goo.gl/qXRd2 Original: [6] http://goo.gl/9cBeo * Haskell job opening at Functor AB Domain: alpmestan.com, Score: 35, Comments: 5 On Reddit: [7] http://goo.gl/hQmoa Original: [8] http://goo.gl/ASA9c * Enemy of the Mutable State Domain: ozonehouse.com, Score: 32, Comments: 10 On Reddit: [9] http://goo.gl/Wn3Yv Original: [10] http://goo.gl/r18by * Gloss(ish) and Fay: An Example Domain: zelda.designacourse.com, Score: 29, Comments: 7 On Reddit: [11] http://goo.gl/rtR9Y Original: [12] http://goo.gl/1cF0z * Yesodweb: Future work to improve the performance of Warp Domain: yesodweb.com, Score: 25, Comments: On Reddit: [13] http://goo.gl/0YF64 Original: [14] http://goo.gl/fq7ds * (a,b,c,d) as sugar for (a,(b,(c,d))) ? Domain: self.haskell, Score: 23, Comments: 37 On Reddit: [15] http://goo.gl/cc30R Original: [16] http://goo.gl/cc30R * Using Cloud Haskell in HPC Cluster Domain: malcodigo.blogspot.com.es, Score: 23, Comments: On Reddit: [17] http://goo.gl/LxmqY Original: [18] http://goo.gl/ycmZr * Haskell Platform 2012.4.0.0 release candidates Domain: trac.haskell.org, Score: 23, Comments: 3 On Reddit: [19] http://goo.gl/B4MNc Original: [20] http://goo.gl/Q4fHP Top StackOverflow Questions * Concrete example showing that monads are not closed under composition (with proof)? votes: 24, answers: 3 Read on SO: [21] http://goo.gl/sys7F * Why is there no IO transformer in Haskell? votes: 15, answers: 2 Read on SO: [22] http://goo.gl/04Xc7 * Is it possible to make GHC optimize (deforest) generic functions such as catamorphisms? votes: 14, answers: 1 Read on SO: [23] http://goo.gl/f4ZlU * Confused by the meaning of the 'Alternative' type class and its relationship to other type classes votes: 13, answers: 5 Read on SO: [24] http://goo.gl/RXNuV * How to add fields that only cache something to ADT? votes: 13, answers: 0 Read on SO: [25] http://goo.gl/FjLlX * How to reliably compare runtime of Haskell and C? votes: 10, answers: 1 Read on SO: [26] http://goo.gl/R7whA * Currying Product Types votes: 10, answers: 3 Read on SO: [27] http://goo.gl/7gxIS * Modular Program Design - Combining Monad Transformers in Monad Agnostic functions votes: 9, answers: 2 Read on SO: [28] http://goo.gl/8rh1B * Is there a nicer way to apply a function to both elements of a pair in a list than a list comprehension? votes: 9, answers: 3 Read on SO: [29] http://goo.gl/JF3p5 * How unpacking strict fields goes together with polymorphism? votes: 9, answers: 1 Read on SO: [30] http://goo.gl/58MuT Until next time, Daniel Santa Cruz References 1. http://honza.ca/2012/10/haskell-strings 2. http://www.reddit.com/r/haskell/comments/120h6i/why_is_this_simple_text_pro… 3. http://fay-lang.org/fay-talk/ 4. http://www.reddit.com/r/haskell/comments/11yrpi/fay_slides/ 5. http://www.haskellforall.com/2012/10/hello-core.html 6. http://www.reddit.com/r/haskell/comments/11vuzz/haskell_for_all_hello_core/ 7. http://alpmestan.com/posts/2012-10-23-haskell-job-opening-at-functor.html 8. http://www.reddit.com/r/haskell/comments/11yf8c/haskell_job_opening_at_func… 9. http://www.ozonehouse.com/mark/enemy/ 10. http://www.reddit.com/r/haskell/comments/125zt0/enemy_of_the_mutable_state/ 11. http://zelda.designacourse.com/codeworld.html 12. http://www.reddit.com/r/haskell/comments/126vdk/glossish_and_fay_an_example/ 13. http://www.yesodweb.com/blog/2012/10/future-work-warp 14. http://www.reddit.com/r/haskell/comments/11w7wv/yesodweb_future_work_to_imp… 15. http://www.reddit.com/r/haskell/comments/11ysa5/abcd_as_sugar_for_abcd/ 16. http://www.reddit.com/r/haskell/comments/11ysa5/abcd_as_sugar_for_abcd/ 17. http://malcodigo.blogspot.com.es/2012/10/using-cloud-haskell-in-hpc-cluster… 18. http://www.reddit.com/r/haskell/comments/122m6y/using_cloud_haskell_in_hpc_… 19. http://trac.haskell.org/haskell-platform/wiki/ReleaseCandidates 20. http://www.reddit.com/r/haskell/comments/124kje/haskell_platform_2012400_re… 21. http://stackoverflow.com/questions/13034229/concrete-example-showing-that-m… 22. http://stackoverflow.com/questions/13056663/why-is-there-no-io-transformer-… 23. http://stackoverflow.com/questions/13099203/is-it-possible-to-make-ghc-opti… 24. http://stackoverflow.com/questions/13080606/confused-by-the-meaning-of-the-… 25. http://stackoverflow.com/questions/13098448/how-to-add-fields-that-only-cac… 26. http://stackoverflow.com/questions/13009728/how-to-reliably-compare-runtime… 27. http://stackoverflow.com/questions/13080074/currying-product-types 28. http://stackoverflow.com/questions/13007123/modular-program-design-combinin… 29. http://stackoverflow.com/questions/13022720/is-there-a-nicer-way-to-apply-a… 30. http://stackoverflow.com/questions/13098375/how-unpacking-strict-fields-goe…

1 0

Call for Contributions - Haskell Communities and Activities Report, November 2012 edition
by Janis Voigtländer 01 Nov '12

01 Nov '12

Dear all, I would like to collect contributions for the 23rd edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 November 2012 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the May 2012 edition --- you will find interesting projects described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2012/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2012/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please use lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached the editor, and not ended up in a spam folder? A: Prior to publication of the final report, the editor will send a draft to all contributors, for possible corrections. So if you do not hear from the editor within two weeks after the deadline, it is safer to send another mail and check whether your first one was received.

1 1

ANNOUNCE: btree-concurrent
by Johan Brinch 31 Oct '12

31 Oct '12

Greetings Haskellers, We are pleased to announce this new package, featuring a concurrent b-tree developed as part of our master's thesis on backup systems. The package features code related to STM, caching, QuickCheck and of course concurrency and parallelism. And it's also on Hackage: http://hackage.haskell.org/package/btree-concurrent In case the build fails on Hackage and the documentation doesn't work, it's also available here: http://hindsight.dk/doc/html/btree-concurrent Credits to Thomas Conway of Melbourne University, for discussions related to the implementation, and to our supervisor Ken Friis Larsen of University of Copenhagen. And now, the description of the package: ===== A backend agnostic, concurrent BTree with relaxed balance[1] written in Haskell using a mix of IO operations and pure STM. Although the code does work, it is neither production-ready nor complete. Features include: * Caching: While nodes are periodically saved on persistent storage (e.g. disk) they are cached in-memory during operations. * Live flushing: It is possible to save the current version of the tree to disk and run modifying operations at the same time. The nodes are updated buttom-up to ensure a valid tree in the case of a crash. * Backend agnosticism: A simple API is used as an abstraction for the persistent storage. * Verification: The test-suite uses QuickCheck to compare the trees behaviour to that of Data.Map. Deficients include: * Memory greedy. Nodes are not stored in a compact fashion and are constantly being serialised/deserialised. * findMin and findMax are incomplete and may fail (see the TODO for details). * The implementation does not parallelise well. [1] B-trees with relaxed balance, K. S. Larsen & R. Fagerberg, Parallel Processing Symposium, 1995. Proceedings., 9th International -- Johan Brinch & Morten Brøns-Pedersen

2 2

TAP 2013: 1st Call for Papers
by Achim D. Brucker 30 Oct '12

30 Oct '12

(Apologies if you receive this announcement multiple times. We also apologize for resending the first call for papers, the original announcement contained an incorrect URL to easychair.) **************************************************** *** *** *** TAP 2013 *** *** *** *** Abstract submission: January 25, 2013 *** *** Paper submission: February 1, 2013 *** **************************************************** *** TAP 2013 solicits both full papers and *** *** (industrial) experience/tool papers *** *** in combining proofs and (security) testing *** **************************************************** CALL FOR PAPERS 7th INTERNATIONAL CONFERENCE ON TESTS AND PROOFS (TAP 2013) http://www.spacios.eu/TAP2013 Budapest, Hungary, June 17-21, 2013 The TAP conference is devoted to the synergy of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Testing and proving seem to be contradictory techniques: once you have proved your program to be correct then additional testing seems pointless; on the other hand, when such a proof in not feasible, then testing the program seems to be the only option. This view has dominated the research community since the dawn of computer science, and has resulted in distinct communities pursuing the seemingly orthogonal research areas. However, the development of both approaches has lead to the discovery of common issues and to the realization of potential synergy. Perhaps, use of model checking in testing was one of the first signs that a counterexample to a proof may be interpreted as a test case. Recent breakthroughs in deductive techniques such as satisfiability modulo theories, abstract interpretation, and interactive theorem proving, have paved the way for new and practically effective methods of powering testing techniques. Moreover, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectiveness. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations, and include (other topics related to TAP are welcome): - Bridging the gap between concrete and symbolic techniques, e.g. using proof search in satisfiability modulo theories solvers to enhance various testing techniques - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Domain specific applications of testing and proving to new application domains such as validating security protocols, vulnerability detection of programs, security Important Dates: ================ Abstract submission: January 25, 2013 Paper submission: February 1, 2013 Notification: March 3, 2013 Camera ready version: April 5, 2013 TAP conference: June 17-21, 2013 Program Chairs: =============== Margus Veanes (Microsoft Research, USA) Luca Vigano` (University of Verona, Italy) Program Committee: ================== TBA Submission: =========== Please submit your papers via easychair https://www.easychair.org/conferences/?conf=tap2013 (submission page to be opened in due time) TAP 2013 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Subject to final approval by Springer, accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP AG, SAP Research Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe, Phone: +49 6227 7-52595 http://www.brucker.ch

1 0

ICFP 2013: Call for workshops and co-located events
by David Van Horn 29 Oct '12

29 Oct '12

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2013 18th ACM SIGPLAN International Conference on Functional Programming September 22 - 28, 2013 Boston, Massachusetts, USA http://icfpconference.org/icfp2013/ The 18th ACM SIGPLAN International Conference on Functional Programming will be held in Boston, Massachusetts on September 22-28, 2013. 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 2013 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 22-24 (the three days before ICFP) and September 28 (the day after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 7, 2012 Notification of acceptance: January 7, 2013 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 2013 workshop co-chairs (Patrik Jansson and Sam Tobin-Hochstadt), via email to icfp13-workshops(a)ccs.neu.edu by December 7, 2012. (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 January 7, 2013, 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/icfp2013/icfp13-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 2013 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Patrik Jansson (Chalmers University of Technology) Workshop Co-Chair: Sam Tobin-Hochstadt (Northeastern University) General Chair : Greg Morrisset (Harvard University) Program Chair: Tarmo Uustalu (Tallinn University of Technology) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Patrik Jansson and Sam Tobin-Hochstadt), via email to icfp13-workshops(a)ccs.neu.edu

1 0