About Conferences Colloquium Workshops Practical

UNIF 2007

21th International Workshop on Unification

Friday, June 29, 2007, Paris
Part of RDP'07

UNIF programme
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
    • E-unification
    • Unification Algorithms
    • Higher-Order Unification
    • String Unification
    • Context Unification
    • Nominal Unification
    • Combination problems
    • Disunification
    • Typed Unification
  • Related Topics
    • Constraint Solving
    • Tree Descriptions
    • Matching
    • Narrowing
  • Applications
    • Type Checking and Type Inference
    • Automated Deduction
    • Rewriting
    • Functional and Logic Programming
    • Grammars
    • Computational Linguistics
  • Implementations

    Program Chair

    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


    Authors are invited to submit by e-mail to Evelyne.Contejean_AT_lri.fr (replace _AT_ by @) 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.

    Authors have been encouraged to use LaTeX2e and the Springer llncs class files. Informal proceedings of accepted contributions will be available on-line.

    The UNIF Home Page
    webmaster at rdp07 dot org