Pierre Cointe | 1 Feb 14:37 2002

Positions in Ecole des mines de Nantes

                         ECOLE DES MINES DE NANTES
              Laboratoire d'informatique / Computer Science Department
                        APPEL A CANDIDATURES / ANNOUNCEMENT 

                  (Date limite 11 mars 2002 !/DEADLINE march 11 2002!)

Il y aura au concours 2002 / Ecole des Mines de Nantes will hire in 2002 

- 2 postes de professeur (première et deuxième classe)  / 2 professors 
- 2 postes de maitres de conferences / 2 assistant professors 

Profils particulièrement recherchés / some possible research profiles
for applicants 

  langages de programmation/programming languages 
    constraints programming (CSP)
    object-oriented programming
    aspect-oriented programming
  génie logiciel/software engineering (components, modeling, ...)

Informations sur les postes/Application information

Il s'agit de postes de titulaire du ministère de l'industrie. Les postes
seront ouverts début 2002, et le dossiers sont à retirer avant le 4 mars
pour dépôt au plus tard le 11 mars./The positions will be officially
for application in March. The four positions are permanent positions,
(Continue reading)

Ruy de Queiroz | 1 Feb 16:16 2002

WoLLIC'2002 - call for papers

                              Call for Papers

        9th Workshop on Logic, Language, Information and Computation
                        July 30 to August 2, 2002

           Scientific Co-Sponsorship: IGPL, FoLLI, ASL, SBC, SBL

                        Rio de Janeiro, Brazil

	"Electronic Notes in Theoretical Computer Science" (Elsevier))

  The "9th Workshop on Logic, Language, Information and Computation"
  (WoLLIC'2002), the nineth version of a series of workshops which started
  in 1994 with the aim of fostering interdisciplinary research in pure and
  applied logic, will be held in Rio de Janeiro, Brazil, from July 30 to
  August 2, 2002.

  Contributions are invited in the form of short papers (12 A4 10pt pages) in
  all areas related to logic, language, information and computation, including:
  pure logical systems, proof theory, model theory, algebraic logic, type
  theory, category theory, constructive mathematics, lambda and combinatorial
  calculi, program logic and program semantics, logics and models of
  concurrency, logic and complexity theory, proof complexity,
  foundations of cryptography (zero-knowledge proofs), descriptive complexity,
  nonclassical logics, nonmonotonic logic, logic and language,
(Continue reading)

Johan Jeuring | 4 Feb 13:29 2002

Summer School on Generic Programming

Summer School and Workshop on Generic Programming
           St Anne's College, Oxford, UK
              26th to 30th August 2002

                 In conjunction with
Summer School and Workshop on Advanced Functional Programming

This school is a successor to the Summer School and Workshop on
Algebraic and Coalgebraic Methods in the Mathematics of Program
Construction, held in Oxford in April 2000 and with lecture notes
shortly to appear as LNCS 2297.  For this school we have recruited
an excellent group of lecturers on generic programming, that is,
the construction of programs that work on different datatypes
and yet may exploit the structure of that data.

************         Lecturers        ************

* Roland Backhouse (University of Nottingham):
     A Generic Theory of Datatypes
* Peter Buneman (University of Edinburgh):
     Semi-Structured Data
* Roy Crole (University of Leicester):
     Categories and Types
* Jose Luiz Fiadeiro (University of Lisbon and ATX Software):
     Theory and Practice of Software Architecture
* Ralf Hinze (University of Bonn) and
   Johan Jeuring (University of Utrecht):
     Generic Haskell
* Martin Odersky (Ecole Polytechnique Federale de Lausanne):
     Object-Oriented and Functional Approaches to Compositional 
(Continue reading)

Lutz Schroeder | 4 Feb 15:06 2002

HOL and ML-Polymorphism

Coquand's 1986 paper `An analysis of Girard's paradox' contains the 
claim that the combination of Church-style higher order logic and 
ML-polymorphism is inconsistent because one can express the Burali-Forti 
paradox. Now, e.g., Isabelle/HOL does explicitly feature ML-polymorphism 
(and, of course, higher order logic), and its type checker eats terms
like "twice twice", where twice:: ('a => 'a) => ('a => 'a). This 
prompted us to risk a closer peek:

-- The derivation of the Burali-Forti paradox in the cited paper appears 
to be based on a type error in the sense that the two formulae that, due 
to the omission of explicit types, seem to contradict each other are in 
fact differently typed and hence not contradictory at all.

-- It seems that ML-polymorphism (in a *logic*) could be coded away by 
just replacing each polymorphic operator or axiom by infinitely many 
instances, one for each (proper) type, so that it's consistency would 
follow from that of the surrounding logic.

Are we missing something here? If not -- can anybody point us to related 


Lutz Schröder and Till Mossakowski


Lutz Schroeder                  Phone +49-421-218-4683
Dept. of Computer Science       Fax +49-421-218-3054
University of Bremen            lschrode@...
(Continue reading)


CP-2002: Call for Papers

                        Call for Papers

              Eighth International Conference On
       Principles and Practice of Constraint Programming

                     September 7 - 13, 2002
                         Ithaca, NY, USA


CP-2002 will be held at Cornell University in Ithaca. In addition to
the Technical programme, we are pleased to continue the Innovative
Applications programme and the Doctoral programme. CP-2002 will also
include a number of workshops. 


  April 26:          Deadline for submissions
  June 17:           Notifications
  July 1:            Camera-ready copy
  September 7 - 13:  Conference

These are strict deadlines. Papers arriving later than April 26 will
not be reviewed. Camera-ready copies arriving later than July 1st will
not be included in the proceedings.                             


(Continue reading)

P M Hill | 6 Feb 09:32 2002

Summer School on Computational Logic

Computational Logic (CL), the subject of the School, covers all
aspects of declarative programming both with and without types.  In
particular, being based on mathematical logic, systems and tools based
on CL are particularly amenable to type checking, inference and
reconstruction.  Note that, type inference is a well known application
of abstract interpretation which is one of the topics of the School's


[Please, accept our apologies if you receive multiple copies.]

       F I R S T   C A L L   F O R    P A R T I C I P A T I O N


          International Summer School on Computational Logic
                              ISCL 2002

                 Maratea (Italy), August 25-30, 2002



Computational Logic (CL), the topic of the School, has many
applications including the modeling of intelligent systems,
verification of software, and the support of systems for solving
(Continue reading)

Erik Poll | 6 Feb 13:57 2002

Call for Papers: Formal Techniques for Java-like Programs (FTfJP'2002)

                          CALL FOR PAPERS 

     workshop on Formal Techniques for Java-like Programs (FTfJP)

       in conjunction with ECOOP 2002, Mlaga, Spain, June 10-14


                Deadline for submissions : April 8

Formal techniques can help to analyze programs, to precisely describe
program behavior, and to verify program properties. Applying such
techniques to object-oriented technology is especially interesting

 1. The OO-paradigm forms the basis for the software component
    industry with their need for certification techniques.
 2. It is widely used for distributed and network programming.
 3. The potential for reuse in OO-programming carries over to
    reusing specifications and proofs.

Newer languages such as Java and C# provide a good platform to bridge
the gap between formal techniques and practical program development,
because of their reasonably clear semantics and standardized libraries.

Moreover, these languages are an interesting target for formal techniques,
because the novel paradigm for program deployment introduced with Java,
with its improved portability and mobility, opens up new possibilities
for abuse and causes concern about security.
(Continue reading)

etaps02.VERIMAG | 6 Feb 17:47 2002


      ***                                                    ***
      ***                    ETAPS 2002                      ***
      ***                 APRIL, 6-14, 2002                  ***
      ***                 GRENOBLE,  FRANCE                  ***
      ***                                                    ***
      ***                                                    ***
      ***               REGISTRATION IS NOW OPEN             ***
      ***                                                    ***
      ***                !!!! REGISTER NOW !!!!              ***
      ***                                                    ***

The European Joint Conferences on Theory and Practice of Software
ETAPS is a loose and open confederation of conferences and other
events that has become the primary European forum for academic and
industrial researchers working on topics relating to Software Science.

                     * http://www-etaps.imag.fr/  *

5 Conferences - 13 Satellite Events - 11 Tutorials - Tool Demonstrations

Main Conferences
(Continue reading)

Walid Taha | 12 Feb 14:31 2002

CFP Generators and Components (GCSE/SAIG'02)

                           CALL FOR PAPERS

             The First ACM SIGPLAN/SIGSOFT Conference on
               Generators and Components (GCSE/SAIG'02)

          Supported by the National Science Foundation (NSF)
                  Pittsburgh, PA, October 6-8, 2002.


Invited Speakers:

	* Neil Jones, University of Denmark
	* Catuscia Palamidessi, Penn State University
	* Janos Sztipanovits, Vanderbilt University

Program generation has the prospect of being an integral part of a
wide range of software development processes. Many recent studies
investigate different aspects of program generation, including their
semantics, their application, and their implementation. Existing
theories and systems address both high-level (source) language and
low-level (machine) language generation. A number of programming
languages now support program generation and manipulation, with
different goals, implementation techniques, and targeted at different
applications. The goal of this conference is to provide a meeting
place for researchers and practitioners interested in this topic.

A particular area of interest is component-based software development,
which bears the promise of considerable productivity increases to
(Continue reading)


ACM school on Internet security - call for participation

We do apologize for multiple copies of this message.

                       CALL FOR PARTICIPATION
                 ACM  State-of-the-Art Summer School 
                 on Foundations of Internet Security
                       September 14-23,  2002
                       Duszniki Zdroj, Poland

Organized by
  Institute of Computer Science, University of Wroclaw
with support of 
  Association for Computing Machinery, 
  Office of Naval Research International Field Office and 
  Microsoft Research

Programme Committee
  Fritz Henglein, IT University, Glentevej, Denmark
  Catherine A. Meadows, Naval Research Laboratory, USA
  Leszek Pacholski (chair), Univesity of Wroclaw, Poland
  Bart Preneel, Katholieke Universiteit Leuven, Belgium

Speakers by topics
verification of cryptographic protocols:
  Catherine A. Meadows, Naval Research Laboratory, USA
  Andrew D. Gordon, Microsoft Research, UK
practical cryptography:
  Bart Preneel, Katholieke Universiteit Leuven, Belgium
(Continue reading)