- Haskell - Haskell.org

ANNOUNCE: guarded-rewriting-0.1: Generic rewriting with preconditions
by José Pedro Magalhães 03 Mar '10

03 Mar '10

guarded-rewriting-0.1: Generic rewriting with preconditions ===================================================================== This is a generic rewriting library based on type classes and type families described in the paper: Thomas van Noort, Alexey Rodriguez Yakushev, Stefan Holdermans, Johan Jeuring, Bastiaan Heeren, José Pedro Magalhães. A Lightweight Approach to Datatype-Generic Rewriting. Journal of Functional Programming, Special Issue on Generic Programming, 2010. A draft version of this paper is currently available at http://dreixel.net/research/pdf/ladgr_draft.pdf. The main differences from our previous generic programming library (see http://hackage.haskell.org/package/rewriting) are the support for more datatypes (including parametrized and families of datatypes) and the possibility of adding preconditions to rewrite rules. It uses the instant-generics library, first described by Chakravarty et al. (see http://www.cse.unsw.edu.au/~chak/project/generics/) which we packaged and released separately (see http://hackage.haskell.org/package/instant-generics) Requirements ------------ * GHC 6.10.4 or later * Cabal 1.6 or later Download -------- With cabal-install: cabal install guarded-rewriting Get the package: http://hackage.haskell.org/package/guarded-rewriting Get the source: svn checkout https://subversion.cs.uu.nl/repos/project.dgp-haskell.libraries/GuardedRewr… Bugs & Support -------------- For more information visit the project homepage: http://www.cs.uu.nl/wiki/bin/view/GenericProgramming/GuardedRewriting Report issues, request features, or just discuss the library with the authors, maintainers, and other interested persons at: http://www.haskell.org/mailman/listinfo/generics

1 0

CFP CICLOPS-WLPE 2010 at FLoC (Edinburgh, 15 July)
by German Vidal 01 Mar '10

01 Mar '10

******************************************************************* Call For Papers CICLOPS-WLPE 2010 Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments Edinburgh, Scotland, U.K. July 15, 2010 http://users.dsic.upv.es/~ciclops-wlpe10/ Satellite event of the 26th International Conference on Logic Programming (ICLP 2010) http://www.floc-conference.org/ICLP-home.html ******************************************************************* Important Dates: Paper Submission: March 31, 2010 Notification of Authors: April 29, 2010 Camera-ready: May 17, 2010 (tentative) Workshop: July 15, 2010 Invited talks: Programming with Boolean Satisfaction Michael Codish, Ben-Gurion University of the Negev (Israel) Solving Constraint Satisfaction Problems by a SAT Solver Naoyuki Tamura, Kobe University (Japan) Workshop description CICLOPS is a series of colloquia on the implementation of constraint logic programming. Logic and Constraint programming is an important declarative programming paradigm. The features offered by this paradigm such as rule-basedness, pattern matching, automated backtracking, recursion, tabling, and constraint solving have been proved convenient for many programming tasks. Recent improvements in implementation technologies combined with advances in hardware and systems software have made logic and constraint programming a viable choice for many real-world problems. CICLOPS'10 continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held with in Budapest (1993) and Ithaca (1994), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and more recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (Cyprus, 2001), Copenhagen (2002), Mumbai (2003), Saint Malo (France, 2004), Sitges (Spain, 2005), Seattle (U.S.A., 2006), Porto (Portugal, 2007), Udine (Italy, 2008), and Pasadena (U.S.A, 2009). WLPE is a series of workshops on practical logic-based software development methods and tools. Software plays a crucial role in modern society. While software keeps on growing in size and complexity, it is more than ever required to be delivered on time, free of error and meeting the most stringent efficiency requirements. Thus more demands are placed on the software developer, and consequently, the need for methods and tools that support the programmer in every aspect of the software development process is widely recognized. Logic plays a fundamental role in analysis, verification and optimization in all programming languages, not only in those based directly on logic. The use of logic-based techniques in software development is a very active area in computing; emerging programming paradigms and growing complexity of the properties to be verified pose new challenges for the community, while emerging reasoning techniques can be exploited. WLPE'10 continues the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington D.C., USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges (Barcelona), Spain (2005), Seattle, USA (2006), Porto, Portugal (2007) and Udine, Italy (2008). More information about the series of WLPE workshops can be found at http://www.cs.usask.ca/projects/envlop/WLPE/ CICLOPS-WLPE 2010 aims at bringing together, in an informal setting, people involved in research in the design and implementation of logic and constraint programming languages and systems and on logic-based methods and tools which support program development and analysis. In addition to papers describing more conceptual and theoretical work, papers describing the implementation of, and experience with, such tools will be welcome. Topics: * Abstract machines and compilation techniques * Compile-time analysis and its application to code generation * Memory management, indexing, and garbage collection issues * Profiling tools and performance evaluation * Implementation of concurrent, parallel, and distributed systems * Extensions such as tabling, constraints, probabilistic reasoning, and learning * New features such as ASP and coinduction * Object-oriented and module systems * Integration with other systems such as CP, SAT, LP/MLP, and Database systems * Experiences from using systems in real-life applications * Static and dynamic analysis * Debugging and testing * Program verification and validation, * Code generation from specifications, * Termination analysis, * Constraints * Rewriting * Profiling and performance analysis, * Type and mode analysis, * Module systems, * Optimization tools, * Program understanding, * Refactoring * Logical meta-languages Authors who are interested in taking part in the workshop, but are unsure if their work falls within its scope, are invited to contact the organizers and will be given suitable advice. Submission details: All papers must be written in English, in Springer LNCS format (http://www.springeronline.com/lncs/) and not exceed 15 pages. Submissions must be made through the easychair system available at http://www.easychair.org/conferences/?conf=ciclopswlpe2010 All accepted papers will be included in the workshop proceedings to be published as a technical report and distributed at the workshop, as well as electronically at the Computing Research Repository (CoRR). Program Committee: Rafael Caballero, Complutense University Madrid, Spain Vitor Santos Costa, Universidade do Porto, Portugal Martin Gebser, University of Potsdam, Germany Samir Genaim, Complutense University of Madrid, Spain Yoshitaka Kameya, Tokyo Institute of Technology, Japan Andy King, University of Kent, UK Huiqing Li, University of Kent, U.K. Lunjin Lu, Oakland University, MI, USA Paulo Moura, Universidade da Beira Interior, Portugal Ulrich Neumerkel, Technische Universität Wien, Austria Enrico Pontelli, New Mexico State University, USA Joachim Schimpf, Monash University, Australia Peter Schneider-Kamp, University of Southern Denmark, Denmark Wim Vanhoof, University of Namur, Belgium German Vidal, Technical University of Valencia Neng-Fa Zhou, The City University of New York, NY, USA Workshop organizers: German Vidal DSIC, Universidad Politecnica de Valencia Camino de Vera S/N, 46022 Valencia, Spain http://www.dsic.upv.es/~gvidal/ Neng-Fa Zhou Department of Computer and Information Science, Brooklyn College The City University of New York 2900 Bedford Avenue, Brooklyn, NY 11210-2889 http://www.sci.brooklyn.cuny.edu/~zhou/

1 0

Call for Participation: CHR Summer School
by Jon Sneyers 01 Mar '10

01 Mar '10

- Call for Participation - First International Summer School on CHR: Programming and Reasoning with Rules and Constraints August 30 - September 3 2010 Leuven, Belgium Website: http://www.cs.kuleuven.be/~dtai/CHR/summerschool **************************************************************************** * EARLY REGISTRATION DISCOUNT: When registering (including payment) before * * March 31, the registration fee will be reduced by 20 euro! * * * * Additional early registration incentive: * * The first 7 registrants get a FREE copy of the book * * "Constraint Handling Rules - Current Research Topics" * **************************************************************************** The aim of the summer school is to familiarize the participants with state-of-the-art high-level declarative programming with rules and constraints as well as providing insights into the analysis of programs based on these concepts. The courses cover a wide range from theory to practice. The summer school will be based on the advanced high-level rule-based formalism and programming language Constraint Handling Rules (CHR) http://constraint-handling-rules.org/ Intended Audience: The summer school provides courses at various levels. It is open to anyone interested. It aims at Phd. students, but also post-docs, interested researchers and master students as well as interested parties from industry. Besides a working knowledge of English, there are no prerequisites. A basic knowledge of logic and Prolog that is usually covered in undergraduate classes could be helpful. Lectures and Courses: The programming language CHR will be introduced by several lecturers on the first day of the summer school. - Slim Abdennadher, GUC, Egypt Analysis of CHR Solvers - Henning Christiansen, U. Roskilde, Denmark Abduction and language processing with CHR - Thom Fruehwirth, University Ulm, Germany CHR - a common platform for rule-based approaches - Jon Sneyers, K.U.Leuven, Belgium Computability and Complexity of CHR - Peter Van Weert, K.U.Leuven, Belgium Implementation of CHR Systems A final evaluation for each course is possible through a final exam or project as determined by the instructor. The daily schedule admits laboratory, recitation or working group activities to be organized in addition to lectures. Registration: The registration fee for the School is 300 euro and includes teaching material with book, as well as accomodation and coffee breaks. Meals are not included. Attendance is limited to 20 students and will be allocated on a first-come- first-served basis. Without accommodation the registration fee is reduced to 200 euro. Location: Leuven is a lively student town in Belgium with a very high density of pubs offering hundreds of types of local beers. Organization: Thom Fruehwirth, University of Ulm, Germany Jon Sneyers, K.U. Leuven, Belgium Peter Van Weert, K.U. Leuven, Belgium Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

1 0

2nd CfP: PPDP'10
by Temur Kutsia 01 Mar '10

01 Mar '10

====================================================================== Call for Papers PPDP 2010 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming Hagenberg, Austria, 26-28 July 2010 (co-located with LOPSTR 2010) http://www.risc.uni-linz.ac.at/conferences/ppdp2010/ ====================================================================== PPDP 2010 aims to bring together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. The conference will take place in July 2010 in the Castle of Hagenberg, Austria, colocated with the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2010), organised by the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz. Topics: * Logic, Constraint, and Functional Programming * Database, AI and Knowledge Representation Languages * Visual Programming * Executable Specification Languages * Applications of Declarative Programming * Methodologies: Program Design and Development * Declarative Aspects of Object-Oriented Programming * Concurrent Extensions to Declarative Languages * Declarative Mobile Computing * Integration of Paradigms * Proof Theoretic and Semantic Foundations * Type and Module Systems * Program Analysis and Verification * Program Transformation * Abstract Machines and Compilation * Programming Environments The list above is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. Submission guidelines: Papers should be submitted via the Easychair submission website for PPDP 2010: http://www.easychair.org/conferences/?conf=ppdp2010 Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Proceedings: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. Camera ready papers for accepted papers should be prepared and submitted according to the final instructions that will be sent by the publisher after notification of acceptance. Invited Speakers: Maria Paola Bonacina (Università degli Studi di Verona, Italy) Sumit Gulwani (Microsoft Research) Important Dates: # Submission: title and abstract: 15 March 2010 full paper: 21 March 2010 # Notification: 23 April 2010 # Final version: 12 May 2010 # Symposium: 26-28 July 2010 Programme Committee: Elvira Albert (Spain) Sergio Antoy (US) Frederic Blanqui (China) Michele Bugliesi (Italy) Giuseppe Castagna (France) Mariangiola Dezani (Italy) Francois Fages (France) Maribel Fernandez (UK), chair Joxan Jaffar (Singapore) Andy King (UK) Temur Kutsia (Austria) Francisco Lopez Fraguas (Spain) Ian Mackie (France) Henrik Nilsson (UK) Albert Rubio (Spain) Kazunori Ueda (Japan) Philip Wadler (UK) Symposium Chairs: Temur Kutsia and Wolfgang Schreiner (Austria) For more information, please contact the chairs: Maribel Fernandez King's College London, UK Email: Maribel.Fernandez(a)kcl.ac.uk Temur Kutsia and Wolfgang Schreiner Research Institute for Symbolic Computation Johannes Kepler University Linz Email: kutsia(a)risc.uni-linz.ac.at

1 0

Haskell Weekly News: Issue 151 - February 28, 2010
by jfredett＠gmail.com 01 Mar '10

01 Mar '10

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100228 Issue 151 - February 28, 2010 --------------------------------------------------------------------------- Welcome to issue 151 of HWN, a newsletter covering developments in the [1]Haskell community. A light HWN this week, some interesting discussion about view patterns and free monads. Also announced this week was [2]TryHaskell a work-in-progress online interactive haskell interpreter and tutorial. The author (based on his reddit post) has asked us not to post this to proggit yet, but I don't think he'll mind a plug here. So after you're done reading, give it a try! Until next week, haskellers, your Haskell Weekly News. Announcements wxHaskell for ghc-6.12.1. Daniel Fischer [3]announced a new release of wxHaskell. concurrent-extra-0.2. Roel van Dijk [4]announced a new release of concurrent-extra jhc-0.7.3. John Meacham [5]announced a new version of jhc, including many bug fixes. Try Haskell! An interactive tutorial in your browser. Benjamin L. Russell [6]told us about the TryHaskell Project, available at [7]TryHaskell.org. TryHaskell is an interactive, online Haskell interpreter and tutorial. MSFP: Call for Papers. Venanzio Capretta [8]announced a call for papers for the Third Workshop on Mathematically Structured Functional Programming. HLedger 0.8. Simon Michael [9]announced a new version of hledger last week, but it slipped through my radar. This release includes bug fixes, some refactoring, and High-Res Graphical Chart generation capability. Discussion View patterns. Andrew Coppin [10]asked about making view patterns polymorphic. What are 'free' Monads? Guenther Schmidt [11]asked what exactly it meant to be a 'free monad' Multiple Interpretations for a monad? Guenther Schmidt [12]asked about monads which can have multiple levels of meaning and interpretation. Blog noise [13]Haskell news from the [14]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Joachim Breitner: [15]Exploiting sharing in arbtt. * Martijn van Steenbergen: [16]Colors in GHCi. * Don Stewart (dons): [17]Evaluation strategies and synchronization: things to watch for. * Don Stewart (dons): [18]Fusion makes functional programming fun!. * Michael Snoyman: [19]Simpler is Better. * Kevin Reid (kpreid): [20]Hvm.hs: an exercise in Haskell golf. * Bryn Keller: [21]Why Isn't Cabal Installed with GHC?. * Don Stewart (dons): [22]Modern Benchmarking in Haskell. Quotes of the Week * roconnor: sounds like you need a zygohistomorphic prepromorphism * copumpkin: These are not the monads you are looking for. * noggle: this language is like having programming super powers About the Haskell Weekly News New editions are posted to [23]the Haskell mailing list as well as to [24]the Haskell Sequence and [25]Planet Haskell. [26]RSS is also available, and headlines appear on [27]haskell.org. To help create new editions of this newsletter, please see the information on [28]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [29]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://tryhaskell.org/ 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70857 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70689 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70961 6. http://article.gmane.org/gmane.comp.lang.haskell.general/17819 7. http://tryhaskell.org/ 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17818 9. http://www.haskell.org/pipermail/haskell-cafe/2010-February/073185.html 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70895 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70874 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/70800 13. http://planet.haskell.org/ 14. http://haskell.org/haskellwiki/Blog_articles 15. https://www.joachim-breitner.de/blog/archives/381-Exploiting-sharing-in-arb… 16. http://martijn.van.steenbergen.nl/journal/2010/02/27/colors-in-ghci/ 17. http://donsbot.wordpress.com/2010/02/26/evaluation-strategies-and-synchroni… 18. http://donsbot.wordpress.com/2010/02/26/fusion-makes-functional-programming… 19. http://snoyberg.wordpress.com/2010/02/26/simpler-is-better/ 20. http://kpreid.livejournal.com/23060.html 21. http://www.xoltar.org/?p=33 22. http://donsbot.wordpress.com/2010/02/23/modern-benchmarking-in-haskell/ 23. http://www.haskell.org/mailman/listinfo/haskell 24. http://sequence.complete.org/ 25. http://planet.haskell.org/ 26. http://sequence.complete.org/node/feed 27. http://haskell.org/ 28. http://haskell.org/haskellwiki/HWN 29. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

ANNOUNCE: jhc-0.7.3
by John Meacham 01 Mar '10

01 Mar '10

It's been a long time coming, but jhc-0.7.3 is here. If you have been following the darcs repository, there are not a whole lot of new changes, but there have been substantial fixes since 0.7.2 for those that use the tarballs or rpms. http://repetae.net/computer/jhc/ One of the most important ones is I have begun the process of standardizing on YAML for all external interfaces that may be useful to automation, this should make interfacing jhc with external tools written in any language much easier, and it will prevent me from spending time trying to invent proprietary formats every time I think of something new to spit out. right now it is used in 3 places: - dumping dependency info with --deps - library dumping with --list-libraries -v - annotating source code, for inputting to documentation generators via --annotate-source The main place it isn't used yet that I desire too is to replace the 'cabal' library description format with a true YAML file. jhc cabal files were never quite compatible with cabal ones anyway and naming them the same thing has been a source of connfusion. some of the other changes have been: features: - a lot more regression tests, many user submitted bugs are now regressions (or fixed) - support for using 'mock' to build rpms - System.Exit, System.Cmd added to base - better compatibility with ghc in some library functions - ui improvements in showing progress and errors - extended --list-libraries info - --deps dependency dumping - more francise compatible thanks to patches from droundy - more instances for bigger tuples added - uses editline if readline not available - select libraries by hash as well as version - add System.IO.Pipe - detect version of gcc needed for cross compiling to windows performance: - storage analysis - a very basic region inference enabled by default - deadcode analysis can see through partial applications now - profiled and sped up some library routines that were producing inellegant core. - figure out when top level grin functions call themselves recursively and turn them into explicit loops. bug fixes: - do expression in infix - fix strict newtype bug - U2U bug fixed - desugaring inside of list comprehensions fix - c generator doesn't mess up on unknown values - the compiler version is stored in the cache files, so multiple versions of jhc don't clobber each others cache entries - Ord instance for lists fixed - recursive type synonyms detected properly - make sure errno.h is included when errno is referenced - don't give a parse error when seeing ghc extensions to INLINE - qualified method names fix John -- John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/

1 0

ANN: Try Haskell! An interactive tutorial in your browser
by DekuDekuplex＠Yahoo.com 01 Mar '10

01 Mar '10

According to the top page of HaskellWiki (see http://www.haskell.org/) (under "February 2010" under "1 Headlines"), there is an alpha version of a new interactive, online Haskell interpreter entitled "Try Haskell!" at http://tryhaskell.org/. The top panel of the page features an interactive interpreter, while the bottom panel features a text tutorial. The user types in commands in the top panel according to the text tutorial, and the interpreter responds with output. There is also a "Reset" button in the upper right corner of the tool which resets the state of both panels to the default state. I just tried it out, and it appears to have been completed up to Lesson 3. So far, it apparently teaches up to lists. It was fun to try out. This tutorial somehow reminded me of an interactive Scheme tutorial, "Lists And Lists," copyrighted in 1996 by Andrew Plotkin, at http://parchment.googlecode.com/svn/trunk/parchment.html?story=http://parch…. That tutorial was arranged in the style of an adventure game, while this tutorial is more similar to a very similar Ruby tutorial, "try ruby! (in your browser)" at http://TryRuby.org/. It could be fun if somebody could come up with a Haskell version of the above-mentioned"Lists And Lists," which also includes a text-based Scheme reference on the virtual computer within the adventure game. -- Benjamin L. Russell -- Benjamin L. Russell / DekuDekuplex at Yahoo dot com http://dekudekuplex.wordpress.com/ Translator/Interpreter / Mobile: +011 81 80-3603-6725 "Furuike ya, kawazu tobikomu mizu no oto." -- Matsuo Basho^

3 2

MSFP: Call for Papers
by Venanzio Capretta 28 Feb '10

28 Feb '10

Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Karl Crary, Carnegie Mellon University, Pittsburgh, USA * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia

1 0

ANNOUNCE: darcs 2.4
by Reinier Lamers 27 Feb '10

27 Feb '10

Hi all, The darcs team is proud to announce the immediate availability of darcs 2.4. darcs 2.4 contains many improvements and bugfixes compared to darcs 2.3.1. Highlights are the faster operation of record, revert and related commands, and the experimental interactive hunk editing. This makes darcs 2.4 the latest and greatest in easy version control. The easiest way to install darcs is using the Haskell Platform [1]. If you have installed the Haskell Platform or cabal-install, you can install this beta release by doing: $ cabal update $ cabal install --reinstall darcs Alternatively, you can download the tarball from http://darcs.net/releases/darcs-2.4.tar.gz , and build it by hand as explained in the README file. Interactive hunk editing ------------------------ To try out interactive hunk editing, press 'e' when you are prompted with a hunk patch by 'darcs record'. You will then be shown an editor screen in which you can edit the state you want to record between the last two ruler lines. You can find more information about the hunk editing feature on http://wiki.darcs.net/HunkEditor . What's New ---------- A list of important changes since 2.3.1 is as follows: * Use fast index-based diffing everywhere (Petr) * Interactive patch splitting (Ganesh) * An 'optimize --upgrade' option to convert to hashed format in-place (Eric) * Hunk matching (Kamil Dworakowski, tat.wright) * Progress reporting is no longer deceptive (Roman) * A 'remove --recursive' option to remove a directory tree from revision control (Roman) * 'show files' accepts arguments to show a subset of tracked files (Luca) * A '--remote-darcs' flag for pushing to a host where darcs isn't called darcs * Many miscellaneous Windows improvements (Salvatore, Petr and others) * 'darcs send' now mentions the repository name in the email body (Joachim) * Handle files with boring names in the repository correctly (Petr) * Fix parsing of .authorspellings file (Tomáš) * Various sane new command-line option names (Florent) * Remove the '--checkpoint' option (Petr) * Use external libraries for all UTF-8 handling (Eric, Reinier) * Use the Haskell zlib package exclusively for compression (Petr) A list of issues resolved since 2.3.1: * 183: do not sort changes --summary output * 223: add --remote-darcs flag to specify name of remote darcs executable * 291: provide (basic) interactive patch splitting * 540: darcs remove --recursive * 835: 'show files' with arguments * 1122: get --complete should not offer to create a lazy repository * 1216: list Match section in ToC * 1224: refuse to convert a repo that's already in darcs-2 format * 1300: logfile deleted on unsucessful record * 1308: push should warn about unpulled patches before patch-selection * 1336: sane error message on --last "" (empty string to numbers parser) * 1362: mention repo name in mail send body * 1377: getProgname for local darcs instances * 1392: use parsec to parse .authorspelling * 1424: darcs get wrongly reports "using lazy repository" if you ctrl-c old-fashioned get * 1447: different online help for send/apply --cc * 1488: fix crash in whatsnew when invoked in non-tracked directory * 1548: show contents requires at least one argument * 1554: allow opt-out of -threaded (fix ARM builds) * 1563: official thank-you page * 1578: don't put newlines in the Haskeline prompts * 1583: on darcs get, suggest upgrading source repo to hashed * 1584: provide optimize --upgrade command * 1588: add --skip-conflicts option * 1594: define PREPROCHTML in makefile * 1620: make amend leave a log file when it should * 1636: hunk matching * 1643: optimize --upgrade should do optimize * 1652: suggest cabal update before cabal install * 1659: make restrictBoring take recorded state into account * 1677: create correct hashes for empty directories in index * 1681: preserve log on amend failure * 1709: fix short version of progress reporting * 1712: correctly report number of patches to pull * 1720: fix cabal haddock problem * 1731: fix performance regression in check and repair * 1741: fix --list-options when option has multiple names * 1749: refuse to remove non-empty directories Performance ----------- darcs in its current form does not perform very well on huge repositories. In order to systematically address this issue, and to catch performance regressions, we have started a darcs benchmarking project. You can find benchmarks of darcs performance in many different situations on http://wiki.darcs.net/Benchmarks . On http://wiki.darcs.net/Benchmarks/Quasar you will find graphs of the benchmark results on a Windows Vista machine. On that page, you will also find instructions on how to run your own darcs benchmarks. Reporting bugs -------------- If you have an issue with darcs 2.4, you can report it via the web on http://bugs.darcs.net/ . You can also report bugs by email to bugs(a)darcs.net. Kind Regards, the darcs release manager, Reinier Lamers [1]: You can download the Haskell platform from http://hackage.haskell.org/platform/

1 0

MSFP: Call for Papers
by Venanzio Capretta 26 Feb '10

26 Feb '10

Third Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 September 2010, Baltimore, USA A satellite workshop of ICFP 2010 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. Selected papers were published as a special issue of the Journal of Functional Programming (volume 19, issue 3-4). The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. SUBMISSIONS Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2010 The workshop proceedings will be published by ACM. TIMELINE: Submission of abstracts: 9 April Submission of papers: 16 April Notification: 28 May Final versions due: 25 June Workshop: 25 September For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2010/ Programme Committee * Andreas Abel, LMU Munich, Germany * Ana Bove, Chalmers University of Technology, Gothenburg, Sweden * Andrej Bauer, University of Ljubljana, Slovenia * Venanzio Capretta (co-chair), University of Nottingham, UK * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Adam Chlipala, Harvard University, Cambridge, MA, USA * Catarina Coquand, Chalmers University of Technology, Gothenburg, Sweden * Karl Crary, Carnegie Mellon University, Pittsburgh, USA * Manuel Alcino Cunha, Universidade do Minho, Braga, Portugal * Andy Gill, University of Kansas, USA * Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina * Oleg Kiselyov, FNMOC, Monterey, California, USA * Lionel Elie Mamane, Radboud University Nijmegen, The Netherlands * Conor McBride, University of Strathclyde, Glasgow, UK * Greg Morrisett, Harvard University, Cambridge, MA, USA * Russell O'Connor, McMaster University, Hamilton, Ontario, Canada * Benoit Razet, TIFR (Tata Institute of Fundamental research), India * Carsten Schrmann, IT University of Copenhagen, Denmark * Wouter Swierstra, Chalmers University of Technology, Gothenburg, Sweden * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia * Varmo Vene, University of Tartu, Estonia

1 0