M. Amblard, Réepresentations sémantiques pour les grammaires minimalistes, 2004.

S. Baauw and D. Delfitto, New views on reflexivity: Delay effects in acquisition , cross-modular principle b and reflexive clitics in romance, Probus, vol.2, issue.17, pp.145-184, 2005.

H. P. Barendregt, The lambda calculus (its syntax and semantics), 1984.

J. Barwise and J. Perry, Situations and Attitudes, The Journal of Philosophy, vol.78, issue.11, 1983.
DOI : 10.2307/2026578

P. Blackburn and J. Bos, Representation and inference for natural language : A first course in computational semantics, CSLI, 2005.

S. Boisen, Y. Chow, A. Haus, R. Ingria, S. Roukas et al., The BBN Spoken Language System, Proceedings of the workshop on Speech and Natural Language , HLT '89, pp.106-111, 1989.
DOI : 10.3115/100964.100970

D. Büring, Binding theory, Cambridge Textbooks in Linguistics, 2005.

G. Chierchia and S. Mcconnell-ginet, Meaning and grammar: An introduction to semantics, 2000.

N. Chomsky, Three models for the description of language, Three models for the description of language Lectures on government and binding, pp.113-124, 1956.
DOI : 10.1109/TIT.1956.1056813

N. Chomsky and G. A. Miller, Finite state languages, Information and Control, vol.1, issue.2, pp.91-112, 1958.
DOI : 10.1016/S0019-9958(58)90082-2

URL : http://doi.org/10.1016/s0019-9958(58)90082-2

M. Darlymple, S. Shieber, and F. Pereira, Ellipsis and higher-order unification, Linguistics and Philosophy, vol.14, issue.4, pp.339-452, 1991.

M. Egg, J. Niehren, P. Ruhrberg, and F. Xu, Constraints over lambda-structures in semantic underspecification, Proceedings of the Thirty-Sixth Annual Meeting of the ACL, pp.353-359, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00536807

D. Fox, Reconstruction, Binding Theory, and the Interpretation of Chains, Linguistic Inquiry, vol.8, issue.2, pp.157-198, 1999.
DOI : 10.1007/BF00166581

A. Giorgi, F. Pianesi, and G. Satta, A computational approach to Binding Theory, Proceedings of the 13th conference on Computational linguistics -, 1990.
DOI : 10.3115/991146.991168

J. Hale, The information-processing difficulty of incremental parsing, Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together, IncrementParsing '04, pp.58-65, 2004.
DOI : 10.3115/1613148.1613157

I. Heim, Anaphora and semantic interpretation: A reinterpretation of reinhart's approach, The Interpretive Tract (Percus and Sauerland, MIT Working Papers in Linguistics, 1993.

I. Heim and A. Kratzer, Semantics in generative grammar, 1998.

J. Hobbs, Resolving pronoun references, Resolving pronoun references, pp.311-338, 1978.
DOI : 10.1016/0024-3841(78)90006-2

URL : http://doi.org/10.1016/0024-3841(78)90006-2

J. P. Robert, D. Ingria, and . Stallard, A computational mechanism for pronominal reference, Proceedings of the 27th conference on Association for Computational Linguistics, pp.262-271, 1989.

R. Jackendoff, Semantic interpretation in generative grammar, 1972.

A. Joshi and Y. Shabes, Tree-adjoining grammars, Handbook of Formal Languages, 1997.

D. Jurafsky and J. Martin, Speech and language processing, 2000.

A. Kehler, A discourse copying algorithm for ellipsis and anaphora resolution, Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics -, pp.203-212, 1993.
DOI : 10.3115/976744.976769

E. Klein and I. Sag, Type-driven translation, Linguistics and Philosophy, vol.11, issue.2, pp.163-201, 1985.
DOI : 10.1007/BF00632365

S. Lappin and H. J. Leass, An algorithm for pronominal anaphora resolution, Computational Linguistics, vol.20, issue.4, pp.535-561, 1994.

A. Lecomte and C. Retoré, Extending Lambek grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, 2002.
DOI : 10.3115/1073012.1073059

D. Christopher, H. Manning, and . Shütze, Foundations of statistical natural language processing, 1999.

R. May, The grammar of quantification, 1977.

R. Montague, The proper treatment of quantification in ordinary english English as a formal language, Formal Philosophy: Selected Papers of Richard Montague, Edited and with an Introduction by, Formal Philosophy, pp.247-270, 1973.

M. Moortgat, Categorial investigations: Logical and linguistic aspects of Lambek calculus, 1988.

C. M. Papadimitriou, Computational complexity, 1994.

F. Pianesi, Indexing and referential dependencies within binding theory, Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics -, pp.39-44, 1991.
DOI : 10.3115/977180.977188

A. Manaster and R. , Review of The Language Complexity Game, Computational Linguistics, vol.21, issue.1, pp.124-131, 1995.

T. Reinhart, Anaphora and semantic interpretation Coreference and bound anaphora: a restatement of the anaphora questions, Strategies of anaphora resolution, Interface Strategies (Hans Bennis, M. Everaert , and E. Reuland, pp.47-88, 1983.

T. Reinhart and E. Reuland, Anaphors and logophors: an argument structure perspective, Long-distance Anaphora, pp.283-321, 1991.
DOI : 10.1017/cbo9780511627835.015

E. G. Ruys, The scope of indefinites, 1992.

P. Schlenker, Non-Redundancy: Towards a Semantic Reinterpretation of Binding Theory, Proceedings of the Amsterdam Colloquim, pp.1-92, 2003.
DOI : 10.1007/s11050-004-2440-1

URL : https://hal.archives-ouvertes.fr/ijn_00000467

M. Steedman, The syntactic process, 2000.