. Ceci-implique-qu, (a) | a ? head * (A h ) \ head * (A 0 ) }). a / ? head * (A 0 ) donc a = head(A h ), par conséquent a est un type complexe Comme ?(a) = u et u ? ? args(u), il existe a ? ? args(a) tel que ?(a ? ) = u ? . Or a ? ? args * (A h ) et R est une règle par consommation obligatoire d'arguments, donc il existe i = h tel que A i = a ? , d'où t i = ?, p.par conséquent la propriété

M. Aizerman, E. Braverman, and L. Rozonoer, Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control, pp.821-837

A. Kasimir, Die syntaktische konnexität, Studia Philosophica, vol.1, pp.1-27

A. Dana, Inductive inference of formal languages from positive data, Information and Control, vol.48, pp.117-135

A. Dana, Queries and concept learning, Machine Learning, p.319

A. Dana and . Queries, Algorithmic Learning Theory, 12th International Conference Proceedings, volume 2225 de Lecture Notes in Artificial Intelligence, pp.12-31, 2001.

A. Dana and C. H. Smith, Inductive inference: Theory and methods, ACM Computing Surveys, vol.15, issue.3, pp.237-269

R. Krzysztof, . J. Apt, and L. Van, Logic programming Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapitre 10, pp.493-574

S. Arikawa, T. Shinohara, and A. Yamamoto, Learning elementary formal system, Theoretical Computer Science, vol.95, issue.1, pp.97-113
DOI : 10.1016/0304-3975(92)90068-Q
URL : http://doi.org/10.1016/0304-3975(92)90068-q

A. Jean-michel, Théorie des langages et des automates

Y. Bar-hillel, C. Gaifman, and E. Shamir, On categorial and phrase structure grammars, Bulletin of the Research Council of Israel, vol.9, pp.1-16

B. Yehoshua, A quasi-arithmetical notation for syntactic description

B. Denis, k-valued link grammars are learnable from strings, Proceedings of Formal Grammars 2003, pp.9-18

B. Denis, D. Alexander, A. Foret, M. G. Erwan, P. Jäger et al., On learning discontinuous dependencies from positive data, Proceedings of the 9th conference on Formal Grammar, pp.1-16, 2004.

B. Denis and F. Annie, Apprentissage des grammaires de lambek rigides et d'arité bornée pour le traitement automatique des langues, Actes de la Conférence d'APprentissage, 2003.

B. Jérôme and M. Jean-yves, Identification of reversible dependency tree languages . Dans Lubo? POPELÍNSKÝ et Miloslav NEPIL, réds, Proceedings of the 3d Workshop on Learning Language in Logic, pp.11-22

B. Jérôme and M. Jean-yves, Learning reversible categorial grammars from structures, Proceedings of Categorial Grammars, pp.148-163, 2004.

B. Jérôme and M. Jean-yves, Apprentissage de langages réguliers d'arbres et applications, Traitement Automatique des Langues, vol.44, issue.1, pp.121-153

M. Blum and L. Blum, Toward a mathematical theory of inductive inference, Information and Control, vol.28, issue.2, pp.125-155
DOI : 10.1016/S0019-9958(75)90261-2

B. Roberto, A study on learnability of rigid lambek grammars

B. Roberto, An Integrated Computational Approach to Binding Theory, Thèse de Doctorat

B. Roberto and R. Christian, Learning rigid lambek grammars and minimalist grammars from structured sentences, Proceedings of the 3d Workshop on Learning Language in Logic, pp.23-34

B. Joan, Lexical-Functional Syntax, Blackwell

B. Eric, A Corpus-Based Approach to Language Learning, Thèse de Doctorat

B. Wojciech, V. Johan, . Benthem, T. Alice, and . Meulen, Mathematical linguistics and proof theory Handbook of Logic and Language, pp.683-736

B. Wojciech and P. Gerald, Categorial grammars determined from linguistic data by unification

C. E. Claudia, R. Bach, D. Oehrle, and . Wheeler, Semantic categories and the development of categorial grammars Categorial Grammars and Natural Language Structures, pp.95-124

C. Noam, On certain formal properties of grammars, Info. and Control, vol.2, issue.2, pp.137-167

C. Stephen, J. Hockenmaier, and S. Mark, Building deep dependency structures using a wide-coverage CCG parser, pp.327-334

J. Cocke and J. T. Schwartz, Programming languages and their compilers : Preliminary notes. Rapport technique

C. Christophe, H. Véronique, G. De, and P. , Combinatory categorial grammars and finite elasticity, Proceedings of the Eleventh Belgian-Dutch Conference on Machine Learning, pp.13-18

C. Christophe, G. Florêncio-philippe-de, M. Glyn, and R. Christian, Consistent Identification in the Limit of the Class k-valued is NP-hard, 4th International Conference Proceedings, volume 2099 de Lecture Notes in Computer Science, pp.125-138, 2001.

C. P. Christophe, H. Adriaans, M. Fernau, and Z. Van, Consistent Identification in the Limit of Rigid Grammars from Strings is NP-hard, Grammatical Inference: Algorithms and Applications 6th International Colloquium: ICGI 2002, p.2484

C. Christophe and . Florêncio, Learning categorial grammars, Thèse de Doctorat

D. Elias and M. K. Warmuth, Membership for growing context-sensitive grammars is polynomial, JCSS: Journal of Computer and System Sciences, vol.33, pp.456-472

J. Dick-de and K. Makoto, Angluin's theorem for indexed families of r.e. sets and applications, COLT '96: Proceedings of the ninth annual conference on Computational learning theory, pp.193-204

C. De and L. Higuera, Characteristic sets for polynomial grammatical inference, Machine Learning, pp.125-138

C. De and L. Higuera, A bibliographical study of grammatical inference, Pattern Recognition, ????
URL : https://hal.archives-ouvertes.fr/ujm-00376590

M. Dekhtyar, A. M. Dikovsky, and . Moortgat, Categorial dependency grammars, Proceedings of Categorial Grammars, pp.76-91, 2004.
DOI : 10.1016/j.tcs.2015.01.043
URL : https://hal.archives-ouvertes.fr/hal-00416469

D. Alexandre, D. Kruiff, and . Duchier, Dependencies as categories, Proceedings of Workshop " Recent Advances in Dependency Grammars

D. Dudau-sofronie and I. Tellier, Un modèle d'acquisition de la syntaxe à l'aide d'informations sémantiques, actes de la 11ème Conférence TALN, Traitement Automatique du Langage Naturel, pp.137-146

D. Daniela, Apprentissage de grammaires catégorielles pour simuler l'acquisition du langage naturel à l'aide d'informations sémantiques, Thèse de Doctorat

D. Pierre and M. Laurent, Inférence grammaticale régulière : fondements théoriques et principaux algorithmes

J. Earley, An efficient context-free parsing algorithm, pp.94-102
DOI : 10.1145/357980.358005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.1808

F. Annie, L. Yannick, and . Nir, Lambek rigid grammars are not learnable from strings, 19th International Conference on Computational Linguistics, 2002.

F. Annie, L. Yannick, and . Nir, On limit points for some variants of rigid lambek grammars, ICGI'2002, the 6th International Colloquium on Grammatical Inference, number 2484 dans Lecture Notes in Artificial Intelligence

F. Mark, J. Sanjay, and O. Daniel, Open problems in systems that learn, Journal of Computer and System Sciences, vol.49, issue.3, pp.589-604

G. Jean-yves, Linear logic, Theoretical Computer Science, vol.50, pp.1-102

E. M. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474
DOI : 10.1016/S0019-9958(67)91165-5

S. A. Greibach, A New Normal-Form Theorem for Context-Free Phrase Structure Grammars, Journal of the ACM, vol.12, issue.1, pp.42-52
DOI : 10.1145/321250.321254

G. Dennis, L. John, and S. Daniel, A robust parsing algorithm for LINK grammars

M. Hepple, The Grammar and Processing of Order and Dependency: A Categorial Approach, Thèse de Doctorat

H. James, English is not a context-free language, Linguistic Inquiry, vol.15, issue.2, pp.225-234

H. Julia, Data and models for statistical parsing with Combinatory Categorial Grammar, Thèse de Doctorat

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation

J. Kent, Gold's theorem and cognitive science, Philosophy of Science, vol.71, pp.571-592

A. Joshi and Y. Schabes, Tree-Adjoining Grammars
DOI : 10.1007/978-3-642-59126-6_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.502

K. Makoto, A note on language classes with finite elasticity. Rapport technique CS- R9471, Centrum voor Wiskunde en Informatica (CWI), décembre ????

K. Makoto, Learnable classes of categorial grammars

K. Shyam, Computational Learning of Languages, Thèse de Doctorat

T. Kasami, An efficient recognition and syntax analysis algorithm for context-free languages

K. Kevin, Unification: A multidisciplinary survey, ACM Computing Surveys, vol.21, issue.1, pp.93-124

L. Joachim, The mathematics of sentence structure, American Mathematical Monthly, vol.65, pp.154-170

M. Gary, Negative evidence in language acquisition, Cognition, vol.46, pp.53-85

M. Igor and . Cuk, Dependency in linguistic description

M. Richard, Formal Philosophy: Selected Papers of Richard Montague

F. Edward, . C. Moore, J. Shannon, and . Mccarthy, Gedanken-experiments on sequential machines, Automata Studies, pp.129-153

M. Michael, Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus

M. Michael, V. Johan, . Benthem, T. Alice, and . Meulen, Categorial type logics Handbook of Logic and Language, pp.93-177

M. Michael and M. Richard, Cgn to grail: Extracting a type-logical lexicon from the cgn annotation, Proceedings of CLIN 2000. W. Daelemans, ????

M. Richard, A short introduction to grail, Proceedings of Methods for Modalities 2

M. R. Richard, M. Bernardi, and . Moortgat, Parsing corpus-induced type-logical grammars, Proceedings of the CoLogNet/ElsNet Workshop on Linguistic Corpora and Logic Based Grammar Formalisms

M. Erwan, Apprentissage des gramaires catégorielles et de dépendances : grammaires catégorielles avec itérations

M. Erwan, Apprentissage partiel de grammaires lexicalisées, Traitement Automatique des Langues (TAL), vol.45, issue.3, pp.71-102

M. M. Erwan and . Moortgat, From link grammars to categorial grammars, Proceedings of Categorial Grammars, pp.31-45, 2004.

M. G. Erwan, Y. Paliouras, and . Sakaki-bara, Partial learning using link grammars data Grammatical Inference: Algorithms and applications. 7th International Colloquium: ICGI, Lectures Notes in Artificial Intelligence, vol.3264, pp.211-222, 2004.

M. J. Erwan, P. Busquets, E. Blache, R. Stabler, and . Moot, Learnable classes of general combinatory grammars, 5th International Conference, LACL 2005, pp.189-204

M. Glyn, Type Logical Grammar: Categorial Logic of Signs

T. Motoki, T. Shinohara, and K. Wright, The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions, Proceedings of the Fourth Annual Workshop on Computational Learning Theory, p.375
DOI : 10.1016/B978-1-55860-213-7.50037-7

J. and N. Inria, Grammatical inference as unification

Y. Le and N. , Structures des analyses syntaxiques catégorielles Application à l'inférence grammaticale, Thèse de Doctorat

N. Daniel, . Osherson, S. Michael, and W. Scott, Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists

R. Parekh, V. Honavar-ming, L. Akira, and M. , Learning DFA from simple examples, Proceedings of the 8th International Workshop on Algorithmic Learning Theory (ALT-97), volume 1316 de LNAI, pp.116-131
DOI : 10.1007/3-540-63577-7_39

M. Pentus, Lambek calculus and formal grammars, Provability, Complexity, Grammars, number 192 dans American Mathematical Society Translations?Series 2, pp.57-86
DOI : 10.1090/trans2/192/02
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.8679

P. Mati, Lambek calculus is np-complete

P. Guy and G. Bertrand, Traitement automatique des langues -concepts et algorithmes, ????

S. Pinker, The Language Instinct: How the Mind Creates Language. HarperCollins
DOI : 10.1037/e412952005-009

P. Carl and S. Ivan, Head-Driven Phrase Structure Grammar

R. Christian, The logic of categorial grammars, pp.11-14, 2000.

R. Christian and S. Edward, Resource logics and minimalist grammars, Inria, Institut National de Recherche en Informatique et en Automatique

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41
DOI : 10.1145/321250.321253

S. Yasubumi, Recent advances of grammatical inference, Theoretical Computer Science, vol.185, issue.1, pp.15-45

S. Takeshi, Inductive inference from positive data is powerful, Proceedings of the Third Annual Workshop on Computational Learning Theory, pp.97-110

S. Takeshi, Inductive inference of monotonic formal systems from positive data, New Generation Computing, vol.8, issue.4, pp.371-384

S. Takeshi, Rich classes inferrable from positive data: Length-bounded elementary formal systems, Information and Computation, vol.108, p.175

S. Klaas, N. A. Anton, G. Salomaa, and . Ro-zenberg, Parsing of context-free languages Handbook of Formal Languages, Linear Modeling: Background and Application, pp.61-100

D. K. Daniel, . Sleator, and T. Davy, Parsing english with a link grammar

R. Smullyan, Theory of Formal Systems

D. Dudau, S. , I. Tellier, M. P. Tommasi, H. Adriaans et al., A tool for language learning based on categorial grammars and semantic information Grammatical Inference: Algorithms and Applications; 6th International Colloquium, LNCS/LNAI, vol.2484, pp.303-305, 2002.

S. Edward, . Derivational-minimalism, and R. Dans-christian, Logical Aspects of Computational Linguistics, pp.68-95

S. Mark, Combinatory grammars and parasitic gaps. Natural Language and Linguistic Theory, pp.403-439

S. Mark, The Syntactic Process

S. Mark and B. Jason, Combinatory categorial grammars, ????

T. Isabelle, Modéliser l'acquisition de la syntaxe du langage naturel via l'hypothèse de la primauté du sens, ????

T. Davy, S. Daniel, and L. John, Link grammar

T. Lucien, Elements de syntaxe structurale, Klincksieck

L. G. Valiant, A theory of the learnable, STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp.436-445

K. Wright, IDENTIFICATION OF UNIONS OF LANGUAGES DRAWN FROM AN IDENTIFIABLE CLASS, Proceedings of the Second Annual Workshop on Computational Learning Theory, pp.328-333
DOI : 10.1016/B978-0-08-094829-4.50026-X

H. Daniel and . Younger, Recognition and parsing of context-free languages in time n 3, Information and Control, vol.10, issue.2, pp.189-208

D. Terminologie and N. , 12 1.2.1 Préliminaires, 12 1.2.2 Substitutions et unification, p.14

.. Apprenabilité-des-grammaires-À-arguments-bornés, Grammaires combinatoires générales lexicalisées à argument bornés, p.138

.. Apprenabilité-des-grammaires-À-arguments-bornés, 140 5.3.3 Classes de R-grammaires à arguments bornés apprenables, p.147

R. Propriétés-des and ?. Avec-la-relation, 157 6.2.1 Types utiles et R-grammaires faiblement réduites, p.157

R. Applications, Classes de R-grammaires par consommation stricte d'arguments, p.186