December 2009 - Haskell

hledger 0.7 released
by Simon Michael 12 Dec '09

12 Dec '09

I'm pleased to announce hledger 0.7. Thanks to Marko Kocić who contributed many fixes for hlint warnings. To install/upgrade: cabal update && cabal install hledger [-fweb] [- fvty] Documentation: http://hledger.org Release notes: * price history support (first cut): P directives now work, though differently from c++ ledger. Each posting amount takes its fixed unit price from the price history (or @) when available. This is simple and useful for things like foreign currency expenses (but not investment tracking). Like ledger, balance and register don't show amount prices any more, and don't separate differently-priced amounts. Unlike ledger, print shows all amount prices, and supports -B. * --effective option, will use transactions' effective dates if any * convert: new rules file format, find/create rules file automatically, more robust parsing, more useful --debug output * print: always sort by date, fix long account name truncation, align amounts, show end of line comments, show all amounts for clarity (don't elide the final balancing amount) * ui: use vty 4, fixes non-ascii and gnome terminal problems (issues #3, #4) * web: allow data entry, react to data file changes, better layout, help links, remove histogram command and filter fields for now, fix bad localhost redirect, filter form did not work in eg firefox (issue #7), reset link did not work in all browsers * parsing: require whitespace between date and status code, allow (and ignore) a time in price records, better error messages, non-zero exit code on parse failure * display non-ascii error messages properly (issue #5) * fix an arithmetic bug that occasionally rejected valid transactions * fix a regex bug in showtree * don't break if HOME is undefined * --debug now implies --verbose * add functional tests like ledger's, use test-framework for speedy running, release shelltestrunner as a separate package * many hlint cleanups (Marko Kocić) * many site and documentation updates Stats: 2 contributors, 175 days since release, 182 commits, 3320 non-test code lines, 97 tests, 53% test coverage, performance: similar (http://hledger.org/profs/200912111852.bench) Best, -Simon

1 0

Lots of Haskell at PEPM 2010 - Call for Participation
by Janis Voigtländer 08 Dec '09

08 Dec '09

Hi all, If you are planning to go to Madrid in January, for POPL, don't forget registering for PEPM as well! If you haven't yet been planning to go, maybe you want to reconsider, for PEPM if not for POPL. Why, you ask? Well, the PEPM program has *lots* of Haskell this year. Indeed, no fewer than 10 of the 21 presentations are directly related to Haskell. And the other papers are great, too, and many of them will be interesting to Haskell folk as well. Scan the speakers and titles below, and you will know why I think you won't want to miss out on that one. Best regards, Janis. =============================================================== CALL FOR PARTICIPATION ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM'10) Madrid, January 18-19, 2010 (Affiliated with POPL'10) http://www.program-transformation.org/PEPM10 =============================================================== Abstracts of all papers and presentations are available from the above web site. INVITED TALKS: * Lennart Augustsson (Standard Chartered Bank, UK) Title: O, Partial Evaluator, Where Art Thou? * Jeremy Siek (University of Colorado at Boulder, USA) Title: General Purpose Languages Should be Metalanguages. CONTRIBUTED TALKS: * Nabil el Boustani and Jurriaan Hage. Corrective Hints for Type Incorrect Generic Java Programs. * Johannes Rudolph and Peter Thiemann. Mnemonics: Type-safe Bytecode Generation at Run Time. * Elvira Albert, Miguel Gomez-Zamalloa and German Puebla. PET: A Partial Evaluation-based Test Case Generation Tool for Java Bytecode. * Martin Hofmann. Igor2 - an Analytical Inductive Functional Programming System. * José Pedro Magalhães, Stefan Holdermans, Johan Jeuring and Andres Löh. Optimizing Generics Is Easy! * Michele Baggi, María Alpuente, Demis Ballis and Moreno Falaschi. A Fold/Unfold Transformation Framework for Rewrite Theories extended to CCT. * Hugh Anderson and Siau-Cheng KHOO. Regular Approximation and Bounded Domains for Size-Change Termination. * Évelyne Contejean, Pierre Courtieu, Julien Forest, Andrei Paskevich, Olivier Pons and Xavier Urbain. A3PAT, an Approach for Certified Automated Termination Proofs. * Fritz Henglein. Optimizing Relational Algebra Operations Using Generic Equivalence Discriminators and Lazy Products. * Adrian Riesco and Juan Rodriguez-Hortala. Programming with Singular and Plural Non-deterministic Functions. * Martin Hofmann and Emanuel Kitzelmann. I/O Guided Detection of List Catamorphisms. * Andrew Moss and Dan Page. Bridging the Gap Between Symbolic and Efficient AES Implementations. * Christopher Brown and Simon Thompson. Clone Detection and Elimination for Haskell. * Stefan Holdermans and Jurriaan Hage. Making Stricterness More Relevant. * Arun Lakhotia, Davidson Boccardo, Anshuman Singh and Aleardo Manacero Júnior. Context-Sensitive Analysis of Obfuscated x86 Executables. * Xin Li and Mizuhito Ogawa. Conditional Weighted Pushdown Systems and Applications. * Ivan Lazar Miljenovic. The SourceGraph Program. * Florian Haftmann. From Higher-Order Logic to Haskell: There and Back Again. SPECIAL FEATURE: * Andy Gill, Garrin Kimmell and Kevin Matlage. Capturing Functions and Catching Satellites. IMPORTANT DATES: * Early registration deadline: December 22, 2009 * Hotel registration deadline: December 28, 2009

1 0

Call for Participation: PLPV 2010
by Jean-Christophe Filliâtre 07 Dec '09

07 Dec '09

********************************************************************* CALL FOR PARTICIPATION PLPV 2010 The Fourth ACM SIGPLAN Workshop on Programming Languages meets Program Verification 19 January 2010 Madrid, Spain To be held in conjunction with POPL 2010 http://slang.soe.ucsc.edu/plpv10/ ********************************************************************* IMPORTANT DATES Hotel reservation deadline: December 28, 2009 (Monday) VENUE PLPV'10 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for PLPV'10, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic and/or structural properties of the programming language. One example is dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms. Another example is extended static checking systems like ESC/Java and Spec#, which incorporate pre- and postconditions along with a static verifier for these contracts. INVITED SPEAKER Gilles Barthe, Madrid Instutite for Advanced Studies PRELIMINARY PROGRAM ---------------------- Invited Talk (9:00 - 10:00) * CertiCrypt: Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe, Madrid Instutite for Advanced Studies Session 1 (10:30 - 12:00) * Singleton types here, Singleton types there, Singleton types everywhere Stefan Monnier and David Haguenauer * Operating system development with ATS Matthew Danish and Hongwei Xi * Modular Reasoning about Invariants over Shared State with Interposed Data Members Stephanie Balzer and Thomas Gross Session 2 (2:00 - 3:00) * Resource Typing in Guru Aaron Stump and Evan Austin * Free Theorems for Functional Logic Programs Jan Christiansen, Daniel Seidel and Janis VoigtlÃ¤nder Discussion (3:00 - 3:30) * Status update and discussion of the Trellys Project Session 3 (4:00 - 5:00) * Arity-generic datatype-generic programming Stephanie Weirich and Chris Casinghino * Challenge Benchmarks for Veriï¬cation of Real-time Programs Tomas Kalibera, Gary Leavens and Jan Vitek ---------------------- PROGRAM CHAIRS * Cormac Flanagan (University of California, Santa Cruz) * Jean-Christophe FilliÃ¢tre (CNRS) PROGRAM COMMITTEE * Adam Chlipala (Harvard University) * Ranjit Jhala (University of California, San Diego) * Joseph Kiniry (University College Dublin) * Rustan Leino (Microsoft Research) * Xavier Leroy (INRIA Paris-Rocquencourt) * Conor McBride (University of Strathclyde) * Andrey Rybalchenko (Max Planck Institute for Software Systems) * Tim Sheard (Portland State University) * Stephanie Weirich (University of Pennsylvania)

1 0

The Haskell Web News: December 2009 Edition
by Don Stewart 07 Dec '09

07 Dec '09

The Haskell Web News is a monthly summary of the hottest news about the Haskell programming language, as found in our online communities. If you want to catch up with what’s been happening in Haskell, this might be the journal for you. http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-decembe… What’s been happening with the Haskell programming language for the past month, as voted by readers of The Haskell Reddit. This is the first edition of the Web News, so feedback on the content, schedule and goals is welcome. -- Don

4 5

ANN: readline-statevar-1.0.1.0
by Krzysztof Skrzętnicki 06 Dec '09

06 Dec '09

Hello I am happy to announce a release of small package called readline-statevar. It's a small wrapping library around readline, which in turn wraps libreadline. The reason I wrote it is because I wasn't happy with the API of readline. It was composed of tons of functions like setX/getX, where there could be just one StateVar instead, yielding OpenGL-kind API. This version aims to match readline-1.0.1.0. (Hence the version number chosen). I wrote it mostly manually, with a little help from my emacs-fu, so there is a chance I missed a thing or two. There is git repo available [1], along with issue tracker [2] and Hackage page [3]. Feel encouraged to: > cabal update > cabal install readline-statevar And give it a try! Best regards Krzysztof Skrzętnicki [1] http://github.com/Tener/haskell-readline-statevar/ [2] http://github.com/Tener/haskell-readline-statevar/issues [3] http://hackage.haskell.org/package/readline-statevar

2 1

Haskell Weekly News: Issue 142 - December 05, 2009
by jfredett＠gmail.com 05 Dec '09

05 Dec '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091205 Issue 142 - December 05, 2009 --------------------------------------------------------------------------- Welcome to issue 142 of HWN, a newsletter covering developments in the [1]Haskell community. Occasionally, I have something silly or clever to say here. Usually I give a summary of the weeks news and end it with a bit of a cliche tagline, however, this is finals week, and as such, there is absolutely no brain cells left working to come up with any cleverness for here. I'll see you next week with (hopefully) more ability for humor. Until next week, the Haskell Weekly News! Announcements error-message. Gregory Crosswhite [2]announced a package for handling errors in haskell. To quote his message directly, 'If there is one thing that we really don't have enough of in Haskell, it is *ways to handle errors*!' atom-0.1.3. Tom Hawkins [3]announced a new version of the Atom DSL for designing hard realtime embedded software. Blueprint 0.1 -- PREVIEW. Gregory Crosswhite [4]announced a preview version of his 'Blueprint' configuration package. haskell-mode 2.7.0. Svein Ove Aas [5]announced another release of Haskell-mode for Emacs graphviz-2999.7.0.0. Ivan Lazar Miljenovic [6]announced a new version of his set of bindings to the graphviz tools for visualizing graphs. Haskell Job Openings (Pune, IN). Tom Hawkins [7]announced some job openings in Eaton's engineering center in Pune, India. SaC Tutorial at PPoPP 2010. Clemens Grelck [8]announced a tutorial to be held at PPoPP on SAC and it's auto-parallelizing compiler SAC2C. Call for papers: PAPP 2010, 7th International Workshop on Practical Aspects of High-level Parallel Programming. Clemens Grelck [9]announced a call for papers for the Seventh International Workshop on Practical Aspects of High-level Parallel Programming. PhD Studentships in Nottingham. Graham Hutton [10]announced some PhD openings at the University of Nottingham. Second Call for Copy: Monad.Reader Issue 15. Brent Yorgey [11]announced a second call for copy for the Monad.Reader. 3 full professor positions at DIKU. Fritz Henglein [12]announced three open professor positions at the the Department of Computer Science at the University of Copenhagen ([13]DIKU). Hubris 0.0.2, the Ruby-Haskell bridge. Mark Wotton [14]announced a new version of the Hubris package is now available on hackage. Discussion You are in a twisty maze of concurrency libraries, all different ... Patrick Caldon [15]asked about the 'right' concurrency package to use for his project. Greetings! 2D Graphics? M Xyz [16]asked (enthusiatically) about different ways to do 2-dimensional graphics in Haskell. Wikipedia article. Simon Marlow [17]rallied us all into fixing the (or at least starting to fix) wikipedia page for Haskell. Great Programs to Read? Michael Lesniak [18]asked about what programs were worth reading. Blog noise [19]Haskell news from the [20]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Michael Snoyman: [21]String-like. * Claude Heiland-Allen: [22]Heist: dataflow algebra. * Adam Jones: [23]Lambda Calculus Compiler: Part III: First-Order Functions. * Holumbus: [24]Hayoo! Update âŠ Again. * Mikael Vejdemo Johansson (Syzygy-): [25][MATH198] Lecture 10 (last lecture) posted. * Neil Brown: [26]Automated Wiring of Message-Passing Processes. * Computer Systems Design Laboratory at the University of Kansas: [27]ChalkBoard Release. * Bryan O'Sullivan: [28]Dense? Dense, you say?. * Ivan Lazar Miljenovic: [29]Waddaya know, testing WORKS!. * Ivan Lazar Miljenovic: [30]If wishes were tests, code would be perfect. * Ivan Lazar Miljenovic: [31]The Problems with Graphviz. Quotes of the Week * Badger: one does not simply >>= into mordor * Apocalisp: data CanHaz a = Haz a | ButIEatedIt * Apocalisp: You can't have your baby and eat it too * Dave_Benjamin: please talk to your son or daughter about parametric polymorphism * Cale: Beginners are confusing to beginners. I move that we remove them from the language altogether. * monochrom: I am 17-ary, going on 18-ary, I can take curry of you * jmillikin: [the real world is] an implementation detail of IO, pay it no mind * monochrom,ezyang: The Principle Of Idiot Savant: any sufficiently misguided opinion is indistinguishable from deep insight * Cale: I swear that most of higher-dimensional category theory must have been arrived at by some guys sitting around in a room with a blackboard and saying "What if a drew a diagram like *THIS*!?" and drawing some insane scribble up on the blackboard, and then everyone tries to figure out how to turn it into meaningful mathematics. * jbe: Here I am, happy my code compiles, and the runtime is thumbing its nose at Turing. * Ferdirand: I was TA for a C++ programming course aimed at 1st year physics once. Some girl asked for help "i wrote pseudo-code but I cannot translate it to C++". Her pseudo-code was valid haskell. I cried. * mmorrow: [regarding excessive use of categorical recursion schemes] a morphasm? * copumpkin: I'm on a rollomorphism * dons: but rumours are remarkably common when it comes to haskell * monochrom: If you read a haskell book or an FP book, by chapter 5 it's already doing data structures. It's chapter 10 in imperative books. About the Haskell Weekly News New editions are posted to [32]the Haskell mailing list as well as to [33]the Haskell Sequence and [34]Planet Haskell. [35]RSS is also available, and headlines appear on [36]haskell.org. To help create new editions of this newsletter, please see the information on [37]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [38]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67149 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67090 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66924 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66923 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66920 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66904 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17661 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17660 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17659 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17657 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17656 13. http://www.diku.dk/ 14. http://article.gmane.org/gmane.comp.lang.haskell.general/17653 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67211 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67184 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67158 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66917 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://snoyberg.wordpress.com/2009/12/04/string-like/ 22. http://claudiusmaximus.goto10.org/cm/2009-12-04_heist_dataflow_algebra.html 23. http://blog.finiteimprobability.com/2009/12/03/lambda-calculus-compiler-par… 24. http://holumbus.fh-wedel.de/blog/?p=28 25. http://blog.mikael.johanssons.org/archive/2009/12/math198-lecture-10-last-l… 26. http://chplib.wordpress.com/2009/12/02/automated-wiring-of-message-passing-… 27. http://www.ittc.ku.edu/csdlblog/?p=25 28. http://www.serpentine.com/blog/2009/12/01/dense-dense-you-say/ 29. http://ivanmiljenovic.wordpress.com/2009/11/17/waddaya-know-testing-works/ 30. http://ivanmiljenovic.wordpress.com/2009/11/26/if-wishes-were-tests-code-wo… 31. http://ivanmiljenovic.wordpress.com/2009/11/30/the-problems-with-graphviz/ 32. http://www.haskell.org/mailman/listinfo/haskell 33. http://sequence.complete.org/ 34. http://planet.haskell.org/ 35. http://sequence.complete.org/node/feed 36. http://haskell.org/ 37. http://haskell.org/haskellwiki/HWN 38. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

SaC Tutorial at PPoPP 2010
by Clemens Grelck 03 Dec '09

03 Dec '09

--------------------------------------------------------------------- Please accept our apologies if you have received multiple copies. Please feel free to distribute it to those who might be interested. --------------------------------------------------------------------- ********************************************************************* * * * Call for Participation * * * * TUTORIAL * * on * * SAC AND ITS AUTO-PARALLELISING COMPILER SAC2C * * * * January 9, 2010 * * Bangalore, India * * * * 15th ACM SIGPLAN Annual Symposium on * * Principles and Practice of Parallel Programming * * (PPoPP 2010) * * * * http://events.sac-home.org/ppopp/ * * * ********************************************************************* Background and Content The non-deterministic semantics of concurrent execution of main-stream languages, combined with the difficulties in debugging concurrency-specific bugs like race conditions, render software engineering for concurrent architectures challenging and time consuming. The data-parallel approach towards concurrent programming with its deterministic semantics and simple synchronisation seems to be a good fit to solve these problems. With the availability of commercial frameworks for data-parallel and stream computation like CUDA and Intel's Ct, data-parallel programming seems to be ready for the main-stream. However, given the number of "interesting" architectures available, using a hardware bound implementation language cannot be the solution. In this tutorial we present a completely implicit, architecture neutral approach for programming modern multi- and many-core architectures. It is based on a high-level language featuring a data-parallel programming style. SaC (for Single Assignment C) is a functional array language which combines a C-like syntax with a purely functional semantics. This approach enables successful auto-parallelisation on various architectures including SMPs and GPGPUs. Over the last 15+ years, we have developed the auto-parallelising compiler sac2c. With more than 300,000 lines of code, it implements over 50 high-level program optimisations. The functional basis of SAC enables these optimisations to systematically transform high-level specifications into fine-tuned, target-architecture-specific code. The generated intermediate C-code can be compiled using any C99-compliant compiler. The runtime system of sac2c features, among other aspects, a micro-thread scheduler as well as a tailor-made, multi-threaded memory management for highly efficient concurrent execution. Organisation The tutorial consists of four parts: * an introduction into the concept of data-parallelism, i.e., tackling the question of what can be expressed in a data-parallel fashion and how, * a practical session where examples are being run in an interactive fashion, * an overview of the optimisations applied by sac2c to achieve excellent sequential and parallel runtime performance on various platforms, and * a practical session where several examples and their compilation process are being studied in an interactive fashion. Important dates * Early registration deadline: December 4, 2009 * Late registration deadline: walk in * Tutorial: January 9, 2010 * PPoPP: January 9-14, 2010 Organisers * Sven-Bodo Scholz, University of Hertfordshire, Hatfield, UK * Clemens Grelck, University of Amsterdam, Netherlands * Stephan Herhut, University of Hertfordshire, Hatfield, UK -- Dr Clemens Grelck University of Amsterdam University of Hertfordshire http://www.sac-home.org/~cg

1 0

Call for papers: PAPP 2010, 7th International Workshop on Practical Aspects of High-level Parallel Programming
by Clemens Grelck 03 Dec '09

03 Dec '09

--------------------------------------------------------------------- Please accept our apologies if you have received multiple copies. Please feel free to distribute it to those who might be interested. --------------------------------------------------------------------- ---------------------------------------------------------- CALL FOR PAPERS PAPP 2010 Seventh International Workshop on Practical Aspects of High-level Parallel Programming http://lacl.univ-paris12.fr/gava/PAPP2010/ part of ICCS 2010 The International Conference on Computational Science May 31- June 2, 2010, University of Amsterdam, The Netherlands. ---------------------------------------------------------- AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Bill McColl's post "Sequential Computing Considered Harmful" is an excellent summary of today's situation. Sequential computing cannot go further. Major companies in the computing industry now recognizes the urgency of reorienting an entire industry towards massively parallel computing (Think Parallel or Perish). Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middlewares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the Seventh PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. TOPICS We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * Program verification and Formal verification of parallel applications/ libraries/languages or parallel computing in computer-assisted reasoning * high-level parallel language design, implementation and optimisation * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools * industrial uses of a high-level parallel language PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the conference proceedings published by Elsevier Science in the open-access Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website: http://www.iccs-meeting.org/iccs2010/papers/upload.php We invite you to submit a full paper of 10 pages formatted according to the rules of Procedia Computer Science (see http://www.elsevier.com/wps/find/journaldescription.cws_home/719435/descrip…) describing new and original results, no later than January 11, 2010 -HARD DEADLINE. Submission implies the willingness of at least one of the authors to register and present the paper. An early email to "gava at univ-paris12.fr" with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers should be presented at the workshop and extended and revised versions could be published in a special issue of Scalable Computing: Practice and Experience, provided revisions suggested by the referees are made. IMPORTANT DATES * January 11, 2010 - Full paper due (HARD DEADLINE) * February 15, 2010 - Notification * March 1, 2010 - Camera-ready paper due * September, 2010 - Journal version due PROGRAM COMMITTEE * Marco Aldinucci (University of Torino, Italy) * Anne Benoit (ENS Lyon, France) * Umit V. Catalyurek (The Ohio State University, USA) * Emmanuel Chailloux (University of Paris 6, France) * Frédéric Dabrowski (University of Orléans, France) * Frédéric Gava (University Paris-East (Paris 12), France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Amsterdam, Netherlands) * Hideya Iwasaki (The University of Electro-communications, Japan) * Christoph Kessler (Linkopings Universitet, Sweden) * Rita Loogen (University of Marburg, Germany) * Kiminori Matsuzaki (Kochi University of Technology, Japan) * Samuel Midkiff (Purdue University, USA) * Susanna Pelagatti (University of Pisa, Italy) * Bruno Raffin (INRIA, France) * Casiano Rodriguez-Leon (University La Laguna, Spain) ORGANIZERS Dr. Anne BENOIT Laboratoire d'Informatique du Parallélisme Ecole Normale Supérieure de Lyon 46 Allée d'Italie 69364 Lyon Cedex 07 - France Dr. Frédéric GAVA Laboratoire d'algorithmique, complexité et logique Université de Paris-Est (Paris 12) 61 avenue du Général de Gaulle 94010 Créteil cedex - France -- Dr Clemens Grelck University of Amsterdam University of Hertfordshire http://www.sac-home.org/~cg

1 0

PhD studentships in Nottingham
by Graham Hutton 03 Dec '09

03 Dec '09

Dear all, The School of Computer Science at the University of Nottingham is advertising 3 PhD studentships, with functional programming being one of the target areas. Further information about the functional programming lab within the School is available from: http://fp.cs.nott.ac.uk/ If you would like to apply, please following the instructions in the advert below. The deadline is 8th January 2010. Best wishes, Graham Hutton +-----------------------------------------------------------------+ The School of Computer Science of the University of Nottingham invites applications for 3 PhD studentships. The studentships are for 3.5 years and include 13,290 per year maintenance grant and UK/EU tuition fees. The applicants need to apply through the University postgraduate admissions system http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx The deadline for applications is the 8th of January 2010. The applications are invited in the areas listed below. Please contact the academics listed for the research area first if you are interested in applying for a PhD in their area. Functional Programming (contact Henrik Nilsson, Graham Hutton, Thorsten Altenkirch, Venanzio Capretta: {nhn, gmh, txa, vxc} at cs.nott.ac.uk) Computational Photography and Content-based Image Retrieval (contact Guoping Qiu, qiu at cs.nott.ac.uk) Computer Vision and Graphics (contact Bai Li, bai at cs.nott.ac.uk) Computational Finance (contact Rong Qu, rxq at cs.nott.ac.uk) Adaptive and Learning Systems (contact Jon Garibaldi, jmg at cs.nott.ac.uk) Intelligent Agents (contact Brian Logan and Natasha Alechina, {bsl, nza} at cs.nott.ac.uk) Computational Systems and Synthetic Biology (contact Natalio Krasnogor, nxk at cs.nott.ac.uk) Simulation of Complex Systems and Computational Modelling and Data Mining (contact Uwe Aickelin, uxa at cs.nott.ac.uk) Data mining (contact Jaume Bacardit, jqb at cs.nott.ac.uk) Document Engineering (contact Steven Bagley, srb at cs.nott.ac.uk) Opportunistic networking (contact Milena Radenkovic, mvr at cs.nott.ac.uk) Reactive Environments (contact Holger Schnadelbach, Dave Kirk: hms,dsk at cs.nott.ac.uk) Intelligent Multilevel Search Methodologies (contact Ender Ozcan, exo at cs.nott.ac.uk) +-----------------------------------------------------------------+ | Dr Graham Hutton Email : gmh(a)cs.nott.ac.uk | | Functional Programming Lab | | School of Computer Science Web : www.cs.nott.ac.uk/~gmh | | University of Nottingham | | Jubilee Campus, Wollaton Road Phone : +44 (0)115 951 4220 | | Nottingham NG8 1BB, UK | +-----------------------------------------------------------------+

1 0

Interesting experiences of test automation in Haskell? Automation of Software Test 2010
by John Hughes 03 Dec '09

03 Dec '09

This is a "heads up" about a workshop on test automation that I just joined the programme committee of. Automation of Software Test will be co-located with ICSE in Cape Town in May--the workshop home page is here: http://www.cs.allegheny.edu/ast2010/ Tools like QuickCheck, SmallCheck and HUnit fit the call for papers perfectly. So if you're doing some interesting automated testing in Haskell, why not submit a paper about it, and show a new audience what the Haskell community is up to? Both research papers and case studies are welcome, and the latter can even be in the form of a presentation of up to 15 slides--so there's no excuse for not putting something together! So how about it? It would be great to see some Haskell papers at the workshop! Deadline 20 January. John Hughes PS Check out the ICSE web site for information on the location: http://www.sbs.co.za/ICSE2010/

2 1