E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren et al., An efficient algorithm for the configuration problem of dominance graphs, 12th ACM-SIAM Symposium on Discrete Algorithms, pp.815-824, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00536803

R. Backofen, J. Rogers, and K. Vijay-shanker, A first-order axiomatization of the theory of finite trees, Journal of Logic, Language and Information, vol.18, issue.4, pp.5-39, 1995.
DOI : 10.1007/BF01048403

M. Bodirsky, K. Erk, A. Koller, and J. Niehren, Beta Reduction Constraints, RTA'01, pp.31-46, 2001.
DOI : 10.1007/3-540-45127-7_5
URL : https://hal.archives-ouvertes.fr/inria-00536804

M. Bodirsky, K. Erk, A. Koller, and J. Niehren, Underspecified beta reduction, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.74-81, 2001.
DOI : 10.3115/1073012.1073023
URL : https://hal.archives-ouvertes.fr/inria-00536805

H. Comon, Completion of rewrite systems with membership constraints Symbolic Computation, pp.397-45392, 1998.

B. Courcelle, The monadic second-order logic of graphs XIII: Graph drawings with edge crossings, Theoretical Computer Science, vol.244, issue.1-2, pp.63-94, 2000.
DOI : 10.1016/S0304-3975(00)00180-8

M. Dalrymple, S. Shieber, and F. Pereira, Ellipsis and higher-order unification, Linguistics and Philosophy, vol.8, issue.1, pp.399-452, 1991.
DOI : 10.1007/BF00630923
URL : http://arxiv.org/abs/cmp-lg/9503008

C. Volker-diekert, C. Guterrez, and . Hagenah, The existential theory of equations with rational constraints in free groups is pspace-complete, STACS 2001, pp.170-182, 2001.

J. Doner, Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol.4, issue.5, pp.406-451, 1967.
DOI : 10.1016/S0022-0000(70)80041-1

D. Duchier and C. Gardent, Tree Descriptions, Constraints and Incrementality, Computing Meaning, pp.205-227, 2001.
DOI : 10.1007/978-94-010-0572-2_12
URL : https://hal.archives-ouvertes.fr/inria-00100450

M. Egg, A. Koller, and J. Niehren, The constraint language for lambda structures, Logic, Language, and Information, pp.457-485, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00536795

K. Erk, A. Koller, and J. Niehren, Processing underspecified semantic representations in the constraint language for lambda structures, Journal of Language and Computation, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00536796

K. Erk and J. Niehren, Parallelism Constraints, RTA'00, pp.110-126, 2000.
DOI : 10.1007/10721975_8
URL : https://hal.archives-ouvertes.fr/inria-00536808

A. Koller and J. Niehren, On underspecified processing of dynamic semantics, Proceedings of the 18th conference on Computational linguistics -, pp.460-466, 2000.
DOI : 10.3115/990820.990887
URL : https://hal.archives-ouvertes.fr/inria-00536810

A. Koller, J. Niehren, and R. Treinen, Dominance Constraints: Algorithms and Complexity, LACL'98, volume 2014 of LNAI, 2001.
DOI : 10.1007/3-540-45738-0_7
URL : https://hal.archives-ouvertes.fr/inria-00536812

J. Levy and M. Villaret, Linear Second-Order Unification and Context Unification with Tree-Regular Constraints, RTA'00, pp.156-171, 2000.
DOI : 10.1007/10721975_11

J. Levy and M. Villaret, Context Unification and Traversal Equations, RTA'01, pp.167-184, 2001.
DOI : 10.1007/3-540-45127-7_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.6227

P. Mitchell, D. Marcus, M. M. Hindle, and . Fleck, D-theory: Talking about talking about trees, Proceedings of the 21st ACL, pp.129-136, 1983.

J. Niehren and A. Koller, Dominance Constraints in Context Unification, Logical Aspects of Computational Linguistics, p.of LNAI, 1998.
DOI : 10.1007/3-540-45738-0_12
URL : https://hal.archives-ouvertes.fr/inria-00536820

J. Niehren and M. Villaret, On lambda binding, parallelism constraints and context unification, 2002.

J. Rogers and K. Vijay-shanker, OBTAINING TREES FROM THEIR DESCRIPTIONS: AN APPLICATION TO TREE-ADJOINING GRAMMARS, Computational Intelligence, vol.18, issue.4, pp.401-421, 1994.
DOI : 10.1111/j.1467-8640.1994.tb00005.x

M. Schmidt-schauß, A Decision Algorithm for Stratified Context Unification, Journal of Logic and Computation, vol.12, issue.6, 1999.
DOI : 10.1093/logcom/12.6.929

M. Schmidt-schauß and K. U. Schulz, Solvability of Context Equations with Two Context Variables is Decidable, CADE-16, LNAI, pp.67-81, 1999.
DOI : 10.1006/jsco.2001.0438

K. U. Schulz, Makanin's algorithm for word equations-two improvements and a generalization, Proceedings of the First International Workshop of Word Equations and Related Topics, 1992.
DOI : 10.1007/3-540-55124-7_4

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