This is the text version of the file
http://www.lsv.ens-cachan.fr/~treinen/unif/past/unif01/unif2001.ps.gz.
G o o g l e automatically generates text versions of documents as we crawl
the web.
To link to or bookmark this page, use the following url:
http://www.google.com/search?q=cache:mA5xoX6cZFUC:www.lsv.ens-cachan.fr/~treinen/unif/past/unif01/unif2001.ps.gz++65+niehren+vazhenin+rozenblat&hl=en&ie=UTF-8


Google is not affiliated with the authors of this page nor responsible for
its content. 
These search terms have been highlighted:  65  niehren  vazhenin
rozenblat  
 
 

--------------------------------------------------------------------------------


UNIF 2001 15th International Workshop on Unification 

Abstracts 

June 18-19, 2001 

Siena, Italy 

Organizing Committee: 

Franz Baader Volker Diekert 


..................................


Non-Structural Subtype Entailment in Automata Theory : : : : : : : : : : : 65 Joachim
Niehren, Tim Priesnitz 




.................................




70 Joachim Niehren and Tim Priesnitz 18. F. Pottier. Type inference in the
presence of subtyping: from theory to practice. PhD 

thesis, Institut de Recherche d'Informatique et d'Automatique, 1998. 19.
J. Rehof. Minimal typings in atomic subtyping. In ACM Symposium on
Principles of 

Programming Languages. ACM Press, 1997. 20. J. Rehof. The Complexity of
Simple Subtyping Systems. PhD thesis, DIKU, Copen- 

hagen, 1998. 21. K. U. Schulz. Makanin's algorithm for word equations -
two improvements and a 

generalization. In Word Equations and Related Topics, LNCS 572, pages
85-150. Springer-Verlag, 1991. 22. Y. Vazhenin and B. Rozenblat.
Decidability of the positive theory of a free countably