Kenneth Hoste | 1 Sep 2011 09:29
Picon
Gravatar

ANNOUNCE: GA-0.1 - a genetic algorithm library

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).
(Continue reading)

Maurício CA | 1 Sep 2011 18:10
Picon

ANN: bindings-DSL 1.0.14

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:

(Continue reading)

Bas van Dijk | 2 Sep 2011 14:36
Picon
Gravatar

Re: ANN: bindings-DSL 1.0.14

2011/9/1 Maurício CA <mauricio.antunes <at> gmail.com>:
> New to this release is that you can get pointers to all declared fields
> of a structure.

Nice work Maurício!

I'm already using it in my usb library:

https://github.com/basvandijk/usb/blob/master/System/USB/Base.hs#L1926

Thanks,

Bas

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Trystan Spangler | 3 Sep 2011 18:27
Picon

ANNOUNCE: hspec-0.8.0 (command line runner and nested specs)

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.



Trystan Spangler

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Claudio Russo | 5 Sep 2011 00:45
Picon
Favicon

Final CFP: PADL'12 - Practical Aspects of Declarative Languages 2012

                 [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 
                ===================================
PLPV 2012 | 6 Sep 2011 10:24
Picon

CFP: Programming Languages meets Program Verification (PLPV 2012)

                             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
Jeremy.Gibbons | 7 Sep 2011 12:48
Picon
Picon

Mathematics of Program Construction - first call for papers

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 <at> 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 <at> babel.ls.fi.upm.es.

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Sebastian Nowicki | 7 Sep 2011 14:03
Picon
Gravatar

[ANNOUNCE] network-address-0.2.0

Hi All,

I'm pleased to announce the release of network-address v0.2.0. The
library provides data structures and textual representation of network
addresses (IPv4, IPv6, subnets).

Major changes in this release:

 * Revised Address type class (readAddress was moved out of the class,
readsAddress :: String -> ReadS a was added for better error
reporting)
 * Better support for IPv6 parsing (compressed zeroes).
 * Implementation of RFC5952 (a recommendation for IPv6 text
representation). Most notably showAddress for IPv6 compresses zeroes.

Example GHCi session:

*Data.Network.Address> let ip = readAddress "2001:db8:0:0:0::1" :: IPv6
*Data.Network.Address> ip
IPv6 2306139568115548160 1
*Data.Network.Address> showAddress ip
"2001:db8::1"
*Data.Network.Address> let subnet = readSubnet "2001:db8::1/56" :: IPSubnet IPv6
*Data.Network.Address> showSubnet subnet
"2001:db8::/56"
*Data.Network.Address> ip `member` subnet
True

Planned for the next release:

 * Support for parsing IPv4 notation embedded in IPv6 (e.g. "::192.168.1.1")
 * Performance optimisations - IPv6 parsing/pretty printing is quite
slow due to zero compression (>2x speed decrease)

The next release will likely be v1.0.0 as there isn't much to add. I'd
like to keep the API stable in that version, I welcome any feedback
regarding the API (or otherwise).

Hackage: http://hackage.haskell.org/package/network-address
GitHub: https://github.com/sebnow/haskell-network-address

Regards,
Sebastian
Alberto Pardo | 7 Sep 2011 18:41
Picon
Favicon

CALL FOR PARTICIPATION: 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM'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 <at> 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 <at> 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 <at> 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

++++++++++++++++++++++++++++++++++++++++++++++++++
_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Daniel Santa Cruz | 8 Sep 2011 01:39
Picon
Gravatar

Haskell Weekly News: Issue 198

   Welcome to issue 198 the HWN, a newsletter covering developments in the
   Haskell community. This release covers the week of August 28 to
   September 3, 2011.

Announcements

   Eric Y. Know released the 5th edition of the Parallel Haskell
   Digest.
   [1] http://goo.gl/Jqx01

New and Updated Projects

   * swapper (New - Roman Smrz) Provides a wrapper for functors,
     which allows their data to be automatically and transparently
     swapped to disk and loaded back when necessary.
     [2] http://goo.gl/CwojE

   * GA (New - Kenneth Hoste) Provides support for working with
     genetic algorithms in Haskell.
     [3] http://goo.gl/XjvFA

   * hledger[-web] (Update - Simon Michael) Bugfix update.
     [4] http://goo.gl/98ApM

   * bindings-DSL (Update - Mauricio CA) Provides a language to
     describe foreign interfaces on top of hsc2hs.
     [5] http://goo.gl/fFL4Y

   * hspec (Update - Trystan Spangler) This latest release includes a
     command line runner that can search through directory trees for
     specs and support for nested specs.
     [6] http://goo.gl/rVbF0

   * EclipseFP (Update - JP Moresmau) New features and bugfixes.
     [7] http://goo.gl/dXS6t

Quotes of the Week

   * dankna: I do [gui on osx] by writing a polyglot ObjC/Haskell
     program
   * maurer: I'd do it kmc style
   * hpc: your next challenge: write a definition of fix in java that
     fits in a twitter post
   * kmc: i leave for 3 seconds and you're all metaprogramming and shit
   * acowley: Haskellers are so abstract they can't even spell primitive
   * edwardk: i was happy that i had the 4th entry on google for a
     topic... but then i realized it was only for me, not for everyone
     that searches for it
   * kmc: oh, my suggestion was to hand off the fd's directly through a
     UNIX socket ... but that's probably silly ... i just like the fact
     that fd's can be passed through a unix socket
   * monochrom: "linear types change the world!" says Wadler. "Record
     updates change the type!" says Haskell. :)
   * gosu: Type parameters are covariant. This is not sound, and that
     does not matter.
   * Yitzchak Gale: I certainly wouldn't dream of dragging in type-level
     olegery, unsafe coercion, implicit parameters and other
     experimental extensions. Simplicity just works.

Top Reddit Stories

   * 8 ways to report errors in Haskell revisited : Inside 233
     Domain: blog.ezyang.com, Score: 51, Comments: 33
     On Reddit: [8] http://goo.gl/RBcIL
     Original: [9] http://goo.gl/A2m2Z

   * Yesod 0.9 Released! A Massive Changelog explained.
     Domain: yesodweb.com, Score: 43, Comments: 6
     On Reddit: [10] http://goo.gl/go7Zo
     Original: [11] http://goo.gl/dGoMa

   * EclipseFP 2.1.0 released, with Hoogle and HLint integration,
     and much more!
     Domain: jpmoresmau.blogspot.com, Score: 40, Comments: 42
     On Reddit: [12] http://goo.gl/6E1QV
     Original: [13] http://goo.gl/mkx7g

   * And they say complexity has no philosophical implications
     Domain: scottaaronson.com, Score: 36, Comments: 9
     On Reddit: [14] http://goo.gl/g97k3
     Original: [15] http://goo.gl/9OGU7

   * data Maybe -- harmful?
     Domain: blog.dbpatterson.com, Score: 29, Comments: 26
     On Reddit: [16] http://goo.gl/fd2QC
     Original: [17] http://goo.gl/x4ibO

   * haskell-TLS framework progress report
     Domain: tab.snarc.org, Score: 29, Comments: 14
     On Reddit: [18] http://goo.gl/Mdc8x
     Original: [19] http://goo.gl/UpyZ6

   * I made a simple image upload site using haskell,
     sqlite3 and lighttpd. Check it out.
     Domain: self.haskell, Score: 27, Comments: 15
     On Reddit: [20] http://goo.gl/vuF8E
     Original: [21] http://goo.gl/vuF8E

   * Manuel Chakravarty on Data Parallel Haskell
     Domain: vimeo.com, Score: 26, Comments: 2
     On Reddit: [22] http://goo.gl/CLXJU
     Original: [23] http://goo.gl/jCf9w

   * Functional Programming Day : Oct 14th, Cambridge, UK
     SPJ & D Syme - early book. bef. Aug 31st
     Domain: fpday.net, Score: 18, Comments: 11
     On Reddit: [24] http://goo.gl/wbIWr
     Original: [25] http://goo.gl/8OPgK

   * How does AwesomePrelude transform non-strict code
     to efficient strict code?
     Domain: self.haskell, Score: 18, Comments: 12
     On Reddit: [26] http://goo.gl/VgIQt
     Original: [27] http://goo.gl/VgIQt

   * Composable MVCs (or UIs), a google talk by Conal Elliot
     Domain: youtube.com, Score: 18, Comments: 14
     On Reddit: [28] http://goo.gl/9ekmO
     Original: [29] http://goo.gl/GDEkN

Top StackOverflow Questions

   * Good examples of Not a Functor/Functor/Applicative/Monad?
     votes: 17, answers: 3
     Read on SO: [30] http://goo.gl/F2q5y

   * Haskell: What monad did I just reinvent?
     votes: 17, answers: 4
     Read on SO: [31] http://goo.gl/HCko4

   * Why is Scalas type inference not as powerful as Haskells?
     votes: 17, answers: 4
     Read on SO: [32] http://goo.gl/gvCF1

   * Hard to understand Haskell memory allocation behaviour
     votes: 11, answers: 1
     Read on SO: [33] http://goo.gl/X7HtB

   * Haskell on JVM?
     votes: 11, answers: 1
     Read on SO: [34] http://goo.gl/Ra4kA

   * Implementations of spatial indexes in Haskell?
     votes: 11, answers: 1
     Read on SO: [35] http://goo.gl/ThqRA

   * Does Haskell have variadic functions/tuples?
     votes: 9, answers: 3
     Read on SO: [36] http://goo.gl/NLYCE

   * couldn't match expected type (Int -> Int -> Int)
     with actual type `(t0, t1, t2)'
     votes: 9, answers: 2
     Read on SO: [37] http://goo.gl/5EmAS

   * What is the advantage of using a parser generator
     like happy as opposed to using parser combinators?
     votes: 9, answers: 3
     Read on SO: [38] http://goo.gl/04s9n

   * manually defining boolean conjunction
     votes: 8, answers: 1
     Read on SO: [39] http://goo.gl/FGbAj

About the Haskell Weekly News

   To help create new editions of this newsletter, please send stories to
   dstcruz <at> gmail.com.

   Until next time,
   Daniel Santa Cruz

References

   1. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92123
   2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18903
   3. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18908
   4. http://permalink.gmane.org/gmane.comp.finance.ledger.hledger/479
   5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18909
   6. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18912
   7. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/92150
   8. http://blog.ezyang.com/2011/08/8-ways-to-report-errors-in-haskell-revisited/
   9. http://www.reddit.com/r/haskell/comments/jy34j/8_ways_to_report_errors_in_haskell_revisited/
  10. http://www.yesodweb.com/blog/2011/08/announcing-yesod-0.9
  11. http://www.reddit.com/r/haskell/comments/jy42c/yesod_09_released_a_massive_changelog_explained/
  12. http://jpmoresmau.blogspot.com/2011/09/eclipsefp-210-released.html
  13. http://www.reddit.com/r/haskell/comments/k2idm/eclipsefp_210_released_with_hoogle_and_hlint/
  14. http://www.scottaaronson.com/blog/?p=103
  15. http://www.reddit.com/r/haskell/comments/k2kuu/and_they_say_complexity_has_no_philosophical/
  16. http://blog.dbpatterson.com/post/9528836599
  17. http://www.reddit.com/r/haskell/comments/jxj8i/data_maybe_harmful/
  18. http://tab.snarc.org/post/2011/8/31/tls_progress/
  19. http://www.reddit.com/r/haskell/comments/k12g7/haskelltls_framework_progress_report/
  20. http://www.reddit.com/r/haskell/comments/k2b10/i_made_a_simple_image_upload_site_using_haskell/
  21. http://www.reddit.com/r/haskell/comments/k2b10/i_made_a_simple_image_upload_site_using_haskell/
  22. http://vimeo.com/28477220
  23. http://www.reddit.com/r/haskell/comments/k3x2l/manuel_chakravarty_on_data_parallel_haskell/
  24. http://www.fpday.net/fpday2011/index.php
  25. http://www.reddit.com/r/haskell/comments/jz592/functional_programming_day_oct_14th_cambridge_uk/
  26. http://www.reddit.com/r/haskell/comments/k05fo/how_does_awesomeprelude_transform_nonstrict_code/
  27. http://www.reddit.com/r/haskell/comments/k05fo/how_does_awesomeprelude_transform_nonstrict_code/
  28. http://www.youtube.com/watch?v=faJ8N0giqzw
  29. http://www.reddit.com/r/haskell/comments/k14k7/composable_mvcs_or_uis_a_google_talk_by_conal/
  30. http://stackoverflow.com/questions/7220436/good-examples-of-not-a-functor-functor-applicative-monad
  31. http://stackoverflow.com/questions/7223901/haskell-what-monad-did-i-just-reinvent
  32. http://stackoverflow.com/questions/7234095/why-is-scalas-type-inference-not-as-powerful-as-haskells
  33. http://stackoverflow.com/questions/7247058/hard-to-understand-haskell-memory-allocation-behaviour
  34. http://stackoverflow.com/questions/7261039/haskell-on-jvm
  35. http://stackoverflow.com/questions/7270796/implementations-of-spatial-indexes-in-haskell
  36. http://stackoverflow.com/questions/7220953/does-haskell-have-variadic-functions-tuples
  37. http://stackoverflow.com/questions/7232375/couldnt-match-expected-type-int-int-int-with-actual-type-t0-t1-t2
  38. http://stackoverflow.com/questions/7269025/what-is-the-advantage-of-using-a-parser-generator-like-happy-as-opposed-to-using
  39. http://stackoverflow.com/questions/7220297/manually-defining-boolean-conjunction

Gmane