Santiago Escobar | 2 Apr 12:40 2012
Picon

6th International School on Rewriting (ISR), July 16-20, 2012


                    Call for Participation

                           ISR 2012
             6th International School on Rewriting

                http://www.dsic.upv.es/~isr2012

                       July 16th - 20th

             Universitat Politecnica de Valencia
                        Valencia, Spain

Rewriting is a branch of computer science whose origins go back 
to the origins of computer science itself (with Thue, Church, 
Post, and many other prominent researchers). It has strong links 
with mathematics, algebra, and logic, and it is the basis of 
well-known programming paradigms like functional and equational 
programming, which are taught at the universitary level in many 
countries. In these programming paradigms and corresponding 
languages, the notions of reduction, pattern matching, 
confluence, termination, strategy, etc., are essential. 
Rewriting provides a solid framework for understanding, using, 
and teaching all these notions. Rewriting techniques are also 
used in many other areas of software engineering (scripting, 
prototyping, automated transformation of legacy systems, 
refactoring, web services, etc.) and are implemented in popular 
systems like Mathematica, Autocad, and others. Rewriting 
techniques play a relevant role in computing research, 
education, and industry.
(Continue reading)

Mark Snyder | 2 Apr 16:15 2012
Picon

(no subject)

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Gudmund Grov | 2 Apr 16:32 2012
Picon
Picon

WING 2012: Final Call for Papers -- Extended Deadline

[Please post - apologies for multiple copies.]

*** Submission deadline extended to April 13, 2012 ***

----------------------------------------------------
WING 2012 - 4th International Workshop on INvariant Generation
    http://cs.nyu.edu/acsys/wing2012/
           June 30, 2012
Manchester, UK (a satellite Workshop of IJCAR 2012)
----------------------------------------------------
                  ---  Final Call for Papers  ---

General
-------

The ability to automatically extract and synthesize auxiliary
properties of programs has had a profound effect on program analysis,
testing, and verification over the last several decades. A key
impediment for program verification is the overhead associated with
providing, debugging, and verifying auxiliary invariant
annotations. Releasing the software developer from this burden is
crucial for ensuring the practical relevance of program verification.
In the context of testing, suitable invariants have the potential of
enabling high-coverage test-case generation. Thus, invariant
generation is a key ingredient in a broad spectrum of tools that help
to improve program reliability and understanding. As the design and
implementation of reliable software remains an important issue, any
progress in this area will have a significant impact.

The increasing power of automated theorem proving and computer algebra
has opened new perspectives for computer-aided program verification;
in particular for the automatic generation of inductive assertions in
order to reason about loops and recursion. Especially promising
breakthroughs are invariant generation techniques by Groebner bases,
quantifier elimination, and algorithmic combinatorics, which can be
used in conjunction with model checking, theorem proving, static
analysis, and abstract interpretation. The aim of this workshop is to
bring together researchers from these diverse fields.

Scope
-----

We encourage submissions presenting work in progress, tools under
development, as well as work by PhD students, such that the
workshop can become a forum for active dialogue between the groups
involved in this new research area.

Relevant topics include (but are not limited to) the following:

* Program analysis and verification
* Inductive Assertion Generation
* Inductive Proofs for Reasoning about Loops
* Applications to Assertion Generation using the following tools:
- Abstract Interpretation,
- Static Analysis,
- Model Checking,
- Theorem Proving,
- Theory Formation,
- Algebraic Techniques
* Tools for inductive assertion generation and verification
* Alternative techniques for reasoning about loops

Invited speaker
-----------------

* Aditya Nori (Microsoft Research)

Committee
-----------------

Program Chairs:

* Gudmund Grov (University of Edinburgh, UK)
* Thomas Wies (New York University, USA)

Program Committee:

* Clark Barrett (New York University, USA) 
* Nikolaj Bjorner (Microsoft Research, USA)
* Gudmund Grov (University of Edinburgh, UK)
* Ashutosh Gupta (IST Austria)
* Bart Jacobs (Katholieke Universiteit Leuven, Belgium) 
* Moa Johansson (Chalmers University of Technology, Sweden)
* Laura Kovacs (Vienna University of Technology, Austria)
* David Monniaux (VERIMAG, France)
* Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) 
* Helmut Veith (Vienna University of Technology, Austria)
* Thomas Wies (New York University, USA)

Important Dates
---------------

Submission deadline: April 13, 2012
Notification of acceptance: May 11, 2012
Final version due: June 08, 2012
Workshop: June 30, 2012

Submission
----------

WING 2012 encourages submissions in the following two categories:

* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. Given the informal style of the
workshop, papers describing work in progress, with sufficient detail
to assess the contribution, are also welcome. Original papers should
not exceed 15 pages. 

* Extended abstracts: contain preliminary reports of work in progress,
case studies, or tool descriptions. These will be judged based on
the expected level of interest for the WING community. They will be
included in the CEUR-WS proceedings. Extended abstracts should not
exceed 5 pages. 

All submissions should conform to Springer's LNCS format. Formatting style 
files can be found at 

http://www.springer.de/comp/lncs/authors.html 

Technical details may be included in an appendix to be read at the reviewers' 
discretion and to be omitted in the final version.

Please prepare your submission in accordance with the rules described above and 
submit a pdf file via

https://www.easychair.org/?conf=wing2012

Publication
-----------

All submissions will be peer-reviewed by the program committee.
Accepted contributions will be published in archived electronic notes,
as a volume of CEUR Workshop Proceedings.

A special issue of the Journal of Science of Computer Programming with
extended versions of selected papers will be published after the workshop.

--

-- 
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
Rachid Echahed | 4 Apr 07:21 2012
Picon
Picon

CFP: Graph Computation Models (GCM2012)

-----------------------------------------------------------------------

                        CALL FOR PAPERS

                            GCM 2012
                  Fourth International Workshop on
                     Graph Computation Models
                Bremen, Germany, September 29th, 2012
                     http://gcm2012.imag.fr/

                         Part of ICGT2012
             http://www.informatik.uni-bremen.de/icgt2012/

      Full versions of best papers will be included in an issue of the
the international journal of the "Electronic Communications of the  EASST"
--------------------------------------------------------------------------

                                  Aims

The aim of the  International Workshop  GCM2012  is to bring  together
researchers interested  in all aspects  of computation models based on
graphs    and graph transformation    techniques.    It promotes   the
cross-fertilizing exchange of  ideas and experiences among researchers
and   students from   the different   communities   interested in  the
foundations, applications,   and implementations of  graph computation
models and related areas.

GCM2012 is a  one-day satellite event of   ICGT 2012, which  will take
place  in Bremen, Germany, from  24 to 29  of September 2012. Previous
editions of  GCM series  were  held in  Natal,  Brazil (GCM  2006), in
Leicester, UK (GCM 2008) and in Enschede, The Netherlands (GCM 2010).
-----------------------------------------------------------------------

                            Topics of Interest

GCM 2012  solicits  papers in all   areas of Graph  Computation Models
including but not limited to:

Foundations : Models of graph transformation; Parallel, concurrent, and
distributed;  graph transformations; Term  graph  rewriting; Logics  on
graphs  and graph transformations; Formal graph languages Analysis and
verification   of   graph   transformation  systems;   Foundations   of
programming languages

Applications  :  Software  architecture; Software   validation; Software
evolution; Visual   programming;   Security models;   Implementation   of
programming   languages;  Rule-based  systems;    Workflow and  business
processes;    Model-driven  engineering;  Service-oriented  applications;
Bioinformatics and system biology; Quantum computing, Case-studies

-----------------------------------------------------------------------
                             Important Dates

Abstract Submission :     July 8th, 2012
Paper Submission :     July 15th, 2012
Acceptance Notification: August 13th, 2012
Preliminary Proceedings: September 2nd, 2012
Workshop :         September 29th, 2012

-----------------------------------------------------------------------

                         Submissions and Publication

Authors are invited to submit either regular papers  (up to 15 pages),
or  position papers, system  descriptions, work  in progress, extended
abstracts (5-7 pages), via the EasyChair system, at URL

        https://www.easychair.org/account/signin.cgi?conf=gcm2012

Submissions should be in  PDF format, using  Lecture Notes in Computer
Science (LNCS) style.

Preliminary proceedings will be distributed at the workshop.  Selected
authors will be invited to submit a full version of their papers after
the workshop. These  submissions will pass through  a second  round of
reviewing and accepted contributions are to  be published as a special
issue of  the international journal  of the "Electronic Communications
of the EASST".

-----------------------------------------------------------------------
                          Program Committee

   * Paolo Baldan, University of Padova, Italy
   * Franck Drewes, Umea University, Sweden
   * Rachid Echahed (cochair), LIG Lab., Grenoble, France
   * Stefan Gruner, University of Pretoria, South Africa
   * Annegret Habel (cochair), University of Oldenburg, Germany
   * Dirk Janssens, University of Antwerp, Belgium
   * Hans-Joerg Kreowski, University of Bremen, Germany
   * Pascale Le Gall, University of Evry-Val d'Essonne, France
   * Mohamed Mosbah (cochair), University of Bordeaux, France
   * Detlef Plump, University of York, UK
-----------------------------------------------------------------------

                         Organizers and contact

   * Annegret Habel, University of Oldenburg, Germany
   * Mohamed Mosbah, University of Bordeaux, France
   * Rachid Echahed, LIG Lab., Grenoble, France

  You can contact GCM 2012 organizers via gcm2012 <at> imag.fr

-----------------------------------------------------------------------
Amal Ahmed | 4 Apr 15:45 2012
Picon

HOPE 2012 (a new workshop co-located with ICFP): Call for Talk Proposals


                    CALL FOR TALK PROPOSALS

                           HOPE 2012

                The 1st ACM SIGPLAN Workshop on
              Higher-Order Programming with Effects

                       September 9, 2012
                      Copenhagen, Denmark
                   (the day before ICFP 2012)

                  http://hope2012.mpi-sws.org


HOPE is a *new workshop* that is intended to bring together
researchers interested in the design, semantics, implementation, and
verification of higher-order effectful programs. It will be
*informal*, consisting of invited talks, contributed talks on work in
progress, and open-ended discussion sessions. This 1st edition of HOPE
is dedicated to John Reynolds, whose work is an inspiration to us all.


---------------------
Goals of the Workshop
---------------------

A recurring theme in many papers at ICFP, and in the research of many
ICFP attendees, is the interaction of higher-order programming with
various kinds of effects: storage effects, I/O, control effects,
concurrency, etc. While effects are of critical importance in many
applications, they also make it hard to build, maintain, and reason
about one's code. Higher-order languages (both functional and
object-oriented) provide a variety of abstraction mechanisms to help
"tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types,
typestate, first-class events, transactions, Hoare Type Theory,
session types, substructural and region-based type systems), and a
number of different semantic models and verification technologies have
been developed in order to codify and exploit the benefits of this
encapsulation (e.g. bisimulations, step-indexed Kripke logical
relations, higher-order separation logic, game semantics, various
modal logics). But there remain many open problems, and the field is
highly active.

The goal of the HOPE workshop is to bring researchers from a variety
of different backgrounds and perspectives together to exchange new and
exciting ideas concerning the design, semantics, implementation, and
verification of higher-order effectful programs.

We want HOPE to be as informal and interactive as possible. The
program will thus involve a combination of invited talks, contributed
talks about work in progress, and open-ended discussion
sessions. There will be no published proceedings, but participants
will be invited to submit working documents, talk slides, etc. to be
posted on this website.


-----------------------
Call for Talk Proposals
-----------------------

We solicit proposals for contributed talks. Proposals should be at
most 2 pages, in either plain text or PDF format, and should specify
how long a talk the speaker wishes to give. By default, contributed
talks will be 30 minutes long, but proposals for shorter or longer
talks will also be considered. Speakers may also submit supplementary
material (e.g. a full paper, talk slides) if they desire, which PC
members are free (but not expected) to read.

We are interested in talks on all topics related to the interaction of
higher-order programming and computational effects. Talks about work
in progress are particularly encouraged. If you have any questions
about the relevance of a particular topic, please contact the PC
chairs at the address hope2012 <at> mpi-sws.org.

Deadline for talk proposals:  June 8, 2012 (Friday)

Notification of acceptance:    July 1, 2012 (Sunday)

Workshop:     September 9, 2012 (Sunday)

The submission website is now open:

         http://www.easychair.org/conferences/?conf=hope2012


---------------------
Workshop Organization
---------------------

Program Co-Chairs:

Amal Ahmed (Northeastern University)
Derek Dreyer (MPI-SWS, Germany)


Program Committee:

Jim Laird (University of Bath)
Rasmus Møgelberg (IT University of Copenhagen)
Greg Morrisett (Harvard University)
Aleks Nanevski (IMDEA Software Institute)
David Naumann (Stevens Institute of Technology)
Matthew Parkinson (Microsoft Research Cambridge)
François Pottier (INRIA Rocquencourt)
Amr Sabry (Indiana University)
Eijiro Sumii (Tohoku University)
Nikhil Swamy (Microsoft Research Redmond)
Nobuko Yoshida (Imperial College London)
_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Amal Ahmed | 4 Apr 15:59 2012
Picon

LOLA 2012: Call for Talk Proposals

============================================================

          *** CALL FOR TALK PROPOSALS ***

                    LOLA 2012

    Syntax and Semantics of Low Level Languages

     Sunday 24th June 2012, Dubrovnik, Croatia

          A LICS 2012-affiliated workshop 
     http://www.ccs.neu.edu/home/amal/lola2012

============================================================

IMPORTANT DATES

Submission deadline     Friday  13th  April 2012
Author notification     Monday  30th  April 2012
Workshop                Sunday  24th  June  2012

SUBMISSION LINK

The submissions will be made by easychair at
https://www.easychair.org/conferences/?conf=lola2012

DESCRIPTION OF THE WORKSHOP

It has been understood since the late 1960s that tools and structures
arising in mathematical logic and proof theory can usefully be applied
to the design of high level programming languages, and to the
development of reasoning principles for such languages. Yet low level
languages, such as machine code, and the compilation of high level
languages into a low level ones have traditionally been seen as having
little or no essential connection to logic.

However, a fundamental discovery of this past decade has been that low
level languages are also governed by logical principles. From this key
observation has emerged an active and fascinating new research area at
the frontier of logic and computer science. The practically-motivated
design of logics reflecting the structure of low level languages (such
as heaps, registers and code pointers) and low level properties of
programs (such as resource usage) goes hand in hand with the some of
the most advanced contemporary researches in semantics and proof
theory, including classical realizability and forcing, double
orthogonality, parametricity, linear logic, game semantics,
uniformity, categorical semantics, explicit substitutions, abstract
machines, implicit complexity and sublinear programming.

The LOLA workshop, affiliated with LICS, will bring together
researchers interested in many aspects of the relationship between
logic and low level languages and programs. Topics of interest
include, but are not limited to:

Typed assembly languages,
Certified assembly programming,
Certified and certifying compilation,
Proof-carrying code,
Program optimization,
Modal logic and realizability in machine code,
Realizability and double orthogonality in assembly code,
Parametricity, modules and existential types,
General references, Kripke models and recursive types,
Continuations and concurrency, 
Implicit complexity, sublinear programming and Turing machines,
Closures and explicit substitutions,
Linear logic and separation logic,
Game semantics, abstract machines and hardware synthesis,
Monoidal and premonoidal categories, traces and effects.

SUBMISSION INFORMATION: 

LOLA is an informal workshop aiming at a high degree of useful
interaction amongst the participants, welcoming proposals for talks on
work in progress, overviews of larger programmes, position
presentations and short tutorials as well as more traditional research
talks describing new results.

The programme committee will select the workshop presentations from
submitted proposals, which may take the form either of a short
abstract or of a longer (published or unpublished) paper describing
completed work.


PROGRAM CO-CHAIRS:

Amal Ahmed          (Northeastern University)  
Aleksandar Nanevski (IMDEA Software)

PROGRAM COMMITTEE: 

Cristiano Calcagno  (Imperial College London and Monoidics Limited)
Robert Dockins      (Princeton University)
Martin Hofmann      (LMU Munich)
Xavier Leroy        (INRIA Rocquencourt)
Andrzej Murawski    (University of Leicester)
Sungwoo Park        (Pohang University of Science and Technology)
Dusko Pavlovic      (Royal Holloway, University of London)
Andreas Rossberg    (Google)
_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Janis Voigtländer | 5 Apr 00:27 2012
Picon

Call for Contributions - Haskell Communities and Activities Report, May 2012 edition

Dear all,

I would like to collect contributions for the 22nd edition of the

================================================================
              Haskell Communities & Activities Report

http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report

                  Submission deadline: 1 May 2012

      (please send your contributions to hcar at haskell.org,
                  in plain text or LaTeX format)
================================================================

This is the short story:

* If you are working on any project that is in some way related
   to Haskell, please write a short entry and submit it. Even if
   the project is very small or unfinished or you think it is not
   important enough --- please reconsider and submit an entry anyway!

* If you are interested in an existing project related to Haskell that
   has not previously been mentioned in the HCAR, please tell me, so
   that I can contact the project leaders and ask them to submit an
   entry.

* Feel free to pass on this call for contributions to others that
   might be interested.

More detailed information:

The Haskell Communities & Activities Report is a bi-annual overview of
the state of Haskell as well as Haskell-related projects over the
last, and possibly the upcoming six months. If you have only recently
been exposed to Haskell, it might be a good idea to browse the
November 2011 edition --- you will find interesting topics described as
well as several starting points and links that may provide answers to
many questions.

Contributions will be collected until the submission deadline. They
will then be compiled into a coherent report that is published online
as soon as it is ready. As always, this is a great opportunity to
update your webpages, make new releases, announce or even start new
projects, or to talk about developments you want every Haskeller to
know about!

Looking forward to your contributions,

Janis (current editor)

FAQ:

Q: What format should I write in?

A: The required format is a LaTeX source file, adhering to the template
that is available at:

      http://haskell.org/communities/05-2012/template.tex

There is also a LaTeX style file at

      http://haskell.org/communities/05-2012/hcar.sty

that you can use to preview your entry. If you do not know LaTeX, then
use plain text. If you modify an old entry that you have written for an
earlier edition of the report, you should already have received your old
entry as a template (provided I have your valid email address). Please
modify that template, rather than using your own version of the old
entry as a template.

Q: Can I include Haskell code?

A: Yes. Please consider using lhs2tex syntax
(http://people.cs.uu.nl/andres/lhs2tex/). The report is compiled in mode
polycode.fmt.

Q: Can I include images?

A: Yes, you are even encouraged to do so. Please use .jpg format, then.

Q: Should I send files in .zip archives or similar?

A: No, plain file attachements are the way.

Q: How much should I write?

A: Authors are asked to limit entries to about one column of text. This
corresponds to approximately one page, or 40 lines of text, with the
above style and template.

A general introduction is helpful. Apart from that, you should focus on
recent or upcoming developments. Pointers to online content can be given
for more comprehensive or "historic" overviews of a project. Images do
not count towards the length limit, so you may want to use this
opportunity to pep up entries. There is no minimum length of an entry!
The report aims for being as complete as possible, so please consider
writing an entry, even if it is only a few lines long.

Q: Which topics are relevant?

A: All topics which are related to Haskell in some way are relevant. We
usually had reports from users of Haskell (private, academic, or
commercial), from authors or contributors to projects related to
Haskell, from people working on the Haskell language, libraries, on
language extensions or variants. We also like reports about
distributions of Haskell software, Haskell infrastructure, books and
tutorials on Haskell. Reports on past and upcoming events related to
Haskell are also relevant. Finally, there might be new topics we do not
even think about. As a rule of thumb: if in doubt, then it probably is
relevant and has a place in the HCAR. You can also ask the editor.

Q: Is unfinished work relevant? Are ideas for projects relevant?

A: Yes! You can use the HCAR to talk about projects you are currently
working on. You can use it to look for other developers that might help
you. You can use it to write "wishlist" items for libraries and
language features you would like to see implemented.

Q: If I do not update my entry, but want to keep it in the report, what
should I do?

A: Tell the editor that there are no changes. The old entry will
typically be reused in this case, but it might be dropped if it is older
than a year, to give more room and more attention to projects that
change a lot. Do not resend complete entries if you have not changed them.

Q: Will I get confirmation if I send an entry? How do I know whether my
email has even reached the editor, and not ended up in a spam folder?

A: Prior to publication of the final report, the editor will send a
draft to all contributors, for possible corrections. So if you do not
hear from the editor within three weeks after the deadline, it is safer
to send another mail and check whether your first one was received.
Daniel Santa Cruz | 5 Apr 04:14 2012
Picon

Haskell Weekly News: Issue 221

Welcome to issue 221 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of March 25 to 31, 2012.

Quotes of the Week

   * Tekmo: Now I have a monoid in the category of problems.

   * hpc: atomically the whole thing

   * BMeph (in "announcer voice"): In a world, where orphan instances
           collide, one language holds the key to successful compilation, in
           our time.

   * thoughtpolice: if there is a question, edwardk probably has the
                    answer

   * danharaj: All I have to do is remove me from the program and it
               works.

   * anonymous: Caveat implementor.

   * ski: 'getLine :: IO String' is a recipe for how to interact with
          the world to acquire a `String'
     ski: the recipe is not the cake

Top Reddit Stories

   * My Thesis is Finally Complete! "Elm: Concurrent FRP for functional GUIs"
     Domain: self.haskell, Score: 74, Comments: 31
     On Reddit: [1] http://goo.gl/yw2P9
     Original: [2] http://goo.gl/yw2P9

   * ANNOUNCE: Happstack 7! (Haskell Web Framework)
     Domain: happstack.com, Score: 51, Comments: 26
     On Reddit: [3] http://goo.gl/kwcc7
     Original: [4] http://goo.gl/wBBsu

   * pipes-like conduit
     Domain: yesodweb.com, Score: 49, Comments: 84
     On Reddit: [5] http://goo.gl/nu4Tl
     Original: [6] http://goo.gl/hWaCj

   * SIMD Support for the vector library
     Domain: ghc-simd.blogspot.co.uk, Score: 45, Comments: 6
     On Reddit: [7] http://goo.gl/m0PI8
     Original: [8] http://goo.gl/NDq2j

   * Replacing Cabal
     Domain: yesodweb.com, Score: 40, Comments: 7
     On Reddit: [9] http://goo.gl/ulv2o
     Original: [10] http://goo.gl/86NLW

   * Summarizing the conduit questions
     Domain: yesodweb.com, Score: 33, Comments: 13
     On Reddit: [11] http://goo.gl/lkLgF
     Original: [12] http://goo.gl/uK25n

   * I love `RWST r w s (IO a) ` to ease the transition from imperative 
     programming. Am I cheating?
     Domain: self.haskell, Score: 31, Comments: 53
     On Reddit: [13] http://goo.gl/xq2Jn
     Original: [14] http://goo.gl/xq2Jn

   * FRP - Three principles for bidirectional GUI elements
     Domain: apfelmus.nfshost.com, Score: 30, Comments: 11
     On Reddit: [15] http://goo.gl/AFbXE
     Original: [16] http://goo.gl/xd4Yf

   * haskell-src-exts-1.12.0: supports the new quasi-quoter syntax
     Domain: haskell.org, Score: 28, Comments: 6
     On Reddit: [17] http://goo.gl/u6ZDx
     Original: [18] http://goo.gl/XTzJO

   * Why GADTs are awesome: implementing System F using HOAS
     Domain: github.com, Score: 25, Comments: 7
     On Reddit: [19] http://goo.gl/IG14P
     Original: [20] http://goo.gl/62iLX

   * Reactive-banana: new major release
     Domain: apfelmus.nfshost.com, Score: 24, Comments: 3
     On Reddit: [21] http://goo.gl/XYXvm
     Original: [22] http://goo.gl/u3PAz

Top StackOverflow Questions

   * Does Haskell require a garbage collector?
     votes: 40, answers: 7
     Read on SO: [23] http://goo.gl/hDNT4

   * Can you recognize an infinite list in a Haskell program? [closed]
     votes: 20, answers: 5
     Read on SO: [24] http://goo.gl/TcJHt

   * Confusion regarding a passage in the “Kinds and some type-foo” 
     section of learnyouahaskell.com
     votes: 12, answers: 1
     Read on SO: [25] http://goo.gl/ldKbM

   * Haskell: Correct practice to specify version in source?
     votes: 7, answers: 2
     Read on SO: [26] http://goo.gl/eUr6X

   * How to count the number of times a fuction was called, the FP way
     votes: 7, answers: 2
     Read on SO: [27] http://goo.gl/OLNxy

   * how to translate Haskell into Scalaz?
     votes: 7, answers: 2
     Read on SO: [28] http://goo.gl/1ep62

   * In which languages is function abstraction not primitive
     votes: 7, answers: 7
     Read on SO: [29] http://goo.gl/aZG5w

   * Is it possible to debug pattern matching in a Haskell function?
     votes: 6, answers: 3
     Read on SO: [30] http://goo.gl/qIpDw

   * Generate cabal file with dependencies on foreign libs
     votes: 5, answers: 2
     Read on SO: [31] http://goo.gl/mRz1o

   * Is there a monadic version of Arbitrary to use with QuickCheck?
     votes: 5, answers: 2
     Read on SO: [32] http://goo.gl/1IOg4

Until next time,
Daniel Santa Cruz

References


_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Peter Höfner | 7 Apr 15:32 2012
Picon

Call for Papera - Automated Theory Exploration (ATx)

                [Apologies if you receive multiple copies of this announcement]
                            *** Deadline extended to 17th April 2012 ***
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
                                CALL FOR PAPERS:

                                    ATX-2012
                  IJCAR Workshop on Automated Theory Exploration
                                (June 30-July 1)
                   http://dream.inf.ed.ac.uk/events/atx2012

GENERAL INFORMATION

This Workshop on Automated Theory Exploration will be held in June/July in Manchester, UK.
It is associated with the 6th International Conference on Automated Reasoning (IJCAR) and
follows on from two series of workshops: Automated Theory Engineering and Automatheo.

SCOPE

Theory exploration means the development of mathematical axioms, definitions, conjectures,
theorems, examples and inference procedures as needed to cover the essential concepts
and analysis tasks of mathematical and other application domains. The automation and
mechanisation of these capabilities are much sought after in areas such as software
verification, the analysis of computer systems, formalised mathematics and indeed
mathematical research.

The aim of the workshop is to bring together researchers with interests in any aspects
of this area, including domain-specific formalisations, tool and theory development,
and general-purpose frameworks for the structuring of theories and their maintenance.

TOPICS

Theory exploration is relevant to the design of systems, programs, APIs, protocols,
algorithms, design patterns, specification languages, programming languages and
beyond. It involves technology such as ITP systems, ATP systems, SAT/SMT solvers,
model checkers and decision procedures.

Specific topics of the workshop include, but are not limited to:

o mechanised reasoning for modelling and analysis
o automation applied to formal specification and verification
o domain specific models, languages and solvers
o theorem proving technology for theory exploration
o integration of theories and tools
o the formalisation and automation of mathematics
o case studies/experiences
o automated identification of key concepts and results
o supporting collaborative theory exploration

INVITED SPEAKERS

o Robert L. Constable, Cornell University.
o TBA

SUBMISSIONS

We invite submissions in 3 forms:

o Research papers, up to 10 pages;
o System/tool descriptions, up to 5 pages;
o Extended abstracts, up to 3 pages.

Research and tool papers must be unpublished and not submitted for publication
elsewhere. Extended abstracts are intended to discuss ideas and work in progress.
All papers will be reviewed by the programme committee.

Submissions must be in PDF using the LaTeX EasyChair-format
http://www.easychair.org/easychair.zip . One author of each accepted submission
is expected to present the paper at the workshop. Associated systems demos are
encouraged, where appropriate.

Please upload your submission at: https://www.easychair.org/conferences/?conf=atx2012

Accepted research and tool papers will be published as CEUR Workshop Proceedings.

If quality and quantity of the submissions warrants this, we plan to publish a special issue
of a recognized journal on the topic of the workshop.

IMPORTANT DATES:

Submission: 17 April 2012 (*Extended Deadline*)
Notification: 8 May, 2012
Final version: 5 June, 2012
Workshop: 30 June & 1 July, 2012

PROGRAM COMMITTEE

 o Jacques Fleuriot (University of Edinburgh, UK)
 o Timothy Griffin (University of Cambridge, UK)
 o Peter Höfner (NICTA, Australia)
 o Joe Hurd (Galois, USA)
 o Temur Kutsia (RISC, Austria)
 o Roy McCasland (University of Edinburgh, UK)
 o Annabelle McIver (Macquarie University, Australia)
 o Stephan Merz (INRIA, France)
 o Petros Papapanagiotou (University of Edinburgh, UK)
 o Alan Smaill (University of Edinburgh, UK)
 o David Stanovsky (Charles University, Czech Republic)
 o Georg Struth (University of Sheffield, UK)
 o Josef Urban (Radboud University, Netherlands)

WORKSHOP ORGANISERS

 o Alan Smaill
 o Annabelle McIver
 o Peter Höfner
 o Jacques Fleuriot

The information in this e-mail may be confidential and subject to legal professional privilege and/or
copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.

------------------------------------------------------------------------------
For Developers, A Lot Can Happen In A Second.
Boundary is the first to Know...and Tell You.
Monitor Your Applications in Ultra-Fine Resolution. Try it FREE!
http://p.sf.net/sfu/Boundary-d2dvs2
Peter Höfner | 7 Apr 15:32 2012
Picon

Call for Papera - Automated Theory Exploration (ATx)

                [Apologies if you receive multiple copies of this announcement]
                            *** Deadline extended to 17th April 2012 ***
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
                                CALL FOR PAPERS:

                                    ATX-2012
                  IJCAR Workshop on Automated Theory Exploration
                                (June 30-July 1)
                   http://dream.inf.ed.ac.uk/events/atx2012

GENERAL INFORMATION

This Workshop on Automated Theory Exploration will be held in June/July in Manchester, UK.
It is associated with the 6th International Conference on Automated Reasoning (IJCAR) and
follows on from two series of workshops: Automated Theory Engineering and Automatheo.

SCOPE

Theory exploration means the development of mathematical axioms, definitions, conjectures,
theorems, examples and inference procedures as needed to cover the essential concepts
and analysis tasks of mathematical and other application domains. The automation and
mechanisation of these capabilities are much sought after in areas such as software
verification, the analysis of computer systems, formalised mathematics and indeed
mathematical research.

The aim of the workshop is to bring together researchers with interests in any aspects
of this area, including domain-specific formalisations, tool and theory development,
and general-purpose frameworks for the structuring of theories and their maintenance.

TOPICS

Theory exploration is relevant to the design of systems, programs, APIs, protocols,
algorithms, design patterns, specification languages, programming languages and
beyond. It involves technology such as ITP systems, ATP systems, SAT/SMT solvers,
model checkers and decision procedures.

Specific topics of the workshop include, but are not limited to:

o mechanised reasoning for modelling and analysis
o automation applied to formal specification and verification
o domain specific models, languages and solvers
o theorem proving technology for theory exploration
o integration of theories and tools
o the formalisation and automation of mathematics
o case studies/experiences
o automated identification of key concepts and results
o supporting collaborative theory exploration

INVITED SPEAKERS

o Robert L. Constable, Cornell University.
o TBA

SUBMISSIONS

We invite submissions in 3 forms:

o Research papers, up to 10 pages;
o System/tool descriptions, up to 5 pages;
o Extended abstracts, up to 3 pages.

Research and tool papers must be unpublished and not submitted for publication
elsewhere. Extended abstracts are intended to discuss ideas and work in progress.
All papers will be reviewed by the programme committee.

Submissions must be in PDF using the LaTeX EasyChair-format
http://www.easychair.org/easychair.zip . One author of each accepted submission
is expected to present the paper at the workshop. Associated systems demos are
encouraged, where appropriate.

Please upload your submission at: https://www.easychair.org/conferences/?conf=atx2012

Accepted research and tool papers will be published as CEUR Workshop Proceedings.

If quality and quantity of the submissions warrants this, we plan to publish a special issue
of a recognized journal on the topic of the workshop.

IMPORTANT DATES:

Submission: 17 April 2012 (*Extended Deadline*)
Notification: 8 May, 2012
Final version: 5 June, 2012
Workshop: 30 June & 1 July, 2012

PROGRAM COMMITTEE

 o Jacques Fleuriot (University of Edinburgh, UK)
 o Timothy Griffin (University of Cambridge, UK)
 o Peter Höfner (NICTA, Australia)
 o Joe Hurd (Galois, USA)
 o Temur Kutsia (RISC, Austria)
 o Roy McCasland (University of Edinburgh, UK)
 o Annabelle McIver (Macquarie University, Australia)
 o Stephan Merz (INRIA, France)
 o Petros Papapanagiotou (University of Edinburgh, UK)
 o Alan Smaill (University of Edinburgh, UK)
 o David Stanovsky (Charles University, Czech Republic)
 o Georg Struth (University of Sheffield, UK)
 o Josef Urban (Radboud University, Netherlands)

WORKSHOP ORGANISERS

 o Alan Smaill
 o Annabelle McIver
 o Peter Höfner
 o Jacques Fleuriot

The information in this e-mail may be confidential and subject to legal professional privilege and/or
copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.

Gmane