September 2011 - Haskell

CALL FOR PARTICIPATION: 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11)
by Alberto Pardo 07 Sep '11

07 Sep '11

++++++++++++++++++++++++++++++++++++++++++++++++++ CALL FOR PARTICIPATION The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'11) 14-18 November 2011 Montevideo, Uruguay http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ REGISTRATION IS NOW OPEN! To register please follow the instructions given at http://www.fing.edu.uy/inco/eventos/SEFM2011/index.html#registration A PRELIMINARY PROGRAM is already available at http://www.fing.edu.uy/inco/eventos/SEFM2011/program.html +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany Title of the talk: "Formal Methods in Energy Informatics" * Mike Hinchey, Lero, Ireland Title of the talk: "Developing Model-Checking Mechanisms for ASSL: An Experience Report" * Daniel Le Métayer - INRIA, France Title of the talk: "Formal methods as a link between software code and legal rules" SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development". All queries about the special track should be sent to: sefm2011-msd(a)iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA Title of the talk: "Models and Communication in the Policy Process" LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (RÌo de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. CONTACT All queries should be sent to: sefm2011(a)fing.edu.uy. ++++++++++++++++++++++++++++++++++++++++++++++++++ SEFM SCHOOL The associated school to the conference will be held November 7-11, 2011. For further information send an email to sefm2011(a)fing.edu.uy (a separate call will be sent soon). The program of the school is available from http://www.fing.edu.uy/inco/eventos/SEFM2011/school.html ++++++++++++++++++++++++++++++++++++++++++++++++++ COMMITTEES Conference Chair * Alberto Pardo, Universidad de la República, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la República, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de Córdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * José Luiz Fiadeiro, University of Leicester, UK * Martin Fränzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, University of Lübeck, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Antónia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * César Muñoz, NASA, USA * Martín Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of Málaga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebastián Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, UBA and CONICET, Argentina Organising Committee * Carlos Luna, Universidad de la República, Uruguay * Alberto Pardo, Universidad de la República, Uruguay * Luis Sierra, Universidad de la República, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR China * Mike Hinchey, Lero, Ireland * Mathai Joseph, TRDDC, India * Zhiming Liu, UNU-IIST, Macao SAR China * Andrea Maggiolo-Schettini, Pisa University, Italy ++++++++++++++++++++++++++++++++++++++++++++++++++

1 0

Mathematics of Program Construction - first call for papers
by Jeremy.Gibbons＠comlab.ox.ac.uk 07 Sep '11

07 Sep '11

FIRST CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Québec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS To be arranged. IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012) Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012(a)easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke Macquarie University, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation will be available in nearby hotels. LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo(a)babel.ls.fi.upm.es.

1 0

CFP: Programming Languages meets Program Verification (PLPV 2012)
by PLPV 2012 06 Sep '11

06 Sep '11

PLPV 2012 The Sixth ACM SIGPLAN Workshop Programming Languages meets Program Verification --- call for papers --- 24th January, 2012 Philadelphia, USA (Affiliated with POPL 2012) http://research.microsoft.com/en-us/um/people/nswamy/plpv12 -------------------------------------------------------------------------------- Overview The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. Examples include dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications or extended static checking systems which incorporate contracts with either static or dynamic contract checking. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage cross-pollination between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (Type-based, Hoare-logic-based, Abstract Interpretation-based, etc), target different kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc). -------------------------------------------------------------------------------- Important Dates: Submission: 11th October, 2011 Notification: 8th November, 2011 Final Version: 15th November, 2011 Workshop: 24th January, 2012 -------------------------------------------------------------------------------- Submissions We seek submissions of up to 12 pages related to the above topics---shorter submissions are also welcome. Submissions may describe new work, propose new challenge problems for language-based verification techniques, or present a known idea in an elegant way (i.e., a pearl). Submissions should be prepared with SIGPLAN two-column conference format (http://www.sigplan.org/authorInformation.htm) Submitted papers must adhere to the SIGPLAN republication policy (http://www.sigplan.org/republicationpolicy.htm) Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. To submit a paper, access the submission site at http://www.easychair.org/conferences/?conf=plpv2012. -------------------------------------------------------------------------------- Publication Accepted papers will be published by the ACM and will appear in the ACM Digital library. -------------------------------------------------------------------------------- Program Committee Amal Ahmed Indiana University Lennart Augustsson Standard Chartered Koen Claessen Chalmers (co-chair) Martin Giese University of Oslo Daniel Licata Carnegie Mellon University Peter Müller ETH Zurich Aleksandar Nanevski IMDEA Matthieu Sozeau INRIA Nikhil Swamy Microsoft Research (co-chair) David Walker Princeton University Dana Xu INRIA -------------------------------------------------------------------------------- Previous PLPVs: http://plpv.org

1 0

Final CFP: PADL'12 - Practical Aspects of Declarative Languages 2012
by Claudio Russo 04 Sep '11

04 Sep '11

[Apologies if you receive multiple copies.] Final Call for Papers ===================== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 Abstract/Paper submission deadline: September 10th/17th, 2011 Conference Description ====================== Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include, but are not limited to: * Innovative applications of declarative languages * Declarative domain-specific languages and applications * Practical applications of theoretical results * New language developments and their impact on applications * Declarative languages and Software Engineering * Evaluation of implementation techniques on practical applications * Practical experiences and industrial applications * Novel uses of declarative languages in the classroom * Practical extensions such as constraint-based, probabilistic, and reactive languages. PADL'12 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL, January 25-27. The symposium will be held in Philadelphia, Pennsylvania, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2011 Paper Submission: September 17, 2011 Notification: October 22, 2011 Camera-ready: November 5, 2011 Symposium: January 23-24, 2012 Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system. If electronic submission is impossible, please contact the program chairs for information on how to submit hard copies. All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. PADL'12 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 pages in Springer LNCS format. * Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers will be published in the Springer-Verlag conference proceedings, and will be presented in a separate session. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. The limit for application papers is 6 pages in Springer LNCS format. Program Committee ================= Marcello Balduccini, Intelligent Systems Department, Kodak Research Labs Edwin Brady, University of St Andrews, Scotland Henning Christiansen, Roskilde University, Denmark Agostino Dovier, University of Udine, Italy Matthew Flatt, University of Utah, USA Gopal Gupta, University of Texas at Dallas, USA John Hughes, Chalmers University of Technology, Sweden; Quviq AB Gabriele Keller, University of New South Wales, Australia Lunjin Lu, Oakland University, USA Marc Pouzet, École normale supérieure, France Ricardo Rocha, University of Porto, Portugal Andreas Rossberg, Google Germany GmbH, Germany Claudio Russo, Microsoft Research Cambridge, UK (co-chair) Kostis Sagonas, Uppsala University, Sweden; NTUA, Greece Satnam Singh, Microsoft Research Cambridge, UK Zoltan Somogyi, University of Melbourne, Australia Eijiro Sumii, Tohoku University, Japan Terrance Swift, Universidade Nova de Lisboa, Portugal; Johns Hopkins University, USA Andrew Tolmach, Portland State University, USA Jan Wielemaker, University of Amsterdam, The Netherlands Roland Yap, National University of Singapore, Republic of Singapore Kwangkeun Yi, Seoul National University, Korea Neng-Fa Zhou, Brooklyn College, City University of New York, USA (co-chair) Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Claudio Russo Microsoft Research Cambridge,UK Email: crusso <AT> microsoft <DOT> com Neng-Fa Zhou Brooklyn College, The City University of New York, USA Email: zhou <AT> sci <DOT> brooklyn <DOT> cuny <DOT> edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN Microsoft Research, Cambridge ===================================

1 0

ANNOUNCE: hspec-0.8.0 (command line runner and nested specs)
by Trystan Spangler 03 Sep '11

03 Sep '11

hspec version 0.8.0, Behavior Driven Development for Haskell, is now available! This latest release includes a command line runner that can search through directory trees for specs and support for nested specs. From the hspec specs: the "describe" function - takes a description of what the behavior is for - groups behaviors for what's being described a nested description - has it's own specs - may be displayed indented And from the hspec command line runner: hspec searches through files or folders and runs any top level declarations with a type of `Specs` or `IO Specs`. Monadic specs must be fully qualified, list-based specs may be qualified or not. You can specify specific *.hs files or directories to search through or let hspec search the current directory tree for specs to run. usage: hspec [OPTIONS] [TARGET_LIST] -f FORMAT --format=FORMAT Specifies what format to use for output. By default the specdoc format is used. FORMAT can be silent, progress, specdoc, or failed_examples. -o FILE_NAME --output=FILE_NAME Specifies the file to use for output. By default output is directed to stdout. FILE_NAME can be stdout or stderr for those handles. -e REGEX --example=REGEX Only execute examples with a matching description. By default all examples are executed. -c TRUE|FALSE --color=TRUE|FALSE Force output to have or not have red and green color. By default color is only used when output is directed to stdout. --runfile=FILE_NAME Use a specific file to log the last run results. This is read when using the --rerun option. By default the file ".hspecLastRun" logs the last run results. -r RERUNOPT --rerun=RERUNOPT Rerun a specific subset of specs. This looks at the last run file specified by -runfile. RERUNOPT can be "all" or "failed". By default the last run file is ignored and all specs are run. -h, -? --help Display this help. -v --verbose Display detailed information about what hspec is doing. --specs Include the specs for the hspec command line runner itself. When used, the target list will not default to the current directory. A non-empty target list will still be searched though. http://hackage.haskell.org/package/hspec https://github.com/trystan/hspec Trystan Spangler

1 0

ANN: hledger-web 0.15.1 (& hledger 0.15)
by Simon Michael 02 Sep '11

02 Sep '11

I've made a bugfix release of the hledger-web package, to fix build problems. hledger-web 0.15.1: * web: add missing Hledger.Web.Options to cabal file * web: tighten up dependencies to reduce build problems And here's another new dependency I forgot to mention: flot, the js charting library. The rest of this mail is a repeat of yesterday's announcement, since that one seriously confused google groups, gmane, and perhaps your mailreader (pro tip: don't re-edit old announcements with Mail.app's cmd-shift-d. :) -Simon Date: 2011/9/1 Subject: ANN: hledger 0.15 I'm pleased to announce hledger 0.15! This release includes work by Trygve Laugstøl, Dmitry Astapov, Clint Adams, Johann Klähn and myself. hledger is a library and set of user tools for working with financial data (or anything that can be tracked in a double-entry accounting ledger.) It is a haskell port and friendly fork of John Wiegley's Ledger. hledger provides command-line, curses and web interfaces, and aims to be a reliable, practical tool for daily use. Given a plain text file describing transactions of money or any other commodity, it will print the chart of accounts, account balances, or just the transactions you're interested in. It can also help you record new transactions, or convert CSV data from your bank. Home: http://hledger.org IRC: irc://irc.freenode.net/#ledger Install: cabal update; cabal install hledger [hledger-web hledger-vty hledger-chart hledger-interest] Platform-specific binaries, which are time-consuming to make and support, are now provided on request to financial donors - a great way to give back and help pay hosting costs! Best, -Simon Release notes for 0.15: * hledger's options are now modal, providing better help (using cmdargs) * hledger now lists and runs any hledger-* add-ons found in the user's path * case insensitivity of filter patterns has been fixed * parsing: `alias`/`end aliases` directives, for renaming accounts, are supported, like ledger's but a bit more powerful; also an `--alias` option for renaming on the fly * parsing: the `account` directive now preserves posting type (normal/virtual/balanced virtual) * parsing: the `pop` directive is supported as an alias for `end tag`, like ledger * parsing: `P` (historical price) directives can contain a (ignored) numeric time zone, like ledger * parsing: the leading `!` in directives is now optional and deprecated, like ledger * parsing: entries with a negative amount in the first posting now infer the correct balancing amount * parsing: bad date checking is more accurate * balance: collapsing of boring accounts to one line can be disabled with `--no-elide` * balance: fix a wrong precision regression from last release * convert: standard input can be converted * convert: an alternate rules file can be specified with `--rules` * convert: `account2-field` can be used when the CSV file specifies both accounts * convert: `description-field` can have a custom format and combine multiple CSV fields * convert: `in-field` and `out-field` support CSV files that use two amount columns * convert: don't fail when there's no default journal file * web: the web interface has been overhauled/cleaned up * web: account register views are now transaction-based, like gnucash etc., and show accurate historical balances when possible * web: simple balance charts are displayed (using flot) * web: more expressive and consistent search patterns, using a new matching engine * web: add form uses currently focussed account as default, redirects to itself, formats status messages better * web: sidebar now shows empty/boring accounts too * web: now uses warp and a newer yesod * api simplifications * importable Hledger, Hledger.Web, Hledger.Vty and Hledger.Chart modules * the basic reports are now provided by hledger-lib for easier reuse * new api use examples: `equity.hs`, `uniquify.hs` * some old base 3 support has been dropped * the old -s flag has been dropped Stats: Release contributors: Simon Michael, Trygve Laugstøl, Dmitry Astapov, Clint Adams, Johann Klähn 132 days, 314 commits, 18 end-user features and 6 end-user bugfixes since last release. 210 unit & functional tests and 55% unit test coverage (hledger, hledger-lib packages). 7642 lines of code (all packages).

1 0

ANN: bindings-DSL 1.0.14
by Maurício CA 02 Sep '11

02 Sep '11

FFI package bindings-DSL provides a language to describe foreign interfaces on top of hsc2hs. http://bitbucket.org/mauricio/bindings-dsl http://hackage.haskell.org/package/bindings-DSL New to this release is that you can get pointers to all declared fields of a structure. Suppose you have the following struct in C: struct a { int b; struct { char c; float d; } e; struct a *f; }; You write this in your .hsc file: #starttype struct a #field b , CInt #field e.c , CChar #field e.d , CFloat #field f , Ptr <a> #stoptype Besides the usual Storable instantiated Haskell version of struct a, (named C'a), now you also get the following: p'a'b :: Ptr C'a -> Ptr CInt p'a'e'c :: Ptr C'a -> Ptr CChar p'a'e'd :: Ptr C'a -> Ptr CFloat p'a'f :: Ptr C'a -> Ptr (Ptr C'a) Hope it's useful to you. Best, Maurício

2 1

ANNOUNCE: GA-0.1 - a genetic algorithm library
by Kenneth Hoste 01 Sep '11

01 Sep '11

Hello Haskellers, I'd like to announce the release of the GA library, which provides support for working with genetic algorithms in Haskell. Key features: * pragmatic implementation of a genetic algorithm, aimed at making it easy to use for evolving self-defined entities * flexible configuration * support for automatic checkpointing and restoring from the last available checkpoint * two toy examples included in the v0.1 release, which illustrate how to use the library Version 0.1, which has only been tested by me up until now, is available on Hackage: http://hackage.haskell.org/package/GA The master repository is on github: https://github.com/boegel/GA GA is available under a BSD3 license (if this would hinder you to use the GA library, please let me know). Comments/suggestions welcome. Enjoy! Kenneth

1 0