2010-03-23

[Caml-list] ICFP 2010: Final Call for Papers

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

Final Call for Papers

ICFP 2010: International Conference on Functional Programming

Baltimore, Maryland, 27 -- 29 September 2010

http://www.icfpconference.org/icfp2010

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

Important Info
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Submission: 2 April 2010
Author response: 24 -- 25 May 2010
Notification: 7 June 2010
Final papers due: 12 July 2010

All deadlines are at 14:00 UTC.

Submission is now open at http://icfp2010.seas.upenn.edu/

Scope
~~~~~

ICFP 2010 seeks original papers on the art and science of functional
programming. Submissions are invited on all topics from principles to
practice, from foundations to features, from abstraction to
application. The scope includes all languages that encourage
functional programming, including both purely applicative and
imperative languages, as well as languages with objects or
concurrency. Particular topics of interest include

* Language Design: type systems; concurrency and distribution;
modules; components and composition; metaprogramming; relations to
object-oriented or logic programming; interoperability

* Implementation: abstract machines; compilation; compile-time and
run-time optimization; memory management; multi-threading;
exploiting parallel hardware; interfaces to foreign functions,
services, components or low-level machine resources

* Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling

* Foundations: formal semantics; lambda calculus; rewriting; type
theory; monads; continuations; control; state; effects

* Transformation and Analysis: abstract interpretation; partial
evaluation; program transformation; program calculation; program
proof

* Applications and Domain-Specific Languages: symbolic computing;
formal-methods tools; artificial intelligence; systems programming;
distributed-systems and web programming; hardware design; databases;
XML processing; scientific and numerical computing; graphical user
interfaces; multimedia programming; scripting; system
administration; security; education

* Functional Pearls: elegant, instructive, and fun essays on
functional programming The conference also solicits Experience
Reports, which are short papers that provide evidence that
functional programming really works or describe obstacles that have
kept it from working in a particular application.

Abbreviated instructions for authors
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
By 2 April 2010, 14:00 UTC, submit an abstract of at most 300 words
and a full paper of at most 12 pages (6 pages for an Experience
Report), including bibliography and figures. The deadline will be
strictly enforced and papers exceeding the page limits will be
summarily rejected. Authors have the option to attach supplementary
material to a submission, on the understanding that reviewers may
choose not to look at it.

A submission will be evaluated according to its relevance,
correctness, significance, originality, and clarity. It should explain
its contributions in both general and technical terms, clearly
identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience. Functional Pearls
and Experience Reports are separate categories of papers that need not
report original research results and must be marked as such at the
time of submission. Detailed guidelines on both categories are on the
conference web site.

Each submission must adhere to SIGPLAN's republication policy, as
explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm.

Proceedings will be published by ACM Press. Authors of accepted
submissions are expected to transfer the copyright to the
ACM. Presentations will be videotaped and released online if the
presenter consents by signing an additional permission form at the
time of the presentation. Formatting: Submissions must be in PDF
format printable in black and white on US Letter sized paper and
interpretable by Ghostscript. If this requirement is a hardship, make
contact with the program chair at least one week before the
deadline. Papers must adhere to the standard ACM conference format:
two columns, nine-point font on a ten-point baseline, with columns
20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc
(0.33in). A suitable document template for LATEX is available from
SIGPLAN at http://www.acm.org/sigs/sigplan/authorInformation.htm.

Submission: Submissions will be accepted electronically at a URL to be
named later. Improved versions of a paper may be submitted at any
point before the submission deadline using the same web interface.

Author response: Authors will have a 48-hour period, starting at 14:00
UTC on 24 May 2010, to read and respond to reviews.

Special Journal Issue: There will be a special issue of the Journal of
Functional Programming with papers from ICFP 2010. The program
committee will invite the authors of select accepted papers to submit
a journal version to this issue.

Organization
~~~~~~~~~~~~
Conference Chair
Paul Hudak, Yale University

Program Chair
Stephanie Weirich, University of Pennsylvania

Program Committee:
Umut Acar, Max Planck Institute for Software Systems
Zena Ariola, University of Oregon
James Cheney, University of Edinburgh
Peter Dybjer, Chalmers University of Technology
Robert Bruce Findler, Northwestern University
Andy Gill, Kansas University
Fritz Henglein, University of Copenhagen
Michael Hicks, University of Maryland, College Park
Patricia Johann, University of Strathclyde
Andres Löh, Utrecht University
Simon L. Peyton Jones, Microsoft Research
Didier Rémy, INRIA Paris-Rocquencourt
John Reppy, University of Chicago
Manuel Serrano, INRIA Sophia-Antipolis
Matthieu Sozeau, Harvard University

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2010-03-22

[Caml-list] CSL 2010 - 2nd Call for Papers

Second Call for Papers

CSL 2010
Annual Conference of the European Association for Computer Science Logic

August 23-27, 2010, Brno, Czech Republic

http://mfcsl2010.fi.muni.cz/csl

Submission (title & abstract): March 26, 2010
Submission (full paper): April 2, 2010
Notification: May 17, 2010
Final papers: June 6, 2010

Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL). The conference is intended
for computer scientists whose research activities involve logic, as well as
for logicians working on issues significant for computer science. The 19th
EACSL Annual Conference on Computer Science Logic (CSL 2010) and the 35th
International Symposium on Mathematical Foundations of Computer Science
(MFCS 2010) are federated and organized in parallel at the same place. The
federated MFCS & CSL 2010 conference has common plenary sessions and social
events for all participants. The technical program and proceedings of MFCS
2010 and CSL 2010 are prepared independently. The MFCS & CSL 2010 conference is
accompanied by satellite workshops on more specialized topics.

Suggested topics of interest include (but are not limited to) automated
deduction and interactive theorem proving, constructive mathematics and type
theory, equational logic and term rewriting, automata and games, modal and
temporal logic, model checking, decision procedures, logical aspects of
computational complexity, finite model theory, computational proof theory,
logic programming and constraints, lambda calculus and combinatory logic,
categorical logic and topological semantics, domain theory, database theory,
specification, extraction and transformation of programs, logical foundations
of programming paradigms, verification and program analysis, linear logic,
higher-order logic, nonmonotonic reasoning.

Proceedings will be published in the Advanced Research in Computing and
Software Science (ARCoSS) subline of the LNCS series. Each paper accepted by
the Programme Committee must be presented at the conference by one of the
authors, and a final copy must be prepared according to Springer's guidelines.
Submitted papers must be in Springer's LNCS style and of no more than 15 pages,
presenting work not previously published. They must not be submitted
concurrently to another conference with refereed proceedings. The PC chairs
should be informed of closely related work submitted to a conference or journal
by March 19, 2010. Papers authored or coauthored by members of the Programme
Committee are not allowed.

Papers will be submitted through the conference website. Submitted papers
must be in English and provide sufficient detail to allow the Programme
Committee to assess the merits of the papers. Full proofs may appear in a
technical appendix which will be read at the reviewers' discretion. Authors
are strongly encouraged to include a well written introduction which is
directed at all members of the program committee.

The Ackermann Award for 2010 will be presented to the recipients at CSL'10.

There will be a Special Issue of the Journal LMCS (Logical Methods in Computer
Science) based on selected papers of CSL 2010.

*** Programme Committee

Armin Biere (Linz)
Lars Birkedal (ITU, Denmark)
Nikolaj Bjorner (Redmond)
Manuel Bodirsky (Paris)
Mikolaj Bojanczyk (Warsaw)
Iliano Cervesato (Doha)
Krishnendu Chatterjee (Klosterneuburg)
Agata Ciabattoni (Vienna)
Anuj Dawar (Cambridge, co-chair)
Azadeh Farzan (Toronto)
Georg Gottlob (Oxford)
Martin Hofmann (Munich)
Orna Kupferman (Jerusalem)
Christof Loeding (Aachen)
Joao Marques-Silva (Dublin)
Tobias Nipkow (Munich)
Prakash Panangaden (Montreal)
R. Ramanujam (Chennai)
Simona Ronchi della Rocca (Torino)
Alex Simpson (Edinburgh)
Pascal Tesson (Quebec)
Helmut Veith (Vienna, co-chair)
Yde Venema (Amsterdam)


*** CSL/MFCS Plenary Speakers

David Basin (Zurich)
Herbert Edelsbrunner (Klosterneuburg)
Erich Gr?adel (Aachen)
Joseph Sifakis (Gieres)


*** CSL Invited Speakers

Peter O?Hearn (London)
Jan Krajicek (Prague)
Andrei Krokhin (Durham)
Andrey Rybalchenko (Munich)
Viktor Kuncak (Lausanne)


*** Organizing Committee

Jan Bouda (Brno, chair)


*** Conference address

MFCSL 2010
Faculty of Informatics
Masaryk University,
Botanicka 68a, 60200 Brno
Czech Republic

mfcsl2010@fi.muni.cz

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2010-03-11

[Caml-list] LPAR-17 in Indonesia - Calls for Papers and Workshop Proposals

===========================
LPAR-17
CALL FOR PAPERS
CALL FOR WORKSHOP PROPOSALS
===========================

============================================================
The 17th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
============================================================

Yogyakarta, Indonesia - October 10th-15th, 2010
http://www.computational-logic.org/lpar-17/Home.html

The series of International Conferences on Logic for Programming, Artificial
Intelligence and Reasoning (LPAR) is a forum where, year after year, some of
the most renowned researchers in the areas of logic, automated reasoning,
computational logic, programming languages and their applications come to
present cutting-edge results, to discuss advances in these fields, and to
exchange ideas in a scientifically emerging part of the world. The 17th LPAR
will be held in Yogyakarta, Indonesia.

Logic is a fundamental organizing principle in nearly all areas in Computer
Science. It runs a multifaceted gamut from the foundational to the applied.
At one extreme, it underlies computability and complexity theory and the
formal semantics of programming languages. At the other extreme, it drives
billions of gates every day in the digital circuits of processors of all
kinds. Logic is in itself a powerful programming paradigm, but it is also the
quintessential specification language for anything ranging from real-time
critical systems to networked infrastructures. Logical techniques link
implementation and specification through formal methods such as automated
theorem proving and model checking. Logic is also the stuff of knowledge
representation and artificial intelligence. Because of its ubiquity, logic
has acquired a central role in Computer Science education.

Topics
------
New results in the fields of computational logic and applications are welcome.
Also welcome are more exploratory presentations, which may examine open
questions and raise fundamental concerns about existing theories and practices.

Topics of interest include, but are not limited to:
* Automated reasoning
* Verification
* Interactive theorem proving and proof assistants
* Model checking
* Implementations of logic
* Satisfiability modulo theories
* Rewriting and unification
* Logic programming
* Satisfiability checking
* Constraint programming
* Decision procedures
* Logic and games
* Logic and the Web
* Ontologies and large knowledge bases
* Logic and databases
* Modal and temporal logics
* Program analysis
* Foundations of security
* Description logics
* Non-monotonic reasoning
* Uncertainty reasoning
* Logics for vague and inconsistent data
* Specification using logic
* Logic in artificial intelligence
* Logic and types
* Logical foundations of programming
* Logical aspects of concurrency
* Logic and computational complexity
* Knowledge representation and reasoning
* Logic of distributed systems

Programme Chairs
----------------
* Chris Fermueller
* Andrei Voronkov

Submission Details
------------------
Submissions of two kinds are welcome:

* Regular papers that describe solid new research results. They can be
up to 15 pages long in LNCS style, including figures and references,
but excluding appendices (that reviewers are not required to read).
* Experimental and tool papers that describe implementations of systems,
report experiments with implemented systems, or compare implemented
systems. They can be up to 8 pages long in the LNCS style.

Both types of papers can be electronically submitted in PDF via EasyChar:
http://www.easychair.org/conferences/?conf=lpar17. Prospective authors are
required to register a title and an abstract a week before the paper
submission deadline (see below).

Workshop Proposals
------------------
LPAR-17 workshops will be held on October 10, either as one-day or half-day
events. If you would like to propose a workshop for LPAR-17, please contact
the workshop chair, Laura Kovacs, via email, by the proposal deadline (see
below).

Workshop proposals should contain the following data:
* Name of the workshop.
* Brief description of the workshop, including workshop topics.
* Valid web address of the workshop.
* Contact information of the workshop organizers.
* An estimate of the audience size.
* Proposed format of the workshop (for example, regular talks, tool demos,
poster presentations, etc.).
* Duration of the workshop (one-day or half-day).
* Potential invited speakers (if any).
* Procedures for selecting papers and participants.
* Special technical or AV needs.

Note that workshops will have to be financially self-supporting.

Participation
-------------
Authors of accepted papers are required to ensure that at least one of them
will be present at the conference.

Important Dates
---------------
* Workshop proposals: 2 April 2010
* Workshop notification: 7 April 2010
* Abstract submission: 1 June 2010
* Paper submission: 8 June 2010
* Notification of acceptance: 26 July 2010
* Camera-ready papers: 6 August 2010
* Conference: 10-15 October 2010

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

[Caml-list] PLMMS 2010: Last Call for Papers

[Apologies for possible multiple postings.]

-------------------------------------------------------------------
CALL FOR PAPERS
-------------------------------------------------------------------
In co-operation with ACM SIGSAM, the International Workshop on

Programming Languages for Mechanized Mathematics Systems
(PLMMS 2010)

Part of CICM-2010, in CNAM, Paris, France; 8th of July 2010
-------------------------------------------------------------------


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

* Abstract submission: Fri 26 March 2010
* Paper submission: Fri 9 April 2010
* Reviews sent to authors: Mon 10 May 2010
* Author's response deadline: Mon 17 May 2010
* Notification of acceptance: Mon 24 May 2010
* Camera ready copy due: Mon 7 June 2010
* Workshop: Thu 8 July 2010


Invited Speaker: Jacques Carette (McMaster University, Canada)


PLMMS Scope
-----------

The program committee welcomes submissions on programming language
issues related to all aspects of mechanised mathematics systems
(MMS). In particular:

- Mathematical algorithms
- Tactics and proof search
- Proofs
- Mathematical notation

Of particular interest are the dimensions of:

- Expressiveness
- Efficiency
- Correctness
- Understandability and Usability
- Modularity and Extensibility
- Design and implementation

Mechanised mathematics systems, whether stand-alone or embedded in
larger systems, include but are not limited to:

- Dependent typed programming languages
- Proof assistants
- Computer algebra systems
- Proof planning systems
- Theorem proving systems
- Theory formation systems

These issues have a very colourful history. Why are all the languages
of mainstream computer algebra systems untyped? (Not for lack of
trying: Axiom and Magma both enjoy type systems, although they have
not (yet) become mainstream.) Why are the (strongly typed) proof
assistants so much harder to use than a typical computer algebra
systems? What forms of polymorphism exist in mathematics? What forms
of dependent types may be used in mathematical modelling? How can MMS
regain the upper hand on issues of "genericity" and "modularity"?
What are the biggest barriers when using more mainstream languages for
computer algebra systems, proof assistants or theorems provers?

Many programming language innovations appeared in either computer
algebra or proof systems first, before migrating into more mainstream
programming languages. This workshop is an opportunity to present the
latest innovations in the design of MMS that may be relevant to future
programming languages, or conversely novel programming language
principles that improve upon the implementation and deployment of MMS.


Submission Details
------------------

Accepted papers will appear in the ACM Digital Library.

Papers should be submitted via the PLMMS 2010 easychair website:

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

Submissions must describe original unpublished work which is not been
submitted for publication elsewhere. At least one author of each
accepted paper is expected to attend PLMMS 2010 and present her or his
paper. Papers should be no more than 8 pages in length and are to be
submitted in PDF format. They must conform to the ACM SIGPLAN style
guidelines using 9-point font size (see
http://www.acm.org/sigs/sigplan/authorInformation.htm - this also
provides latex templates). Each submission must also adhere to
SIGPLAN's republication policy
(http://www.sigplan.org/republicationpolicy.htm). Papers will be
reviewed by at least three reviewers and the authors will have an
opportunity for rebuttal by the response deadline.


Links
-----

* http://www.easychair.org/conferences/?conf=plmms2010
abstract and paper submission webpage

* ttp://www.acm.org/sigs/sigplan/authorInformation.htm
submission style guide

* http://www.sigplan.org/republicationpolicy.htm
republication policy

* http://dream.inf.ed.ac.uk/events/plmms-2010/
the PLMMS 2010 web site

* http://cicm2010.cnam.fr/
the CICM 2010 conference web site


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

* Thorsten Altenkirch (University of Nottingham, UK)
* Serge Autexier (DFKI, Germany)
* David Delahaye (CNAM, Paris, France)
* James Davenport [PC co-chair] (University of Bath, UK)
* Lucas Dixon [PC co-chair] (University of Edinburgh, UK)
* Gudmund Grov (University of Edinburgh, UK)
* Ewen Maclean (University of Herriot Watt, UK)
* Dale Miller (INRIA, France)
* Gabriel Dos Reis (Texas A&M University, USA)
* Carsten Schuermann (IT University of Copenhagen, Denmark)
* Tim Sheard (Portland State University, USA)
* Sergei Soloviev (IRIT, Toulouse, France)
* Stephen Watt (The University of Western Ontario, Canada)
* Makarius Wenzel (ITU Munich, Germany)
* Freek Wiedijk (Radboud University Nijmegen, Netherlands)

--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2010-03-10

[Caml-list] PLACES'10: call for participation

                    CALL FOR PARTICIPATION
                                 PLACES'10
Programming Language Approaches to Concurrency
            and communication-cEntric Software
               21st March 2010, Paphos, Cyprus
                     Affiliated with ETAPS 2010
                      http://places10.di.fc.ul.pt/


Dear colleagues,

This is the call for participation for PLACES'2010, a workshop
for foundations of concurrent and distributed programming.
Applications on the web today are built using numerous
interacting services; soon off-the-shelf CPUs will host hundreds
of cores; and sensor networks will be composed from a large
number of processing units.  Many normal software, including
applications and system-level services, will soon need to make
effective use of thousands of computing nodes. At some level
of granularity, computation in such systems will be inherently
concurrent and communication-centred.

To exploit and harness the richness of this computing
environment, designers and programmers will utilise a rich
variety of programming paradigms, depending on the shape of
the data and control flow. Plausible candidates for such paradigms
include structured imperative concurrent programming, stream-
based programming, concurrent functions with asynchronous
message passing, higher-order types for events, and the use of
types for communications and data structures, to name but a few.
Combinations of these abstractions will be used even in a single
application, and the runtime environment needs to ensure seamless
execution without relying on differences in available resources such
as the number of cores.

The development of effective programming methodologies for the
coming computing paradigm demands exploration and understanding
of a wide variety of ideas and techniques.  This workshop aims
to offer a forum where researchers from different fields
exchange new ideas on one of the central challenges for
programming in the near future, the development of programming
methodologies and infrastructures where concurrency and
distribution are the norm rather than a marginal concern.

With these backgrounds, PLACES'10 is held welcoming as an
invited speaker William Cook from Texas Austin, and excellent
contributions from researchers from divsese fields of
programming studies. We cordially invite your participation in
this workshop. We attach the basic information below.

Very best wishes,

Alan and Kohei
Co-Chairs of PLACES'10

* Invited Speaker

William Cook (University of Texas, Austin)

* Programme

Morning

(a) Type Inference for Communications: 9:00-10:30

Alastair Donaldson, Daniel Kroening and Philipp Ruemmer. Analysing
DMA Races in Multicore Software

Luísa Lourenço and Luis Caires. Type Inference for Conversation
Types

Keigo Imai, Shoji Yuen and Kiyoshi Agusa. Session Type
Inference in Haskell

(b) Controlling Imperative Concurrency: 11:00-12:30

Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas.
A Type System for Unstructured Locking that Guarantees Deadlock Freedom
without Imposing a Lock Ordering

Francisco Martins, Vasco Vasconcelos and Tiago Cogumbreiro. An
Investigation on Types for X10 Clocks

Joana Campos and Vasco T. Vasconcelos. Channels as Objects in
Concurrent Object-Oriented Programming

Lunch 12:30-14:00

Afternoon:

invited talk: 14:00-15:00

William Cook

(c) Language and Runtime Design: 15:00-16:00

Nuno Alves, Raymond Hu, Nobuko Yoshida and Pierre-Malo
Deniélou. Secure Execution of Distributed Session Programs

Julien Lange and Emilio Tuosto. A Modular Toolkit for Theories of
Distributed Interactions

Break 16:00-16:30

(d) Logical and Semantic Foundations of Distributed Programming: 16:30-17:30

Marco Carbone, Thomas Hildebrandt and Hugo A. Lopez. Towards
a Modal Logic for the Global Calculus

Thomas Hildebrandt and Raghava Rao Mukkamala. Distributed Dynamic
Condition Response Structures

* Further Information

For information on PLACES'10, please see:

  http://places10.di.fc.ul.pt/

For information on ETAPS'10, please see:

  http://www.etaps10.cs.ucy.ac.cy/

[end]

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2010-03-05

[Caml-list] 2nd Call for Papers: LoCoCO 2010

LoCoCo 2010 -- Workshop on Logics for Component Configuration
Workshop of SAT at FLoC 2010, Edinburgh, Scotland, July 10, 2010
http://lococo2010.mancoosi.org/
Second Call for Papers


Scope:
======
Modern software distributions are based on the notion of components, which
denote units of independent development and deployment. Components provide
the necessary flexibility when organizing a complex software distribution,
but also are a challenge when it comes to selecting components from a large
repository of possible choices, and configuring these components according
to user needs, resource constraints, and interdependencies with other
components. Representing and solving configuration problems is a hot topic
of great importance for many application domains. Some well-known examples
of complex systems of components in the world of Free and Open Source
software are the different distributions for GNU/Linux, BSD, or Eclipse
plugins.

Understanding and solving these questions is an attractive research
topic since the problems to be solved are complex and interesting for
researchers working on solving techniques, and on the other hand have
the potential of high impact on the way the software we all use
everyday is developed and deployed. Not only adequate logical
formalisms to represent a configuration problem are required, but also
sophisticated reasoning technologies to deal with large amounts of
data. Further relevant aspects include diagnosis of failed
configuration settings and an intelligent behavior dealing with user
preferences.

This workshop will focus on logic-based methods for specifying and solving
complex configuration problems for software components. The goal of the
workshop is to bring together both researchers and practitioners active in
the area of component configuration of software systems, using different
modeling and solving techniques, such as constraint and logic programming,
description logics, satisfiability and its extensions. The workshop will be
an opportunity to discuss common and complementary solutions for solving
component configuration.

Topics:
=======
Main areas of interest include, but are not restricted to:
o Configuration problems and models: knowledge representation and
acquisition, incomplete knowledge, inconsistent knowledge, etc.
o Reasoning methods for solving configuration problems: constraint
satisfaction and optimization, SAT solving and extensions, integer
programming, local search, symmetry breaking, etc.
o Interactivity: user preferences, machine learning, distributed
environments, etc.
o Applications and tools: case studies, current challenges,
application reports, etc.

Invited Talk
============
An invited talk will be given by Carsten Sinz (University of Karlsruhe).

MISC 2010
=========
The first Mancoosi International Solver Competition will be held in
conjunction with the LoCoCo workshop:

http://www.mancoosi.org/misc-2010

Important Dates
===============
Friday, March 26 Submission deadline
Friday, April 23 Notification about acceptance
Friday, May 21 Final paper due
Saturday, July 10 Workshop

Submission and Publication
==========================
We welcome submissions of various types of papers related to the
topics of the workshop:

* Regular research papers must be original work, and must not have
been previously published, nor be under consideration for
publication elsewhere. This category includes system descriptions
and tutorial overview papers. System descriptions should come with
an URL allowing to access or download the system, with preference to
systems that can be downloaded under an open source
licence. Presentations of system descriptions at the workshop should
include a system demonstration.

* Presentations reporting on recent or ongoing work. They are not
subject to restriction as for previous, simultaneous, or future
publication elsewhere.

The complete proceedings, containing the accepted papers of both
categories, will be made freely available on the web for the workshop.
It is planned to provide electronic copies on an USB stick to
registered workshop participants. In addition to that, accepted
regular research papers will be published in a special issue of
Electronic Proceedings in Theoretical Computer Science (EPTCS).

Submitted papers of both categories must not exceed a limit of 10
pages, and have to be prepared in LaTeX following the EPTCS formatting
instructions. Authors may provide pointers to additional online
resources if necessary, and which the reviewers may use to their sole
discretion. Authors of accepted papers will keep their copyright,
however all papers (of both categories) must carry one of the
different brands of the Creative Commons Licence mandated by
EPTCS. Authors of accepted papers for the EPTCS proceedings have to
grant EPTCS a non-exclusive licence to distribute.

Submissions are handled by easychair at

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


Program Committee
=================
Daniel Le Berre (Universite d'Artois, France)
Roberto Di Cosmo (Universite Paris-Diderot, France)
Georg Gottlob (Oxford University, UK)
Pascal van Hentenryck (Brown University, USA)
Matti Jarvisalo (University of Helsinki, Finland)
Ines Lynce (INESC-ID, Lisbon, Portugal), co-chair
Toni Mancini (Sapienza Universita di Roma, Italy)
Albert Oliveras (Technical University of Catalonia, Barcelona, Spain)
Christian Schulte (KTH, Stockholm, Sweden)
Ralf Treinen (Universite Paris-Diderot, France), co-chair
Nic Wilson (UCC, Cork, Irland)


_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

[Caml-list] Commercial Users of Functional Programming - call for participation

The following is the call for participation for CUFP, the Commerical Users of Functional Programming workshop that is co-located with ICFP.  If you have experience using OCaml (or another functional language) in a practical application, consider submitting a proposal to give a talk about it at CUFP!

Also, check out the new CUFP website: http://cufp.org

Without further ado:

CUFP 2010 Call For Participation
================================

Functional programming languages have been a hot topic of academic
research for over 35 years, and have seen an ever larger practical
impact in settings ranging from tech startups to financial firms to
biomedical research labs.  At the same time, a vigorous community of
practically-minding functional programmers has come into existence.

CUFP is designed to serve this community.  The annual CUFP workshop is
a place where people can see how others are using functional
programming to solve real world problems; where practitioners meet and
collaborate; where language designers and users can share ideas about
the future of their favorite language; and where one can learn
practical techniques and approaches for putting functional programming
to work.
 
Giving a CUFP Talk
------------------
 
If you have experience using functional languages in a practical
setting, we invite you to submit a proposal to give a talk at the
workshop.  We're looking for two kinds of talks:

**Experience reports** are typically 25 minutes long, and aim to inform
participants about how functional programming plays out in real-world
applications, focusing especially on lessons learned and insights
gained. Experience reports don't need to be highly technical;
reflections on the commercial, management, or software engineering
aspects are, if anything, more important. You do not need to submit a
paper!

**Technical talks** are expected to be 30-45 minutes long, and should
focus on teaching the audience something about a technical technique
or methodology, from the point of view of someone who has seen it play
out in practice.  These talks could cover anything from techniques for
building functional concurrent applications, to managing dynamic
reconfigurations, to design recipes for using types effectively in
large-scale applications.  While these talks will often be based on a
particular language, they should be accessible to a broad range of
functional programmers.

If you are interested in offering a talk, or nominating someone to do
so, send an e-mail to francesco(at)erlang-consulting(dot)com or
yminsky(at)janestreet(dot)com by 15 May 2010 with a short description
of what you'd like to talk about or what you think your nominee should
give a talk about. Such descriptions should be about one page long.
 
There will be no published proceedings, as the meeting is intended to
be more a discussion forum than a technical interchange.

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

* Francesco Cesarini, Erlang Training and Consulting (Co-Chair)
* Tim Dysinger, Sonian Networks
* Alain Frisch, LexiFi
* Nick Gerakines, Chegg
* Adam Granicz, IntelliFactory
* Amanda Laucher
* Romain Lenglet, Google Japan
* Yaron Misky, Jane Street (Co-Chair)
* Mary Sheeran, Chalmers
* Don Stewart, Galois
* Dean Wampler, DRW Trading

More information
----------------

For more information on CUFP, including videos of presentations from
previous years, take a look at the CUFP website at <http://cufp.org>.

2010-03-01

[Caml-list] LPAR-16 Short Papers - CFP

=====================
CALL FOR SHORT PAPERS
=====================

LPAR-16

16th International Conference on Logic for
Programming, Artificial Intelligence and Reasoning

April 25 - May 1, 2010
Dakar, Senegal
http://www.lpar.net/lpar-16/


The series of International Conferences on Logic for Programming, Artificial
Intelligence and Reasoning (LPAR) is a forum where, year after year, some of
the most renowned researchers in the areas of logic, automated reasoning,
computational logic, programming languages and their applications come to
present cutting-edge results, to discuss advances in these fields, and to
exchange ideas in a scientifically emerging part of the world. The 16th
edition will be held in Dakar, Senegal.

---------------------------------------------------------------------------
In keeping with the tradition of LPAR, researchers and practioners are
encouraged submit short papers reporting on interesting work in progress or
providing system descriptions. They need not be original. Extended versions
of the short papers may be submitted concurrently with or after LPAR-16 to
another conference or a journal.
---------------------------------------------------------------------------

Logic is a fundamental organizing principle in nearly all areas in Computer
Science. It runs a multifaceted gamut from the foundational to the applied.
At one extreme, it underlies computability and complexity theory and the
formal semantics of programming languages. At the other, it drives billions
of gates every day in the digital circuits of processors of all kinds. Logic
is in itself a powerful programming paradigm but it is also the quintessential
specification language for anything ranging from real-time critical systems
to networked infrastructures. Logical techniques link implementation and
specification through formal methods such as automated theorem proving and
model checking. Logic is also the stuff of knowledge representation and
artificial intelligence. Because of its ubiquity, logic has acquired a
central role in Computer Science education.

Topics
------
New results in the fields of computational logic and applications are welcome.
Also welcome are more exploratory presentations, which may examine open
questions and raise fundamental concerns about existing theories and practices.

Topics of interest include, but are not limited to:
* Automated reasoning
* Verification
* Interactive theorem proving and proof assistants
* Model checking
* Implementations of logic
* Satisfiability modulo theories
* Rewriting and unification
* Logic programming
* Satisfiability checking
* Constraint programming
* Decision procedures
* Logic and the Web
* Ontologies and large knowledge bases
* Logic and databases
* Modal and temporal logics
* Program analysis
* Foundations of security
* Description logics
* Non-monotonic reasoning
* Specification using logics
* Logic in artificial intelligence
* Logic and types
* Logical foundations of programming
* Logical aspects of concurrency
* Logic and computational complexity
* Knowledge representation and reasoning
* Logic of distributed systems

Programme Chairs
----------------
* Ed Clarke
* Andrei Voronkov

Programme Committee
-------------------
* Rajeev Alur
* Matthias Baaz
* Peter Baumgartner
* Armin Biere
* Nikolaj Bjorner
* Iliano Cervesato
* Agata Ciabattoni
* Hubert Comon-Lundh
* Nachum Dershowitz
* Juergen Giesl
* Guillem Godoy
* Georg Gottlob
* Jean Goubault-Larrecq
* Reiner Haehnle
* Claude Kirchner
* Michael Kohlhase
* Konstantin Korovin
* Laura Kovacs
* Orna Kupferman
* Leonid Libkin
* Aart Middeldorp
* Luke Ong
* Frank Pfenning
* Andreas Podelski
* Andrey Rybalchenko
* Helmut Seidl
* Geoff Sutcliffe
* Ashish Tiwari
* Toby Walsh
* Christoph Weidenbach

Submission Details
------------------
Short papers are limited in length to 5 pages in the EasyChair format. The
class style may be downloaded from http://www.easychair.org/easychair.zip.
Short papers must be submitted through the EasyChair system using the web
page ...
http://www.easychair.org/conferences/?conf=lpar16short

The short paper proceedings will be available as an EasyChair collection
volume.

Participation
-------------
Authors of accepted papers are required to ensure that at least one of them
will be present at the conference. Papers that do not adhere to this policy
will be removed from the proceedings.

Important Dates
---------------
Paper submission deadline: 17 March 2010
Notification of acceptance: 25 March 2010
Final version: 1 April 2010
LPAR-16: 25 April - 1 May 2010

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

[Caml-list] CFP: Call for papers, Coq Workshop (Edinburgh, July 9)

Please help disseminate this call for papers

Two changes in the call for papers:

1/ papers describing experiments in other type theory-based proof
assistants are explicitly invited to this workshop,

2/ EPTCS (http://eptcs.org/) has agreed to host the proceedings.

Call for papers

The Coq workshop will bring together Coq users, developers and
contributors. The workshop will be organized from submitted papers,
invited talks and a plenary discussion on the evolution and design of
Coq. Topics for submitting a paper include:

* Experiments with type-theoretic proof assistants
* Language or tactics features
* Theory and implementation of the Calculus of Inductive Constructions
* Applications and experience in education and industry
* Tools, platforms built on Coq
* Plugins, libraries for Coq
* Interfacing with Coq
* Formalization tricks and Coq pearls

Authors should submit their paper through EasyChair at the following link:

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

Submitted papers should be in (postscript or) portable document format.
Papers should not exceed 12 pages in length in single-column full-page
11pt A4 style.

If there is sufficient demand, we will try to organize a time slot for
demonstrations. Similarly, we may also organize a session on the lessons
learned from teaching Coq. If you are interested, please send a brief
proposal.

Venue

FLoC 2010, Edinburgh, Scotland

Important Dates

* March 22nd: Deadline for submission of papers
* May 1st: Acceptance Notification
* May 31st: Final version of articles
* July 9th: Workshop in Edinburgh

Program Committee

* Andrew Appel
* Yves Bertot (Chair)
* Adam Chlipala
* Georges Gonthier
* Benjamin Grégoire
* Hugo Herbelin
* Micaela Mayero
* Christine Paulin-Mohring
* Bas Spitters

_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs