A. Hassan and A. , An algebraic semantics approach to the eeective resolution of type equations, Theoretical Computer Science, vol.45, pp.293-351, 1986.

. Akp91a, A. Hassan, A. Kaci, and . Podelski, Functional constraints in LIFE, PRL Research Report, vol.13, 1991.

. Akp91b, A. Hassan, A. Kaci, and . Podelski, Towards a meaning of LIFE, Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming, pp.255-274, 1991.

A. Hassan, A. Kaci, A. Podelski, and G. Smolka, A feature-based constraint system for logic programming with entailment, Proceedings of the 5th International Conference on Fifth Generation Computer Systems, pp.1012-1022, 1992.

R. Backofen and G. Smolka, A complete and recursive feature theory Research Report RR-92-30, German Research Center for Artiicial Intelligence (DFKI), 1992.

C. Carpenter, The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theoretical Computer Science, 1992.

H. Comon and C. Delors, Equational formula with membership constraints,. Rapport de recherche 648, LRI, 1991.

B. Courcelle, On Recognizable Sets and Tree Automata, Resolution of Equations in Algebraic Structures, Algebraic Techniques, pp.93-126, 1989.
DOI : 10.1016/B978-0-12-046370-1.50009-7

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle, Recognizable sets of unrooted trees, Tree Automata, Advances and Open Problems, 1992.

E. John and . Doner, Tree Acceptors and some of their applications, Journal of Comp. System Sci, vol.4, pp.406-451, 1970.

S. Eilenberg and . Automata, Language and Machine, volume A of Applied and Pure Mathematics, GS84] F. G ecseg and M. Steinby. Tree Automata. Akad emiai Kiadd o, 1974.

M. J. Mah88 and . Maher, Complete axiomatizations of the algebras of nite, rational and innnite trees, LICS, pp.348-457, 1988.

M. Nivat, Elements of a theory of tree codes, Tree Automata, Advances and Open Problems, 1992.

C. William and . Rounds, Set values for uniication-based grammar formalisms and logic programming, 1988.

G. Smolka, Feature-constraint logics for unification grammars, The Journal of Logic Programming, vol.12, issue.1-2, pp.51-87, 1992.
DOI : 10.1016/0743-1066(92)90039-6

G. Smolka and R. Treinen, Records for logic programming, Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 1992.
DOI : 10.1016/0743-1066(94)90044-2

J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-81, 1967.
DOI : 10.1007/BF01691346