P. Henk and . Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, 1984.

P. De, G. , and S. Pogodalla, On the expressive power of abstract categorial grammars: Representing context-free formalisms, Journal of Logic, Language and Information, vol.13, issue.4, pp.421-438, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00112956

P. De and G. , Towards abstract categorial grammars, Proceedings 39th Annual Meeting and 10th Conference of the European Chapter, pp.148-155, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100529

P. De and G. , Tree-adjoining grammars as abstract categorial grammars, TAG+6, Proceedings of the sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, pp.145-150, 2002.

M. Dezani-ciancaglini, F. Honsell, and Y. Motohama, Compositional Characterizations of ??-Terms Using Intersection Types, Theoret. Comput. Sci, vol.340, issue.3, pp.459-495, 2005.
DOI : 10.1007/3-540-44612-5_26

G. Huet, The Zipper, Journal of Functional Programming, vol.7, issue.5, pp.549-554, 1997.
DOI : 10.1017/S0956796897002864

R. Montague, Formal Philosophy: Selected Papers of Richard Montague, 1974.

S. Salvati, Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ??-Calculus, to be published in the proceedings of the 17th International Conference on Rewriting Techniques and Applications, 2006.
DOI : 10.1007/11805618_12
URL : https://hal.archives-ouvertes.fr/inria-00334006

Y. Schabes and A. K. Joshi, An earleytype parsing algorithm for tree adjoining grammars Association for Computational Linguis- tics, Proceedings of the 26th annual meeting on Association for Computational Linguistics, pp.258-269, 1988.

M. Stuart, Y. Shieber, F. C. Schabes, and . Pereira, Principles and implementation of deductive parsing, Journal of Logic Programming, vol.24, issue.12, pp.3-36, 1995.