From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from discorde.inria.fr (discorde.inria.fr [192.93.2.38]) by yquem.inria.fr (Postfix) with ESMTP id AE62EBC0A for ; Fri, 16 Mar 2007 15:12:40 +0100 (CET) Received: from ext.lri.fr (ext.lri.fr [129.175.15.4]) by discorde.inria.fr (8.13.6/8.13.6) with ESMTP id l2GECeR1029428 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO) for ; Fri, 16 Mar 2007 15:12:40 +0100 Received: from smtp.lri.fr (serveur3-5 [129.175.3.5]) by ext.lri.fr (Postfix) with ESMTP id 083DF2020B9 for ; Fri, 16 Mar 2007 15:12:40 +0100 (CET) Received: from serveur9-10.lri.fr (serveur9-10 [129.175.9.10]) by smtp.lri.fr (Postfix) with ESMTP id 77CEACED98; Fri, 16 Mar 2007 15:12:39 +0100 (CET) Received: from contejea by serveur9-10.lri.fr with local (Exim 3.36 #1 (Debian)) id 1HSDAd-0002z2-00; Fri, 16 Mar 2007 15:12:39 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Message-ID: <17914.42455.928898.913625@serveur9-10.lri.fr> Date: Fri, 16 Mar 2007 15:12:39 +0100 To: contejea@lri.fr, caml-list@inria.fr Subject: UNIF'07 first call for papers X-Mailer: VM 7.19 under Emacs 21.4.1 From: Evelyne Contejean X-Virus-Scanned: by amavisd-new at lri.fr X-Miltered: at discorde with ID 45FAA5D8.000 by Joe's j-chkmail (http://j-chkmail . ensmp . fr)! X-Spam: no; 0.00; evelyne:01 lri:01 unification:01 rdp:01 unification:01 rewriting:01 rdp:01 val:01 val:01 dagstuhl:01 higher-order:01 inference:01 rewriting:01 grammars:01 linguistics:01 [Apologies if you receive multiple copies] ************************************* * * * UNIF'07 FIRST CALL FOR PAPERS * * * * Deadline: April 23, 2007 * * * ************************************* UNIF'07 21th Int. Workshop on Unification A satellite workshop of RTA'07 and TLCA'07 Paris, France Friday, June 29, 2007 http://www.rdp07.org/unif.html UNIF is the main international meeting on unification. Unification is concerned with the problem of identifying given terms, either syntactically or modulo a given logical theory. Syntactic unification is the basic operation of most automated reasoning systems, and unification modulo theories can be used, for instance, to build in special equational theories into theorem provers. The aim of UNIF'07, as that of the previous meetings, is to to bring together people interested in unification, present recent (even unfinished) work, and discuss new ideas and trends in unification and related fields. This includes scientific presentations, but also descriptions of applications and softwares using unification as a strong component. In 2007, UNIF is organized as part of the 2007 Federated Conference on Rewriting, Deduction, and Programming (RDP 2007). This workshop is the twentyfirst in the series: UNIF'87 (Val D'Ajol, France), UNIF'88 (Val D'Ajol, France), UNIF'89 (Lambrecht, Germany), UNIF'90 (Leeds, England), UNIF'91 (Barbizon, France), UNIF'92 (Dagstuhl, Germany), UNIF'93 (Boston, USA), UNIF'94 (Val D'Ajol, France), UNIF'95 (Sitges, Spain), UNIF'96 (Herrsching, Germany), UNIF'97 (Orléans, France), UNIF'98 (Rome, Italy), UNIF'99 (Frankfurt, Germany), UNIF'00 (Pittsburgh, USA), UNIF'01 (Siena, Italy), UNIF'02 (Copenhagen, Denmark), UNIF'03 (Valencia, Spain), UNIF'04 (Cork, Ireland), UNIF'05 (Nara, Japan), UNIF'06 (Seattle, WA, USA). ------------------------------------------------------------------------------- Topics of Interest: The meeting will include invited talks, contributed talks, and social time to discuss current topics of interest, which include (but are not limited to): * Unification o E-unification o Unification Algorithms o Higher-Order Unification o String Unification o Context Unification o Nominal Unification o Combination problems o Disunification o Typed Unification * Related Topics o Constraint Solving o Tree Descriptions o Matching o Narrowing * Applications o Type Checking and Type Inference o Automated Deduction o Rewriting o Functional and Logic Programming o Grammars o Computational Linguistics * Implementations ------------------------------------------------------------------------------- Important Dates: April 23, 2007 Deadline for submission of papers, abstracts and system descriptions May 21, 2007 Notification of acceptance June 4, 2007 Deadline for final versions June 29, 2007 Workshop ------------------------------------------------------------------------------- Program Chair: Evelyne Contejean Laboratoire de Recherche en Informatique (LRI) CNRS et Université Paris-Sud, Orsay, France ------------------------------------------------------------------------------- Submission: Authors are invited to submit an abstract (1-5 pages), a paper (no longer than 15 pages), or a system description (no more than 5 pages) in Postscript or PDF format. Instructions will be published on the workshop webpage http://www.rdp07.org/unif.html. Authors have been encouraged to use LaTeX2e and the Springer llncs class files. Publication Informal proceedings of accepted contributions will be available on-line.