Overview  |   Topics  |   Important dates  |   Submission and publication   |   Program Committee  |   Organization  |   Accepted Papers  


UNIF 2008 Poster 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 2008 is 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 software using unification as a strong component.

The 22nd International Workshop on Unification is colocated with the 19th International Conference on Rewriting Techniques and Applications, RTA 2008, organised as part of the RISC Summer 2008, which comprises five conferences, six workshops and the Training School in Symbolic Computation, and is followed by the 3rd International School on Rewriting in Obergurgl.

This workshop is the 22nd 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, USA). UNIF'07 (Paris, France). 


The meeting will include one invited talk (tentatively), contributed talks, and social time to discuss current topics of interest, which include (but are not limited to):
Unification Algorithms
Higher-Order Unification
String Unification
Context Unification
Combination problems
Typed Unification
Constraint Solving
Tree Descriptions
Type Checking and Type Inference
Automated Deduction
Functional and Logic Programming
Computational Linguistics

Important dates -- Deadline extended

Title & abstract May 5, 2008
Paper submission May 12, 2008
Notification -- (extended)  June 12, 2008
Final version June 23, 2008
Workshop July 18, 2008

Submission and Publication

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 using the UNIF'08 submission page, handled by the EasyChair conference system. Authors have been encouraged to use LaTeX2e and the Springer llncs class files.

Informal proceedings of accepted contributions is available on-line as the RISC Technical report 08-11.

Update of 2011: A special issue on the topics of the workshop has been published in the Logic Journal of the IGPL, Volume 19, issue 6, December 2011.

Program Committee

Rachid Echahed
LIG, CNRS, France
Temur Kutsia Johannes Kepler University of Linz, Austria
Mircea Marin University of Tsukuba, Japan (chair)
Paliath Narendran University at Albany -- SUNY, USA
Joachim Niehren
INRIA, Lille, France
Rafael del Vado Virseda Univ. Complutense de Madrid, Spain
Toshiyuki Yamada Mie University, Japan


Program Chair: Mircea Marin, University of Tsukuba, Japan
Local Chair: Temur Kutsia, RISC, Johannes Kepler University of Linz, Austria

Accepted Papers