ICC : New submission deadline

                       SECOND CALL FOR PAPERS
                    Second internation workshop on
                  Implicit Computational Complexity-2000
                        affiliated with LICS

              => NEW : Submission Deadline : April 21, 2000 <=

                       29 June - 30 June 2000
               University of California, Santa-Barbara



               Submission deadline  April 21, 2000.

               Acceptance notifications  May 15, 2000.

               Workshop dates: June 29 and June 30, 2000.

               LICS'00 dates: June  26 through 29, 2000.

After the workshop, a special issue will be published by the Journal of
Theoretical Computer Science.
Participants will be invited to submit full versions for this special

* Regularly updated information about ICC'00 is available at :


The Implicit Complexity Workshop (ICC'00)
is affiliated to LICS 2000 (http://lics.cs.bell-labs.com/).
ICC'00 will be held at the conference center of the University
of California Santa Barbara, which is situated on the beaches of the
pacific ocean (http://www.ucsb.edu/)


The synergy between Logic, Computational Complexity
and Programming Language Theory has gained
importance and vigor in recent years, cutting across areas such as
Proof Theory, Computation Theory, Applicative
Programming, and Philosophical Logic.
Several machine-independent approaches to computational complexity
have been developed, which characterize complexity
classes by conceptual measures borrowed primarily from mathematical
Collectively these approaches might be dubbed

Practically, implicit computational complexity provides framework
for a streamlined incorporation of computational complexity into
areas such as formal methods in software development,
programming language theory.
However, advances in implicit computational complexity
have focused to date mostly on  theoretical foundations.
So, in addition to research reports on advances in implicit
computational complexity,
bridging the gap between Computational Complexity and
the Programming Language Theory is therefore of particular
interest to this workshop's organizers.

For this, the workshop will try to focus on automatic complexity
analysis with some software demonstrations,
on reasoning on algorithms,
and on implementing ICC'ideas in programming language design.

A workshop on Logic and Computational Complexity was organized in
Indianapolis, by D. Leivant, in October 1994
with proceedings published as LNCS #960, and
selected papers in two special issues of Information and Computation.
A workshop on Implicit Computational Complexity in Programming
 in Sepember 1998, organized by  R. Constable and D. Leivant
was affiliated with ICFP'98 in Baltimore.
Selected papers are to be published in the Journal of Functional
Finally, the first workshop on Implicit Computational Complexity,
organized by A. Dawar and D. Leivant, was affiliated with LICS'99, in
Selected papers will be published in Information and Computation.

 The program will consist of invited talks and sessions of contributed
 papers, and software demonstrations.


The results must be unpublished and not submitted for publication
Survey papers that present some  unified perspectives are welcome.
One author of each accepted paper is expected to present the paper at
the meeting.  Proposed contributions should be submitted as extended
abstracts,  no more than 10 pages long in 11-point font.
It must be in English and provide sufficient detail to allow the program

committee to assess the merits of the paper. It should begin with a
succinct statement of the issues, a summary of  the main results, and
an explanation of their significance and relevance to the
workshop. Detailed proofs, examples, programs, and other technical
information may be included in the form of appendices.

All submissions must be done electronically.
Please email your submission to Jean-Yves.Marion@loria.fr,
with the phrase "ICC submission" as the message subject.
Please email separately a cover letter,
stating the paper's title, one corresponding author with complete
contact information (address, email, phone, fax), and names and
affiliation of other authors, if any.

Stephen Bellantoni (University of Toronto)
Samuel Buss (University of California, USA)
Loic Colson (Universite de Metz, France)
Martin Hofmann (University of Edinburgh, GB)
Neil Jones (University of Copenhagen, Danemark)
Claude Kirchner (Loria, Nancy, France)
Daniel Leivant (University of Indiana, USA)
Jean-Yves Marion (Loria, Nancy, France) (Chair)
Helmut Schwichtenberg (University of Muenchen, Germany)

Jean-Yves Marion
BP 239
54506 Vandoeuvre-les-Nancy cedex
tel : (33)+3 83 59 20 18
fax : (33)+3 83 27 83 19